• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.19-26
• /
• 2004

In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.8-12
• /
• 2006

Master-slave (M-S) strategies implemented with chain circuits are the main option in order to distribute clock signals along synchronous networks in several telecommunication and control applications. Here, we study the two types of masterslave chains: Without clock feedback, i.e., one-way master-slave (OWMS) and with clock feedback, i.e., two-way master-slave (TWMS) considering the slave nodes as second-order phase-locked loops (PLL) for several types of loop low-pass filters.

• Journal of Korean Society for Quality Management
• /
• v.28 no.1
• /
• pp.105-118
• /
• 2000

In this paper, we consider an interconnection network, DRDT (Dual Receive Dual Transmit), that is a double-loop ring topology and adopts the concept of multiple packets transmission. For three types of DRDT configurations, we investigate some properties related to path sets and discuss the method for finding minimal path sets. Using the concept of the terminal reliability and the path sets approach, we evaluate the reliability of the DRDT networks and compare them with a single ring network and a unidirectional double-loop ring network.

• Journal of Korea Technology Innovation Society
• /
• v.4 no.2
• /
• pp.157-171
• /
• 2001

This paper discusses the economics of local loop architecture focusing on existing technologies, ADSL, HFC, and new one, PLC, and suggests a new modeling approach of access network system and the numerical equations. To modelize access network system and drive the numerical equations, we consider the double star and the tree & branch architecture and made block diagram of each access system. In addition, we introduce the density of subscriber as a variable and the equation of seeking the optimal number of cell in a service area. The economics of local loop architecture is analyzed in two ways, i.e. with and without consideration of the cost of cable and infrastructure. From the numerical analysis, we find that in case of not including the cost of cable and infrastructure, there is no much difference in the cost per one subscriber, while, in case of including it, there is remarkable difference among technologies. Therefore we conclude that the economics of local loop architecture is depend on the density of subscriber and existing network infrastructures.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.24-29
• /
• 1990

In this paper ,ie propose a hybrid position/force controller of a robot manipulator using double-layer neural network. Each layer is constructed from inverse dynamics and Jacobian transpose matrix, respectively. The weighting value of each neuron is trained by using a feedback force as an error signal. If the neural networks are sufficiently trained it does not require the feedback-loop with error signals. The effectiveness of the proposed hybrid position/force controller is demonstrated by computer simulation using a PUMA 560 manipulator.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.7
• /
• pp.35-44
• /
• 2006

When control surface failure occurs, it is conventional to correct a current control or to transform to other control. In this paper, instead of adopting a conventional way, a reconfiguration method which compensate the failure with alternative control surface deflection, depending on the level of failure, by using neural network and PCH(Pseudo-Control Hedging). The Conroller is designed of inner-loop(SCAS : Stability Command Augmentation System) with DMI(Dynamic Model Inversion) and outer-loop with Y axis acceleration feedback for a coordinate turn. Additionally, double PCH method was adopted to prevent actuator saturation and input command was generated to compensate for failure. At the end, The feasibility of the method is validated with randomly selected failure scenarios.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.10
• /
• pp.868-879
• /
• 2000

이 논문은 에지나 정점, 혹은 모두에 고장이 있는 이중 루프 네트워크의 해밀톤 성질을 고려한다. 이중 루프 네트워크 G(mn;1,m)은 m$\times$m 그리드 그래프에 에지를 추가한 4-정규 그래프이다. m 과 n 이 모두 짝수인 이중 루프 네트워크 G(mn;1,m)은 고장난 요소(에지와 정점)의 수가 1이하인 경우에 해밀톤 연결되어 있고, 고장난 요소의 수가 2 이하인 경우에 항상 해밀톤 사이클을 가짐을 보인다.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.189-198
• /
• 2004

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.