http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
비계획 사격상황에서 적 위협 최소화를 위한 실시간 사격순서 결정 연구
차영호(Young-Ho Cha),방준영(June-Young Bang),심상오(Sangoh Shim) 한국경영과학회 2017 經營 科學 Vol.34 No.1
We focus on the Real time Fire Scheduling Problem (RFSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing threatening probability to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We suggest mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithms outperform the firing method which is generally adopted in the field artillery.
A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem
차영호(Young Ho Cha),방준영(June Young Bang) 한국산업경영시스템학회 2015 한국산업경영시스템학회지 Vol.38 No.4
We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.
조철현(Jo Churl Hyun),차영호(Cha Young Ho),양종화(Yang Jong Hwa),방기문(Bang Ki Moon) 한국철도학회 2005 한국철도학회 학술발표대회논문집 Vol.- No.-
To ensure the safety of the tunnelling without the loss of economy, the tunnel seismic profiling(TSP) method for the prediction ahead of tunnel face, begins to be used routinely in these days. TSP method does not interfere the tunnelling works while the horizontal drilling does, and its prediction length is longer than that of the drilling. Yet the most frequently adopted technique of TSP in Korea is the multi-shot and 2 receiver array using in-hole receivers, even though this array requires as many as 26 drill-holes for receiver installation and ballasting, which results in 3~6 hours of suspension in excavation work. In this paper, multi-receiver and lesser shot array using side-wall attached 3 component geophones is to be described to prove the efficiency in terms of the survey time as well as the reliability of the method by comparison of the predicted weak points and the face mapping results. The predictions mostly agreed with the real fractures or joint developed zones which have been confirmed during the excavation. It also has been found that TSP method can be effectively applied to perform draining ground water ahead of tunnel face by imaging the geologic discontinuities.
김상완(Sang-Wan Kim),차영호(Young-Ho Cha),김관영(Kwan-Young Kim),민병권(Byung-Gueon Min) 대한전자공학회 2015 대한전자공학회 학술대회 Vol.2015 No.6
The program memory occupies the largest area in the SoC into multiple functions on a single chip. A architecture needs to be high code density to resolve these issues. And in this paper, we have designed a microprocessor using the EISC architecture. The microprocessor in the FPGA design was verified. It was analyzed using a benchmark program code density as compared to the ARM mode of thumb.