On the synthesis of a class of interpolating circuits
Optimal Locating-Total Dominating Sets in Strips of Height 3
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...
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...
Packing graphs: The packing problem solved.
Parabolic networks and polynomial growth
Periodic solutions in systems at resonances with small relay hysteresis
Polyabelian loops and Boolean completeness
We consider the question of which loops are capable of expressing arbitrary Boolean functions through expressions of constants and variables. We call this property Boolean completeness. It is a generalization of functional completeness, and is intimately connected to the computational complexity of various questions about expressions, circuits, and equations defined over the loop. We say that a loop is polyabelian if it is an iterated affine quasidirect product of Abelian groups; polyabelianness...
Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites
Rank-three matroids are Rayleigh.
Realization of Boolean functions by repetition-free formulas in a particular base.
Reconstructibility of Boolean control networks with time delays in states
This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current...
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
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...
Remarks about energy transfer in an RC ladder network
The problem of energy transfer in an -ladder network is considered. Using the maximum principle, an algorithm for constructing optimal control is proposed, where the cost function is the energy delivered to the network. In the case considered, optimal control exists. Numerical simulations were performed using Matlab.
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
Résolution d'un programme quadratique en variantes bivalentes par décomposition application au placement de commutateurs dans un réseau
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Sampling of Band-Limited Vectors.