A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.

This paper evaluates the performance of clustering algorithms in the determination of combat fatigues. Among clustering algorithms, GLVQ in neural clustering methods. and ISODATA algorithm are evaluated in this paper. In order to evaluate, this study used the data sets which showed the body measurement of Korean military personnel. For the comparison of the three methods, the coverage rate and fitness for combat fatigues are evaluated and the convergence of final standard sizes are considered. As a result, the mean of the coverage rate and fitness for combat fatigues obtained with the GLVQ are higher than those obtained with -Means and ISODATA algorithms.

This research investigates a kill probability model for the performance evaluation of guided missile system, and also develops graphical user interface for the input and output of the model based on the visual object-oriented programming application. The major simulation events used in this research are missile guidance homing point, burst points, and kill mechanism(direct kill, blast kill and fragment kill). For the user interface, we also design and implement the visualization system that can show the graphic style of the kill probability attained by the model. The results of sample run are shown, but these could be improved to be better with visual simulation which can visulaize all the simulation process of the model.

This research is carried out solving problem of reduction in the rate of operation for the k-1 tank in order to increase the availability, caused by the delay in supply of k-1 tank repair parts in field operations. In other words, the study aims to find the most suitable requirement estimate pattern for the main repair parts that are used for k-1 tank. This study intends to present the most suitable requirement estimate pattern for k-1 trank repair pats by comparing the results of repair parts consumption data in relation to their pattern created by the programs of the requirement estimate technique(moving average method) currently used in the Army and adaptive exponential smoothing model. The results of this study numerically proved that the adaptive exponential smoothing model is the most appropriate technique in estimating the requirement for k-1 tank repair parts.

A knowledge-based with production rules is a representation of static knowledge of an expert. On the other hand, a real system such as the stock market is dynamic in nature. Therefore we need a method to reflect the dynamic nature of a system when we make inferences with a knowledge-based system. This paper suggests a strategy of dynamic inference that can be used to take into account the dynamic behavior of decision-making with the knowledge-based system consisted of fuzzy production rules. A degree of match(DM) between actual input information and a condition of a rule is represented by a value [0,1]. Weights of relative importance of attributes in a rule are obtained by the AHP(Analytic Hierarchy Process) method. Then these weights are applied as exponents for the DM, and the DMs in a rule are combined, with the Min operator, into a single DM for the rule. In this way, the importance of attributes of a rule, which can be changed from time to time, can be reflected in an inference with fuzzy production systems.

This paper deals with complex system theory to describe guerrilla warfare situation using EINSTein (Enhanced ISAAC Neural Simulation Tool) simulation model. EINSTein model is an agent-based artificial "laboratory" for exploring self-organized emergent behavior in land combat. Many studies have shown that existing Lanchester equations used in most guerrilla warfare models do not describe changes of combat units, real guerrilla warfare situation and qualitative factors in combat. Future warfare will be information warfare with various weapon system and complex combat units. We have compared and tested results with Lanchester models and EINSTein model. And the EINSTein model has been applied and analyzed to guerrilla warfare model (C4I facilities, coastal, urbanized terrain critical facilities defense). The results show that the EINSTein model has a possibility to apply and analyze guerrilla warfare more properly than Lanchester models.

This paper proposes a computer model for airline overbooking. The model is constructed in such as way that users feel easy to find the daily optimal number of additional customers given the reservations already bookded on that day by providing the appropriate cost of denied boarding. In this model, however, the reservations are restricted only up to 40 seats due to the limited P.C. capability. Heuristic approaches may be highly recommended for the larger number of reservations.

US DoD designated the High LEvel Architecture (HLA) as the standard technical architecture for all military simulation since 1996. HLA will supercede the current Distributed Interactive Simulation(DIS) and Aggregated LEvel Simulation Protocol(ALSP) methods by no funds for developing/modifying non-HLA compliant simulations. The new architecture specifies Rules which define relationships among federation components, an Objects Model Template which species the form which simulation elements are described, and an Interface Specification which describes the way simulations interact during operations. HLA is named as standard architecture in NATO, Australia and many other militaries. Also, it will be IEEE standard in the near future. It goes without saying that ROK military whose simulation models are almost from US must be prepared in areas such as ROK-US combined exercise, training, weapon system acquisition, interface models with C4I system, OPLAN analysis, operations, and os on. In this paper, we propose several effective alternatives and issues for ROK Defense Modeling and Simulation under the transition of new HLA architecture. Those include secure the kernel of new simulation technology and develop our own conceptual model, RTI software, prototype federation for each service and aggregated one. In order to challenge the new simulation architecture effectively, we should innovate our current defense modeling and simulation infrastructure such s manpower, organization, budget, research environment, relationships among academia and industry, and many others.

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. Generally, the problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k most vital arcs in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. The method presented in this study is developed using the library of the evolutionary algorithm framework and then the performance of algorithm is analyzed through the computer experiment.

The emergence of computer-based information society has fundamentally changed the paradigms of everyday human life and will continue its trend in the 21st century when resources of information technology become more and more important because they can be directly transformed into military use. Future warfare will include such high-tech weapon systems as precision-guided munitions and satellite. But, with the spread of internet and advances in information technology, cyber space appears to be resources can be deciding factor in winning future war. In this paper we proposed to identify core information technology in national defense, improve mobilizing method of information resources in time of crisis, come up with combat effective measures utilizing information technology by estimating future information technological developments.

This paper deals with the problem of redundancy allocation for the mixed reliability system in an optimal way. Two kinds of the reliability system are considered for optimal allocation of parallel redundancy. The problem is approached as the optimization problems using th standard method of dynamic programming(DP). The algorithm for solving the optimal redundancy allocation is proposed and then the DP algorithm is applied to two numerical examples such as maximization of reliability subject to an allowable cost-constraint and minimization of the total cost subject to the specified minimum reliability-constraint. A consequence of this study is that the developed computer program package can be applied to the optimal redundancy allocation for the mixed reliability system.