• Journal of the Korea Society for Simulation
• /
• v.11 no.4
• /
• pp.69-80
• /
• 2002

This study deals with the productivity improvement on a flow production system with the consideration of line-balancing. In a flow production system, similar product models are produced on a same assembly line, the predefined process order and the limitation of total worker number. The system can be increased the work-in -process(WIP) inventory and the worker's idle time. In this study, the worker assignment model is developed to assign evenly workload of process to each product model in such a manner that each process has the different number of worker. This worker assignment model is the mathematical model that determines worker number in each process such that the idle time of processes is reduced and the utilization of worker is improved. We use a simulation technique to simulate the production line proposed by the mathematical model and apply real production line. With the result of simulation, this study analyzes the propriety of production line and proposes the alternatives of new production line

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.86-94
• /
• 1993

This paper presents the two-stage neural network method for efficient channel assignment of cellular mobile radio network. The first stage decomposes the region into non-adjacent groups of cells and the second stage assigns channels to the decomposed groups. The neural network model is tested with an experimental system of eighteen channels dedicated for nineteen hexagonal-cell region. When radom call requests of average density of 2 Erl/Cell to 8 Erl/Cell are presented, the real-time channel assignment method reduces the call-blocking rate up to 16% against the existing SCA(Static Channel Assignment) method.

• Journal of Mechanical Science and Technology
• /
• v.18 no.6
• /
• pp.933-945
• /
• 2004

In this paper, S (stochastic)-eigenvalue concept and its S-eigenvector for linear continuous-time systems with probabilistic uncertainties is proposed. The proposed concept is concerned with the perturbation of eigenvalues due to the probabilistic variable parameters in the dynamic model of a plant. S-eigenstructure assignment scheme via the Sylvester equation approach based on the S-eigenvalue concept is also proposed. The proposed design schemes are illustrated by numerical examples, and applied to the longitudinal dynamics of open-loop-unstable aircraft with possible uncertainties in aerodynamic and thrust effects as well as separate dynamic pressure. These results explicitly characterize how S-eigenvalues in the complex plane may impose stability on S-eigenstructure assignment.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.461-464
• /
• 2001

역할기반 접근제어(RBAC)는 역할(Role)과 역할계층(Role hierarchy)을 통해 사용자 및 접근권한 관리를 효율적으로 수행할 수 있도록 해준다. 그러나 시스템에 수많은 사용자, 역할, 권한이 존재하는 경우 한사람의 보안 관리자가 이들을 모두 관리하는 컷은 불가능하므로 역할을 관리하는 관리역할을 두어 시스템을 효율적으로 관리할 수 있는 방법(ARBAC)이 제안되었다. ARBAC는 URA(User Role Assignment), PRA(Permission Role Assignment), RRA(Role Role Assignment)로 구성되어있다. 본 논문에서는 URA99 모델을 기반으로 사용자-역할 관리를 위하여 관리도구를 구현한다. 구현된 관리도구는 오라클의 저장 프로시저를 사용하고 자바를 기반으로 한 EJB 컴포넌트로 구현한다.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.296-305
• /
• 2000

Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1405-1412
• /
• 2000

In this paper, we propose an efficient dynamic wavelength assignment algorithm in distributed WDM (Wavelength-Division Multiplexing) networks without wavelength conversion. The algorithm tries to assign a locally-most-used wavelength distributedly on a fixed routing path. We first formulate our algorithm by using the concept of a sample space which consists of optical fibers connected to nodes on a routing path of a lightpath to be assigned a wavelength. In particular, we analyze the blocking performance mathematically as compared with that of the most-used (MU) wavelength assignment algorithm previously proposed for WDM networks under centralized control. We also obtain numerical results by simulation on the blocking performance of other centralized/distributed wavelength assignment algorithms as well as our algorithm using the M/M/c/c dynamic traffic model. Consequently, we show that analytical results match simulation results and that our algorithm is efficient in distributed WDM networks in terms of blocking performance, control traffic overhead and computation complexity.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.111-117
• /
• 2004

In distributed-computing environments, there is a strong demand for the authentication and the access control of distributed-shared resources. I have presented role-based access control (RBAC) concept that is in the spotlight recently. RBAC model shows the standardized access control of complicated organization's resources. In RBAC, senior role has junior role's permission by virtue of role hierarchy. But, junior role cannot perform the permission, which is granted to the senior or other role groups. Inheritances of permissions in role hierarchies are static. In order to tackle this problem, I propose a dynamic role assignment, which classified into passive role assignment and active role assignment, and design dynamic role assignment protocol and implement role assignment server.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.599-617
• /
• 2006

A network model and a Genetic Algorithm(GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing the non-linear objective functions with the linear constraints. In the model, the flow-conservation constraints of the network are utilized to restrict the solution space and to force the link flows meet the traffic counts. The objective of the model is to minimize the discrepancies between the link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links and the link flows estimated through the traffic assignment using the path flow estimator in the legit-based SUE. In the proposed GA, a chromosome is defined as a vector representing a set of Origin-Destination Matrix (ODM), link flows and travel-cost coefficient. Each chromosome is evaluated from the corresponding discrepancy, and the population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment is applied during the crossover and mutation.

• Journal of the Society of Naval Architects of Korea
• /
• v.50 no.5
• /
• pp.334-342
• /
• 2013

In this paper, we analyze the procedure of the design manager for the enhancement of the hull production design process by use of the simulation method. Normally, design manager assigns design jobs according to various methods and estimates the corresponding results. When the construction drawing which is the output of the detail design where a design is dealt by zones, the design manager identifies blocks and analyzes their work difficulties, and assigns jobs to design engineers who are different in capabilities. These processes including the design engineer who can be modeled with man-hours evaluation model are represented in detail as a simulation model. As the high-level modeling for the discrete-event system, we use Event Graph model. And we implemented the simulation using Simkit which is open simulation engine for the discrete-event system. We made the simulation scenario to be written by a user in the scenario generator which is separated from the simulation model, and made the simulation result to be visualized in the form of Gantt chart in a Web. In the scenario of the irregular issuance for various construction drawings which contain different numbers of blocks, we performed the Monte-Carlo simulation according to various assignment methods to find the assignment result that satisfies the mid-term schedule.