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

The arctic circle boundary and the Airy process

We prove that the, appropriately rescaled, boundary of the north polar region in the Aztec diamond converges to the Airy process. The proof uses certain determinantal point processes given by the extended Krawtchouk kernel. We also prove a version of Propp's conjecture concerning the structure of the tiling at the center of the Aztec diamond.Comment: Published at http://dx.doi.org/10.1214/009117904000000937 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

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

Heritability of anthropometric phenotypes in caste populations of Visakhapatnam, India

This is the publisher's version, also available electronically from http://digitalcommons.wayne.edu/humbiol/vol74/iss3/1/.In this study, we used anthropometric data from six Andhra caste populations to examine heritability patterns of 23 anthropometric phenotypes (linear, craniofacial, and soft tissue measures) with special reference to caste differences. We obtained anthropometric data from 342 nuclear families from Brahmin, Reddy, Telaga, Nagara, Ag. Kshatriya, and Mala castes of Visakhapatnam, India. These caste groups represent the existing hierarchical stratification of Indian populations. We used a variance components approach to determine the heritability (h2) of these 23 anthropometric phenotypes (height, weight, BMI, etc.). The sample consisted of 1918 individuals ranging in age from 6 to 72 years (mean = 21.5, S.D. = 13.8). The heritabilities (h2 ± S.E.) for all anthropometric traits for the entire sample were significant (p < 0.0001) and varied from 0.25 ± 0.05 (BMI) to 0.61 ± 0.05 (bizygomatic breadth) after accounting for sex, age, and caste effects. Since data on socioeconomic and nutritional covariates were available for a subset of families, we repeated the genetic analyses using this subset, which has yielded higher heritabilities ranging from 0.21 ± 0.16 (head breadth) to 0.72 ± 0.18 (nasal breadth). In general, craniofacial measurements exhibited higher h2 compared to linear measures. Breadth measurements and circumferences yielded more or less similar heritabilities. Age and sex effects were significant (p < 0.0001) for most of the traits, while the effects of caste, socioeconomic status, and nutritional status were inconsistent across the traits. In conclusion, anthropometric phenotypes examined in this study are under appreciable additive genetic influences

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

Cohesivity Fisheries Community in the Face of Climate Change on the Coast of Western Java

ABTRACTThe conditions of fishermen is very dependent with nature. Climate change that happening makes nature more difficult to predict. That can make the living of fishermen more vulnerabel. Communities that have a strong cohesiveness will have a collective action to deal with climate change. The purpose of this study is to see the level of cohesiveness fisherman in the face of climate change. The method used is mix method using questionnaire, observation and in-depth interviews. The number of respondents was 100 people. The selection of respondents was done by simple random sampling technique, where the study population are members of “raskin” program from government. The results are fisheries community have a strong social capital, sense of community and community collective efficacy, which is produced strong cohesiveness. However, in reality what is perceived is not necessarily reflected in everyday life. Collective action found only in activities that support public facilities. However, collective action for the economic interests only occurs in certain interest groups. According the results can be argued that the level of fishing community cohesiveness is high, but only produce preparadness for climate change

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

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

A Rheometry Method to Assess The Evaporation-Induced Mechanical Strength Development of Polymer Solutions Used For Membrane Applications

Rotational and oscillatory shear rheometry were used to quantify the flow behavior under minimal and significant solvent evaporation conditions for polymer solutions used to fabricate isoporous asymmetric membranes by the self-assembly and non-solvent induced phase separation (SNIPS) method. Three different A-B-C triblock terpolymer chemistries of similar molar mass were evaluated: polyisoprene-^-polystyrene-6-poly(4-vinylpyridine) (ISV); polyisoprene-6- polystyrene-6-poly(V,A-dimethylacrylamide) (ISD); and polyisoprene-Z\u3e-polystyrene-h-poly(fer/- butyl methacrylate) (ISB). Solvent evaporation resulted in the formation of a viscoelastic film typical of asymmetric membranes. Solution viscosity and film viscoelasticity were strongly dependent on the chemical structure of the triblock terpolymer molecules. A hierarchical magnitude (ISV\u3eISB\u3eISD) was observed for both properties, with ISV solutions displaying the greatest solution viscosity, fastest film strength development, and greatest strength magnitude

Identifying the favored mutation in a positive selective sweep.

Most approaches that capture signatures of selective sweeps in population genomics data do not identify the specific mutation favored by selection. We present iSAFE (for "integrated selection of allele favored by evolution"), a method that enables researchers to accurately pinpoint the favored mutation in a large region (∼5 Mbp) by using a statistic derived solely from population genetics signals. iSAFE does not require knowledge of demography, the phenotype under selection, or functional annotations of mutations