A method is given for the systematic generation of graphs representing known or hypothetical polyhedral topologies of crystals. The method is complete for some interesting types of polyhedral topologies insofar as all topologies which are possible under reasonable assumptions concerning crystal properties are generated. Restriction modules can be coupled with the enumeration algorithm such that...

In this paper an approach is described for solving propositional Satisfiability problems, which makes use of an adaptive technique. Its main feature is a new enumeration scheme, which is able to identify, at an early stage, hard sub-formulae. This scheme is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a c...

We study Boyer-Moore-type string searching algorithms. We analyze the Horspool’s variant. The searching time is linear. An exact expression of the linearity constant is derived and is proven to be asymptotically r. 1;~ d x < 2/(c + I), where c is the cardinality of the alphabet. We exhibit a stationary process and reduce the problem to a word enumeration problem. The same technique applies to o...

We study the notion of K-pairs in the local structure of the ωenumeration degrees. We introduce the notion of super almost zero sequences and investigate their structural properties. The study of degree structures has been one of the central themes in computability theory. Although the main focus has been on the structure of the Turing degrees and its local substructure, of the degrees below th...

We resolve the NP = P? question by providing an existential proof to the following conjecture on the characterization of polynomial time enumeration: A sufficient condition for the existence of a P-time algorithm for any enumeration problem is the existence of a partition hierarchy of the exponentially decreasing solution spaces, where each partition is polynomially bounded and the disjoint sub...

Determining the fate and survival of genetically engineered microorganisms released into the environment requires the development and application of accurate and practical methods of detection and enumeration. Several experiments were performed to examine quantitative recovery methods that are commonly used or that have potential applications. In these experiments, Erwinia herbicola and Enterob...

Linear discriminant analysis (LDA) is a commonly used classification method. It can provide important weight information for constructing a classificationmodel. However, real-world data sets generally have many features, not all of which benefit the classification results. If a feature selection algorithm is not employed, unsatisfactory classification will result, due to the high correlation be...

We prove that no subclass of the Σ 2 enumeration degrees containing the 3-c.e. enumeration degrees can be cupped to 0e by a single Σ 2 enumeration degree.

We present in this work a technique for designing approximation schemes and its application to the discrete resource sharing problem (dRSSP ). We use the (classical) oracle formalism, in which a reliable oracle provides some information (usually called “a guess”) that helps to construct a good approximated solution. This oracle technique is sometimes called “partial enumeration” [ST07] or “outp...