The DRIFT Project: Searching for WIMPS with a Directional Detector

A low pressure time projection chamber for the detection of WIMPs is discussed. Discrimination against Compton electron background in such a device should be very good, and directional information about the recoil atoms would be obtainable. If a full 3-D reconstruction of the recoil tracks can be achieved, Monte Carlo studies indicate that a WIMP signal could be identified with high confidence from as few as 30 detected WIMP-nucleus scattering events.Comment: 5 pages, 3 figures. Presented at Dark 98, Heidelberg, July 1998, and to appear in conference proceeding

Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an uncompressed pattern of length $n$, C{\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\bar mn^2 \log n)$. We improve the running time to $O(\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time $O(\bar mn^{1.5})$; the same problem with a compressed pattern is known to be NP-hard

Neurology

Contains reports on six research projects.U. S. Public Health Service (B-3055-4, B-3090-4, MH-06175-02)U. S. Air Force (AF49(638)-1313)U.S. Navy. Office of Naval Research (Nonr-1841(70)

The generalized localization lengths in one dimensional systems with correlated disorder

The scale invariant properties of wave functions in finite samples of one dimensional random systems with correlated disorder are analyzed. The random dimer model and its generalizations are considered and the wave functions are compared. Generalized entropic localization lengths are introduced in order to characterize the states and compared with their behavior for exponential localization. An acceptable agreement is obtained, however, the exponential form seems to be an oversimplification in the presence of correlated disorder. According to our analysis in the case of the random dimer model and the two new models the presence of power-law localization cannot be ruled out.Comment: 7 pages, LaTeX (IOP style), 2 figure

Satellite-Based Evidence for Shrub and Graminoid Tundra Expansion in Northern Quebec from 1986-2010

Global vegetation models predict rapid poleward migration of tundra and boreal forest vegetation in response to climate warming. Local plot and air-photo studies have documented recent changes in high-latitude vegetation composition and structure, consistent with warming trends. To bridge these two scales of inference, we analyzed a 24-year (1986-2010) Landsat time series in a latitudinal transect across the boreal forest-tundra biome boundary in northern Quebec province, Canada. This region has experienced rapid warming during both winter and summer months during the last forty years. Using a per-pixel (30 m) trend analysis, 30% of the observable (cloud-free) land area experienced a significant (p < 0.05) positive trend in the Normalized Difference Vegetation Index (NDVI). However, greening trends were not evenly split among cover types. Low shrub and graminoid tundra contributed preferentially to the greening trend, while forested areas were less likely to show significant trends in NDVI. These trends reflect increasing leaf area, rather than an increase in growing season length, because Landsat data were restricted to peak-summer conditions. The average NDVI trend (0.007/yr) corresponds to a leaf-area index (LAI) increase of ~0.6 based on the regional relationship between LAI and NDVI from the Moderate Resolution Spectroradiometer (MODIS). Across the entire transect, the area-averaged LAI increase was ~0.2 during 1986-2010. A higher area-averaged LAI change (~0.3) within the shrub-tundra portion of the transect represents a 20-60% relative increase in LAI during the last two decades. Our Landsat-based analysis subdivides the overall high-latitude greening trend into changes in peak-summer greenness by cover type. Different responses within and among shrub, graminoid, and tree-dominated cover types in this study indicate important fine-scale heterogeneity in vegetation growth. Although our findings are consistent with community shifts in low-biomass vegetation types over multi-decadal time scales, the response in tundra and forest ecosystems to recent warming was not uniform

Fast Searching in Packed Strings

Given strings $P$ and $Q$ the (exact) string matching problem is to find all positions of substrings in $Q$ matching $P$. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let $m \leq n$ be the lengths $P$ and $Q$, respectively, and let $\sigma$ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m + \occ\right). Here \occ is the number of occurrences of $P$ in $Q$. For $m = o(n)$ this improves the $O(n)$ bound of the Knuth-Morris-Pratt algorithm. Furthermore, if $m = O(n/\log_\sigma n)$ our algorithm is optimal since any algorithm must spend at least \Omega(\frac{(n+m)\log \sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to read the input and report all occurrences. The result is obtained by a novel automaton construction based on the Knuth-Morris-Pratt algorithm combined with a new compact representation of subautomata allowing an optimal tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM 200

Neurology

Contains reports on seven research projects.U. S. Public Health Service (B-3055-3,U. S. Public Health Service (B-3090-3)U. S. Public Health Service (38101-22)Office of Naval Research (Nonr-1841 (70))Air Force (AF33(616)-7588)Air Force (AFAOSR 155-63)Army Chemical Corps (DA-18-108-405-Cml-942)National Institutes of Health (Grant MH-04734-03

The CERN laser-ion source

This paper describes the first results of a feasibility study undertaken at CERN to determine whether a laser-produced plasma can be used as a source of intense highly charged heavy ion beams. A variety of important measurements have been made, and the results are encouraging. Furthermore, a beam of highly charged light ions produced by the laser ion source has been accelerated successfully in a radio frequency quadrupole (RFQ) structur