Comparison of the implicit enumeration method and the branch-and-bound method for logical design

Bibliography: p. 91-94.

A code for designing optimal networks by implicit enumeration using the all-interconnection inequality formulation : (a programming manual for ILLODIE-AIF) /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

An implicit enumeration program for zero-one integer programming -- ILLIP-2 /

Thesis (M.S.)--Illinois.

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation /

Bibliography: p. 27-29.

An Implicit enumeration program for zero-one integer programming,

Bibliography: p. 41-42.

A code for zero-one integer linear programming by implicit enumeration, a programming manual for ILLIP.

Issued also as thesis (M.S.) University of Illinois.

Implicit enumeration algorithm of integer programming on Illiac IV,

Bibliography: p. 29.

Examination timetabling automation using hybrid meta-heuristics

Trabalho de projeto realizado para obtenção do grau de Mestre em Engenharia Informática e de Computadores

A Cladistic Analysis of Inaequalium (Coscarón & Wygodzinsky, 1984), with Information on Geographical Distribution (Diptera: Simuliidae)

The black flies of the genus Inaequalium present a Neotropical distribution, with Panama at the northern limit, and the Argentinian pampas at the southern, but do not occur in the Central Amazon. This study offers a cladistic analysis establishing a hypothesis of relationships between the species of Inaequalium. A total of 37 characters have been considered in order to establish the hypothetic phylogenetic relationships. Cerqueirellum (Py-Daniel, 1983) was considered as outgroup. Data were analyzed using Henning 86 version 1.5. Wich the ie* command and implicit enumeration a unique possible cladogram was obtained in Inaequalium with 52 steps, and a CI of 0.76 and RI of 0.81. Two well-defined clades was obtained in the resulting cladogram, the "botulibranchium" species-group, includes I. travassosi, I. souzalopesi, I. botulibranchium and I. petropoliense, and the "inaequale" species-group, includes I. rappae, I. nahimi, I. inaequale, I. leopoldense, I. subnigrum, I. diversibranchium, I. mariavulcanoae, I. nogueirai, I. beaupertuyi, I. clavibranchium and I. subclavibranchium.

Um problema de programação da produção numa fundição automatizada

Este trabalho apresenta a modelagem de um problema particular de Programação da Produção numa Fundição Automatizada e sua resolução por um algoritmo de busca heurística, que explora a estrutura do problema.

On the asymptotic enumeration of accessible automata

We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series.

On state representations of nonlinear implicit systems

This work considers a semi-implicit system A, that is, a pair (S, y), where S is an explicit system described by a state representation (x)over dot(t) = f(t, x(t), u(t)), where x(t) is an element of R(n) and u(t) is an element of R(m), which is subject to a set of algebraic constraints y(t) = h(t, x(t), u(t)) = 0, where y(t) is an element of R(l). An input candidate is a set of functions v = (v(1),.... v(s)), which may depend on time t, on x, and on u and its derivatives up to a Finite order. The problem of finding a (local) proper state representation (z)over dot = g(t, z, v) with input v for the implicit system Delta is studied in this article. The main result shows necessary and sufficient conditions for the solution of this problem, under mild assumptions on the class of admissible state representations of Delta. These solvability conditions rely on an integrability test that is computed from the explicit system S. The approach of this article is the infinite-dimensional differential geometric setting of Fliess, Levine, Martin, and Rouchon (1999) (`A Lie-Backlund Approach to Equivalence and Flatness of Nonlinear Systems`, IEEE Transactions on Automatic Control, 44(5), (922-937)).

Evaluation of culture media for enumeration of Lactobacillus acidophilus, Lactobacillus casei and Bifidobacterium animalis in the presence of Lactobacillus delbrueckii subsp bulgaricus and Streptococcus thermophilus

The study compared the growth capability of probiotic (Lactobacillus acidophilus La05, Lactobacillus casei Lc01 and Bifidobacterium animalis Bb12) and non-probiotic (Lactobacillus delbrueckii subsp bulgaricus and Streptococcus thermophilus) cultures on twenty-one culture media grouped according to selectivity: nonselective agars, selective agars without antibiotics and MRS agars containing different combinations of lithium chloride, cystein, bile salts and antibiotics. Four of these media were selected for quantitative enumeration of L acidophilus La05, L casei Lc01, and B. animalis Bb12. The best culture media and incubation conditions for enumeration of the probiotic cultures were: B. animalis: MRS agar with dicloxacillin, 37 degrees C or 42 degrees C, anaerobiosis; L acidophilus: MRS agar with bile salts, 37 degrees C or 42 degrees C, aerobiosis; L casei: MRS agar with lithium chloride and sodium propionate, 37 degrees C or 42 degrees C, aerobiosis or anaerobiosis. Plating on MRS with glucose replaced by maltose, 37 degrees C or 42 degrees C, anaerobiosis, will distinguish probiotic from non-probiotic cultures. For enumeration of each probiotic in a mixed culture, the following media and incubation conditions were recommended: B. animalis: 4ABC-MRS, 42 degrees C, anaerobiosis, L acidophilus: LC medium, 42 degrees C, aerobiosis or anaerobiosis and L casei: LP-MRS, 42 degrees C, aerobiosis or anaerobiosis. In all experiments, differences in counts using pour plating or surface plating were not significant (P <= 0.05). (C) 2008 Swiss Society of Food Science and Technology. Published by Elsevier Ltd. All rights reserved.

Distinct conformational properties determined by implicit and explicit representation of protein-solvent interactions. An analytical and computer simulation study

In the protein folding problem, solvent-mediated forces are commonly represented by intra-chain pairwise contact energy. Although this approximation has proven to be useful in several circumstances, it is limited in some other aspects of the problem. Here we show that it is possible to achieve two models to represent the chain-solvent system. one of them with implicit and other with explicit solvent, such that both reproduce the same thermodynamic results. Firstly, lattice models treated by analytical methods, were used to show that the implicit and explicitly representation of solvent effects can be energetically equivalent only if local solvent properties are time and spatially invariant. Following, applying the same reasoning Used for the lattice models, two inter-consistent Monte Carlo off-lattice models for implicit and explicit solvent are constructed, being that now in the latter the solvent properties are allowed to fluctuate. Then, it is shown that the chain configurational evolution as well as the globule equilibrium conformation are significantly distinct for implicit and explicit solvent systems. Actually, strongly contrasting with the implicit solvent version, the explicit solvent model predicts: (i) a malleable globule, in agreement with the estimated large protein-volume fluctuations; (ii) thermal conformational stability, resembling the conformational hear resistance of globular proteins, in which radii of gyration are practically insensitive to thermal effects over a relatively wide range of temperatures; and (iii) smaller radii of gyration at higher temperatures, indicating that the chain conformational entropy in the unfolded state is significantly smaller than that estimated from random coil configurations. Finally, we comment on the meaning of these results with respect to the understanding of the folding process. (C) 2009 Elsevier B.V. All rights reserved.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.