Search results for "Exponent"
showing 10 items of 896 documents
Improved Constructions of Quantum Automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.
Exponential Codimension Growth of PI Algebras: An Exact Estimate
1999
Abstract LetAbe an associative PI-algebra over a fieldFof characteristic zero. By studying the exponential behavior of the sequence of codimensions {cn(A)} ofA, we prove thatInv(A)=limn→∞ c n ( A ) always exists and is an integer. We also give an explicit way for computing such integer: letBbe a finite dimensionalZ2-graded algebra whose Grassmann envelopeG(B) satisfies the same identities ofA; thenInv(A)=Inv(G(B))=dim C(0)+dim C(1)whereC(0)+C(1)is a suitableZ2-graded semisimple subalgebra ofB.
Scaling behavior of an airplane-boarding model
2013
An airplane-boarding model, introduced earlier by Frette and Hemmer [Phys. Rev. E 85, 011130 (2012)], is studied with the aim of determining precisely its asymptotic power-law scaling behavior for a large number of passengers $N$. Based on Monte Carlo simulation data for very large system sizes up to $N={2}^{16}=65\phantom{\rule{0.16em}{0ex}}536$, we have analyzed numerically the scaling behavior of the mean boarding time $\ensuremath{\langle}{t}_{b}\ensuremath{\rangle}$ and other related quantities. In analogy with critical phenomena, we have used appropriate scaling Ans\"atze, which include the leading term as some power of $N$ (e.g., $\ensuremath{\propto}$${N}^{\ensuremath{\alpha}}$ for …
Lengths of radii under conformal maps of the unit disc
1999
If E f ( R ) E_{f}(R) is the set of endpoints of radii which have length greater than or equal to R > 0 R>0 under a conformal map f f of the unit disc, then cap E f ( R ) = O ( R − 1 / 2 ) \operatorname {cap} E_{f}(R)=O(R^{-1/2}) as R → ∞ R\to \infty for the logarithmic capacity of E f ( R ) E_{f}(R) . The exponent − 1 / 2 -1/2 is sharp.
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…
Rigidity of random networks of stiff fibers in the low-density limit.
2001
Rigidity percolation is analyzed in two-dimensional random networks of stiff fibers. As fibers are randomly added to the system there exists a density threshold ${q=q}_{\mathrm{min}}$ above which a rigid stress-bearing percolation cluster appears. This threshold is found to be above the connectivity percolation threshold ${q=q}_{c}$ such that ${q}_{\mathrm{min}}=(1.1698\ifmmode\pm\else\textpm\fi{}{0.0004)q}_{c}.$ The transition is found to be continuous, and in the universality class of the two-dimensional central-force rigidity percolation on lattices. At percolation threshold the rigid backbone of the percolating cluster was found to break into rigid clusters, whose number diverges in the…
On the exponential growth of graded Capelli polynomials
2013
In a free superalgebra over a field of characteristic zero we consider the graded Capelli polynomials Cap M+1[Y,X] and Cap L+1[Z,X] alternating on M+1 even variables and L+1 odd variables, respectively. Here we compute the superexponent of the variety of superalgebras determinated by Cap M+1[Y,X] and Cap L+1[Z,X]. An essential tool in our computation is the generalized-six-square theorem proved in [3].
Stability and -gain controller design for positive switched systems with mixed time-varying delays
2013
This paper investigates the problems of stability and L"1-gain controller design for positive switched systems with mixed time-varying delays. The mixed time-varying delays are presented in the forms of discrete delay and distributed delay. The purpose of this paper is to design a class of switching signals and a state feedback controller for the considered system such that the resulting closed-loop system is exponentially stable with L"1-gain performance. By constructing an appropriate co-positive type Lyapunov-Krasovskii functional and using the average dwell time approach, we propose a sufficient condition to ensure the exponential stability with weighted L"1-gain performance for the sys…
Optimal nonlinear damping control of second-order systems
2020
Novel nonlinear damping control is proposed for the second-order systems. The proportional output feedback is combined with the damping term which is quadratic to the output derivative and inverse to the set-point distance. The global stability, passivity property, and convergence time and accuracy are demonstrated. Also the control saturation case is explicitly analyzed. The suggested nonlinear damping is denoted as optimal since requiring no design additional parameters and ensuring a fast convergence, without transient overshoots for a non-saturated and one transient overshoot for a saturated control configuration.
Analysis and Evaluation of Adaptive RSSI-based Ranging in Outdoor Wireless Sensor Networks
2019
Estimating inter-node distances based on received radio signal strength (RSSI) is the foundation of RSSI-based outdoor localization in wireless sensor networks (WSNs). However, the accuracy of RSSI-based ranging depends on environmental and weather conditions. Therefore, it is important that RSSI-based ranging adapts to prevailing conditions to improve its range and location accuracy. This paper analyzes and evaluates RSSI-based ranging and adaptive techniques in outdoor WSNs to improve the range quality. The findings highlight the effects of path loss exponent (PLE) estimation error and temperature change on RSSI-based ranging. Consequently, we analyze techniques for mitigating these detri…