Related papers: Is 2NF a Stable Normal Form?
Retrieving relevant tables from extensive databases for a given natural language query is essential for accurately answering questions in tasks such as text-to-SQL. Existing table retrieval approaches select a pre-determined set of k tables…
Financial time-series analysis and forecasting have been extensively studied over the past decades, yet still remain as a very challenging research topic. Since the financial market is inherently noisy and stochastic, a majority of…
In limited data computerized tomography, the 2D or 3D problem can be reduced to a family of 1D problems using the differentiated backprojection (DBP) method. Each 1D problem consists of recovering a compactly supported function $f \in…
In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…
We propose Pushdown Normal Form (PDNF) Bisimulation to verify contextual equivalence in higher-order functional programming languages with local state. Similar to previous work on Normal Form (NF) bisimulation, PDNF Bisimulation is sound…
Let $\mathcal{F}\subset\mathcal{M}(D)$ and let $a, b$ and $c$ be three distinct complex numbers. If, there exist a holomorphic function $h$ on $D$ and a positive constant $\rho$ such that for each $f\in\mathcal{F},$ $f$ and $f^{'}$…
Asymptotic hyperstability is achievable under certain switching laws if at least one of the feed-forward parameterization: 1) possesses a strictly positive real transfer function, 2) a minimum residence time interval is respected for each…
Normalizing flows are powerful non-parametric statistical models that function as a hybrid between density estimators and generative models. Current learning algorithms for normalizing flows assume that data points are sampled…
Irreducible frequent patters (IFPs) are introduced for transactional databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the probability of which, P(x1,x2,...xn), cannot be represented as a product of the probabilities of two…
A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every…
Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…
In case of incomplete database tables, a possible world is obtained by replacing any missing value by a value from the corresponding attribute's domain that can be infinite. A possible key or possible functional dependency constraint is…
We investigate the data exchange from relational databases to RDF graphs inspired by R2RML with the addition of target shape schemas. We study the problems of consistency i.e., checking that every source instance admits a solution, and…
Normal form theory is developed deeply for planar smooth systems but has few results for piecewise-smooth systems because difficulties arise from continuity of the near-identity transformation, which is constructed piecewise. In this paper,…
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…
Analyzing and interpreting time-dependent stochastic data requires accurate and robust density estimation. In this paper we extend the concept of normalizing flows to so-called temporal Normalizing Flows (tNFs) to estimate time dependent…
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…
A decision list is an ordered list of rules. Each rule is specified by a term, which is a conjunction of literals, and a value. Given an input, the output of a decision list is the value corresponding to the first rule whose term is…
The dynamics of a rational surface map $f : X \dashrightarrow X$ are easier to analyse when $f$ is `algebraically stable'. Here we investigate when and how this condition can be achieved by conjugating $f$ with a birational change of…
Every fraction is a union of points, which are trivial regular fractions. To characterize non trivial decomposition, we derive a condition for the inclusion of a regular fraction as follows. Let $F = \sum_\alpha b_\alpha X^\alpha$ be the…