Related papers: Subsignatures of systems
A {\em spanning configuration} in the complex vector space $\mathbb{C}^k$ is a sequence $(W_1, \dots, W_r)$ of linear subspaces of $\mathbb{C}^k$ such that $W_1 + \cdots + W_r = \mathbb{C}^k$. We present the integral cohomology of the…
A rank one local system on the complement of a hyperplane arrangement is said to be admissible if it satisfies certain non-positivity condition at every resonant edges. It is known that the cohomology of admissible local system can be…
Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be…
It is easy to show that a pseudovariety which is reducible with respect to an implicit signature $\sigma$ for the equation $x=y$ can also be defined by $\sigma$-identities. We present several negative examples for the converse using…
Semi-supervised learning (SSL) constructs classifiers using both labelled and unlabelled data. It leverages information from labelled samples, whose acquisition is often costly or labour-intensive, together with unlabelled data to enhance…
It is shown that 'non-quantum systems', with anomalous statistical properties, would carry a distinctive experimental signature. Such systems can exist in deterministic hidden-variables theories (such as the pilot-wave theory of de Broglie…
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
In Multiple Instance learning (MIL), weak labels are provided at the bag level with only presence/absence information known. However, there is a considerable gap in performance in comparison to a fully supervised model, limiting the…
We give a precise definition for when a subfactor arises from a conformal net which can be motivated by classification of defects. We show that a subfactor $N \subset M$ arises from a conformal net if there is a conformal net whose…
In this paper, we introduce the notion of uniformly S-essential (u-S-essential) submodules. Let R be a commutative ring and S a multiplicative subset of R. A submodule K of an R-module M is said to be u-S-essential in M if for any submodule…
Let R be a commutative ring with identity and M be an R-module. The main purpose of this paper is to introduce and study the notion of $\psi$-second submodules of an R-module M.
While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are…
Handwritten signature verification, crucial for legal and financial institutions, faces challenges including inter-writer similarity, intra-writer variations, and limited signature samples. To address these, we introduce the MultiScale…
This paper proposes a variance-based measure of importance for coherent systems with dependent and heterogeneous components. The particular cases of independent components and homogeneous components are also considered. We model the…
This work is a study of the impact of multiple aspects in a classic unsupervised word sense disambiguation algorithm. We identify relevant factors in a decision rule algorithm, including the initial labeling of examples, the formalization…
This paper examines the relationship between shadowing phenomena and the continuity properties of $\omega$-limit sets in dynamical systems. We give a necessary and sufficient condition for a shadowable point to be an upper (resp. a lower)…
Consider a collection of competing machine learning algorithms. Given their performance on a benchmark of datasets, we would like to identify the best performing algorithm. Specifically, which algorithm is most likely to rank highest on a…
The concept of signatures and expected signatures is vital in data science, especially for sequential data analysis. The signature transform, a Cartan type development, translates paths into high-dimensional feature vectors, capturing their…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…