• 한국경영과학회지
• /
• 제22권2호
• /
• pp.45-65
• /
• 1997

We build a queueing model for buffered leaky bucket system. First, we set up system equations and them calculate the steady-state probabilities at an arbitrary time epoch by recursive method. We derive the mean waiting time and the mean number of cells in the input buffer, and evaluate the performance of the buffered leaky bucket system to find the optimal queue capacity and token generation rate that meet the quality of service(QoS).

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.143-159
• /
• 1998

This paper proposes a new type of fuzzy approximate reasoning method that combines a self organizing feature map and a fuzzy logic. Previous methods considered only input part to determine the number of fuzzy rules, while this paper considers both input and output parts simultaneously. Our approach proved to improve the inference performance. We also developed a new index for avoiding overlearning which guarantees more accurate results. Experimental results showed that our approach surpasses the performance of Takagi & Hayashi (1991) approach.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.281-283
• /
• 2006

In this paper, we consider the problem of batch processing of orders, where either a single order or a pair of orders which satisfies specific conditions may be grouped in the same batch. The objective of the problem is to minimize the number of batches formed to accommodate all orders. We prose an approach based on a Known algorithm proven to be optimal for special class of problems with tree structure and show the approach to have the worst case ratio of $2-{\frac{2}{n}}$

• Korean Journal of Mathematics
• /
• 제11권1호
• /
• pp.1-7
• /
• 2003

In this paper, we introduce two types of algebraic operations on fuzzy numbers using piecewise linear functions and then show that the Zadeh implication is smaller than the Diense-Rescher implication, which is smaller than the Lukasiewicz implication. If ($f$, *) is an available pair, then $A*_mB{\leq}A*_pB{\leq}A*_jB$.

• Journal of Information Processing Systems
• /
• 제7권3호
• /
• pp.549-560
• /
• 2011

Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash function operations that only need a very small number of costly public key cryptographic operations. It can handle untrusted verifiers and achieve stronger zero knowledge privacy. As a result, the efficiency and privacy of homomorphic e-voting applications will be significantly improved.

• 한국경영과학회지
• /
• 제7권1호
• /
• pp.51-57
• /
• 1982

During the course of history, more and more reliable birth control methods have become available. Hence, to a certain degree, the possibility of avoiding any or additional children, and of spacing the family building process has arisen. The advancement of six predetermination technology, whereby couples can influence the sex of their children, gives couples, another decision variable. Assuming a rational acting couple, we present a general decision-theoretic model which describes the family building process and its optimization through maximizing the expected utility concerning the spacing, ordering, sex, and number of their children.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.75-85
• /
• 1983

This study is concerned with the problem of routing vehicles stationed at a central depot to supply customers with known demands, in such a way as to minimize the total distance travelled. The problem is referred to as the vehicle routing problem and is a generalization of the multiple traveling salesmen problem that has many practical applications. A branch-and-bound algorithm for the exact solution of the vehicle routing problem is presented. The algorithm finds the optimal number of vehicles as well as the minimum distance routes. A numerical example is given.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.377-380
• /
• 1996

Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number fo different levels. Each levels is characterized by the length of the planning horizon and the kind of data required for the decision making process. This paper describes an approach for the incorporation of Maintenance times into a hierachical scheduling for a failure prone flexible manufacturing system. The Maintenance should not be performed too often because of the resulting reduction of capacity. The machine failure and preventive maintenance are considered simultaneously.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.675-678
• /
• 1996

While a large number of firms have already developed and use an executive information system (EIS) effectively, some firms are reluctant to build one for lack of appropriate and well-organized guidance on how to achieve their own project. In this paper we suggest an EIS development methodology by testing five research hypotheses. As a result, we can conclude that prototyping should be applied to be combined with the SDLC. Moreover the preliminary stage accomplished the highest score in the eight-stage process.