Analytical Calculation Method of Reliability Sensitivity Indexes for Distribution Systems Based on Fault Incidence Matrix

An analytical calculation method for the reliability sensitivity indexes of distribution systems is proposed to explicitly quantify the impact of various influence factors on system reliability.Firstly,the analytical calculation formulas for the reliability indexes of distribution systems are derived based on the fault incidence matrix(FIM).Secondly,the factors that affect system reliability are divided into two categories:quantifiable parameter factors and non-quantifiable network structure factors.The sensitivity indexes for the quantifiable parameter factors are derived using the direct partial derivation of the reliability calculation formulas.The sensitivity indexes for the nonquantifiable network structure factors are derived using the transformation of FIMs.Finally,the accuracy and efficiency of the proposed sensitivity calculation method are verified by applying them to an IEEE 6-bus RBTS system.This paper sums up the factors that influence system reliability in detail and gives the explicit analytical calculation method for the sensitivity of each factor.Repetitive calculation of the reliability index can be avoided during the sensitivity analysis.The bottleneck that affects the reliability level of distribution systems can be identified efficiently,and valuable information and guidance can be provided to enhance the reliability of distribution systems.

On region crossing change and incidence matrix

In a recent work of Ayaka Shimizu, she studied an operation named region crossing change on link diagrams, which was proposed by Kishimoto, and showed that a region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that the region crossing change on a 2-component link diagram is an unknotting operation if and only if the linking number of the diagram is even. Besides, we define an incidence matrix of a link diagram via its signed planar graph and its dual graph. By studying the relation between region crossing change and incidence matrix, we prove that a signed planar graph represents an n-component link diagram if and only if the rank of the associated incidence matrix equals c n + 1, where c denotes the size of the graph.

有向图特征向量的映射与S-因子定理

本文利用出、入关联矩阵绘出了有向图(不必正则)与其有向线图的非零特征值的特征向量空间之间的一一映射.又对半正则有向图,指出了它的S-因子与其有向线图的零特征值的特征向量间的对应关系.这些结果推广了H.Sachs 等人对正则无向图与其线图的相应工作。

Optimization of fault management system in power plants based on DD-RCM and TPN

A method of optimizing the fault management system in power plants based on DD-RCM （resultchain based modeling for digital developing） and TPN （temporal Petri net） is proposed. First, the model of the fault management system was set using DD-RCM. Then, it was transformed to the temporal Petri net model by corresponding rules. Secondly, relationships among all the activities, such as choice, conflict, synchronization and concurrency, were confirmed according to the Petri net model and described employing the reengineering algorithm of incidence matrix. Thirdly, the Petri net model was reduced by combining reduction rules and conflict, synchronization relationships to optimize the fault management system in power plants. Finally, the functionality of the reduced net was proved by the temporal logic of the temporal Petri net.

Sensor fault diagnosis of nonlinear processes based on structured kernel principal component analysis

A new sensor fault diagnosis method based on structured kernel principal component analysis （KPCA） is proposed for nonlinear processes. By performing KPCA on subsets of variables, a set of structured residuals, i.e., scaled powers of KPCA, can be obtained in the same way as partial PCA. The structured residuals are utilized in composing an isolation scheme for sensor fault diagnosis, according to a properly designed incidence matrix. Sensor fault sensitivity and critical sensitivity are defined, based on which an incidence matrix optimization algorithm is proposed to improve the performance of the structured KPCA. The effectiveness of the proposed method is demonstrated on the simulated continuous stirred tank reactor （CSTR） process.

Solving Electrical Circuits via Graph Theory

Solving for currents of an electrical circuit with resistances and batteries has always been the ultimate test of proper understanding of Kirchoff’s rules. Yet, it is hardly ever emphasized that a systematic solution of more complex cases requires good understanding of the relevant part of Graph theory. Even though this is usually not covered by Physics’ curriculum, it may still be of interest to some teachers and their mathematically inclined students, who may want to learn details of the rigorous approach. The purpose of this article is to provide a concise derivation of a linear set of equations leading to a unique solution of the problem at hand. We also present a simple computer program which builds such a solution for circuits of any textbook size.

Aunu Integer Sequence as Non-Associative Structure and Their Graph Theoretic Properties

The generating function for generating integer sequence of Aunu numbers of prime cardinality was reported earlier by the author in [1]. This paper assigns an operator on the function for where the operation induces addition or subtraction on the pairs of ai, aj elements which are consecutive pairs of elements obtained from a generating set of some finite order. The paper identifies that the set of the generated pairs of integer sequence is non-associative. The paper also presents the graph theoretic applications of the integers generated in which subgraphs are deduced from the main graph and adjacency matrices and incidence matrices constructed. It was also established that some of the subgraphs were found to be regular graphs. The findings in this paper can further be used in coding theory, Boolean algebra and circuit designs.

Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs

A signed graph G˙=(G,σ)is a graph G=(V(G),E(G))with vertex set V(G)and edge set E(G),together with a functionσ:E→{+1,−1}assigning a positive or negative sign to each edge.In this paper,we present a more elementary proof for the matrix-tree theorem of signed graphs,which is based on the relations between the incidence matrices and the Laplcians of signed graphs.As an application,we also obtain the results of Monfared and Mallik about the matrix-tree theorem of graphs for signless Laplacians.

Applications of Graph Theory to Gross Error Detection for GPS Geodetic Control Networks

This paper describes a broad perspective of the application of graph theory to establishment of GPS control networks whereby the GPS network is considered as a connected and directed graph with three components.In this algorithm the gross error detection is undertaken through loops of different spanning trees using the "Loop Law" in which the individual components Δ X, Δ Y and Δ Z sum up to zero.If the sum of the respective vector components ∑X,∑Y and ∑Z in a loop is not zero and if the error is beyond the tolerable limit (ε>w),it indicates the existence of gross errors in one of the baselines in the loop and therefore the baseline must be removed or re_observed.After successful screening of errors by graph theory,network adjustment can be carried out.In this paper,the GPS data from the control network established as reference system for the HP Dam at Baishan county in Liaoning province is presented to illustrate the algorithm.

Simplification method of thermal-fluid network with circulation reflux based on matrix operation

Modeling and simulation of thermal-fluid systems are very important in industrial numerical simulation and play key roles in their design and control. In this paper, the modeling and simplification method of one-dimensional thermal-fluid network with variable-property are presented, including matrix representation of the network, simplification algorithm for series/parallel connection based on matrix operation and generation of flow equations based on system topology. This simplification is suitable for the simulation of thermal-fluid systems with arbitrary topological structure. The method to treat reflux during iteration is proposed. The outstanding features of the simplification algorithm are the significant reduction in the thermal-fluid network and therefore the number of the related governing equations, as well as the computation burden. The example in this paper shows that the number of the governing equations for flow is reduced by about 45% and the calculation time of flow calculation is reduced by an average of 32% after the simplification.

Smith normal forms of incidence matrices

A brief introduction is given to the topic of Smith normal forms of incidence matrices. A general discussion of techniques is illustrated by some classical examples. Some recent advances are described and the limits of our current understanding are indicated.

On Zero One Symmetric and Normal Matrices

We present additional equivalent conditions on the existence of a 0 1 symmetric matrix with given row sum vector. The case of a 0 1 normal matrix is also considered.

The Superiority Analysis on Characteristics and Relative Factorsof Systems

In this paper, on the basis of the incidence space and absolute incidence degree, the absolute incidence matrix is given, which is characteristics behaviour and relative factors behaviour of systems. lastly, we advance the absolute incidence superiority analysis method.

The Linear Unicyclic Hypergraph with the Second or Third Largest Spectral Radius

The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor of the hypergraph.It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph,and the unique linear unicyclic hypergraph with the largest spectral radius is a power hypergraph.In this paper we determine the unique linear unicyclic hypergraph with the second or third largest spectral radius,where the former hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.