Search results for "Gate"
showing 10 items of 1811 documents
Approximate convex hull of affine iterated function system attractors
2012
International audience; In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In additio…
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
Rademacher Theorem for Fréchet spaces
2010
Abstract Let X be a separable Frechet space. In this paper we define a class A of null sets in X that is properly contained in the class of Aronszajn null sets, and we prove that a Lipschitz map from an open subset of X into a Gelfand-Frechet space is Gateaux differentiable outside a set belonging to A. This is an extension to Frechet spaces of a result (see [PZ]) due to D. Preiss and L. Zajicek.
New Developments in Quantum Algorithms
2010
In this survey, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O(\sqrt{N}). This provides quantum speedups for any problem that can be expressed via Boolean formulas. This result can be also extended to span problems, a generalization of Boolean formulas. This provides an optimal quantum algorithm for any Boolean function in the black-box query model. The second new development is a quantum algorithm for solving systems of linear equations. In contrast with traditional algorithms that run in time O(N^{2.37...}) where N is the size of the system, the …
Projective mappings between projective lattice geometries
1995
The concept of projective lattice geometry generalizes the classical synthetic concept of projective geometry, including projective geometry of modules.
Projective spaces on partially ordered sets and Desargues' postulate
1991
We introduce a generalized concept of projective and Desarguean space where points (and lines) may be of different size. Every unitary module yields an example when we take the 1-and 2-generated submodules as points and lines. In this paper we develop a method of constructing a wide range of projective and Desarguean spaces by means of lattices.
A unified approach to projective lattice geometries
1992
The interest in pursuing projective geometry on modules has led to several lattice theoretic generalizations of the classical synthetic concept of projective geometry on vector spaces.
Conjugate unstable manifolds and their underlying geometrized Markov partitions
2000
Abstract Conjugate unstable manifolds of saturated hyperbolic sets of Smale diffeomorphisms are characterized in terms of the combinatorics of their geometrized Markov partitions. As a consequence, the relationship between the local and the global point of view is also made explicit.
Real-Time Implementation of Signal Processing Techniques for Disturbances Detection
2019
The real-time analysis of power quality (PQ) disturbances and islanding detection for distributed generation (DG) system using signal processing algorithms are still at a premature stage. Quick and reliable detection of islanding and PQ disturbances needs renewed focus. This paper is concentrated on the implementation of advanced signal processing techniques in field-programmable gate array (FPGA) to identify PQ and islanding events in real time. The proposed scheme is based on orthogonal empirical mode decomposition (OEMD) implemented in FPGA. This technique does not suffer from the loss of signal characteristics with successive decomposition levels. The performance of said technique is de…
Discretionary fiscal policy over the cycle: new evidence based on the ESCB Disaggregated Approach
2009
This paper explores how discretionary fiscal policies on the revenue side of the government budget have reacted to economic fluctuations in European Union countries. For this purpose, it uses data on legislated revenue changes and structural indicators provided twice per year by National Central Banks of European Union countries in the ESCB framework for analysing fiscal policy. The analysis is based on the estimation of fiscal policy rules linking these measures of legislated fiscal policy changes to the output gap and other control variables. Then, baseline results are compared with regression estimates where variations of cyclically-adjusted indicators are used as proxy for discretionary…