• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.5 no.3
• /
• pp.80-85
• /
• 2006

In an effort to reduce the evaluation time of the precision of manufactured disk cams, an effective measuring method with an exclusively built profile-measuring machine and subsequent data analysis procedure is proposed. The design and measuring data are interpolated by cubic spline curves to compute the precision error which is defined by the maximum and minimum distances between two curves. The minimum zone criterion of ISO is employed to evaluate the form error, and genetic algorithm is used to search the orientation and location of design data for the measured data which minimizes the form error. The proposed system was applied to marine engine cams, and it shows that the form error is reduced to 30% down compared with the method which minimizes the form error with the assumption that the centers of measured data design cam curve are identical.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1013-1023
• /
• 2021

In this study, we propose a practical path planning method that combines the A^* search algorithm and minimum snap trajectory generation. The A^* search algorithm determines a set of waypoints to avoid collisions with surrounding obstacles from a starting to a destination point. Only essential waypoints (waypoints necessary to generate smooth trajectories) are extracted from the waypoints determined by the A^* search algorithm, and an appropriate time between two adjacent waypoints is allocated. The waypoints so determined are connected by a smooth minimum snap trajectory, a dynamically executable trajectory for the quadrotor. If the generated trajectory is invalid, we methodically determine when intermediate waypoints are needed and how to insert the points to modify the trajectory. We verified the performance of the proposed method by various simulation experiments and a real-world experiment in a forested outdoor environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.349-359
• /
• 2009

In this paper, we propose a stereo-video transmission method for reduction of delay and maximization of 3D effect. Conventional multimedia synchronization algorithms were designed to achieve minimum delay and synchronize multiple video and audio streams, however, they could not be effective for 3D video transmission. In this paper, we proposed a synchronization algorithm by considering the minimum error of time difference between streams for 3D effect. The minimum error of time difference for 3D effect was derived based on a 3D subjective quality test. We compute display time of the delivered videos within the allowed time-difference and the video are displayed according to the display time. To evaluate the performance of the proposed algorithm, we implemented a real-time video communication system and subjective quality test has been conducted with the proposed system. We found that video quality displayed by the proposed system. We found that video quality displayed by the proposed algorithm ranks 'good' and 'excellent' in the DMOS (Differential Mean Opinion Score) scale, based on the MOS (Mean Opinion Score) test.

• Journal of Radiation Protection and Research
• /
• v.40 no.3
• /
• pp.181-186
• /
• 2015

Measurement of xenon radioisotopes from nuclear fission is a key element for monitoring underground nuclear weapon tests. $^{131m}Xe$, $^{133}Xe$, $^{133}mXe$ and $^{135}Xe$ in the air can be detected via low background systems such as a beta-gamma coincidence counting system. Radioxenon monitoring is performed through air sampling, xenon extraction, measurement and spectrum analysis. The minimum detectable concentration of $^{135}Xe$ can be significantly variable depending on the sampling time, extraction time and data acquisition time due to its short half-life. In order to optimize the acquisition time with respect to certain experimental parameters such as sampling and xenon extraction, theoretical approach and experiment using SAUNA system were performed to determine the time to minimize the minimum detectable concentration, which the results were discussed.

• The Journal of Korean Physical Therapy
• /
• v.22 no.6
• /
• pp.59-63
• /
• 2010

Purpose: Driving a car is an essential component of daily life. For safe driving, each driver must perceive sensory information and respond rapidly and accurately. Brake response time (BRT) is a particularly important factor in the total stopping distance of a vehicle, and therefore is an important factor in traffic accident prevention research. The purpose of the current study was (1) to compare accelerometer. BRTs analyzed by three different methods and (2) to investigate possible correlations between accelerometer-BRTs and foot switch-BRTs, which are measured method using a foot switch. Methods: Eighteen healthy subjects participated in this study. BRT was measured with either a tri-axial accelerometer or a footswitch. BRT with a tri-axial accelerometer was analyzed using three methods: maximum acceleration time, geometrical center, and center of maximum and minimum acceleration values. Results: Both foot switch-BRTs and accelerometer-BRTs were delayed. ANOVA for accelerometer BRTs yielded significant main effects for axis and analysis, while the interaction effect between axis and analysis was not significant. Calculating the Pearson correlation between accelerometer-BRT and foot switch-BRT, we found that maximum acceleration time and center of maximum and minimum acceleration values were significantly correlated with foot switch-BRT (p<0.05). The X axis of the geometrical center was significantly correlated with foot switch-BRTs (p<0.05), but Y and Z axes were not (p>0.05). Conclusion: These findings suggest that the maximum acceleration time and the center of maximum and minimum acceleration value are significantly correlated with foot switch-BRTs.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.59-64
• /
• 2013

In this paper, we proposed low power algorithm for a task. The task means the inside of a necessary processor and external resources to work accomplishment of a system. Each task analyzes a life time and a number of called for implement a low power circuit. First of all, reduce power consumption of a task have maximum power consumption for low power circuit implementation. Therefore, first selecting a task had maximum power consumption. The task had a maximum power consumption ranking consider a life time and a number of called for each task. While a life time of task is long, top priority ranking to decrease power consumption to the task that the number of call generates the power consumption how a disguise is large in case of a lot of task becomes. Frequency decision to have minimum power consumption, and decrease power consumption all the circuit by a change of frequency of the task which the minimum task that a wasting past record is the maximum becomes. Also, keep continuously minimum power consumption, with every effort task until last life time in opening life time, and decrease gets total power consumption. Experiments results show reduction in the power consumption by 5.43% comparing with that [7] algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.387-396
• /
• 2003

This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with minimum number of Steiner Points).Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with $n^{O(1)}$ run time. The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.33 no.5
• /
• pp.905-910
• /
• 2004

This study was carried out to observe the change of oriental melon juice quality during manufacture by heating condition and enzyme treatment. To use over-production oriental melon effectively, oriental melon juice was prepared with change of heating temperature and heating time. The heating conditions for minimum filtration time were 98.57$^{\circ}C$ and 11.29 min. The optimum conditions Predicted for separation ratio of clear solution, filtration time and browning color intensity of oriental melon juice were 98$^{\circ}C$, 13 min. In the pectin-degrading enzyme treatment test, turbidity showed minimum value in 4.40 mg％(pectin-degrading enzyme content)， 39.72 mg％ (gelatin content) and 24.09 min (treatment time)．Browning color intensity showed minimum value in 9.33 mg％ (pectin-degrading enzyme content)，44.70 mg％ (gelatin content) and 115.56 min (treatment time). The optimum conditions predicted for turbidity and browning color intensity of oriental melon concentration Juice were 6.6 mg％ (pectin-degrading enzyme content), 33.6 mg％ (gelatin content) and 70 min (treatment time).

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.