We consider suspension semi-flows of angle-multiplying maps on the circle. Under a Cgeneric condition on the ceiling function, we show that there exists an anisotropic Sobolev space[3] contained in the L space such that the Perron-Frobenius operator for the time-t-map acts on it and that the essential spectral radius of that action is bounded by the square root of the inverse of the minimum exp...

In robotics, a key problem is for a robot to explore its environment and use the information gathered by its sensors to jointly produce a map of its environment, together with an estimate of its position: so-called SLAM (Simultaneous Localization and Mapping) [13]. Various filtering methods – Particle Filtering, and derived Kalman Filter methods (Extended, Unscented) – have been applied success...

In this work, Blood Pressure (BP) Signal Compression in Salt Sensitive Dahl Rat has been done using Discrete Sine Transform (DST). In order to keep the user specified percentage root mean square difference (UPRD) within the tolerance, first transform coefficients are thresholded by bisection algorithm. The binary look up tables is used to store the position map for zero and nonzero coefficients...

We study fluctuations of the matrix coefficients for the quantized cat map. We consider the sum of matrix coefficients corresponding to eigenstates whose eigenphases lie in a randomly chosen window, assuming that the length of the window shrinks with Planck’s constant. We show that if the length of the window is smaller than the square root of Planck’s constant, but larger than the separation b...

In this paper, we propose a new scaling algorithm which performs the scaling up/down transform using an area pixel model rather than a point pixel model. The proposed algorithm uses a variable number of pixels of an original image to calculate a pixel of the scaled image. Our algorithm has good characteristics such as fine-edge and good smoothness. Different quality parameters (standard deviati...

We present a square root algorithm in Fq which generalizes Atkins’s square root algorithm [6] for q ≡ 5 (mod 8) and Kong et al.’s algorithm [8] for q ≡ 9 (mod 16). Our algorithm precomputes a primitive 2-th root of unity ξ where s is the largest positive integer satisfying 2|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square roo...

Square-root elds are diierentiable operator elds used in the construction of target direction elds for self-scaled conic programming, a unifying framework for primal-dual interior-point methods for linear programming, semideenite programming and second-order cone programming. In this article we investigate square-root elds for so-called isotropic self-scaled barrier functionals, i.e. self-scale...