• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.189-197
• /
• 1999

Assembly line balancing problem is known as one of difficult combinatorial optimization problems. This problem has been solved with linear programming, dynamic programming approaches. but unfortunately these approaches do not lead to efficient algorithms. Recently, genetic algorithm has been recognized as an efficient procedure for solving hard combinatorial optimization problems, but has a defect that requires long-run time and computational complexties to find the solution. For this reason, we adapt a new method called the Critical Node Method that is intuitive, easy to understand, simple for implementation. Fuzzy set theory is frequently used to represent uncertainty of information. In this paper, to treat the data of real world problems we use a fuzzy number to represent the duration and Critical Node Method based heuristic procedure is developed for solving fuzzy assembly line balancing problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.32 no.10
• /
• pp.836-843
• /
• 2008

An efficient domain/boundary decomposition method is applied for heat transfer problems with non-linear thermal radiation boundaries. The whole domain of solids or structures is considered as set of subdomains, an interface, and radiation interfaces. In a variational formulation, simple penalty functions are introduced to connect an interface or radiation interfaces with neighboring subdomains that satisfy continuity conditions. As a result, non-linear finite element computations due to the thermal radiation boundaries can be localized within a few subdomains or radiation interfaces. Therefore, by setting up suitable solution algorithms for the governing finite element equations, the computational efficiency can be improved considerably. Through a set of numerical examples, these distinguishing characteristics of the present method are investigated in detail.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.73-84
• /
• 2004

This paper suggests a new scalar multiplication algerian to resist SPA which threatens the security of cryptographic primitive on the hardware recently, and discusses how to apply this algerian Our algorithm is better than other SPA countermeasure algorithms aspect to computational efficiency. Since known SPA countermeasure algorithms have dependency of computation. these are difficult to construct parallel architecture efficiently. To solve this problem our algorithm removes dependency and computes a multiplication and a squaring during inversion with parallel architecture in order to minimize loss of performance. We implement hardware logic with VHDL(VHSIC Hardware Description Language) to verify performance. Synthesis tool is Synplify Pro 7.0 and target chip is Xillinx VirtexE XCV2000EFGl156. Total equivalent gate is 60,508 and maximum frequency is 30Mhz. Our scalar multiplier can be applied to digital signature, encryption and decryption, key exchange, etc. It is applied to a embedded-micom it protects SPA and provides efficient computation.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method. VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL (Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method -VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.847-862
• /
• 2015

Typical base isolated buildings are designed so that the superstructure remains elastic in design-level earthquakes, though the isolation layer is often quite nonlinear using, e.g., hysteretic elements such as lead-rubber bearings and friction pendulum bearings. Similarly, other well-performing structural control systems keep the structure within the linear range except during the most extreme of excitations. Design optimization of these isolators or other structural control systems requires computationally-expensive response simulations of the (mostly or fully) linear structural system with the nonlinear structural control devices. Standard nonlinear structural analysis algorithms ignore the localized nature of these nonlinearities when computing responses. This paper proposes an approach for the computationally-efficient optimal design of passive isolators by extending a methodology previously developed by the authors for accelerating the response calculation of mostly linear systems with local features (linear or nonlinear, deterministic or random). The methodology is explained and applied to a numerical example of a base isolated building with a hysteretic isolation layer. The computational efficiency of the proposed approach is shown to be significant for this simple problem, and is expected to be even more dramatic for more complex systems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.2
• /
• pp.303-311
• /
• 2012

In this study, we introduce a dynamic process model as well as the design methodology of optimized fuzzy controller for its efficient application to vacuum production system to produce a semiconductor, solar module and display and so on. In a vacuum control field, PID control method is widely used from the viewpoint of simple structure and preferred performance. But, PID control method is very sensitive to the change of environment of control system as well as the change of control parameters. Therefore, it's difficult to get a preferred performance results from target system which has a complicated structure and lots of nonlinear factors. To solve such problem, we propose the design methodology of an optimized fuzzy PID controller through a following series of steps. First a dynamic characteristic of the target system is analyzed through a series of experiments. Second the process model is built up and its characteristic is compared with real process. Third, the optimized fuzzy PID controller is designed using genetic algorithms. Finally, the fuzzy controller is applied to target system and then its performance is compared with that of other conventional controllers(PID, PI, and Fuzzy PI controller). The performance of the proposed fuzzy controller is evaluated in terms of auto-tuned control parameters and output responses considered by ITAE index, overshoot, rise time and steady state time.