68,884 research outputs found
On the closure of relational models
Relational models for contingency tables are generalizations of log-linear
models, allowing effects associated with arbitrary subsets of cells in a
possibly incomplete table, and not necessarily containing the overall effect.
In this generality, the MLEs under Poisson and multinomial sampling are not
always identical. This paper deals with the theory of maximum likelihood
estimation in the case when there are observed zeros in the data. A unique MLE
to such data is shown to always exist in the set of pointwise limits of
sequences of distributions in the original model. This set is equal to the
closure of the original model with respect to the Bregman information
divergence. The same variant of iterative scaling may be used to compute the
MLE in the original model and in its closure
Context-Free Path Querying by Matrix Multiplication
Graph data models are widely used in many areas, for example, bioinformatics,
graph databases. In these areas, it is often required to process queries for
large graphs. Some of the most common graph queries are navigational queries.
The result of query evaluation is a set of implicit relations between nodes of
the graph, i.e. paths in the graph. A natural way to specify these relations is
by specifying paths using formal grammars over the alphabet of edge labels. An
answer to a context-free path query in this approach is usually a set of
triples (A, m, n) such that there is a path from the node m to the node n,
whose labeling is derived from a non-terminal A of the given context-free
grammar. This type of queries is evaluated using the relational query
semantics. Another example of path query semantics is the single-path query
semantics which requires presenting a single path from the node m to the node
n, whose labeling is derived from a non-terminal A for all triples (A, m, n)
evaluated using the relational query semantics. There is a number of algorithms
for query evaluation which use these semantics but all of them perform poorly
on large graphs. One of the most common technique for efficient big data
processing is the use of a graphics processing unit (GPU) to perform
computations, but these algorithms do not allow to use this technique
efficiently. In this paper, we show how the context-free path query evaluation
using these query semantics can be reduced to the calculation of the matrix
transitive closure. Also, we propose an algorithm for context-free path query
evaluation which uses relational query semantics and is based on matrix
operations that make it possible to speed up computations by using a GPU.Comment: 9 pages, 11 figures, 2 table
Invariant measures concentrated on countable structures
Let L be a countable language. We say that a countable infinite L-structure M
admits an invariant measure when there is a probability measure on the space of
L-structures with the same underlying set as M that is invariant under
permutations of that set, and that assigns measure one to the isomorphism class
of M. We show that M admits an invariant measure if and only if it has trivial
definable closure, i.e., the pointwise stabilizer in Aut(M) of an arbitrary
finite tuple of M fixes no additional points. When M is a Fraisse limit in a
relational language, this amounts to requiring that the age of M have strong
amalgamation. Our results give rise to new instances of structures that admit
invariant measures and structures that do not.Comment: 46 pages, 2 figures. Small changes following referee suggestion
A Category Theoretical Argument Against the Possibility of Artificial Life
One of Robert Rosen's main contributions to the scientific community is summarized in his book 'Life itself'. There Rosen presents a theoretical framework to define living systems; given this definition, he goes on to show that living systems are not realisable in computational universes. Despite being well known and often cited, Rosen's central proof has so far not been evaluated by the scientific community. In this article we review the essence of Rosen's ideas leading up to his rejection of the possibility of real artificial life in silico. We also evaluate his arguments and point out that some of Rosen's central notions are ill- defined. The conclusion of this article is that Rosen's central proof is wrong
Quantifying Triadic Closure in Multi-Edge Social Networks
Multi-edge networks capture repeated interactions between individuals. In
social networks, such edges often form closed triangles, or triads. Standard
approaches to measure this triadic closure, however, fail for multi-edge
networks, because they do not consider that triads can be formed by edges of
different multiplicity. We propose a novel measure of triadic closure for
multi-edge networks of social interactions based on a shared partner statistic.
We demonstrate that our operalization is able to detect meaningful closure in
synthetic and empirical multi-edge networks, where common approaches fail. This
is a cornerstone in driving inferential network analyses from the analysis of
binary networks towards the analyses of multi-edge and weighted networks, which
offer a more realistic representation of social interactions and relations.Comment: 19 pages, 5 figures, 6 table
Algebraic optimization of recursive queries
Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. However, they do not offer appropriate update facilities, and do not support existing applications. To overcome these problems an SQL-like interface is required besides a logic-based interface.\ud
\ud
In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAlog. Query optimization is localized in one component: the relational query optimizer. Therefore, we have defined an eXtended Relational Algebra that allows recursive query formulation and can also be used for expressing executable schedules, and we have developed algebraic optimization strategies for recursive queries. In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations. We also describe how to push selections into the resulting transitive closure operations.\ud
\ud
The reason we focus on algebraic optimization is that, in our opinion, the new generation of advanced database systems will be built starting from existing state-of-the-art relational technology, instead of building a completely new class of systems
- …