• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.4
• /
• pp.349-356
• /
• 2013

This paper presents formation control based on potential functions for unicycle robots. The unicycle robots move to formation position which is made from a reference point and neighboring robots. In the framework, a local minimum case occurred by combination of potential repulsed from neighboring robots and potential attracted from a formation line is presented, in which the robot escapes from a local minimum using a virtual escape point after recognizing trapped situation. As well, in the paper, potential functions are designed to keep the same distance between neighboring robots on a formation line, i.e. the relative distance between neighboring robots on a formation line is controlled by a potential function parameter. The simulation results show that the proposed approach can effectively construct straight line, V, and polygon formation for multiple robots.

• Journal of Sensor Science and Technology
• /
• v.23 no.1
• /
• pp.46-50
• /
• 2014

In this paper, we report a novel algorithm based on phase displacement, which supplements conventional TOF methods for distance measurement using an ultrasonic wave. The proposed algorithm roughly measures the distance between the transmission part and the receiving part by using the initial TOF. Thereafter, the precise distance is determined by measuring the phase displacement value between the synchronizing transmission signal and the signal obtained at the receiving end. A distance measurement experiment using a micrometer was performed to verify the accuracy of the ultrasonic wave sensor system. We found that the mean errors from the one adopting the distance measurement algorithm based on phase displacement varied from a minimum of 0.03 mm to a maximum of 0.09 mm. In addition, the standard deviation varied from a minimum of 0.04 mm to a maximum of 0.07 mm, thus giving a precision of ${\pm}0.1$ mm.

• Journal of the Korean Institute of Navigation
• /
• v.6 no.1
• /
• pp.41-59
• /
• 1982

In the Sailing Rules of International Regulation for Preventing Collisions at Sea, 1972, any definite distance between two vessels approaching each other is not referred for adequate maneuvering to avoid collision. At sea the officer in charge of bridge duty is required to guess safe distance before he takes maneuvering actions needed to avoid collision. Papers on safe distances calculated on the base of the motiional characteristics of ships for collision avoiding actions are very few. In this paper, the minimum safe approaching distances necessary for actions to be taken to avoid collision are calculated in numerical numbers definitely by mathematic formula based on the maneuvering indices got from experiments of actual ships. On the assumption that two vessels same in size and conditions are approaching each other, the author calculated the minimum safe approaching distance as 4.5 times, sufficient safe approaching one as 9.0 times the length of the ship involved in head-on situation and 5.0 times, 10 times respectively the length of the ship in each case mentioned above in crossing situation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2002

In this paper we propose a simple decoding algorithm for the 4-ary lexicographic codes (or lexicodes) of length 10 with minimum distance 4, write $S_{10,4}$. It is based on the syndrome decoding method. That is, using a syndrome vector we detect an error and it will be corrected an error from the four parity check equations.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.5
• /
• pp.889-905
• /
• 2010

In this paper, a distribution free approach to the parameter estimation of a simple bilinear model with periodic coefficients is presented. The proposed method relies on minimum distance estimator based on the autocovariances of the squared process. Consistency and asymptotic normality of the estimator, as well as hypotheses testing, are derived. Numerical experiments on simulated data sets are presented to highlight the theoretical results.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.349-360
• /
• 1995

This paper deals with the robustness properties of the minimum disparity estimation in linear regression models. The estimators defined as statistical quantities whcih minimize the blended weight Hellinger distance between a weighted kernel density estimator of the residuals and a smoothed model density of the residuals. It is shown that if the weights of the density estimator are appropriately chosen, the estimates of the regression parameters are robust.

• Proceedings of KOSOMES biannual meeting
• /
• 2017.04a
• /
• pp.176-176
• /
• 2017

• Journal of Fisheries and Marine Sciences Education
• /
• v.21 no.1
• /
• pp.52-58
• /
• 2009

With the increase of marine traffic capacity, marine accidents have also been increased for recent several years. Especially watch officer must maneuver not entering into the safety minimum approaching distances when two power-driven vessels are crossing. The author calculated the safety minimum approaching distances to provide a navigator with them based on zig-zag motion by experimental ship. The obtained results are summarized as follows : 1. The greatest distance is to be kept by the give way vessel to avoid collision when the crossing course angle is $90^{\circ}$. In this case the safety minimum approaching distance must be more than from 5 times to 11 times of her own length according to her size. 2. The watch officer of the give way vessel must always take an action to avoid collisions outside of the safety minimum approaching distance. 3. When the navigator used rudder to small angle than to large angle to avoid other vessel he must take action outside the sufficient safety minimum outside distances in advance. 4. Risk of collision in crossing situation is more greater in obtuse situation than in acute one.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.83-90
• /
• 2010

The number of searched nodes and the computation time in an index should be minimized for optimizing the processing cost of the nearest neighbor query. The Measurement of search distance considered a circular location property of objects is required to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of the nearest neighbor query be considered a circular location property of object where the search space consists of a circular domain and show its performance by experiments. The proposed method uses the circular minimum distance and the circular optimal distance which are the search measurements for optimizing the processing cost of the nearest neighbor query.