On the identification of vertices using cycles.
Optimal resource allocation in stochastic activity networks via the electromagnetism approach: a platform implementation in Java
Output synchronization of multi-agent port-Hamiltonian systems with link dynamics
In this paper, the output synchronization control is considered for multi-agent port-Hamiltonian systems with link dynamics. By using Hamiltonian energy function and Casimir function comprehensively, the design method is proposed to overcome the difficulties taken by link dynamics. The Hamiltonian function is used to handle the dynamic of agent, while the Casimir function is constructed to deal with the dynamic of link. Thus the Lyapunov function is generated by modifying the Hamiltonian function...
Parabolic networks and polynomial growth
Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites
Reduction in the number of LUT elements for control units with code sharing
Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...
Résolution d'un programme quadratique en variantes bivalentes par décomposition application au placement de commutateurs dans un réseau
Signed directed graph based modeling and its validation from process knowledge and process data
This paper is concerned with the fusion of information from process data and process connectivity and its subsequent use in fault diagnosis and process hazard assessment. The Signed Directed Graph (SDG), as a graphical model for capturing process topology and connectivity to show the causal relationships between process variables by material and information paths, has been widely used in root cause and hazard propagation analysis. An SDG is usually built based on process knowledge as described by...
The behavior of a Markov network with respect to an absorbing class: the target algorithm
In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a “target” set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating...
The full periodicity kernel for a class of graph maps.
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the longest path in a graph whose edges are colored with a given number of colors, under the constraint that the path follows a predefined order of colors. The problem has not been widely studied in the previous literature, especially for more than two colors in the color arrangement sequence. The recent and relevant application of OCLP is related to the interpretation of Nuclear Magnetic Resonance experiments for...
TPM: Transition probability matrix - Graph structural feature based embedding
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The information obtained from random walks is converted to anonymous walks to extract the topological features of nodes. In the embedding process of nodes, anonymous walks are used since they capture the topological similarities of connectivities better than random...
Úloha teorie grafů pří řešení elektrických sítí
Un algoritmo para determinar las medianas absolutas generales sobre una red tipo árbol.
El problema de encontrar la mediana absoluta general en una red no se reduce, como ocurre con la mediana absoluta, a buscar en los vértices de la red. En el presente trabajo estudiamos el caso de que la red sea de tipo árbol, y presentamos un algoritmo que nos permite calcular el conjunto de todas las medianas absolutas generales de la red.
Un domaine d'interaction entre les mathématiques et les sciences sociales : les réseaux sociaux
Unit rectangle visibility graphs.
Weight identification of a weighted bipartite graph complex dynamical network with coupling delay.
Об одном алгоритме нахождения кратчайшего пути в сети
Сводимость различных видов контактных схем к схемам из функциональных элементов