• Journal of the military operations research society of Korea
• /
• v.9 no.2
• /
• pp.11-22
• /
• 1983

The aim of this study is to minimize the total distance travelled by the examiners of college entrance examination committee, from their homes to the designated schools, such that the examiners are assigned to each school satisfying certain criteria. A network model is used and the Out-of-Kilter algorithm is applied to solve the examiner-examinee assignment problem. The result is proved to be fairly adequate not only in this problem, but also to the similar situations encountered in, say, school-grouping of junior/senior high schools, and an administration district allocation problem, etc.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.397-401
• /
• 2002

We consider a routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks, which is to maximize the established connections between nodes, given a set of usable wavelengths. We propose two new mathematical formulations of it and efficient algorithms based on branch-and-price method. Computational experiments on random instances show that cue of the proposed formulations yields optimal solutions in much shorter time on the average than the previous formulation due to Lee (1998).

• Management Science and Financial Engineering
• /
• v.9 no.1
• /
• pp.11-27
• /
• 2003

In this study, we propose a mathematical model based on the graph theory for the wavelength assignment problem arising in the design of SDH (Synchronous Digital Hierarchy) over WDM (Wavelength Division Multiplexing) ring networks. We propose a branch- and -price algorithm to solve the suggested models effectively within reasonable time in realistic SDH over WDM ring networks. By exploiting the structure of ring networks, we developed a polynomial time algorithm for efficient column generation and a branching rule that conserves the structure of column generation. In a computer simulation study, the suggested approach can find the optimal solutions within reasonable time and show better performance than the existing heuristics.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.319-326
• /
• 1988

In the presence of unmodeled dynamics, the robustness of adaptive pole assignment control using new pseudo-plant is presented. The pseudo-plant proposed by Donati et al. is modified as the gain of low pass filter can be set from zero to one. This modified pseudo-plant results in the reduction of modeling error. It is shown that not only this approach is insensitive to input frequency but also it improves the conic condition developed by Ortega et al. which is required to assure stability of adaptive control system despite the model-plant mismatch. A simple method to compensate the tracking error due to the use of pseudo-plant is considered.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.327-328
• /
• 2016

프로그래밍 교육은 프로그래밍에 필요한 지식 교육부분과 문제해결능력과 연관된 프로그래밍 전략을 교육하는 부분이 함께 필요하다. 프로그램 작성 기술을 교육하는 과정은 단순한 지식 습득과정이 아니므로 수업과정에서 학습자 스스로 문제해결능력을 배양할 수 있는 유도과정이 필요하다. 이러한 특성의 프로그래밍 수업의 대표적인 수업방식은 실습방식으로, 실제 수업에서 학습자들의 서로 다른 수준을 고려하면서 실습수업을 효과적으로 운영하기에는 수업시간에 대한 제약이 많이 발생한다. 본 연구에서는 프로그래밍 교육에서 사전 프로그래밍 과제를 활용하여 주어진 학점과 시간 안에서 실습 중심의 학습 효과를 높일 수 있는 교수 학습 모델을 제시한다. 이를 통해 프로그래밍 언어 교육 과정에서 발생하는 제한된 실습수업 시간으로 인해 학습자 스스로가 문제해결능력을 배양할 수 있도록 유도하는 수업을 실시하는데 발생하는 어려움을 해결하여, 학습자가 문제해결능력을 향상시키고 좋은 프로그램 작성 기준에 적합한 프로그램 개발 능력을 배양하는 결과를 얻을 수 있었다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.7
• /
• pp.257-266
• /
• 1985

A new method for the artificial beta cell which can be used to control the hyperglycemia in diabetic patients was represented. The relationship between the insulin infusion rate and the blood glucose concentration was described by the second order ARMA model, and the time varying parameters were identified by exponentially weighted least squares estimator. The design of controller was based on the pole assignment self tuning altorithm with discrete blood sampling and the constraints of input and output responsse rate were considered. The results of animal experiments show that this method may be a fruitful approach for regulating the blood glucose level. We expect that this device can be used as both therapeutic and research tools providing that its stability and reliability are improved a little more.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.591-600
• /
• 1998

The scheduling of parallel computing systems consists of two procedures, the assignment of tasks to each available processor and the ordering of tasks in each processor. The assignment procedure is same with a clustering. The clustering is classified into linear or nonlinear according to the precedence relationship of the tasks in each cluster. The parallel computing system can be modeled with a Directed Acyclic Graph(DAG). By the granularity theory, DAG is categorized into Coarse Grain Type(CDAG) and Fine Grain Type(FDAG). We suggest the linear clustering method for the scheduling of CDAG using the genetic algorithm. The method utilizes a properly that the optimal schedule of a CDAG is one of linear clustering. We present the computational comparisons between the suggested method for CDAG and an existing method for the general DAG including CDAG and FDAG.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.183-191
• /
• 1997

A neural network-based algorithm for the static weapon-target assignment (WTA) problem is Presented in this paper. An optimal WTA is one which allocates targets to weapon systems such that the total expected leakage value of targets surviving the defense is minimized. The proposed algorithm is based on a Hopfield and Tank's neural network model, and uses K x M processing elements called binary neuron, where M is the number of weapon platforms and K is the number of targets. From the software simulation results of example battle scenarios, it is shown that the proposed method has better performance in convergence speed than other method when the optimal initial values are used.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.5
• /
• pp.481-491
• /
• 2014

In this paper, we discussed a problem for improving the throughput of a crankshaft manufacturing line in an automotive factory in which the budget for purchasing new machines and installing additional buffers is limited. We also considered the constraint of available space for both of machine and buffer. Although this problem seems like a kind of buffer allocation problem, it is different from buffer allocation problem because additional machines are also considered. Thus, it is not easy to calculate the throughput by mathematical model, and therefore simulation model was developed using $ARENA^{(R)}$ for estimating throughput. To determine the investment plan, a modified Arrow Assignment Rule under some constraints was suggested and it was applied to the real case.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.382-389
• /
• 2006

Developing context awareness service In these day, It demands high security in context awareness service. So GEO-RBAC that provide user assignment of spatial role, assignment of permission, role schema, role instance and spatial role hierarchy to context awareness service is access control model to perfect in context awareness service. But GEO-RBAC is not considering temporal constraints that have to need context awareness environment. Consequently this paper improves the flexibleness of GEO-RBAC to consider time and period constraints notion and the time of GTRBAC that presents effective access control model. also we propose GEO-RBAC to consider temporal constraints for effective access control despite a various case.