The fabrication of beryllium. Volume III - Metal removal techniques

Metal removal techniques for beryllium in spacecraft structure applicatio

Small-scale intraspecific life history variation in herbivorous spider mites (Tetranychus pacificus) is associated with host plant cultivar.

Life history variation is a general feature of arthropod systems, but is rarely included in models of field or laboratory data. Most studies assume that local processes occur identically across individuals, ignoring any genetic or phenotypic variation in life history traits. In this study, we tested whether field populations of Pacific spider mites (Tetranychus pacificus) on grapevines (Vitis vinifera) display significant intraspecific life history variation associated with host plant cultivar. To address this question we collected individuals from sympatric vineyard populations where either Zinfandel or Chardonnay were grown. We then conducted a "common garden experiment" of mites on bean plants (Phaseolus lunatus) in the laboratory. Assay populations were sampled non-destructively with digital photography to quantify development times, survival, and reproductive rates. Two classes of models were fit to the data: standard generalized linear mixed models and a time-to-event model, common in survival analysis, that allowed for interval-censored data and hierarchical random effects. We found a significant effect of cultivar on development time in both GLMM and time-to-event analyses, a slight cultivar effect on juvenile survival, and no effect on reproductive rate. There were shorter development times and a trend towards higher juvenile survival in populations from Zinfandel vineyards compared to those from Chardonnay vineyards. Lines of the same species, originating from field populations on different host plant cultivars, expressed different development times and slightly different survival rates when reared on a common host plant in a common environment

A Variant of the Maximum Weight Independent Set Problem

We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph $G=(V,E)$, a weight function $w: V \rightarrow \mathbb{R^+}$, a budget function $b: V \rightarrow \mathbb{Z^+}$, and a positive integer $B$. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A $k$-budgeted independent set in $G$ is a subset of vertices, such that no pair of vertices in that subset are adjacent, and the budget of the subset is at most $k$. The goal is to find a $B$-budgeted independent set in $G$ such that its weight is maximum among all the $B$-budgeted independent sets in $G$. We refer to this problem as MWBIS. Being a generalization of MWIS, MWBIS also has several applications in Scheduling, Wireless networks and so on. Due to the hardness results implied from MWIS, we study the MWBIS problem in several special classes of graphs. We design exact algorithms for trees, forests, cycle graphs, and interval graphs. In unweighted case we design an approximation algorithm for $d+1$-claw free graphs whose approximation ratio ($d$) is competitive with the approximation ratio ($\frac{d}{2}$) of MWIS (unweighted). Furthermore, we extend Baker's technique \cite{Baker83} to get a PTAS for MWBIS in planar graphs.Comment: 18 page