Search results for "Crete"
showing 10 items of 2495 documents
Application of kolmogorov complexity to inductive inference with limited memory
1995
A b s t r a c t . We consider inductive inference with limited memory[l]. We show that there exists a set U of total recursive functions such that U can be learned with linear long-term memory (and no short-term memory); U can be learned with logarithmic long-term memory (and some amount of short-term memory); if U is learned with sublinear long-term memory, then the short-term memory exceeds arbitrary recursive function. Thus an open problem posed by Freivalds, Kinber and Smith[l] is solved. To prove our result, we use Kolmogorov complexity.
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs
2017
Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…
Description of the limit set of Henstock–Kurzweil integral sums of vector-valued functions
2015
Abstract Let f be a function defined on [ 0 , 1 ] and taking values in a Banach space X . We show that the limit set I HK ( f ) of Henstock–Kurzweil integral sums is non-empty and convex when the function f has an integrable majorant and X is separable. In the same setting we give a complete description of the limit set.
Random analysis of geometrically non-linear FE modelled structures under seismic actions
1990
Abstract In the framework of the finite element (FE) method, by using the “total Lagrangian approach”, the stochastic analysis of geometrically non-linear structures subjected to seismic inputs is performed. For this purpose the equations of motion are written with the non-linear contribution in an explicit representation, as pseudo-forces, and with the ground motion modelled as a filtered non-stationary white noise Gaussian process, using a Tajimi-Kanai-like filter. Then equations for the moments of the response are obtained by extending the classical Ito's rule to vectors of random processes. The equations of motion, and the equations for moments, obtained here, show a perfect formal simi…
Nondeterministic Unitary OBDDs
2017
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.
A new formulation of the loop-tree duality at higher loops
2019
We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of the loop graph. In addition, the uncut propagators gain a modified $i \delta$-prescription, named dual-propagators. In this new framework one can go beyond graphs and calculate the integrand of loop amplitudes as a weighted sum of tree graphs, which form a tree-like object. These objects can be computed efficiently via recurrence relations.
Regularity of one-letter languages acceptable by 2-way finite probabilistic automata
1991
R. Freivalds proved that the nonregular language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-e (e>0). We prove that such an effect is impossible for one-letter languages: every one-letter language acceptable by 2pfa with an isolated cutpoint is regular.
Categories of lattice-valued sets as categories of arrows
2006
In this paper we introduce a category X(A) which is a generalization of the category of lattice-valued subsets of sets Set(JCPos) introduced by us earlier. We show the necessary and sufficient conditions for X(A) to be topological over XxA.
QUASI *-ALGEBRAS OF OPERATORS AND THEIR APPLICATIONS
1995
The main facts of the theory of quasi*-algebras of operators acting in a rigged Hilbert space are reviewed. The particular case where the rigged Hilbert space is generated by a self-adjoint operator in Hilbert space is examined in more details. A series of applications to quantum theories are discussed.
Graded polynomial identities and codimensions: Computing the exponential growth
2010
Abstract Let G be a finite abelian group and A a G-graded algebra over a field of characteristic zero. This paper is devoted to a quantitative study of the graded polynomial identities satisfied by A. We study the asymptotic behavior of c n G ( A ) , n = 1 , 2 , … , the sequence of graded codimensions of A and we prove that if A satisfies an ordinary polynomial identity, lim n → ∞ c n G ( A ) n exists and is an integer. We give an explicit way of computing such integer by proving that it equals the dimension of a suitable finite dimension semisimple G × Z 2 -graded algebra related to A.