• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2001년도 춘계학술발표논문집
• /
• pp.461-464
• /
• 2001

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

• 한국군사과학기술학회지
• /
• 제9권4호
• /
• pp.24-31
• /
• 2006

To reduce the interferences between the radio equipments which are operated in frequency hopping mode, the frequency resource should be assigned to each equipment without overlapping when several groups of radio equipments operate in the same area. If the radio equipments are in a different area, the partial frequency overlaying can be permitted. From the isotropic multi-dimensional array, several frequency assignment tables can be extracted for a same area. Also several tables can be extracted for different areas. Since there can be no overlapped frequencies between the tables for the same area, no interference between the radio equipments in an area is guaranteed. The frequencies overlapped between 2 tables for 2 different areas are pre-planed as required. The interference performance in frequency hopping radio can be controlled as desired using the proposed Frequency Resource Assignment Algorithm using Isotropic multi-dimensional Array.

• 전기전자학회논문지
• /
• 제23권4호
• /
• pp.1353-1359
• /
• 2019

It is presented in this paper that the static output feedback (SOF) pole-assignment problem of some linear time-invariant systems can be completely resolved by parametrization in real Grassmann space. For the real Grassmannian parametrization, the so-called Plucker matrix is utilized as a linear matrix formula formulated from the SOF variable's coefficients of a characteristic polynomial constrained in Grassmann space. It is found that the exact SOF pole assignability is determined by the linear independency of columns of Plucker sub-matrix and by full-rank of that sub-matrix. It is also presented that previous diverse pole-assignment methods and various computation algorithms of the real SOF gains for 2-input, 2-output, 4^th order systems are unified in a deterministic way within this real Grassmannian parametrization method.

• 대한전자공학회논문지
• /
• 제25권1호
• /
• pp.108-114
• /
• 1988

We have developed a program that minimizes the chip area with effective code assignment of microinstructions when the control part of VLSI system is implemented in the PLA. While conventional algorithms are composed of one pass, the algorithm proposed in this paper is composed of two passes and it consists of three principal procedures: a procedure for the determination of the code assignment order, a procedure for the code assignment and a procedure for the reduction of the code length. especially, we have proposed a new method of folding back for the reduction of the code length. We have obtained the result of 4 bit code length and 9 product terms when 11 micro-instructions and 6 microoperations were given as a inputs. Therefore, we have certified that it could be used efficiently for the control part of the processors.

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.676-682
• /
• 1999

A study which develops a controller design methodology that has flexibility of eigenstructure assignment within the stability-robustness contraints of LQR is requried and has been performed. The previously developd control design methodology, namely, EALQR(Eigenstructure Assignment/LQR) has better performance than that of conventional LQR or eigenstructure assignment but has a constraint for the weitgting matrix in LQR, which could be indefinite for high-order system. In this paper, the effects of the indefinite Q in EALQR on the frequency domain properties are analyzed. The robustness criterion and quantitative frequency domain properties are also resented. Finally, the frequency domain properties of EALQR has been analyzed by applying to a flight control system design example.

• 제어로봇시스템학회논문지
• /
• 제8권6호
• /
• pp.506-513
• /
• 2002

Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.

• 산업경영시스템학회지
• /
• 제27권2호
• /
• pp.68-77
• /
• 2004

This paper considers the workforce assignment problem to minimize both the deviations of workloads assigned to workers and to maximize the total preference between each worker and each machine. Because of the high expense of technology education and the difficulties of firing employees, there is no part time workers in semiconductor industry. Therefore, multi-skilled workers are trained for performing various operations in several machines. The bicriteria workforce assignment problem in this paper is not easy to obtain the optimal solution considering the aisle structure and it is belong to NP-class. The proposed heuristic algorithms are developed based on the combination of spacefilling curve technique, simulated annealing technique and graph theory focusing on the multiple-row machine layout. Examples are presented for the proposed algorithms how to find a good solution.

• 대한산업공학회지
• /
• 제35권2호
• /
• pp.129-140
• /
• 2009

This paper introduces the planar storage location assignment problem (PSLAP) that no research has attempted to mathematically solve. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2005년도 추계 종합학술대회 논문집
• /
• pp.354-358
• /
• 2005

High-rate WPAN은 CAT의 Time Slot 할당스케줄링 방법을 정의하고 있지 않다. 이에 CAT의 Time Slot 할당 스케줄링 방법에 관한 많은 연구가 진행 중이다. 하지만 지금까지의 연구들은 Air Interface의 에러 요소의 미적용이나 특정 DEV의 기아 현상 등의 단점 등을 내포하고 있다. 이에 본 논문에서는 채널의 상태에 따라 우회 경로를 제공하여 채널 타임 할당 스케줄링 방법의 단점을 극복하는 알고리즘을 제안한다.

• Journal of Communications and Networks
• /
• 제5권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.