• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.863-865
• /
• 1988

This paper presents a optimal Var allocation algorithm for minimizing transmission line losses and improving voltage profile in a given system. In this paper, nodal input data is considered as Gaussian distribution with their mean value and their variance. A Stocastic Linear programming technique based on chance constrained method is applied, to solve the var allocation problem with probabilistic constraint. The test result in 6-Bus Model system showes that the voltage distribution of load buses is improved and the power loss is more reduced than before var allocation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.129-137
• /
• 1995

Recently the recognition of Logistics becomes important to enterprises as a means for improving their competition, but the Korea enterpries falls for far behind in management techniques for analyzing realities and problems in the logistic compare to the advanced countries. In describing a distribution network, we have stated that it is basically a system or a set of locations that ship, receive or store material plus the routes that connect these locations. Using a Dynamic Programming on logistics, we can decrease the inventory level and increase the service level on logistics and the management performance.

• ETRI Journal
• /
• v.6 no.4
• /
• pp.31-36
• /
• 1984

This paper presents an efficient method for real power loss minimization and for improvements in voltage profiles. This method is accomplished by optimal control of reactive power in the system. The problem is formulated as an optimization problem, suitable for solution by linear programming technique. After establishing the objective function for minimizing the system losses with the help of linearised sensitivity relationships of control variables, i. e., the transformer tap position, generator terminal voltages and switchable reactive power sources. The linear programming technique is used to determine the optimal adjustments to the above variables, simultaneously satisfying the constraints. The proposed algorithm has been tested on a sample system and the result is presented and discussed.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.18-24
• /
• 1990

The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.185-194
• /
• 2005

A Server-Proxies-Users communication system is studied by using Stackelberg strategy theory of game. A new model, in which the server, proxies and users are not equal is established, and that is a three-level programming. The solution existence of the model is proved.

• Annual Conference of KIPS
• /
• 2002.11c
• /
• pp.2107-2110
• /
• 2002

소프트웨어를 설계, 구현하는데 있어서의 어려움이란 주변 환경이나 제반 기술 등과 같은 어려움도 있겠지만 실제 프로그래머가 작성하는 소스코드의 복잡성도 그 원인중의 하나라 할 수 있다. 이와 같은 문제의 해결을 위해서는 소스코드의 접근이나 이의 테스트를 위한 결합 등의 유연성이 높은 소프트웨어 기술이 필요한 실정이다. 이에 따라 AOP(Aspect-Oriented Programming) 기술을 이용하여 소스코드 자체의 접근 및 그의 처리를 용이하게 하여 복잡한 시스템의 개발이나 기존 시스템의 관리에 있어 효율을 높이고자 한다.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.845-857
• /
• 2003

We explore the use of genetic programming to evolve decision trees directly for classification problems with both discrete and continuous predictors. We demonstrate that the derived hypotheses of standard algorithms can substantially deviated from the optimum. This deviation is partly due to their top-down style procedures. The performance of the system is measured on a set of real and simulated data sets and compared with the performance of well-known algorithms like CHAID, CART, C5.0, and QUEST. Proposed algorithm seems to be effective in handling problems caused by top-down style procedures of existing algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.264-269
• /
• 1993

In this paper, we develop the basic robot commands on the level of VAL robot language and the integrated environment software of the robot management system to give users an easy way of programming and running the robot. The developed software is designed to support Korean language and to be run by the pop-up menus for programming commands and inputs. Geometrical and dynamical features can be viewed on a computer monitor by graphics and the taught works can be interfaced with a computer and controllers.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.7-13
• /
• 2004

In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

• Communications of the Korean Mathematical Society
• /
• v.24 no.1
• /
• pp.67-83
• /
• 2009

Several common fixed point theorems for a few contractive type mappings in complete metric spaces are established. As applications, the existence and uniqueness of common solutions for certain systems of functional equations arising in dynamic programming are discussed.