In [Vieira et al. 2004] we presented a new dynamic Metric Access Method (MAM) called DBM-tree. This structure, unlike any other MAM, explores the varying density of elements in the dataset that allows creating, in a controlled way, unbalanced trees. Every dynamic MAM that works with persistent data proposed so far uses the same principle employed in conventional trees, like the B-tree [Comer 19...

The present work aims at a formal description of the interface between prosody and pragmatics in the framework of Constraint-based Unified Grammar CUG. It focuses on two main aspects of this interface: (1) intonation patterns vs. speech acts and (2) stress vs. topicfocus articulation. First, four terminal contours are proposed: fall, mid, rise, and high rise. They are then mapped into the speec...

Persistent systems allow data to be manipulated in a manner independent of its location. In distributed persistent systems this location independence principle is extended to include data on other machines. The introduction of this principle raises new problems regarding naming and consistency that the Grasshopper project is attempting to solve. The Grasshopper system allows entities within the...

For choice with deterministic consequences, the standard rationality hypothesis is ordinality — i.e., maximization of a weak preference ordering. For choice under risk (resp. uncertainty), preferences are assumed to be represented by the objectively (resp. subjectively) expected value of a von Neumann– Morgenstern utility function. For choice under risk, this implies a key independence axiom; u...

A general path integral analysis of the separable Hamiltonian of Liouville-type is reviewed. The basic dynamical principle used is the Jacobi’s principle of least action for given energy which is reparametrization invariant, and thus the gauge freedom naturally appears. The choice of gauge in path integral corresponds to the separation of variables in operator formalism. The gauge independence ...

The complexity of simple stochastic games (SSGs) has been open since they were defined by Condon in 1992. Despite intensive effort, the complexity of this problem is still unresolved. In this paper, building on the results of [4], we establish a connection between the complexity of SSGs and the complexity of an important problem in proof complexity–the proof search problem for low depth Frege s...

The use of null hypotheses (in a statistical sense) is common in hard sciences but not in theoretical linguistics. Here the null hypothesis that the low frequency of syntactic dependency crossings is expected by an arbitrary ordering of words is rejected. It is shown that this would require star dependency structures, which are both unrealistic and too restrictive. The hypothesis of the limited...

We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems. For this purpose we develop a Prover-Delayer game which models the running time of DPLL procedures and we establish an information-theoretic method to obtain lower bounds to the runni...

In this paper we introduce and study enhanced notions of relative Pareto minimizers to constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency/minimality. Using advanced tools of variational analysis and generalized differentiation, we estab...