Verification of a localization criterion for several disordered media

We analytically compute a localization criterion in double scattering approximation for a set of dielectric spheres or perfectly conducting disks uniformly distributed in a spatial volume which can be either spherical or layered. For every disordered medium, we numerically investigate a localization criterion, and examine the influence of the system parameters on the wavelength localization domains.Comment: 30 pages, LateX, amstex, revtex styles, 20 figure

Significant reduction in helicobacter pylori load in humans with non-viable lactobacillus reuteri DSM17648: A pilot study

Reducing the amount of Helicobacter pylori in the stomach by selective bacterial-bacterial cell interaction was sought as an effective and novel method for combating the stomach pathogen. Lactobacillus reuteri DSM17648 was identified as a highly specific binding antagonist to H. pylori among more than 700 wild-type strains of Lactobacillus species. Applying a stringent screening procedure, the strain DSM17648 was identified as selective binder to H. pylori cells under in vivo gastric conditions. The strain DSM17648 co-aggregates the pathogen in vivo and in vitro. The specific co-aggregation occurs between Lact. reuteri DSM17648 and different H. pylori strains and serotypes, as well as H. heilmannii, but not with Campylobacter jejuni or other commensal oral and intestinal bacteria. Lact. reuteri DSM17648 was shown in a proof-of-concept single-blinded, randomized, placebo-controlled pilot study to significantly reduce the load of H. pylori in healthy yet infected adults. Reducing the amount of H. pylori in the stomach by selective bacterial-bacterial cell interaction might be an effective and novel method for combating the stomach pathogen. Lact. reuteri DSM17648 might prove useful as an adhesion blocker in antibiotic-free H. pylori therapies

Cross-Sender Bit-Mixing Coding

Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even {\em perfect} scheduling can only achieve $\mathbf{R} = O(\frac{1}{\ln N})$. Here $N$ is the number of nodes in the network, and $\mathbf{R}$ is the {\em medium utilization rate}. Ideally, one would hope to achieve $\mathbf{R} = \Theta(1)$, while avoiding all the complexities in scheduling. To this end, this paper proposes {\em cross-sender bit-mixing coding} ({\em BMC}), which does not rely on scheduling. Instead, users transmit simultaneously on suitably-chosen slots, and the amount of overlap in different user's slots is controlled via coding. We prove that in all possible network topologies, using BMC enables us to achieve $\mathbf{R}=\Theta(1)$. We also prove that the space and time complexities of BMC encoding/decoding are all low-order polynomials.Comment: Published in the International Conference on Information Processing in Sensor Networks (IPSN), 201

Locating Depots for Capacitated Vehicle Routing

We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost functions for the MST and k-median parts. We show that the locality gap for this problem is unbounded even under multi-swaps, which contrasts with the uniform case. Nevertheless, we obtain a constant-factor approximation algorithm, using an LP based approach.Comment: 12 pages, 1 figur

Incremental Medians via Online Bidding

In the k-median problem we are given sets of facilities and customers, and distances between them. For a given set F of facilities, the cost of serving a customer u is the minimum distance between u and a facility in F. The goal is to find a set F of k facilities that minimizes the sum, over all customers, of their service costs. Following Mettu and Plaxton, we study the incremental medians problem, where k is not known in advance, and the algorithm produces a nested sequence of facility sets where the kth set has size k. The algorithm is c-cost-competitive if the cost of each set is at most c times the cost of the optimum set of size k. We give improved incremental algorithms for the metric version: an 8-cost-competitive deterministic algorithm, a 2e ~ 5.44-cost-competitive randomized algorithm, a (24+epsilon)-cost-competitive, poly-time deterministic algorithm, and a (6e+epsilon ~ .31)-cost-competitive, poly-time randomized algorithm. The algorithm is s-size-competitive if the cost of the kth set is at most the minimum cost of any set of size k, and has size at most s k. The optimal size-competitive ratios for this problem are 4 (deterministic) and e (randomized). We present the first poly-time O(log m)-size-approximation algorithm for the offline problem and first poly-time O(log m)-size-competitive algorithm for the incremental problem. Our proofs reduce incremental medians to the following online bidding problem: faced with an unknown threshold T, an algorithm submits "bids" until it submits a bid that is at least the threshold. It pays the sum of all its bids. We prove that folklore algorithms for online bidding are optimally competitive.Comment: conference version appeared in LATIN 2006 as "Oblivious Medians via Online Bidding

Latitude effect for mesons

This article does not have an abstract

Sampling-based Algorithms for Optimal Motion Planning

During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as the number of samples increases. A number of negative results are provided, characterizing existing algorithms, e.g., showing that, under mild technical conditions, the cost of the solution returned by broadly used sampling-based algorithms converges almost surely to a non-optimal value. The main contribution of the paper is the introduction of new algorithms, namely, PRM* and RRT*, which are provably asymptotically optimal, i.e., such that the cost of the returned solution converges almost surely to the optimum. Moreover, it is shown that the computational complexity of the new algorithms is within a constant factor of that of their probabilistically complete (but not asymptotically optimal) counterparts. The analysis in this paper hinges on novel connections between stochastic sampling-based path planning algorithms and the theory of random geometric graphs.Comment: 76 pages, 26 figures, to appear in International Journal of Robotics Researc

Uterine haemodynamics and band neutrophils as recovery markers in medical management of canine pyometra

Canine pyometra is a hormonally mediated life-threatening uterine disease of canines, associated with bacterial infection and inflammation. The disease is characterized by the accumulation of pus in the uterus and systemic illness. The study was undertaken to assess the relevance of band cells in circulation and Doppler ultrasonography in the prognostic evaluation of medically managed canine pyometra. A significantly higher band of neutrophils were recorded among bitches presented with pyometra, which reduced to the physiologically normal range as treatment progressed in the animals which responded to the treatment. The resistive index, which was lower than the threshold value of 0.72, increased as the treatment progressed in the responsive animals and proved to be a reliable tool as a recovery marker

Repetitive arm functional tasks after stroke (RAFTAS): a pilot randomised controlled trial

Background Repetitive functional task practise (RFTP) is a promising treatment to improve upper limb recovery following stroke. We report the findings of a study to determine the feasibility of a multi-centre randomised controlled trial to evaluate this intervention. Methods A pilot randomised controlled trial was conducted. Patients with new reduced upper limb function were recruited within 14 days of acute stroke from three stroke units in North East England. Participants were randomised to receive a four week upper limb RFTP therapy programme consisting of goal setting, independent activity practise, and twice weekly therapy reviews in addition to usual post stroke rehabilitation, or usual post stroke rehabilitation. The recruitment rate; adherence to the RFTP therapy programme; usual post stroke rehabilitation received; attrition rate; data quality; success of outcome assessor blinding; adverse events; and the views of study participants and therapists about the intervention were recorded. Results Fifty five eligible patients were identified, 4-6% of patients screened at each site. Twenty four patients participated in the pilot study. Two of the three study sites met the recruitment target of 1-2 participants per month. The median number of face to face therapy sessions received was 6 [IQR 3-8]. The median number of daily repetitions of activities recorded was 80 [IQR 39-80]. Data about usual post stroke rehabilitation were available for 18/24 (75%). Outcome data were available for 22/24 (92%) at one month and 20/24 (83%) at three months. Outcome assessors were unblinded to participant group allocation for 11/22 (50%) at one month and 6/20 (30%) at three months. Four adverse events were considered serious as they resulted in hospitalisation. None were related to study treatment. Feedback from patients and local NHS therapists about the RFTP programme was mainly positive. Conclusions A multi-centre randomised controlled trial to evaluate an upper limb RFTP therapy programme provided early after stroke is feasible and acceptable to patients and therapists, but there are issues which needed to be addressed when designing a Phase III study. A Phase III study will need to monitor and report not only recruitment and attrition but also adherence to the intervention, usual post stroke rehabilitation received, and outcome assessor blinding

Obp56h Modulates Mating Behavior in Drosophila melanogaster

Social interactions in insects are driven by conspecific chemical signals that are detected via olfactory and gustatory neurons. Odorant binding proteins (Obps) transport volatile odorants to chemosensory receptors, but their effects on behaviors remain poorly characterized. Here, we report that RNAi knockdown of Obp56h gene expression in Drosophila melanogaster enhances mating behavior by reducing courtship latency. The change in mating behavior that results from inhibition of Obp56h expression is accompanied by significant alterations in cuticular hydrocarbon (CHC) composition, including reduction in 5-tricosene (5-T), an inhibitory sex pheromone produced by males that increases copulation latency during courtship. Whole genome RNA sequencing confirms that expression of Obp56h is virtually abolished in Drosophila heads. Inhibition of Obp56h expression also affects expression of other chemoreception genes, including upregulation of lush in both sexes and Obp83ef in females, and reduction in expression of Obp19b and Or19b in males. In addition, several genes associated with lipid metabolism, which underlies the production of cuticular hydrocarbons, show altered transcript abundances. Our data show that modulation of mating behavior through reduction of Obp56h is accompanied by altered cuticular hydrocarbon profiles and implicate 5-T as a possible ligand for Obp56h