Related papers: Structure functions and minimal path sets
A semicoherent system can be described by its structure function or, equivalently, by a lattice polynomial function expressing the system lifetime in terms of the component lifetimes. In this paper we point out the parallelism between the…
Interconnected dynamic systems are a pervasive component of our modern infrastructures. The complexity of such systems can be staggering, which motivates simplified representations for their manipulation and analysis. This work introduces…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by…
We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in $\mathbb{R}^n$. Besides identifying a condition on the structure of the domain which ensures the existence of minimizing…
We introduce the concept of subsignature for semicoherent systems as a class of indexes that range from the system signature to the Barlow-Proschan importance index. Specifically, given a nonempty subset M of the set of components of a…
This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…
Considering a semicoherent system made up of $n$ components having i.i.d. continuous lifetimes, Samaniego defined its structural signature as the $n$-tuple whose $k$-th coordinate is the probability that the $k$-th component failure causes…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…
We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…
The concept of signature is a useful tool in the analysis of semicoherent systems with continuous and i.i.d. component lifetimes, especially for the comparison of different system designs and the computation of the system reliability. For…
Inclusive and diffractive structure functions for electron-proton scattering are calculated in a semiclassical approach at large momentum transfer $Q^2$ and small values of the scaling variable $x$. The basic process is the production of a…
We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…
The structure of proteins is essential for its function. The determination of protein structures is possible by experimental or predicted by computational methods, but also a combination of both approaches is possible. Here, first an…
In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…
Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…