• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.187-194
• /
• 2003

Main Memory storage system can increase the performance of the system by assigning enough slack time to real-time transactions. Due to its high response time of main memory devices, main memory resident data management systems have been used for location management of personal mobile clients to cope with urgent location related operations. In this paper we have developed a multi-threaded main memory storage system as a core component of real-time retrieval system to handle a huge amount of readers and writers of main memory resident data. The storage system is implemented as an embedded component which is working with the help of a disk resident database system. It uses multi-threaded executions and utilizes latches for its concurrency control rather than complex locking method. It only saves most recent data on main memory and data synchronization is done only when disk resident database asks for update transactions. The system controls the number of read threads and update threads to guarantee the minimum requirements of real-time retrievals.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.682-685
• /
• 2004

This paper investigated a method for classifying emotional states by using pulse wave signal. It focused on finding effective features for emotional state classification. The emptional states considered here consisted of interest and neutral. Classification experiments utilized 65 and 60 samples of interest and neutral states respectively. We have investigated 19 features derived from pulse wave signals by using both time domain and frequency domain analysis methods with 2 classifiers of minimum distance (normalized Euclidean distanece) and ${\kappa}$-Nearest Neighbour. The Leave-one-out cross validation was used as an evaluation mehtod. Based on experimental results, the most efficient features were a combination of 4 features consisting of (i) the mean of the first differences of the smoothed pulse rate time series signal, (ii) the mean of absolute values of the second differences of thel normalized interbeat intervals, (iii) the root mean square successive difference, and (iv) the power in high frequency range in normalized unit, which provided 80.8% average accuracy with ${\kappa}$-Nearest Neighbour classifier.

• Journal of Ocean Engineering and Technology
• /
• v.28 no.6
• /
• pp.560-565
• /
• 2014

In this study, the problem of trajectory optimization for underwater gliders considering depth constraints is discussed. Typically, underwater gliders are controlled to dive and climb in a saw-tooth pattern at constant gliding angles. This approach is effective and close to optimal for deep water applications. However, the optimal path deviates from the saw-tooth path in shallow water conditions. This study focuses on finding more efficient gliding paths that can minimize the traverse time in the horizontal plane when the water depth is limited. The trajectory optimization problem is formulated into a minimum time control problem with inequality path constraints and hydrodynamic drag effects. A numerical approach based on the pseudo-spectral method is adopted as a solution approach, and the simulation results are presented.

• IE interfaces
• /
• v.14 no.3
• /
• pp.227-235
• /
• 2001

There is a rapidly growing demand for wireless telecommunication. However, the number of usable channel is very limited. Therefore, the problem of channel assignment becomes more and more important to use channels as efficiently as possible. The objective of this paper is to develop an evolution program (EP) to find an efficient dynamic channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. The only changed chromosomes by crossover and mutation are evaluated in each generation to save computation time and memory for the progress of improved EP. We can easily differentiate the fitness value of each chromosome using proposed evaluation function. We also control the weighting factor of the mutation rate and the used number of elitist chromosomes for the speed of convergence to the optimal solution.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1105-1109
• /
• 1995

A CCD-camera, which is structured with vision system, was used to realize automatic seam-tracking system and 3-D information which is needed to generate torch path, was obtained by using laser-slip beam. To extract laser strip and obtain welding-specific point, Adaptive Hough-transformation was used. Although the basic Hough transformation takes too much time to process image on line, it has a tendency to be robust to the noises as like spatter. For that reson, it was complemented with Adaptive Hough transformation to have an on-line processing ability for scanning a welding-specific point. the dead zone,where the sensing of weld line is impossible, is eliminated by rotating the camera with its rotating axis centered at welding torch. The camera angle is controlled so as to get the minimum image data for the sensing of weld line, hence the image processing time is reduced. The fuzzy controller is adapted to control the camera angle.

• Journal of Power Electronics
• /
• v.9 no.3
• /
• pp.430-437
• /
• 2009

This paper presents the dynamic characteristics of buck and buck-boost dc-dc converters with digital filters. At first, the PID, the minimum phase FIR filter and the IIR filter controls are discussed in the buck dc-dc converter. Comparisons of the dynamic characteristics between the buck and buck-boost converters are then discussed. As a result, it is clarified that the superior dynamic characteristics are realized in the IIR filter method. In the buck converter, the undershoot is less than 2% and the transient time is less than 0.4ms. On the other hand, in the buck-boost converter, the undershoot is about 3%. However, the transient time is approximately over 4ms because the output capacitance is too large to suppress the output voltage ripple in this type of converter.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1029-1037
• /
• 2013

This paper introduces a novel and fast synthesizing method for 3D motions of quadrupedal animals that uses only a small set of motion capture data. Unlike human motions, animal motions are relatively difficult to capture. Also, it is a challenge to synthesize continuously changing animal motions in real time because animals have various gait types according to their speed. The algorithm proposed herein, however, is able to synthesize continuously varying motions with proper limb configuration by using only one single cyclic animal motion per gait type based on the biologically driven Froude number. During the synthesis process, each gait type is automatically determined by its speed parameter, and the transition motions, which have not been entered as input, are synthesized accordingly by the optimized asynchronous motion blending technique. At the start time, given the user's control input, the motion path and spinal joints for turning are adjusted first and then the motion is stitched at any speed with proper transition motions to synthesize a long stream of motions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1237-1240
• /
• 1996

This paper proposes a heuristic algorithm for performing the line balancing of PCB assembly fine including multiple surface mounters efficiently. We consider a PCB assembly line including the multiple surface mounters arranged serially as a target system. We assume that the number of heads of surface mounters can be changed. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. Also we propose an head-changing algorithm. The algorithms are validated through the computer simulation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.437-444
• /
• 2004

In this study, an optimum support design problem is considered to minimize displacement of stacked plates under self weight condition. During the displacement analysis, several kinds of contact arise between the plates themselves and support bar. These can be easily considered if commercial analysis software, which provides capability to solve the contact problem, is used. It is found, however, that the computing time is extraordinarily long due possibly to the generality of the software and also to the ignorance of the control parameters used in the software. In this paper, the contact condition is imposed directly by the authors, while the software is used only to solve the ordinary displacement analysis problem. In this way, the computing time is decreased remarkably by more than 30 times, while yielding the same accurate results. Optimization is conducted based on this efficient analysis method to find minimum number of supporting bars using the response surface algorithm.

• Journal of Digital Contents Society
• /
• v.3 no.1
• /
• pp.89-99
• /
• 2002

Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.