• Communications for Statistical Applications and Methods
• /
• 제3권2호
• /
• pp.299-307
• /
• 1996

This article is concerned with the algorithms for the least median of squares estimator. An algorithm based on the $L{\infty}$ .inf.-estimation procedure is proposed in an attempt to improve the optimality of the estimate. And it is shown that the proposed algorithm yields more optimal estimate than the traditional resampling algorithms. The proposed algorithm employs a linear scaling transformation at each iteration of the$L{\infty}$-algorithm to deal with its computational inefficiency problem.

• Journal of Mechanical Science and Technology
• /
• 제16권8호
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.281-284
• /
• 2004

This paper presents the design and implementation of a QoS based enhanced collaboration system in MDO. This is an efficient distributed communication tool between designers. It supports text communication, audio/video communication, file transfer and XML data sending/receiving. Specially, this system supports a dynamic QoS self-adaptation by using the improved direct adjustment algorithm (DAA+). The original direct adjustment algorithm adjusts the transmission rate according to the congestion level of the network, based on the end to end real time transport protocol (RTP), and controls the transmission rate by using the information of loss ratio in real time transport control protocol (RTCP). But the direct adjustment algorithm does not consider when the RTCP packets are lost. We suggest an improved direct adjustment algorithm to solve this problem. We apply our improved direct adjustment algorithm to our of QoS (Quality of Service) [1] based collaboration system and show the improved performance of transmission rate and loss ratio.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.1916-1917
• /
• 2011

A development of a new moving obstacle avoidance algorithm using a delay-time Compensation for a network-based autonomous mobile robot is proposed in this paper. The moving obstacle avoidance algorithm is based on a Kalman filter through moving obstacle estimation and a Bezier curve for path generation. And, the network-based mobile robot, that is a unified system composed of distributed environmental sensors, mobile actuators, and controller, is compensated by a network delay compensation algorithm for degradation performance by network delay. The network delay compensation method by a sensor fusion using the Kalman filter is proposed for the localization of the robot to compensate both the delay of readings of an odometry and the delay of reading of environmental sensors. Through some simulation tests, the performance enhancement of the proposed algorithm in the viewpoint of efficient path generation and accurate goal point is shown here.

• 대한산업공학회지
• /
• 제20권1호
• /
• pp.133-146
• /
• 1994

Conditional constraints are frequently used to represent relations. To use these conditional constraints, it is necessary to develop an appropriate logic in which these conditional constraints can be represented and manipulated. Nevertheless, there has been little research that addresses interval-based conditional constraints. The proposed approach addresses the use of conditional constraints involving intervals in constraint networks. Two algorithms are presented: (1) a propagation algorithm for an interval-based conditional constraint, which is similar to one for an exact-value conditional constraint; (2) a propagation algorithm for interval-based conditional constraints which satisfy some conditions. The former can be applied to any conditional constraint. However, with the former algorithm, conditional constraints are usually categorized into the cases that they cannot be propagated. After investigating several methods in which most conditional constraints can be propagated, we propose the latter algorithm under certain condition that usually results in smaller resulting design space comparing to the former.

• 한국경영과학회지
• /
• 제27권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권3호
• /
• pp.191-193
• /
• 2005

This paper proposes a phase measurement algorithm which is based on the recursive implementation of sliding-DFT. The proposed algorithm is designed to have a robust behavior against the erroneous factors of frequency drift, additive noise, and twiddle factor approximation. Four channel power-line phase measurement system is also designed and implemented based on the time-multiplexed sharing architecture of the proposed algorithm. The proposed algorithm's features of phase measurement accuracy and its robustness against the finite wordlength effects can provide a significant impact especially for the ASIC or microprocessor based embedded system applications where the enhanced processing speed and implementation simplicity are crucial design considerations.

• The Journal of the Acoustical Society of Korea
• /
• 제17권1E호
• /
• pp.36-43
• /
• 1998

A fuzzy logic filter is constructed from a set of fuzzy IF-THEN rules which change adaptively to minimize some criterion function as new information becomes available. This paper generalizes the fuzzy logic filter and it's adaptive filtering algorithm to include complex parameters and complex signals. Using the complex Stone-Weierstrass theorem, we prove that linear combinations of the fuzzy basis functions are capable of uniformly approximating and complex continuous function on a compact set to arbitrary accuracy. Based on the fuzzy basis function representations, a complex orthogonal least-squares (COLS) learning algorithm is developed for designing fuzzy systems based on given input-output pairs. Also, we propose an adaptive algorithm based on LMS which adjust simultaneously filter parameters and the parameter of the membership function which characterize the fuzzy concepts in the IF-THEN rules. The modeling of a nonlinear communications channel based on a complex fuzzy is used to demonstrate the effectiveness of these algorithm.

• 제어로봇시스템학회논문지
• /
• 제7권2호
• /
• pp.131-137
• /
• 2001

Traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on only particular domian. Hybridizing a genetic algorithm with other algorithms can produce better performance than both the genetic algorithm and the other algorithms. This paper describes the application of random signal-based learning to a genetic algorithm in order to get well tuned fuzzy rules. The key of tis approach is to adjust both the width and the center of membership functions so that the tuned rule-based fuzzy controller can generate the desired performance. The effectiveness of the proposed algorithm is verified by computer simulation.

• 대한전자공학회논문지TC
• /
• 제48권11호
• /
• pp.28-34
• /
• 2011

최근 들어 CDMA 기반 시스템에서 고속 데이터 서비스 지원을 위한 수신 성능 개선 방법의 하나로 chip-level equalization 기법에 대한 연구가 활발히 진행되고 있다. 이와 관련된 연구의 하나로 본 논문에서는 D-TxAA (dual stream transmit antenna array) 방식을 사용하는 HSDPA MIMO 시스템에 적용 가능한 Griffiths algorithm 기반 chip-level 적응 LMMSE equalizer의 구조를 제안하고자 한다. 먼저 Griffiths 알고리즘을 D-TxAA 방식에 적용할 경우 사용 가능한 두 가지 형태의 적응 LMMSE equalizer 구조를 유도할 것이며, 여러 채널 환경에 대한 컴퓨터 모의실험을 통해 두 수신기의 성능을 비교 분석하고자 한다.