In 1998, Beals, Buhrman, Cleve, Mosca, and de Wolf showed that no super-polynomial quantum speedup is possible in the query complexity setting unless there is a promise on the input. We examine several types of “unstructured” promises, and show that they also are not compatible with super-polynomial quantum speedups. We conclude that such speedups are only possible when the input is known to ha...

We characterize the finite-dimensional elements of a free cylindric algebra. This solves Problem 2.10 in [Henkin, Monk, Tarski: Cylindric Algebras, North-Holland, 1971 and 1985]. We generalize the characterization to quasivarieties of Boolean algebras with operators in place of cylindric algebras. Free algebras play an important role in universal algebra, see e.g. AndrékaJónsson-Németi [2]. Fre...

A boolean particle swarm optimisation (PSO) algorithm is presented that builds on the strengths of earlier proposals but which by introducing a wholly random element into the search process shows greatly improved performance in higher dimensional search spaces in comparison also to the binary PSO algorithm of Kennedy and Eberhart.

Boolean algebras are affine complete by a well-known result of G. Grätzer. Various generalizations of this result have been obtained. Among them, a characterization of affine complete Stone algebras having a smallest dense element was given by R. Beazer. In this paper, generalizations of Beazer’s result are presented for algebras abstracting simultaneously Kleene and Stone algebras.

Boolean functions represent an important primitive when constructing many stream ciphers. Since they are often the only nonlinear element of such ciphers, without them the algorithm would be trivial to break. Therefore, it is not surprising there exist a substantial body of work on the methods of constructing Boolean functions. Among those methods, evolutionary computation (EC) techniques play ...

Quantitative measurements of the Hunchback transcription factor in Drosophila embryos show that its target genes can respond with a high degree of precision to the exact level of the protein, simulating a continuous, analog readout, while other target genes show a combinatorial effect, resembling a Boolean logic element.

qualifier Abstract: type(boolean = FALSE), alterable(FALSE), scope([object, optional]), descr("http://www.vandermeer.de/mama/doc/q/abstract.html"); This qualifier is derived from [DMTF-CIM]. It indicates that the object is abstract and serves only as base class. An instance of an abstract element cannot be created.

This paper describes the retrieval approach that Berkeley used in the INEX evaluation. The primary approach is the combination of a probabilistic methods using a Logistic regression algorithm for estimation of collection relevance and element relevance, along with Boolean constraints. The paper also discusses our approach to XML component retrieval and how component and document retrieval are c...