• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.331-334
• /
• 2006

워크플로우 비즈니스 프로세스는 설러 단위 업무(Activity)로 구성되며 단위 업무에는 여러 가지 타입이 존재한다. 유저 태스크(User Task) 타입은 특정 애플리케이션을 통해 처리되는 중요한 단위 업무 타입중 하나이며 본 논문에서는 유저 태스크 타입에 대한 최적의 수행자를 할당할 수 있는 질의어 기반 수행자 할당 방식을 기술한다. 이 방식은 기존의 워크플로우 관리시스템의 워크플로우 엔진에서 제공하는 로드-밸런싱 알고리즘을 현행 그대로 유지하는 동시에 조직의 조직 구조 정보를 이용하여 유저 태스크에 대한 기존의 할당 방식에서 확장된 형태의 수행자 할당 방법을 제공함으로써 태스크 처리에 대한 최적의 수행자를 할당하여 단위 업무의 처리 효율성을 향상시킨다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.111-113
• /
• 1998

공간조인은 지리정보 시스템에서 공간분석을 위한 주요 연산중의 하나이다. 이러한 공간조인은 대상이 되는 공간 객체의 수가 증가함에 따라 연산시간이 지수적으로 증가하는 특징을 가지고 있다. 그래서 대규모 공간 데이터에 다한 공간 연산시간을 줄이기 위한 처리기법이 연구되고 있다. 그렇지만, 공유 디스크 구조에서 다중 프로세서의 디스크 동시 접근으로 인한 병목현상을 완화하고, 프로세서간의 공유 디스크 구조에서 다중 프로세서의 디스크 동시 접근으로 인한 병목현상을 완화하고, 프로세서간의 메시지 전달을 최소화하기 위한 태스크 생성방법, 태스크 할당방법에 관한 구체적인 연구가 없었다. 그래서 우선 병렬 공간 조인의 성능저하 요인을 분석하고, 이에 대한 성능 향상방안을 제시한다. 구체적으로 디스크 접근 시간을 줄이기 위한 객체 캐쉬 방법과 시공간 지역성을 이용한 태스크 생성 및 할당방법을 제시한다. 그리고 제안한 방법들에 대해 실험평가를 통해 최대 7.2배의 성능증가를 획득할 수 있음을 보여준다.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.5
• /
• pp.196-203
• /
• 2003

This paper demonstrates that an improved hybrid neural-genetic multimodel parameter estimation algorithm can be applied to the structured system identification of an electro-hydraulic servo system. This algorithm is consists of a recurrent incremental credit assignment (ICRA) neural network and a genetic algorithm, The ICRA neural network evaluates each member of a generation of model and the genetic algorithm produces new generation of model. We manufactured an electro-hydraulic servo system and the improved hybrid neural-genetic multimodel parameter estimation algorithm is applied to the task to find the parameter values, such as mass, damping coefficient, bulk modulus, spring coefficient and disturbance, which minimize total square error.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.4
• /
• pp.1-17
• /
• 2014

The functions of stocking and releasing in logistics center consist of three major procedure such as receiving, shipping and stock managements. Each process includes various sub-processes which are complicatedly connected with each other. Furthermore, lots of operators execute various tasks in the different sub-processes, simultaneously. It makes difficult to standardize, monitor, and analyze the processes. This paper proposed the quantitative methodology using process mining approach to discover and analyze receiving and shipping processes. For this purpose, the PDA operation log data is analyzed to build a realistic process model. The deduced model has been compared with official process model. In addition, task assignment and social networks analysises are carried out by utilizing process mining tools. Also, it has been proposed how to improve the processes with the analytical simulation model based on the results of process mining.

• Journal of Korean Library and Information Science Society
• /
• v.35 no.2
• /
• pp.199-218
• /
• 2004

The purpose of this study is to examine the emotional and behavioral characteristics of information seeking of university students in context in which a class assignment should be completed. An attempt was made to understand better individualized and selective behavior observed while seeking information in the commonly defined context. Data was collected from content analysis of self-reports by 54 university students majoring in library and information science. Major findings were analyzed in relation to the preception and feelings over, and barriers and strategies of seeking information, and the use of information resources.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.570-572
• /
• 2006

This paper discusses the method of moving object detection for biped robot walking. Most researches on vision based object detection have mostly focused on fixed camera based algorithm itself. However, developing vision systems for biped walking robot is an important and urgent issue since hired walking robots are ultimately developed not only for researches but to be utilized in real life. In the research, method for moving object detection has been developed for task assignment and execution of biped robot as well as for human robot interaction (HRI) system. But these methods are not suitable to biped walking robot. So, we suggest the advanced method which is suitable to biped walking robot platform. For carrying out certain tasks, an object detecting system using modified optical flow algorithm by wireless vision camera is implemented in a biped walking robot.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.4-5
• /
• 2014

Planning earthmoving haul-route must be preceded for appropriate equipment fleet assignment. However, traditional haul-route planning methods have limitations relative to practical usage because multiple variables (e.g., grade/rolling resistance, length, equipment's weight etc.) should be considered at a time. Genetic algorithm(GA) was introduced to improve these traditional methods. However, GA based haul-route planning method still remains in inefficiency relative to computation performance. This study presents a new haul-route searching method that computes an optimal haul-route using GA. The system prototype is developed by using MATLAB(ver. 2008b). The system identifies an optimal haul-route by considering equipment type, soil type, and soil condition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.1-60
• /
• 2001

In recent years, distributed control systems(DCS) using fieldbus such as CAN have been being applied to process systems but it is very difficult to design the DCS in order to guarantee 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 ...

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.61-67
• /
• 2000

Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.