On Normal Subgroups of Coxeter Groups Generated by Standard Parabolic Subgroups

We discuss one construction of nonstandard subgroups in the category of Coxeter groups. Two formulae for the growth series of such a subgroups are given. As an application we construct a flag simple convex polytope, whose f-polynomial has non-real roots.Comment: 12 pages, figure

Active experiments using rocket-borne shaped charge barium releases

A reliable payload system and scaled down shaped charges were developed for carrying out experiments in solar-terrestrial magnetospheric physics. Four Nike-Tomahawk flights with apogees near 450 km were conducted to investigate magnetospheric electric fields, and two Taurus-Tomahawk rockets were flown in experiments on the auroral acceleration process in discrete auroras. In addition, a radial shaped charge was designed for plasma perturbation experiments

Uniaxial-stress induced phase transitions in [001]c-poled 0.955Pb(Zn1/3Nb2/3)O3-0.045PbTiO3

First-order, rhombohedral to orthorhombic, stress-induced phase transitions have been evidenced by bulk charge-stress measurements and X-ray diffraction derived lattice strain measurements in [001]c-poled PZN-4.5PT. The transitions are induced by uniaxial, compressive loads applied either along or perpendicular to the poling direction. In each case, they occur via rotation of the polar vector in the Cm monoclinic plane and the induced lattice strain is hysteretic yet reversible. Although no depoling is observed in the transverse mode, net depolarization is observed under longitudinal stress which is important for the use of [001]c-poled PZN-PT and PMN-PT single crystals in Tonpilz-type underwater projectors.Comment: To be published in Applied Physics Letters, 16 pages, 3 figure

Propositional Encoding of Constraints over Tree-Shaped Data

We present a functional programming language for specifying constraints over tree-shaped data. The language allows for Haskell-like algebraic data types and pattern matching. Our constraint compiler CO4 translates these programs into satisfiability problems in propositional logic. We present an application from the area of automated analysis of (non-)termination of rewrite systems

FearNot! An Anti-Bullying Intervention: Evaluation of an Interactive Virtual Learning Environment

Original paper can be found at: http://www.aisb.org.uk/publications/proceedings.shtm

How unprovable is Rabin's decidability theorem?

We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical proofs of Rabin's theorem, is equivalent over the moderately strong second-order arithmetic theory $\mathsf{ACA}_0$ to a determinacy principle implied by the positional determinacy of all parity games and implying the determinacy of all Gale-Stewart games given by boolean combinations of ${\bf \Sigma^0_2}$ sets. It follows that complementation for tree automata is provable from $\Pi^1_3$- but not $\Delta^1_3$-comprehension. We then use results due to MedSalem-Tanaka, M\"ollerfeld and Heinatsch-M\"ollerfeld to prove that over $\Pi^1_2$-comprehension, the complementation theorem for tree automata, decidability of the MSO theory of the infinite binary tree, positional determinacy of parity games and determinacy of $\mathrm{Bool}({\bf \Sigma^0_2})$ Gale-Stewart games are all equivalent. Moreover, these statements are equivalent to the $\Pi^1_3$-reflection principle for $\Pi^1_2$-comprehension. It follows in particular that Rabin's decidability theorem is not provable in $\Delta^1_3$-comprehension.Comment: 21 page

Exploiting Macro-actions and Predicting Plan Length in Planning as Satisfiability

The use of automatically learned knowledge for a planning domain can significantly improve the performance of a generic planner when solving a problem in this domain. In this work, we focus on the well-known SAT-based approach to planning and investigate two types of learned knowledge that have not been studied in this planning framework before: macro-actions and planning horizon. Macro-actions are sequences of actions that typically occur in the solution plans, while a planning horizon of a problem is the length of a (possibly optimal) plan solving it. We propose a method that uses a machine learning tool for building a predictive model of the optimal planning horizon, and variants of the well-known planner SatPlan and solver MiniSat that can exploit macro actions and learned planning horizons to improve their performance. An experimental analysis illustrates the effectiveness of the proposed techniques

Electron microscopic visualization of tRNA genes with ferritin-avidin: biotin labels

A method is described for indirect electron microscopic visualization and mapping of tRNA and other short transcripts hybridized to DNA. This method depends upon the attachment of the electron-dense protein ferritin to the RNA, the binding being mediated by the remarkably strong association of the egg white protein avidin with biotin. Biotin is covalently attached to the 3' end of tRNA using an NH2 (CH2) 5NH2 bridge. The tRNA-biotin adduct is hybridized to complementcrry DNA sequences present in a single stranded nonhomology loop of a DNA:DNA heteroduplex. Avidin, covalently crosslinked to ferritin is mixed with the heteroduplex and becomes bound to the hybridized tRNA-biotin. Observation of the DNA:RNA-biotin:avidin-ferritin complex by electron microsdopy specifically and accurately reveals the position of the tRNA gene, with a frequency of labeling of approximately 50%