Central auditory processing and central auditory processing disorder: Fundamental questions and considerations

Despite several decades of research, neither clinicians nor academics can agree on a single definition of central auditory processing (CAP) or central auditory processing disorder (CAPD). This article considers why this is the case, and comments on the resulting implications for CAP assessment and CAPD rehabilitation in the clinic.

Schrodinger cats and their power for quantum information processing

We outline a toolbox comprised of passive optical elements, single photon detection and superpositions of coherent states (Schrodinger cat states). Such a toolbox is a powerful collection of primitives for quantum information processing tasks. We illustrate its use by outlining a proposal for universal quantum computation. We utilize this toolbox for quantum metrology applications, for instance weak force measurements and precise phase estimation. We show in both these cases that a sensitivity at the Heisenberg limit is achievable.

Regulation of antigen processing and presentation molecules in West Nile virus-infected human skin fibroblasts

Infection of humans with the West Nile flavivirus principally occurs via tick and mosquito bites. Here, we document the expression of antigen processing and presentation molecules in West Nile virus (WNV)-infected human skin fibroblast (HFF) cells. Using a new Flavivirus-specific antibody, 4G4, we have analyzed cell surface human leukocyte antigen (HLA) expression on virus-infected cells at a single cell level. Using this approach, we show that West Nile Virus infection alters surface HLA expression on both infected HFF and neighboring uninfected HFF cells. Interestingly, increased surface HLA evident on infected HFF cultures is almost entirely due to virus-induced interferon (IFN)alpha/beta because IFNalpha/beta-neutralizing antibodies completely prevent increased surface HLA expression. In contrast, RT-PCR analysis indicates that WNV infection results in increased mRNAs for HLA-A, -B, and -C genes, and HLA-associated molecules low molecular weight polypeptide-2 (LMP-2) and transporter associated with antigen presentation-1 (TAP-1), but induction of these mRNAs is not diminished in HFF cells cultured with IFNalpha/beta-neutralizing antibodies. Taken together, these data support the idea that that both cytokine-dependent and cytokine-independent mechanisms account for WNV-induced HLA expression in human skin fibroblasts. (C) 2004 Elsevier Inc. All rights reserved.

Evaluation of cosmic ray rejection algorithms on single-shot exposures

To maximise data output from single-shot astronomical images, the rejection of cosmic rays is important. We present the results of a benchmark trial comparing various cosmic ray rejection algorithms. The procedures assess relative performances and characteristics of the processes in cosmic ray detection, rates of false detections of true objects, and the quality of image cleaning and reconstruction. The cosmic ray rejection algorithms developed by Rhoads (2000, PASP, 112, 703), van Dokkum (2001, PASP, 113, 1420), Pych (2004, PASP, 116, 148), and the IRAF task xzap by Dickinson are tested using both simulated and real data. It is found that detection efficiency is independent of the density of cosmic rays in an image, being more strongly affected by the density of real objects in the field. As expected, spurious detections and alterations to real data in the cleaning process are also significantly increased by high object densities. We find the Rhoads' linear filtering method to produce the best performance in the detection of cosmic ray events; however, the popular van Dokkum algorithm exhibits the highest overall performance in terms of detection and cleaning.

Optimal photons for quantum-information processing

Photonic quantum-information processing schemes, such as linear optics quantum computing, and other experiments relying on single-photon interference, inherently require complete photon indistinguishability to enable the desired photonic interactions to take place. Mode-mismatch is the dominant cause of photon distinguishability in optical circuits. Here we study the effects of photon wave-packet shape on tolerance against the effects of mode mismatch in linear optical circuits, and show that Gaussian distributed photons with large bandwidth are optimal. The result is general and holds for arbitrary linear optical circuits, including ones which allow for postselection and classical feed forward. Our findings indicate that some single photon sources, frequently cited for their potential application to quantum-information processing, may in fact be suboptimal for such applications.

Global processing speed as a mediator of developmental changes in children's auditory memory span

This study examined the role of global processing speed in mediating age increases in auditory memory span in 5- to 13-year-olds. Children were tested on measures of memory span, processing speed, single-word speech rate, phonological sensitivity, and vocabulary. Structural equation modeling supported a model in which age-associated increases in processing speed predicted the availability of long-term memory phonological representations for redintegration processes. The availability of long-term phonological representations, in turn, explained variance in memory span. Maximum speech rate did not predict independent variance in memory span. (c) 2005 Elsevier Inc. All rights reserved.

Approximate processing of massive continuous quantile queries over high-speed data streams

Quantile computation has many applications including data mining and financial data analysis. It has been shown that an is an element of-approximate summary can be maintained so that, given a quantile query d (phi, is an element of), the data item at rank [phi N] may be approximately obtained within the rank error precision is an element of N over all N data items in a data stream or in a sliding window. However, scalable online processing of massive continuous quantile queries with different phi and is an element of poses a new challenge because the summary is continuously updated with new arrivals of data items. In this paper, first we aim to dramatically reduce the number of distinct query results by grouping a set of different queries into a cluster so that they can be processed virtually as a single query while the precision requirements from users can be retained. Second, we aim to minimize the total query processing costs. Efficient algorithms are developed to minimize the total number of times for reprocessing clusters and to produce the minimum number of clusters, respectively. The techniques are extended to maintain near-optimal clustering when queries are registered and removed in an arbitrary fashion against whole data streams or sliding windows. In addition to theoretical analysis, our performance study indicates that the proposed techniques are indeed scalable with respect to the number of input queries as well as the number of items and the item arrival rate in a data stream.

Toward efficient multifeature query processing

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.

Quantum optical systems for the implementation of quantum information processing

We review the field of quantum optical information from elementary considerations to quantum computation schemes. We illustrate our discussion with descriptions of experimental demonstrations of key communication and processing tasks from the last decade and also look forward to the key results likely in the next decade. We examine both discrete (single photon) type processing as well as those which employ continuous variable manipulations. The mathematical formalism is kept to the minimum needed to understand the key theoretical and experimental results.