• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.47-65
• /
• 2010

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.215-221
• /
• 2005

TRecently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. In this Paper, we study how to classify these sequence datasets. There are several kinds techniques for data classification such as decision tree induction, Bayesian classification and K-NN etc. In our approach, we use a K-NN algorithm for classifying sequences. In addition, we propose a new similarity measure to compute the similarity between two sequences and an efficient method for measuring similarity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.330-332
• /
• 2012

시계열 데이터 모델링은 시간 간격의 길이에 따라 단기적인 패턴이 주로 반영된다. 특히, 모델에 마코프 가정을 적용하였을 경우 이전 시간의 값에 따라 현재값이 결정된다. 시계열 데이터의 장기적인 변화를 다루기 위해, 특정 길이의 순차적 패턴을 부호화 하고, 이를 상위 모델의 입력으로 사용하는 과정을 통해 추상화를 시도하고자 한다. 실제로 사람의 감각기억은 200~500 밀리초 가량의 짧은 기억 유지기간을 갖는데, 이 기간의 정보를 상위 처리기의 입력 단위로 보고자 하는 것이다. 이에 본 고에서는 에너지기반 모델링 기법을 이용하여 반복적으로 나타나는 순차적 패턴을 부호화 하는 방법을 제안한다. 이 부호화 방법은 시간 순서에 따른 패턴의 유사도를 이용하여 확률적으로 다음 패턴과의 관계를 표현할 수 있으며, 이는 향후 시계열 데이터를 간략하게 표현하여 분석 및 시각화에 도움을 줄 수 있다.

• Journal of KIISE:Databases
• /
• v.28 no.1
• /
• pp.69-85
• /
• 2001

공간 데이터베이스에서 효율적으로 공간 질의를 처리하기 위해서는 클러스터링을 통해서 이스크 접근 비용을 줄이는 것이 필요하다. 이 논문은 공간 지역성에 기반을 둔 여러 가지 클러스터링 알고리즘을 제안하고 실험을 통해 제안한 클러스터링 알고리즘의 성능을 평가하였다. 이 논문에서 제안하는 클러스터링 알고리즘은 객체 클러스터링 알고리즘과 셀 클러스터링 알고리즘으로 나뉜다. 객체 클러스터링 알고리즘은 정규 준할 공간 색인 구조에서 영역 분할 선과 겹치는 객체들의 저장 위치를 결정하는데 사용된다. 셀 클러스터링 알고리즘은 클러스터를 만들기 위해 정규 분할된 영역들을 그룹화하는데 사용된다. 실험결과 객체 클러스터링 알고리즘에서는 객체간의 거리를 이용한 경우에 대체로 좋은 성능을 보였지만, 버퍼 크기가 커지거나 데이터가 희박한 영역의 질의에 있어서는 알고리즘 별로 성능의 차이는 거의 없었다. 셀 클러스터링 알고리즘에 대한 실험에서는 이 논문에서 제안한 클러스터링 알고리즘은 N-순서화 기법에 의한 클러스터링 알고리즘에 비해 우수한 성능을 보였다. 특히 중복 참조도를 이용한 경우와 셀의 무게 중심간 거리를 이용한 방법이 가장 우수하였다.

• Journal of the Korea Safety Management & Science
• /
• v.7 no.3
• /
• pp.85-96
• /
• 2005

This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

• IE interfaces
• /
• v.13 no.2
• /
• pp.195-203
• /
• 2000

This paper considers the problem of sequencing printed circuit boards(PCBs) on an automatic surface mount device(SMD) placement machine in order to minimize total setup time. Since the total set of component feeders needed by all boards cannot be loaded simultaneously on the magazine, the setup must be made between two successive boards in the sequence. It is assumed that the setup time depends on the number of component feeders to be replaced in the magazine. An important characteristic is that each feeder occupies a different number of slots in the magazine. This problem is equivalent to travelling salesman problem(TSP) except that the distances between two cities, that is, the setup times between two boards, are not known in advance. So, TSP-based heuristics with new distance functions are presented and their performances are compared through various test problems. Computational results indicate that our heuristics outperform existing methods.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.33-40
• /
• 2000

Computer Aided Process Planning (CAPP) plays a key role by linking CAD and CAM. Given CAD data of a part, CAPP has to recognize manufacturing features of the part. Despite the long history of research on feature recognition, its research results have rarely been transferred into industry. One of the reasons lies in the separation of feature recognition and process planning. This paper proposes to integrate the two activities through AI techniques, and presents efforts for manufacturable feature recognition, setup minimization, feature dependency construction, and generation of an optimal machining sequence.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.706-719
• /
• 2001

In this paper, we present a new approach to deterministic execution for testing concurrent programs. The proposed approach makes use of the notion of event independence which has been used in the partial-order method in order to resolve the state-explosion problem and constructs and automation which accepts all the sequences semantically equivalent to a given sequence. Consequently, we can allow a program to be executed according to event sequences other then the (possibly infeasible) given sequence if they have the same effects on the program's behavior. One advantage of this method is that it can be applied to situations where a program is not exactly implemented as described in the specification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1502-1509
• /
• 2006

In this paper, we proposed reliability and capacity enhancement methods for IEEE 802.15.3 HDR-WPAN (High Data Rate-Wireless Personal Area Network) system which is currently getting an interest in home network technology adopting a MIMO technique. We also analyzed performance or the proposed system through a computer simulation. The HDR-WPAN system using V-BLAST algorithm, transmitting the different signal vector to each other's sub-channel, can get the transmission speed of more than 110Mbps using two Tx/Px antenna without bandwidth expansion in TCM-64QAM mode. Also the proposed system has reliability of 104 at $E_b/N_0=35dB$ under the Rayleigh fading channel in case of two Tx/Rx antenna with MMSE algorithm. The HDR-WPAN system adopting V-BLAST method has its drawback which is very complicated to determine the decision-ordering at the receiver. But, the proposed system enhances the transmission capacity and reliability without extra bandwidth expansion by sending data streams to multiple antennas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.791-798
• /
• 2015

It has been grown interests of the convergence technologies about communication systems and vehicular industry. Vehicular communications enable a number of infotainment applications to serve cars under high mobility environments. To achieve this goal, a robust and accurate channel estimation scheme is of great importance. This paper proposes an enhanced Decision-Directed channel estimation scheme called PTAU(Pilot Tone Aided Update) for IEEE 802.11p in vehicular communication environment. Existing approaches which use subsequent data symbols to estimate channel response in time domain will lead to the error propagation. In this paper, we use the pilot subcarriers to get initial channel response, then utilize the correlation characteristics to update channel response in frequency domain. Finally, Analysis and simulation results reveal that the proposed scheme outperforms in bit error rate(BER), significantly improve the performance of the estimation.