相关论文: On modular decompositions of system signatures

We consider a set $\mbK = \bigcup_{n \in \mbbN}\mbK_n$ of {\em finite} structures such that all members of $\mbK_n$ have the same universe, the cardinality of which approaches $\infty$ as $n\to\infty$. Each structure in $\mbK$ may have a…

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

We provide a systematic, thorough treatment of the foundations of probability theory and stochastic processes along the lines of E. Bishop's constructive analysis. Every existence result presented shall be a construction; and the input…

The signature of a path is a sequence of tensors whose entries are iterated integrals, playing a key role in stochastic analysis and applications. The set of all signature tensors at a particular level gives rise to the universal signature…

We consider estimation of the structural distribution function of the cell probabilities of a multinomial sample in situations where the number of cells is large. We review the performance of the natural estimator, an estimator based on…

Aiming for a systematic feature-extraction from time series, we introduce the iterated-sums signature over arbitrary commutative semirings. The case of the tropical semiring is a central, and our motivating example. It leads to features of…

We introduce a general framework for analysing general probabilistic theories, which emphasises the distinction between the dynamical and probabilistic structures of a system. The dynamical structure is the set of pure states together with…

The density matrix of composite spin system is discussed in relation to the adjoint representation of unitary group U(n). The entanglement structure is introduced as an additional ingredient to the description of the linear space carrying…

The signed permutation modules are a simultaneous generalization of the ordinary permutation modules and the twisted permutation modules of the symmetric group. In a recent paper Dave Benson and Peter Symonds defined a new invariant…

This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

The present paper studies multiple failure and signature analysis of coherent systems using the theory of monomial ideals. While system reliability has been studied using Hilbert series of monomial ideals, this is not enough to understand…

Identity verification based on authenticity assessment of a handwritten signature is an important issue in biometrics. There are many effective methods for signature verification taking into account dynamics of a signing process. Methods…

In this paper, a Gaifman-Shapiro-style module architecture is tailored to the case of Smodels programs under the stable model semantics. The composition of Smodels program modules is suitably limited by module conditions which ensure the…

The signature of a membrane is a sequence of tensors whose entries are iterated integrals. We study algebraic properties of membrane signatures, with a focus on signature matrices of polynomial and piecewise bilinear membranes. Generalizing…

Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…

Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major…

We clarified the connection between measurements and partitions, and discussed the meaning of semiotics for measurements based on functions. The terms of property and relation quantity were defined by our understanding of partitions and…

A set of general formulas is proposed for the probability of failure on demand (PFD) assessment of MooN architecture (i.e. k-out-of-n) systems subject to proof tests. The proof tests can be partial or full. The partial tests (e.g. visual…

This paper introduces a new controllability notion, termed partial strong structural controllability (PSSC), on a structured system whose entries of system matrices are either fixed zero or indeterminate, which naturally extends the…