Related papers: On Independence Atoms and Keys
Separate programming models for data transformation (declarative) and computation (procedural) impact programmer ergonomics, code reusability and database efficiency. To eliminate the necessity for two models or paradigms, we propose a…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.
The concept of autonomy is key to the IoT vision promising increasing integration of smart services and systems minimizing human intervention. This vision challenges our capability to build complex open trustworthy autonomous systems. We…
In this paper we introduce several natural definitions of asymptotic independence of two sequences of random elements. We discuss their basic properties, some simple connections between them and connections with properties of weak…
The independence clustering problem is considered in the following formulation: given a set $S$ of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k\}$ of $S$ into clusters such that the clusters…
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…
We introduce an axiomatic approach for characterizing quantum conditional entropy. Our approach relies on two physically motivated axioms: monotonicity under conditional majorization and additivity. We show that these two axioms provide…
Life continuously changes its own components and states at each moment through interaction with the external world, while maintaining its own individuality in a cyclical manner. Such a property, known as "autonomy," has been formulated…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
Independent Component Analysis (ICA) offers interpretable semantic components of embeddings. While ICA theory assumes that embeddings can be linearly decomposed into independent components, real-world data often do not satisfy this…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…
The test of independence is a crucial component of modern data analysis. However, traditional methods often struggle with the complex dependency structures found in high-dimensional data. To overcome this challenge, we introduce a novel…
Universal identifiers and hashing have been widely adopted in computer science from distributed financial transactions to data science. This is a consequence of their capability to avoid many shortcomings of relative identifiers, such as…
Systems are typically made from simple components regardless of their complexity. While the function of each part is easily understood, higher order functions are emergent properties and are notoriously difficult to explain. In networked…
We study some properties of the obstacle reactions associated with the solutions of unilateral obstacle problems with measure data. These results allow us to prove that, under very weak assumptions on the obstacles, the solutions do not…
To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of past synchronisations thanks to communication keys, thus…
The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…
Characterizing quantum correlations in terms of information-theoretic principles is a popular chapter of quantum foundations. Traditionally, the principles adopted for this scope have been expressed in terms of conditional probability…
In any known description of nature, two physical systems are considered independent of each other if any action on one of the systems does not change the other system. From our classical intuitions about the world, we further conclude that…