Search results for "PROB"
showing 10 items of 8859 documents
Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
1999
It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter-type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid where the expressions of a given element have bounded lengths, and where left and right lowest common multiples exist. A Garside monoid is a Gaussian monoid in which the left and right lowest common multiples satisfy an additional symmetry condition. A Gaussian group is the group of fractions of a Gaussian monoid, and a Garside group is the group of fractions of a Garside monoid. Braid groups and, more genera…
A General Framework for the One Center Location Problem
1992
This paper deals with an optimization problem where the objective function F is defined on a real vector space X by F(x) = γ(w 1║x - a 1║1, ⋯, w n ║x - a n║ n ), a formula in which a 1, ⋯, a n are n given points in X, ║∙║1, ⋯, ║∙║ n n norms on X, w 1, ⋯, w n positive numbers and γ a monotone norm on ℝ n . A geometric description of the set of optimal solutions to the problem min F(x) is given, illustrated by some examples. When all norms ║∙║i are equal, and γ being successively the l 1 , l ∞ and l 2-norm, a particular study is made, which shows the peculiar role played by the l 1-norm.
Running time to recognize nonregular languages by 2-way probabilistic automata
1991
R. Freivalds proved that the language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-ɛ. A.G.Greenberg and A.Weiss proved that no 2pfa can recognize this language in expected time \(T(n) = c^\circ{(n)}\). For arbitrary languages C.Dwork and L.Stockmeyer showed somewhat less: if a language L is recognized by a 2pfa in expected time \(T(n) = c^{n^\circ{(1)} }\), then L is regular. First, we improve this theorem replacing the expected time by the time with probability 1-ɛ. On the other hand, time bound by C.Dwork and L.Stockmeyer cannot be improved: for arbitrary k≥2 we exhibit a specific nonregular language that can be recognized by 2…
Optimization problem in inductive inference
1995
Algorithms recognizing to which of n classes some total function belongs are constructed (n > 2). In this construction strategies determining to which of two classes the function belongs are used as subroutines. Upper and lower bounds for number of necessary strategies are obtained in several models: FIN- and EX-identification and EX-identification with limited number of mindchanges. It is proved that in EX-identification it is necessary to use n(n−1)/2 strategies. In FIN-identification [3n/2 − 2] strategies are necessary and sufficient, in EX-identification with one mindchange- n log2n+o(n log2n) strategies.
Packing a Trunk
2003
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car trunk, the aim is to pack as many identical boxes of size 4 × 2 × 1 units as possible into the interior of the trunk. This measure is important for car manufacturers, because it is a standard in the European Union.
Periodic Orbits in the Isosceles Three-Body Problem
1991
The Saturn’s satellites Janus and Epimetheus are the first known bodies in the Solar System that has horseshoe orbits in a frame that rotates with uniform angular velocity. Both satellites have similar masses and orbital elements when they are far from one another. Moreover, their orbits are nearly symmetric. In fact, in the past, they have been identify as a unique satellite and afterwards, some mathematical theories about their orbits has been necessaries to understand why they do not collide. In particular, the interest in planar three-body problem with two small masses has increased6. We assume that the two small masses have similar symmetric initial conditions. The aim of this paper is…
Iterated Conditionals and Characterization of P-Entailment
2021
In this paper we deepen, in the setting of coherence, some results obtained in recent papers on the notion of p-entailment of Adams and its relationship with conjoined and iterated conditionals. We recall that conjoined and iterated conditionals are suitably defined in the framework of conditional random quantities. Given a family \(\mathcal {F}\) of n conditional events \(\{E_{1}|H_{1},\ldots , E_{n}|H_{n}\}\) we denote by \(\mathcal {C}(\mathcal {F})=(E_{1}|H_{1})\wedge \cdots \wedge (E_{n}|H_{n})\) the conjunction of the conditional events in \(\mathcal F\). We introduce the iterated conditional \(\mathcal {C}(\mathcal {F}_{2})|\mathcal {C}(\mathcal {F}_{1})\), where \(\mathcal {F}_{1}\)…
Action-Angle Variables
2001
In the following we will assume that the Hamiltonian does not depend explicitly on time; ∂H/∂t = 0. Then we know that the characteristic function W(q i , P i ) is the generator of a canonical transformation to new constant momenta P i , (all Q i , are ignorable), and the new Hamiltonian depends only on the P i ,: H = K = K(P i ). Besides, the following canonical equations are valid: $$ \dot Q_i = \frac{{\partial K}} {{\partial P_i }} = v_i = const. $$ (1) $$ \dot P_i = \frac{{\partial K}} {{\partial Q_i }} = 0. $$ (2)
Doubly nonlinear equations with unbounded operators
2004
Abstract The solvability of the evolution system v′(t)+ B (t)u(t)∋ f (t),v(t)∈ A (t)u(t) , 0 A (t) are bounded, possibly degenerate, subdifferentials and B (t) are unbounded subdifferentials.
Rigidity transition in two-dimensional random fiber networks
2000
Rigidity percolation is analyzed in two-dimensional random fibrous networks. The model consists of central forces between the adjacent crossing points of the fibers. Two strategies are used to incorporate rigidity: adding extra constraints between second-nearest crossing points with a probability p(sn), and "welding" individual crossing points by adding there four additional constraints with a probability p(weld), and thus fixing the angles between the fibers. These additional constraints will make the model rigid at a critical probability p(sn)=p(sn)(c) and p(weld)=p(weld)(c), respectively. Accurate estimates are given for the transition thresholds and for some of the associated critical e…