• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.13-24
• /
• 2008

The multi robot operation technique has emerged as one of the most important research subjects that focus on minimizing redundancy in space exploration and maximizing the efficiency of operation. For an efficient operation of the multi robot systems, the movement of each Single robot in the multi robot systems should be properly observed and controlled. This paper suggests Multi Robot Management System to minimize redundancy in space exploration by assigning exploration space to each robot efficiently to take advantage of the RFID. Also, this paper has suggested fault tolerance technique that detects disable Single robot and substitute it by activated Single robot in order to ensure overall exploration and improve efficiency of exploration. Proposed system overcomes previous fault that it is difficult for central server to detect exact position of robot by using RFID system and Home Robot. Designated Home robot manages each Single robot efficiently and assigns the best suited space to Single robot by using RFID Tag Information. Proposed multi robot management system uses RFID for space assignment, Localization and Mapping efficiently and not only maximizes the efficiency of operation, but also ensures reliability by supporting fault-tolerance, compared with Single robot system. Also, through simulation, this paper proves efficiency of spending time and redundancy rates between multi robot management applied by proposed system and not applied by proposed system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Journal of the Korean Society for Railway
• /
• v.11 no.6
• /
• pp.530-535
• /
• 2008

After train fire accident in Daegue, many research on train fire safety improvement have been carrying out. Since many alternative fire safety measures can be applied in our railway system, the effect of the each safety measure must be quantified prior to the safety investment. In order to estimate the effects of each safety measure quantitatively, fault trees and event trees are constructed in this study. Results can be applied for cost-benefit analysis or sensitivity analysis for safety measures in risk assessment process.

• Journal of the Korean Geographical Society
• /
• v.43 no.2
• /
• pp.220-234
• /
• 2008

In many security monitoring contexts, the performance or efficiency of surveillance sensors/networks based on a single sensor type may be limited by environmental conditions, like illumination change. It is well known that different modes of sensors can be complementary, compensating for failures or limitations of individual sensor types. From a location analysis and modeling perspective, a challenge is how to locate different modes of sensors to support security monitoring. A coverage-based optimization model is proposed as a way to simultaneously site k different sensor types. This model considers common coverage among different sensor types as well as overlapping coverage for individual sensor types. The developed model is used to site sensors in an urban area. Computational results show that common and overlapping coverage can be modeled simultaneously, and a rich set of solutions exists reflecting the tradeoff between common and overlapping coverage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1498-1508
• /
• 2011

A cloud service customer has no other way but to wait for his lost data to be recovered by the cloud service provider when the data was lost or not accessible for a while due to the provider's system failure, cracking attempt, malfunction, or outage. We consider a solution to address this problem that can be implemented in the cloud client's domain, rather than in the cloud service provider's domain. We propose a high level architecture and scheme for successfully retrieving data units even when several cloud storages are not accessible at the same time. The scheme is based on a clever way of partitioning and partial overlapping of data for being stored on multiple cloud storages. In addition to providing a high level of data availability, the scheme makes it possible to re-encrypt data units with new keys in a user transparent way, and can produce the complete log of every user's data units accessed, for assessing data disclosure, if needed.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.75-83
• /
• 1999

recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2615-2626
• /
• 1998

In this paper, we propose a new interconnection network called RFM graph, whichis the merger of the directed rotator and Faber-Moore graph, and analyze fault tolerance, routing algorithm node disjoint cycles and broadcasting algorithm. We also describe methods to embed star graph, 2 dimesional torus and bubblesort graph into RFM graph with unit expasion and dilation 2.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.20
• /
• pp.25-32
• /
• 1989

열화수신포에 있어서 확률론적 신뢰도설계 및 단순스트레스와 강도의 고장모형은 렌덤 수치들로 구성된 각 분포의 간섭(Interference) 확률에 의해 이루어진다. 현재까지 이러한 분포모형들의 신경도는 분석적, 수치적 또는 모의실험방법론학에 의해서 단일추정치를 계산및 해석하여 왔으나 현실적으로는 스트레스 강도함수 분포의 간섭구간에 있어서 그 렌덤 변수들에 대한 완전한 실제의 분포들을 파악하기란 너무 복잡하고 때로는 불가능하다. 이를 위해서는 신뢰도의 상·하한 결정으로 신뢰도설계를 하는 방법이 고려된다. 본 연구에서는 스트레스와 강도의 렌덤 변수들에 대한 중복부분(Overlapping tails) 내에 있어서 각각의 주어진 구간확률을 제약조건으로 하여 최적신뢰도 한계를 결정 및 설계하는 새로운 기법을 제시한다. 설계신뢰도의 최적상한 및 하한 값은 제공하기 위하여 비선형모형인 Quadratic programming optimization 기법을 이용하여 신뢰도분석관점에 입각한 특수구조모형을 설정하고 이에 대한 수치예를 들어 예증하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.120-126
• /
• 2013

This paper proposes a novel scheme of fault detection and self-recovery for space-borne dual ring counters subject to transient faults. The considered ring counter is equipped with hardware redundancy, but it has a limited output domain where direct access to the current state is unavailable. We employ the theory of corrective control to detect any transient fault occurring to the counter bits and to realize immediate self-recovery of the ring counter back to the normal state. The structure of the fault-tolerant controller is designed to be minimal regardless of the counter size. To validate the applicability, we implement the proposed system on a commercial FGPA board.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.71-85
• /
• 2012

This paper aims to develop an event-driven failure analysis and prognosis system that is able to monitor ship status in real time, and efficiently react unforeseen system failures. In general, huge amount of recorded sensor data must be effectively interpreted for failure analysis, but unfortunately noise and redundant information in the gathered sensor data are obstacles to a successful analysis. This paper therefore applies 'Equal-frequency binning' and 'Entropy' techniques to extract only important information from the raw sensor data while minimizing information loss. The efficiency of the developed failure analysis system is demonstrated with the collected sensor data from a marine diesel engine.