Related papers: Enriched factorization systems
Fine-grained entity typing (FET) aims to deduce specific semantic types of the entity mentions in text. Modern methods for FET mainly focus on learning what a certain type looks like. And few works directly model the type differences, that…
In 1910 Einstein published a crucial aspect of his understanding of Boltzmann entropy. He essentially argued that the likelihood function of any system composed by two probabilistically independent subsystems {\it ought} to be factorizable…
Type qualifiers offer a lightweight mechanism for enriching existing type systems to enforce additional, desirable, program invariants. They do so by offering a restricted but effective form of subtyping. While the theory of type qualifiers…
The Douglas' majorization and factorization theorem characterizes the inclusion of operator ranges in Hilbert spaces. Notably, it reinforces the well-established connections between the inclusion of kernels of operators in Hilbert spaces…
An intrinsically causal approach to lifting factorization, called the Causal Complementation Algorithm, is developed for arbitrary two-channel perfect reconstruction FIR filter banks. This addresses an engineering shortcoming of the…
An enriched approximation space is the span of a conventional basis with a few extra functions included, for example to capture known features of the solution to a computational problem. Adding functions to a basis makes it overcomplete…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
Multi-item mechanisms can be very complex offering many different bundles to the buyer that could even be randomized. Such complexity is thought to be necessary as the revenue gaps between randomized and deterministic mechanisms, or…
Consistent factorization theorems in high-energy scattering near the threshold are presented in the framework of the soft-collinear effective theory. Traditional factorization theorem separates the soft and collinear parts successfully, but…
We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…
Matrix completion is one of the key problems in signal processing and machine learning. In recent years, deep-learning-based models have achieved state-of-the-art results in matrix completion. Nevertheless, they suffer from two drawbacks:…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…
Yang-Baxter operators from algebra structures appeared for the first time in [16], [17] and [8]. Later, Yang-Baxter systems from entwining structures were constructed in [5]. In this paper we show that an algebra factorisation can be…
Using the language of enriched $\infty$-categories, we formalize and generalize the definition of fusion n-category, and an analogue of iterative condensation of $E_i$-algebras. The former was introduced by Johnson-Freyd, and the latter by…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
This paper introduces a skew variant of the notion of enriched category, suitable for enrichment over a skew-monoidal category, the main novelty of which is that the elements of the enriched hom-objects need not be in bijection with the…
We consider filtering for a continuous-time, or asynchronous, stochastic system where the full distribution over states is too large to be stored or calculated. We assume that the rate matrix of the system can be compactly represented and…