Search results for "Finite set"
showing 10 items of 101 documents
One-directional quantum mechanical dynamics and an application to decision making
2020
In recent works we have used quantum tools in the analysis of the time evolution of several macroscopic systems. The main ingredient in our approach is the self-adjoint Hamiltonian $H$ of the system $\Sc$. This Hamiltonian quite often, and in particular for systems with a finite number of degrees of freedom, gives rise to reversible and oscillatory dynamics. Sometimes this is not what physical reasons suggest. We discuss here how to use non self-adjoint Hamiltonians to overcome this difficulty: the time evolution we obtain out of them show a preferable arrow of time, and it is not reversible. Several applications are constructed, in particular in connection to information dynamics.
A tomographic approach to non-Markovian master equations
2010
We propose a procedure based on symplectic tomography for reconstructing the unknown parameters of a convolutionless non-Markovian Gaussian noisy evolution. Whenever the time-dependent master equation coefficients are given as a function of some unknown time-independent parameters, we show that these parameters can be reconstructed by means of a finite number of tomograms. Two different approaches towards reconstruction, integral and differential, are presented and applied to a benchmark model made of a harmonic oscillator coupled to a bosonic bath. For this model the number of tomograms needed to retrieve the unknown parameters is explicitly computed.
On the power of inductive inference from good examples
1993
Abstract The usual information in inductive inference available for the purposes of identifying an unknown recursive function f is the set of all input/output examples (x,f(x)),n eN. In contrast to this approach we show that it is considerably more powerful to work with finite sets of “good” examples even when these good examples are required to be effectively computable. The influence of the underlying numberings, with respect to which the identification has to be realized, to the capabilities of inference from good examples is also investigated. It turns out that nonstandard numberings can be much more powerful than Godel numberings.
Invariants of transverse foliations
2012
Abstract We construct two invariants for a pair of transverse one-dimensional foliations on the plane. If the set of separatrices is Hausdorff in the space of leaves, the invariant is a distinguished graph. In case there are a finite number of separatrices the invariant is an indexed link.
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
Almost square Banach spaces
2014
We single out and study a natural class of Banach spaces -- almost square Banach spaces. In an almost square space we can find, given a finite set $x_1,x_2,\ldots,x_N$ in the unit sphere, a unit vector $y$ such that $\|x_i-y\|$ is almost one. These spaces have duals that are octahedral and finite convex combinations of slices of the unit ball of an almost square space have diameter 2. We provide several examples and characterizations of almost square spaces. We prove that non-reflexive spaces which are M-ideals in their biduals are almost square. We show that every separable space containing a copy of $c_0$ can be renormed to be almost square. A local and a weak version of almost square spa…
Fundamentals on Decision-Making Behavior
2011
This introductory chapter describes the fundamentals for later analysis, modeling and discussion of choice tasks and behavior. Figure 2.1 depicts the basic elements of the choice process which are relevant for the present work. On the left hand side, we see the general problem the decision makers are faced with: the choice task. Generally speaking, a choice task defines the problem of choosing the preferred out of a discrete and finite set of alternatives. The decision makers’ preferences determine what the preferred alternative is. Thus, in Sect. 2.1, we define both choice tasks and preferences.
Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems
2011
International audience; This paper describes new ways to tackle several important problems encountered in geometric constraint solving, in the context of CAD, and which are linked to the handling of under- and over-constrained systems. It presents a powerful decomposition algorithm of such systems. Our methods are based on the witness principle whose theoretical background is recalled in a first step. A method to generate a witness is then explained. We show that having a witness can be used to incrementally detect over-constrainedness and thus to compute a well-constrained boundary system. An algorithm is introduced to check if anchoring a given subset of the coordinates brings the number …
3-manifolds which are orbit spaces of diffeomorphisms
2008
Abstract In a very general setting, we show that a 3-manifold obtained as the orbit space of the basin of a topological attractor is either S 2 × S 1 or irreducible. We then study in more detail the topology of a class of 3-manifolds which are also orbit spaces and arise as invariants of gradient-like diffeomorphisms (in dimension 3). Up to a finite number of exceptions, which we explicitly describe, all these manifolds are Haken and, by changing the diffeomorphism by a finite power, all the Seifert components of the Jaco–Shalen–Johannson decomposition of these manifolds are made into product circle bundles.
The Syllogistic with Unity
2011
We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.