Tables for estimating amount and cost of materials and labor for stone, brick and plaster work

Thesis (B.S.)--University of Illinois, 1901.Ms.Includes index.Contains letter of approval signed by department chair. IU-

SAT-Based Synthesis Methods for Safety Specs

Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their scalability limitations. Instead of BDDs, we propose several new methods to synthesize finite-state systems from safety specifications using decision procedures for the satisfiability of quantified and unquantified Boolean formulas (SAT-, QBF- and EPR-solvers). The presented approaches are based on computational learning, templates, or reduction to first-order logic. We also present an efficient parallelization, and optimizations to utilize reachability information and incremental solving. Finally, we compare all methods in an extensive case study. Our new methods outperform BDDs and other existing work on some classes of benchmarks, and our parallelization achieves a super-linear speedup. This is an extended version of [5], featuring an additional appendix.Comment: Extended version of a paper at VMCAI'1

Software Model Checking with Explicit Scheduler and Symbolic Threads

In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate or yield the control explicitly to the scheduler. The formal verification of such software poses significant challenges. On the one side, each thread may have infinite state space, and might call for abstraction. On the other side, the scheduling policy is often important for correctness, and an approach based on abstracting the scheduler may result in loss of precision and false positives. Unfortunately, the translation of the problem into a purely sequential software model checking problem turns out to be highly inefficient for the available technologies. We propose a software model checking technique that exploits the intrinsic structure of these programs. Each thread is translated into a separate sequential program and explored symbolically with lazy abstraction, while the overall verification is orchestrated by the direct execution of the scheduler. The approach is optimized by filtering the exploration of the scheduler with the integration of partial-order reduction. The technique, called ESST (Explicit Scheduler, Symbolic Threads) has been implemented and experimentally evaluated on a significant set of benchmarks. The results demonstrate that ESST technique is way more effective than software model checking applied to the sequentialized programs, and that partial-order reduction can lead to further performance improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical methods in computer scienc

Determining the Repertoire of Immunodominant Proteins via Whole-Genome Amplification of Intracellular Pathogens

Culturing many obligate intracellular bacteria is difficult or impossible. However, these organisms have numerous adaptations allowing for infection persistence and immune system evasion, making them some of the most interesting to study. Recent advancements in genome sequencing, pyrosequencing and Phi29 amplification, have allowed for examination of whole-genome sequences of intracellular bacteria without culture. We have applied both techniques to the model obligate intracellular pathogen Anaplasma marginale and the human pathogen Anaplasma phagocytophilum, in order to examine the ability of phi29 amplification to determine the sequence of genes allowing for immune system evasion and long-term persistence in the host. When compared to traditional pyrosequencing, phi29-mediated genome amplification had similar genome coverage, with no additional gaps in coverage. Additionally, all msp2 functional pseudogenes from two strains of A. marginale were detected and extracted from the phi29-amplified genomes, highlighting its utility in determining the full complement of genes involved in immune evasion

The alpha 7 nicotinic receptor agonist PHA-543613 hydrochloride inhibits <i>Porphyromonas gingivalis</i>-induced expression of interleukin-8 by oral keratinocytes

Objective: The alpha 7 nicotinic receptor (α7nAChR) is expressed by oral keratinocytes. α7nAChR activation mediates anti-inflammatory responses. The objective of this study was to determine if α7nAChR activation inhibited pathogen-induced interleukin-8 (IL-8) expression by oral keratinocytes.&lt;p&gt;&lt;/p&gt; Materials and methods: Periodontal tissue expression of α7nAChR was determined by real-time PCR. OKF6/TERT-2 oral keratinocytes were exposed to &lt;i&gt;Porphyromonas gingivalis&lt;/i&gt; in the presence and absence of a α7nAChR agonist (PHA-543613 hydrochloride) alone or after pre-exposure to a specific α7nAChR antagonist (α-bungarotoxin). Interleukin-8 (IL-8) expression was measured by ELISA and real-time PCR. Phosphorylation of the NF-κB p65 subunit was determined using an NF-κB p65 profiler assay and STAT-3 activation by STAT-3 in-cell ELISA. The release of ACh from oral keratinocytes in response to &lt;i&gt;P. gingivalis&lt;/i&gt; lipopolysaccharide was determined using a GeneBLAzer M3 CHO-K1-blacell reporter assay.&lt;p&gt;&lt;/p&gt; Results: Expression of α7nAChR mRNA was elevated in diseased periodontal tissue. PHA-543613 hydrochloride inhibited &lt;i&gt;P. Gingivalis&lt;/i&gt;-induced expression of IL-8 at the transcriptional level. This effect was abolished when cells were pre-exposed to a specific α7nAChR antagonist, α-bungarotoxin. PHA-543613 hydrochloride downregulated NF-κB signalling through reduced phosphorylation of the NF-κB p65-subunit. In addition, PHA-543613 hydrochloride promoted STAT-3 signalling by maintenance of phosphorylation. Furthermore, oral keratinocytes upregulated ACh release in response to &lt;i&gt;P. Gingivalis&lt;/i&gt; lipopolysaccharide.&lt;p&gt;&lt;/p&gt; Conclusion: These data suggest that α7nAChR plays a role in regulating the innate immune responses of oral keratinocytes.&lt;p&gt;&lt;/p&gt

Colloidal suspensions in modulated light fields

Periodically-modulated potentials in the form of light fields have previously been applied to induce reversible phase transitions in dilute colloidal systems with long-range interactions. Here we investigate whether similar transitions can be induced in very dense systems, where inter-particle contacts are important. Using microscopy we show that particles in such systems are indeed strongly affected by modulated potentials. We discuss technical aspects relevant to generating the light-induced potentials and to imaging simultaneously the particles. We also consider what happens when the particle size is comparable with the modulation wavelength. The effects of selected modulation wavelengths as well as pure radiation pressure are illustrated.Comment: Accepted by J. Phys.: Condens. Matter, CODEF II Special Issue. 23 pages, 12 figure

Loss of Octarepeats in Two Processed Prion Pseudogenes in the Red Squirrel, Sciurus vulgaris

The N-terminal region of the mammalian prion protein (PrP) contains an ‘octapeptide’ repeat which is involved in copper binding. This eight- or nine-residue peptide is repeated four to seven times, depending on the species, and polymorphisms in repeat number do occur. Alleles with three repeats are very rare in humans and goats, and deduced PrP sequences with two repeats have only been reported in two lemur species and in the red squirrel, Sciurus vulgaris. We here describe that the red squirrel two-repeat PrP sequence actually represents a retroposed pseudogene, and that an additional and older processed pseudogene with three repeats also occurs in this species as well as in ground squirrels. We argue that repeat numbers may tend to contract rather than expand in prion retropseudogenes, and that functional prion genes with two repeats may not be viable

SAT-Based Combinational and Sequential Dependency Computation

We present an algorithm for computing both functional dependency and unateness of combinational and sequential Boolean func- tions represented as logic networks. The algorithm uses SAT-based tech- niques from Combinational Equivalence Checking (CEC) and Automatic Test Pattern Generation (ATPG) to compute the dependency matrix of multi-output Boolean functions. Additionally, the classical dependency definitions are extended to sequential functions and a fast approximation is presented to efficiently yield a sequential dependency matrix. Exten- sive experiments show the applicability of the methods and the improved robustness compared to existing approaches