• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.84-96
• /
• 1999

The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.89-99
• /
• 2000

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.8-13
• /
• 2023

We propose a method for removing interference and noise to estimate target information. In wireless channels, information signals are subject to interference and noise, making it is difficult to accurately estimate the desired signal. To estimate the desired information signal, it is essential to remove the noise and interference from the received signal, extracting only the desired signal. If the received signal noise and interference are not removed, the estimated information signal will have a large error in distance and direction, and the exact location of the target cannot be estimated. This study aims to accurately estimate the desired target in space. The objective is to achieve more presice target estimation than existing methods and enhance target resolution.An estimation method is proposed to improve the accuracy of target estimation. The proposed target estimation method obtains optimal weights using linear constraints and the minimum variance method. Through simulation, the performance of the proposed method and the existing method is analyzed. The proposed method successfully estimated all four targets, while the existing method only estimated two targets. The results show that the proposed method has better resolutiopn and superior estimation capability than the existing method.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.2
• /
• pp.57-69
• /
• 2022

Recently, as interest in self-driving cars has increased worldwide, research and development on the Advanced Driver Assist System is actively underway. Among them, the purpose of Adaptive Cruise Control (ACC) is to minimize the driver's driving fatigue through the control of the vehicle's longitudinal speed and relative distance. In this study, for the research of the ACC test in the real environment, the real-road test was conducted based on domestic-road test scenario proposed in preceding study, considering ISO 15622 test method. In this case, the distance measurement method using the dual camera was verified by comparing and analyzing the result of using the dual camera and the result of using the measurement equipment. As a result of the comparison, two results could be derived. First, the relative distance after stabilizing the ACC was compared. As a result of the comparison, it was found that the minimum error rate was 0.251% in the first test of scenario 8 and the maximum error rate was 4.202% in the third test of scenario 9. Second, the result of the same time was compared. As a result of the comparison, it was found that the minimum error rate was 0.000% in the second test of scenario 10 and the maximum error rate was 9.945% in the second test of scenario 1. However, the average error rate for all scenarios was within 3%. It was determined that the representative cause of the maximum error occurred in the dual camera installed in the test vehicle. There were problems such as shaking caused by road surface vibration and air resistance during driving, changes in ambient brightness, and the process of focusing the video. Accordingly, it was determined that the result of calculating the distance to the preceding vehicle in the image where the problem occurred was incorrect. In the development stage of ADAS such as ACC, it is judged that only dual cameras can reduce the cost burden according to the above derivation of test results.

• Communications of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.1005-1014
• /
• 2019

A new simple method is proposed for reconstructing phylogenetic trees, which we call the spectral method. The most common distance based method is the neighbor-joining method which is based on the minimum evolution principle. The spectral method shows similar performance to the neighbor-joining method for simulated data generated by seq-gen. For real data, the spectral method shows much better performance than the neighbor-joining method. Hence it can be a complementary method for reconstructing phylogenetic trees.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.174-176
• /
• 2000

In this paper, a high speed distance relay, using a digital signal processor(DSP) is presented. The idea of the protective algorithm is based on the least square method using minimum data window to minimize the relay operating time. A new disign concept for a low-pass filter is proposed. This analog low pass filter has minimum transient response time. The main processor of the relay is TMS320C31. According to a series of real time tests, the proposed protective relay shows reliable and fast operating characteristics.

• Journal of the Korean housing association
• /
• v.14 no.5
• /
• pp.105-116
• /
• 2003

The purpose of this study is to suggest the method of prevention of staircase accidents, and to make housing environment better through researching the dimension of a housing staircase for Korean. The scope and method of this thesis is to investigate the dimension limits of a staircase (slope, minimum width of tread, maximum height of riser), and to analyze the characteristics of foot condition (jutting rate, foot angle, ball joint, nosing clearance, clearance distance) using the experiment which takes a photograph of foot motion during walking stairs. The results of this thesis are as follows. The slope of a staircase in house is $32.3^{\circ}$$^{\circ}$-$42.1^{\circ}$$^{\circ}$. The riser should be less than 190 mm. The minimum size of tread is 210 mm and proper size is 270 mm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.2
• /
• pp.65-71
• /
• 2018

In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.

• Earthquakes and Structures
• /
• v.22 no.2
• /
• pp.147-155
• /
• 2022

Regarding the importance of seismic pounding, the available standards and guidelines specify minimum separation distance between adjacent buildings. However, the rules in this field are generally based on some simple assumptions, and the level of confidence is uncertain. This is attributed to the fact that the relative response of adjacent structures is strongly dependent on the frequency content of the applied records and the Eigen frequencies of the adjacent structures as well. Therefore, this research aims at investigating the separation distance of the buildings through a probabilistic-based algorithm. In order to empower the algorithm, the record-to-record uncertainties, are considered by probabilistic approaches; besides, a wide extent of material nonlinear behaviors can be introduced into the structural model by the implementation of the hysteresis Bouc-Wen model. The algorithm is then simplified by the application of the linearization concept and using the response acceleration spectrum. By implementing the proposed algorithm, the separation distance in a specific probability level can be evaluated without the essential need of performing time-consuming dynamic analyses. Accuracy of the proposed method is evaluated using nonlinear dynamic analyses of adjacent structures.

• Korean Journal of Plant Resources
• /
• v.10 no.3
• /
• pp.258-264
• /
• 1997

The introduction of molecular biology methodologies to plant improvement programs offers an invaluable opportunity for extensive germplasm characterization. We have applied the developed technique of random amplification of polymorphic DNA(RAPD)to the analysis of evaluating genetic diversity among Korean wild Codonopsis lanceolata. A total of 340 polymorpic hands were gernerated on agarose- and polyacrylamide-gel by 19 primers of abitrary sequence. grouped by cluster analysis using sample matching coefficients of similarity. Among of the samples. the minimum genetic distance value was obtained between sample no. 1(Girisan) and no. 2(Girisan), and the largest value between sample no. 11(Sulaksan) and no. 17(Sulaksan).In separate cluster dendrograms based on agareose - and polyacryamide-gel. some differences were observed; In the case of agarose gel,41 samples could be devided into 7 groups at below about 0.44 level of distance. However they were divided into 6 gourps at below about 0.40 level of distance in the case of polyacrylamide gel. These results showed that polymophic data in agrose were not grouped to wild plant selected from each mountainous district except for wild plants selected from Sulaksan and Chiaksan. We believe that polyacrylamide-RAPD is a superior method for detecting DNA polymorphism compared to agarose-RAPD method.