• Title/Summary/Keyword: Maximum interconnection bound

Search Result 2, Processing Time 0.022 seconds

Design of an observer-based decentralized fuzzy controller for discrete-time interconnected fuzzy systems (이산시간 상호결합 퍼지 시스템을 위한 관측기 기반 분산 퍼지 제어기 설계)

  • Koo, Geun Bum;Joo, Young Hoon;Park, Jin Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.451-456
    • /
    • 2015
  • In this paper, an observer-based decentralized fuzzy controller is designed for discrete-time interconnected fuzzy systems. Based on the fuzzy subsystem of the interconnected fuzzy system, the observer-based decentralized fuzzy controller is considered. By using the fuzzy subsystem and the observer-based decentralized fuzzy controller, the closed-loop system is obtained. From the closed-loop system, the stability condition with the maximum interconnection bound is developed, and its sufficient condition is represented as the linear matrix inequality (LMI). Finally, the numerical example is provided to verify the effectiveness of the proposed technique.

Edge Property of 2n-square Meshes as a Base Graphs of Pyramid Interconnection Networks (피라미드 상호연결망의 기반 그래프로서의 2n-정방형 메쉬 그래프의 간선 특성)

  • Chang, Jung-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.582-591
    • /
    • 2009
  • The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.