Search results for "NUMBER"
showing 10 items of 3939 documents
Unary Probabilistic and Quantum Automata on Promise Problems
2015
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
On the space of all regular operators from C(K) into C(K)
1988
AbstractIt is known that Lr(E, C(K)), the space of all regular operators from E into C(K), is a Riesz space for all Riesz spaces E if and only if K is Stonian. We prove that this statement holds if E is replaced by C(K), where K is a compact space, the cardinal number of which satisfies a certain condition.
El origen del error de inversión y las bases neuronales subyacentes
2018
Una línea de investigación importante en la enseñanza-aprendizaje de las matemáticas, más concretamente en la resolución algebraica de problemas verbales, es la centrada en identificar los procesos cognitivos que se ponen en juego desde que un sujeto identifica una relación matemática en un problema hasta que la expresan mediante una expresión algebraica. Un caso en el que un número importante de estudiantes reconocen el esquema conceptual, pero no son capaces de plasmar una expresión matemática correcta sería el conocido como error de inversión. Este error aparece en los problemas en los que se plantean proposiciones verbales de comparación aditiva y multiplicativa. El nombre del error pro…
One-dimensional random walks with self-blocking immigration
2017
We consider a system of independent one-dimensional random walkers where new particles are added at the origin at fixed rate whenever there is no older particle present at the origin. A Poisson ansatz leads to a semi-linear lattice heat equation and predicts that starting from the empty configuration the total number of particles grows as $c \sqrt{t} \log t$. We confirm this prediction and also describe the asymptotic macroscopic profile of the particle configuration.
A model-based approach to Spotify data analysis: a Beta GLMM
2020
Digital music distribution is increasingly powered by automated mechanisms that continuously capture, sort and analyze large amounts of Web-based data. This paper deals with the management of songs audio features from a statistical point of view. In particular, it explores the data catching mechanisms enabled by Spotify Web API and suggests statistical tools for the analysis of these data. Special attention is devoted to songs popularity and a Beta model, including random effects, is proposed in order to give the first answer to questions like: which are the determinants of popularity? The identification of a model able to describe this relationship, the determination within the set of char…
Macroscopic capillarity without a constitutive capillary pressure function
2006
This paper challenges the foundations of the macroscopic capillary pressure concept. The capillary pressure function, as it is traditionally assumed in the constitutive theory of two-phase immiscible displacement in porous media, relates the pressure difference between nonwetting and wetting fluid to the saturation of the wetting fluid. The traditional capillary pressure function neglects the fundamental difference between percolating and nonpercolating fluid regions as first emphasized in R. Hilfer [Macroscopic equations of motion for two phase flow in porous media, Phys. Rev. E 58 (1998) 2090]. The theoretical approach proposed here starts from residual saturations as the volume fractions…
Relación entre conos de direcciones decrecientes y conos de direcciones de descenso
1984
Let f: N ? R a convex function and x I Ni, where N is a convex set in a real linear space. It is stated that, if Df<(x) is not empty, then Df<(x) is the algebraic interior of Df=(x).
On-line Construction of Two-Dimensional Suffix Trees
1999
AbstractWe say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1,n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1,n], we have the suffix tree forx[1,i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression m…
Binary distributions of concentric rings
2014
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single parameter. It is an outstanding feature of these distributions that joint probabilities relate to evenly spaced concentric rings. Kronecker product characterizations make them computationally attractive for a large number of variables. We study the behavior of different measures of dependence and derive maximum likelihood estimates when all nodes are observed and when the inner node is hidden.
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .