Results of literature search on dielectric properties and electron interaction phenomena related to spacecraft charging

The objective of the literature search was to determine the required material properties and electron interaction parameters needed for modeling charge buildup and breakdown in insulators. A brief overview of the results of the literature search is given. A partial list of the references covered is included in a bibliography. Although inorganic insulators were also considered in the search, coverage is limited to the organics, primarily Kapton and Teflon

Radiation-induced insulator discharge pulses in the CRRES internal discharge monitor satellite experiment

The Internal Discharge Monitor (IDM) was designed to observe electrical pulses from common electrical insulators in space service. The sixteen insulator samples included twelve planar printed circuit boards and four cables. The samples were fully enclosed, mutually isolated, and space radiation penetrated 0.02 cm of aluminum before striking the samples. Pulsing began on the seventh orbit, the maximum pulse rate occurred on the seventeenth orbit when 13 pulses occurred, and the pulses slowly diminished to about one per 3 orbits six months later. After 8 months, the radiation belts abruptly increased and the pulse rates attained a new high. These pulse rates were in agreement with laboratory experience on shorter time scales. Several of the samples never pulsed. If the pulses were not confined within IDM, the physical processes could spread to become a full spacecraft anomaly. The IDM results indicate the rate at which small insulator pulses occur. Small pulses are the seeds of larger satellite electrical anomalies. The pulse rates are compared with space radiation intensities, L shell location, and spectral distributions from the radiation spectrometers on the Combined Release and Radiation Effects Satellite

Matroid and Knapsack Center Problems

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows: 1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this problem is NP-hard even on a line. We present a 3-approximation algorithm for the problem on general metrics. We also consider the outlier version of the problem where a given number of vertices can be excluded as the outliers from the solution. We present a 7-approximation for the outlier version. 2. We consider the (multi-)knapsack center problem in which the centers are required to satisfy one (or more) knapsack constraint(s). It is known that the knapsack center problem with a single knapsack constraint admits a 3-approximation. However, when there are at least two knapsack constraints, we show this problem is not approximable at all. To complement the hardness result, we present a polynomial time algorithm that gives a 3-approximate solution such that one knapsack constraint is satisfied and the others may be violated by at most a factor of $1+\epsilon$. We also obtain a 3-approximation for the outlier version that may violate the knapsack constraint by $1+\epsilon$.Comment: A preliminary version of this paper is accepted to IPCO 201

B-Amyloid of Alzheimer\u27s Disease Induces Reactive Gliosis that Inhibits Axonal Outgrowth

Pathological lesions in the brains of patients with Alzheimer\u27s disease (AD) are characterized by dense deposits of the protein ,B-amyloid. The link between the deposition of B-amyloid in senile plaques and AD-associated pathology is, at present, controversial since there have been conflicting reports on whether the 39- 43 amino acid B-amyloid sequence is toxic or trophic to neurons. In this report, we show that B-amyloid peptide when presented as an insoluble substrate which mimics its conformation in vivo can induce cortical glial cells in vitro and in vivo to locally deposit chondroitin sulfate containingproteoglycan. In vitro the proteoglycan-containing matrix deposited by glia on B-amyloid blocks the usual ability of the peptide to allow cortical neurons to adhere and grow. Chondroitin sulfate-containing proteoglycan was also found in senile plaques of human AD tissue. We suggest that an additional effect of B-amyloid in the brain, which compounds the direct effects of ,8- amyloid on neurons, is mediated by the stimulation of astroglia to become reactive. Once in the reactive state, glial cells deposit large amounts of growth-inhibitory molecules within the neuropil which could impair neuronal process survival and regeneration leading to neurite retraction and/or dystrophy around senile plaques in AD

Selection from read-only memory with limited workspace

Given an unordered array of $N$ elements drawn from a totally ordered set and an integer $k$ in the range from $1$ to $N$, in the classic selection problem the task is to find the $k$-th smallest element in the array. We study the complexity of this problem in the space-restricted random-access model: The input array is stored on read-only memory, and the algorithm has access to a limited amount of workspace. We prove that the linear-time prune-and-search algorithm---presented in most textbooks on algorithms---can be modified to use $\Theta(N)$ bits instead of $\Theta(N)$ words of extra space. Prior to our work, the best known algorithm by Frederickson could perform the task with $\Theta(N)$ bits of extra space in $O(N \lg^{*} N)$ time. Our result separates the space-restricted random-access model and the multi-pass streaming model, since we can surpass the $\Omega(N \lg^{*} N)$ lower bound known for the latter model. We also generalize our algorithm for the case when the size of the workspace is $\Theta(S)$ bits, where $\lg^3{N} \leq S \leq N$. The running time of our generalized algorithm is $O(N \lg^{*}(N/S) + N (\lg N) / \lg{} S)$, slightly improving over the $O(N \lg^{*}(N (\lg N)/S) + N (\lg N) / \lg{} S)$ bound of Frederickson's algorithm. To obtain the improvements mentioned above, we developed a new data structure, called the wavelet stack, that we use for repeated pruning. We expect the wavelet stack to be a useful tool in other applications as well.Comment: 16 pages, 1 figure, Preliminary version appeared in COCOON-201

Ergot: A New Disease Threat to Sorghum in the Americas and Australia

Sorghum, Sorghum bicolor (L.) Moench, is the world’s fifth most important cereal crop, cultivated on about 45 million hectares for food, feed, beverage, and fodder. The most significant technological change since the 1960s has been the development and use of F1 hybrid seed (14), which has lead to a dramatic improvement in the crop’s productivity. Sorghum cultivation in intensive, commercialized systems where yields average 3 to 5 t ha-1 relies almost totally on hybrid seed. In contrast, yields vary widely and average less than 1 t ha-1 in low-input production systems

Successful use of axonal transport for drug delivery by synthetic molecular vehicles

We report the use of axonal transport to achieve intraneural drug delivery. We constructed a novel tripartite complex of an axonal transport facilitator conjugated to a linker molecule bearing up to a hundred reversibly attached drug molecules. The complex efficiently enters nerve terminals after intramuscular or intradermal administration and travels within axonal processes to neuron cell bodies. The tripartite agent provided 100-fold amplification of saturable neural uptake events, delivering multiple drug molecules per complex. _In vivo_, analgesic drug delivery to systemic and to non-targeted neural tissues was greatly reduced compared to existing routes of administration, thus exemplifying the possibility of specific nerve root targeting and effectively increasing the potency of the candidate drug gabapentin 300-fold relative to oral administration

Mode-coupling theory for multiple-time correlation functions of tagged particle densities and dynamical filters designed for glassy systems

The theoretical framework for higher-order correlation functions involving multiple times and multiple points in a classical, many-body system developed by Van Zon and Schofield [Phys. Rev. E 65, 011106 (2002)] is extended here to include tagged particle densities. Such densities have found an intriguing application as proposed measures of dynamical heterogeneities in structural glasses. The theoretical formalism is based upon projection operator techniques which are used to isolate the slow time evolution of dynamical variables by expanding the slowly-evolving component of arbitrary variables in an infinite basis composed of the products of slow variables of the system. The resulting formally exact mode-coupling expressions for multiple-point and multiple-time correlation functions are made tractable by applying the so-called N-ordering method. This theory is used to derive for moderate densities the leading mode coupling expressions for indicators of relaxation type and domain relaxation, which use dynamical filters that lead to multiple-time correlations of a tagged particle density. The mode coupling expressions for higher order correlation functions are also succesfully tested against simulations of a hard sphere fluid at relatively low density.Comment: 15 pages, 2 figure

Assessing direct contributions of morphological awareness and prosodic sensitivity to children’s word reading and reading comprehension

We examined the independent contributions of prosodic sensitivity and morphological awareness to word reading, text reading accuracy, and reading comprehension. We did so in a longitudinal study of English-speaking children (N = 70). At 5 to 7 years of age, children completed the metalinguistic measures along with control measures of phonological awareness and vocabulary. Children completed the reading measures two years later. Morphological awareness, but not prosodic sensitivity made a significant independent contribution to word reading, text reading accuracy and reading comprehension. The effects of morphological awareness on reading comprehension remained after controls for word reading. These results suggest that morphological awareness needs to be considered seriously in models of reading development and that prosodic sensitivity might have primarily indirect relations to reading outcomes. Keywords: Morphological Awareness; Prosody; Word Reading; Reading Comprehension

Locked and Unlocked Chains of Planar Shapes

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to characterize the families of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families of planar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Previously, only obtuse triangles were known to admit locked shapes, and only line segments were known to guarantee universal foldability. We show that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability: roughly, the distance from each edge along the path along the boundary of the slender adornment to each hinge should be monotone. In contrast, we show that isosceles triangles with any desired apex angle less than 90 degrees admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.Comment: 23 pages, 25 figures, Latex; full journal version with all proof details. (Fixed crash-induced bugs in the abstract.