• Proceedings of the KSR Conference
• /
• 1998.11a
• /
• pp.280-287
• /
• 1998

In this paper, Dynamic Fault Tree algorithm(DFT algorithm) is presented. This new algorithm provides a concise representation of dynamic fault tolerance system structure with redundancy, dynamic redundancy management and complex fault ＆ error recovery techniques. And it allows the modeler to define a dynamic fault tree model with the relative advantages of both fault tree and Markov models that captures the system structure and dynamic behavior. This algorithm applies to TMR and Dual-Duplex systems with the dynamic behavior and show that this algorithm captured the dynamic behavior in these systems with fault ＆ error recovery technique, sequence-dependent failures and the use dynamic spare. The DFT algorithm for solving the problems of the systems is more effective than the Markov and Fault tree analysis model.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.54-64
• /
• 1997

In this paper, a method of dynamic modeling and a dynamic control of a mobile robot are presented to show the superiority of the dynamic control comparing to the PD control. This dynamic model is derived from the cartesian coordinates using lagrange equations. Based upon the derived dynamic model, we implemented the dynamic control of the mobile robot using the computed torque method. Time varying non-linear friction terms are not incroporated in this dynamic model. Instead, those are considered as disturbances. This uncertainty in dynamic model of mobile robot is compensated by the outer loop controller using PD algorithm. The validity of this model and the control algorithm are confirmed through the experiments, where the dynamic control algorithm demonstrated robust velocity tracking performance against the unmodeled non-linear frictions. The superiority of this algorithm is demonstrated by comparing to classical PD control algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.3
• /
• pp.651-656
• /
• 2010

This paper proposes a new dynamic PCA algorithm to recognize types of electric poles, which is necessary for a mobile robot moving along the neutral line for inspecting high-voltage facilities. Since the mobile robot needs to pass over the electric poles and grasp the neutral wire again for the next region inspection, the detection of the electric pole type is a critical factor for the successful passing-over the electric pole. The CCD camera installed on the mobile robot captures the image of the electric pole while it is approaching to the electric pole. Applying the dynamic PCA algorithm to the CCD image, the electric pole type has been classified to provide the stable grasping operation for the mobile robot. The new dynamic PCA algorithm replaces the reference image in real time to improve the robustness of the PCA algorithm, adjusts the brightness to get the clear images, and applies the Laplacian edge detection algorithm to increase the recognition rate of electric pole type. Through the real experiments, the effectiveness of this proposed dynamic PCA algorithm method using Laplacian edge detecting method has been demonstrated, which improves the recognition rate about 20% comparing to the conventional PCA algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1546-1554
• /
• 1999

In this paper, Dynamic Fault Tree algorithm(DFT algorithm) is presented. This algorithm provides a concise representation of dynamic fault tolerance system including fault recovery techniques with fault detection, mask and switching function. And this algorithm define FDEP, CSP, SEQ, PAG gate which captures the dynamic characteristics of system. It show that this algorithm solved the constraints to satisfy the dynamic characteristics of system which there are in Markov and also this is able to satisfy the dynamic characteristics of system which there are in Markov and also this is able to covered the disadvantage of Fault tree methods. To show the key advantage of this algorithm, a traditional method, that is, Markov and Fault Tree, applies to TMR and Dual-Duplex systems with the dynamic characteristic and a presented method applies to those. He results proved that the DFT algorithm for solving the problems of the system is more effective than the Markov and Fault tree analysis model..

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1262-1269
• /
• 2003

In structural optimization, static loads are generally utilized although real external forces are dynamic. Dynamic loads have been considered in only small-scale problems. Recently, an algorithm for dynamic response optimization using transformation of dynamic loads into equivalent static loads has been proposed. The transformation is conducted to match the displacement fields from dynamic and static analyses. The algorithm can be applied to large-scale problems. However, the application has been limited to size optimization. The present study applies the algorithm to shape optimization. Because the number of degrees of freedom of finite element models is usually very large in shape optimization, it is difficult to conduct dynamic response optimization with the conventional methods that directly threat dynamic response in the time domain. The optimization process is carried out via interfacing an optimization system and an analysis system for structural dynamics. Various examples are solved to verify the algorithm. The results are compared to the results from static loads. It is found that the algorithm using static loads transformed from dynamic loads based on displacement is valid even for very large-scale problems such as shape optimization.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1363-1370
• /
• 2003

In structural optimization, static loads are generally utilized although real external forces are dynamic. Dynamic loads have been considered in only small-scale problems. Recently, an algorithm for dynamic response optimization using transformation of dynamic loads into equivalent static loads has been proposed. The transformation is conducted to match the displacement fields from dynamic and static analyses. The algorithm can be applied to large-scale problems. However, the application has been limited to size optimization. The present study applies the algorithm to shape optimization. Because the number of degrees of freedom of finite element models is usually very large in shape optimization, it is difficult to conduct dynamic response optimization with the conventional methods that directly threat dynamic response in the time domain. The optimization process is carried out via interfacing an optimization system and an analysis system for structural dynamics. Various examples are solved to verify the algorithm. The results are compared to the results from static loads. It is found that the algorithm using static loads transformed from dynamic loads based on displacement is valid even for very large-scale problems such as shape optimization.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.803-811
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However, dynamic programming cannot be applied to certain cost function due to its drawback and cannot be used to produce optimal multiple sequence alignment. We propose sub-alignment refinement algorithm to overcome the problem of dynamic programming. Also we show proposed algorithm can solve the problem of dynamic programming efficiently.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.189-199
• /
• 1999

This paper presents an optimization algorithm for a stable Self Dynamic Neural Network(SDNN) using genetic algorithm. Optimized SDNN is applied to a problem of controlling nonlinear dynamical systems. SDNN is dynamic mapping and is better suited for dynamical systems than static forward neural network. The real-time implementation is very important, and thus the neuro controller also needs to be designed such that it converges with a relatively small number of training cycles. SDW has considerably fewer weights than DNN. Since there is no interlink among the hidden layer. The object of proposed algorithm is that the number of self dynamic neuron node and the gradient of activation functions are simultaneously optimized by genetic algorithms. To guarantee convergence, an analytic method based on the Lyapunov function is used to find a stable learning for the SDNN. The ability and effectiveness of identifying and controlling a nonlinear dynamic system using the proposed optimized SDNN considering stability is demonstrated by case studies.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.