In this paper, we show that a linear discrete-time system subject to input saturation is semi-globally exponentially stabilizable via linear state and/or output feedback laws as long as the system in the absence of input saturation is stabilizable and detectable, and has all its poles located inside or on the unit circle. Furthermore, the semi-globally stabilizing feedback laws are explicitly c...

This paper present a fixture design system of eccentric shaft for ginning machine.. Fixture is required in various industries according to their application. Designer design fixture according to dimension required by industry to fulfill our production tar gate. In traditional manufacturing process performing operation on eccentric shaft is critical. so holding a work piece in proper position du...

We propose an algorithm for enumeration and denumeration of words with given constraints on run lengths of ones (dklr-sequences). For large n, operation time of the algorithm (per symbol of a sequence) is at most O(log n log logn), where n is the length of enumerated words, whereas for the best known methods it is at least cn, c > 0. DOI: 10.1134/S0032946010040095

Mobile robots are becoming part of our every day living at home, work or entertainment. Due to their limited power capabilities, the development of new energy consumption models can lead to energy conservation and energy efficient designs. In this paper, we carry out a number of experiments and we focus on the motors power consumption of a specific robot called Wifibot. Based on the experimenta...

The problem of uniform exact model matching is studied via state and output feedback, for a class of linear time-varying analytic systems. The following two major issues are resolved: The nessecary and sufficient conditions for the problem to have a solution and the general analytical expressions for the controller matrices. A major feature of the proposed approach, is that it reduces the unifo...

Let M ! 1/2 be the additive group consisting of nearly holomorphic modular forms of weight 1/2 for Γ0(4) whose Fourier coefficients are integers and satisfy the Kohnen’s “plus space” condition (i.e. n-th coefficients vanish unless n ≡ 0 or 1 modulo 4). We also let B be the multiplicative group consisting of meromorphic modular forms for some characters of SL2(Z) of integral weight with leading ...

Introduced by Kraitchik and Lehmer, an x-pseudosquare is a positive integer n ≡ 1 (mod 8) that is a quadratic residue for each odd prime p ≤ x, yet is not a square. We give a subexponential upper bound for the least x-pseudosquare that improves on a bound that is exponential in x due to Schinzel. We also obtain an equi-distribution result for pseudosquares. An x-pseudopower to base g is a posit...

Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 with coordinates in Fq. In this paper, we give a deterministic algorithm which computes the reduction of N(f) modulo pb in O(n(8m)(h+b)p) bit operations. This is singly exponential in each of the parameters {h, b, p}, ...

where p is a prime power, epm(·) is the additive character epm(x) = e m and χ is a multiplicative character (mod p). The goals of this paper are threefold; first, to point out the similarity between exponential sums over finite fields and exponential sums over residue class rings (mod p) with m ≥ 2; second, to show how mixed exponential sums can be reduced to pure exponential sums when m ≥ 2 an...

We show that the set of all functions is equivalent to the set of all symmetric functions up to deterministic time complexity. In particular, for any function f , there is an equivalent symmetric function fsym such that f can be computed form fsym and vice-versa (modulo an extra deterministic linear time computation). For f over finite fields, fsym is (necessarily) over an extension field. This...