• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.3
• /
• pp.470-476
• /
• 1997

The dynamic characteristics of industrial processes frequently cause an abnormal situation which is undesirable in terms of the productivity and the safety of workers. The goal of fault-tolerance is to continue performing certain activities even after the failure of some system cononents. A fault-tolerant intelligent monitoring and control system which is robust under disturbances is proposed in this paper. Specifically, the fault-tolerant monitoring scheme proposed consists of two process models and the inference module to preserve such a robustness. The results of turning experiments demonstrate the effectiveness of the fault-tolerant scheme in the presence of built-up edge.

• Smart Structures and Systems
• /
• v.29 no.6
• /
• pp.791-797
• /
• 2022

A complex system is comprised of numerous entities containing physical components, devices and hardware, events or phenomena, and subsystems, there are intricate interactions among these entities. To reasonably identify the critical fault propagation paths, a system fault propagation model is essential based on the system failure mechanism and failure data. To establish an appropriate mathematical model for the complex system, these entities and their complicated relations must be represented objectively and reasonably based on the structure. Taking a command and control system as an example, this paper proposes a hierarchical fault propagation analysis method, analyzes and determines the edge betweenness ranking model and the importance degree of each sub-system.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.429-436
• /
• 2009

Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.2
• /
• pp.84-92
• /
• 2007

This paper proposes an interconnect delay fault test (IDFT) solution on boards and SoCs based on IEEE 1149.1 and IEEE P1500. A new IDFT system clock rising edge generator which forces output boundary scan cells to update test data at the rising edge of system clock and input boundary scan cells to capture the test data at the next rising edge of the system clock is introduced. Using this proposed circuit, IDFT for interconnects synchronized to different system clocks in frequency can be achieved efficiently. Moreover, the proposed IDFT technique does not require any modification of the boundary scan cells or the standard TAP controller and simplifies the test procedure and reduces the area overhead.

• Journal of Korea Multimedia Society
• /
• v.24 no.8
• /
• pp.1101-1113
• /
• 2021

The rapid growth of sense-and-respond applications and the emerging cloud computing model present a new challenge: providing publish/subscribe middleware as a scalable and elastic cloud service. The publish/subscribe interaction model is a promising solution for scalable data dissemination over wide-area networks. In addition, there have been some work on the publish/subscribe messaging paradigm that guarantees reliability and availability in the face of node and link failures. These publish/subscribe systems are commonly used in information-centric networks and edge-fog-cloud infrastructures for IoT. The IoT has an edge-fog cloud infrastructure to efficiently process massive amounts of sensing data collected from the surrounding environment. In this paper. we propose a quorum-based hierarchical fault-tolerant publish/subscribe systems (QHFPS) to enable reliable delivery of messages in the presence of link and node failures. The QHFPS efficiently distributes IoT messages to the publish/subscribe brokers in fog overlay layers on the basis of proposing extended stepped grid (xS-grid) quorum for providing tolerance when faced with node failures and network partitions. We evaluate the performance of QHFPS in three aspects: number of transmitted Pub/Sub messages, average subscription delay, and subscritpion delivery rate with an analytical model.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.75-84
• /
• 2011

The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.213-221
• /
• 2012

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to ${\mid}V(G){\mid}$. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to $2^n$ when n($n{\geq}3$) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to $2^n-1$ when n($n{\geq}2$) and k have the different parity.

• Progress in Superconductivity and Cryogenics
• /
• v.4 no.1
• /
• pp.89-93
• /
• 2002

We investigated the resistance distribution n 4"diameter SFCLS. $YBa_2CU_3O_7$ films coated in-situ with a gold layer were patterned into 3 mm wide 142 cm long meander lines by Photolithography. The limiters were tested with simulated fault currents. The resistance was uniform all over the film except at the edge. At lower source voltages, CFCLs did not quench simultaneously and the resistance distribution was less uniform. Compared with 2" diameter SFCLS 4" SFCLS had similar values and time dependence of resistivity at similar electric fields The resistance distribution was more uniform in 4" SFCLS. The area at the edge where the distribution was not uniform was around 3 mm wide in SFCLs of both sizes. The experimental results were quantitatively explained with a heat transfer concept.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2843-2845
• /
• 2000

A lane detection based on a road model or feature all need correct acquirement of information on the lane in a image, It is inefficient to implement a lane detection algorithm through the full range of a image when being applied to a real road in real time because of the calculating time. This paper defines two searching range of detecting lane in a road, First is searching mode that is searching the lane without any prior information of a road, Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It is allow to extract accurately and efficiently the edge candidates points of a lane as not conducting an unnecessary searching. By means of removing the perspective effect of the edge candidate points which are acquired by using the inverse perspective transformation, we transform the edge candidate information in the Image Coordinate System(ICS) into the plane-view image in the World Coordinate System(WCS). We define linear approximation filter and remove the fault edge candidate points by using it This paper aims to approximate more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.