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.

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.

A bit-level systolic architecture for implementing a VQ tree search

A bit-level systolic array system for performing a binary tree Vector Quantization codebook search is described. This consists of a linear chain of regular VLSI building blocks and exhibits data rates suitable for a wide range of real-time applications. A technique is described which reduces the computation required at each node in the binary tree to that of a single inner product operation. This method applies to all the common distortion measures (including the Euclidean distance, the Weighted Euclidean distance and the Itakura-Saito distortion measure) and significantly reduces the hardware required to implement the tree search system. © 1990 Kluwer Academic Publishers.

Tea tree oil (5%) body wash versus standard care (Johnson's Baby Softwash) to prevent colonization with methicillin-resistant Staphylococcus aureus in critically ill adults::a randomized controlled trial

OBJECTIVES: To determine whether the daily use of 5% tea tree oil (TTO) body wash (Novabac 5% Skin Wash) compared with standard care [Johnson's Baby Softwash (JBS)] had a lower incidence of methicillin-resistant Staphylococcus aureus (MRSA) colonization.

PATIENTS: The study setting was two intensive care units (ICUs; mixed medical, surgical and trauma) in Northern Ireland between October 2007 and July 2009. The study population comprised 391 patients who were randomized to JBS or TTO body wash.

METHODS: This was a Phase 2/3, prospective, open-label, randomized, controlled trial. Trial registration: ISRCTN65190967. The primary outcome was new MRSA colonization during ICU stay. Secondary outcomes included the incidence of MRSA bacteraemia and maximum increase in sequential organ failure assessment score.

RESULTS: A total of 445 patients were randomized to the study. After randomization, 54 patients were withdrawn; 30 because of a positive MRSA screen at study entry, 11 due to lack of consent, 11 were inappropriately randomized and 2 had adverse reactions. Thirty-nine (10%) patients developed new MRSA colonization (JBS n?=?22, 11.2%; TTO body wash n?=?17, 8.7%). The difference in percentage colonized (2.5%, 95% CI -?8.95 to 3.94; P?=?0.50) was not significant. The mean maximum increase in sequential organ failure assessment score was not significant (JBS 1.44, SD 1.92; TTO body wash 1.28, SD 1.79; P?=?0.85) and no study patients developed MRSA bacteraemia.

CONCLUSIONS: Compared with JBS, TTO body wash cannot be recommended as an effective means of reducing MRSA colonization.

Effect of offset web holes on web crippling strength of cold-formed steel channel sections under end-two-flange loading condition

A combination of experiments and non-linear finite element analyses are used to investigate the effect of offset web holes on the web crippling strength of cold-formed steel channel sections under the end-two-flange (ETF) loading condition; the cases of both flanges fastened and unfastened to the support are considered. The web holes are located at the mid-depth of the sections, with a horizontal clear distance of the web holes to the near edge of the bearing plate. Finite element analysis results are compared against the laboratory test results; good agreement was obtained in terms of both strength and failure modes. A parametric study was then undertaken to investigate both the effect of the position of holes in the web and the cross-section sizes on the web crippling strength of the channel sections. It was demonstrated that the main factors influencing the web crippling strength are the ratio of the hole depth to the depth of the web, and the ratio of the distance from the edge of the bearing to the flat depth of the web. Design recommendations in the form of web crippling strength reduction factors are proposed in this study.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.