a backtracking search tool for constructing combinatorial test suites

Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.

Search for signature inversion in the pi i(13/2) circle times upsilon i1(3/2) bands in Au-182,Au-184,Au-186

Search for low-spin signature inversion in the pi i(13/2) circle times nu i(13/2) bands in odd-odd Au-182,Au-184,Au-186 has been conducted through the standard in-beam gamma-spectroscopy techniques. The experiments for Au-182 and 186Au have been performed in the Japan Atomic Energy Agency (JAEA) via the Sm-152(Cl-35,5n)Au-182 and Yb-172(F-19,5n)Au-186 reactions, respectively. A study of Au-184 has been made using a multi-detector array GASP in LNL, Italy, via the Tb-159(Si-29,4n)Au-184 reaction. The pi i(13/2) circle times nu i(13/2) bands in these three nuclei have been identified and extended up to high-spin states. In particular, the inter-band connection between the pi i(13/2) nu i(13/2) band and the ground-state band in 184 Au has been established, leading to a firm spin-and-parity assignment for the pi i(13/2) circle times nu i(13/2) band. The low-spin signature inversion is found in the pi i(13/2) circle times nu i(13/2) bands in Au-182,Au-184,Au-186 according to our spin-assignment and the signature crossing observed at high-spin states.

Search for signature inversion in the pi i(13/2)circle times nu i(13/2) bands in Au-182,Au-184,Au-186

Search for low-spin signature inversion in the pi i(13/2) circle times nu i(13/2) bands in odd-odd Au-182,Au-184,Au-186 has been conducted through the standard in-beam gamma-spectroscopy techniques via the Sm-152(Cl-35,5n) Au-182, Yb-172(F-19,5n) (186)An, and Tb-159(Si-29,4n) (184)An reactions, respectively. The pi i(13/2) circle times nu i(13/2) bands in these three nuclei have been identified and extended up to high-spin states. In particular, the inter-band connection between the pi i(13/2) circle times nu i(13/2) band and the ground-state band in Au-184 has been established, leading to a firm spin-and-parity assignment for the pi i(13/2) circle times nu i(13/2) band. The low-spin signature inversion is found in the pi i(13/2) circle times nu i(13/2) bands according to our spin-assignment and-the signature crossing observed at high-spin states.

Search for beta-delayed fission of Ac-228

Radium was radiochemically separated from natural thorium. Thin Ra-228 ->beta Ac-228 sources were prepared and exposed to mica fission track detectors, and measured by an HPGe gamma-ray detector. The beta-delayed fission events of Ac-228 were observed and its beta-delayed fission probability was found to be (5 +/- 2)x10(-12).

SEARCH FOR THE BASIC REGULARITIES OF THE TRANSITION EMISSION OF EUROPIUM(II) ION IN COMPLEX FLUORIDES USING PATTERN-RECOGNITION

The relationship between structures of complex fluorides and spectral structure of Eu(II) ion in complex fluorides (AB(m)F(n)) is investigated by means of pattern recognition methods, such as KNN, ALKNN, BAYES, LLM, SIMCA and PCA. A learning set consisting of 32 f-f transition emission host compounds and 31 d-f transition emission host compounds and a test set consisting of 27 host compounds were characterized by 12 crystal structural parameters. These parameters, i.e. features, were reduced from 12 to 6 by multiple criteria for the classification of these host compounds as f-f transition emission or d-f transition emission. A recognition rate from 79.4 to 96.8% and prediction capabilities from 85.2 to 92.6% were obtained. According to the above results, the spectral structures of Eu(II) ion in seven unknown host lattices were predicted.

Methods for Parallelizing Search Paths in Phrasing

Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are techniques available that can eliminate redundant computations and perform remaining operations concurrently, effectively reducing the branching factors of these algorithms. This thesis applies these techniques to the problem of parsing natural language. The result is an efficient programming language that can reduce some of the expense associated with principle-based parsing and other search problems. The language is used to implement various natural language parsers, and the improvements are compared to those that result from implementing more deterministic theories of language processing.

Eutils-search - manual do usuário.

O software Eutils-search tem por objetivo trazer do banco de dados PubMed informações sobre artigos relacionados a genes de um organismo específico, de acordo com as regras referentes à taxa de acesso impostas pelo site. As informações trazidas são, então, armazenadas localmente em um banco de dados para acesso rápido. Além disso, o software também gera documentos XML correspondentes às informações do organismo requisitado. O eutils-search é uma ferramenta de apoio ao desenvolvimento de aplicações de mineração de textos voltadas para os domínios de biotecnologia e biologia molecular, baseada em informações textuais obtidas do banco de dados PubMed. Este documento apresenta os pré-requisitos e a descrição dos parâmetros necessários para utilização do software, bem como uma descrição de alguns aspectos internos do software, para melhor entendimento do processo que ele automatiza, além de alguns exemplos e uso.

A dichotomic search algorithm for mining and learning in domain-specific logics

Ferr?, S. and King, R. D. (2004) A dichotomic search algorithm for mining and learning in domain-specific logics. Fundamenta Informaticae. IOS Press. To appear

A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures

R. Daly and Q. Shen. A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 67-74.