• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.51-60
• /
• 1997

A practically applicable collision free trajectory planning technique for tow robot systems is proposed. The robot trajectories considered in this work are composed of many segments, an at the intersection points between segments robots stop to assemble, weld, ordo other jobs by the attached a end-effectors. The proposed method is based on the Planning-Coordination Decomposition where planning is to find a trajectory of each robot independently according to their tasks and coordination is to find a velocity modification profile to avoid collision with each other. To fully utilize the independently planned trajectories and to ensure no geometrical path deviation after coordination, we develop a simple technique added the minimal delay time to avoid collision just before moving along path segments. We determine the least delay time by the graphical method in the Coordination space where collisions and coordinations are easily visualized. We classify all possible cases into 3 group and derive the optimal solution for each group.

• Journal of Korean Institute of Industrial Engineers
• /
• v.13 no.1
• /
• pp.11-24
• /
• 1987

Automatic Guided Vehicle Systems feature battery powered driverless vehicles with programming capabilities for path selection and positoning. Vehicles serve the machines in shop, following a guide path system installed on the shop floor. The basic problem in the system is to determine a fixed set of vehicle routes of minimal total distance(time) while keeping capacity and distance(time) constraints. In this paper, a heuristic algorithm is presented for scheduling the automatic guided vehicles. The algorithm routes the machines based on their distances and polor coordinate angles, taking into account the structural feature of the system. Computational experiments are performed on several test problems in order to evaluate the proposed algorithm. Finally, a framework for dealing with the case where supplies from the machines are probabilistic is described.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.127-129
• /
• 2004

비즈니스 프로세스의 정의 및 실행이 복잡화되고 대량화되면서, 비즈니스 프로세스를 좀더 효율적으로 개선하고자 하는 노력이 필요하게 되었다. 본 논문에서는 그러한 노력을 위해 도달가능경로를 이용한 워크플로우 마이닝 기법을 사용하여, 문제를 해결하고자 한다. 따라서, 본 논문에서는 워크플로우 마이닝을 하기 위하여, ICN(Information Control Net) 모델을 기반으로 정의된 프로세스 모델을 도달가늠경로를 찾아내기 위하여 WDN(Workflow Dependent Net)으로 구성을 한 후, MWN(Minimal Workflow Net)으로 변환하여, 도달가능경로를 구성할 수 있는 정보를 얻을 수 있도록 하는데 목적을 둔다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.250-254
• /
• 2013

Faster and cheaper transportation of the war supplies to the frontlines is essential for winning a war. This paper proposes a method to select the optimal location of the strategic military base, e.g., the Quartermaster Corps, that minimally connects three frontlines using the optimization technique. The results are also compared to the Steiner Tree theoty.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.129-132
• /
• 2002

네트워크를 설계하거나 평가하는데 있어 중요한 문제 중 하나는 그 네트워크를 구성하는 요소들간의 상대적 중요도(importance)에 관한 문제이다. 이런 중요도를 나타내는 여러 가지 측도들 중 하나인 Joint Reliability Importance(JRI)는 Hong & Lie(1993)에 의해 소개되었으며, 네 가지 파생된 서브그래프의 신뢰성을 구하여 JRI를 계산하는 방법이 제시되었다. 본 연구에서는 minimal path set을 이용하여 파생되는 서브 그래프 신뢰성 계산에서의 중복되는 계산과정을 줄임으로써 JRI를 보다 효율적으로 구하는 방법을 제시하고자 한다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.5
• /
• pp.387-397
• /
• 1991

This paper presents the design and implementation of a performance-driven logic synthesis system that automatically generates circuits satisfying the given timing and fanout constraints in minimal silicon area. After performing technology independent and dependent optimization, the system identifies and resynthesizes the gates with large loading delay due to excessive fanouts to eliminate the critical path. Experimental results for MCNC benchmark circuits show that proposed system generates the circuits with less delay by up to 20%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.43-49
• /
• 2009

This paper presents a routing mechanism to prolong the lifetime of error-prone wireless sensor networks. The proposed mechanism estimates the amount of energy consumption for communications and the expected residual energy in advance, which is based on the qualities of wireless links. Then, the proposed mechanism selects a path that is expected to have the most residual energy, and sends sensory data along the path. This mechanism reduces energy consumption caused by unnecessary retransmissions and distributes traffic evenly over the network owing to taking error rates into consideration, and extends energy depletion by selecting a path with the maximum of the minimal expected residual energy amounts. The experiment results show that the proposed mechanism prolongs network lifetime, compared to the existing methods.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.313-322
• /
• 2005

In order to access digital items in a server via ubiquitous devices, the digital items should be adapted according to the system environment, device characteristics and user preferences. In ubiquitous environment, those device-dependent adaptation requirements are not statically determined and not predictable. Therefore an application specific adaptation mechanism can not be applied to a general digital item adaptation engine. In this paper, we propose an application independent digital item adaptation architecture which has a set of minimal transcoders, transcoding path generator for a required adaptation requirement, and adaptation scheduler. And a CFG based method of finding a sequence of multiple unit transcoders called a transcoding path Is described in detail followed by experimental results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1354-1372
• /
• 2012

Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.