Tree-code simulations of proton acceleration from laser-irradiated wire targets

Recent experiments using Terawatt lasers to accelerate protons deposited on thin wire targets are modeled with a new type of gridless plasma simulation code. In contrast to conventional mesh-based methods, this technique offers a unique capability in emulating the complex geometry and open-ended boundary conditions characteristic of contemporary experimental conditions. Comparisons of ion acceleration are made between the tree code and standard particle-in-cell simulations for a typical collisionless

Tree-Based Adaptive Spatial Detection for Adaptive Modulated MIMO Systems

Adaptive Multiple-Input Multiple-Output (MIMO) systems achieve a much higher information rate than conventional fixed schemes due to their ability to adapt their configurations according to the wireless communications environment. However, current adaptive MIMO detection schemes exhibit either low performance (and hence low spectral efficiency) or huge computational
complexity. In particular, whilst deterministic Sphere Decoder (SD) detection schemes are well established for static MIMO systems, exhibiting deterministic parallel structure, low computational complexity and quasi-ML detection performance, there are no corresponding adaptive schemes. This paper solves
this problem, describing a hybrid tree based adaptive modulation detection scheme. Fixed Complexity Sphere Decoding (FSD) and Real-Values FSD (RFSD) are modified and combined into a hybrid scheme exploited at low and medium SNR to provide the highest possible information rate with quasi-ML Bit Error
Rate (BER) performance, while Reduced Complexity RFSD, BChase and Decision Feedback (DFE) schemes are exploited in the high SNR regions. This algorithm provides the facility to balance the detection complexity with BER performance with compatible information rate in dynamic, adaptive MIMO communications
environments.

Recombinant canine distemper virus strain Snyder Hill expressing green or red fluorescent proteins causes meningoencephalitis in the ferret

The propensity of canine distemper virus (CDV) to spread to the central nervous system is one of the primary features of distemper. Therefore, we developed a reverse genetics system based on the neurovirulent Snyder Hill (SH) strain of CDV (CDV(SH)) and show that this virus rapidly circumvents the blood-brain and blood-cerebrospinal fluid (CSF) barriers to spread into the subarachnoid space to induce dramatic viral meningoencephalitis. The use of recombinant CDV(SH) (rCDV(SH)) expressing enhanced green fluorescent protein (EGFP) or red fluorescent protein (dTomato) facilitated the sensitive pathological assessment of routes of virus spread in vivo. Infection of ferrets with these viruses led to the full spectrum of clinical signs typically associated with distemper in dogs during a rapid, fatal disease course of approximately 2 weeks. Comparison with the ferret-adapted CDV(5804P) and the prototypic wild-type CDV(R252) showed that hematogenous infection of the choroid plexus is not a significant route of virus spread into the CSF. Instead, viral spread into the subarachnoid space in rCDV(SH)-infected animals was triggered by infection of vascular endothelial cells and the hematogenous spread of virus-infected leukocytes from meningeal blood vessels into the subarachnoid space. This resulted in widespread infection of cells of the pia and arachnoid mater of the leptomeninges over large areas of the cerebral hemispheres. The ability to sensitively assess the in vivo spread of a neurovirulent strain of CDV provides a novel model system to study the mechanisms of virus spread into the CSF and the pathogenesis of acute viral meningitis.

VQ tree search system based on bit level systolic arrays

A bit-level systolic array system for performing a binary tree vector quantization (VQ) codebook search is described. This is based on a highly regular VLSI building block circuit. The system in question exhibits a very high data rate suitable for a range of real-time applications. A technique is described which reduces the storage requirements of such a system by 50%, with a corresponding decrease in hardware complexity.