• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.4
• /
• pp.467-475
• /
• 2016

Ultrasonic propagation imaging (UPI) has shown great potential for detection of impairments in complex structures and can be used in wide range of non-destructive evaluation and structural health monitoring applications. The software implementation of such algorithms showed a tendency in time-consumption with increment in scan area because the processor shares its resources with a number of programs running at the same time. This issue was addressed by using field programmable gate arrays (FPGA) that is a dedicated processing solution and used for high speed signal processing algorithms. For this purpose, we need an independent and flexible block of logic which can be used with continuously evolvable hardware based on FPGA. In this paper, we developed an FPGA-based ultrasonic propagation imaging system, where FPGA functions for both data acquisition system and real-time ultrasonic signal processing. The developed UPI system using FPGA board provides better cost-effectiveness and resolution than digitizers, and much faster signal processing time than CPU which was tested using basic ultrasonic propagation algorithms such as ultrasonic wave propagation imaging and multi-directional adjacent wave subtraction. Finally, a comparison of results for processing time between a CPU-based UPI system and the novel FPGA-based system were presented to justify the objective of this research.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.4
• /
• pp.481-488
• /
• 2008

This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.

• Wind and Structures
• /
• v.11 no.6
• /
• pp.497-512
• /
• 2008

In this paper, optimum methods of wind-induced vibration control of high-rise buildings are mainly studied. Two optimum methods, genetic algorithms (GA) method and Rayleigh damping method, are firstly employed and proposed to perform optimum study on wind-induced vibration control, six target functions are presented in GA method based on spectrum analysis. Structural optimum analysis programs are developed based on Matlab software to calculate wind-induced structural responses. A high-rise steel building with 20-storey is adopted and 22 kinds of control plans are employed to perform comparison analysis to validate the feasibility and validity of the optimum methods considered. The results show that the distributions of damping coefficients along structural height for mass proportional damping (MPD) systems and stiffness proportional damping (SPD) systems are entirely opposite. Damping systems of MPD and GAMPD (genetic algorithms and mass proportional damping) have the best performance of reducing structural wind-induced vibration response and are superior to other damping systems. Standard deviations of structural responses are influenced greatly by different target functions and the influence is increasing slightly when higher modes are considered, as shown fully in section 5. Therefore, the influence of higher modes should be considered when strict requirement of wind-induced vibration comfort is needed for some special structures.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.335-345
• /
• 2005

In personalized marketing, it is important to maximize customer satisfaction and marketing efficiency. As personalized campaigns are frequently performed, several campaigns are frequently run simultaneously. The multiple recommendation problem occurs when we perform several personalized campaigns simultaneously. This implies that some customers may be bombarded with a considerable number of campaigns. We raise this issue and formulate the multi-campaign assignment problem to solve the issue. We propose dynamic programming method and various heuristic algorithms for solving the problem. With field data, we also present experimental results to verify the importance of the problem formulation and the effectiveness of the proposed algorithms.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.252-256
• /
• 1998

Accurate mapping of satellite images is one of the most important Parts in many remote sensing applications. Since the position and the attitude of a satellite during image acquisition cannot be determined accurately enough, it is normal to have several hundred meters' ground-mapping errors in the systematically corrected images. The users which require a pixel-level or a sub-pixel level mapping accuracy for high-resolution satellite images must use a number of Ground Control Points (GCPs). In this paper, the performance of two geometric correction algorithms is tested and compared. One is the polynomial warping algorithm which is simple and popular enough to be implemented in most of the commercial satellite image processing software. The other is full camera modelling algorithm using Physical orbit-sensor-Earth geometry which is used in satellite image data receiving, pre-processing and distribution stations. Several criteria were considered for the performance analysis : ultimate correction accuracy, GCP representatibility, number of GCPs required, convergence speed, sensitiveness to inaccurate GCPs, usefulness of the correction results. This paper focuses on the usefulness of the precision correction algorithm for regular image pre-processing operations. This means that not only final correction accuracy but also the number of GCPs and their spatial distribution required for an image correction are important factors. Both correction algorithms were implemented and will be used for the precision correction of KITSAT-3 images.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.625-634
• /
• 2002

Cryptography is the methods of making and using secret writing that is necessary to keep messages private between two parties. Cryptography is compute-intensive algorithm and needs cpu resource excessively. To solve these problems, there exists hardware approach that implements cryptographic algorithm with hardware chip. In this paper, we presents the design and implementation of cryptographic hardware and compares its performance with software cryptographic algorithms. The experimental result shows that the hardware approach causes high I/O overheads when it transmits data between cryptographic board and host cpu. Hence, low complexity cryptographic algorithms such as DES does not improve the performance. But high complexity cryptographic algorithms such as Triple DES improve the performance with a high rate, roughly from two times to Sour times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.570-577
• /
• 2014

Range-based real time localization systems require superior localization techniques as well as accurate ranging algorithms for better performance. To evaluate the ranging accuracy between two nodes in practical environments, this paper does not only present a qualitative analysis by computing a distance equation under SDS-TWR measurement model of no symmetry assumption, but also executes a quantitative evaluation by doing experiments after building up a test network employing the developed sensor node. Experimental results show that the ranging accuracy of the proposed implementation of IEEE 802.15.4a software stack is superior with smaller average error rate by 60% to one of the commercial Nanotron's reference development kit.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.326-334
• /
• 1999

There are the fault tolerance technology and the fault avoidance technology to analyze and evaluate the performance of computer system. To improve the relibility of software The N-Version Programming (NVP) technology is known to be the most objective and quantitive. However, when discrete probability distribution is used as estimation model, the values of it's component reliability should be same. In this paper, to resolve this problem, we adapted the genetic algorithms to NVP technology and implement the optimized simulate. and the results were analyzed and estimated. Through this study, we could optimize the reliability of each component and estimate the optimum count in the system reliability.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.9
• /
• pp.172-178
• /
• 1999

3D linear and circular interpolations are a basic part for the machining of complex shapes. Until now, because of the absence of appropriate algorithms for the generation of 3D lines and circles, a full accomplishment for available machine tool resolution is difficult. this paper presents new algorithms for 3D linear and circular interpolation in the reference pulse technique. In 3D space, the line or circle is not expressed as an implicit function, it is only defined as the intersection of two surfaces. A 3D line is defined as the intersection of two planes, and a 3D circle is defined as the intersection of a plane and the surface of a sphere. Based on these concepts, interpolation algorithms are designed to follow intersection curves in 3D space, and a real-time 3D linear and circular interpolator was developed in software using a PC. The algorithm implemented in a PC showed promising results in interpolation error and speed performance. It is expected that it can be applied to the next generation computerized numerical control systems for the machining of 3D lines, circles and some other complex shapes.