TB128: Beauveria bassiana for Control of Colorado Potato Beetle (Coleoptera: Chrysomelidae) in Maine

Beauveria bassiana (Balsamo) Vuill. (Bb), a fungal pathogen of the Colorado potato beetle has been used to control CPB in Europe. Preliminary studies in the United States gave promising results for CPB control by using the fungus. Based on these studies, a three-year pilot program was initiated to evaluate the potential for using Bb o control the Colorado potato beetle in the U.S. We report herein on the results obtained in southern Maine from using this mycoinsecticide to control the beetle.https://digitalcommons.library.umaine.edu/aes_techbulletin/1064/thumbnail.jp

Hyperelastic cloaking theory: Transformation elasticity with pre-stressed solids

Transformation elasticity, by analogy with transformation acoustics and optics, converts material domains without altering wave properties, thereby enabling cloaking and related effects. By noting the similarity between transformation elasticity and the theory of incremental motion superimposed on finite pre-strain it is shown that the constitutive parameters of transformation elasticity correspond to the density and moduli of small-on-large theory. The formal equivalence indicates that transformation elasticity can be achieved by selecting a particular finite (hyperelastic) strain energy function, which for isotropic elasticity is semilinear strain energy. The associated elastic transformation is restricted by the requirement of statically equilibrated pre-stress. This constraint can be cast as \tr {\mathbf F} = constant, where $\mathbf{F}$ is the deformation gradient, subject to symmetry constraints, and its consequences are explored both analytically and through numerical examples of cloaking of anti-plane and in-plane wave motion.Comment: 20 pages, 5 figure

Teachers developing assessment for learning: impact on student achievement

While it is generally acknowledged that increased use of formative assessment (or assessment for learning) leads to higher quality learning, it is often claimed that the pressure in schools to improve the results achieved by students in externally-set tests and examinations precludes its use. This paper reports on the achievement of secondary school students who worked in classrooms where teachers made time to develop formative assessment strategies. A total of 24 teachers (2 science and 2 mathematics teachers, in each of six schools in two LEAs) were supported over a six-month period in exploring and planning their approach to formative assessment, and then, beginning in September 1999, the teachers put these plans into action with selected classes. In order to compute effect sizes, a measure of prior attainment and at least one comparison group was established for each class (typically either an equivalent class taught in the previous year by the same teacher, or a parallel class taught by another teacher). The mean effect size was 0.32

Timed Parity Games: Complexity and Robustness

We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to \emph{turn-based} (i.e., not concurrent) \emph{finite-state} (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, \emph{limit-robust} and \emph{bounded-robust} winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers

Human dynamics revealed through Web analytics

When the World Wide Web was first conceived as a way to facilitate the sharing of scientific information at the CERN (European Center for Nuclear Research) few could have imagined the role it would come to play in the following decades. Since then, the increasing ubiquity of Internet access and the frequency with which people interact with it raise the possibility of using the Web to better observe, understand, and monitor several aspects of human social behavior. Web sites with large numbers of frequently returning users are ideal for this task. If these sites belong to companies or universities, their usage patterns can furnish information about the working habits of entire populations. In this work, we analyze the properly anonymized logs detailing the access history to Emory University's Web site. Emory is a medium size university located in Atlanta, Georgia. We find interesting structure in the activity patterns of the domain and study in a systematic way the main forces behind the dynamics of the traffic. In particular, we show that both linear preferential linking and priority based queuing are essential ingredients to understand the way users navigate the Web.Comment: 7 pages, 8 figure

Geometrically Reduced Number of Protein Ground State Candidates

Geometrical properties of protein ground states are studied using an algebraic approach. It is shown that independent from inter-monomer interactions, the collection of ground state candidates for any folded protein is unexpectedly small: For the case of a two-parameter Hydrophobic-Polar lattice model for $L$-mers, the number of these candidates grows only as $L^2$. Moreover, the space of the interaction parameters of the model breaks up into well-defined domains, each corresponding to one ground state candidate, which are separated by sharp boundaries. In addition, by exact enumeration, we show there are some sequences which have one absolute unique native state. These absolute ground states have perfect stability against change of inter-monomer interaction potential.Comment: 9 page, 4 ps figures are include

The Origin of the Designability of Protein Structures

We examined what determines the designability of 2-letter codes (H and P) lattice proteins from three points of view. First, whether the native structure is searched within all possible structures or within maximally compact structures. Second, whether the structure of the used lattice is bipartite or not. Third, the effect of the length of the chain, namely, the number of monomers on the chain. We found that the bipartiteness of the lattice structure is not a main factor which determines the designability. Our results suggest that highly designable structures will be found when the length of the chain is sufficiently long to make the hydrophobic core consisting of enough number of monomers.Comment: 17 pages, 2 figure

A New Monte Carlo Algorithm for Protein Folding

We demonstrate that the recently proposed pruned-enriched Rosenbluth method (P. Grassberger, Phys. Rev. E 56 (1997) 3682) leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for lattice heteropolymers, and compare to published Monte Carlo studies. In all cases our algorithms are faster than all previous ones, and in several cases we find new minimal energy states. In addition to ground states, our algorithms give estimates for the partition sum at finite temperatures.Comment: 4 pages, Latex incl. 3 eps-figs., submitted to Phys. Rev. Lett., revised version with changes in the tex

A possible mechanism for cold denaturation of proteins at high pressure

We study cold denaturation of proteins at high pressures. Using multicanonical Monte Carlo simulations of a model protein in a water bath, we investigate the effect of water density fluctuations on protein stability. We find that above the pressure where water freezes to the dense ice phase ($\approx2$ kbar), the mechanism for cold denaturation with decreasing temperature is the loss of local low-density water structure. We find our results in agreement with data of bovine pancreatic ribonuclease A.Comment: 4 pages for double column and single space. 3 figures Added references Changed conten

Highly Designable Protein Structures and Inter Monomer Interactions

By exact computer enumeration and combinatorial methods, we have calculated the designability of proteins in a simple lattice H-P model for the protein folding problem. We show that if the strength of the non-additive part of the interaction potential becomes larger than a critical value, the degree of designability of structures will depend on the parameters of potential. We also show that the existence of a unique ground state is highly sensitive to mutation in certain sites.Comment: 14 pages, Latex file, 3 latex and 6 eps figures are include