Intensive Archaeological Survey of the East Crystal Falls Parkway (CR 272) Improvements Project, From US 183 to US 183A, Williamson County, Texas

PROJECT TITLE: Intensive Archaeological Survey of the East Crystal Falls Parkway (CR 272) Improvements Project, From US 183 to US 183A, Williamson County, Texas LOCATION: The project is located in southwestern Williamson County roughly 1.5 miles east of the City of Leander, Texas. The project begins at US 183 and runs northeastward terminating at US 183A. The project area is located on the Leander, Texas USGS 7.5-minute topographic quadrangle map. PURPOSE OF WORK: The project sponsor is fulfilling regulatory requirements in compliance with the Texas Antiquities Code and Section 106 of the National Historic Preservation Act. PROJECT SPONSOR: Texas Department of Transportation PROJECT LANDOWNER: City of Leander, Texas INSTITUTION CONDUCTING INVESTIGATION: SWCA Environmental Consultants PRINCIPAL INVESTIGATOR: Mary Jo Galindo SWCAPROJECT NUMBER: 15525-AUS. TXDOT CSJ: 0914-05-138 TEXAS ANTIQUITIES PERMIT: 5373 PERSONNEL INVOLVED IN FIELDWORK: Christian Hartnett (8 hours-archaeological field supervisor) and Abigail Peyton (8 hours-archaeological technician) PERSONNEL INVOLVED IN REPORT PREPARATION: Christian Hartnett (32 hours-report preparation), Abigail Peyton (5 hours-report preparation) and Carol Carpenter (2 hours-cartographic work). PROJECT SCOPE AND SUMMARY: The County Road (CR) CR 272 Improvements Project is approximately 1.1 miles long, 110 feet wide, and maximally 3 to 4 feet deep. The project will include a railroad crossing upgrade and other intersection, signal, and safety improvements. SWCA conducted an archaeological background review and intensive pedestrian survey of the project area to determine if any significant archaeological resources would be impacted by the proposed project. DATE OF WORK: August 20, 2009. NUMBER OF ACRES SURVEYED: Approximately 13.5 acres NUMBER OF SITES: None. CURATION: No artifacts were collected, thus nothing was curated. SUMMARY OF RESULTS AND RECOMMENDATIONS: No archaeological resources were identified during the course of fieldwork. Based on these investigations, no further archaeological work is ecommended for the proposed CR 272 Improvements Project

Observations from Shadowed Collodion Replicas of Teeth with Amalgam Restorations

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/68294/2/10.1177_00220345570360041901.pd

Quick actuating closure and handling system

A quick activating closure and handling system, which utilizes conical sections for locking, was developed to allow quick access to the combustor internal components of the 8 ft High Temperature Tunnel. These critical components include the existing methane spraybar, a transpiration cooled nozzle and the new liquid oxygen (LOX) injection system housed within the combustor. A substantial cost savings will be realized once the mechanism is installed since it will substantially reduce the access time and increase the time available for conducting wind tunnel tests. A need exists for more frequent inspections when the wind tunnel operates at the more severe conditions generated by using LOX in the combustor. A loads analysis and a structural (finite element) analysis were conducted to verify that the new closure system is compatible with the existing pressure shell. In addition, strain gages were placed on the pressure vessel to verify how the pressure shell reacts to transient pressure loads. A scale model of the new closure system was built to verify the operation of the conical sections in the locking mechanisms

The clinical pharmacology of intranasal l-methamphetamine.

BackgroundWe studied the pharmacology of l-methamphetamine, the less abused isomer, when used as a nasal decongestant.Methods12 subjects self-administered l-methamphetamine from a nonprescription inhaler at the recommended dose (16 inhalations over 6 hours) then at 2 and 4 (32 and 64 inhalations) times this dose. In a separate session intravenous phenylephrine (200 microg) and l-methamphetamine (5 mg) were given to define alpha agonist pharmacology and bioavailability. Physiological, cardiovascular, pharmacokinetic, and subjective effects were measured.ResultsPlasma l-methamphetamine levels were often below the level of quantification so bioavailability was estimated by comparing urinary excretion of the intravenous and inhaled doses, yielding delivered dose estimates of 74.0 +/- 56.1, 124.7 +/- 106.6, and 268.1 +/- 220.5 microg for ascending exposures (mean 4.2 +/- 3.3 microg/inhalation). Physiological changes were minimal and not dose-dependent. Small decreases in stroke volume and cardiac output suggesting mild cardiodepression were seen.ConclusionInhaled l-methamphetamine delivered from a non-prescription product produced minimal effects but may be a cardiodepressant

Analyzing Mutations of Spt7 Protein That Disrupt Interaction with SF3B Subunits

Proper transcription, the process of converting DNA to RNA, is crucial for the health and viability of an organism. This process is regulated by many proteins, such as co-transcriptional activators; one being the protein complex known as Spt-Ada-Gcn5-acetyltransferase, or SAGA. While much is known about the roles of SAGA in cell processes, how SAGA’s subunits promote functionality is still unknown. The focus of this study is to analyze the purpose of SAGA’s SF3B subunits. These subunits are also found in the spliceosome, the compound responsible for generating mature RNA. SAGA has no known functions relating to this process, so the reason the SF3B components are in SAGA is unclear. Spt7, another SAGA subunit, interacts with both SF3B subunits. In this study, a yeast two hybrid assay was performed where different Spt7 mutants were screened. This was done by transforming yeast with Spt7 mutants, analyzing the protein interactions and sequencing the mutants to determine their mutations. A key result of this study is in the determining that the two SF3B subunits interact with different regions of Spt7. Although the overall goal is to find an Spt7 mutant that does not interact with the SF3B components but still maintains interaction with other SAGA subunits, we now have a better idea of what type of Spt7 mutant is needed. This discovery will lay the foundation for future experiments where a mutated SAGA with no SF3B components will be expressed in Drosophila melanogaster and analyzed to determine the function of SF3B subunits in SAGA

A principled approach to programming with nested types in Haskell

Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from them data constructed using the buildcombinator, and immediately consumed using the foldcombinator, for that type. It has long been thought that initial algebra semantics is not expressive enough to provide a similar foundation for programming with nested types in Haskell. Specifically, the standard folds derived from initial algebra semantics have been considered too weak to capture commonly occurring patterns of recursion over data of nested types in Haskell, and no build combinators or fold/build rules have until now been defined for nested types. This paper shows that standard folds are, in fact, sufficiently expressive for programming with nested types in Haskell. It also defines buildcombinators and fold/build fusion rules for nested types. It thus shows how initial algebra semantics provides a principled, expressive, and elegant foundation for programming with nested types in Haskell

Maximal Sharing in the Lambda Calculus with letrec

Increasing sharing in programs is desirable to compactify the code, and to avoid duplication of reduction work at run-time, thereby speeding up execution. We show how a maximal degree of sharing can be obtained for programs expressed as terms in the lambda calculus with letrec. We introduce a notion of `maximal compactness' for lambda-letrec-terms among all terms with the same infinite unfolding. Instead of defined purely syntactically, this notion is based on a graph semantics. lambda-letrec-terms are interpreted as first-order term graphs so that unfolding equivalence between terms is preserved and reflected through bisimilarity of the term graph interpretations. Compactness of the term graphs can then be compared via functional bisimulation. We describe practical and efficient methods for the following two problems: transforming a lambda-letrec-term into a maximally compact form; and deciding whether two lambda-letrec-terms are unfolding-equivalent. The transformation of a lambda-letrec-term $L$ into maximally compact form $L_0$ proceeds in three steps: (i) translate L into its term graph $G = [[ L ]]$; (ii) compute the maximally shared form of $G$ as its bisimulation collapse $G_0$; (iii) read back a lambda-letrec-term $L_0$ from the term graph $G_0$ with the property $[[ L_0 ]] = G_0$. This guarantees that $L_0$ and $L$ have the same unfolding, and that $L_0$ exhibits maximal sharing. The procedure for deciding whether two given lambda-letrec-terms $L_1$ and $L_2$ are unfolding-equivalent computes their term graph interpretations $[[ L_1 ]]$ and $[[ L_2 ]]$, and checks whether these term graphs are bisimilar. For illustration, we also provide a readily usable implementation.Comment: 18 pages, plus 19 pages appendi