Search results for " function"
showing 10 items of 9395 documents
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…
BLD -mappings in $W^{2,2}$ are locally invertible
2000
We prove that mappings of bounded length distortion are local homeomorphisms if they have L 2 -integrable weak second derivatives.
Generalized Lebesgue points for Sobolev functions
2017
In this article, we show that a function $f\in M^{s,p}(X),$ $0<s\leq 1,$ $0<p<1,$ where $X$ is a doubling metric measure space, has generalized Lebesgue points outside a set of $\mathcal{H}^h$-Hausdorff measure zero for a suitable gauge function $h.$
Logical definability of NP-optimisation problems with monadic auxiliary predicates
1993
Given a first-order formula ϕ with predicate symbols e1...el, so,...,sr, an NP-optimisation problem on -structures can be defined as follows: for every -structure G, a sequence of relations on G is a feasible solution iff satisfies ϕ, and the value of such a solution is defined to be ¦S0¦. In a strong sense, every polynomially bounded NP-optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s1, ...,sr are restricted to be monadic. The result is proved by an Ehrenfeucht-Fraisse game and remains true in several more general situations.
Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals
2010
The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.
Understanding Quantum Algorithms via Query Complexity
2017
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…
Quadratic rational solvable groups
2012
Abstract A finite group G is quadratic rational if all its irreducible characters are either rational or quadratic. If G is a quadratic rational solvable group, we show that the prime divisors of | G | lie in { 2 , 3 , 5 , 7 , 13 } , and no prime can be removed from this list. More generally, if G is solvable and the field Q ( χ ) generated by the values of χ over Q satisfies | Q ( χ ) : Q | ⩽ k , for all χ ∈ Irr ( G ) , then the set of prime divisors of | G | is bounded in terms of k . Also, we prove that the degree of the field generated by the values of all characters of a semi-rational solvable group (see Chillag and Dolfi, 2010 [1] ) or a quadratic rational solvable group over Q is bou…
Finite State Verifiers with Constant Randomness
2012
We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.
Holomorphic Mappings of Bounded Type on (DF)-Spaces
1992
We study the holomorphic functions of bounded type defined on (DF)-spaces. We prove that they are of uniformly bounded type. The space of all these functions is a Frechet space with its natural topology. Some consequences and related results are obtained.
Fuzzy functions: a fuzzy extension of the category SET and some related categories
2000
<p>In research Works where fuzzy sets are used, mostly certain usual functions are taken as morphisms. On the other hand, the aim of this paper is to fuzzify the concept of a function itself. Namely, a certain class of L-relations F : X x Y -&gt; L is distinguished which could be considered as fuzzy functions from an L-valued set (X,Ex) to an L-valued set (Y,Ey). We study basic properties of these functions, consider some properties of the corresponding category of L-valued sets and fuzzy functions as well as briefly describe some categories related to algebra and topology with fuzzy functions in the role of morphisms.</p>