Formal verification of ASM designs using the MDG tool

In this paper, we present a formal hardware verification framework linking ASM with MDG. ASM (Abstract State Machine) is a state based language for describing transition systems. MDG (Multiway Decision Graphs) provides symbolic representation of transition systems with support of abstract sorts and functions. We implemented a transformation tool that automatically generates MDG models from ASM specifications, then formal verification techniques provided by the MDG tool, such as model checking or equivalence checking, can be applied on the generated models. We support this work with a case study of an Island Tunnel Controller, which behavior and structure were specified in ASM then using our ASM-MDG tool successfully verified within the MDG tool.

Trades and Graphs

The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.

Entanglement in a simple quantum phase transition

What entanglement is present in naturally occurring physical systems at thermal equilibrium? Most such systems are intractable and it is desirable to study simple but realistic systems that can be solved. An example of such a system is the one-dimensional infinite-lattice anisotropic XY model. This model is exactly solvable using the Jordan-Wigner transform, and it is possible to calculate the two-site reduced density matrix for all pairs of sites. Using the two-site density matrix, the entanglement of formation between any two sites is calculated for all parameter values and temperatures. We also study the entanglement in the transverse Ising model, a special case of the XY model, which exhibits a quantum phase transition. It is found that the next-nearest-neighbor entanglement (though not the nearest-neighbor entanglement) is a maximum at the critical point. Furthermore, we show that the critical point in the transverse Ising model corresponds to a transition in the behavior of the entanglement between a single site and the remainder of the lattice.

Magnetic susceptibility of the normal-superconducting transition in high-purity single-crystal α-uranium

We report complex ac magnetic susceptibility measurements of a superconducting transition in very high-quality single-crystal alpha-uranium using microfabricated coplanar magnetometers. We identify an onset of superconductivity at Tapproximate to0.7 K in both the real and imaginary components of the susceptibility which is confirmed by resistivity data. A superconducting volume fraction argument, based on a comparison with a calibration YBa2Cu3O7-delta sample, indicates that superconductivity in these samples may be filamentary. Our data also demonstrate the sensitivity of the coplanar micro-magnetometers, which are ideally suited to measurements in pulsed magnetic fields exceeding 100 T.

Packing complete multipartite graphs with 4-cycles

In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.

Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

Decomposing complete tripartite graphs into cycles of lengths 3 and 4

Necessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph K-r,K-s,K-t into exactly alpha 3-cycles and beta 4-cycles. (C) 1999 Elsevier Science B.V. All rights reserved.

Controlled doping of transition metal cations in alumina pillared clays

A two-step method of loading controlled amounts of transition metal cations into alumina pillared clays (Al-PILCs) is proposed. First, calcined Al-PILC was dispersed into an aqueous solution of sodium or ammonium ions. Increasing the pH of the dispersion resulted in an increase in the amount of cations loaded into the clay. The ion-doped Al-PILC was then exchanged with an aqueous solution of transition metal salt at a pH of similar to 4.5 to replace Na+ or NH4+ ions by transition metal cations. Analytical techniques such as atomic absorption spectroscopy, X-ray diffraction, diffuse reflectance-ultraviolet-visible spectroscopy, as well as N-2 adsorption were used to characterize the PILC products with and without the loading of metal ions. The introduced transition metal species exist in the forms of hydrated ions in the PILC hosts. The content of transition metal ions in the final product increased with the amount of Na+ or NH4+ loaded in the first step so that by controlling the pH of the dispersion in the first step, one can control the doping amounts of transition metal cations into Al-PILCs. A sample containing 0.125 mmol/g of nickel was thus obtained, which is similar to 3 times of that obtained by directly exchanging Al-PILC with Ni(NO3)(2) solution, while the pillared layered structures of the Al-PILC remained. The porosity analysis using N-2 adsorption data indicated that most of the doped transition metal ions dispersed homogeneously in the micropores of the Al-PILC, significantly affecting the micropore structure.

Central projections of Drosophila sensory neurons in the transition from embryo to larva

Sensory axons of different sensory modalities project into typical domains within insect ganglia. Tactile and gustatory axons project into a ventral layer of neuropil and proprioceptive afferents, including chordotonal axone, into an intermediate or dorsal layer. Here, we describe the central projections of sensory neurons in the first instar Drosophila larva, relating them to the projection of the same sensory afferents in the embryo and to sensory afferents of similar type in other insects. Several neurons show marked morphologic changes in their axon terminals in the transition between the embryo and larva. During a short morphogenetic period late in embryogenesis, the axon terminals of the dorsal bipolar dendrite stretch receptor change their shape and their distribution within the neuromere. In the larva, external sense organ neurons (es) project their axons into a ventral layer of neuropil. Chordotonal sensory neurons (ch) project into a slightly more dorsal region that is comparable to their projection in adults. The multiple dendrite (md) neurons show two distinctive classes of projection. One group of md neurons projects into the ventral-most neuropil region, the same region into which es neurons project. Members of this group are related by lineage to es neurons or share a requirement for expression of the same proneural gene during development. Other md neurons project into a more dorsal region. Sensory receptors projecting into dorsal neuropil possibly provide proprioceptive feedback from the periphery to central motorneurons and are candidates for future genetic and cellular analysis of simple neural circuitry. J. Comp. Neurol. 425:34-44, 2000. (C) 2000 Wiley-Liss, Inc.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.