• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.71-80
• /
• 2014

Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.117-126
• /
• 2013

A ship is intended to reach a specified target point in the minimum-time when it travels with a constant speed through a region of strong currents and its heading angle is the control variable. This is called the Zermelo's navigation problem. Its approximate solution for the minimum-time control may be found using the calculus of variation. However, the accuracy of its approximate solution is not high since the solution is based on a table form of inverse relations for some complicated nonlinear equations. To enhance the accuracy, this paper employs the neural network to represent the inverse relation of the complicated nonlinear equations. The accurate minimum-time control is possible with the interpolation property of the neural network. Through the computer simulation study we have found that the proposed method is superior to the conventional ones.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2004.04a
• /
• pp.455-458
• /
• 2004

This study uses time series analyses to evaluate fluctuation of water levels in a geothermal water well due to pumping, in relation to rainfall at Dongrae hot-spring site on the southeastern coast of tile Korean peninsula. The volume of water pumped from the public study wells ranges from 542 to 993 m$^3$/month, and the minimum water level ranged from 35 to 144.7 m during the measured period. Autocorrelation analysis was conducted for the withdrawal rate at the public wells, water levels and rainfall. The autocorrelation of the withdrawal rate shows distinct periodicity with 3 months of lag time, the autocorrelation of rainfall shows weak linearity and short memory with 1 months of lag time, and the autocorrelation of water levels shows weak linearity and short memory with 2 months of lag time. The cross-correlation between the pumping volume and the minimum water level shows a maximum value 1 at a delayed time of 34 months. The cross-correlation between rainfall and the minimum water level shows a maximum value of 0.39 at a delayed time of 32 months.

• Journal of the Korean Society for Railway
• /
• v.12 no.6
• /
• pp.953-960
• /
• 2009

In the major operation section of urban railway, there has been occurred habitual delay, and delay propagation and spread to consecutive trains. Therefore, this delay cause the increase of operation time and irregular operation, also the increase of crowd and inconvenience to passengers. The railway operation plan is a promise to passengers and must have reliability. In the case of high frequency urban operation, dwell time have considerable influence on operational headway, so it is very important to efficiently plan and control the dwell time at stations. In this paper, the survey of the research on dwell time for urban railways is presented. The practical estimation model for minimum required dwell time, and the numerical example and validity are proposed.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.509-521
• /
• 1988

In the designs of integrated circuits, the buffer circuits used for driving a large capacitive load from minimum-structured logic circuit outputs have important effects upon system throughputs. Therefore it is important to optimize the buffer circuits. In this paper, the principle of designing CMOS buffer circuits which have the minimum delay and drive the given capacitive load is discussed. That is, the effects of load capacitance upon rise time, fall time, and delay of the CMOS inverter and the effects of parasitic capacitances are finely analysed to calculate the requested minimum-delay CMOS buffer condition. This is different from the method by C.A. Mead et. al.[2.3.4.]which deals with passive-load-nMOS buffers. Large channel width MOS transistor stages are necessary to drive a large capacitive load. The effects of polysilicon gate resistances of such large stages upon delay are also analysed.And, the area of buffer circuits designed by the proposed method is smaller than that of buffer circuits designed by C.A. Mead's method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.1
• /
• pp.48-54
• /
• 2017

A minimum turning circle test of vehicles is operated by using Real-Time Kinematic(RTK) surveying method which enhances the precision of the Global Positioning System(GPS). A procedure of the conventional method to obtain results is to take post processing after the test. Therefore, it is difficult to ensure results in an instant. This paper introduces developed process and equipment that can immediately obtain results after the minimum turning test without post processing.

• Journal of Astronomy and Space Sciences
• /
• v.1 no.1
• /
• pp.55-65
• /
• 1984

A total of 618 photoelectric observations (302 in yellow and 316 in bule) is made in 1982 at the Yonsei University Observatory. Except that of the secondary eclipse the homogeneous coverage of observations successfully secured B, V, and B-V light curves. Enhanced distortions in the light curves are appeared at the phases aroung $0.^P1$, which supports the wave-like migration period of 9.7 years(Rodono 1981). One epoch time of the primary minimum was made by combining the observations in three nights. This minimum time shows that the O-C values are still decreasing and there seems to indication of increasing. B and V light curves of the primary minimum are in strong asymmetry which show less luminous in the third and fourth contacts compared to those of the first and second ones. This asymmetry may be as a result of the reflection of the wave minimum at $0.^P1$, and B-V curve also shows asymmetry, redder at the third contact than the second one by about $0.^m04$. This color difference apperature distribution on the surface of cooler, larger component(KO IV star).

• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.69-74
• /
• 2011

The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.