Search results for "Arithmetic"
showing 10 items of 271 documents
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…
Parsimony hierarchies for inductive inference
2004
AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…
Nonlinear systems solver in floating-point arithmetic using LP reduction
2009
This paper presents a new solver for systems of nonlinear equations. Such systems occur in Geometric Constraint Solving, e.g., when dimensioning parts in CAD-CAM, or when computing the topology of sets defined by nonlinear inequalities. The paper does not consider the problem of decomposing the system and assembling solutions of subsystems. It focuses on the numerical resolution of well-constrained systems. Instead of computing an exponential number of coefficients in the tensorial Bernstein basis, we resort to linear programming for computing range bounds of system equations or domain reductions of system variables. Linear programming is performed on a so called Bernstein polytope: though,…
Rejected axioms for the “nonsense-logic” W and the k-valued logic of Sobociński
2009
In this paper rejection systems for the “nonsense-logic” W and the k-valued implicational-negational sentential calculi of Sobocinski are given. Considered systems consist of computable sets of rejected axioms and only one rejection rule: the rejection version of detachment rule.
Polynomial method to study the entanglement of pure N-qubit states
2009
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the number of unentangled qubits of pure N-qubit states.
Hybrid bases for varieties of semigroups
2003
We consider the lower part of the lattice of varieties of semigroups. We present finite bases of hybrid identities for the varieties of normal bands, commutative bands and abelian groups of finite exponent. The variety A n,0 of abelian groups provides an example of a variety which has no finite base of hyperidentities (cf. [12]) but has a finite base of hybrid identities.
Thin Bases of Order Two
2001
AbstractA set A⊆N0 is called a basis of order two if A+A≔{a+a′∣a, a′∈A}=N0. If n∈N then A(n) denotes the number of a∈A with 1⩽a⩽n. In this paper bases A, B, C of order two are given such thatlimA(n)n=253,limB(n)n=72andlimC(n)n=101653.
The Star Height One Problem for Irreducible Automata
1993
The star height of a regular expression is, informally, the maximum number of nested stars in the expression. The star height of a regular language is the minimal star height of a regular expression denoting this language. The notion of star height indicates in a certain sense the “loop complexity” of a regular expression and thus it gives a measure of the complexity of a regular language.
INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
2006
The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.