• 대한교통학회지
• /
• 제27권4호
• /
• pp.103-113
• /
• 2009

교통사고 발생시 119구급대의 신속한 사고현장 도착이 사고심도 감소에 가장 중요한 역할을 한다. 교통사고가 발생하여 부상자가 심정지후 4분이 경과하면 뇌손상이 시작되고 10분이 경과하면 사망할 가능성이 높은 것으로 조사되고 있다. 이에 따라 119구급대의 설치 고려시 교통사고 발생지역까지 통행시간을 고려하여 위치를 결정할 필요가 있다. 본 논문에서는 119구급대의 위치를 결정하는 방안에 대해서 기존 location theory를 검토하여 SCLM과 minisum location theory를 상호활용하는 방안을 모색하였다. 또한 기존 minisum location theory를 적용할 경우 최대통행시간($\lambda$)보다 통행 시간이 증가하는 경우가 발생할수 있는 문제점을 개선한 수정 minisum location theory를 제안한다. 수정 minisum location theory를 적용할 경우 모든 수요를 최대거리($\lambda$)내에 도착하면서 수요량과 통행시간에 대해서 최적화된 119구급대의 위치를 알 수 있다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제26권8호
• /
• pp.1028-1038
• /
• 1999

본 논문에선 LR 문법의 부분 클래스를 동치인 LL 문법으로 변환하는 방법을 제시한다. 이 변환이 적용 가능한 문법을 확장된k`-transformable 문법이라 정의한다. 변환된 문법은 left-to-right 커버의 성질을 만족한다. 기존 연구에서 제시한 변환 방법은 LR 문법의 부분 클래스인 {{{{k`-transformable 클래스와 PLR 클래스를 LL 문법으로 바꾼다. 이 논문에서 제시하는 새로운 변환 방법의 적용 가능한 문법의 범위는 k`-transformable 클래스와 PLR 클래스를 포함한다. 기존의 커버링 성질을 만족하는 LL로의 문법 변환은 보편적인 LR 파서의 행동을 시뮬레이션하여 얻어진다. 이 과정에서 쉬프트, 리듀스 행동 이외에 무한의 가능성을 가진 스택 스트링의 유한 표현을 위해 리덕션 심볼에 대한 예상 행동이 추가된다. 본 논문에서는 파싱 문맥을 나타내는 LR 아이템들을 기존의 스택 스트링 표현 형태에 추가하여 스택 스트링 표현법을 정제하고, 리덕션 심볼에 대한 예상 방법을 확장하는 정형식을 제시한다. 이에 근거하여 LL 커버링 문법이 존재하는 클래스를 확장된 {{{{k`-transformable 문법으로 확장시킨다.Abstract A new transformation of a subclass of LR(k`) grammars into equivalent LL(k`) grammars is studied. The subclass of LR(k`) grammars is called extended k`-transformable. The transformed LL(k`) grammars left-to-right cover the original LR(k`) grammars. Previous transformations transform k`-transformable and PLR(k`) into LL(k`). The new transformation is more powerful in that it handles the extended k`-transformable subclass of LR(k`), which strictly includes k`-transformable and PLR(k`) classes. The previous covering transformations into LL grammars are obtained by simulating the actions of the conventional LR parser. Specially, a predict action of reduction goals is added to the action set in order to finitely represent stack string. In this paper, the stack string representation is refined by adding LR items to represent a parsing context, and the prediction of reduction goal is extended by generalizing the prediction formalism. Based on them, the previous grammar classes with LL({{{{k`) covering grammars are extended to extended k`-transformable grammars.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5464-5488
• /
• 2019

The multi-population genetic algorithm in multi-target paths coverage has become a top choice for many test engineers. Also, information sharing strategy can improve the efficiency of multi-population genetic algorithm to generate multi-target test data; however, there is still space for some improvements in several aspects, which will affect the effectiveness of covering the target path set. Therefore, a multi-target paths coverage strategy is proposed by improving multi-population genetic algorithm based on individual information sharing among populations. It primarily contains three aspects. Firstly, the behavior of the sub-population covering corresponding target path is improved, so that it can continue to try to cover other sub-paths after covering the current target path, so as to take full advantage of population resources; Secondly, the populations initialized are prioritized according to the matching process, so that those sub-populations with better path coverage rate are executed firstly. Thirdly, for difficultly-covered paths, the individual chromosome features which can cover the difficultly-covered paths are extracted by utilizing the data generated, so as to screen those individuals who can cover the difficultly-covered paths. In the experiments, several benchmark programs were employed to verify the accuracy of the method from different aspects and also compare with similar methods. The experimental results show that it takes less time to cover target paths by our approach than the similar ones, and achieves more efficient test case generation process. Finally, a plug-in prototype is given to implement the approach proposed.

• 한국약용작물학회지
• /
• 제28권2호
• /
• pp.128-135
• /
• 2020

Background: Sowing seeds of Adenophora triphylla is known to be difficult owing to their small size and irregular seed shape. Therefore, this study was conducted to develop a seed pelleting technique to save labor during sowing. Methods and Results: To identify the optimal germination temperature for A. triphylla seeds, the temperature range was set from 17℃ to 32℃. Germination surveys were conducted in plastic greenhouse conditions in March, April, and May to determine the appropriate sowing time. The optimal germination temperature for A. triphylla seeds was 29℃ and May was the optimal sowing time in plastic greenhouse conditions. Covering materials for seed pelleting used talc (T), kaolin (K), calcium carbonate (C), and vermiculite (V). The pellet binder used agar (A), pectin, xanthan gum, polyvinyl alcohol (PVA), and sodium alginate (S). The best suited treatment mixture were the best suited in kaolin / calcium carbonate / vermiculite (KCV), talc / calcium carbonate / vermiculite (TCV) mixture treatment for covering material, and sodium alginate (S), agar (A) as pellet binder, respectively. The germination rate was the best in TCV mixed with S. Conclusion: The mixture of TCV (2 : 1 : 3) + 1.5% S (TCVS), was found to be the best pelleting materials for A. triphylla seeds, and seed pelleting can be labor-saving during sowing.

• 전기학회논문지P
• /
• 제65권4호
• /
• pp.298-302
• /
• 2016

Currently, logistics are in small quantities and in diverse forms, and the amounts are continuously increasing. Railway logistics however are losing their market share every year mainly due to low operation speed and loading time, which means the trucks are covering the most of the freights. In order to solve these situations, this paper proposed the high speed freight train as working multi-modality with other modes to make effective transshipment. The high speed freight train has maximum operation speed of 300km/h and electric power to run centralized power supply. There are large dual door system, bogie system covering fluctuating load of 15[ton], automatic loading device, ULD(unit load device) bed and ULD locking system in this freight rolling stock. We calculated the performance of powering and braking capacity for this train and proposed how many vehicles are composed of train set. The results in this paper can help to make a decision to define the technical specification of High-speed freight train for the efficiency of rail freight service.

• 천문학회보
• /
• 제36권1호
• /
• pp.52.1-52.1
• /
• 2011

Black hole masses of Active Galactic Nuclei (AGN) are one of the most important parameters in AGN physics. Based on the virial assumption, black hole masses can be determined from the product of the width of the broad emission lines and the continuum/line luminosities. Using the Low Resolution Imaging Spectrometer(LRIS) at the Keck telescope, we obtained high quality spectra (S/N~100), covering 2300-5500A in the rest-frame, for a sample of 37 intermediate-luminosity AGN at z~0.4, in order to calibrate various black hole mass estimators based on the Mg II (2798A) and the Hbeta (4861A) emission lines. After subtracting continuum and complex FeII emission under Mg II and Hbeta, we fit the broad emission lines using high order Guass-Hermite models to best constrain the profile and the width of the emission lines. Combining the SDSS spectra covering Halpha emission line with the Keck spectra, we determine a set of 6 black hole masses for each object, based on the line width (MgII, Hbeta, and Halpha) and the luminosity (LMgII, LHbeta, LHalpha, L3000, L5100), and calibrate each black hole mass estimator. We will present uncertainties and limitations of each mass estimator.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• 한국컴퓨터정보학회논문지
• /
• 제20권2호
• /
• pp.21-28
• /
• 2015

본 논문에서는 최근접 이웃 규칙을 이용한 프로토타입 선택 기반 분류 학습을 제안하였다. 각 훈련 데이터가 대표하는 클래스 영역을 구(sphere)로 분할하는데 최근접 이웃 규칙을 적용시키며, 구의 내부는 동일 클래스 데이터들만 포함하도록 한다. 프로토타입은 구의 중심점이며 프로토타입의 반지름은 가장 인접한 다른 클래스 데이터와 가장 먼 동일 클래스 데이터의 중간 거리 값으로 결정한다. 그리고 전체 훈련 데이터를 대표하는 최소의 프로토타입 집합을 선택하기 위해 집합 덮개 최적화를 이용하여 프로토타입 선택 문제를 변형시켰다. 제안하는 프로토타입 선택 방법은 클래스 별 적용이 가능한 그리디 알고리즘으로 설계되었다. 제안하는 방법은 계산 복잡도가 높지 않으며, 대규모 훈련 데이터에 대한 병렬처리의 가능성이 높다. 프로토타입 기반 분류 학습은 선택된 프로토타입 집합을 새로운 훈련 데이터 집합으로 사용하고 최근접 이웃 규칙을 적용하여 테스트 데이터의 클래스를 예측한다. 실험에서 제안하는 프로토타입 기반 분류기는 최근접 이웃 학습, 베이지안 분류 학습과 다른 프로토타입 분류기에 비해 일반화 성능이 우수하였다.

• 한국인터넷방송통신학회논문지
• /
• 제23권4호
• /
• pp.165-170
• /
• 2023

본 논문은 지금까지 NP-완전 문제로 다항시간 알고리즘이 존재하지 않는 집합피복 문제에 대해 선형시간으로 해를 구할 수 있는 알고리즘을 제안하였다. 지금까지는 최대로 피복할 수 있는 집합을 선택하는 휴이스틱 탐욕 알고리즘만이 알려져 있다. 반면에 제안된 알고리즘은 최대 원소 수 2순위 또는 3순위까지의 노드들 k개를 대상으로 포함-배제 원리 규칙을 적용하여 N개의 노드 모두를 피복하는 피복집합을 구하고, 이들 중 최소 피복집합을 선택하는 경쟁 알고리즘이다. 제안된 알고리즘은 욕심쟁이 알고리즘이 최적 해를 얻지 못하는 단점을 보완하였다. 제안된 알고리즘을 다양한 응용 사례들에 적용한 결과 O(kn²)의 다항시간으로 최적 해를 얻었다.

• 한국근적외분광분석학회:학술대회논문집
• /
• 한국근적외분광분석학회 2001년도 NIR-2001
• /
• pp.1243-1243
• /
• 2001

During two consecutive years, it was developed global calibrations for the prediction of fatty acids on Iberian pig fat. These equations should analyse well samples of that animal fat because of their high accuracy (SECV/sub C16:0/ = 0.26%; SECV/sub C18:0/ = 0.28%; SECV/sub C18:1/ = 0.26%; SECV/sub C18:2/ = 0.15%) and their broad covering composition range. In some cases, when new samples are predicted H (Mahalanobis distance) values higher than 3 (recommended value for agricultural products by the ISI software) are obtained. However, there are not any obvious factors which tells that samples scanned are very different to the spectral mean of the calibration population. Furthermore, these samples are well predicted according to the SEP values. The objective of the present work is to deepen the understanding of the H statistic when analysing animal fats. Three different validation files were predicted with equations obtained from January '97 to April '98. The Set A has spectra of 20 samples not included on the calibration file and scanned in May of 1998. The Set B has spectra of 20 samples included on the calibration file and scanned again in November '99. The Set C contains 150 spectra of one sample representative of the mean values (for fatty acids composition) of the calibration file. This sample was analysed three times per week during June '99 to July '00. The H mean values for the Set A, Set B and Set C were respectively 1.35, 14.39 and 11.71. These anomalous values for the Set B and C make not sense because Set B contains replicate subsamples of the same samples scanned during calibration development and Set C only contains spectra of one sample which represent the mean spectrum of the calibration files. Results will be shown to demonstrate that small day to day variations are responsible of the high H values. When a PCA and LIB file are created with calibration samples and spectra of the Set C modelling day to day variations, the H values for Set A, Set B and Set C were respectively 1.83, 2.16 and 0.93.