Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

Chain reduction enables reduced ordered binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) to each take advantage of the others' ability to symbolically represent Boolean functions in compact form. For any Boolean function, its chain-reduced ZDD (CZDD) representation will be no larger than its ZDD representation, and at most twice the size of its BDD representation. The chain-reduced BDD (CBDD) of a function will be no larger than its BDD representation, and at most three times the size of its CZDD representation. Extensions to the standard algorithms for operating on BDDs and ZDDs enable them to operate on the chain-reduced versions. Experimental evaluations on representative benchmarks for encoding word lists, solving combinatorial problems, and operating on digital circuits indicate that chain reduction can provide significant benefits in terms of both memory and execution time

Documentation of procedures for textural/spatial pattern recognition techniques

A C-130 aircraft was flown over the Sam Houston National Forest on March 21, 1973 at 10,000 feet altitude to collect multispectral scanner (MSS) data. Existing textural and spatial automatic processing techniques were used to classify the MSS imagery into specified timber categories. Several classification experiments were performed on this data using features selected from the spectral bands and a textural transform band. The results indicate that (1) spatial post-processing a classified image can cut the classification error to 1/2 or 1/3 of its initial value, (2) spatial post-processing the classified image using combined spectral and textural features produces a resulting image with less error than post-processing a classified image using only spectral features and (3) classification without spatial post processing using the combined spectral textural features tends to produce about the same error rate as a classification without spatial post processing using only spectral features

Exploring the phase diagram of the two-impurity Kondo problem

A system of two exchange-coupled Kondo impurities in a magnetic field gives rise to a rich phase space hosting a multitude of correlated phenomena. Magnetic atoms on surfaces probed through scanning tunnelling microscopy provide an excellent platform to investigate coupled impurities, but typical high Kondo temperatures prevent field-dependent studies from being performed, rendering large parts of the phase space inaccessible. We present an integral study of pairs of Co atoms on insulating Cu2N/Cu(100), which each have a Kondo temperature of only 2.6 K. In order to cover the different regions of the phase space, the pairs are designed to have interaction strengths similar to the Kondo temperature. By applying a sufficiently strong magnetic field, we are able to access a new phase in which the two coupled impurities are simultaneously screened. Comparison of differential conductance spectra taken on the atoms to simulated curves, calculated using a third order transport model, allows us to independently determine the degree of Kondo screening in each phase.Comment: paper: 14 pages, 4 figures; supplementary: 3 pages, 1 figure, 1 tabl

Modified Debye-Huckel Electron Shielding and Penetration Factor

Screened potential, modified by non standard electron cloud distributions responsible for the shielding effect on fusion of reacting nuclei in astrophysical plasmas, is derived. The case of clouds with depleted tails in space coordinates is discussed. The modified screened potential is obtained both from statistical mechanics arguments based on fluctuations of the inverse of the Debye-Huckel radius and from the solution of a Bernoulli equation used in generalized statistical mechanics. Plots and tables useful in evaluating penetration probability at any energy are provided.Comment: 9 pages, 3 figures, 3 table

On the geometry of closed G2-structure

We give an answer to a question posed recently by R.Bryant, namely we show that a compact 7-dimensional manifold equipped with a G2-structure with closed fundamental form is Einstein if and only if the Riemannian holonomy of the induced metric is contained in G2. This could be considered to be a G2 analogue of the Goldberg conjecture in almost Kahler geometry. The result was generalized by R.L.Bryant to closed G2-structures with too tightly pinched Ricci tensor. We extend it in another direction proving that a compact G2-manifold with closed fundamental form and divergence-free Weyl tensor is a G2-manifold with parallel fundamental form. We introduce a second symmetric Ricci-type tensor and show that Einstein conditions applied to the two Ricci tensors on a closed G2-structure again imply that the induced metric has holonomy group contained in G2.Comment: 14 pages, the Einstein condition in the assumptions of the Main theorem is generalized to the assumption that the Weyl tensor is divergence-free, clarity improved, typos correcte

A Map-Reduce Parallel Approach to Automatic Synthesis of Control Software

Many Control Systems are indeed Software Based Control Systems, i.e. control systems whose controller consists of control software running on a microcontroller device. This motivates investigation on Formal Model Based Design approaches for automatic synthesis of control software. Available algorithms and tools (e.g., QKS) may require weeks or even months of computation to synthesize control software for large-size systems. This motivates search for parallel algorithms for control software synthesis. In this paper, we present a Map-Reduce style parallel algorithm for control software synthesis when the controlled system (plant) is modeled as discrete time linear hybrid system. Furthermore we present an MPI-based implementation PQKS of our algorithm. To the best of our knowledge, this is the first parallel approach for control software synthesis. We experimentally show effectiveness of PQKS on two classical control synthesis problems: the inverted pendulum and the multi-input buck DC/DC converter. Experiments show that PQKS efficiency is above 65%. As an example, PQKS requires about 16 hours to complete the synthesis of control software for the pendulum on a cluster with 60 processors, instead of the 25 days needed by the sequential algorithm in QKS.Comment: To be submitted to TACAS 2013. arXiv admin note: substantial text overlap with arXiv:1207.4474, arXiv:1207.409

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees

In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$ and without degree-2 nodes -- called the "species tree". One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees from primary data (e.g. DNA sequences originating from some species in $X$), and then constructing a single phylogenetic tree maximizing the "concordance" with the input trees. The so-obtained tree is our estimation of the species tree and, when the input trees are defined on overlapping -- but not identical -- sets of labels, is called "supertree". In this paper, we focus on two problems that are central when combining phylogenetic trees into a supertree: the compatibility and the strict compatibility problems for unrooted phylogenetic trees. These problems are strongly related, respectively, to the notions of "containing as a minor" and "containing as a topological minor" in the graph community. Both problems are known to be fixed-parameter tractable in the number of input trees $k$, by using their expressibility in Monadic Second Order Logic and a reduction to graphs of bounded treewidth. Motivated by the fact that the dependency on $k$ of these algorithms is prohibitively large, we give the first explicit dynamic programming algorithms for solving these problems, both running in time $2^{O(k^2)} \cdot n$, where $n$ is the total size of the input.Comment: 18 pages, 1 figur

Cyclic cycle systems of the complete multipartite graph

In this paper, we study the existence problem for cyclic $\ell$-cycle decompositions of the graph $K_m[n]$, the complete multipartite graph with $m$ parts of size $n$, and give necessary and sufficient conditions for their existence in the case that $2\ell \mid (m-1)n$

Pore-scale Modeling of Viscous Flow and Induced Forces in Dense Sphere Packings

We propose a method for effectively upscaling incompressible viscous flow in large random polydispersed sphere packings: the emphasis of this method is on the determination of the forces applied on the solid particles by the fluid. Pore bodies and their connections are defined locally through a regular Delaunay triangulation of the packings. Viscous flow equations are upscaled at the pore level, and approximated with a finite volume numerical scheme. We compare numerical simulations of the proposed method to detailed finite element (FEM) simulations of the Stokes equations for assemblies of 8 to 200 spheres. A good agreement is found both in terms of forces exerted on the solid particles and effective permeability coefficients