This research studies an attrition rate considering terrain feature in a battlefield. Lanchester-type combat models for heterogeneous forces and the Weapon Effectiveness Index are used in this study. The various environments of the battlefield can be explained by the terrain feature. Attrition rates of heterogeneous model are estimated by applying the battle of Baek-Sek mountain during the Korean War. Estimated attrition rates are checked by the paired samples T-Test. Specific cases are shown in this paper as an example. If we study out the relative influence of the terrain feature upon the performance of individual weapons, these will be a possible alternative to analyze the military operations.

This paper deals with an estimation method of the airfield capacity for the airlift operation. In the US Air Force, airfield capacities has been estimated using MOG(Maximum -On-the-Ground) concept, which is known to having several weaknesses. Recently, RAND suggests a personal-computer- based model called the Airfield Capacity Estimator(ACE), which is a more advanced and realistic technique compared to the MOG. This paper attempts to modify the ACE appropriate to the Korean airlift operation. While ACE is developed on the basis of strategic mobilization, Korean airlift operation is done on the tactical basis. A designed mdel is tested with simulation technique.

The object of this study is to construct a model for an optimal allocation of short surface to air missile defending our targets most efficiently from hostile aircraft´s attack. For the purpose of this, we analyze and establish facility allocation concept of existing models, apply set covering theory appropriate to problem´s properties, present the process of calculating the probability of target being protected, apply Sherali-Kim´s branching variable selection strategy, and then construct the model. As constructed model apply the reducing problem with application, we confirm that we can apply the large scale, real problem.

The purpose of this paper is to develop a new heuristic algorithm for vehicle routing problem. The algorithm is composed of two steps. First step is to make a initial solution using sweeping algorithm. Second step is to improve initial solution for optimal solution using node exchange algorithm and tabu search algorithm. We have proven that our algorithm has produced better results than solutions obtained by saving algorithm and genetic in ten example problems with different unit size.

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

In this research we consider a statistical model to estimate the optimal maintenance manpower of aircraft which we use at present. We design a multiple regression model, apply to three types of aircraft to estimate the optimal maintenance manpower of aircraft. This paper provides reasonable results about maintenance manpower of aircraft, and contributes accomplishment of mission for air and air support operations.

This paper deals with a heuristic algorithm for the vehicle routing-scheduling problem to minimize the total travel distance and the total cost. Because the aim of the Clarke-Wright method, one of famous heuristic methods, is to minimize the total travel distance of vehicles, it cannot consider the cost if the cost and the travel distance is not proportional. In the Clarke-Wright method, the route of each vehicle is found by using the saving matrix which is made by an assumption that the vehicle comes back to the starting point. The problem dealt with in the paper, however, does not need the vehicle to come back because each vehicle has its hoping-start-points and hoping-destination-points. Therefore we need a different saving matrix appropriate to this occasion. We propose a method to find an initial solution by applying network simplex method after transforming the vehicle routing-scheduling problem into the minimum cost problem. Moreover, we propose a method to minimize the total travel distance by using the modified saving matrix which is appropriate to no-return occasion and the method for the case of plural types of vehicles and freights.

This paper demonstrates the application of a Quality Function Deployment (QFD) and Zero-One Goal Programming model for selecting interdependent information system project selection, there are a few research for interdependent IS project selection. Effective project evaluation necessities incorporating the many conflicting objectives of decision maker(s) into decision models. Among the many proposed methodologies of multi-criteria decision making (MCDM), Goal Programming (GP) is the most popular and widely used. The model departs from an earlier GP formulation of the problem that suggested QFD method for selection of priorities among the considered attributes or criteria. The application of the proposed methodology illustrated through an example.

In this paper, we are introduced a certification system for open network environment. The Kerberos which was developed by MIT uses a secret key cryptosystem for authentication. It is secure and efficient for closed network users to authenticate each others. However, the kerberos has a disadvantage of managing a lot of secret keys for In this paper, we are introduced a certification system for open network environment. users in the open network environment. This paper suggests a method that uses X.509 to provide public keys with certification to Kerberos users for authentication in the X.500 directory standard. And we also suggest the smartcard as data storage device to enhance the security and availability.

Occasionally, there are combat situations which one or both forces can´t terminate the combat using selected combat termination rule according to given relationship between ratio of attrition rate coefficient and threshold values. In this study, we classify the situations that one or both forces can´t terminate the combat with selected combat termination rule into four conditions. Condition${\circled1}$ is the situation which both Blue and Red can terminate the combat using all selected combat termination rules. condition${\circled2}$ and condition${\circled3}$ are those which neither Blue or Red can terminate the combat using selected proportional decision rule, and condition${\circled4}$ is that which both Blue and Red can´t terminate the combat using selected proportional decision rule. We analyze the effect of combat termination rules on parity number, final combat power, and combat durations for each conditions. Also, we propose the method to apply the analyzed effect of combat termination rules to combat analysis.