1,268 research outputs found

    Edge-transitivity of Cayley graphs generated by transpositions

    Full text link
    Let SS be a set of transpositions generating the symmetric group SnS_n. The transposition graph of SS is defined to be the graph with vertex set {1,,n}\{1,\ldots,n\}, and with vertices ii and jj being adjacent in T(S)T(S) whenever (i,j)S(i,j) \in S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S)T(S) is edge-transitive if and only if the Cayley graph Cay(Sn,S)Cay(S_n,S) is edge-transitive

    Investigation of the robustness of star graph networks

    Full text link
    The star interconnection network has been known as an attractive alternative to n-cube for interconnecting a large number of processors. It possesses many nice properties, such as vertex/edge symmetry, recursiveness, sublogarithmic degree and diameter, and maximal fault tolerance, which are all desirable when building an interconnection topology for a parallel and distributed system. Investigation of the robustness of the star network architecture is essential since the star network has the potential of use in critical applications. In this study, three different reliability measures are proposed to investigate the robustness of the star network. First, a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest distance, in an n-dimensional star network, Sn, is introduced to assess the robustness of the star network. A combinatorial analysis on DR especially for u having a single cycle is performed under different failure models (node, link, combined node/link failure). Lower bounds on the special case of the DR: antipode reliability, are derived, compared with n-cube, and shown to be more fault-tolerant than n-cube. The degradation of a container in a Sn having at least one operational optimal path between u and I is also examined to measure the system effectiveness in the presence of failures under different failure models. The values of MTTF to each transition state are calculated and compared with similar size containers in n-cube. Meanwhile, an upper bound under the probability fault model and an approximation under the fixed partitioning approach on the ( n-1)-star reliability are derived, and proved to be similarly accurate and close to the simulations results. Conservative comparisons between similar size star networks and n-cubes show that the star network is more robust than n-cube in terms of ( n-1)-network reliability

    Fuzzy-model-based robust fault detection with stochastic mixed time-delays and successive packet dropouts

    Get PDF
    This is the Post-Print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEThis paper is concerned with the network-based robust fault detection problem for a class of uncertain discrete-time Takagi–Sugeno fuzzy systems with stochastic mixed time delays and successive packet dropouts. The mixed time delays comprise both the multiple discrete time delays and the infinite distributed delays. A sequence of stochastic variables is introduced to govern the random occurrences of the discrete time delays, distributed time delays, and successive packet dropouts, where all the stochastic variables are mutually independent but obey the Bernoulli distribution. The main purpose of this paper is to design a fuzzy fault detection filter such that the overall fault detection dynamics is exponentially stable in the mean square and, at the same time, the error between the residual signal and the fault signal is made as small as possible. Sufficient conditions are first established via intensive stochastic analysis for the existence of the desired fuzzy fault detection filters, and then, the corresponding solvability conditions for the desired filter gains are established. In addition, the optimal performance index for the addressed robust fuzzy fault detection problem is obtained by solving an auxiliary convex optimization problem. An illustrative example is provided to show the usefulness and effectiveness of the proposed design method.This work was supported in part by the National Natural Science Foundation of China under Grant 61028008, 60825303, 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University), Ministry of Education, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the University of Hong Kong under Grant HKU/CRCG/200907176129 and the Alexander von Humboldt Foundation of Germany

    A Review of Fault Diagnosing Methods in Power Transmission Systems

    Get PDF
    Transient stability is important in power systems. Disturbances like faults need to be segregated to restore transient stability. A comprehensive review of fault diagnosing methods in the power transmission system is presented in this paper. Typically, voltage and current samples are deployed for analysis. Three tasks/topics; fault detection, classification, and location are presented separately to convey a more logical and comprehensive understanding of the concepts. Feature extractions, transformations with dimensionality reduction methods are discussed. Fault classification and location techniques largely use artificial intelligence (AI) and signal processing methods. After the discussion of overall methods and concepts, advancements and future aspects are discussed. Generalized strengths and weaknesses of different AI and machine learning-based algorithms are assessed. A comparison of different fault detection, classification, and location methods is also presented considering features, inputs, complexity, system used and results. This paper may serve as a guideline for the researchers to understand different methods and techniques in this field

    H∞ fuzzy control for systems with repeated scalar nonlinearities and random packet losses

    Get PDF
    Copyright [2009] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the H∞ fuzzy control problem for a class of systems with repeated scalar nonlinearities and random packet losses. A modified Takagi-Sugeno (T-S) fuzzy model is proposed in which the consequent parts are composed of a set of discrete-time state equations containing a repeated scalar nonlinearity. Such a model can describe some well-known nonlinear systems such as recurrent neural networks. The measurement transmission between the plant and controller is assumed to be imperfect and a stochastic variable satisfying the Bernoulli random binary distribution is utilized to represent the phenomenon of random packet losses. Attention is focused on the analysis and design of H∞ fuzzy controllers with the same repeated scalar nonlinearities such that the closed-loop T-S fuzzy control system is stochastically stable and preserves a guaranteed H∞ performance. Sufficient conditions are obtained for the existence of admissible controllers, and the cone complementarity linearization procedure is employed to cast the controller design problem into a sequential minimization one subject to linear matrix inequalities, which can be readily solved by using standard numerical software. Two examples are given to illustrate the effectiveness of the proposed design method

    Fault-tolerance embedding of rings and arrays in star and pancake graphs

    Full text link
    The star and pancake graphs are useful interconnection networks for connecting processors in a parallel and distributed computing environment. The star network has been widely studied and is shown to possess attactive features like sublogarithmic diameter, node and edge symmetry and high resilience. The star/pancake interconnection graphs, {dollar}S\sb{n}/P\sb{n}{dollar} of dimension n have n! nodes connected by {dollar}{(n-1).n!\over2}{dollar} edges. Due to their large number of nodes and interconnections, they are prone to failure of one or more nodes/edges; In this thesis, we present methods to embed Hamiltonian paths (H-path) and Hamiltonian cycles (H-cycle) in a star graph {dollar}S\sb{n}{dollar} and pancake graph {dollar}P\sb{n}{dollar} in a faulty environment. Such embeddings are important for solving computational problems, formulated for array and ring topologies, on star and pancake graphs. The models considered include single-processor failure, double-processor failure, and multiple-processor failures. All the models are applied to an H-cycle which is formed by visiting all the ({dollar}{n!\over4!})\ S\sb4/P\sb4{dollar}s in an {dollar}S\sb{n}/P\sb{n}{dollar} in a particular order. Each {dollar}S\sb4/P\sb4{dollar} has an entry node where the cycle/path enters that particular {dollar}S\sb4/P\sb4{dollar} and an exit node where the path leaves it. Distributed algorithms for embedding hamiltonian cycle in the presence of multiple faults, are also presented for both {dollar}S\sb{n}{dollar} and {dollar}P\sb{n}{dollar}
    corecore