Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity measure is derived from a deformation energy whose Hessian reproduces the underlying Riemannian metric, and it is used to define length and energy of discrete path...

Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity measure is derived from a deformation energy whose Hessian reproduces the underlying Riemannian metric, and it is used to define length and energy of discrete path...

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

Let S be a discrete semigroup, m (S) the space of all bounded real functions on S with the usualsupremum norm. Let Acm (S) be a uniformly closed left invariant subalgebra of m (S) with 1 c A. We say that A is extremely left amenable if there isamultiplicative left invariant meanon A. Let P = {h ?A: h =|g-1,g | forsome g ?A, s ?S}. It isshown that . A is extremely left amenable if and only ...

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

The target of this paper is to draw attention to some important relations between different procedures of state space synthesis of discrete linear systems optimizing the quadratic cost function. Common form of the synthesis concerns one-dimensional and multi-dimensional control problems solved by Second Method of Lyapunov, Maximum Principle of Pontryagin and by Bellamn's Dynamic Programming. Em...

This paper addresses the problem of sampling from binary distributions with constraints. In particular, it proposes an MCMC method to draw samples from a distribution of the set of all states at a specified distance from some reference state. For example, when the reference state is the vector of zeros, the algorithm can draw samples from a binary distribution with a constraint on the number of...

We propose the assumption of quantum mechanics on a discrete space and time, which implies the modification of mathematical expressions for some postulates of quantum mechanics. In particular we have a Hilbert space where the vectors are complex functions of discrete variable. As a concrete example we develop a discrete analog of the one-dimensional quantum harmonic oscillator, using the depend...

In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

in this paper, the maximal dissipative extensions of a symmetric singular 1d discrete hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the hilbert space ℓ_{ω}²(z;c²) (z:={0,±1,±2,...}) are considered. we consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. for each of these cases we establish a self...