• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.1-11
• /
• 1994

Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.106-110
• /
• 2001

The Analytic Hierarchy Process (AHP) is well suited to group decision making and offers numerous benefits as a synthesizing mechanism in group decisions. To date, the majority of AHP applications have been in group settings. In general, aggregation methods employed in AHP can be largely classified into two methods: geometric mean method and (weighted) arithmetic mean method. In a situation where there do not exist clear guidelines for selection between them, two methods do not always guarantee the same group decision result. Thus we suggest a simulation approach for building group consensus as a complementary tool, even when just group judgments are required. Without any efforts to make point estimates from individual diverse preference judgments, a simulation approach suggests the process how the individual preference judgments are aggregated into consensus, displaying possible disagreements as is natural in group members' different viewpoints.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.71-82
• /
• 2001

Using the computer simulation method, we invest19ate the probability distribution of maximum eigenvalue of pair-wise comparison matrix, which has been used as a parameter for measuring the consistency of responses in analytic hierarchy process (AHP). We show that the shape of the distribution of the maximum eigenvalue is different according to the dimension of the matrix. In addition, we cannot find any evidence that the distribution of the Consistency Index is a Normal distribution, which has been claimed in the Previous literature. Accordingly, we suggest using so called K-index calcu1ated based on the concept of cumulative distribution function lather than based on that of arithmetic mean because the probabilistic distribution cannot be assumed to be a Normal distribution. We interpret the simulation results by comparing them with the suggestion of Saaty[11]. Our results show that using Saaty＇s value could be too generous when the dimension of the matrix is 3 and strict over 4. Finally, we propose new criteria for measuring the response consistency in AHP.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.89-93
• /
• 2002

This paper describes an ALU core which is suitable for 32-bit DSP This ALU operates in 32-bit data and occupies the third stage, execution, among 5 stage pipeline structure. The supplied functions of the ALU are arithmetic operations, logical operations, shifting, and so on. For the implementation of this ALU core, each functional block is described by HDL. And the functional verification of the ALU core is performed through HDL simulation. This ALU is designed to use the 32-bit DSP.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.4
• /
• pp.67-72
• /
• 2012

In this paper a new method of handling linear constraints for the genetic algorithm is suggested. The method is designed to maintain the feasibility of offsprings during the evolution process of the genetic algorithm. In the genetic algorithm, the chromosomes are coded as the vectors in the real vector space constrained by the linear constraints. A method of handling the linear constraints already exists in which all the constraints of equalities are eliminated so that only the constraints of inequalities are considered in the process of the genetic algorithm. In this paper a new method is presented in which all the constraints of inequalities are eliminated so that only the constraints of equalities are considered. Several genetic operators such as arithmetic crossover, simplex crossover, simple crossover and random vector mutation are designed so that the resulting offspring vectors maintain the feasibility subject to the linear constraints in the framework of the new handling method.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.51-82
• /
• 1977

Decision making is a function of many variables, but among these, human burden (soft-ware) and machine burden (hard-ware) are critical. Decision Maker is rather concerned with the soft-ware and just wants to have machine calculate the quantitative arithmetic involved in the decision-making study, because he is responsible for that decision whether or not he knows details about the techniques used by his staffs. From the point of these considerations, computer-assisted war game model has its significance in military decision making. The major outcome of this model is time-phased FEBA movement. FEBA is moved mainly by the ratio of the Index of Combat Effectiveness (ICE). To calculate ICE, Ground Forces are concerning the Index of Firepower (IFP) of individual weapons and in the case of Air Force, sorties are allocated into each sector, and added to the Ground Force IFP. With the ratio of total ICE, FEBA is moved according to the War Game Tables and process is repeated after consideration of casualties. This model is used by IBM-370/135 in MND computer room and also tested by IBM-3741/3717 established at ROKA HQ.

• Journal of the military operations research society of Korea
• /
• v.28 no.1
• /
• pp.83-96
• /
• 2002

The Analytic Hierarchy Process (AHP) is well suited to group decision making and offers numerous benefits as a synthesizing mechanism in group decisions. To date, the majority of AHP applications have been in group settings. One reason for this may be that groups often have an advantage over individual when there exists a significant difference between the importance of quality in the decision and the importance of time in which to obtain the decision. Another reason may be the best alternative is selected by comparing alternative solutions, testing against selected criteria, a task ideally suited for AHP. In general, aggregation methods employed in group AHP can be largely classified into two methods: geometric mean method and (weighted) arithmetic mean method. In a situation where there do not exist clear guidelines for selection between them, two methods do not always guarantee the same group decision result. We propose a simulation approach for building group consensus without efforts to make point estimates from individual diverse preference judgments, displaying possible disagreements as is natural in group members'different viewpoints.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.403-411
• /
• 2008

Energy consumption has been mostly neglected in network coding (NC) research so far. This work investigates several different properties of NC that influence the energy consumption and thus are important when designing NC systems for battery-driven devices. Different approaches to the necessary implementation of coding operations and Galois fields arithmetic are considered and complexity expressions for coding operations are provided. We also benchmark our own mobile phone implementation on a Nokia N95 under different settings. Several NC strategies are described and compared, furthermore expressions for transmission times are developed. It is also shown that the use of NC introduces a trade off between reduction in transmission time and increase in energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1786-1792
• /
• 2015

Random linear network coding (RLNC) is widely employed to enhance the reliability of wireless multicast. In RLNC encoding/decoding, Galois Filed (GF) arithmetic is typically used since all the operations can be performed with symbols of finite bits. Considering the architecture of commercial computers, the complexity of arithmetic operations is constant regardless of the dimension of GF m, if m is smaller than 32 and pre-calculated tables are used for multiplication/division. Based on this, we show that the complexity of RLNC inversely proportional to m. Considering additional overheads, i.e., the increase of header length and memory usage, we determine the practical value of m. We implement RLNC in a commercial computer and evaluate the codec throughput with respect to the type of the tables for multiplication/division and the number of original packets to encode with each other.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.116-123
• /
• 2002

The jacket matrix is based on the Walsh-Hadamard matrix and an extension of it. While elements of the Walsh-Hadamard matrix are +1, or -1, those of the Jacket matrix are ${\pm}$1 and ${\pm}$$\omega$, which is $\omega$, which is ${\pm}$j and ${\pm}$2$\sub$n/. This matrix has weights in the center part of the matrix and its size is 1/4 of Hadamard matrix, and it has also two parts, sigh and weight. In this paper, instead of the conventional Jacket matrix where the weight is imposed by force, a simple Jacket sequence generation method is proposed. The Jacket sequence is generated by AND and Exclusive-OR operations between the binary indices bits of row and those of column. The weight is imposed on the element by when the product of each Exclusive-OR operations of significant upper two binary index bits of a row and column is 1. Each part of the Jacket matrix can be represented by jacket sequence using row and column binary index bits. Using Distributed Arithmetic (DA), we present a VLSI architecture of the Fast Jacket transform is presented. The Jacket matrix is able to be applied to cryptography, the information theory and complex spreading jacket QPSK modulation for WCDMA.