• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제23권4호
• /
• pp.165-170
• /
• 2023

This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn²).

• The Korean Journal of Nuclear Medicine Technology
• /
• 제13권3호
• /
• pp.81-85
• /
• 2009

Purpose: The examination of nuclear medicine observes the change in accordance with the time elapsed in the same region purposed and there are many examinations to acquire the image during the same term. At this time, the same parameter should be applied. The hepatobiliary scan, lung scan etc, are the acquired examination in the divided time with a regular term. Pre-set time that is applied in continued next image is set in order to acquire the fixed counts. The same scan time should be applied for each image. This study will look for the rational plan and analyze the change of scan time in accordance with the time of the decision of scan time at examination that pre-set time is applied. Methods: The hapatobiliary scan that use the radio pharmaceutical $^{99m}Tc$-mebrofenin is choosed as compensation from Jan. 2009 to Mar. 2009 in the department of nuclear medicine in ASAN MEDICAL CENTER. Scan is started after 5 minutes from when 222 MBq (6 mCi) is injected to patient. We let patient stand up between both detectors, and possibly close to the front of detector. When scan time reach 10%, 25%, 50%, 75% of total scan time, we measured the expected total scan time. After finishing all of scan, we compared the total scan time and the expected total scan time, while image is acquiring. and we observed the change of scan time in accordance with radio activity by using phantom. Results: After starting scan, a difference of when scan time reach 10%, 25%, 50%, 75% of total scan time is that the biggest difference is 5 seconds on 10%. There statistically is difference between 25% (t:2.88, p<0.01) and 50% (t:2.05, p<0.01). Conclusions: When the same the scan time is applied in the examination that acquire the many frame, concluding the same scan time has a important effect on a quantitative analysis. Although method that decide the scan time after finish all of the examinations, there is a few problem to apply practical affairs. This may cause an inaccurate result on the examination that need a quantitative analysis. We think that operator should try to improve it. At least, after reach 50% of total scan time, deciding the total scan time mean that you can minimize error of a quantitative analysis caused by unmatched scan time from a gap of image.

• Journal of Korean Institute of Industrial Engineers
• /
• 제25권1호
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.76-81
• /
• 1988

As a means of human interface, this study designs Developed-ERES/WCS with voice recognition capability and fuzzy set theory. In the advanced teleoperator system, when an error occurs on the automatic mode, the error is recovered after the automatic mode is changed into the manual mode intervened by a human. The purpose of this study is to reduce human work load and to shorten error recovery time during error recovery.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제22권1호
• /
• pp.25-49
• /
• 1997

Printed circuit board (PCB) assembly line configuration is characterized by very long set-up times and high work in process (WIP) inventory level. The scheduling method can significantly reduce the set-up times and WIP inventory level. Greedy sequence dependent scheduling (GSDS) method is proposed based on the current methods. The proposed method is compared with the current method in terms of three performance measures: line throughput, average WIP inventory level, and implementation complexity.

• Journal of the Korean Data and Information Science Society
• /
• 제21권6호
• /
• pp.1353-1359
• /
• 2010

Basic objective in cluster analysis is to discover natural groupings of items. In general, clustering is conducted based on some similarity (or dissimilarity) matrix or the original input data. Various measures of similarities between objects are developed. In this paper, we consider a clustering of huge categorical real data set which shows the aspects of time-location-activity of Korean people. Some useful similarity measure for the data set, are developed and adopted for the categorical variables. Hierarchical and nonhierarchical clustering method are applied for the considered data set which is huge and consists of many categorical variables.

• Proceedings of the KSR Conference
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.275-280
• /
• 2011

Due to high-speed of trains, the track deformation increases rapidly and may lead to track irregularities causing the track stability problem. To secure the track stability, the continual inspection on track irregularities is required. The paper presents a methodology for identifying track irregularity using the NARX neural network considering non-linearity in the train structural system. A simulation study has been carried out to examine the proposed method. Acceleration time history data measured at a bogie were re-sampled to every 0.25m track irregularity. In the simulation study, two sets of measured data were simulated. The second data set was obtained by a train with 10% more mass than the one for the first data set. The first set of simulated data was used to train the series-parallel mode of NARX neural network. Then, the track irregularities at the second time period are identified by using the measured acceleration data. The closeness of the identified track irregularity to the actual one is evaluated by PSD and RMSE.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.626-628
• /
• 2004

This paper describes an 8-bit CMOS folding A/D converter for set-top box. Modular low-power, high-speed CMOS A/D converter for embedded systems aims at design techniques for low-power, high-speed A/D converter processed by the standard CMOS technology. The time-interleaved A/D converter or flash A/D converter are not suitable for the low-power applications. The two-step or multi-step flash A/D converters need a high-speed SHA, which represents a tough task in high-speed analog circuit design. On the other hand, the folding A/D converter is suitable for the low-power, high-speed applications(Embedded system). The simulation results illustrate a conversion rate of 40MSamples/s and a Power dissipation of 80mW(only analog block) at 2.5V supply voltage.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권1호
• /
• pp.61-67
• /
• 2008

This paper introduces the multi-vehicle routing problem(MRP) which is different from the traveling sales problem(TSP), and presents the ant system(AS) applied to the MRP. The proposed MRP is a distributive model of TSP since many vehicles are used, not just one salesman in TSP and even some constraints exist. In the AS, a set of cooperating agents called vehicles cooperate to find good solutions to the MRP. To make the proposed MRP extended more, Tokyo city model(TCM) is proposed. The goal in TCM is to find a set of routes that minimizes the total traveling time such that each vehicle can reach its destination as soon as possible. The results show that the AS can effectively find a set of routes minimizing the total traveling time even though the TCM has some constraints.

• The Transactions of the Korea Information Processing Society
• /
• 제7권7호
• /
• pp.2188-2195
• /
• 2000

This paper deals with the problem of determining small-bands enclosing a given set of points on the sphere. The small-band is a spherical region, whose boundary is composed of two circles, and which does not contain any great circle. It is a kind of domains that is derived from formalizing the local accessibility problems for 3-axis NC machining into sperical containment problems so as to avoid the grouping. It also can be generated in 4- and 5-axis machine. When a set of points U and the size of a great-band are given, the methods for computing a feasible band and all feasible bands enclosing U in O(n) and O(n log n) time have been suggested, respectively. The methods can be applied into the cases of small bands since the solution region may contain holes. In this paper, we concentrate on the method for determining the smallest small-band enclosing U and suggest an O(n long n) time algorithm, where n is the number of points on the sphere.