• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.149-152
• /
• 2002

The aim of this study is to analyse the problems occurred by using classical algorithm to synthesize the H$\infty$ optimal controller. The obtained result of analysis applied to the composition of algorithm for the new H$\infty$ optimal controller which was introduced in this study. The study investigates and compares H$\infty$ optimal controller formed by new algorithm with the one formed by classical algorithm. In particular, robustness related to the robust control is systematically described by using the composition of algorithm for the classical H$\infty$ optimal controller. In addition, the flow charts classified into classical algorithm and new one are discussed to synthesize the H$\infty$ optimal controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1106-1127
• /
• 2012

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

• Journal of The Korean Association of Information Education
• /
• v.24 no.1
• /
• pp.11-19
• /
• 2020

Software education is provided for 6th grade students. This study explored the algorithmic composition patterns of elementary school students. After investigating the algorithm for the 6th grade students, the algorithmic pattern of the learner was explored by calculating the cyclomatic complexity of MacCabe based on the structural programming technique. Students often use one or two choice structures to solve problems, which tend to be biased towards the starting and ending points of the problem. It is also passive in the use of selection structures. Algorithm composition depends on visible objects and one's own background. Therefore, in elementary school software education, it is necessary to present the task of thinking about the algorithm structure in the context of the algorithm and the students' experiences in accordance with the algorithm composition pattern.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.254-265
• /
• 1994

For solving the optimal routing problem (ORP) in large data networks, and algorithm called the hierarchical aggregation/disaggregation and decomposition/composition gradient project (HAD-GP) algorithm os proposed. As a preliminary work, we improve the performance of the original iterative aggregation/disaggregation GP (IAD-GP) algorithm introduced in [7]. THe A/D concept used in the original IAD-GP algorithm and its modified version naturally fits the hierarchical structure of large data networks and we would expect speed-up in convengence. The proposed HAD-GP algorithm adds a D/C step into the modified IAD-GP algorithm. The HAD-GP algorithm also makes use of the hierarchical-structure topology of large data networks and achieves significant improvement in convergence speed, especially under a distributed environment. The speed-up effects are demonstrated by the numerical implementations comparing the HAD-GP algorithm with the (original and modified) IAD-GP and the ordinary GP (ORD-GP) algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3293-3311
• /
• 2015

Cloud services are required to be composed as a single service to fulfill the workflow applications. Service composition in Cloud raises new challenges caused by the diversity of users with different QoS requirements and vague preferences, as well as the development of cloud computing having geographically distributed characteristics. So the selection of the best service composition is a complex problem and it faces trade-off among various QoS criteria. In this paper, we propose a Cloud service composition approach based on evolutionary algorithms, i.e., NSGA-II and MOPSO. We utilize the combination of multi-objective evolutionary approaches and Decision-Making method (AHP) to solve Cloud service composition optimization problem. The weights generated from AHP are applied to the Crowding Distance calculations of the above two evolutionary algorithms. Our algorithm beats single-objective algorithms on the optimization ability. And compared with general multi-objective algorithms, it is able to precisely capture the users' preferences. The results of the simulation also show that our approach can achieve a better scalability.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1819-1826
• /
• 1996

This paper present the claculating method of optimum correction mass within permissible vibration linits for ratating machinery in two-plane field balancing. Basic technique of this method is based on influence coefficient method, and grphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanism of natural selection and natural genetics is sued for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.195-202
• /
• 1995

This paper presents the calculating method of optimum correction mass within permissible vibration limits for rotating machinery in two-plane field balancing. Basic technique of this method based on influence coefficient method, is graphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanics of natural selection and natural genetics is used for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.889-898
• /
• 2005

Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.569-572
• /
• 2002

In this study, a real-time image composition system was implemented using chroma key algorithm. To write a high Quality chroma key function based on processing of foreground and/or background frames before combining them into an output image, Adaptive 3-dimensional surface equation model was proposed. When the bright of room is changed or shadow of object is on the blue screen, proposed algorithm would still produce good result.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.87-93
• /
• 2007

In the component based software development, it is very important to interface between modules of component. Almost of existing method, Connectors are deal with all communication channels between two or more components/interfaces by RPC(Remote procedure call) and event call. But these process has limits when component send a lot of request call to other component through connector. That is, we need more efficient interface method that connector can process multi request call. In this paper, I propose interaction scheduling algorithm using message queue in the connector. For this purpose, I use message buffer which operate to save and load message temporarily.