An adaptive random search for short term generation scheduling with network constraints.

PubMed

Marmolejo, J A; Velasco, Jonás; Selley, Héctor J

2017-01-01

This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search.

PubMed

Liu, Xianglong; Huang, Lei; Deng, Cheng; Lang, Bo; Tao, Dacheng

2016-10-01

Hash-based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building multiple hash tables with multiple views and generating fine-grained ranking results at bitwise and tablewise levels. For each hash table, a query-adaptive bitwise weighting is introduced to alleviate the quantization loss by simultaneously exploiting the quality of hash functions and their complement for nearest neighbor search. From the tablewise aspect, multiple hash tables are built for different data views as a joint index, over which a query-specific rank fusion is proposed to rerank all results from the bitwise ranking by diffusing in a graph. Comprehensive experiments on image search over three well-known benchmarks show that the proposed method achieves up to 17.11% and 20.28% performance gains on single and multiple table search over the state-of-the-art methods.

Stable swarming using adaptive long-range interactions

NASA Astrophysics Data System (ADS)

Gorbonos, Dan; Gov, Nir S.

2017-04-01

Sensory mechanisms in biology, from cells to humans, have the property of adaptivity, whereby the response produced by the sensor is adapted to the overall amplitude of the signal, reducing the sensitivity in the presence of strong stimulus, while increasing it when it is weak. This property is inherently energy consuming and a manifestation of the nonequilibrium nature of living organisms. We explore here how adaptivity affects the effective forces that organisms feel due to others in the context of a uniform swarm, in both two and three dimensions. The interactions between the individuals are taken to be attractive and long-range and of power-law form. We find that the effects of adaptivity inside the swarm are dramatic, where the effective forces decrease (or remain constant) with increasing swarm density. Linear stability analysis demonstrates how this property prevents collapse (Jeans instability), when the forces are adaptive. Adaptivity therefore endows swarms with a natural mechanism for self-stabilization.

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sheng, Zheng, E-mail: 19994035@sina.com; Wang, Jun; Zhou, Bihua

2014-03-15

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented tomore » tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.« less

Local adaptation and the evolution of species' ranges under climate change.

PubMed

Atkins, K E; Travis, J M J

2010-10-07

The potential impact of climate change on biodiversity is well documented. A well developed range of statistical methods currently exists that projects the possible future habitat of a species directly from the current climate and a species distribution. However, studies incorporating ecological and evolutionary processes remain limited. Here, we focus on the potential role that local adaptation to climate may play in driving the range dynamics of sessile organisms. Incorporating environmental adaptation into a stochastic simulation yields several new insights. Counter-intuitively, our simulation results suggest that species with broader ranges are not necessarily more robust to climate change. Instead, species with broader ranges can be more susceptible to extinction as locally adapted genotypes are often blocked from range shifting by the presence of cooler adapted genotypes that persist even when their optimum climate has left them behind. Interestingly, our results also suggest that it will not always be the cold-adapted phenotypes that drive polewards range expansion. Instead, range shifts may be driven by phenotypes conferring adaptation to conditions prevalent towards the centre of a species' equilibrium distribution. This may have important consequences for the conservation method termed predictive provenancing. These initial results highlight the potential importance of local adaptation in determining how species will respond to climate change and we argue that this is an area requiring urgent theoretical and empirical attention. 2010 Elsevier Ltd. All rights reserved.

Building a Middle-Range Theory of Adaptive Spirituality.

PubMed

Dobratz, Marjorie C

2016-04-01

The purpose of this article is to describe a Roy adaptation model based- research abstraction, the findings of which were synthesized into a middle-range theory (MRT) of adaptive spirituality. The published literature yielded 21 empirical studies that investigated religion/spirituality. Quantitative results supported the influence of spirituality on quality of life, psychosocial adjustment, well-being, adaptive coping, and the self-concept mode. Qualitative findings showed the importance of spiritual expressions, values, and beliefs in adapting to chronic illness, bereavement, death, and other life transitions. These findings were abstracted into six theoretical statements, a conceptual definition of adaptive spirituality, and three hypotheses for future testing. © The Author(s) 2016.

Face adaptation does not improve performance on search or discrimination tasks.

PubMed

Ng, Minna; Boynton, Geoffrey M; Fine, Ione

2008-01-04

The face adaptation effect, as described by M. A. Webster and O. H. MacLin (1999), is a robust perceptual shift in the appearance of faces after a brief adaptation period. For example, prolonged exposure to Asian faces causes a Eurasian face to appear distinctly Caucasian. This adaptation effect has been documented for general configural effects, as well as for the facial properties of gender, ethnicity, expression, and identity. We began by replicating the finding that adaptation to ethnicity, gender, and a combination of both features induces selective shifts in category appearance. We then investigated whether this adaptation has perceptual consequences beyond a shift in the perceived category boundary by measuring the effects of adaptation on RSVP, spatial search, and discrimination tasks. Adaptation had no discernable effect on performance for any of these tasks.

Self-Adaptive Stepsize Search Applied to Optimal Structural Design

NASA Astrophysics Data System (ADS)

Nolle, L.; Bland, J. A.

Structural engineering often involves the design of space frames that are required to resist predefined external forces without exhibiting plastic deformation. The weight of the structure and hence the weight of its constituent members has to be as low as possible for economical reasons without violating any of the load constraints. Design spaces are usually vast and the computational costs for analyzing a single design are usually high. Therefore, not every possible design can be evaluated for real-world problems. In this work, a standard structural design problem, the 25-bar problem, has been solved using self-adaptive stepsize search (SASS), a relatively new search heuristic. This algorithm has only one control parameter and therefore overcomes the drawback of modern search heuristics, i.e. the need to first find a set of optimum control parameter settings for the problem at hand. In this work, SASS outperforms simulated-annealing, genetic algorithms, tabu search and ant colony optimization.

Anthropogenically induced adaptation to invade (AIAI): contemporary adaptation to human-altered habitats within the native range can promote invasions

PubMed Central

Hufbauer, Ruth A; Facon, Benoît; Ravigné, Virginie; Turgeon, Julie; Foucaud, Julien; Lee, Carol E; Rey, Olivier; Estoup, Arnaud

2012-01-01

Adaptive evolution is currently accepted as playing a significant role in biological invasions. Adaptations relevant to invasions are typically thought to occur either recently within the introduced range, as an evolutionary response to novel selection regimes, or within the native range, because of long-term adaptation to the local environment. We propose that recent adaptation within the native range, in particular adaptations to human-altered habitat, could also contribute to the evolution of invasive populations. Populations adapted to human-altered habitats in the native range are likely to increase in abundance within areas frequented by humans and associated with human transport mechanisms, thus enhancing the likelihood of transport to a novel range. Given that habitats are altered by humans in similar ways worldwide, as evidenced by global environmental homogenization, propagules from populations adapted to human-altered habitats in the native range should perform well within similarly human-altered habitats in the novel range. We label this scenario ‘Anthropogenically Induced Adaptation to Invade’. We illustrate how it differs from other evolutionary processes that may occur during invasions, and how it can help explain accelerating rates of invasions. PMID:25568032

Face adaptation does not improve performance on search or discrimination tasks

PubMed Central

Ng, Minna; Boynton, Geoffrey M.; Fine, Ione

2011-01-01

The face adaptation effect, as described by M. A. Webster and O. H. MacLin (1999), is a robust perceptual shift in the appearance of faces after a brief adaptation period. For example, prolonged exposure to Asian faces causes a Eurasian face to appear distinctly Caucasian. This adaptation effect has been documented for general configural effects, as well as for the facial properties of gender, ethnicity, expression, and identity. We began by replicating the finding that adaptation to ethnicity, gender, and a combination of both features induces selective shifts in category appearance. We then investigated whether this adaptation has perceptual consequences beyond a shift in the perceived category boundary by measuring the effects of adaptation on RSVP, spatial search, and discrimination tasks. Adaptation had no discernable effect on performance for any of these tasks. PMID:18318604

Using Direct Policy Search to Identify Robust Strategies in Adapting to Uncertain Sea Level Rise and Storm Surge

NASA Astrophysics Data System (ADS)

Garner, G. G.; Keller, K.

2017-12-01

Sea-level rise poses considerable risks to coastal communities, ecosystems, and infrastructure. Decision makers are faced with deeply uncertain sea-level projections when designing a strategy for coastal adaptation. The traditional methods have provided tremendous insight into this decision problem, but are often silent on tradeoffs as well as the effects of tail-area events and of potential future learning. Here we reformulate a simple sea-level rise adaptation model to address these concerns. We show that Direct Policy Search yields improved solution quality, with respect to Pareto-dominance in the objectives, over the traditional approach under uncertain sea-level rise projections and storm surge. Additionally, the new formulation produces high quality solutions with less computational demands than the traditional approach. Our results illustrate the utility of multi-objective adaptive formulations for the example of coastal adaptation, the value of information provided by observations, and point to wider-ranging application in climate change adaptation decision problems.

Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

PubMed

Mei, Gang; Xu, Nengxiong; Xu, Liangliang

2016-01-01

This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.

Spatial search on a two-dimensional lattice with long-range interactions

NASA Astrophysics Data System (ADS)

Osada, Tomo; Sanaka, Kaoru; Munro, William J.; Nemoto, Kae

2018-06-01

Quantum-walk-based algorithms that search a marked location among N locations on a d -dimensional lattice succeeds in time O (√{N }) for d >2 , while this is not found to be possible when d =2 . In this paper, we consider a spatial search algorithm using continuous-time quantum walk on a two-dimensional square lattice with the existence of additional long-range edges. We examined such a search on a probabilistic graph model where an edge connecting non-nearest-neighbor lattice points i and j apart by a distance |i -j | is added by probability pi j=|i-j | -α(α ≥0 ) . Through numerical analysis, we found that the search succeeds in time O (√{N }) when α ≤αc=2.4 ±0.1 . For α >2 , the expectation value of the additional long-range edges on each node scales as a constant when N →∞ , which means that search time of O (√{N }) is achieved on a graph with average degree scaling as a constant.

A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

NASA Astrophysics Data System (ADS)

Chen, Xianshun; Feng, Liang; Ong, Yew Soon

2012-07-01

In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

Age differences in visual search for compound patterns: long- versus short-range grouping.

PubMed

Burack, J A; Enns, J T; Iarocci, G; Randolph, B

2000-11-01

Visual search for compound patterns was examined in observers aged 6, 8, 10, and 22 years. The main question was whether age-related improvement in search rate (response time slope over number of items) was different for patterns defined by short- versus long-range spatial relations. Perceptual access to each type of relation was varied by using elements of same contrast (easy to access) or mixed contrast (hard to access). The results showed large improvements with age in search rate for long-range targets; search rate for short-range targets was fairly constant across age. This pattern held regardless of whether perceptual access to a target was easy or hard, supporting the hypothesis that different processes are involved in perceptual grouping at these two levels. The results also point to important links between ontogenic and microgenic change in perception (H. Werner, 1948, 1957).

Fitness declines towards range limits and local adaptation to climate affect dispersal evolution during climate-induced range shifts.

PubMed

Hargreaves, A L; Bailey, S F; Laird, R A

2015-08-01

Dispersal ability will largely determine whether species track their climatic niches during climate change, a process especially important for populations at contracting (low-latitude/low-elevation) range limits that otherwise risk extinction. We investigate whether dispersal evolution at contracting range limits is facilitated by two processes that potentially enable edge populations to experience and adjust to the effects of climate deterioration before they cause extinction: (i) climate-induced fitness declines towards range limits and (ii) local adaptation to a shifting climate gradient. We simulate a species distributed continuously along a temperature gradient using a spatially explicit, individual-based model. We compare range-wide dispersal evolution during climate stability vs. directional climate change, with uniform fitness vs. fitness that declines towards range limits (RLs), and for a single climate genotype vs. multiple genotypes locally adapted to temperature. During climate stability, dispersal decreased towards RLs when fitness was uniform, but increased when fitness declined towards RLs, due to highly dispersive genotypes maintaining sink populations at RLs, increased kin selection in smaller populations, and an emergent fitness asymmetry that favoured dispersal in low-quality habitat. However, this initial dispersal advantage at low-fitness RLs did not facilitate climate tracking, as it was outweighed by an increased probability of extinction. Locally adapted genotypes benefited from staying close to their climate optima; this selected against dispersal under stable climates but for increased dispersal throughout shifting ranges, compared to cases without local adaptation. Dispersal increased at expanding RLs in most scenarios, but only increased at the range centre and contracting RLs given local adaptation to climate. © 2015 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2015 European Society For Evolutionary

Rapid adaptation to climate facilitates range expansion of an invasive plant.

PubMed

Colautti, Robert I; Barrett, Spencer C H

2013-10-18

Adaptation to climate, evolving over contemporary time scales, could facilitate rapid range expansion across environmental gradients. Here, we examine local adaptation along a climatic gradient in the North American invasive plant Lythrum salicaria. We show that the evolution of earlier flowering is adaptive at the northern invasion front where it increases fitness as much as, or more than, the effects of enemy release and the evolution of increased competitive ability. However, early flowering decreases investment in vegetative growth, which reduces fitness by a factor of 3 in southern environments where the North American invasion commenced. Our results demonstrate that local adaptation can evolve quickly during range expansion, overcoming environmental constraints on propagule production.

Here Today, Gone Tomorrow – Adaptation to Change in Memory-Guided Visual Search

PubMed Central

Zellin, Martina; Conci, Markus; von Mühlenen, Adrian; Müller, Hermann J.

2013-01-01

Visual search for a target object can be facilitated by the repeated presentation of an invariant configuration of nontargets (‘contextual cueing’). Here, we tested adaptation of learned contextual associations after a sudden, but permanent, relocation of the target. After an initial learning phase targets were relocated within their invariant contexts and repeatedly presented at new locations, before they returned to the initial locations. Contextual cueing for relocated targets was neither observed after numerous presentations nor after insertion of an overnight break. Further experiments investigated whether learning of additional, previously unseen context-target configurations is comparable to adaptation of existing contextual associations to change. In contrast to the lack of adaptation to changed target locations, contextual cueing developed for additional invariant configurations under identical training conditions. Moreover, across all experiments, presenting relocated targets or additional contexts did not interfere with contextual cueing of initially learned invariant configurations. Overall, the adaptation of contextual memory to changed target locations was severely constrained and unsuccessful in comparison to learning of an additional set of contexts, which suggests that contextual cueing facilitates search for only one repeated target location. PMID:23555038

Adaptive clustering procedure for continuous gravitational wave searches

NASA Astrophysics Data System (ADS)

Singh, Avneet; Papa, Maria Alessandra; Eggenstein, Heinz-Bernd; Walsh, Sinéad

2017-10-01

In hierarchical searches for continuous gravitational waves, clustering of candidates is an important post-processing step because it reduces the number of noise candidates that are followed up at successive stages [J. Aasi et al., Phys. Rev. Lett. 88, 102002 (2013), 10.1103/PhysRevD.88.102002; B. Behnke, M. A. Papa, and R. Prix, Phys. Rev. D 91, 064007 (2015), 10.1103/PhysRevD.91.064007; M. A. Papa et al., Phys. Rev. D 94, 122006 (2016), 10.1103/PhysRevD.94.122006]. Previous clustering procedures bundled together nearby candidates ascribing them to the same root cause (be it a signal or a disturbance), based on a predefined cluster volume. In this paper, we present a procedure that adapts the cluster volume to the data itself and checks for consistency of such volume with what is expected from a signal. This significantly improves the noise rejection capabilities at fixed detection threshold, and at fixed computing resources for the follow-up stages, this results in an overall more sensitive search. This new procedure was employed in the first Einstein@Home search on data from the first science run of the advanced LIGO detectors (O1) [LIGO Scientific Collaboration and Virgo Collaboration, arXiv:1707.02669 [Phys. Rev. D (to be published)

Efficient generation of discontinuity-preserving adaptive triangulations from range images.

PubMed

Garcia, Miguel Angel; Sappa, Angel Domingo

2004-10-01

This paper presents an efficient technique for generating adaptive triangular meshes from range images. The algorithm consists of two stages. First, a user-defined number of points is adaptively sampled from the given range image. Those points are chosen by taking into account the surface shapes represented in the range image in such a way that points tend to group in areas of high curvature and to disperse in low-variation regions. This selection process is done through a noniterative, inherently parallel algorithm in order to gain efficiency. Once the image has been subsampled, the second stage applies a two and one half-dimensional Delaunay triangulation to obtain an initial triangular mesh. To favor the preservation of surface and orientation discontinuities (jump and crease edges) present in the original range image, the aforementioned triangular mesh is iteratively modified by applying an efficient edge flipping technique. Results with real range images show accurate triangular approximations of the given range images with low processing times.

Real-time range acquisition by adaptive structured light.

PubMed

Koninckx, Thomas P; Van Gool, Luc

2006-03-01

The goal of this paper is to provide a "self-adaptive" system for real-time range acquisition. Reconstructions are based on a single frame structured light illumination. Instead of using generic, static coding that is supposed to work under all circumstances, system adaptation is proposed. This occurs on-the-fly and renders the system more robust against instant scene variability and creates suitable patterns at startup. A continuous trade-off between speed and quality is made. A weighted combination of different coding cues--based upon pattern color, geometry, and tracking--yields a robust way to solve the correspondence problem. The individual coding cues are automatically adapted within a considered family of patterns. The weights to combine them are based on the average consistency with the result within a small time-window. The integration itself is done by reformulating the problem as a graph cut. Also, the camera-projector configuration is taken into account for generating the projection patterns. The correctness of the range maps is not guaranteed, but an estimation of the uncertainty is provided for each part of the reconstruction. Our prototype is implemented using unmodified consumer hardware only and, therefore, is cheap. Frame rates vary between 10 and 25 fps, dependent on scene complexity.

An Adaptive Image Enhancement Technique by Combining Cuckoo Search and Particle Swarm Optimization Algorithm

PubMed Central

Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

2015-01-01

Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

PubMed

Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

2015-01-01

Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.

Specification for a surface-search radar-detection-range model

NASA Astrophysics Data System (ADS)

Hattan, Claude P.

1990-09-01

A model that predicts surface-search radar detection range versus a variety of combatants has been developed at the Naval Ocean Systems Center. This model uses a simplified ship radar cross section (RCS) model and the U.S. Navy Oceanographic and Atmospheric Mission Library Standard Electromagnetic Propagation Model. It provides the user with a method of assessing the effects of the environment of the performance of a surface-search radar system. The software implementation of the model is written in ANSI FORTRAN 77, with MIL-STD-1753 extensions. The program provides the user with a table of expected detection ranges when the model is supplied with the proper environmental radar system inputs. The target model includes the variation in RCS as a function of aspect angle and the distribution of reflected radar energy as a function of height above the waterline. The modeled propagation effects include refraction caused by a multisegmented refractivity profile, sea-surface roughness caused by local winds, evaporation ducting, and surface-based ducts caused by atmospheric layering.

A Search for a General Phenomenon of Adaptive Mutability

PubMed Central

Galitski, T.; Roth, J. R.

1996-01-01

The most prominent systems for the study of adaptive mutability depend on the specialized activities of genetic elements like bacteriophage Mu and the F plasmid. Searching for general adaptive mutability, we have investigated the behavior of Salmonella typhimurium strains with chromosomal lacZ mutations. We have studied 30 revertible nonsense, missense, frameshift, and insertion alleles. One-third of the mutants produced >=10 late revertant colonies (appearing three to seven days after plating on selective medium). For the prolific mutants, the number of late revertants showed rank correlation with the residual β-galactosidase activity; for the same mutants, revertant number showed no correlation with the nonselective reversion rate (from fluctuation tests). Leaky mutants, which grew slowly on selective medium, produced late revertants whereas tight nongrowing mutants generally did not produce late revertants. However, the number of late revertants was not proportional to residual growth. Using total residual growth and the nonselective reversion rate, the expected number of late revertants was calculated. For several leaky mutants, the observed revertant number exceeded the expected number. We suggest that excess late revertants from these mutants arise from general adaptive mutability available to any chromosomal gene. PMID:8725216

Middle-Range Theory: Coping and Adaptation with Active Aging.

PubMed

Salazar-Barajas, Martha Elba; Salazar-González, Bertha Cecilia; Gallegos-Cabriales, Esther Carlota

2017-10-01

Various disciplines focus on a multiplicity of aspects of aging: lifestyles, personal biological factors, psychological conditions, health conditions, physical environment, and social and economic factors. The aforementioned are all related to the determinants of active aging. The aim is to describe the development of a middle-range theory based on coping and adaptation with active aging. Concepts and relationships derived from Roy's model of adaptation are included. The proposed concepts are hope, health habits, coping with aging, social relations, and active aging.

Biclustering of gene expression data using reactive greedy randomized adaptive search procedure

PubMed Central

Dharan, Smitha; Nair, Achuthsankar S

2009-01-01

Background Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse. Cheng and Church have introduced a measure called mean squared residue score to evaluate the quality of a bicluster and has become one of the most popular measures to search for biclusters. In this paper, we review basic concepts of the metaheuristics Greedy Randomized Adaptive Search Procedure (GRASP)-construction and local search phases and propose a new method which is a variant of GRASP called Reactive Greedy Randomized Adaptive Search Procedure (Reactive GRASP) to detect significant biclusters from large microarray datasets. The method has two major steps. First, high quality bicluster seeds are generated by means of k-means clustering. In the second step, these seeds are grown using the Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list is self-adjusted, depending on the quality of the solutions found previously. Results We performed statistical and biological validations of the biclusters obtained and evaluated the method against the results of basic GRASP and as well as with the classic work of Cheng and Church. The experimental results indicate that the Reactive GRASP approach outperforms the basic GRASP algorithm and Cheng and Church approach. Conclusion The Reactive GRASP approach for the detection of significant biclusters is robust and does not require calibration efforts. PMID:19208127

Biclustering of gene expression data using reactive greedy randomized adaptive search procedure.

PubMed

Dharan, Smitha; Nair, Achuthsankar S

2009-01-30

Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse. Cheng and Church have introduced a measure called mean squared residue score to evaluate the quality of a bicluster and has become one of the most popular measures to search for biclusters. In this paper, we review basic concepts of the metaheuristics Greedy Randomized Adaptive Search Procedure (GRASP)-construction and local search phases and propose a new method which is a variant of GRASP called Reactive Greedy Randomized Adaptive Search Procedure (Reactive GRASP) to detect significant biclusters from large microarray datasets. The method has two major steps. First, high quality bicluster seeds are generated by means of k-means clustering. In the second step, these seeds are grown using the Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list is self-adjusted, depending on the quality of the solutions found previously. We performed statistical and biological validations of the biclusters obtained and evaluated the method against the results of basic GRASP and as well as with the classic work of Cheng and Church. The experimental results indicate that the Reactive GRASP approach outperforms the basic GRASP algorithm and Cheng and Church approach. The Reactive GRASP approach for the detection of significant biclusters is robust and does not require calibration efforts.

Long-range Acoustic Interactions in Insect Swarms - An Adaptive Gravity Model

NASA Astrophysics Data System (ADS)

Gorbonos, Dan; Ianconescu, Reuven; Puckett, James G.; Ni, Rui; Ouellette, Nicholas T.; Gov, Nir S.

The collective motion of groups of animals emerges from the net effect of the interactions between individual members of the group. In many cases, such as birds, fish, or ungulates, these interactions are mediated by sensory stimuli that predominantly arise from nearby neighbors. But not all stimuli in animal groups are short range. We consider mating swarms of midges, which are thought to interact primarily via long-range acoustic stimuli. We exploit the similarity in form between the decay of acoustic and gravitational sources to build a model for swarm behavior. By accounting for the adaptive nature of the midges' acoustic sensing, we show that our ``adaptive gravity'' model makes mean-field predictions that agree well with experimental observations of laboratory swarms. Our results highlight the role of sensory mechanisms and interaction range in collective animal behavior. Additionally, the adaptive interactions open a new class of equations of motion, which may appear in other biological contexts.

Long-range Acoustic Interactions in Insect Swarms: An Adaptive Gravity Model

NASA Astrophysics Data System (ADS)

Gorbonos, Dan; Ianconescu, Reuven; Puckett, James G.; Ni, Rui; Ouellette, Nicholas T.; Gov, Nir S.

The collective motion of groups of animals emerges from the net effect of the interactions between individual members of the group. In many cases, such as birds, fish, or ungulates, these interactions are mediated by sensory stimuli that predominantly arise from nearby neighbors. But not all stimuli in animal groups are short range. Here, we consider mating swarms of midges, which interact primarily via long-range acoustic stimuli. We exploit the similarity in form between the decay of acoustic and gravitational sources to build a model for swarm behavior. By accounting for the adaptive nature of the midges' acoustic sensing, we show that our ``adaptive gravity'' model makes mean-field predictions that agree well with experimental observations of laboratory swarms. Our results highlight the role of sensory mechanisms and interaction range in collective animal behavior. The adaptive interactions that we present here open a new class of equations of motion, which may appear in other biological contexts.

Long-range acoustic interactions in insect swarms: an adaptive gravity model

NASA Astrophysics Data System (ADS)

Gorbonos, Dan; Ianconescu, Reuven; Puckett, James G.; Ni, Rui; Ouellette, Nicholas T.; Gov, Nir S.

2016-07-01

The collective motion of groups of animals emerges from the net effect of the interactions between individual members of the group. In many cases, such as birds, fish, or ungulates, these interactions are mediated by sensory stimuli that predominantly arise from nearby neighbors. But not all stimuli in animal groups are short range. Here, we consider mating swarms of midges, which are thought to interact primarily via long-range acoustic stimuli. We exploit the similarity in form between the decay of acoustic and gravitational sources to build a model for swarm behavior. By accounting for the adaptive nature of the midges’ acoustic sensing, we show that our ‘adaptive gravity’ model makes mean-field predictions that agree well with experimental observations of laboratory swarms. Our results highlight the role of sensory mechanisms and interaction range in collective animal behavior. Additionally, the adaptive interactions that we present here open a new class of equations of motion, which may appear in other biological contexts.

Adaptation to climate change--exploring the potential of locally adapted breeds.

PubMed

Hoffmann, Irene

2013-06-01

The livestock sector and agriculture as a whole face unprecedented challenges to increase production while improving the environment. On the basis of a literature review, the paper first discusses challenges related to climate change, food security and other drivers of change in livestock production. On the basis of a recent discourse in ecology, a framework for assessing livestock species' and breeds' vulnerability to climate change is presented. The second part of the paper draws on an analysis of data on breed qualities obtained from the Food and Agriculture Organization's Domestic Animal Diversity Information System (DAD-IS) to explore the range of adaptation traits present in today's breed diversity. The analysis produced a first mapping of a range of ascribed adaptation traits of national breed populations. It allowed to explore what National Coordinators understand by 'locally adapted' and other terms that describe general adaptation, to better understand the habitat, fodder and temperature range of each species and to shed light on the environments in which targeted search for adaptation traits could focus.

Adaptive evolution to novel predators facilitates the evolution of damselfly species range shifts.

PubMed

Siepielski, Adam M; Beaulieu, Jeremy M

2017-04-01

Most species have evolved adaptations to reduce the chances of predation. In many cases, adaptations to coexist with one predator generate tradeoffs in the ability to live with other predators. Consequently, the ability to live with one predator may limit the geographic distributions of species, such that adaptive evolution to coexist with novel predators may facilitate range shifts. In a case study with Enallagma damselflies, we used a comparative phylogenetic approach to test the hypothesis that adaptive evolution to live with a novel predator facilitates range size shifts. Our results suggest that the evolution of Enallagma shifting from living in ancestral lakes with fish as top predators, to living in lakes with dragonflies as predators, may have facilitated an increase in their range sizes. This increased range size likely arose because lakes with dragonflies were widespread, but unavailable as a habitat throughout much of the evolutionary history of Enallagma because they were historically maladapted to coexist with dragonfly predators. Additionally, the traits that have evolved as defenses against dragonflies also likely enhanced damselfly dispersal abilities. While many factors underlie the evolutionary history of species ranges, these results suggest a role for the evolution of predator-prey interactions. © 2017 The Author(s). Evolution © 2017 The Society for the Study of Evolution.

Fast adaptive diamond search algorithm for block-matching motion estimation using spatial correlation

NASA Astrophysics Data System (ADS)

Park, Sang-Gon; Jeong, Dong-Seok

2000-12-01

In this paper, we propose a fast adaptive diamond search algorithm (FADS) for block matching motion estimation. Many fast motion estimation algorithms reduce the computational complexity by the UESA (Unimodal Error Surface Assumption) where the matching error monotonically increases as the search moves away from the global minimum point. Recently, many fast BMAs (Block Matching Algorithms) make use of the fact that global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the neighboring blocks. We move the search origin according to the motion vectors of the spatially neighboring blocks and their MAEs (Mean Absolute Errors). The computer simulation shows that the proposed algorithm has almost the same computational complexity with DS (Diamond Search), but enhances PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS (Full Search), even for the large motion with half the computational load.

Lost in Search: (Mal-)Adaptation to Probabilistic Decision Environments in Children and Adults

ERIC Educational Resources Information Center

Betsch, Tilmann; Lehmann, Anne; Lindow, Stefanie; Lang, Anna; Schoemann, Martin

2016-01-01

Adaptive decision making in probabilistic environments requires individuals to use probabilities as weights in predecisional information searches and/or when making subsequent choices. Within a child-friendly computerized environment (Mousekids), we tracked 205 children's (105 children 5-6 years of age and 100 children 9-10 years of age) and 103…

Accelerated search for materials with targeted properties by adaptive design

PubMed Central

Xue, Dezhen; Balachandran, Prasanna V.; Hogden, John; Theiler, James; Xue, Deqing; Lookman, Turab

2016-01-01

Finding new materials with targeted properties has traditionally been guided by intuition, and trial and error. With increasing chemical complexity, the combinatorial possibilities are too large for an Edisonian approach to be practical. Here we show how an adaptive design strategy, tightly coupled with experiments, can accelerate the discovery process by sequentially identifying the next experiments or calculations, to effectively navigate the complex search space. Our strategy uses inference and global optimization to balance the trade-off between exploitation and exploration of the search space. We demonstrate this by finding very low thermal hysteresis (ΔT) NiTi-based shape memory alloys, with Ti50.0Ni46.7Cu0.8Fe2.3Pd0.2 possessing the smallest ΔT (1.84 K). We synthesize and characterize 36 predicted compositions (9 feedback loops) from a potential space of ∼800,000 compositions. Of these, 14 had smaller ΔT than any of the 22 in the original data set. PMID:27079901

Adaptive divergence at the margin of an invaded range

Treesearch

Francis F. Kilkenny; Laura F. Galloway

2012-01-01

Invasive plant species threaten biological communities globally. However, relatively little is known about how evolutionary processes vary over the course of an invasion. To evaluate the importance of historical and adaptive drivers of range expansion, we compare the performance of North American populations of invasive Lonicera japonica from areas established 100-150...

Persistence and Adaptation in Immunity: T Cells Balance the Extent and Thoroughness of Search

PubMed Central

Fricke, G. Matthew; Letendre, Kenneth A.; Moses, Melanie E.; Cannon, Judy L.

2016-01-01

Effective search strategies have evolved in many biological systems, including the immune system. T cells are key effectors of the immune response, required for clearance of pathogenic infection. T cell activation requires that T cells encounter antigen-bearing dendritic cells within lymph nodes, thus, T cell search patterns within lymph nodes may be a crucial determinant of how quickly a T cell immune response can be initiated. Previous work suggests that T cell motion in the lymph node is similar to a Brownian random walk, however, no detailed analysis has definitively shown whether T cell movement is consistent with Brownian motion. Here, we provide a precise description of T cell motility in lymph nodes and a computational model that demonstrates how motility impacts T cell search efficiency. We find that both Brownian and Lévy walks fail to capture the complexity of T cell motion. Instead, T cell movement is better described as a correlated random walk with a heavy-tailed distribution of step lengths. Using computer simulations, we identify three distinct factors that contribute to increasing T cell search efficiency: 1) a lognormal distribution of step lengths, 2) motion that is directionally persistent over short time scales, and 3) heterogeneity in movement patterns. Furthermore, we show that T cells move differently in specific frequently visited locations that we call “hotspots” within lymph nodes, suggesting that T cells change their movement in response to the lymph node environment. Our results show that like foraging animals, T cells adapt to environmental cues, suggesting that adaption is a fundamental feature of biological search. PMID:26990103

Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

PubMed Central

Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

2016-01-01

Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter. PMID:27212938

The Adaptive Range of 1/f Isometric Force Production

ERIC Educational Resources Information Center

Sosnoff, Jacob J.; Valantine, Andrew D.; Newell, Karl M.

2009-01-01

The adaptive range of 1/f dynamics in isometric force output was investigated. Participants produced isometric force to targets with predictable demands (constant and sinusoidal) and 1/f noise waveforms (white, pink, brown, and black) that also varied in the frequency bandwidth represented in the force signal (0-4 Hz, 0-8 Hz, and 0-12 Hz). The…

Ultra-wide Range Gamma Detector System for Search and Locate Operations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Odell, D. Mackenzie Odell; Harpring, Larry J.; Moore, Frank S. Jr.

2005-10-26

Collecting debris samples following a nuclear event requires that operations be conducted from a considerable stand-off distance. An ultra-wide range gamma detector system has been constructed to accomplish both long range radiation search and close range hot sample collection functions. Constructed and tested on a REMOTEC Andros platform, the system has demonstrated reliable operation over six orders of magnitude of gamma dose from 100's of uR/hr to over 100 R/hr. Functional elements include a remotely controlled variable collimator assembly, a NaI(Tl)/photomultiplier tube detector, a proprietary digital radiation instrument, a coaxially mounted video camera, a digital compass, and both local andmore » remote control computers with a user interface designed for long range operations. Long range sensitivity and target location, as well as close range sample selection performance are presented.« less

Experimental Searches for Exotic Short-Range Forces Using Mechanical Oscillators

NASA Astrophysics Data System (ADS)

Weisman, Evan

Experimental searches for forces beyond gravity and electromagnetism at short range have attracted a great deal of attention over the last decade. In this thesis I describe the test mass development for two new experiments searching for forces below 1 mm. Both modify a previous experiment that used 1 kHz mechanical oscillators as test masses with a stiff conducting shield between them to suppress backgrounds, a promising technique for probing exceptionally small distances at the limit of instrumental thermal noise. To further reduce thermal noise, one experiment will use plated silicon test masses at cryogenic temperatures. The other experiment, which searches for spin-dependent interactions, will apply the spin-polarizable material Dy3Fe5O 12 to the test mass surfaces. This material exhibits orbital compensation of the magnetism associated with its intrinsic electron spin, minimizing magnetic backgrounds. Several plated silicon test mass prototypes were fabricated using photolithography (useful in both experiments), and spin-dependent materials were synthesized with a simple chemical recipe. Both silicon and spin-dependent test masses demonstrate the mechanical and magnetic properties necessary for sensitive experiments. I also describe sensitivity calculations of another proposed spin-dependent experiment, based on a modified search for the electron electric dipole moment, which show unprecedented sensitivity to exotic monopole-dipole forces. Inspired by a finite element model, a study attempting to maximize detector quality factor versus geometry is also presented, with experimental results so far not explained by the model.

Spatial Selection and Local Adaptation Jointly Shape Life-History Evolution during Range Expansion.

PubMed

Van Petegem, Katrien H P; Boeye, Jeroen; Stoks, Robby; Bonte, Dries

2016-11-01

In the context of climate change and species invasions, range shifts increasingly gain attention because the rates at which they occur in the Anthropocene induce rapid changes in biological assemblages. During range shifts, species experience multiple selection pressures. For poleward expansions in particular, it is difficult to interpret observed evolutionary dynamics because of the joint action of evolutionary processes related to spatial selection and to adaptation toward local climatic conditions. To disentangle the effects of these two processes, we integrated stochastic modeling and data from a common garden experiment, using the spider mite Tetranychus urticae as a model species. By linking the empirical data with those derived form a highly parameterized individual-based model, we infer that both spatial selection and local adaptation contributed to the observed latitudinal life-history divergence. Spatial selection best described variation in dispersal behavior, while variation in development was best explained by adaptation to the local climate. Divergence in life-history traits in species shifting poleward could consequently be jointly determined by contemporary evolutionary dynamics resulting from adaptation to the environmental gradient and from spatial selection. The integration of modeling with common garden experiments provides a powerful tool to study the contribution of these evolutionary processes on life-history evolution during range expansion.

Distributed Adaptive Binary Quantization for Fast Nearest Neighbor Search.

PubMed

Xianglong Liu; Zhujin Li; Cheng Deng; Dacheng Tao

2017-11-01

Hashing has been proved an attractive technique for fast nearest neighbor search over big data. Compared with the projection based hashing methods, prototype-based ones own stronger power to generate discriminative binary codes for the data with complex intrinsic structure. However, existing prototype-based methods, such as spherical hashing and K-means hashing, still suffer from the ineffective coding that utilizes the complete binary codes in a hypercube. To address this problem, we propose an adaptive binary quantization (ABQ) method that learns a discriminative hash function with prototypes associated with small unique binary codes. Our alternating optimization adaptively discovers the prototype set and the code set of a varying size in an efficient way, which together robustly approximate the data relations. Our method can be naturally generalized to the product space for long hash codes, and enjoys the fast training linear to the number of the training data. We further devise a distributed framework for the large-scale learning, which can significantly speed up the training of ABQ in the distributed environment that has been widely deployed in many areas nowadays. The extensive experiments on four large-scale (up to 80 million) data sets demonstrate that our method significantly outperforms state-of-the-art hashing methods, with up to 58.84% performance gains relatively.

SASS: A symmetry adapted stochastic search algorithm exploiting site symmetry

NASA Astrophysics Data System (ADS)

Wheeler, Steven E.; Schleyer, Paul v. R.; Schaefer, Henry F.

2007-03-01

A simple symmetry adapted search algorithm (SASS) exploiting point group symmetry increases the efficiency of systematic explorations of complex quantum mechanical potential energy surfaces. In contrast to previously described stochastic approaches, which do not employ symmetry, candidate structures are generated within simple point groups, such as C2, Cs, and C2v. This facilitates efficient sampling of the 3N-6 Pople's dimensional configuration space and increases the speed and effectiveness of quantum chemical geometry optimizations. Pople's concept of framework groups [J. Am. Chem. Soc. 102, 4615 (1980)] is used to partition the configuration space into structures spanning all possible distributions of sets of symmetry equivalent atoms. This provides an efficient means of computing all structures of a given symmetry with minimum redundancy. This approach also is advantageous for generating initial structures for global optimizations via genetic algorithm and other stochastic global search techniques. Application of the SASS method is illustrated by locating 14 low-lying stationary points on the cc-pwCVDZ ROCCSD(T) potential energy surface of Li5H2. The global minimum structure is identified, along with many unique, nonintuitive, energetically favorable isomers.

Adaptation and visual salience

PubMed Central

McDermott, Kyle C.; Malkoc, Gokhan; Mulligan, Jeffrey B.; Webster, Michael A.

2011-01-01

We examined how the salience of color is affected by adaptation to different color distributions. Observers searched for a color target on a dense background of distractors varying along different directions in color space. Prior adaptation to the backgrounds enhanced search on the same background while adaptation to orthogonal background directions slowed detection. Advantages of adaptation were seen for both contrast adaptation (to different color axes) and chromatic adaptation (to different mean chromaticities). Control experiments, including analyses of eye movements during the search, suggest that these aftereffects are unlikely to reflect simple learning or changes in search strategies on familiar backgrounds, and instead result from how adaptation alters the relative salience of the target and background colors. Comparable effects were observed along different axes in the chromatic plane or for axes defined by different combinations of luminance and chromatic contrast, consistent with visual search and adaptation mediated by multiple color mechanisms. Similar effects also occurred for color distributions characteristic of natural environments with strongly selective color gamuts. Our results are consistent with the hypothesis that adaptation may play an important functional role in highlighting the salience of novel stimuli by discounting ambient properties of the visual environment. PMID:21106682

Visual Scan Adaptation During Repeated Visual Search

DTIC Science & Technology

2010-01-01

Junge, J. A. (2004). Searching for stimulus-driven shifts of attention. Psychonomic Bulletin & Review , 11, 876–881. Furst, C. J. (1971...search strategies cannot override attentional capture. Psychonomic Bulletin & Review , 11, 65–70. Wolfe, J. M. (1994). Guided search 2.0: A revised model...of visual search. Psychonomic Bulletin & Review , 1, 202–238. Wolfe, J. M. (1998a). Visual search. In H. Pashler (Ed.), Attention (pp. 13–73). East

Lévy flight and Brownian search patterns of a free-ranging predator reflect different prey field characteristics.

PubMed

Sims, David W; Humphries, Nicolas E; Bradford, Russell W; Bruce, Barry D

2012-03-01

1. Search processes play an important role in physical, chemical and biological systems. In animal foraging, the search strategy predators should use to search optimally for prey is an enduring question. Some models demonstrate that when prey is sparsely distributed, an optimal search pattern is a specialised random walk known as a Lévy flight, whereas when prey is abundant, simple Brownian motion is sufficiently efficient. These predictions form part of what has been termed the Lévy flight foraging hypothesis (LFF) which states that as Lévy flights optimise random searches, movements approximated by optimal Lévy flights may have naturally evolved in organisms to enhance encounters with targets (e.g. prey) when knowledge of their locations is incomplete. 2. Whether free-ranging predators exhibit the movement patterns predicted in the LFF hypothesis in response to known prey types and distributions, however, has not been determined. We tested this using vertical and horizontal movement data from electronic tagging of an apex predator, the great white shark Carcharodon carcharias, across widely differing habitats reflecting different prey types. 3. Individual white sharks exhibited movement patterns that predicted well the prey types expected under the LFF hypothesis. Shark movements were best approximated by Brownian motion when hunting near abundant, predictable sources of prey (e.g. seal colonies, fish aggregations), whereas movements approximating truncated Lévy flights were present when searching for sparsely distributed or potentially difficult-to-detect prey in oceanic or shelf environments, respectively. 4. That movement patterns approximated by truncated Lévy flights and Brownian behaviour were present in the predicted prey fields indicates search strategies adopted by white sharks appear to be the most efficient ones for encountering prey in the habitats where such patterns are observed. This suggests that C. carcharias appears capable of exhibiting

Experimental Adaptation of Burkholderia cenocepacia to Onion Medium Reduces Host Range ▿ † ‡

PubMed Central

Ellis, Crystal N.; Cooper, Vaughn S.

2010-01-01

It is unclear whether adaptation to a new host typically broadens or compromises host range, yet the answer bears on the fate of emergent pathogens and symbionts. We investigated this dynamic using a soil isolate of Burkholderia cenocepacia, a species that normally inhabits the rhizosphere, is related to the onion pathogen B. cepacia, and can infect the lungs of cystic fibrosis patients. We hypothesized that adaptation of B. cenocepacia to a novel host would compromise fitness and virulence in alternative hosts. We modeled adaptation to a specific host by experimentally evolving 12 populations of B. cenocepacia in liquid medium composed of macerated onion tissue for 1,000 generations. The mean fitness of all populations increased by 78% relative to the ancestor, but significant variation among lines was observed. Populations also varied in several phenotypes related to host association, including motility, biofilm formation, and quorum-sensing function. Together, these results suggest that each population adapted by fixing different sets of adaptive mutations. However, this adaptation was consistently accompanied by a loss of pathogenicity to the nematode Caenorhabditis elegans; by 500 generations most populations became unable to kill nematodes. In conclusion, we observed a narrowing of host range as a consequence of prolonged adaptation to an environment simulating a specific host, and we suggest that emergent pathogens may face similar consequences if they become host-restricted. PMID:20154121

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

PubMed Central

Hemmelmayr, Vera C.; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-01-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP. PMID:23483764

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.

PubMed

Hemmelmayr, Vera C; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-12-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

Center for Adaptive Optics | Publications

Science.gov Websites

Text-Only Version Adaptive Optics, Center for Home Page CfAO Logo Search The Center Adaptive Optics for Adaptive Optics | Search | Sitemap | The Center | Adaptive Optics | Research | Education/HR

Signatures of local adaptation along environmental gradients in a range-expanding damselfly (Ischnura elegans).

PubMed

Dudaniec, Rachael Y; Yong, Chuan Ji; Lancaster, Lesley T; Svensson, Erik I; Hansson, Bengt

2018-06-01

Insect distributions are shifting rapidly in response to climate change and are undergoing rapid evolutionary change. We investigate the molecular signatures underlying local adaptation in the range-expanding damselfly, Ischnura elegans. Using a landscape genomic approach combined with generalized dissimilarity modelling (GDM), we detect selection signatures on loci via allelic frequency change along environmental gradients. We analyse 13,612 single nucleotide polymorphisms (SNPs), derived from restriction site-associated DNA sequencing (RADseq), in 426 individuals from 25 sites spanning the I. elegans distribution in Sweden, including its expanding northern range edge. Environmental association analysis (EAA) and the magnitude of allele frequency change along the range expansion gradient revealed significant signatures of selection in relation to high maximum summer temperature, high mean annual precipitation and low wind speeds at the range edge. SNP annotations with significant signatures of selection revealed gene functions associated with ongoing range expansion, including heat shock proteins (HSP40 and HSP70), ion transport (V-ATPase) and visual processes (long-wavelength-sensitive opsin), which have implications for thermal stress response, salinity tolerance and mate discrimination, respectively. We also identified environmental thresholds where climate-mediated selection is likely to be strong, and indicate that I. elegans is rapidly adapting to the climatic environment during its ongoing range expansion. Our findings empirically validate an integrative approach for detecting spatially explicit signatures of local adaptation along environmental gradients. © 2018 John Wiley & Sons Ltd.

Introduction beyond a species range: a relationship between population origin, adaptive potential and plant performance.

PubMed

Volis, S; Ormanbekova, D; Yermekbayev, K; Song, M; Shulgina, I

2014-09-01

The adaptive potential of a population defines its importance for species survival in changing environmental conditions such as global climate change. Very few empirical studies have examined adaptive potential across species' ranges, namely, of edge vs core populations, and we are unaware of a study that has tested adaptive potential (namely, variation in adaptive traits) and measured performance of such populations in conditions not currently experienced by the species but expected in the future. Here we report the results of a Triticum dicoccoides population study that employed transplant experiments and analysis of quantitative trait variation. Two populations at the opposite edges of the species range (1) were locally adapted; (2) had lower adaptive potential (inferred from the extent of genetic quantitative trait variation) than the two core populations; and (3) were outperformed by the plants from the core population in the novel environment. The fact that plants from the species arid edge performed worse than plants from the more mesic core in extreme drought conditions beyond the present climatic envelope of the species implies that usage of peripheral populations for conservation purposes must be based on intensive sampling of among-population variation.

SU-F-J-197: A Novel Intra-Beam Range Detection and Adaptation Strategy for Particle Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, M; Jiang, S; Shao, Y

2016-06-15

Purpose: In-vivo range detection/verification is crucial in particle therapy for effective and safe delivery. The state-of-art techniques are not sufficient for in-vivo on-line range verification due to conflicts among patient dose, signal statistics and imaging time. We propose a novel intra-beam range detection and adaptation strategy for particle therapy. Methods: This strategy uses the planned mid-range spots as probing beams without adding extra radiation to patients. Such choice of probing beams ensures the Bragg peaks to remain inside the tumor even with significant range variation from the plan. It offers sufficient signal statistics for in-beam positron emission tomography (PET) duemore » to high positron activity of therapeutic dose. The probing beam signal can be acquired and reconstructed using in-beam PET that allows for delineation of the Bragg peaks and detection of range shift with ease of detection enabled by single-layered spots. If the detected range shift is within a pre-defined tolerance, the remaining spots will be delivered as the original plan. Otherwise, a fast re-optimization using range-shifted beamlets and accounting for the probing beam dose is applied to consider the tradeoffs posed by the online anatomy. Simulated planning and delivery studies were used to demonstrate the effectiveness of the proposed techniques. Results: Simulations with online range variations due to shifts of various foreign objects into the beam path showed successful delineation of the Bragg peaks as a result of delivering probing beams. Without on-line delivery adaptation, dose distribution was significantly distorted. In contrast, delivery adaptation incorporating detected range shift recovered well the planned dose. Conclusion: The proposed intra-beam range detection and adaptation utilizing the planned mid-range spots as probing beams, which illuminate the beam range with strong and accurate PET signals, is a safe, practical, yet effective approach to

Communication Range Dynamics and Performance Analysis for a Self-Adaptive Transmission Power Controller.

PubMed

Lucas Martínez, Néstor; Martínez Ortega, José-Fernán; Hernández Díaz, Vicente; Del Toro Matamoros, Raúl M

2016-05-12

The deployment of the nodes in a Wireless Sensor and Actuator Network (WSAN) is typically restricted by the sensing and acting coverage. This implies that the locations of the nodes may be, and usually are, not optimal from the point of view of the radio communication. Additionally, when the transmission power is tuned for those locations, there are other unpredictable factors that can cause connectivity failures, like interferences, signal fading due to passing objects and, of course, radio irregularities. A control-based self-adaptive system is a typical solution to improve the energy consumption while keeping good connectivity. In this paper, we explore how the communication range for each node evolves along the iterations of an energy saving self-adaptive transmission power controller when using different parameter sets in an outdoor scenario, providing a WSAN that automatically adapts to surrounding changes keeping good connectivity. The results obtained in this paper show how the parameters with the best performance keep a k-connected network, where k is in the range of the desired node degree plus or minus a specified tolerance value.

Adaptive time-sequential binary sensing for high dynamic range imaging

NASA Astrophysics Data System (ADS)

Hu, Chenhui; Lu, Yue M.

2012-06-01

We present a novel image sensor for high dynamic range imaging. The sensor performs an adaptive one-bit quantization at each pixel, with the pixel output switched from 0 to 1 only if the number of photons reaching that pixel is greater than or equal to a quantization threshold. With an oracle knowledge of the incident light intensity, one can pick an optimal threshold (for that light intensity) and the corresponding Fisher information contained in the output sequence follows closely that of an ideal unquantized sensor over a wide range of intensity values. This observation suggests the potential gains one may achieve by adaptively updating the quantization thresholds. As the main contribution of this work, we propose a time-sequential threshold-updating rule that asymptotically approaches the performance of the oracle scheme. With every threshold mapped to a number of ordered states, the dynamics of the proposed scheme can be modeled as a parametric Markov chain. We show that the frequencies of different thresholds converge to a steady-state distribution that is concentrated around the optimal choice. Moreover, numerical experiments show that the theoretical performance measures (Fisher information and Craḿer-Rao bounds) can be achieved by a maximum likelihood estimator, which is guaranteed to find globally optimal solution due to the concavity of the log-likelihood functions. Compared with conventional image sensors and the strategy that utilizes a constant single-photon threshold considered in previous work, the proposed scheme attains orders of magnitude improvement in terms of sensor dynamic ranges.

Methodological aspects of an adaptive multidirectional pattern search to optimize speech perception using three hearing-aid algorithms

NASA Astrophysics Data System (ADS)

Franck, Bas A. M.; Dreschler, Wouter A.; Lyzenga, Johannes

2004-12-01

In this study we investigated the reliability and convergence characteristics of an adaptive multidirectional pattern search procedure, relative to a nonadaptive multidirectional pattern search procedure. The procedure was designed to optimize three speech-processing strategies. These comprise noise reduction, spectral enhancement, and spectral lift. The search is based on a paired-comparison paradigm, in which subjects evaluated the listening comfort of speech-in-noise fragments. The procedural and nonprocedural factors that influence the reliability and convergence of the procedure are studied using various test conditions. The test conditions combine different tests, initial settings, background noise types, and step size configurations. Seven normal hearing subjects participated in this study. The results indicate that the reliability of the optimization strategy may benefit from the use of an adaptive step size. Decreasing the step size increases accuracy, while increasing the step size can be beneficial to create clear perceptual differences in the comparisons. The reliability also depends on starting point, stop criterion, step size constraints, background noise, algorithms used, as well as the presence of drifting cues and suboptimal settings. There appears to be a trade-off between reliability and convergence, i.e., when the step size is enlarged the reliability improves, but the convergence deteriorates. .

STEPS: a grid search methodology for optimized peptide identification filtering of MS/MS database search results.

PubMed

Piehowski, Paul D; Petyuk, Vladislav A; Sandoval, John D; Burnum, Kristin E; Kiebel, Gary R; Monroe, Matthew E; Anderson, Gordon A; Camp, David G; Smith, Richard D

2013-03-01

For bottom-up proteomics, there are wide variety of database-searching algorithms in use for matching peptide sequences to tandem MS spectra. Likewise, there are numerous strategies being employed to produce a confident list of peptide identifications from the different search algorithm outputs. Here we introduce a grid-search approach for determining optimal database filtering criteria in shotgun proteomics data analyses that is easily adaptable to any search. Systematic Trial and Error Parameter Selection--referred to as STEPS--utilizes user-defined parameter ranges to test a wide array of parameter combinations to arrive at an optimal "parameter set" for data filtering, thus maximizing confident identifications. The benefits of this approach in terms of numbers of true-positive identifications are demonstrated using datasets derived from immunoaffinity-depleted blood serum and a bacterial cell lysate, two common proteomics sample types. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Experience-dependent mushroom body plasticity in butterflies: consequences of search complexity and host range

PubMed Central

Janz, Niklas; Schäpers, Alexander; Gamberale-Stille, Gabriella

2017-01-01

An ovipositing insect experiences many sensory challenges during her search for a suitable host plant. These sensory challenges become exceedingly pronounced when host range increases, as larger varieties of sensory inputs have to be perceived and processed in the brain. Neural capacities can be exceeded upon information overload, inflicting costs on oviposition accuracy. One presumed generalist strategy to diminish information overload is the acquisition of a focused search during its lifetime based on experiences within the current environment, a strategy opposed to a more genetically determined focus expected to be seen in relative specialists. We hypothesized that a broader host range is positively correlated with mushroom body (MB) plasticity, a brain structure related to learning and memory. To test this hypothesis, butterflies with diverging host ranges (Polygonia c-album, Aglais io and Aglais urticae) were subjected to differential environmental complexities for oviposition, after which ontogenetic MB calyx volume differences were compared among species. We found that the relative generalist species exhibited remarkable plasticity in ontogenetic MB volumes; MB growth was differentially stimulated based on the complexity of the experienced environment. For relative specialists, MB volume was more canalized. All in all, this study strongly suggests an impact of host range on brain plasticity in Nymphalid butterflies. PMID:29093221

An adaptive optics search for young extrasolar planets

NASA Astrophysics Data System (ADS)

Macintosh, B.; Zuckerman, B.; Becklin, E. E.; Kaisler, D.; Lowrance, P.; Max, C. E.; Olivier, S.

2000-10-01

In the past five years, many extrasolar planets have been detected indirectly, through radial velocity variations induced in their parent stars. Advances in technology now open up the possibility of directly detecting extrasolar planets through the photons they emit. Direct detection would allow determination of the temperature, radius, and composition of a planet, particularly one in a wide orbit - an important complement to radial velocity techniques. Seeing a planet against the halo of scattered light from its parent star is extremely challenging, but adaptive optics (AO) on 8-10 m telescopes can make this possible. The first such large-telescope AO system is now operational on the 10-m W.M. Keck II telescope. Its current performance is sufficient to detect objects at contrast ratios of 105 at separations of 1" and 106 at 2". This is insufficient to detect the reflected light from a mature Jupiter-like planet, but we can easily detect the near-infrared thermal emission from young (<10-50 MYr) planets, or older brown dwarfs. We are carrying out a search for such planetary companions to young nearby stars, including the TW Hydrae association. We present preliminary results from this survey, including sensitivity limits and follow-up of candidate companions originally detected by NICMOS. We have also imaged the Epsilon Eridani system, and present upper limits on the brightness of the planet detected via radial velocity variations by Cochran et al. This research was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract W-7405-ENG-48, and also supported in part by the Center for Adaptive Optics under the STC Program of the National Science Foundation under Agreement No. AST-9876783

Ion-optical studies for a range adaptation method in ion beam therapy using a static wedge degrader combined with magnetic beam deflection.

PubMed

Chaudhri, Naved; Saito, Nami; Bert, Christoph; Franczak, Bernhard; Steidl, Peter; Durante, Marco; Rietzel, Eike; Schardt, Dieter

2010-06-21

Fast radiological range adaptation of the ion beam is essential when target motion is mitigated by beam tracking using scanned ion beams for dose delivery. Electromagnetically controlled deflection of a well-focused ion beam on a small static wedge degrader positioned between two dipole magnets, inside the beam delivery system, has been considered as a fast range adaptation method. The principle of the range adaptation method was tested in experiments and Monte Carlo simulations for the therapy beam line at the GSI Helmholtz Centre for Heavy Ions Research. Based on the simulations, ion optical settings of beam deflection and realignment of the adapted beam were experimentally applied to the beam line, and additional tuning was manually performed. Different degrader shapes were employed for the energy adaptation. Measured and simulated beam profiles, i.e. lateral distribution and range in water at isocentre, were analysed and compared with the therapy beam values for beam scanning. Deflected beam positions of up to +/-28 mm on degrader were performed which resulted in a range adaptation of up to +/-15 mm water equivalence (WE). The maximum deviation between the measured adapted range from the nominal range adaptation was below 0.4 mm WE. In experiments, the width of the adapted beam at the isocentre was adjustable between 5 and 11 mm full width at half maximum. The results demonstrate the feasibility/proof of the proposed range adaptation method for beam tracking from the beam quality point of view.

Guided Text Search Using Adaptive Visual Analytics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Steed, Chad A; Symons, Christopher T; Senter, James K

This research demonstrates the promise of augmenting interactive visualizations with semi- supervised machine learning techniques to improve the discovery of significant associations and insights in the search and analysis of textual information. More specifically, we have developed a system called Gryffin that hosts a unique collection of techniques that facilitate individualized investigative search pertaining to an ever-changing set of analytical questions over an indexed collection of open-source documents related to critical national infrastructure. The Gryffin client hosts dynamic displays of the search results via focus+context record listings, temporal timelines, term-frequency views, and multiple coordinate views. Furthermore, as the analyst interactsmore » with the display, the interactions are recorded and used to label the search records. These labeled records are then used to drive semi-supervised machine learning algorithms that re-rank the unlabeled search records such that potentially relevant records are moved to the top of the record listing. Gryffin is described in the context of the daily tasks encountered at the US Department of Homeland Security s Fusion Center, with whom we are collaborating in its development. The resulting system is capable of addressing the analysts information overload that can be directly attributed to the deluge of information that must be addressed in the search and investigative analysis of textual information.« less

Dominant-limb range-of-motion and humeral-retrotorsion adaptation in collegiate baseball and softball position players.

PubMed

Hibberd, Elizabeth E; Oyama, Sakiko; Tatman, Justin; Myers, Joseph B

2014-01-01

Biomechanically, the motions used by baseball and softball pitchers differ greatly; however, the throwing motions of position players in both sports are strikingly similar. Although the adaptations to the dominant limb from overhead throwing have been well documented in baseball athletes, these adaptations have not been clearly identified in softball players. This information is important in order to develop and implement injury-prevention programs specific to decreasing the risk of upper extremity injury in softball athletes. To compare range-of-motion and humeral-retrotorsion characteristics of collegiate baseball and softball position players and of baseball and softball players to sex-matched controls. Cross-sectional study. Research laboratories and athletic training rooms at the University of North Carolina at Chapel Hill. Fifty-three collegiate baseball players, 35 collegiate softball players, 25 male controls (nonoverhead athletes), and 19 female controls (nonoverhead athletes). Range of motion and humeral retrotorsion were measured using a digital inclinometer and diagnostic ultrasound. Glenohumeral internal-rotation deficit, external-rotation gain, total glenohumeral range of motion, and humeral retrotorsion. Baseball players had greater glenohumeral internal-rotation deficit, total-range-of-motion, and humeral-retrotorsion difference than softball players and male controls. There were no differences between glenohumeral internal-rotation deficit, total-range-of-motion, and humeral-retrotorsion difference in softball players and female controls. Few differences were evident between softball players and female control participants, although range-of-motion and humeral-retrotorsion adaptations were significantly different than baseball players. The throwing motions are similar between softball and baseball, but the athletes adapt to the demands of the sport differently; thus, stretching/strengthening programs designed for baseball may not be the most

Discovering weighted patterns in intron sequences using self-adaptive harmony search and back-propagation algorithms.

PubMed

Huang, Yin-Fu; Wang, Chia-Ming; Liou, Sing-Wu

2013-01-01

A hybrid self-adaptive harmony search and back-propagation mining system was proposed to discover weighted patterns in human intron sequences. By testing the weights under a lazy nearest neighbor classifier, the numerical results revealed the significance of these weighted patterns. Comparing these weighted patterns with the popular intron consensus model, it is clear that the discovered weighted patterns make originally the ambiguous 5SS and 3SS header patterns more specific and concrete.

A novel adaptive Cuckoo search for optimal query plan generation.

PubMed

Gomathi, Ramalingam; Sharmila, Dhandapani

2014-01-01

The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented.

Communication Range Dynamics and Performance Analysis for a Self-Adaptive Transmission Power Controller †

PubMed Central

Lucas Martínez, Néstor; Martínez Ortega, José-Fernán; Hernández Díaz, Vicente; del Toro Matamoros, Raúl M.

2016-01-01

The deployment of the nodes in a Wireless Sensor and Actuator Network (WSAN) is typically restricted by the sensing and acting coverage. This implies that the locations of the nodes may be, and usually are, not optimal from the point of view of the radio communication. Additionally, when the transmission power is tuned for those locations, there are other unpredictable factors that can cause connectivity failures, like interferences, signal fading due to passing objects and, of course, radio irregularities. A control-based self-adaptive system is a typical solution to improve the energy consumption while keeping good connectivity. In this paper, we explore how the communication range for each node evolves along the iterations of an energy saving self-adaptive transmission power controller when using different parameter sets in an outdoor scenario, providing a WSAN that automatically adapts to surrounding changes keeping good connectivity. The results obtained in this paper show how the parameters with the best performance keep a k-connected network, where k is in the range of the desired node degree plus or minus a specified tolerance value. PMID:27187397

Dominant-Limb Range-of-Motion and Humeral-Retrotorsion Adaptation in Collegiate Baseball and Softball Position Players

PubMed Central

Hibberd, Elizabeth E.; Oyama, Sakiko; Tatman, Justin; Myers, Joseph B.

2014-01-01

Context: Biomechanically, the motions used by baseball and softball pitchers differ greatly; however, the throwing motions of position players in both sports are strikingly similar. Although the adaptations to the dominant limb from overhead throwing have been well documented in baseball athletes, these adaptations have not been clearly identified in softball players. This information is important in order to develop and implement injury-prevention programs specific to decreasing the risk of upper extremity injury in softball athletes. Objective: To compare range-of-motion and humeral-retrotorsion characteristics of collegiate baseball and softball position players and of baseball and softball players to sex-matched controls. Design: Cross-sectional study. Setting: Research laboratories and athletic training rooms at the University of North Carolina at Chapel Hill. Patients or Other Participants: Fifty-three collegiate baseball players, 35 collegiate softball players, 25 male controls (nonoverhead athletes), and 19 female controls (nonoverhead athletes). Intervention(s): Range of motion and humeral retrotorsion were measured using a digital inclinometer and diagnostic ultrasound. Main Outcome Measure(s): Glenohumeral internal-rotation deficit, external-rotation gain, total glenohumeral range of motion, and humeral retrotorsion. Results: Baseball players had greater glenohumeral internal-rotation deficit, total–range-of-motion, and humeral-retrotorsion difference than softball players and male controls. There were no differences between glenohumeral internal-rotation deficit, total–range-of-motion, and humeral-retrotorsion difference in softball players and female controls. Conclusions: Few differences were evident between softball players and female control participants, although range-of-motion and humeral-retrotorsion adaptations were significantly different than baseball players. The throwing motions are similar between softball and baseball, but the

Discovering Weighted Patterns in Intron Sequences Using Self-Adaptive Harmony Search and Back-Propagation Algorithms

PubMed Central

Wang, Chia-Ming; Liou, Sing-Wu

2013-01-01

A hybrid self-adaptive harmony search and back-propagation mining system was proposed to discover weighted patterns in human intron sequences. By testing the weights under a lazy nearest neighbor classifier, the numerical results revealed the significance of these weighted patterns. Comparing these weighted patterns with the popular intron consensus model, it is clear that the discovered weighted patterns make originally the ambiguous 5SS and 3SS header patterns more specific and concrete. PMID:23737711

Real-Time Adaptive Control of a Magnetic Levitation System with a Large Range of Load Disturbance.

PubMed

Zhang, Zhizhou; Li, Xiaolong

2018-05-11

In an idle light-load or a full-load condition, the change of the load mass of a suspension system is very significant. If the control parameters of conventional control methods remain unchanged, the suspension performance of the control system deteriorates rapidly or even loses stability when the load mass changes in a large range. In this paper, a real-time adaptive control method for a magnetic levitation system with large range of mass changes is proposed. First, the suspension control system model of the maglev train is built up, and the stability of the closed-loop system is analyzed. Then, a fast inner current-loop is used to simplify the design of the suspension control system, and an adaptive control method is put forward to ensure that the system is still in a stable state when the load mass varies in a wide range. Simulations and experiments show that when the load mass of the maglev system varies greatly, the adaptive control method is effective to suspend the system stably with a given displacement.

Real-Time Adaptive Control of a Magnetic Levitation System with a Large Range of Load Disturbance

PubMed Central

Zhang, Zhizhou; Li, Xiaolong

2018-01-01

In an idle light-load or a full-load condition, the change of the load mass of a suspension system is very significant. If the control parameters of conventional control methods remain unchanged, the suspension performance of the control system deteriorates rapidly or even loses stability when the load mass changes in a large range. In this paper, a real-time adaptive control method for a magnetic levitation system with large range of mass changes is proposed. First, the suspension control system model of the maglev train is built up, and the stability of the closed-loop system is analyzed. Then, a fast inner current-loop is used to simplify the design of the suspension control system, and an adaptive control method is put forward to ensure that the system is still in a stable state when the load mass varies in a wide range. Simulations and experiments show that when the load mass of the maglev system varies greatly, the adaptive control method is effective to suspend the system stably with a given displacement. PMID:29751610

Search for exotic short-range interactions using paramagnetic insulators

DOE PAGES

Chu, Pinghan; Weisman, E.; Liu, C. -Y.; ...

2015-05-26

We describe a proposed experimental search for exotic spin-coupled interactions using a solid-state paramagnetic insulator. The experiment is sensitive to the net magnetization induced by the exotic interaction between the unpaired insulator electrons with a dense, nonmagnetic mass in close proximity. An existing experiment has been used to set limits on the electric dipole moment of the electron by probing the magnetization induced in a cryogenic gadolinium gallium garnet sample on application of a strong electric field. With suitable additions, including a movable source mass, this experiment can be used to explore “monopole-dipole” forces on polarized electrons with unique ormore » unprecedented sensitivity. As a result, the solid-state, nonmagnetic construction, combined with the low-noise conditions and extremely sensitive magnetometry available at cryogenic temperatures could lead to a sensitivity over 10 orders of magnitude greater than exiting limits in the range below 1 mm.« less

EEG/ERP adaptive noise canceller design with controlled search space (CSS) approach in cuckoo and other optimization algorithms.

PubMed

Ahirwal, M K; Kumar, Anil; Singh, G K

2013-01-01

This paper explores the migration of adaptive filtering with swarm intelligence/evolutionary techniques employed in the field of electroencephalogram/event-related potential noise cancellation or extraction. A new approach is proposed in the form of controlled search space to stabilize the randomness of swarm intelligence techniques especially for the EEG signal. Swarm-based algorithms such as Particles Swarm Optimization, Artificial Bee Colony, and Cuckoo Optimization Algorithm with their variants are implemented to design optimized adaptive noise canceler. The proposed controlled search space technique is tested on each of the swarm intelligence techniques and is found to be more accurate and powerful. Adaptive noise canceler with traditional algorithms such as least-mean-square, normalized least-mean-square, and recursive least-mean-square algorithms are also implemented to compare the results. ERP signals such as simulated visual evoked potential, real visual evoked potential, and real sensorimotor evoked potential are used, due to their physiological importance in various EEG studies. Average computational time and shape measures of evolutionary techniques are observed 8.21E-01 sec and 1.73E-01, respectively. Though, traditional algorithms take negligible time consumption, but are unable to offer good shape preservation of ERP, noticed as average computational time and shape measure difference, 1.41E-02 sec and 2.60E+00, respectively.

Adaptive Optics Photometry and Astrometry of Binary Stars. III. A Faint Companion Search of O-Star Systems

DTIC Science & Technology

2008-08-01

Mason et al. (1998) survey. 3.3. 2MASS Data Mining Confirmations Searches were made for Two Micron All Sky Survey ( 2MASS ) (Cutri et al. 2003...the separation/m limits of 2MASS , the point-source catalog was searched for sources in the magnitude range 5.5 J 8.0, corresponding to the...approximate 2MASS J -magnitude range for the AO targets in this project. This yielded 99,656 sources. All sources within 10′′ of these “primaries” were then

Standardization of Keyword Search Mode

ERIC Educational Resources Information Center

Su, Di

2010-01-01

In spite of its popularity, keyword search mode has not been standardized. Though information professionals are quick to adapt to various presentations of keyword search mode, novice end-users may find keyword search confusing. This article compares keyword search mode in some major reference databases and calls for standardization. (Contains 3…

Scaling laws of marine predator search behaviour.

PubMed

Sims, David W; Southall, Emily J; Humphries, Nicolas E; Hays, Graeme C; Bradshaw, Corey J A; Pitchford, Jonathan W; James, Alex; Ahmed, Mohammed Z; Brierley, Andrew S; Hindell, Mark A; Morritt, David; Musyl, Michael K; Righton, David; Shepard, Emily L C; Wearmouth, Victoria J; Wilson, Rory P; Witt, Matthew J; Metcalfe, Julian D

2008-02-28

Many free-ranging predators have to make foraging decisions with little, if any, knowledge of present resource distribution and availability. The optimal search strategy they should use to maximize encounter rates with prey in heterogeneous natural environments remains a largely unresolved issue in ecology. Lévy walks are specialized random walks giving rise to fractal movement trajectories that may represent an optimal solution for searching complex landscapes. However, the adaptive significance of this putative strategy in response to natural prey distributions remains untested. Here we analyse over a million movement displacements recorded from animal-attached electronic tags to show that diverse marine predators-sharks, bony fishes, sea turtles and penguins-exhibit Lévy-walk-like behaviour close to a theoretical optimum. Prey density distributions also display Lévy-like fractal patterns, suggesting response movements by predators to prey distributions. Simulations show that predators have higher encounter rates when adopting Lévy-type foraging in natural-like prey fields compared with purely random landscapes. This is consistent with the hypothesis that observed search patterns are adapted to observed statistical patterns of the landscape. This may explain why Lévy-like behaviour seems to be widespread among diverse organisms, from microbes to humans, as a 'rule' that evolved in response to patchy resource distributions.

Mutually beneficial relationship in optimization between search-space smoothing and stochastic search

NASA Astrophysics Data System (ADS)

Hasegawa, Manabu; Hiramatsu, Kotaro

2013-10-01

The effectiveness of the Metropolis algorithm (MA) (constant-temperature simulated annealing) in optimization by the method of search-space smoothing (SSS) (potential smoothing) is studied on two types of random traveling salesman problems. The optimization mechanism of this hybrid approach (MASSS) is investigated by analyzing the exploration dynamics observed in the rugged landscape of the cost function (energy surface). The results show that the MA can be successfully utilized as a local search algorithm in the SSS approach. It is also clarified that the optimization characteristics of these two constituent methods are improved in a mutually beneficial manner in the MASSS run. Specifically, the relaxation dynamics generated by employing the MA work effectively even in a smoothed landscape and more advantage is taken of the guiding function proposed in the idea of SSS; this mechanism operates in an adaptive manner in the de-smoothing process and therefore the MASSS method maintains its optimization function over a wider temperature range than the MA.

Race, self-selection, and the job search process.

PubMed

Pager, Devah; Pedulla, David S

2015-01-01

While existing research has documented persistent barriers facing African-American job seekers, far less research has questioned how job seekers respond to this reality. Do minorities self-select into particular segments of the labor market to avoid discrimination? Such questions have remained unanswered due to the lack of data available on the positions to which job seekers apply. Drawing on two original data sets with application-specific information, we find little evidence that blacks target or avoid particular job types. Rather, blacks cast a wider net in their search than similarly situated whites, including a greater range of occupational categories and characteristics in their pool of job applications. Additionally, we show that perceptions of discrimination are associated with increased search breadth, suggesting that broad search among African-Americans represents an adaptation to labor market discrimination. Together these findings provide novel evidence on the role of race and self-selection in the job search process.

SNP discovery in candidate adaptive genes using exon capture in a free-ranging alpine ungulate

USGS Publications Warehouse

Roffler, Gretchen H.; Amish, Stephen J.; Smith, Seth; Cosart, Ted F.; Kardos, Marty; Schwartz, Michael K.; Luikart, Gordon

2016-01-01

Identification of genes underlying genomic signatures of natural selection is key to understanding adaptation to local conditions. We used targeted resequencing to identify SNP markers in 5321 candidate adaptive genes associated with known immunological, metabolic and growth functions in ovids and other ungulates. We selectively targeted 8161 exons in protein-coding and nearby 5′ and 3′ untranslated regions of chosen candidate genes. Targeted sequences were taken from bighorn sheep (Ovis canadensis) exon capture data and directly from the domestic sheep genome (Ovis aries v. 3; oviAri3). The bighorn sheep sequences used in the Dall's sheep (Ovis dalli dalli) exon capture aligned to 2350 genes on the oviAri3 genome with an average of 2 exons each. We developed a microfluidic qPCR-based SNP chip to genotype 476 Dall's sheep from locations across their range and test for patterns of selection. Using multiple corroborating approaches (lositan and bayescan), we detected 28 SNP loci potentially under selection. We additionally identified candidate loci significantly associated with latitude, longitude, precipitation and temperature, suggesting local environmental adaptation. The three methods demonstrated consistent support for natural selection on nine genes with immune and disease-regulating functions (e.g. Ovar-DRA, APC, BATF2, MAGEB18), cell regulation signalling pathways (e.g. KRIT1, PI3K, ORRC3), and respiratory health (CYSLTR1). Characterizing adaptive allele distributions from novel genetic techniques will facilitate investigation of the influence of environmental variation on local adaptation of a northern alpine ungulate throughout its range. This research demonstrated the utility of exon capture for gene-targeted SNP discovery and subsequent SNP chip genotyping using low-quality samples in a nonmodel species.

Dark photon search in the mass range between 1.5 and 3.4 GeV/c2

NASA Astrophysics Data System (ADS)

Ablikim, M.; Achasov, M. N.; Ai, X. C.; Albayrak, O.; Albrecht, M.; Ambrose, D. J.; Amoroso, A.; An, F. F.; An, Q.; Bai, J. Z.; Baldini Ferroli, R.; Ban, Y.; Bennett, D. W.; Bennett, J. V.; Bertani, M.; Bettoni, D.; Bian, J. M.; Bianchi, F.; Boger, E.; Boyko, I.; Briere, R. A.; Cai, H.; Cai, X.; Cakir, O.; Calcaterra, A.; Cao, G. F.; Cetin, S. A.; Chang, J. F.; Chelkov, G.; Chen, G.; Chen, H. S.; Chen, H. Y.; Chen, J. C.; Chen, M. L.; Chen, S. J.; Chen, X.; Chen, X. R.; Chen, Y. B.; Cheng, H. P.; Chu, X. K.; Cibinetto, G.; Dai, H. L.; Dai, J. P.; Dbeyssi, A.; Dedovich, D.; Deng, Z. Y.; Denig, A.; Denysenko, I.; Destefanis, M.; de Mori, F.; Ding, Y.; Dong, C.; Dong, J.; Dong, L. Y.; Dong, M. Y.; Du, S. X.; Duan, P. F.; Eren, E. E.; Fan, J. Z.; Fang, J.; Fang, S. S.; Fang, X.; Fang, Y.; Fava, L.; Feldbauer, F.; Felici, G.; Feng, C. Q.; Fioravanti, E.; Fritsch, M.; Fu, C. D.; Gao, Q.; Gao, X. Y.; Gao, Y.; Gao, Z.; Garzia, I.; Geng, C.; Goetzen, K.; Gong, W. X.; Gradl, W.; Greco, M.; Gu, M. H.; Gu, Y. T.; Guan, Y. H.; Guo, A. Q.; Guo, L. B.; Guo, Y.; Guo, Y. P.; Haddadi, Z.; Hafner, A.; Han, S.; Han, Y. L.; Hao, X. Q.; Harris, F. A.; He, K. L.; He, Z. Y.; Held, T.; Heng, Y. K.; Hou, Z. L.; Hu, C.; Hu, H. M.; Hu, J. F.; Hu, T.; Hu, Y.; Huang, G. M.; Huang, G. S.; Huang, H. P.; Huang, J. S.; Huang, X. T.; Huang, Y.; Hussain, T.; Ji, Q.; Ji, Q. P.; Ji, X. B.; Ji, X. L.; Jiang, L. L.; Jiang, L. W.; Jiang, X. S.; Jiang, X. Y.; Jiao, J. B.; Jiao, Z.; Jin, D. P.; Jin, S.; Johansson, T.; Julin, A.; Kalantar-Nayestanaki, N.; Kang, X. L.; Kang, X. S.; Kavatsyuk, M.; Ke, B. C.; Kiese, P.; Kliemt, R.; Kloss, B.; Kolcu, O. B.; Kopf, B.; Kornicer, M.; Kuehn, W.; Kupsc, A.; Lange, J. S.; Lara, M.; Larin, P.; Leng, C.; Li, C.; Li, C. H.; Li, Cheng; Li, D. M.; Li, F.; Li, G.; Li, H. B.; Li, J. C.; Li, Jin; Li, K.; Li, K.; Li, Lei; Li, P. R.; Li, T.; Li, W. D.; Li, W. G.; Li, X. L.; Li, X. M.; Li, X. N.; Li, X. Q.; Li, Z. B.; Liang, H.; Liang, Y. F.; Liang, Y. T.; Liao, G. R.; Lin, D. X.; Liu, B. J.; Liu, C. X.; Liu, F. H.; Liu, Fang; Liu, Feng; Liu, H. B.; Liu, H. H.; Liu, H. H.; Liu, H. M.; Liu, J.; Liu, J. B.; Liu, J. P.; Liu, J. Y.; Liu, K.; Liu, K. Y.; Liu, L. D.; Liu, P. L.; Liu, Q.; Liu, S. B.; Liu, X.; Liu, X. X.; Liu, Y. B.; Liu, Z. A.; Liu, Zhiqiang; Liu, Zhiqing; Loehner, H.; Lou, X. C.; Lu, H. J.; Lu, J. G.; Lu, R. Q.; Lu, Y.; Lu, Y. P.; Luo, C. L.; Luo, M. X.; Luo, T.; Luo, X. L.; Lv, M.; Lyu, X. R.; Ma, F. C.; Ma, H. L.; Ma, L. L.; Ma, Q. M.; Ma, T.; Ma, X. N.; Ma, X. Y.; Maas, F. E.; Maggiora, M.; Mao, Y. J.; Mao, Z. P.; Marcello, S.; Messchendorp, J. G.; Min, J.; Min, T. J.; Mitchell, R. E.; Mo, X. H.; Mo, Y. J.; Morales Morales, C.; Moriya, K.; Muchnoi, N. Yu.; Muramatsu, H.; Nefedov, Y.; Nerling, F.; Nikolaev, I. B.; Ning, Z.; Nisar, S.; Niu, S. L.; Niu, X. Y.; Olsen, S. L.; Ouyang, Q.; Pacetti, S.; Patteri, P.; Pelizaeus, M.; Peng, H. P.; Peters, K.; Pettersson, J.; Ping, J. L.; Ping, R. G.; Poling, R.; Prasad, V.; Pu, Y. N.; Qi, M.; Qian, S.; Qiao, C. F.; Qin, L. Q.; Qin, N.; Qin, X. S.; Qin, Y.; Qin, Z. H.; Qiu, J. F.; Rashid, K. H.; Redmer, C. F.; Ren, H. L.; Ripka, M.; Rong, G.; Rosner, Ch.; Ruan, X. D.; Santoro, V.; Sarantsev, A.; Savrié, M.; Schoenning, K.; Schumann, S.; Shan, W.; Shao, M.; Shen, C. P.; Shen, P. X.; Shen, X. Y.; Sheng, H. Y.; Song, W. M.; Song, X. Y.; Sosio, S.; Spataro, S.; Sun, G. X.; Sun, J. F.; Sun, S. S.; Sun, Y. J.; Sun, Y. Z.; Sun, Z. J.; Sun, Z. T.; Tang, C. J.; Tang, X.; Tapan, I.; Thorndike, E. H.; Tiemens, M.; Ullrich, M.; Uman, I.; Varner, G. S.; Wang, B.; Wang, B. L.; Wang, D.; Wang, D. Y.; Wang, K.; Wang, L. L.; Wang, L. S.; Wang, M.; Wang, P.; Wang, P. L.; Wang, S. G.; Wang, W.; Wang, X. F.; Wang, Y. D.; Wang, Y. F.; Wang, Y. Q.; Wang, Z.; Wang, Z. G.; Wang, Z. H.; Wang, Z. Y.; Weber, T.; Wei, D. H.; Wei, J. B.; Weidenkaff, P.; Wen, S. P.; Wiedner, U.; Wolke, M.; Wu, L. H.; Wu, Z.; Xia, L. G.; Xia, Y.; Xiao, D.; Xiao, H.; Xiao, Z. J.; Xie, Y. G.; Xiu, Q. L.; Xu, G. F.; Xu, L.; Xu, Q. J.; Xu, Q. N.; Xu, X. P.; Yan, L.; Yan, W. B.; Yan, W. C.; Yan, Y. H.; Yang, H. J.; Yang, H. X.; Yang, L.; Yang, Y.; Yang, Y. X.; Ye, H.; Ye, M.; Ye, M. H.; Yin, J. H.; Yu, B. X.; Yu, C. X.; Yu, H. W.; Yu, J. S.; Yuan, C. Z.; Yuan, W. L.; Yuan, Y.; Yuncu, A.; Zafar, A. A.; Zallo, A.; Zeng, Y.; Zhang, B. X.; Zhang, B. Y.; Zhang, C.; Zhang, C. C.; Zhang, D. H.; Zhang, H. H.; Zhang, H. Y.; Zhang, J. J.; Zhang, J. L.; Zhang, J. Q.; Zhang, J. W.; Zhang, J. Y.; Zhang, J. Z.; Zhang, K.; Zhang, L.; Zhang, S. H.; Zhang, X. Y.; Zhang, Y.; Zhang, Y. N.; Zhang, Y. H.; Zhang, Y. T.; Zhang, Yu; Zhang, Z. H.; Zhang, Z. P.; Zhang, Z. Y.; Zhao, G.; Zhao, J. W.; Zhao, J. Y.; Zhao, J. Z.; Zhao, Lei; Zhao, Ling; Zhao, M. G.; Zhao, Q.; Zhao, Q. W.; Zhao, S. J.; Zhao, T. C.; Zhao, Y. B.; Zhao, Z. G.; Zhemchugov, A.; Zheng, B.; Zheng, J. P.; Zheng, W. J.; Zheng, Y. H.; Zhong, B.; Zhou, L.; Zhou, Li; Zhou, X.; Zhou, X. K.; Zhou, X. R.; Zhou, X. Y.; Zhu, K.; Zhu, K. J.; Zhu, S.; Zhu, X. L.; Zhu, Y. C.; Zhu, Y. S.; Zhu, Z. A.; Zhuang, J.; Zotti, L.; Zou, B. S.; Zou, J. H.; Besiii Collaboration

2017-11-01

Using a data set of 2.93 fb-1 taken at a center-of-mass energy √{ s} = 3.773 GeV with the BESIII detector at the BEPCII collider, we perform a search for an extra U(1) gauge boson, also denoted as a dark photon. We examine the initial state radiation reactions e+e- →e+e-γISR and e+e- →μ+μ-γISR for this search, where the dark photon would appear as an enhancement in the invariant mass distribution of the leptonic pairs. We observe no obvious enhancement in the mass range between 1.5 and 3.4 GeV/c2 and set a 90% confidence level upper limit on the mixing strength of the dark photon and the Standard Model photon. We obtain a competitive limit in the tested mass range.

The Limitation of Species Range: A Consequence of Searching Along Resource Gradients

PubMed Central

Rowell, Jonathan T.

2009-01-01

Ecological modelers have long puzzled over the spatial distribution of species. The random walk or diffusive approach to dispersal has yielded important results for biology and mathematics, yet it has been inadequate in explaining all phenomenological features. Ranges can terminate non-smoothly absent a complementary shift in the characteristics of the environment. Also unexplained is the absence of a species from nearby areas of adequate, or even abundant, resources. In this paper, I show how local searching behavior - keyed to a density-dependent fitness - can limit the speed and extent of a species’ spread. In contrast to standard diffusive processes, pseudo-rational movement facilitates the clustering of populations. It also can be used to estimate the speed of an expanding population range, explain expansion stall, and provides a mechanism by which a population can colonize seemingly removed regions - biogeographic islands in a continental framework. Finally, I discuss the effect of resource degradation and different resource impact/utilization curves on the model. PMID:19303032

Adaptive Alterations in Shoulder Range of Motion and Strength in Young Tennis Players

PubMed Central

Gillet, Benoit; Begon, Mickaël; Sevrez, Violaine; Berger-Vachon, Christian; Rogowski, Isabelle

2017-01-01

Context: Playing tennis requires unilateral and intensive movement of the upper limb, which may lead to functional adaptations of the shoulder and an increased injury risk. Identifying which athletes will be future elite tennis players starts at 5 to 6 years of age. Therefore, highly skilled players practice intensively in their childhood. However, whether these functional changes occur during the prepubertal years has not been established. Objectives: To assess changes in glenohumeral-joint–rotation range of motion and strength of the shoulder-complex muscles in prepubertal elite tennis players. Design: Cross-sectional study. Setting: Tennis training sports facilities. Patients or Other Participants: Sixty-seven male tennis players (age range = 7–13 years) selected by a regional tennis center of excellence were divided into 3 biological age groups relative to their predicted age at peak height velocity: greater than 4 (n = 26; age = 8.7 ± 0.7 years, height = 132.4 ± 12.9 cm, mass = 27.8 ± 3.8 kg), 3 to 4 (n = 21; age = 10.3 ± 0.6 years, height = 144.9 ± 5.7 cm, mass = 34.7 ± 4.0 kg), and 2 (n = 20; age = 12.8 ± 1.4 years, height = 158.5 ± 8.7 cm, mass = 43.0 ± 8.2 kg) years before their age at peak height velocity. Main Outcome Measures(s): We measured the internal- and external-rotation ranges of motion of the glenohumeral joint using a goniometer and calculated the total arc of motion. Maximal isometric strength of 8 shoulder muscles was measured using a handheld dynamometer. Strength values were normalized to body weight and used to calculate 4 agonist-to-antagonist strength ratios. Results: The total arc of motion of the glenohumeral joint decreased gradually with biological age (P ≤ .01) due to the decrease in internal-rotation range of motion (P < .001). Absolute strength increased gradually with biological age (P < .001), but the relative strengths and ratios remained similar. Conclusions: Functional adaptations of the shoulder seen in

Performance of Point and Range Queries for In-memory Databases using Radix Trees on GPUs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alam, Maksudul; Yoginath, Srikanth B; Perumalla, Kalyan S

In in-memory database systems augmented by hardware accelerators, accelerating the index searching operations can greatly increase the runtime performance of database queries. Recently, adaptive radix trees (ART) have been shown to provide very fast index search implementation on the CPU. Here, we focus on an accelerator-based implementation of ART. We present a detailed performance study of our GPU-based adaptive radix tree (GRT) implementation over a variety of key distributions, synthetic benchmarks, and actual keys from music and book data sets. The performance is also compared with other index-searching schemes on the GPU. GRT on modern GPUs achieves some of themore » highest rates of index searches reported in the literature. For point queries, a throughput of up to 106 million and 130 million lookups per second is achieved for sparse and dense keys, respectively. For range queries, GRT yields 600 million and 1000 million lookups per second for sparse and dense keys, respectively, on a large dataset of 64 million 32-bit keys.« less

Evaluation of dynamically dimensioned search algorithm for optimizing SWAT by altering sampling distributions and searching range

USDA-ARS?s Scientific Manuscript database

The primary advantage of Dynamically Dimensioned Search algorithm (DDS) is that it outperforms many other optimization techniques in both convergence speed and the ability in searching for parameter sets that satisfy statistical guidelines while requiring only one algorithm parameter (perturbation f...

Signatures of polygenic adaptation associated with climate across the range of a threatened fish species with high genetic connectivity.

PubMed

Harrisson, Katherine A; Amish, Stephen J; Pavlova, Alexandra; Narum, Shawn R; Telonis-Scott, Marina; Rourke, Meaghan L; Lyon, Jarod; Tonkin, Zeb; Gilligan, Dean M; Ingram, Brett A; Lintermans, Mark; Gan, Han Ming; Austin, Christopher M; Luikart, Gordon; Sunnucks, Paul

2017-11-01

Adaptive differences across species' ranges can have important implications for population persistence and conservation management decisions. Despite advances in genomic technologies, detecting adaptive variation in natural populations remains challenging. Key challenges in gene-environment association studies involve distinguishing the effects of drift from those of selection and identifying subtle signatures of polygenic adaptation. We used paired-end restriction site-associated DNA sequencing data (6,605 biallelic single nucleotide polymorphisms; SNPs) to examine population structure and test for signatures of adaptation across the geographic range of an iconic Australian endemic freshwater fish species, the Murray cod Maccullochella peelii. Two univariate gene-association methods identified 61 genomic regions associated with climate variation. We also tested for subtle signatures of polygenic adaptation using a multivariate method (redundancy analysis; RDA). The RDA analysis suggested that climate (temperature- and precipitation-related variables) and geography had similar magnitudes of effect in shaping the distribution of SNP genotypes across the sampled range of Murray cod. Although there was poor agreement among the candidate SNPs identified by the univariate methods, the top 5% of SNPs contributing to significant RDA axes included 67% of the SNPs identified by univariate methods. We discuss the potential implications of our findings for the management of Murray cod and other species generally, particularly in relation to informing conservation actions such as translocations to improve evolutionary resilience of natural populations. Our results highlight the value of using a combination of different approaches, including polygenic methods, when testing for signatures of adaptation in landscape genomic studies. © 2017 John Wiley & Sons Ltd.

Race, Self-Selection, and the Job Search Process1

PubMed Central

Pager, Devah; Pedulla, David S.

2015-01-01

While existing research has documented persistent barriers facing African American job seekers, far less research has questioned how job seekers respond to this reality. Do minorities self-select into particular segments of the labor market to avoid discrimination? Such questions have remained unanswered due to the lack of data available on the positions to which job seekers apply. Drawing on two original datasets with application-specific information, we find little evidence that blacks target or avoid particular job types. Rather, blacks cast a wider net in their search than similarly situated whites, including a greater range of occupational categories and characteristics in their pool of job applications. Finally, we show that perceptions of discrimination are associated with increased search breadth, suggesting that broad search among African Americans represents an adaptation to labor market discrimination. Together these findings provide novel evidence on the role of race and self-selection in the job search process. PMID:26046224

Design for an Adaptive Library Catalog.

ERIC Educational Resources Information Center

Buckland, Michael K.; And Others

1992-01-01

Describes OASIS, a prototype adaptive online catalog implemented as a front end to the University of California MELVYL catalog. Topics addressed include the concept of adaptive retrieval systems, strategic search commands, feedback, prototyping using a front-end, the problem of excessive retrieval, commands to limit or increase search results, and…

Underwater single beam circumferentially scanning detection system using range-gated receiver and adaptive filter

NASA Astrophysics Data System (ADS)

Tan, Yayun; Zhang, He; Zha, Bingting

2017-09-01

Underwater target detection and ranging in seawater are of interest in unmanned underwater vehicles. This study presents an underwater detection system that synchronously scans a collimated laser beam and a narrow field of view to circumferentially detect an underwater target. Hybrid methods of range-gated and variable step-size least mean squares (VSS-LMS) adaptive filter are proposed to suppress water backscattering. The range-gated receiver eliminates the backscattering of near-field water. The VSS-LMS filter extracts the target echo in the remaining backscattering and the constant fraction discriminator timing method is used to improve ranging accuracy. The optimal constant fraction is selected by analysing the jitter noise and slope of the target echo. The prototype of the underwater detection system is constructed and tested in coastal seawater, then the effectiveness of backscattering suppression and high-ranging accuracy is verified through experimental results and analysis discussed in this paper.

Small Infrared Target Detection by Region-Adaptive Clutter Rejection for Sea-Based Infrared Search and Track

PubMed Central

Kim, Sungho; Lee, Joohyoung

2014-01-01

This paper presents a region-adaptive clutter rejection method for small target detection in sea-based infrared search and track. In the real world, clutter normally generates many false detections that impede the deployment of such detection systems. Incoming targets (missiles, boats, etc.) can be located in the sky, horizon and sea regions, which have different types of clutters, such as clouds, a horizontal line and sea-glint. The characteristics of regional clutter were analyzed after the geometrical analysis-based region segmentation. The false detections caused by cloud clutter were removed by the spatial attribute-based classification. Those by the horizontal line were removed using the heterogeneous background removal filter. False alarms by sun-glint were rejected using the temporal consistency filter, which is the most difficult part. The experimental results of the various cluttered background sequences show that the proposed region adaptive clutter rejection method produces fewer false alarms than that of the mean subtraction filter (MSF) with an acceptable degradation detection rate. PMID:25054633

Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails

PubMed Central

2012-01-01

Background Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing. Results In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms. Conclusions Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications. PMID:23134742

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

PubMed Central

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments. PMID:24701158

An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.

PubMed

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

Classification of adaptive memetic algorithms: a comparative study.

PubMed

Ong, Yew-Soon; Lim, Meng-Hiot; Zhu, Ning; Wong, Kok-Wai

2006-02-01

Adaptation of parameters and operators represents one of the recent most important and promising areas of research in evolutionary computations; it is a form of designing self-configuring algorithms that acclimatize to suit the problem in hand. Here, our interests are on a recent breed of hybrid evolutionary algorithms typically known as adaptive memetic algorithms (MAs). One unique feature of adaptive MAs is the choice of local search methods or memes and recent studies have shown that this choice significantly affects the performances of problem searches. In this paper, we present a classification of memes adaptation in adaptive MAs on the basis of the mechanism used and the level of historical knowledge on the memes employed. Then the asymptotic convergence properties of the adaptive MAs considered are analyzed according to the classification. Subsequently, empirical studies on representatives of adaptive MAs for different type-level meme adaptations using continuous benchmark problems indicate that global-level adaptive MAs exhibit better search performances. Finally we conclude with some promising research directions in the area.

Non-tables look-up search algorithm for efficient H.264/AVC context-based adaptive variable length coding decoding

NASA Astrophysics Data System (ADS)

Han, Yishi; Luo, Zhixiao; Wang, Jianhua; Min, Zhixuan; Qin, Xinyu; Sun, Yunlong

2014-09-01

In general, context-based adaptive variable length coding (CAVLC) decoding in H.264/AVC standard requires frequent access to the unstructured variable length coding tables (VLCTs) and significant memory accesses are consumed. Heavy memory accesses will cause high power consumption and time delays, which are serious problems for applications in portable multimedia devices. We propose a method for high-efficiency CAVLC decoding by using a program instead of all the VLCTs. The decoded codeword from VLCTs can be obtained without any table look-up and memory access. The experimental results show that the proposed algorithm achieves 100% memory access saving and 40% decoding time saving without degrading video quality. Additionally, the proposed algorithm shows a better performance compared with conventional CAVLC decoding, such as table look-up by sequential search, table look-up by binary search, Moon's method, and Kim's method.

Center for Adaptive Optics | Home

Science.gov Websites

Center for Adaptive Optics A University of California Science and Technology Center home Directions to The Center for Adaptive Optics Building Directions to the Center for Adaptive Optics Building * Seaway Inn * West Cliff Inn Last Modified: Apr 3, 2012 Center for Adaptive Optics | Search | The Center

Association between adaptive behaviour and age in adults with Down syndrome without dementia: examining the range and severity of adaptive behaviour problems.

PubMed

Makary, A T; Testa, R; Tonge, B J; Einfeld, S L; Mohr, C; Gray, K M

2015-08-01

Studies on adaptive behaviour and ageing in adults with Down syndrome (DS) (without dementia) have typically analysed age-related change in terms of the total item scores on questionnaires. This research extends the literature by investigating whether the age-related changes in adaptive abilities could be differentially attributed to changes in the number or severity (intensity) of behavioural questionnaire items endorsed. The Adaptive Behaviour Assessment System-II Adult (ABAS-II Adult) was completed by parents and caregivers of 53 adults with DS aged between 16 and 56 years. Twenty adults with DS and their parents/caregivers were a part of a longitudinal study, which provided two time points of data. In addition 33 adults with DS and their parents/caregivers from a cross-sectional study were included. Random effects regression analyses were used to examine the patterns in item scores associated with ageing. Increasing age was found to be significantly associated with lower adaptive behaviour abilities for all the adaptive behaviour composite scores, expect for the practical composite. These associations were entirely related to fewer ABAS-II Adult items being selected as present for the older participants, as opposed to the scores being attributable to lower item severity. This study provides evidence for a differential pattern of age-related change for various adaptive behaviour skills in terms of range, but not severity. Possible reasons for this pattern will be discussed. Overall, these findings suggest that adults with DS may benefit from additional support in terms of their social and conceptual abilities as they age. © 2014 MENCAP and International Association of the Scientific Study of Intellectual and Developmental Disabilities and John Wiley & Sons Ltd.

SearchGUI: A Highly Adaptable Common Interface for Proteomics Search and de Novo Engines.

PubMed

Barsnes, Harald; Vaudel, Marc

2018-05-25

Mass-spectrometry-based proteomics has become the standard approach for identifying and quantifying proteins. A vital step consists of analyzing experimentally generated mass spectra to identify the underlying peptide sequences for later mapping to the originating proteins. We here present the latest developments in SearchGUI, a common open-source interface for the most frequently used freely available proteomics search and de novo engines that has evolved into a central component in numerous bioinformatics workflows.

Adaptive cockroach swarm algorithm

NASA Astrophysics Data System (ADS)

Obagbuwa, Ibidun C.; Abidoye, Ademola P.

2017-07-01

An adaptive cockroach swarm optimization (ACSO) algorithm is proposed in this paper to strengthen the existing cockroach swarm optimization (CSO) algorithm. The ruthless component of CSO algorithm is modified by the employment of blend crossover predator-prey evolution method which helps algorithm prevent any possible population collapse, maintain population diversity and create adaptive search in each iteration. The performance of the proposed algorithm on 16 global optimization benchmark function problems was evaluated and compared with the existing CSO, cuckoo search, differential evolution, particle swarm optimization and artificial bee colony algorithms.

Design of Range Adaptive Wireless Power Transfer System Using Non-coaxial Coils

NASA Astrophysics Data System (ADS)

Yang, Dongsheng; Won, Sokhui; Hong, Huan

2017-05-01

Wireless Power Transfer (WPT) is a remarkable technology because of its convenience and applicability in harsh environment. Particularly, Magnetic Coupling WPT (MC-WPT) is a proper method to midrange power transfer, but the frequency splitting at over-coupling range, which is related with transfer distance, is challenge of transmission efficiency. In order to overcome this phenomenon, recently the range adaptive WPT is proposed. In this paper, we aim to the type with a set of non-coaxial driving coils, so that this may remove the connection wires from PA (Power Amplifier) to driving coil. And, when the radius of driving coil is changed, on the different gaps between driving and TX coils, coupling coefficient between these is computed in both cases of coaxial and non-coaxial configurations. In addition, the designing steps for 4-coil WPT system using non-coaxial coils are described with the example. Finally, the reliability of this topology has been proved and simulated with PSPICE.

Adaptive optics imaging of the retina

PubMed Central

Battu, Rajani; Dabir, Supriya; Khanna, Anjani; Kumar, Anupama Kiran; Roy, Abhijit Sinha

2014-01-01

Adaptive optics is a relatively new tool that is available to ophthalmologists for study of cellular level details. In addition to the axial resolution provided by the spectral-domain optical coherence tomography, adaptive optics provides an excellent lateral resolution, enabling visualization of the photoreceptors, blood vessels and details of the optic nerve head. We attempt a mini review of the current role of adaptive optics in retinal imaging. PubMed search was performed with key words Adaptive optics OR Retina OR Retinal imaging. Conference abstracts were searched from the Association for Research in Vision and Ophthalmology (ARVO) and American Academy of Ophthalmology (AAO) meetings. In total, 261 relevant publications and 389 conference abstracts were identified. PMID:24492503

A proposed search for dark-matter axions in the 0.6-16 micro-eV range

NASA Technical Reports Server (NTRS)

Vanbibber, Karl; Sikivie, P.; Sullivan, N. S.; Tanner, D. B.; Turner, Michael S.; Moltz, D. M.

1991-01-01

A proposed experiment is described to search for dark matter axions in the mass range 0.6 to 16 micro-eV. The method is based on the Primakoff conversion of axions into monochromatic microwave photons inside a tunable microwave cavity in a large volume high field magnet, as described by Sikivie. This proposal capitalizes on the availability of two Axicell magnets from the decommissioned Mirror Fusion Test Facility (MFTF-B) fusion machine at LLNL. Assuming a local dark matter density in axions of rho = 0.3 GeV/cu cm, the axion would be found or ruled out at the 97 pct. c.l. in the above mass range in 48 months.

Speeding Up Chemical Searches Using the Inverted Index: the Convergence of Chemoinformatics and Text Search Methods

PubMed Central

Nasr, Ramzi; Vernica, Rares; Li, Chen; Baldi, Pierre

2012-01-01

In ligand-based screening, retrosynthesis, and other chemoinformatics applications, one of-ten seeks to search large databases of molecules in order to retrieve molecules that are similar to a given query. With the expanding size of molecular databases, the efficiency and scalability of data structures and algorithms for chemical searches are becoming increasingly important. Remarkably, both the chemoinformatics and information retrieval communities have converged on similar solutions whereby molecules or documents are represented by binary vectors, or fingerprints, indexing their substructures such as labeled paths for molecules and n-grams for text, with the same Jaccard-Tanimoto similarity measure. As a result, similarity search methods from one field can be adapted to the other. Here we adapt recent, state-of-the-art, inverted index methods from information retrieval to speed up similarity searches in chemoinformatics. Our results show a several-fold speed-up improvement over previous methods for both thresh-old searches and top-K searches. We also provide a mathematical analysis that allows one to predict the level of pruning achieved by the inverted index approach, and validate the quality of these predictions through simulation experiments. All results can be replicated using data freely downloadable from http://cdb.ics.uci.edu/. PMID:22462644

Effective Dynamic Range and Retest Reliability of Dark-Adapted Two-Color Fundus-Controlled Perimetry in Patients With Macular Diseases.

PubMed

Pfau, Maximilian; Lindner, Moritz; Müller, Philipp L; Birtel, Johannes; Finger, Robert P; Harmening, Wolf M; Fleckenstein, Monika; Holz, Frank G; Schmitz-Valckenberg, Steffen

2017-05-01

To determine the effective dynamic range (EDR), retest reliability, and number of discriminable steps (DS) for mesopic and dark-adapted two-color fundus-controlled perimetry (FCP) using the S-MAIA (Scotopic-Macular Integrity Assessment) "micro-perimeter." In this prospective cross-sectional study, each of the 52 eyes of 52 subjects with various macular diseases (mean age 62.0 ± 16.9 years; range, 19.1-90.1 years) underwent duplicate mesopic (achromatic stimuli, 400-800 nm), dark-adapted cyan (505 nm), and dark-adapted red (627 nm) FCP using a grid of 61 stimuli covering 18° of the central retina. The EDR, the number of DS, and the retest reliability for point-wise sensitivity (PWS) were analyzed. The effects of fixation stability, sensitivity, and age on retest reliability were examined using mixed-effects models. The EDR was 10 to 30 dB with five DS for mesopic and 4 to 17 dB with four DS for dark-adapted cyan and red testing. PWS retest reliability was good among all three types of retinal sensitivity assessments (coefficient of repeatability ±5.79, ±4.72, and ±4.77 dB, respectively) and did not depend on fixation stability or age. PWS had no effect on retest variability in dark-adapted cyan and dark-adapted red testing but had a minor effect in mesopic testing. Combined mesopic and dark-adapted two-color FCP allows for reliable topographic testing of cone and rod function in patients with various macular diseases with and without foveal fixation. Retest reliability is homogeneous across eccentricities and various degrees of scotoma depth, including zones at risk for disease progression. These reliability estimates can serve for the design of future clinical trials.

Both life-history plasticity and local adaptation will shape range-wide responses to climate warming in the tundra plant Silene acaulis.

PubMed

Peterson, Megan L; Doak, Daniel F; Morris, William F

2018-04-01

Many predictions of how climate change will impact biodiversity have focused on range shifts using species-wide climate tolerances, an approach that ignores the demographic mechanisms that enable species to attain broad geographic distributions. But these mechanisms matter, as responses to climate change could fundamentally differ depending on the contributions of life-history plasticity vs. local adaptation to species-wide climate tolerances. In particular, if local adaptation to climate is strong, populations across a species' range-not only those at the trailing range edge-could decline sharply with global climate change. Indeed, faster rates of climate change in many high latitude regions could combine with local adaptation to generate sharper declines well away from trailing edges. Combining 15 years of demographic data from field populations across North America with growth chamber warming experiments, we show that growth and survival in a widespread tundra plant show compensatory responses to warming throughout the species' latitudinal range, buffering overall performance across a range of temperatures. However, populations also differ in their temperature responses, consistent with adaptation to local climate, especially growing season temperature. In particular, warming begins to negatively impact plant growth at cooler temperatures for plants from colder, northern populations than for those from warmer, southern populations, both in the field and in growth chambers. Furthermore, the individuals and maternal families with the fastest growth also have the lowest water use efficiency at all temperatures, suggesting that a trade-off between growth and water use efficiency could further constrain responses to forecasted warming and drying. Taken together, these results suggest that populations throughout species' ranges could be at risk of decline with continued climate change, and that the focus on trailing edge populations risks overlooking the largest

Evolutionary pattern search algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hart, W.E.

1995-09-19

This paper defines a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolutionary strategie and real-coded genetic algorithms. EPSAs are self-adapting systems that modify the step size of the mutation operator in response to the success of previous optimization steps. The rule used to adapt the step size can be used to provide a stationary point convergence theory for EPSAs on any continuous function. This convergence theory is based on an extension of the convergence theory for generalized pattern search methods. An experimentalmore » analysis of the performance of EPSAs demonstrates that these algorithms can perform a level of global search that is comparable to that of canonical EAs. We also describe a stopping rule for EPSAs, which reliably terminated near stationary points in our experiments. This is the first stopping rule for any class of EAs that can terminate at a given distance from stationary points.« less

Robust object tacking based on self-adaptive search area

NASA Astrophysics Data System (ADS)

Dong, Taihang; Zhong, Sheng

2018-02-01

Discriminative correlation filter (DCF) based trackers have recently achieved excellent performance with great computational efficiency. However, DCF based trackers suffer boundary effects, which result in the unstable performance in challenging situations exhibiting fast motion. In this paper, we propose a novel method to mitigate this side-effect in DCF based trackers. We change the search area according to the prediction of target motion. When the object moves fast, broad search area could alleviate boundary effects and reserve the probability of locating object. When the object moves slowly, narrow search area could prevent effect of useless background information and improve computational efficiency to attain real-time performance. This strategy can impressively soothe boundary effects in situations exhibiting fast motion and motion blur, and it can be used in almost all DCF based trackers. The experiments on OTB benchmark show that the proposed framework improves the performance compared with the baseline trackers.

Adaptive interface for personalizing information seeking.

PubMed

Narayanan, S; Koppaka, Lavanya; Edala, Narasimha; Loritz, Don; Daley, Raymond

2004-12-01

An adaptive interface autonomously adjusts its display and available actions to current goals and abilities of the user by assessing user status, system task, and the context. Knowledge content adaptability is needed for knowledge acquisition and refinement tasks. In the case of knowledge content adaptability, the requirements of interface design focus on the elicitation of information from the user and the refinement of information based on patterns of interaction. In such cases, the emphasis on adaptability is on facilitating information search and knowledge discovery. In this article, we present research on adaptive interfaces that facilitates personalized information seeking from a large data warehouse. The resulting proof-of-concept system, called source recommendation system (SRS), assists users in locating and navigating data sources in the repository. Based on the initial user query and an analysis of the content of the search results, the SRS system generates a profile of the user tailored to the individual's context during information seeking. The user profiles are refined successively and are used in progressively guiding the user to the appropriate set of sources within the knowledge base. The SRS system is implemented as an Internet browser plug-in to provide a seamless and unobtrusive, personalized experience to the users during the information search process. The rationale behind our approach, system design, empirical evaluation, and implications for research on adaptive interfaces are described in this paper.

Methods used in adaptation of health-related guidelines: A systematic survey.

PubMed

Abdul-Khalek, Rima A; Darzi, Andrea J; Godah, Mohammad W; Kilzar, Lama; Lakis, Chantal; Agarwal, Arnav; Abou-Jaoude, Elias; Meerpohl, Joerg J; Wiercioch, Wojtek; Santesso, Nancy; Brax, Hneine; Schünemann, Holger; Akl, Elie A

2017-12-01

Adaptation refers to the systematic approach for considering the endorsement or modification of recommendations produced in one setting for application in another as an alternative to de novo development. To describe and assess the methods used for adapting health-related guidelines published in peer-reviewed journals, and to assess the quality of the resulting adapted guidelines. We searched Medline and Embase up to June 2015. We assessed the method of adaptation, and the quality of included guidelines. Seventy-two papers were eligible. Most adapted guidelines and their source guidelines were published by professional societies (71% and 68% respectively), and in high-income countries (83% and 85% respectively). Of the 57 adapted guidelines that reported any detail about adaptation method, 34 (60%) did not use a published adaptation method. The number (and percentage) of adapted guidelines fulfilling each of the ADAPTE steps ranged between 2 (4%) and 57 (100%). The quality of adapted guidelines was highest for the "scope and purpose" domain and lowest for the "editorial independence" domain (respective mean percentages of the maximum possible scores were 93% and 43%). The mean score for "rigor of development" was 57%. Most adapted guidelines published in peer-reviewed journals do not report using a published adaptation method, and their adaptation quality was variable.

On-line range images registration with GPGPU

NASA Astrophysics Data System (ADS)

Będkowski, J.; Naruniec, J.

2013-03-01

This paper concerns implementation of algorithms in the two important aspects of modern 3D data processing: data registration and segmentation. Solution proposed for the first topic is based on the 3D space decomposition, while the latter on image processing and local neighbourhood search. Data processing is implemented by using NVIDIA compute unified device architecture (NIVIDIA CUDA) parallel computation. The result of the segmentation is a coloured map where different colours correspond to different objects, such as walls, floor and stairs. The research is related to the problem of collecting 3D data with a RGB-D camera mounted on a rotated head, to be used in mobile robot applications. Performance of the data registration algorithm is aimed for on-line processing. The iterative closest point (ICP) approach is chosen as a registration method. Computations are based on the parallel fast nearest neighbour search. This procedure decomposes 3D space into cubic buckets and, therefore, the time of the matching is deterministic. First technique of the data segmentation uses accele-rometers integrated with a RGB-D sensor to obtain rotation compensation and image processing method for defining pre-requisites of the known categories. The second technique uses the adapted nearest neighbour search procedure for obtaining normal vectors for each range point.

Adaptation of Decoy Fusion Strategy for Existing Multi-Stage Search Workflows

NASA Astrophysics Data System (ADS)

Ivanov, Mark V.; Levitsky, Lev I.; Gorshkov, Mikhail V.

2016-09-01

A number of proteomic database search engines implement multi-stage strategies aiming at increasing the sensitivity of proteome analysis. These approaches often employ a subset of the original database for the secondary stage of analysis. However, if target-decoy approach (TDA) is used for false discovery rate (FDR) estimation, the multi-stage strategies may violate the underlying assumption of TDA that false matches are distributed uniformly across the target and decoy databases. This violation occurs if the numbers of target and decoy proteins selected for the second search are not equal. Here, we propose a method of decoy database generation based on the previously reported decoy fusion strategy. This method allows unbiased TDA-based FDR estimation in multi-stage searches and can be easily integrated into existing workflows utilizing popular search engines and post-search algorithms.

Adaptive Baseline Enhances EM-Based Policy Search: Validation in a View-Based Positioning Task of a Smartphone Balancer

PubMed Central

Wang, Jiexin; Uchibe, Eiji; Doya, Kenji

2017-01-01

EM-based policy search methods estimate a lower bound of the expected return from the histories of episodes and iteratively update the policy parameters using the maximum of a lower bound of expected return, which makes gradient calculation and learning rate tuning unnecessary. Previous algorithms like Policy learning by Weighting Exploration with the Returns, Fitness Expectation Maximization, and EM-based Policy Hyperparameter Exploration implemented the mechanisms to discard useless low-return episodes either implicitly or using a fixed baseline determined by the experimenter. In this paper, we propose an adaptive baseline method to discard worse samples from the reward history and examine different baselines, including the mean, and multiples of SDs from the mean. The simulation results of benchmark tasks of pendulum swing up and cart-pole balancing, and standing up and balancing of a two-wheeled smartphone robot showed improved performances. We further implemented the adaptive baseline with mean in our two-wheeled smartphone robot hardware to test its performance in the standing up and balancing task, and a view-based approaching task. Our results showed that with adaptive baseline, the method outperformed the previous algorithms and achieved faster, and more precise behaviors at a higher successful rate. PMID:28167910

Convergence behavior that controls adaptive wind tunnel walls near the test section in the high angle of attack range

NASA Technical Reports Server (NTRS)

Ziemann, J.

1982-01-01

The NACA 0012 profile at Mach 0.5 was investigated in a wind tunnel with adaptive walls. It is found that adaptation of the flexible walls is possible in the high angle of attack range on both sides of maximum lift. Oil film photographs of the flow at the profile surface show three dimensional effects in the region of the corners between the profile and the sidewall. It is concluded that pure two dimensional separated flow is not possible.

Social Work Literature Searching: Current Issues with Databases and Online Search Engines

ERIC Educational Resources Information Center

McGinn, Tony; Taylor, Brian; McColgan, Mary; McQuilkan, Janice

2016-01-01

Objectives: To compare the performance of a range of search facilities; and to illustrate the execution of a comprehensive literature search for qualitative evidence in social work. Context: Developments in literature search methods and comparisons of search facilities help facilitate access to the best available evidence for social workers.…

Red ball ranging optimization based on dual camera ranging method

NASA Astrophysics Data System (ADS)

Kuang, Lei; Sun, Weijia; Liu, Jiaming; Tang, Matthew Wai-Chung

2018-05-01

In this paper, the process of positioning and moving to target red ball by NAO robot through its camera system is analyzed and improved using the dual camera ranging method. The single camera ranging method, which is adapted by NAO robot, was first studied and experimented. Since the existing error of current NAO Robot is not a single variable, the experiments were divided into two parts to obtain more accurate single camera ranging experiment data: forward ranging and backward ranging. Moreover, two USB cameras were used in our experiments that adapted Hough's circular method to identify a ball, while the HSV color space model was used to identify red color. Our results showed that the dual camera ranging method reduced the variance of error in ball tracking from 0.68 to 0.20.

Radar Range Sidelobe Reduction Using Adaptive Pulse Compression Technique

NASA Technical Reports Server (NTRS)

Li, Lihua; Coon, Michael; McLinden, Matthew

2013-01-01

Pulse compression has been widely used in radars so that low-power, long RF pulses can be transmitted, rather than a highpower short pulse. Pulse compression radars offer a number of advantages over high-power short pulsed radars, such as no need of high-power RF circuitry, no need of high-voltage electronics, compact size and light weight, better range resolution, and better reliability. However, range sidelobe associated with pulse compression has prevented the use of this technique on spaceborne radars since surface returns detected by range sidelobes may mask the returns from a nearby weak cloud or precipitation particles. Research on adaptive pulse compression was carried out utilizing a field-programmable gate array (FPGA) waveform generation board and a radar transceiver simulator. The results have shown significant improvements in pulse compression sidelobe performance. Microwave and millimeter-wave radars present many technological challenges for Earth and planetary science applications. The traditional tube-based radars use high-voltage power supply/modulators and high-power RF transmitters; therefore, these radars usually have large size, heavy weight, and reliability issues for space and airborne platforms. Pulse compression technology has provided a path toward meeting many of these radar challenges. Recent advances in digital waveform generation, digital receivers, and solid-state power amplifiers have opened a new era for applying pulse compression to the development of compact and high-performance airborne and spaceborne remote sensing radars. The primary objective of this innovative effort is to develop and test a new pulse compression technique to achieve ultrarange sidelobes so that this technique can be applied to spaceborne, airborne, and ground-based remote sensing radars to meet future science requirements. By using digital waveform generation, digital receiver, and solid-state power amplifier technologies, this improved pulse compression

Potential for adaptive evolution at species range margins: contrasting interactions between red coral populations and their environment in a changing ocean.

PubMed

Ledoux, Jean-Baptiste; Aurelle, Didier; Bensoussan, Nathaniel; Marschal, Christian; Féral, Jean-Pierre; Garrabou, Joaquim

2015-03-01

Studying population-by-environment interactions (PEIs) at species range margins offers the opportunity to characterize the responses of populations facing an extreme regime of selection, as expected due to global change. Nevertheless, the importance of these marginal populations as putative reservoirs of adaptive genetic variation has scarcely been considered in conservation biology. This is particularly true in marine ecosystems for which the deep refugia hypothesis proposes that disturbed shallow and marginal populations of a given species can be replenished by mesophotic ones. This hypothesis therefore assumes that identical PEIs exist between populations, neglecting the potential for adaptation at species range margins. Here, we combine reciprocal transplant and common garden experiments with population genetics analyses to decipher the PEIs in the red coral, Corallium rubrum. Our analyses reveal partially contrasting PEIs between shallow and mesophotic populations separated by approximately one hundred meters, suggesting that red coral populations may potentially be locally adapted to their environment. Based on the effective population size and connectivity analyses, we posit that genetic drift may be more important than gene flow in the adaptation of the red coral. We further investigate how adaptive divergence could impact population viability in the context of warming and demonstrate differential phenotypic buffering capacities against thermal stress. Our study questions the relevance of the deep refugia hypothesis and highlights the conservation value of marginal populations as a putative reservoir of adaptive genetic polymorphism.

Adaptive and freeze-tolerant heteronetwork organohydrogels with enhanced mechanical stability over a wide temperature range

NASA Astrophysics Data System (ADS)

Gao, Hainan; Zhao, Ziguang; Cai, Yudong; Zhou, Jiajia; Hua, Wenda; Chen, Lie; Wang, Li; Zhang, Jianqi; Han, Dong; Liu, Mingjie; Jiang, Lei

2017-06-01

Many biological organisms with exceptional freezing tolerance can resist the damages to cells from extra-/intracellular ice crystals and thus maintain their mechanical stability at subzero temperatures. Inspired by the freezing tolerance mechanisms found in nature, here we report a strategy of combining hydrophilic/oleophilic heteronetworks to produce self-adaptive, freeze-tolerant and mechanically stable organohydrogels. The organohydrogels can simultaneously use water and oil as a dispersion medium, and quickly switch between hydrogel- and organogel-like behaviours in response to the nature of the surrounding phase. Accordingly, their surfaces display unusual adaptive dual superlyophobic in oil/water system (that is, they are superhydrophobic under oil and superoleophobic under water). Moreover, the organogel component can inhibit the ice crystallization of the hydrogel component, thus enhancing the mechanical stability of organohydrogel over a wide temperature range (-78 to 80 °C). The organohydrogels may have promising applications in complex and harsh environments.

OvidSP Medline-to-PubMed search filter translation: a methodology for extending search filter range to include PubMed's unique content.

PubMed

Damarell, Raechel A; Tieman, Jennifer J; Sladek, Ruth M

2013-07-02

PubMed translations of OvidSP Medline search filters offer searchers improved ease of access. They may also facilitate access to PubMed's unique content, including citations for the most recently published biomedical evidence. Retrieving this content requires a search strategy comprising natural language terms ('textwords'), rather than Medical Subject Headings (MeSH). We describe a reproducible methodology that uses a validated PubMed search filter translation to create a textword-only strategy to extend retrieval to PubMed's unique heart failure literature. We translated an OvidSP Medline heart failure search filter for PubMed and established version equivalence in terms of indexed literature retrieval. The PubMed version was then run within PubMed to identify citations retrieved by the filter's MeSH terms (Heart failure, Left ventricular dysfunction, and Cardiomyopathy). It was then rerun with the same MeSH terms restricted to searching on title and abstract fields (i.e. as 'textwords'). Citations retrieved by the MeSH search but not the textword search were isolated. Frequency analysis of their titles/abstracts identified natural language alternatives for those MeSH terms that performed less effectively as textwords. These terms were tested in combination to determine the best performing search string for reclaiming this 'lost set'. This string, restricted to searching on PubMed's unique content, was then combined with the validated PubMed translation to extend the filter's performance in this database. The PubMed heart failure filter retrieved 6829 citations. Of these, 834 (12%) failed to be retrieved when MeSH terms were converted to textwords. Frequency analysis of the 834 citations identified five high frequency natural language alternatives that could improve retrieval of this set (cardiac failure, cardiac resynchronization, left ventricular systolic dysfunction, left ventricular diastolic dysfunction, and LV dysfunction). Together these terms reclaimed

OvidSP Medline-to-PubMed search filter translation: a methodology for extending search filter range to include PubMed's unique content

PubMed Central

2013-01-01

Background PubMed translations of OvidSP Medline search filters offer searchers improved ease of access. They may also facilitate access to PubMed’s unique content, including citations for the most recently published biomedical evidence. Retrieving this content requires a search strategy comprising natural language terms (‘textwords’), rather than Medical Subject Headings (MeSH). We describe a reproducible methodology that uses a validated PubMed search filter translation to create a textword-only strategy to extend retrieval to PubMed’s unique heart failure literature. Methods We translated an OvidSP Medline heart failure search filter for PubMed and established version equivalence in terms of indexed literature retrieval. The PubMed version was then run within PubMed to identify citations retrieved by the filter’s MeSH terms (Heart failure, Left ventricular dysfunction, and Cardiomyopathy). It was then rerun with the same MeSH terms restricted to searching on title and abstract fields (i.e. as ‘textwords’). Citations retrieved by the MeSH search but not the textword search were isolated. Frequency analysis of their titles/abstracts identified natural language alternatives for those MeSH terms that performed less effectively as textwords. These terms were tested in combination to determine the best performing search string for reclaiming this ‘lost set’. This string, restricted to searching on PubMed’s unique content, was then combined with the validated PubMed translation to extend the filter’s performance in this database. Results The PubMed heart failure filter retrieved 6829 citations. Of these, 834 (12%) failed to be retrieved when MeSH terms were converted to textwords. Frequency analysis of the 834 citations identified five high frequency natural language alternatives that could improve retrieval of this set (cardiac failure, cardiac resynchronization, left ventricular systolic dysfunction, left ventricular diastolic dysfunction, and

Content Range and Precision of a Computer Adaptive Test of Upper Extremity Function for Children with Cerebral Palsy

ERIC Educational Resources Information Center

Montpetit, Kathleen; Haley, Stephen; Bilodeau, Nathalie; Ni, Pengsheng; Tian, Feng; Gorton, George, III; Mulcahey, M. J.

2011-01-01

This article reports on the content range and measurement precision of an upper extremity (UE) computer adaptive testing (CAT) platform of physical function in children with cerebral palsy. Upper extremity items representing skills of all abilities were administered to 305 parents. These responses were compared with two traditional standardized…

A Rapid Item-Search Procedure for Bayesian Adaptive Testing.

DTIC Science & Technology

1977-05-01

properties of the • procedure , they migh t well introduce undesirable psychological effects on test scores (e.g., Betz & Weiss , 1976r.’ , 1976b...ge of results and adaptive ability test .~~~~ (Research Rep . 76—4). Minneapolis: University of Minnesota , Departmen t of Psychology , Psychometric...t~~[AH ~~~ ~~~~ r _ _ _ _ A RAPID ITEM -SEARC H PROCEDURE FOR BAYESIAN ADAPTIVE TESTING C. David Vale d D D Can David J . Weiss RESEARCH REPORT 77-n

Robust Fusion of Color and Depth Data for RGB-D Target Tracking Using Adaptive Range-Invariant Depth Models and Spatio-Temporal Consistency Constraints.

PubMed

Xiao, Jingjing; Stolkin, Rustam; Gao, Yuqing; Leonardis, Ales

2017-09-06

This paper presents a novel robust method for single target tracking in RGB-D images, and also contributes a substantial new benchmark dataset for evaluating RGB-D trackers. While a target object's color distribution is reasonably motion-invariant, this is not true for the target's depth distribution, which continually varies as the target moves relative to the camera. It is therefore nontrivial to design target models which can fully exploit (potentially very rich) depth information for target tracking. For this reason, much of the previous RGB-D literature relies on color information for tracking, while exploiting depth information only for occlusion reasoning. In contrast, we propose an adaptive range-invariant target depth model, and show how both depth and color information can be fully and adaptively fused during the search for the target in each new RGB-D image. We introduce a new, hierarchical, two-layered target model (comprising local and global models) which uses spatio-temporal consistency constraints to achieve stable and robust on-the-fly target relearning. In the global layer, multiple features, derived from both color and depth data, are adaptively fused to find a candidate target region. In ambiguous frames, where one or more features disagree, this global candidate region is further decomposed into smaller local candidate regions for matching to local-layer models of small target parts. We also note that conventional use of depth data, for occlusion reasoning, can easily trigger false occlusion detections when the target moves rapidly toward the camera. To overcome this problem, we show how combining target information with contextual information enables the target's depth constraint to be relaxed. Our adaptively relaxed depth constraints can robustly accommodate large and rapid target motion in the depth direction, while still enabling the use of depth data for highly accurate reasoning about occlusions. For evaluation, we introduce a new RGB

Robotic Astrobiology: Searching for Life with Rovers

NASA Astrophysics Data System (ADS)

Cabrol, N. A.; Wettergreen, D. S.; Team, L.

2006-05-01

The Life In The Atacama (LITA) project has developed and field tested a long-range, solar-powered, automated rover platform (Zoe) and a science payload assembled to search for microbial life in the Atacama desert. Life is hardly detectable over most of the extent of the driest desert on Earth. Its geological, climatic, and biological evolution provides a unique training ground for designing and testing exploration strategies and life detection methods for the robotic search for life on Mars. LITA opens the path to a new generation of rover missions that will transition from the current study of habitability (MER) to the upcoming search for, and study of, habitats and life on Mars. Zoe's science payload reflects this transition by combining complementary elements, some directed towards the remote sensing of the environment (geology, morphology, mineralogy, weather/climate) for the detection of conditions favorable to microbial habitats and oases along survey traverses, others directed toward the in situ detection of life' signatures (biological and physical, such as biological constructs and patterns). New exploration strategies specifically adapted to the search for microbial life were designed and successfully tested in the Atacama between 2003-2005. They required the development and implementation in the field of new technological capabilities, including navigation beyond the horizon, obstacle avoidance, and "science-on-the-fly" (automated detection of targets of science value), and that of new rover planning tools in the remote science operation center.

Search for a standard-model-like Higgs boson with a mass in the range 145 to 1000 GeV at the LHC.

PubMed

Chatrchyan, S; Khachatryan, V; Sirunyan, A M; Tumasyan, A; Adam, W; Bergauer, T; Dragicevic, M; Erö, J; Fabjan, C; Friedl, M; Frühwirth, R; Ghete, V M; Hörmann, N; Hrubec, J; Jeitler, M; Kiesenhofer, W; Knünz, V; Krammer, M; Krätschmer, I; Liko, D; Mikulec, I; Rabady, D; Rahbaran, B; Rohringer, C; Rohringer, H; Schöfbeck, R; Strauss, J; Taurok, A; Treberer-Treberspurg, W; Waltenberger, W; Wulz, C-E; Mossolov, V; Shumeiko, N; Suarez Gonzalez, J; Alderweireldt, S; Bansal, M; Bansal, S; Cornelis, T; De Wolf, E A; Janssen, X; Knutsson, A; Luyckx, S; Mucibello, L; Ochesanu, S; Roland, B; Rougny, R; Van Haevermaet, H; Van Mechelen, P; Van Remortel, N; Van Spilbeeck, A; Blekman, F; Blyweert, S; D'Hondt, J; Kalogeropoulos, A; Keaveney, J; Maes, M; Olbrechts, A; Tavernier, S; Van Doninck, W; Van Mulders, P; Van Onsem, G P; Villella, I; Clerbaux, B; De Lentdecker, G; Gay, A P R; Hreus, T; Léonard, A; Marage, P E; Mohammadi, A; Reis, T; Thomas, L; Vander Velde, C; Vanlaer, P; Wang, J; Adler, V; Beernaert, K; Benucci, L; Cimmino, A; Costantini, S; Dildick, S; Garcia, G; Klein, B; Lellouch, J; Marinov, A; Mccartin, J; Ocampo Rios, A A; Ryckbosch, D; Sigamani, M; Strobbe, N; Thyssen, F; Tytgat, M; Walsh, S; Yazgan, E; Zaganidis, N; Basegmez, S; Bruno, G; Castello, R; Ceard, L; Delaere, C; du Pree, T; Favart, D; Forthomme, L; Giammanco, A; Hollar, J; Lemaitre, V; Liao, J; Militaru, O; Nuttens, C; Pagano, D; Pin, A; Piotrzkowski, K; Popov, A; Selvaggi, M; Vizan Garcia, J M; Beliy, N; Caebergs, T; Daubie, E; Hammad, G H; Alves, G A; Correa Martins Junior, M; Martins, T; Pol, M E; Souza, M H G; Aldá Júnior, W L; Carvalho, W; Chinellato, J; Custódio, A; Da Costa, E M; De Jesus Damiao, D; De Oliveira Martins, C; Fonseca De Souza, S; Malbouisson, H; Malek, M; Matos Figueiredo, D; Mundim, L; Nogima, H; Prado Da Silva, W L; Santoro, A; Soares Jorge, L; Sznajder, A; Tonelli Manganote, E J; Vilela Pereira, A; Anjos, T S; Bernardes, C A; Dias, F A; Fernandez Perez Tomei, T R; Gregores, E M; Lagana, C; Marinho, F; Mercadante, P G; Novaes, S F; Padula, Sandra S; Genchev, V; Iaydjiev, P; Piperov, S; Rodozov, M; Stoykova, S; Sultanov, G; Tcholakov, V; Trayanov, R; Vutova, M; Dimitrov, A; Hadjiiska, R; Kozhuharov, V; Litov, L; Pavlov, B; Petkov, P; Bian, J G; Chen, G M; Chen, H S; Jiang, C H; Liang, D; Liang, S; Meng, X; Tao, J; Wang, J; Wang, X; Wang, Z; Xiao, H; Xu, M; Asawatangtrakuldee, C; Ban, Y; Guo, Y; Li, Q; Li, W; Liu, S; Mao, Y; Qian, S J; Wang, D; Zhang, L; Zou, W; Avila, C; Carrillo Montoya, C A; Gomez, J P; Gomez Moreno, B; Sanabria, J C; Godinovic, N; Lelas, D; Plestina, R; Polic, D; Puljak, I; Antunovic, Z; Kovac, M; Brigljevic, V; Duric, S; Kadija, K; Luetic, J; Mekterovic, D; Morovic, S; Tikvica, L; Attikis, A; Mavromanolakis, G; Mousa, J; Nicolaou, C; Ptochos, F; Razis, P A; Finger, M; Finger, M; Assran, Y; Ellithi Kamel, A; Mahmoud, M A; Mahrous, A; Radi, A; Kadastik, M; Müntel, M; Murumaa, M; Raidal, M; Rebane, L; Tiko, A; Eerola, P; Fedi, G; Voutilainen, M; Härkönen, J; Karimäki, V; Kinnunen, R; Kortelainen, M J; Lampén, T; Lassila-Perini, K; Lehti, S; Lindén, T; Luukka, P; Mäenpää, T; Peltola, T; Tuominen, E; Tuominiemi, J; Tuovinen, E; Wendland, L; Korpela, A; Tuuva, T; Besancon, M; Choudhury, S; Couderc, F; Dejardin, M; Denegri, D; Fabbro, B; Faure, J L; Ferri, F; Ganjour, S; Givernaud, A; Gras, P; Hamel de Monchenault, G; Jarry, P; Locci, E; Malcles, J; Millischer, L; Nayak, A; Rander, J; Rosowsky, A; Titov, M; Baffioni, S; Beaudette, F; Benhabib, L; Bianchini, L; Bluj, M; Busson, P; Charlot, C; Daci, N; Dahms, T; Dalchenko, M; Dobrzynski, L; Florent, A; Granier de Cassagnac, R; Haguenauer, M; Miné, P; Mironov, C; Naranjo, I N; Nguyen, M; Ochando, C; Paganini, P; Sabes, D; Salerno, R; Sirois, Y; Veelken, C; Zabi, A; Agram, J-L; Andrea, J; Bloch, D; Bodin, D; Brom, J-M; Chabert, E C; Collard, C; Conte, E; Drouhin, F; Fontaine, J-C; Gelé, D; Goerlach, U; Goetzmann, C; Juillot, P; Le Bihan, A-C; Van Hove, P; Beauceron, S; Beaupere, N; Bondu, O; Boudoul, G; Brochet, S; Chasserat, J; Chierici, R; Contardo, D; Depasse, P; El Mamouni, H; Fay, J; Gascon, S; Gouzevitch, M; Ille, B; Kurca, T; Lethuillier, M; Mirabito, L; Perries, S; Sgandurra, L; Sordini, V; Tschudi, Y; Vander Donckt, M; Verdier, P; Viret, S; Tsamalaidze, Z; Autermann, C; Beranek, S; Calpas, B; Edelhoff, M; Feld, L; Heracleous, N; Hindrichs, O; Klein, K; Merz, J; Ostapchuk, A; Perieanu, A; Raupach, F; Sammet, J; Schael, S; Sprenger, D; Weber, H; Wittmer, B; Zhukov, V; Ata, M; Caudron, J; Dietz-Laursonn, E; Duchardt, D; Erdmann, M; Fischer, R; Güth, A; Hebbeker, T; Heidemann, C; Hoepfner, K; Klingebiel, D; Kreuzer, P; Merschmeyer, M; Meyer, A; Olschewski, M; Padeken, K; Papacz, P; Pieta, H; Reithler, H; Schmitz, S A; Sonnenschein, L; Steggemann, J; Teyssier, D; Thüer, S; Weber, M; Cherepanov, V; Erdogan, Y; Flügge, G; Geenen, H; Geisler, M; Haj Ahmad, W; Hoehle, F; Kargoll, B; Kress, T; Kuessel, Y; Lingemann, J; Nowack, A; Nugent, I M; Perchalla, L; Pooth, O; Stahl, A; Aldaya Martin, M; Asin, I; Bartosik, N; Behr, J; Behrenhoff, W; Behrens, U; Bergholz, M; Bethani, A; Borras, K; Burgmeier, A; Cakir, A; Calligaris, L; Campbell, A; Costanza, F; Dammann, D; Diez Pardos, C; Dorland, T; Eckerlin, G; Eckstein, D; Flucke, G; Geiser, A; Glushkov, I; Gunnellini, P; Habib, S; Hauk, J; Hellwig, G; Jung, H; Kasemann, M; Katsas, P; Kleinwort, C; Kluge, H; Krämer, M; Krücker, D; Kuznetsova, E; Lange, W; Leonard, J; Lipka, K; Lohmann, W; Lutz, B; Mankel, R; Marfin, I; Marienfeld, M; Melzer-Pellmann, I-A; Meyer, A B; Mnich, J; Mussgiller, A; Naumann-Emme, S; Novgorodova, O; Nowak, F; Olzem, J; Perrey, H; Petrukhin, A; Pitzl, D; Raspereza, A; Ribeiro Cipriano, P M; Riedl, C; Ron, E; Rosin, M; Salfeld-Nebgen, J; Schmidt, R; Schoerner-Sadenius, T; Sen, N; Stein, M; Walsh, R; Wissing, C; Blobel, V; Enderle, H; Erfle, J; Gebbert, U; Görner, M; Gosselink, M; Haller, J; Heine, K; Höing, R S; Kaschube, K; Kaussen, G; Kirschenmann, H; Klanner, R; Lange, J; Peiffer, T; Pietsch, N; Rathjens, D; Sander, C; Schettler, H; Schleper, P; Schlieckau, E; Schmidt, A; Schum, T; Seidel, M; Sibille, J; Sola, V; Stadie, H; Steinbrück, G; Thomsen, J; Vanelderen, L; Barth, C; Baus, C; Berger, J; Böser, C; Chwalek, T; De Boer, W; Descroix, A; Dierlamm, A; Feindt, M; Guthoff, M; Hackstein, C; Hartmann, F; Hauth, T; Heinrich, M; Held, H; Hoffmann, K H; Husemann, U; Katkov, I; Komaragiri, J R; Kornmayer, A; Lobelle Pardo, P; Martschei, D; Mueller, S; Müller, Th; Niegel, M; Nürnberg, A; Oberst, O; Ott, J; Quast, G; Rabbertz, K; Ratnikov, F; Ratnikova, N; Röcker, S; Schilling, F-P; Schott, G; Simonis, H J; Stober, F M; Troendle, D; Ulrich, R; Wagner-Kuhr, J; Wayand, S; Weiler, T; Zeise, M; Anagnostou, G; Daskalakis, G; Geralis, T; Kesisoglou, S; Kyriakis, A; Loukas, D; Markou, A; Markou, C; Ntomari, E; Gouskos, L; Mertzimekis, T J; Panagiotou, A; Saoulidou, N; Stiliaris, E; Aslanoglou, X; Evangelou, I; Flouris, G; Foudas, C; Kokkas, P; Manthos, N; Papadopoulos, I; Paradas, E; Bencze, G; Hajdu, C; Hidas, P; Horvath, D; Radics, B; Sikler, F; Veszpremi, V; Vesztergombi, G; Zsigmond, A J; Beni, N; Czellar, S; Molnar, J; Palinkas, J; Szillasi, Z; Karancsi, J; Raics, P; Trocsanyi, Z L; Ujvari, B; Beri, S B; Bhatnagar, V; Dhingra, N; Gupta, R; Kaur, M; Mehta, M Z; Mittal, M; Nishu, N; Saini, L K; Sharma, A; Singh, J B; Kumar, Ashok; Kumar, Arun; Ahuja, S; Bhardwaj, A; Choudhary, B C; Malhotra, S; Naimuddin, M; Ranjan, K; Saxena, P; Sharma, V; Shivpuri, R K; Banerjee, S; Bhattacharya, S; Chatterjee, K; Dutta, S; Gomber, B; Jain, Sa; Jain, Sh; Khurana, R; Modak, A; Mukherjee, S; Roy, D; Sarkar, S; Sharan, M; Abdulsalam, A; Dutta, D; Kailas, S; Kumar, V; Mohanty, A K; Pant, L M; Shukla, P; Topkar, A; Aziz, T; Chatterjee, R M; Ganguly, S; Guchait, M; Gurtu, A; Maity, M; Majumder, G; Mazumdar, K; Mohanty, G B; Parida, B; Sudhakar, K; Wickramage, N; Banerjee, S; Dugad, S; Arfaei, H; Bakhshiansohi, H; Etesami, S M; Fahim, A; Hesari, H; Jafari, A; Khakzad, M; Mohammadi Najafabadi, M; Paktinat Mehdiabadi, S; Safarzadeh, B; Zeinali, M; Grunewald, M; Abbrescia, M; Barbone, L; Calabria, C; Chhibra, S S; Colaleo, A; Creanza, D; De Filippis, N; De Palma, M; Fiore, L; Iaselli, G; Maggi, G; Maggi, M; Marangelli, B; My, S; Nuzzo, S; Pacifico, N; Pompili, A; Pugliese, G; Selvaggi, G; Silvestris, L; Singh, G; Venditti, R; Verwilligen, P; Zito, G; Abbiendi, G; Benvenuti, A C; Bonacorsi, D; Braibant-Giacomelli, S; Brigliadori, L; Campanini, R; Capiluppi, P; Castro, A; Cavallo, F R; Cuffiani, M; Dallavalle, G M; Fabbri, F; Fanfani, A; Fasanella, D; Giacomelli, P; Grandi, C; Guiducci, L; Marcellini, S; Masetti, G; Meneghelli, M; Montanari, A; Navarria, F L; Odorici, F; Perrotta, A; Primavera, F; Rossi, A M; Rovelli, T; Siroli, G P; Tosi, N; Travaglini, R; Albergo, S; Chiorboli, M; Costa, S; Potenza, R; Tricomi, A; Tuve, C; Barbagli, G; Ciulli, V; Civinini, C; D'Alessandro, R; Focardi, E; Frosali, S; Gallo, E; Gonzi, S; Lenzi, P; Meschini, M; Paoletti, S; Sguazzoni, G; Tropiano, A; Benussi, L; Bianco, S; Fabbri, F; Piccolo, D; Fabbricatore, P; Musenich, R; Tosi, S; Benaglia, A; De Guio, F; Di Matteo, L; Fiorendi, S; Gennai, S; Ghezzi, A; Govoni, P; Lucchini, M T; Malvezzi, S; Manzoni, R A; Martelli, A; Massironi, A; Menasce, D; Moroni, L; Paganoni, M; Pedrini, D; Ragazzi, S; Redaelli, N; Tabarelli de Fatis, T; Buontempo, S; Cavallo, N; De Cosa, A; Dogangun, O; Fabozzi, F; Iorio, A O M; Lista, L; Meola, S; Merola, M; Paolucci, P; Azzi, P; Bacchetta, N; Bellato, M; Bisello, D; Branca, A; Carlin, R; Checchia, P; Dorigo, T; Dosselli, U; Fantinel, S; Galanti, M; Gasparini, F; Gasparini, U; Giubilato, P; Gozzelino, A; Kanishchev, K; Lacaprara, S; Lazzizzera, I; Margoni, M; Meneguzzo, A T; Nespolo, M; Pazzini, J; Pozzobon, N; Ronchese, P; Simonetto, F; Torassa, E; Tosi, M; Vanini, S; Zotto, P; Zumerle, G; Gabusi, M; Ratti, S P; Riccardi, C; Vitulo, P; Biasini, M; Bilei, G M; Fanò, L; Lariccia, P; Mantovani, G; Menichelli, M; Nappi, A; Romeo, F; Saha, A; Santocchia, A; Spiezia, A; Azzurri, P; Bagliesi, G; Boccali, T; Broccolo, G; Castaldi, R; D'Agnolo, R T; Dell'Orso, R; Fiori, F; Foà, L; Giassi, A; Kraan, A; Ligabue, F; Lomtadze, T; Martini, L; Messineo, A; Palla, F; Rizzi, A; Serban, A T; Spagnolo, P; Squillacioti, P; Tenchini, R; Tonelli, G; Venturi, A; Verdini, P G; Vernieri, C; Barone, L; Cavallari, F; Del Re, D; Diemoz, M; Fanelli, C; Grassi, M; Longo, E; Margaroli, F; Meridiani, P; Micheli, F; Nourbakhsh, S; Organtini, G; Paramatti, R; Rahatlou, S; Soffi, L; Amapane, N; Arcidiacono, R; Argiro, S; Arneodo, M; Biino, C; Cartiglia, N; Casasso, S; Costa, M; De Remigis, P; Demaria, N; Mariotti, C; Maselli, S; Migliore, E; Monaco, V; Musich, M; Obertino, M M; Pastrone, N; Pelliccioni, M; Potenza, A; Romero, A; Ruspa, M; Sacchi, R; Solano, A; Staiano, A; Tamponi, U; Belforte, S; Candelise, V; Casarsa, M; Cossutti, F; Della Ricca, G; Gobbo, B; La Licata, C; Marone, M; Montanino, D; Penzo, A; Schizzi, A; Zanetti, A; Kim, T Y; Nam, S K; Chang, S; Kim, D H; Kim, G N; Kim, J E; Kong, D J; Oh, Y D; Park, H; Son, D C; Kim, J Y; Kim, Zero J; Song, S; Choi, S; Gyun, D; Hong, B; Jo, M; Kim, H; Kim, T J; Lee, K S; Moon, D H; Park, S K; Roh, Y; Choi, M; Kim, J H; Park, C; Park, I C; Park, S; Ryu, G; Choi, Y; Choi, Y K; Goh, J; Kim, M S; Kwon, E; Lee, B; Lee, J; Lee, S; Seo, H; Yu, I; Grigelionis, I; Juodagalvis, A; Castilla-Valdez, H; De La Cruz-Burelo, E; Heredia-de La Cruz, I; Lopez-Fernandez, R; Martínez-Ortega, J; Sanchez-Hernandez, A; Villasenor-Cendejas, L M; Carrillo Moreno, S; Vazquez Valencia, F; Salazar Ibarguen, H A; Casimiro Linares, E; Morelos Pineda, A; Reyes-Santos, M A; Krofcheck, D; Bell, A J; Butler, P H; Doesburg, R; Reucroft, S; Silverwood, H; Ahmad, M; Asghar, M I; Butt, J; Hoorani, H R; Khalid, S; Khan, W A; Khurshid, T; Qazi, S; Shah, M A; Shoaib, M; Bialkowska, H; Boimska, B; Frueboes, T; Górski, M; Kazana, M; Nawrocki, K; Romanowska-Rybinska, K; Szleper, M; Wrochna, G; Zalewski, P; Brona, G; Bunkowski, K; Cwiok, M; Dominik, W; Doroba, K; Kalinowski, A; Konecki, M; Krolikowski, J; Misiura, M; Wolszczak, W; Almeida, N; Bargassa, P; David, A; Faccioli, P; Ferreira Parracho, P G; Gallinaro, M; Seixas, J; Varela, J; Vischia, P; Bunin, P; Golutvin, I; Gorbunov, I; Karjavin, V; Konoplyanikov, V; Kozlov, G; Lanev, A; Malakhov, A; Moisenz, P; Palichik, V; Perelygin, V; Savina, M; Shmatov, S; Shulha, S; Smirnov, V; Volodko, A; Zarubin, A; Evstyukhin, S; Golovtsov, V; Ivanov, Y; Kim, V; Levchenko, P; Murzin, V; Oreshkin, V; Smirnov, I; Sulimov, V; Uvarov, L; Vavilov, S; Vorobyev, A; Vorobyev, An; Andreev, Yu; Dermenev, A; Gninenko, S; Golubev, N; Kirsanov, M; Krasnikov, N; Matveev, V; Pashenkov, A; Tlisov, D; Toropin, A; Epshteyn, V; Erofeeva, M; Gavrilov, V; Lychkovskaya, N; Popov, V; Safronov, G; Semenov, S; Spiridonov, A; Stolin, V; Vlasov, E; Zhokin, A; Andreev, V; Azarkin, M; Dremin, I; Kirakosyan, M; Leonidov, A; Mesyats, G; Rusakov, S V; Vinogradov, A; Belyaev, A; Boos, E; Bunichev, V; Dubinin, M; Dudko, L; Gribushin, A; Klyukhin, V; Kodolova, O; Lokhtin, I; Markina, A; Obraztsov, S; Petrushanko, S; Savrin, V; Snigirev, A; Azhgirey, I; Bayshev, I; Bitioukov, S; Kachanov, V; Kalinin, A; Konstantinov, D; Krychkine, V; Petrov, V; Ryutin, R; Sobol, A; Tourtchanovitch, L; Troshin, S; Tyurin, N; Uzunian, A; Volkov, A; Adzic, P; Ekmedzic, M; Krpic, D; Milosevic, J; Aguilar-Benitez, M; Alcaraz Maestre, J; Battilana, C; Calvo, E; Cerrada, M; Chamizo Llatas, M; Colino, N; De La Cruz, B; Delgado Peris, A; Domínguez Vázquez, D; Fernandez Bedoya, C; Fernández Ramos, J P; Ferrando, A; Flix, J; Fouz, M C; Garcia-Abia, P; Gonzalez Lopez, O; Goy Lopez, S; Hernandez, J M; Josa, M I; Merino, G; Navarro De Martino, E; Puerta Pelayo, J; Quintario Olmeda, A; Redondo, I; Romero, L; Santaolalla, J; Soares, M S; Willmott, C; Albajar, C; de Trocóniz, J F; Brun, H; Cuevas, J; Fernandez Menendez, J; Folgueras, S; Gonzalez Caballero, I; Lloret Iglesias, L; Piedra Gomez, J; Brochero Cifuentes, J A; Cabrillo, I J; Calderon, A; Chuang, S H; Duarte Campderros, J; Fernandez, M; Gomez, G; Gonzalez Sanchez, J; Graziano, A; Jorda, C; Lopez Virto, A; Marco, J; Marco, R; Martinez Rivero, C; Matorras, F; Munoz Sanchez, F J; Rodrigo, T; Rodríguez-Marrero, A Y; Ruiz-Jimeno, A; Scodellaro, L; Vila, I; Vilar Cortabitarte, R; Abbaneo, D; Auffray, E; Auzinger, G; Bachtis, M; Baillon, P; Ball, A H; Barney, D; Bendavid, J; Benitez, J F; Bernet, C; Bianchi, G; Bloch, P; Bocci, A; Bonato, A; Botta, C; Breuker, H; Camporesi, T; Cerminara, G; Christiansen, T; Coarasa Perez, J A; Colafranceschi, S; d'Enterria, D; Dabrowski, A; De Roeck, A; De Visscher, S; Di Guida, S; Dobson, M; Dupont-Sagorin, N; Elliott-Peisert, A; Eugster, J; Funk, W; Georgiou, G; Giffels, M; Gigi, D; Gill, K; Giordano, D; Girone, M; Giunta, M; Glege, F; Gomez-Reino Garrido, R; Gowdy, S; Guida, R; Hammer, J; Hansen, M; Harris, P; Hartl, C; Hegner, B; Hinzmann, A; Innocente, V; Janot, P; Kaadze, K; Karavakis, E; Kousouris, K; Krajczar, K; Lecoq, P; Lee, Y-J; Lourenço, C; Magini, N; Malberti, M; Malgeri, L; Mannelli, M; Masetti, L; Meijers, F; Mersi, S; Meschi, E; Moser, R; Mulders, M; Musella, P; Nesvold, E; Orsini, L; Palencia Cortezon, E; Perez, E; Perrozzi, L; Petrilli, A; Pfeiffer, A; Pierini, M; Pimiä, M; Piparo, D; Polese, G; Quertenmont, L; Racz, A; Reece, W; Rodrigues Antunes, J; Rolandi, G; Rovelli, C; Rovere, M; Sakulin, H; Santanastasio, F; Schäfer, C; Schwick, C; Segoni, I; Sekmen, S; Sharma, A; Siegrist, P; Silva, P; Simon, M; Sphicas, P; Spiga, D; Stoye, M; Tsirou, A; Veres, G I; Vlimant, J R; Wöhri, H K; Worm, S D; Zeuner, W D; Bertl, W; Deiters, K; Erdmann, W; Gabathuler, K; Horisberger, R; Ingram, Q; Kaestli, H C; König, S; Kotlinski, D; Langenegger, U; Meier, F; Renker, D; Rohe, T; Bachmair, F; Bäni, L; Bortignon, P; Buchmann, M A; Casal, B; Chanon, N; Deisher, A; Dissertori, G; Dittmar, M; Donegà, M; Dünser, M; Eller, P; Grab, C; Hits, D; Lecomte, P; Lustermann, W; Marini, A C; Martinez Ruiz Del Arbol, P; Mohr, N; Moortgat, F; Nägeli, C; Nef, P; Nessi-Tedaldi, F; Pandolfi, F; Pape, L; Pauss, F; Peruzzi, M; Ronga, F J; Rossini, M; Sala, L; Sanchez, A K; Starodumov, A; Stieger, B; Takahashi, M; Tauscher, L; Thea, A; Theofilatos, K; Treille, D; Urscheler, C; Wallny, R; Weber, H A; Amsler, C; Chiochia, V; Favaro, C; Ivova Rikova, M; Kilminster, B; Millan Mejias, B; Otiougova, P; Robmann, P; Snoek, H; Taroni, S; Tupputi, S; Verzetti, M; Cardaci, M; Chen, K H; Ferro, C; Kuo, C M; Li, S W; Lin, W; Lu, Y J; Volpe, R; Yu, S S; Bartalini, P; Chang, P; Chang, Y H; Chang, Y W; Chao, Y; Chen, K F; Dietz, C; Grundler, U; Hou, W-S; Hsiung, Y; Kao, K Y; Lei, Y J; Lu, R-S; Majumder, D; Petrakou, E; Shi, X; Shiu, J G; Tzeng, Y M; Wang, M; Asavapibhop, B; Suwonjandee, N; Adiguzel, A; Bakirci, M N; Cerci, S; Dozen, C; Dumanoglu, I; Eskut, E; Girgis, S; Gokbulut, G; Gurpinar, E; Hos, I; Kangal, E E; Kayis Topaksu, A; Onengut, G; Ozdemir, K; Ozturk, S; Polatoz, A; Sogut, K; Sunar Cerci, D; Tali, B; Topakli, H; Vergili, M; Akin, I V; Aliev, T; Bilin, B; Bilmis, S; Deniz, M; Gamsizkan, H; Guler, A M; Karapinar, G; Ocalan, K; Ozpineci, A; Serin, M; Sever, R; Surat, U E; Yalvac, M; Zeyrek, M; Gülmez, E; Isildak, B; Kaya, M; Kaya, O; Ozkorucuklu, S; Sonmez, N; Bahtiyar, H; Barlas, E; Cankocak, K; Günaydin, Y O; Vardarlı, F I; Yücel, M; Levchuk, L; Sorokin, P; Brooke, J J; Clement, E; Cussans, D; Flacher, H; Frazier, R; Goldstein, J; Grimes, M; Heath, G P; Heath, H F; Kreczko, L; Metson, S; Newbold, D M; Nirunpong, K; Poll, A; Senkin, S; Smith, V J; Williams, T; Basso, L; Bell, K W; Belyaev, A; Brew, C; Brown, R M; Cockerill, D J A; Coughlan, J A; Harder, K; Harper, S; Jackson, J; Olaiya, E; Petyt, D; Radburn-Smith, B C; Shepherd-Themistocleous, C H; Tomalin, I R; Womersley, W J; Bainbridge, R; Ball, G; Buchmuller, O; Burton, D; Colling, D; Cripps, N; Cutajar, M; Dauncey, P; Davies, G; Della Negra, M; Ferguson, W; Fulcher, J; Futyan, D; Gilbert, A; Guneratne Bryer, A; Hall, G; Hatherell, Z; Hays, J; Iles, G; Jarvis, M; Karapostoli, G; Kenzie, M; Lane, R; Lucas, R; Lyons, L; Magnan, A-M; Marrouche, J; Mathias, B; Nandi, R; Nash, J; Nikitenko, A; Pela, J; Pesaresi, M; Petridis, K; Pioppi, M; Raymond, D M; Rogerson, S; Rose, A; Seez, C; Sharp, P; Sparrow, A; Tapper, A; Vazquez Acosta, M; Virdee, T; Wakefield, S; Wardle, N; Whyntie, T; Chadwick, M; Cole, J E; Hobson, P R; Khan, A; Kyberd, P; Leggat, D; Leslie, D; Martin, W; Reid, I D; Symonds, P; Teodorescu, L; Turner, M; Dittmann, J; Hatakeyama, K; Kasmi, A; Liu, H; Scarborough, T; Charaf, O; Cooper, S I; Henderson, C; Rumerio, P; Avetisyan, A; Bose, T; Fantasia, C; Heister, A; Lawson, P; Lazic, D; Rohlf, J; Sperka, D; John, J St; Sulak, L; Alimena, J; Bhattacharya, S; Christopher, G; Cutts, D; Demiragli, Z; Ferapontov, A; Garabedian, A; Heintz, U; Kukartsev, G; Laird, E; Landsberg, G; Luk, M; Narain, M; Segala, M; Sinthuprasith, T; Speer, T; Breedon, R; Breto, G; Calderon De La Barca Sanchez, M; Chauhan, S; Chertok, M; Conway, J; Conway, R; Cox, P T; Erbacher, R; Gardner, M; Houtz, R; Ko, W; Kopecky, A; Lander, R; Mall, O; Miceli, T; Nelson, R; Pellett, D; Ricci-Tam, F; Rutherford, B; Searle, M; Smith, J; Squires, M; Tripathi, M; Yohay, R; Andreev, V; Cline, D; Cousins, R; Erhan, S; Everaerts, P; Farrell, C; Felcini, M; Hauser, J; Ignatenko, M; Jarvis, C; Rakness, G; Schlein, P; Traczyk, P; Valuev, V; Weber, M; Babb, J; Clare, R; Dinardo, M E; Ellison, J; Gary, J W; Giordano, F; Hanson, G; Liu, H; Long, O R; Luthra, A; Nguyen, H; Paramesvaran, S; Sturdy, J; Sumowidagdo, S; Wilken, R; Wimpenny, S; Andrews, W; Branson, J G; Cerati, G B; Cittolin, S; Evans, D; Holzner, A; Kelley, R; Lebourgeois, M; Letts, J; Macneill, I; Mangano, B; Padhi, S; Palmer, C; Petrucciani, G; Pieri, M; Sani, M; Sharma, V; Simon, S; Sudano, E; Tadel, M; Tu, Y; Vartak, A; Wasserbaech, S; Würthwein, F; Yagil, A; Yoo, J; Barge, D; Bellan, R; Campagnari, C; D'Alfonso, M; Danielson, T; Flowers, K; Geffert, P; George, C; Golf, F; Incandela, J; Justus, C; Kalavase, P; Kovalskyi, D; Krutelyov, V; Lowette, S; Magaña Villalba, R; Mccoll, N; Pavlunin, V; Ribnik, J; Richman, J; Rossin, R; Stuart, D; To, W; West, C; Apresyan, A; Bornheim, A; Bunn, J; Chen, Y; Di Marco, E; Duarte, J; Kcira, D; Ma, Y; Mott, A; Newman, H B; Rogan, C; Spiropulu, M; Timciuc, V; Veverka, J; Wilkinson, R; Xie, S; Yang, Y; Zhu, R Y; Azzolini, V; Calamba, A; Carroll, R; Ferguson, T; Iiyama, Y; Jang, D W; Liu, Y F; Paulini, M; Russ, J; Vogel, H; Vorobiev, I; Cumalat, J P; Drell, B R; Ford, W T; Gaz, A; Luiggi Lopez, E; Nauenberg, U; Smith, J G; Stenson, K; Ulmer, K A; Wagner, S R; Alexander, J; Chatterjee, A; Eggert, N; Gibbons, L K; Hopkins, W; Khukhunaishvili, A; Kreis, B; Mirman, N; Nicolas Kaufman, G; Patterson, J R; Ryd, A; Salvati, E; Sun, W; Teo, W D; Thom, J; Thompson, J; Tucker, J; Weng, Y; Winstrom, L; Wittich, P; Winn, D; Abdullin, S; Albrow, M; Anderson, J; Apollinari, G; Bauerdick, L A T; Beretvas, A; Berryhill, J; Bhat, P C; Burkett, K; Butler, J N; Chetluru, V; Cheung, H W K; Chlebana, F; Cihangir, S; Elvira, V D; Fisk, I; Freeman, J; Gao, Y; Gottschalk, E; Gray, L; Green, D; Gutsche, O; Harris, R M; Hirschauer, J; Hooberman, B; Jindariani, S; Johnson, M; Joshi, U; Klima, B; Kunori, S; Kwan, S; Linacre, J; Lincoln, D; Lipton, R; Lykken, J; Maeshima, K; Marraffino, J M; Martinez Outschoorn, V I; Maruyama, S; Mason, D; McBride, P; Mishra, K; Mrenna, S; Musienko, Y; Newman-Holmes, C; O'Dell, V; Prokofyev, O; Sexton-Kennedy, E; Sharma, S; Spalding, W J; Spiegel, L; Taylor, L; Tkaczyk, S; Tran, N V; Uplegger, L; Vaandering, E W; Vidal, R; Whitmore, J; Wu, W; Yang, F; Yun, J C; Acosta, D; Avery, P; Bourilkov, D; Chen, M; Cheng, T; Das, S; De Gruttola, M; Di Giovanni, G P; Dobur, D; Drozdetskiy, A; Field, R D; Fisher, M; Fu, Y; Furic, I K; Hugon, J; Kim, B; Konigsberg, J; Korytov, A; Kropivnitskaya, A; Kypreos, T; Low, J F; Matchev, K; Milenovic, P; Mitselmakher, G; Muniz, L; Remington, R; Rinkevicius, A; Skhirtladze, N; Snowball, M; Yelton, J; Zakaria, M; Gaultney, V; Hewamanage, S; Lebolo, L M; Linn, S; Markowitz, P; Martinez, G; Rodriguez, J L; Adams, T; Askew, A; Bochenek, J; Chen, J; Diamond, B; Gleyzer, S V; Haas, J; Hagopian, S; Hagopian, V; Johnson, K F; Prosper, H; Veeraraghavan, V; Weinberg, M; Baarmand, M M; Dorney, B; Hohlmann, M; Kalakhety, H; Yumiceva, F; Adams, M R; Apanasevich, L; Bazterra, V E; Betts, R R; Bucinskaite, I; Callner, J; Cavanaugh, R; Evdokimov, O; Gauthier, L; Gerber, C E; Hofman, D J; Khalatyan, S; Kurt, P; Lacroix, F; O'Brien, C; Silkworth, C; Strom, D; Turner, P; Varelas, N; Akgun, U; Albayrak, E A; Bilki, B; Clarida, W; Dilsiz, K; Duru, F; Griffiths, S; Merlo, J-P; Mermerkaya, H; Mestvirishvili, A; Moeller, A; Nachtman, J; Newsom, C R; Ogul, H; Onel, Y; Ozok, F; Sen, S; Tan, P; Tiras, E; Wetzel, J; Yetkin, T; Yi, K; Barnett, B A; Blumenfeld, B; Bolognesi, S; Fehling, D; Giurgiu, G; Gritsan, A V; Hu, G; Maksimovic, P; Swartz, M; Whitbeck, A; Baringer, P; Bean, A; Benelli, G; Kenny Iii, R P; Murray, M; Noonan, D; Sanders, S; Stringer, R; Wood, J S; Barfuss, A F; Chakaberia, I; Ivanov, A; Khalil, S; Makouski, M; Maravin, Y; Shrestha, S; Svintradze, I; Gronberg, J; Lange, D; Rebassoo, F; Wright, D; Baden, A; Calvert, B; Eno, S C; Gomez, J A; Hadley, N J; Kellogg, R G; Kolberg, T; Lu, Y; Marionneau, M; Mignerey, A C; Pedro, K; Peterman, A; Skuja, A; Temple, J; Tonjes, M B; Tonwar, S C; Apyan, A; Bauer, G; Busza, W; Butz, E; Cali, I A; Chan, M; Dutta, V; Gomez Ceballos, G; Goncharov, M; Kim, Y; Klute, M; Levin, A; Luckey, P D; Ma, T; Nahn, S; Paus, C; Ralph, D; Roland, C; Roland, G; Stephans, G S F; Stöckli, F; Sumorok, K; Sung, K; Velicanu, D; Wolf, R; Wyslouch, B; Yang, M; Yilmaz, Y; Yoon, A S; Zanetti, M; Zhukova, V; Dahmes, B; De Benedetti, A; Franzoni, G; Gude, A; Haupt, J; Kao, S C; Klapoetke, K; Kubota, Y; Mans, J; Pastika, N; Rusack, R; Sasseville, M; Singovsky, A; Tambe, N; Turkewitz, J; Cremaldi, L M; Kroeger, R; Perera, L; Rahmat, R; Sanders, D A; Summers, D; Avdeeva, E; Bloom, K; Bose, S; Claes, D R; Dominguez, A; Eads, M; Gonzalez Suarez, R; Keller, J; Kravchenko, I; Lazo-Flores, J; Malik, S; Snow, G R; Dolen, J; Godshalk, A; Iashvili, I; Jain, S; Kharchilava, A; Kumar, A; Rappoccio, S; Wan, Z; Alverson, G; Barberis, E; Baumgartel, D; Chasco, M; Haley, J; Nash, D; Orimoto, T; Trocino, D; Wood, D; Zhang, J; Anastassov, A; Hahn, K A; Kubik, A; Lusito, L; Mucia, N; Odell, N; Pollack, B; Pozdnyakov, A; Schmitt, M; Stoynev, S; Velasco, M; Won, S; Berry, D; Brinkerhoff, A; Chan, K M; Hildreth, M; Jessop, C; Karmgard, D J; Kolb, J; Lannon, K; Luo, W; Lynch, S; Marinelli, N; Morse, D M; Pearson, T; Planer, M; Ruchti, R; Slaunwhite, J; Valls, N; Wayne, M; Wolf, M; Antonelli, L; Bylsma, B; Durkin, L S; Hill, C; Hughes, R; Kotov, K; Ling, T Y; Puigh, D; Rodenburg, M; Smith, G; Vuosalo, C; Williams, G; Winer, B L; Wolfe, H; Berry, E; Elmer, P; Halyo, V; Hebda, P; Hegeman, J; Hunt, A; Jindal, P; Koay, S A; Lopes Pegna, D; Lujan, P; Marlow, D; Medvedeva, T; Mooney, M; Olsen, J; Piroué, P; Quan, X; Raval, A; Saka, H; Stickland, D; Tully, C; Werner, J S; Zenz, S C; Zuranski, A; Brownson, E; Lopez, A; Mendez, H; Ramirez Vargas, J E; Alagoz, E; Benedetti, D; Bolla, G; Bortoletto, D; De Mattia, M; Everett, A; Hu, Z; Jones, M; Koybasi, O; Kress, M; Leonardo, N; Maroussov, V; Merkel, P; Miller, D H; Neumeister, N; Shipsey, I; Silvers, D; Svyatkovskiy, A; Vidal Marono, M; Yoo, H D; Zablocki, J; Zheng, Y; Guragain, S; Parashar, N; Adair, A; Akgun, B; Ecklund, K M; Geurts, F J M; Li, W; Padley, B P; Redjimi, R; Roberts, J; Zabel, J; Betchart, B; Bodek, A; Covarelli, R; de Barbaro, P; Demina, R; Eshaq, Y; Ferbel, T; Garcia-Bellido, A; Goldenzweig, P; Han, J; Harel, A; Miner, D C; Petrillo, G; Vishnevskiy, D; Zielinski, M; Bhatti, A; Ciesielski, R; Demortier, L; Goulianos, K; Lungu, G; Malik, S; Mesropian, C; Arora, S; Barker, A; Chou, J P; Contreras-Campana, C; Contreras-Campana, E; Duggan, D; Ferencek, D; Gershtein, Y; Gray, R; Halkiadakis, E; Hidas, D; Lath, A; Panwalkar, S; Park, M; Patel, R; Rekovic, V; Robles, J; Rose, K; Salur, S; Schnetzer, S; Seitz, C; Somalwar, S; Stone, R; Walker, M; Cerizza, G; Hollingsworth, M; Spanier, S; Yang, Z C; York, A; Eusebi, R; Flanagan, W; Gilmore, J; Kamon, T; Khotilovich, V; Montalvo, R; Osipenkov, I; Pakhotin, Y; Perloff, A; Roe, J; Safonov, A; Sakuma, T; Suarez, I; Tatarinov, A; Toback, D; Akchurin, N; Damgov, J; Dragoiu, C; Dudero, P R; Jeong, C; Kovitanggoon, K; Lee, S W; Libeiro, T; Volobouev, I; Appelt, E; Delannoy, A G; Greene, S; Gurrola, A; Johns, W; Maguire, C; Mao, Y; Melo, A; Sharma, M; Sheldon, P; Snook, B; Tuo, S; Velkovska, J; Arenton, M W; Balazs, M; Boutle, S; Cox, B; Francis, B; Goodell, J; Hirosky, R; Ledovskoy, A; Lin, C; Neu, C; Wood, J; Gollapinni, S; Harr, R; Karchin, P E; Kottachchi Kankanamge Don, C; Lamichhane, P; Sakharov, A; Anderson, M; Belknap, D A; Borrello, L; Carlsmith, D; Cepeda, M; Dasu, S; Friis, E; Grogg, K S; Grothe, M; Hall-Wilton, R; Herndon, M; Hervé, A; Klabbers, P; Klukas, J; Lanaro, A; Lazaridis, C; Loveless, R; Mohapatra, A; Mozer, M U; Ojalvo, I; Pierro, G A; Ross, I; Savin, A; Smith, W H; Swanson, J

A search for a standard-model-like Higgs boson in the H→WW and H→ZZ decay channels is reported, for Higgs boson masses in the range 145< m H <1000 GeV. The search is based upon proton-proton collision data samples corresponding to an integrated luminosity of up to 5.1 fb -1 at [Formula: see text] and up to 5.3 fb -1 at [Formula: see text], recorded by the CMS experiment at the LHC. The combined upper limits at 95 % confidence level on products of the cross section and branching fractions exclude a standard-model-like Higgs boson in the range 145< m H <710 GeV, thus extending the mass region excluded by CMS from 127-600 GeV up to 710 GeV.

The benefits of adaptive parametrization in multi-objective Tabu Search optimization

NASA Astrophysics Data System (ADS)

Ghisu, Tiziano; Parks, Geoffrey T.; Jaeggi, Daniel M.; Jarrett, Jerome P.; Clarkson, P. John

2010-10-01

In real-world optimization problems, large design spaces and conflicting objectives are often combined with a large number of constraints, resulting in a highly multi-modal, challenging, fragmented landscape. The local search at the heart of Tabu Search, while being one of its strengths in highly constrained optimization problems, requires a large number of evaluations per optimization step. In this work, a modification of the pattern search algorithm is proposed: this modification, based on a Principal Components' Analysis of the approximation set, allows both a re-alignment of the search directions, thereby creating a more effective parametrization, and also an informed reduction of the size of the design space itself. These changes make the optimization process more computationally efficient and more effective - higher quality solutions are identified in fewer iterations. These advantages are demonstrated on a number of standard analytical test functions (from the ZDT and DTLZ families) and on a real-world problem (the optimization of an axial compressor preliminary design).

Automated Patent Searching in the EPO: From Online Searching to Document Delivery.

ERIC Educational Resources Information Center

Nuyts, Annemie; Jonckheere, Charles

The European Patent Office (EPO) has recently implemented the last part of its ambitious automation project aimed at creating an automated search environment for approximately 1200 EPO patent search examiners. The examiners now have at their disposal an integrated set of tools offering a full range of functionalities from online searching, via…

Adaptive and Adaptable Automation Design: A Critical Review of the Literature and Recommendations for Future Research

NASA Technical Reports Server (NTRS)

Prinzel, Lawrence J., III; Kaber, David B.

2006-01-01

This report presents a review of literature on approaches to adaptive and adaptable task/function allocation and adaptive interface technologies for effective human management of complex systems that are likely to be issues for the Next Generation Air Transportation System, and a focus of research under the Aviation Safety Program, Integrated Intelligent Flight Deck Project. Contemporary literature retrieved from an online database search is summarized and integrated. The major topics include the effects of delegation-type, adaptable automation on human performance, workload and situation awareness, the effectiveness of various automation invocation philosophies and strategies to function allocation in adaptive systems, and the role of user modeling in adaptive interface design and the performance implications of adaptive interface technology.

Coping and adaptation process during puerperium

PubMed Central

Muñoz de Rodríguez, Lucy; Ruiz de Cárdenas, Carmen Helena

2012-01-01

Introduction: The puerperium is a stage that produces changes and adaptations in women, couples and family. Effective coping, during this stage, depends on the relationship between the demands of stressful or difficult situations and the recourses that the puerperal individual has. Roy (2004), in her Middle Range Theory about the Coping and Adaptation Processing, defines Coping as the ''behavioral and cognitive efforts that a person makes to meet the environment demands''. For the puerperal individual, the correct coping is necessary to maintain her physical and mental well being, especially against situations that can be stressful like breastfeeding and return to work. According to Lazarus and Folkman (1986), a resource for coping is to have someone who receives emotional support, informative and / or tangible. Objective: To review the issue of women coping and adaptation during the puerperium stage and the strategies that enhance this adaptation. Methods: search and selection of database articles: Cochrane, Medline, Ovid, ProQuest, Scielo, and Blackwell Synergy. Other sources: unpublished documents by Roy, published books on Roy´s Model, Websites from of international health organizations. Results: the need to recognize the puerperium as a stage that requires comprehensive care is evident, where nurses must be protagonist with the care offered to women and their families, considering the specific demands of this situation and recourses that promote effective coping and the family, education and health services. PMID:24893059

Search and dissemination in data processing. [searches performed for Aviation Technology Newsletter

NASA Technical Reports Server (NTRS)

Gold, C. H.; Moore, A. M.; Dodd, B.; Dittmar, V.

1974-01-01

Manual retrieval methods were used to complete 54 searches of interest for the General Aviation Newsletter. Subjects of search ranged from television transmission to machine tooling, Apollo moon landings, electronic equipment, and aerodynamics studies.

Attributional Search and Concern about the Future Following Smoking Cessation Treatment.

ERIC Educational Resources Information Center

Schoeneman, Thomas J.; And Others

Some research on attribution processes has suggested that attributional search is exploratory behavior that serves adaptation and mastery motives. This study was conducted to investigate attributional search in reactions to success and failure after quitting smoking, to look for antecedents of attributional search other than expectancy and…

Wide-Range Motion Estimation Architecture with Dual Search Windows for High Resolution Video Coding

NASA Astrophysics Data System (ADS)

Dung, Lan-Rong; Lin, Meng-Chun

This paper presents a memory-efficient motion estimation (ME) technique for high-resolution video compression. The main objective is to reduce the external memory access, especially for limited local memory resource. The reduction of memory access can successfully save the notorious power consumption. The key to reduce the memory accesses is based on center-biased algorithm in that the center-biased algorithm performs the motion vector (MV) searching with the minimum search data. While considering the data reusability, the proposed dual-search-windowing (DSW) approaches use the secondary windowing as an option per searching necessity. By doing so, the loading of search windows can be alleviated and hence reduce the required external memory bandwidth. The proposed techniques can save up to 81% of external memory bandwidth and require only 135 MBytes/sec, while the quality degradation is less than 0.2dB for 720p HDTV clips coded at 8Mbits/sec.

A spin transfer torque magnetoresistance random access memory-based high-density and ultralow-power associative memory for fully data-adaptive nearest neighbor search with current-mode similarity evaluation and time-domain minimum searching

NASA Astrophysics Data System (ADS)

Ma, Yitao; Miura, Sadahiko; Honjo, Hiroaki; Ikeda, Shoji; Hanyu, Takahiro; Ohno, Hideo; Endoh, Tetsuo

2017-04-01

A high-density nonvolatile associative memory (NV-AM) based on spin transfer torque magnetoresistive random access memory (STT-MRAM), which achieves highly concurrent and ultralow-power nearest neighbor search with full adaptivity of the template data format, has been proposed and fabricated using the 90 nm CMOS/70 nm perpendicular-magnetic-tunnel-junction hybrid process. A truly compact current-mode circuitry is developed to realize flexibly controllable and high-parallel similarity evaluation, which makes the NV-AM adaptable to any dimensionality and component-bit of template data. A compact dual-stage time-domain minimum searching circuit is also developed, which can freely extend the system for more template data by connecting multiple NM-AM cores without additional circuits for integrated processing. Both the embedded STT-MRAM module and the computing circuit modules in this NV-AM chip are synchronously power-gated to completely eliminate standby power and maximally reduce operation power by only activating the currently accessed circuit blocks. The operations of a prototype chip at 40 MHz are demonstrated by measurement. The average operation power is only 130 µW, and the circuit density is less than 11 µm2/bit. Compared with the latest conventional works in both volatile and nonvolatile approaches, more than 31.3% circuit area reductions and 99.2% power improvements are achieved, respectively. Further power performance analyses are discussed, which verify the special superiority of the proposed NV-AM in low-power and large-memory-based VLSIs.

Supplementary searches of PubMed to improve currency of MEDLINE and MEDLINE In-Process searches via Ovid.

PubMed

Duffy, Steven; de Kock, Shelley; Misso, Kate; Noake, Caro; Ross, Janine; Stirk, Lisa

2016-10-01

The research investigated whether conducting a supplementary search of PubMed in addition to the main MEDLINE (Ovid) search for a systematic review is worthwhile and to ascertain whether this PubMed search can be conducted quickly and if it retrieves unique, recently published, and ahead-of-print studies that are subsequently considered for inclusion in the final systematic review. Searches of PubMed were conducted after MEDLINE (Ovid) and MEDLINE In-Process (Ovid) searches had been completed for seven recent reviews. The searches were limited to records not in MEDLINE or MEDLINE In-Process (Ovid). Additional unique records were identified for all of the investigated reviews. Search strategies were adapted quickly to run in PubMed, and reviewer screening of the results was not time consuming. For each of the investigated reviews, studies were ordered for full screening; in six cases, studies retrieved from the supplementary PubMed searches were included in the final systematic review. Supplementary searching of PubMed for studies unavailable elsewhere is worthwhile and improves the currency of the systematic reviews.

Supplementary searches of PubMed to improve currency of MEDLINE and MEDLINE In-Process searches via Ovid

PubMed Central

Duffy, Steven; de Kock, Shelley; Misso, Kate; Noake, Caro; Ross, Janine; Stirk, Lisa

2016-01-01

Objective The research investigated whether conducting a supplementary search of PubMed in addition to the main MEDLINE (Ovid) search for a systematic review is worthwhile and to ascertain whether this PubMed search can be conducted quickly and if it retrieves unique, recently published, and ahead-of-print studies that are subsequently considered for inclusion in the final systematic review. Methods Searches of PubMed were conducted after MEDLINE (Ovid) and MEDLINE In-Process (Ovid) searches had been completed for seven recent reviews. The searches were limited to records not in MEDLINE or MEDLINE In-Process (Ovid). Results Additional unique records were identified for all of the investigated reviews. Search strategies were adapted quickly to run in PubMed, and reviewer screening of the results was not time consuming. For each of the investigated reviews, studies were ordered for full screening; in six cases, studies retrieved from the supplementary PubMed searches were included in the final systematic review. Conclusion Supplementary searching of PubMed for studies unavailable elsewhere is worthwhile and improves the currency of the systematic reviews. PMID:27822154

Adaptations to Climate-Mediated Selective Pressures in Sheep

PubMed Central

Lv, Feng-Hua; Agha, Saif; Kantanen, Juha; Colli, Licia; Stucki, Sylvie; Kijas, James W.; Joost, Stéphane; Li, Meng-Hua; Ajmone Marsan, Paolo

2014-01-01

Following domestication, sheep (Ovis aries) have become essential farmed animals across the world through adaptation to a diverse range of environments and varied production systems. Climate-mediated selective pressure has shaped phenotypic variation and has left genetic “footprints” in the genome of breeds raised in different agroecological zones. Unlike numerous studies that have searched for evidence of selection using only population genetics data, here, we conducted an integrated coanalysis of environmental data with single nucleotide polymorphism (SNP) variation. By examining 49,034 SNPs from 32 old, autochthonous sheep breeds that are adapted to a spectrum of different regional climates, we identified 230 SNPs with evidence for selection that is likely due to climate-mediated pressure. Among them, 189 (82%) showed significant correlation (P ≤ 0.05) between allele frequency and climatic variables in a larger set of native populations from a worldwide range of geographic areas and climates. Gene ontology analysis of genes colocated with significant SNPs identified 17 candidates related to GTPase regulator and peptide receptor activities in the biological processes of energy metabolism and endocrine and autoimmune regulation. We also observed high linkage disequilibrium and significant extended haplotype homozygosity for the core haplotype TBC1D12-CH1 of TBC1D12. The global frequency distribution of the core haplotype and allele OAR22_18929579-A showed an apparent geographic pattern and significant (P ≤ 0.05) correlations with climatic variation. Our results imply that adaptations to local climates have shaped the spatial distribution of some variants that are candidates to underpin adaptive variation in sheep. PMID:25249477

Adaptations to Climate-Mediated Selective Pressures in Humans

PubMed Central

Hancock, Angela M.; Witonsky, David B.; Alkorta-Aranburu, Gorka; Beall, Cynthia M.; Gebremedhin, Amha; Sukernik, Rem; Utermann, Gerd; Pritchard, Jonathan K.; Coop, Graham; Di Rienzo, Anna

2011-01-01

Humans inhabit a remarkably diverse range of environments, and adaptation through natural selection has likely played a central role in the capacity to survive and thrive in extreme climates. Unlike numerous studies that used only population genetic data to search for evidence of selection, here we scan the human genome for selection signals by identifying the SNPs with the strongest correlations between allele frequencies and climate across 61 worldwide populations. We find a striking enrichment of genic and nonsynonymous SNPs relative to non-genic SNPs among those that are strongly correlated with these climate variables. Among the most extreme signals, several overlap with those from GWAS, including SNPs associated with pigmentation and autoimmune diseases. Further, we find an enrichment of strong signals in gene sets related to UV radiation, infection and immunity, and cancer. Our results imply that adaptations to climate shaped the spatial distribution of variation in humans. PMID:21533023

Automatic guidance of attention during real-world visual search

PubMed Central

Seidl-Rathkopf, Katharina N.; Turk-Browne, Nicholas B.; Kastner, Sabine

2015-01-01

Looking for objects in cluttered natural environments is a frequent task in everyday life. This process can be difficult, as the features, locations, and times of appearance of relevant objects are often not known in advance. A mechanism by which attention is automatically biased toward information that is potentially relevant may thus be helpful. Here we tested for such a mechanism across five experiments by engaging participants in real-world visual search and then assessing attentional capture for information that was related to the search set but was otherwise irrelevant. Isolated objects captured attention while preparing to search for objects from the same category embedded in a scene, as revealed by lower detection performance (Experiment 1A). This capture effect was driven by a central processing bottleneck rather than the withdrawal of spatial attention (Experiment 1B), occurred automatically even in a secondary task (Experiment 2A), and reflected enhancement of matching information rather than suppression of non-matching information (Experiment 2B). Finally, attentional capture extended to objects that were semantically associated with the target category (Experiment 3). We conclude that attention is efficiently drawn towards a wide range of information that may be relevant for an upcoming real-world visual search. This mechanism may be adaptive, allowing us to find information useful for our behavioral goals in the face of uncertainty. PMID:25898897

Automatic guidance of attention during real-world visual search.

PubMed

Seidl-Rathkopf, Katharina N; Turk-Browne, Nicholas B; Kastner, Sabine

2015-08-01

Looking for objects in cluttered natural environments is a frequent task in everyday life. This process can be difficult, because the features, locations, and times of appearance of relevant objects often are not known in advance. Thus, a mechanism by which attention is automatically biased toward information that is potentially relevant may be helpful. We tested for such a mechanism across five experiments by engaging participants in real-world visual search and then assessing attentional capture for information that was related to the search set but was otherwise irrelevant. Isolated objects captured attention while preparing to search for objects from the same category embedded in a scene, as revealed by lower detection performance (Experiment 1A). This capture effect was driven by a central processing bottleneck rather than the withdrawal of spatial attention (Experiment 1B), occurred automatically even in a secondary task (Experiment 2A), and reflected enhancement of matching information rather than suppression of nonmatching information (Experiment 2B). Finally, attentional capture extended to objects that were semantically associated with the target category (Experiment 3). We conclude that attention is efficiently drawn towards a wide range of information that may be relevant for an upcoming real-world visual search. This mechanism may be adaptive, allowing us to find information useful for our behavioral goals in the face of uncertainty.

Quantitative analysis of terahertz spectra for illicit drugs using adaptive-range micro-genetic algorithm

NASA Astrophysics Data System (ADS)

Chen, Yi; Ma, Yong; Lu, Zheng; Peng, Bei; Chen, Qin

2011-08-01

In the field of anti-illicit drug applications, many suspicious mixture samples might consist of various drug components—for example, a mixture of methamphetamine, heroin, and amoxicillin—which makes spectral identification very difficult. A terahertz spectroscopic quantitative analysis method using an adaptive range micro-genetic algorithm with a variable internal population (ARVIPɛμGA) has been proposed. Five mixture cases are discussed using ARVIPɛμGA driven quantitative terahertz spectroscopic analysis in this paper. The devised simulation results show agreement with the previous experimental results, which suggested that the proposed technique has potential applications for terahertz spectral identifications of drug mixture components. The results show agreement with the results obtained using other experimental and numerical techniques.

Is Interpersonal Psychotherapy Infinitely Adaptable? A Compendium of the Multiple Modifications of IPT

PubMed Central

FRANK, ELLEN; RITCHEY, FIONA C.; LEVENSON, JESSICA C.

2015-01-01

We employed standard literature search techniques and surveyed participants on the International Society for Interpersonal Psychotherapy listserve (isipt-list@googlegroups.com) to catalogue the multiple and highly creative ways in which Klerman’s and Weissman’s original concept of interpersonal psychotherapy (IPT) has been modified to meet the needs of a vast range of patient populations. Focusing first on adaptations of the individual treatment model for subgroups of adult patients, we next describe further adaptations of four major off-shoots of IPT: interpersonal counseling (IPC), IPT for adolescents (IPT-A), group IPT (IPT-G) and most recently, brief IPT (IPT-B). We then discuss IPT “in-laws,” those treatments that have married IPT with of other forms of psychotherapy for patients with bipolar disorder, panic symptomatology, and substance abuse. We conclude with that although there have been myriad successful adaptations of IPT, there remain some conditions for which IPT adaptations have not been found to be efficacious. PMID:26453344

Axial range of conjugate adaptive optics in two-photon microscopy

PubMed Central

Paudel, Hari P.; Taranto, John; Mertz, Jerome; Bifano, Thomas

2015-01-01

We describe an adaptive optics technique for two-photon microscopy in which the deformable mirror used for aberration compensation is positioned in a plane conjugate to the plane of the aberration. We demonstrate in a proof-of-principle experiment that this technique yields a large field of view advantage in comparison to standard pupil-conjugate adaptive optics. Further, we show that the extended field of view in conjugate AO is maintained over a relatively large axial translation of the deformable mirror with respect to the conjugate plane. We conclude with a discussion of limitations and prospects for the conjugate AO technique in two-photon biological microscopy. PMID:26367938

Axial range of conjugate adaptive optics in two-photon microscopy.

PubMed

Paudel, Hari P; Taranto, John; Mertz, Jerome; Bifano, Thomas

2015-08-10

We describe an adaptive optics technique for two-photon microscopy in which the deformable mirror used for aberration compensation is positioned in a plane conjugate to the plane of the aberration. We demonstrate in a proof-of-principle experiment that this technique yields a large field of view advantage in comparison to standard pupil-conjugate adaptive optics. Further, we show that the extended field of view in conjugate AO is maintained over a relatively large axial translation of the deformable mirror with respect to the conjugate plane. We conclude with a discussion of limitations and prospects for the conjugate AO technique in two-photon biological microscopy.

Complex adaptive systems and their relevance for nursing: An evolutionary concept analysis.

PubMed

Notarnicola, Ippolito; Petrucci, Cristina; De Jesus Barbosa, Maria Rosimar; Giorgi, Fabio; Stievano, Alessandro; Rocco, Gennaro; Lancia, Loreto

2017-06-01

This study aimed to analyse the concept of "complex adaptive systems." The construct is still nebulous in the literature, and a further explanation of the idea is needed to have a shared knowledge of it. A concept analysis was conducted utilizing Rodgers evolutionary method. The inclusive years of bibliographic search started from 2005 to 2015. The search was conducted at PubMed©, CINAHL© (EBSCO host©), Scopus©, Web of Science©, and Academic Search Premier©. Retrieved papers were critically analysed to explore the attributes, antecedents, and consequences of the concept. Moreover, surrogates, related terms, and a pattern recognition scheme were identified. The concept analysis showed that complex systems are adaptive and have the ability to process information. They can adapt to the environment and consequently evolve. Nursing is a complex adaptive system, and the nursing profession in practice exhibits complex adaptive system characteristics. Complexity science through complex adaptive systems provides new ways of seeing and understanding the mechanisms that underpin the nursing profession. © 2017 John Wiley & Sons Australia, Ltd.

Searching for the Haplorrhine Heterotherm: Field and Laboratory Data of Free-Ranging Tarsiers

PubMed Central

Welman, Shaun; Tuen, Andrew A.; Lovegrove, Barry G.

2017-01-01

The observation of heterothermy in a single suborder (Strepsirrhini) only within the primates is puzzling. Given that the placental-mammal ancestor was likely a heterotherm, we explored the potential for heterothermy in a primate closely related to the Strepsirrhini. Based upon phylogeny, body size and habitat stability since the Late Eocene, we selected western tarsiers (Cephalopachus bancanus) from the island of Borneo. Being the sister clade to Strepsirrhini and basal in Haplorrhini (monkeys and apes), we hypothesized that C. bancanus might have retained the heterothermic capacity observed in several small strepsirrhines. We measured resting metabolic rate, subcutaneous temperature, evaporative water loss and the percentage of heat dissipated through evaporation, at ambient temperatures between 22 and 35°C in fresh-caught wild animals (126.1 ± 2.4 g). We also measured core body temperatures in free-ranging animals. The thermoneutral zone was 25–30°C and the basal metabolic rate was 3.52 ± 0.06 W.kg−1 (0.65 ± 0.01 ml O2.g−1.h−1). There was no evidence of adaptive heterothermy in either the laboratory data or the free-ranging data. Instead, animals appeared to be cold sensitive (Tb ~ 31°C) at the lowest temperatures. We discuss possible reasons for the apparent lack of heterothermy in tarsiers, and identify putative heterotherms within Platyrrhini. We also document our concern for the vulnerability of C. bancanus to future temperature increases associated with global warming. PMID:29018365

Genome-wide signatures of flowering adaptation to climate temperature: Regional analyses in a highly diverse native range of Arabidopsis thaliana.

PubMed

Tabas-Madrid, Daniel; Méndez-Vigo, Belén; Arteaga, Noelia; Marcer, Arnald; Pascual-Montano, Alberto; Weigel, Detlef; Xavier Picó, F; Alonso-Blanco, Carlos

2018-03-08

Current global change is fueling an interest to understand the genetic and molecular mechanisms of plant adaptation to climate. In particular, altered flowering time is a common strategy for escape from unfavourable climate temperature. In order to determine the genomic bases underlying flowering time adaptation to this climatic factor, we have systematically analysed a collection of 174 highly diverse Arabidopsis thaliana accessions from the Iberian Peninsula. Analyses of 1.88 million single nucleotide polymorphisms provide evidence for a spatially heterogeneous contribution of demographic and adaptive processes to geographic patterns of genetic variation. Mountains appear to be allele dispersal barriers, whereas the relationship between flowering time and temperature depended on the precise temperature range. Environmental genome-wide associations supported an overall genome adaptation to temperature, with 9.4% of the genes showing significant associations. Furthermore, phenotypic genome-wide associations provided a catalogue of candidate genes underlying flowering time variation. Finally, comparison of environmental and phenotypic genome-wide associations identified known (Twin Sister of FT, FRIGIDA-like 1, and Casein Kinase II Beta chain 1) and new (Epithiospecifer Modifier 1 and Voltage-Dependent Anion Channel 5) genes as candidates for adaptation to climate temperature by altered flowering time. Thus, this regional collection provides an excellent resource to address the spatial complexity of climate adaptation in annual plants. © 2018 John Wiley & Sons Ltd.

Adaptive building skin structures

NASA Astrophysics Data System (ADS)

Del Grosso, A. E.; Basso, P.

2010-12-01

The concept of adaptive and morphing structures has gained considerable attention in the recent years in many fields of engineering. In civil engineering very few practical applications are reported to date however. Non-conventional structural concepts like deployable, inflatable and morphing structures may indeed provide innovative solutions to some of the problems that the construction industry is being called to face. To give some examples, searches for low-energy consumption or even energy-harvesting green buildings are amongst such problems. This paper first presents a review of the above problems and technologies, which shows how the solution to these problems requires a multidisciplinary approach, involving the integration of architectural and engineering disciplines. The discussion continues with the presentation of a possible application of two adaptive and dynamically morphing structures which are proposed for the realization of an acoustic envelope. The core of the two applications is the use of a novel optimization process which leads the search for optimal solutions by means of an evolutionary technique while the compatibility of the resulting configurations of the adaptive envelope is ensured by the virtual force density method.

When is a search not a search? A comparison of searching the AMED complementary health database via EBSCOhost, OVID and DIALOG.

PubMed

Younger, Paula; Boddy, Kate

2009-06-01

The researchers involved in this study work at Exeter Health library and at the Complementary Medicine Unit, Peninsula School of Medicine and Dentistry (PCMD). Within this collaborative environment it is possible to access the electronic resources of three institutions. This includes access to AMED and other databases using different interfaces. The aim of this study was to investigate whether searching different interfaces to the AMED allied health and complementary medicine database produced the same results when using identical search terms. The following Internet-based AMED interfaces were searched: DIALOG DataStar; EBSCOhost and OVID SP_UI01.00.02. Search results from all three databases were saved in an endnote database to facilitate analysis. A checklist was also compiled comparing interface features. In our initial search, DIALOG returned 29 hits, OVID 14 and Ebsco 8. If we assume that DIALOG returned 100% of potential hits, OVID initially returned only 48% of hits and EBSCOhost only 28%. In our search, a researcher using the Ebsco interface to carry out a simple search on AMED would miss over 70% of possible search hits. Subsequent EBSCOhost searches on different subjects failed to find between 21 and 86% of the hits retrieved using the same keywords via DIALOG DataStar. In two cases, the simple EBSCOhost search failed to find any of the results found via DIALOG DataStar. Depending on the interface, the number of hits retrieved from the same database with the same simple search can vary dramatically. Some simple searches fail to retrieve a substantial percentage of citations. This may result in an uninformed literature review, research funding application or treatment intervention. In addition to ensuring that keywords, spelling and medical subject headings (MeSH) accurately reflect the nature of the search, database users should include wildcards and truncation and adapt their search strategy substantially to retrieve the maximum number of appropriate

Genetic algorithms in adaptive fuzzy control

NASA Technical Reports Server (NTRS)

Karr, C. Lucas; Harper, Tony R.

1992-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust fuzzy membership functions in response to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific computer-simulated chemical system is used to demonstrate the ideas presented.

Fixing Dataset Search

NASA Technical Reports Server (NTRS)

Lynnes, Chris

2014-01-01

Three current search engines are queried for ozone data at the GES DISC. The results range from sub-optimal to counter-intuitive. We propose a method to fix dataset search by implementing a robust relevancy ranking scheme. The relevancy ranking scheme is based on several heuristics culled from more than 20 years of helping users select datasets.

Hyper-heuristics with low level parameter adaptation.

PubMed

Ren, Zhilei; Jiang, He; Xuan, Jifeng; Luo, Zhongxuan

2012-01-01

Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adaptively maintaining the LLPs for two hyper-heuristic models. Furthermore, aiming at tackling the search space expansion due to the LLP adaptation, we apply a heuristic space reduction (SAR) mechanism to improve the AD-HH framework. The integration of the LLP adaptation and the SAR mechanism is able to explore the heuristic space more effectively and efficiently. To evaluate the performance of the proposed algorithms, we choose the p-median problem as a case study. The empirical results show that with the adaptation of the LLPs and the SAR mechanism, the proposed algorithms are able to achieve competitive results over the three heterogeneous classes of benchmark instances.

Adaptations to climate-mediated selective pressures in sheep.

PubMed

Lv, Feng-Hua; Agha, Saif; Kantanen, Juha; Colli, Licia; Stucki, Sylvie; Kijas, James W; Joost, Stéphane; Li, Meng-Hua; Ajmone Marsan, Paolo

2014-12-01

Following domestication, sheep (Ovis aries) have become essential farmed animals across the world through adaptation to a diverse range of environments and varied production systems. Climate-mediated selective pressure has shaped phenotypic variation and has left genetic "footprints" in the genome of breeds raised in different agroecological zones. Unlike numerous studies that have searched for evidence of selection using only population genetics data, here, we conducted an integrated coanalysis of environmental data with single nucleotide polymorphism (SNP) variation. By examining 49,034 SNPs from 32 old, autochthonous sheep breeds that are adapted to a spectrum of different regional climates, we identified 230 SNPs with evidence for selection that is likely due to climate-mediated pressure. Among them, 189 (82%) showed significant correlation (P ≤ 0.05) between allele frequency and climatic variables in a larger set of native populations from a worldwide range of geographic areas and climates. Gene ontology analysis of genes colocated with significant SNPs identified 17 candidates related to GTPase regulator and peptide receptor activities in the biological processes of energy metabolism and endocrine and autoimmune regulation. We also observed high linkage disequilibrium and significant extended haplotype homozygosity for the core haplotype TBC1D12-CH1 of TBC1D12. The global frequency distribution of the core haplotype and allele OAR22_18929579-A showed an apparent geographic pattern and significant (P ≤ 0.05) correlations with climatic variation. Our results imply that adaptations to local climates have shaped the spatial distribution of some variants that are candidates to underpin adaptive variation in sheep. © The Author 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Children's sequential information search is sensitive to environmental probabilities.

PubMed

Nelson, Jonathan D; Divjak, Bojana; Gudmundsdottir, Gudny; Martignon, Laura F; Meder, Björn

2014-01-01

We investigated 4th-grade children's search strategies on sequential search tasks in which the goal is to identify an unknown target object by asking yes-no questions about its features. We used exhaustive search to identify the most efficient question strategies and evaluated the usefulness of children's questions accordingly. Results show that children have good intuitions regarding questions' usefulness and search adaptively, relative to the statistical structure of the task environment. Search was especially efficient in a task environment that was representative of real-world experiences. This suggests that children may use their knowledge of real-world environmental statistics to guide their search behavior. We also compared different related search tasks. We found positive transfer effects from first doing a number search task on a later person search task. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

A very low number of national adaptations of the World Health Organization guidelines for HIV and tuberculosis reported their processes.

PubMed

Godah, Mohammad W; Abdul Khalek, Rima A; Kilzar, Lama; Zeid, Hiba; Nahlawi, Acile; Lopes, Luciane Cruz; Darzi, Andrea J; Schünemann, Holger J; Akl, Elie A

2016-12-01

Low- and middle-income countries adapt World Health Organization (WHO) guidelines instead of de novo development for financial, epidemiologic, sociopolitical, cultural, organizational, and other reasons. To systematically evaluate reported processes used in the adaptation of WHO guidelines for human immunodeficiency virus (HIV) and tuberculosis (TB). We searched three online databases/repositories: United States Agency for International Development (USAID) AIDS Support and Technical Resources - Sector One program (AIDSTAR-One) National Treatment Database; the AIDSspace Guideline Repository, and WHO Database of national HIV and TB guidelines. We assessed the rigor and quality of reported adaptation methodology using the ADAPTE process as benchmark. Of 170 eligible guidelines, only 32 (19%) reported documentation on the adaptation process. The median and interquartile range of the number of ADAPTE steps fulfilled by the eligible guidelines were 11.5 (10, 13.5) (out of 23 steps). The number of guidelines (out of 32 steps) fulfilling each ADAPTE step was 18 (interquartile range, 5-27). Seventeen of 32 guidelines (53%) met all steps relevant to the setup phase, whereas none met all steps relevant to the adaptation phase. The number of well-documented adaptation methodologies in national HIV and/or TB guidelines is very low. There is a need for the use of standardized and systematic framework for guideline adaptation and improved reporting of processes used. Copyright © 2016 Elsevier Inc. All rights reserved.

Cube search, revisited.

PubMed

Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

2015-03-16

Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with "equivalent" 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. © 2015 ARVO.

Cube search, revisited

PubMed Central

Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

2015-01-01

Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

Climate adaptation planning in practice: an evaluation of adaptation plans from three developed nations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Preston, Benjamin L; Westaway, Richard M.; Yuen, Emma J.

2011-04-01

Formal planning for climate change adaptation is emerging rapidly at a range of geo-political scales. This first generation of adaptation plans provides useful information regarding how institutions are framing the issue of adaptation and the range of processes that are recognized as being part of an adaptation response. To better understand adaptation planning among developed nations, a set of 57 adaptation plans from Australia, the United Kingdom and the United States was evaluated against a suite of 19 planning processes identified from existing guidance instruments for adaptation planning. Total scores among evaluated plans ranged from 16% of the maximum possiblemore » score to 61%, with an average of 37%. These results suggest adaptation plans are largely under-developed. Critical weaknesses in adaptation planning are related to limited consideration for non-climatic factors as well as neglect for issues of adaptive capacity including entitlements to various forms of capital needed for effective adaptation. Such gaps in planning suggest there are opportunities for institutions to make better use of existing guidance for adaptation planning and the need to consider the broader governance context in which adaptation will occur. In addition, the adaptation options prescribed by adaptation plans reflect a preferential bias toward low-risk capacity-building (72% of identified options) over the delivery of specific actions to reduce vulnerability. To the extent these findings are representative of the state of developed nation adaptation planning, there appear to be significant deficiencies in climate change preparedness, even among those nations often assumed to have the greatest adaptive capacity.« less

Improved laser-based triangulation sensor with enhanced range and resolution through adaptive optics-based active beam control.

PubMed

Reza, Syed Azer; Khwaja, Tariq Shamim; Mazhar, Mohsin Ali; Niazi, Haris Khan; Nawab, Rahma

2017-07-20

Various existing target ranging techniques are limited in terms of the dynamic range of operation and measurement resolution. These limitations arise as a result of a particular measurement methodology, the finite processing capability of the hardware components deployed within the sensor module, and the medium through which the target is viewed. Generally, improving the sensor range adversely affects its resolution and vice versa. Often, a distance sensor is designed for an optimal range/resolution setting depending on its intended application. Optical triangulation is broadly classified as a spatial-signal-processing-based ranging technique and measures target distance from the location of the reflected spot on a position sensitive detector (PSD). In most triangulation sensors that use lasers as a light source, beam divergence-which severely affects sensor measurement range-is often ignored in calculations. In this paper, we first discuss in detail the limitations to ranging imposed by beam divergence, which, in effect, sets the sensor dynamic range. Next, we show how the resolution of laser-based triangulation sensors is limited by the interpixel pitch of a finite-sized PSD. In this paper, through the use of tunable focus lenses (TFLs), we propose a novel design of a triangulation-based optical rangefinder that improves both the sensor resolution and its dynamic range through adaptive electronic control of beam propagation parameters. We present the theory and operation of the proposed sensor and clearly demonstrate a range and resolution improvement with the use of TFLs. Experimental results in support of our claims are shown to be in strong agreement with theory.

Design of high-performance adaptive objective lens with large optical depth scanning range for ultrabroad near infrared microscopic imaging

PubMed Central

Lan, Gongpu; Mauger, Thomas F.; Li, Guoqiang

2015-01-01

We report on the theory and design of adaptive objective lens for ultra broadband near infrared light imaging with large dynamic optical depth scanning range by using an embedded tunable lens, which can find wide applications in deep tissue biomedical imaging systems, such as confocal microscope, optical coherence tomography (OCT), two-photon microscopy, etc., both in vivo and ex vivo. This design is based on, but not limited to, a home-made prototype of liquid-filled membrane lens with a clear aperture of 8mm and the thickness of 2.55mm ~3.18mm. It is beneficial to have an adaptive objective lens which allows an extended depth scanning range larger than the focal length zoom range, since this will keep the magnification of the whole system, numerical aperture (NA), field of view (FOV), and resolution more consistent. To achieve this goal, a systematic theory is presented, for the first time to our acknowledgment, by inserting the varifocal lens in between a front and a back solid lens group. The designed objective has a compact size (10mm-diameter and 15mm-length), ultrabroad working bandwidth (760nm - 920nm), a large depth scanning range (7.36mm in air) — 1.533 times of focal length zoom range (4.8mm in air), and a FOV around 1mm × 1mm. Diffraction-limited performance can be achieved within this ultrabroad bandwidth through all the scanning depth (the resolution is 2.22 μm - 2.81 μm, calculated at the wavelength of 800nm with the NA of 0.214 - 0.171). The chromatic focal shift value is within the depth of focus (field). The chromatic difference in distortion is nearly zero and the maximum distortion is less than 0.05%. PMID:26417508

Localization Transition Induced by Learning in Random Searches

NASA Astrophysics Data System (ADS)

Falcón-Cortés, Andrea; Boyer, Denis; Giuggioli, Luca; Majumdar, Satya N.

2017-10-01

We solve an adaptive search model where a random walker or Lévy flight stochastically resets to previously visited sites on a d -dimensional lattice containing one trapping site. Because of reinforcement, a phase transition occurs when the resetting rate crosses a threshold above which nondiffusive stationary states emerge, localized around the inhomogeneity. The threshold depends on the trapping strength and on the walker's return probability in the memoryless case. The transition belongs to the same class as the self-consistent theory of Anderson localization. These results show that similarly to many living organisms and unlike the well-studied Markovian walks, non-Markov movement processes can allow agents to learn about their environment and promise to bring adaptive solutions in search tasks.

Age and self-relevance effects on information search during decision making.

PubMed

Hess, Thomas M; Queen, Tara L; Ennis, Gilda E

2013-09-01

We investigated how information search strategies used to support decision making were influenced by self-related implications of the task to the individual. Consistent with the notion of selective engagement, we hypothesized that increased self-relevance would result in more adaptive search behaviors and that this effect would be stronger in older adults than in younger adults. We examined search behaviors in 79 younger and 81 older adults using a process-tracing procedure with 2 different decision tasks. The impact of motivation (i.e., self-related task implications) was examined by manipulating social accountability and the age-related relevance of the task. Although age differences in search strategies were not great, older adults were more likely than younger adults to use simpler strategies in contexts with minimal self-implications. Contrary to expectations, young and old alike were more likely to use noncompensatory than compensatory strategies, even when engaged in systematic search, with education being the most important determinant of search behavior. The results support the notion that older adults are adaptive decision makers and that factors other than age may be more important determinants of performance in situations where knowledge can be used to support performance.

Adaptive Functioning in Williams Syndrome: A Systematic Review

ERIC Educational Resources Information Center

Brawn, Gabrielle; Porter, Melanie

2018-01-01

Literature on the level of adaptive functioning and relative strengths and weaknesses in functioning of individuals with Williams syndrome (WS) was reviewed. The electronic databases PsycINFO, PubMed, Expanded Academic, Web of Science, Scopus and ProQuest were searched electronically for relevant articles and dissertations using the search terms…

Target Engageability Improvement Through Adaptive Data Fusion and Sensor Management: An Approach Based on the Fire Control Radar Search to Lock-On Time

DTIC Science & Technology

2008-05-01

ch based on the fire control radar search to l o ck - o n t i m e F. Rhéaume A. Benaskeur DRDC Valcartier Defence R& D Canada...recherche visant à développer et démontrer des concepts avancés de fusion de données adaptative et de gestion de res- sources. Les systèmes C2 navals...militaires sont en grande partie appuyés par des techno- logies de fusion de données et de gestion de ressources. Le C2 naval militaire doit

The North Carolina State University Libraries Search Experience: Usability Testing Tabbed Search Interfaces for Academic Libraries

ERIC Educational Resources Information Center

Teague-Rector, Susan; Ballard, Angela; Pauley, Susan K.

2011-01-01

Creating a learnable, effective, and user-friendly library Web site hinges on providing easy access to search. Designing a search interface for academic libraries can be particularly challenging given the complexity and range of searchable library collections, such as bibliographic databases, electronic journals, and article search silos. Library…

Shared-hole graph search with adaptive constraints for 3D optic nerve head optical coherence tomography image segmentation

PubMed Central

Yu, Kai; Shi, Fei; Gao, Enting; Zhu, Weifang; Chen, Haoyu; Chen, Xinjian

2018-01-01

Optic nerve head (ONH) is a crucial region for glaucoma detection and tracking based on spectral domain optical coherence tomography (SD-OCT) images. In this region, the existence of a “hole” structure makes retinal layer segmentation and analysis very challenging. To improve retinal layer segmentation, we propose a 3D method for ONH centered SD-OCT image segmentation, which is based on a modified graph search algorithm with a shared-hole and locally adaptive constraints. With the proposed method, both the optic disc boundary and nine retinal surfaces can be accurately segmented in SD-OCT images. An overall mean unsigned border positioning error of 7.27 ± 5.40 µm was achieved for layer segmentation, and a mean Dice coefficient of 0.925 ± 0.03 was achieved for optic disc region detection. PMID:29541497

Enhancing artificial bee colony algorithm with self-adaptive searching strategy and artificial immune network operators for global optimization.

PubMed

Chen, Tinggui; Xiao, Renbin

2014-01-01

Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments.

Enhancing Artificial Bee Colony Algorithm with Self-Adaptive Searching Strategy and Artificial Immune Network Operators for Global Optimization

PubMed Central

Chen, Tinggui; Xiao, Renbin

2014-01-01

Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments. PMID:24772023

Visibiome: an efficient microbiome search engine based on a scalable, distributed architecture.

PubMed

Azman, Syafiq Kamarul; Anwar, Muhammad Zohaib; Henschel, Andreas

2017-07-24

Given the current influx of 16S rRNA profiles of microbiota samples, it is conceivable that large amounts of them eventually are available for search, comparison and contextualization with respect to novel samples. This process facilitates the identification of similar compositional features in microbiota elsewhere and therefore can help to understand driving factors for microbial community assembly. We present Visibiome, a microbiome search engine that can perform exhaustive, phylogeny based similarity search and contextualization of user-provided samples against a comprehensive dataset of 16S rRNA profiles environments, while tackling several computational challenges. In order to scale to high demands, we developed a distributed system that combines web framework technology, task queueing and scheduling, cloud computing and a dedicated database server. To further ensure speed and efficiency, we have deployed Nearest Neighbor search algorithms, capable of sublinear searches in high-dimensional metric spaces in combination with an optimized Earth Mover Distance based implementation of weighted UniFrac. The search also incorporates pairwise (adaptive) rarefaction and optionally, 16S rRNA copy number correction. The result of a query microbiome sample is the contextualization against a comprehensive database of microbiome samples from a diverse range of environments, visualized through a rich set of interactive figures and diagrams, including barchart-based compositional comparisons and ranking of the closest matches in the database. Visibiome is a convenient, scalable and efficient framework to search microbiomes against a comprehensive database of environmental samples. The search engine leverages a popular but computationally expensive, phylogeny based distance metric, while providing numerous advantages over the current state of the art tool.

Path integration mediated systematic search: a Bayesian model.

PubMed

Vickerstaff, Robert J; Merkle, Tobias

2012-08-21

The systematic search behaviour is a backup system that increases the chances of desert ants finding their nest entrance after foraging when the path integrator has failed to guide them home accurately enough. Here we present a mathematical model of the systematic search that is based on extensive behavioural studies in North African desert ants Cataglyphis fortis. First, a simple search heuristic utilising Bayesian inference and a probability density function is developed. This model, which optimises the short-term nest detection probability, is then compared to three simpler search heuristics and to recorded search patterns of Cataglyphis ants. To compare the different searches a method to quantify search efficiency is established as well as an estimate of the error rate in the ants' path integrator. We demonstrate that the Bayesian search heuristic is able to automatically adapt to increasing levels of positional uncertainty to produce broader search patterns, just as desert ants do, and that it outperforms the three other search heuristics tested. The searches produced by it are also arguably the most similar in appearance to the ant's searches. Copyright © 2012 Elsevier Ltd. All rights reserved.

A methodological survey identified eight proposed frameworks for the adaptation of health related guidelines.

PubMed

Darzi, Andrea; Abou-Jaoude, Elias A; Agarwal, Arnav; Lakis, Chantal; Wiercioch, Wojtek; Santesso, Nancy; Brax, Hneine; El-Jardali, Fadi; Schünemann, Holger J; Akl, Elie A

2017-06-01

Our objective was to identify and describe published frameworks for adaptation of clinical, public health, and health services guidelines. We included reports describing methods of adaptation of guidelines in sufficient detail to allow its reproducibility. We searched Medline and EMBASE databases. We also searched personal files, as well manuals and handbooks of organizations and professional societies that proposed methods of adaptation and adoption of guidelines. We followed standard systematic review methodology. Our search captured 12,021 citations, out of which we identified eight proposed methods of guidelines adaptation: ADAPTE, Adapted ADAPTE, Alberta Ambassador Program adaptation phase, GRADE-ADOLOPMENT, MAGIC, RAPADAPTE, Royal College of Nursing (RCN), and Systematic Guideline Review (SGR). The ADAPTE framework consists of a 24-step process to adapt guidelines to a local context taking into consideration the needs, priorities, legislation, policies, and resources. The Alexandria Center for Evidence-Based Clinical Practice Guidelines updated one of ADAPTE's tools, modified three tools, and added three new ones. In addition, they proposed optionally using three other tools. The Alberta Ambassador Program adaptation phase consists of 11 steps and focused on adapting good-quality guidelines for nonspecific low back pain into local context. GRADE-ADOLOPMENT is an eight-step process based on the GRADE Working Group's Evidence to Decision frameworks and applied in 22 guidelines in the context of national guideline development program. The MAGIC research program developed a five-step adaptation process, informed by ADAPTE and the GRADE approach in the context of adapting thrombosis guidelines. The RAPADAPTE framework consists of 12 steps based on ADAPTE and using synthesized evidence databases, retrospectively derived from the experience of producing a high-quality guideline for the treatment of breast cancer with limited resources in Costa Rica. The RCN outlines

Object tracking based on harmony search: comparative study

NASA Astrophysics Data System (ADS)

Gao, Ming-Liang; He, Xiao-Hai; Luo, Dai-Sheng; Yu, Yan-Mei

2012-10-01

Visual tracking can be treated as an optimization problem. A new meta-heuristic optimal algorithm, Harmony Search (HS), was first applied to perform visual tracking by Fourie et al. As the authors point out, many subjects are still required in ongoing research. Our work is a continuation of Fourie's study, with four prominent improved variations of HS, namely Improved Harmony Search (IHS), Global-best Harmony Search (GHS), Self-adaptive Harmony Search (SHS) and Differential Harmony Search (DHS) adopted into the tracking system. Their performances are tested and analyzed on multiple challenging video sequences. Experimental results show that IHS is best, with DHS ranking second among the four improved trackers when the iteration number is small. However, the differences between all four reduced gradually, along with the increasing number of iterations.

Teaching AI Search Algorithms in a Web-Based Educational System

ERIC Educational Resources Information Center

Grivokostopoulou, Foteini; Hatzilygeroudis, Ioannis

2013-01-01

In this paper, we present a way of teaching AI search algorithms in a web-based adaptive educational system. Teaching is based on interactive examples and exercises. Interactive examples, which use visualized animations to present AI search algorithms in a step-by-step way with explanations, are used to make learning more attractive. Practice…

Searching for evidence or approval? A commentary on database search in systematic reviews and alternative information retrieval methodologies.

PubMed

Delaney, Aogán; Tamás, Peter A

2018-03-01

Despite recognition that database search alone is inadequate even within the health sciences, it appears that reviewers in fields that have adopted systematic review are choosing to rely primarily, or only, on database search for information retrieval. This commentary reminds readers of factors that call into question the appropriateness of default reliance on database searches particularly as systematic review is adapted for use in new and lower consensus fields. It then discusses alternative methods for information retrieval that require development, formalisation, and evaluation. Our goals are to encourage reviewers to reflect critically and transparently on their choice of information retrieval methods and to encourage investment in research on alternatives. Copyright © 2017 John Wiley & Sons, Ltd.

Antenna concepts for interstellar search systems

NASA Technical Reports Server (NTRS)

Basler, R. P.; Johnson, G. L.; Vondrak, R. R.

1977-01-01

An evaluation is made of microwave receiving systems designed to search for signals from extraterrestrial intelligence. Specific design concepts are analyzed parametrically to determine whether the optimum antenna system location is on earth, in space, or on the moon. Parameters considered include the hypothesized number of transmitting civilizations, the number of stars that must be searched to give any desired probability of receiving a signal, the antenna collecting area, the search time, the search range, and the cost. This analysis suggests that (1) search systems based on the moon are not cost-competitive, (2) if the search is extended only a few hundred light years from the earth, a Cyclops-type array on earth may be the most cost-effective system, (3) for a search extending to 500 light years or more, a substantial cost and search-time advantage can be achieved with a large spherical reflector in space with multiple feeds, (4) radio frequency interference shields can be provided for space systems, and (5) cost can range from a few hundred million to tens of billions of dollars, depending on the parameter values assumed.

Curating the Web: Building a Google Custom Search Engine for the Arts

ERIC Educational Resources Information Center

Hennesy, Cody; Bowman, John

2008-01-01

Google's first foray onto the web made search simple and results relevant. With its Co-op platform, Google has taken another step toward dramatically increasing the relevancy of search results, further adapting the World Wide Web to local needs. Google Custom Search Engine, a tool on the Co-op platform, puts one in control of his or her own search…

Searching and synthesising 'grey literature' and 'grey information' in public health: critical reflections on three case studies.

PubMed

Adams, Jean; Hillier-Brown, Frances C; Moore, Helen J; Lake, Amelia A; Araujo-Soares, Vera; White, Martin; Summerbell, Carolyn

2016-09-29

Grey literature includes a range of documents not controlled by commercial publishing organisations. This means that grey literature can be difficult to search and retrieve for evidence synthesis. Much knowledge and evidence in public health, and other fields, accumulates from innovation in practice. This knowledge may not even be of sufficient formality to meet the definition of grey literature. We term this knowledge 'grey information'. Grey information may be even harder to search for and retrieve than grey literature. On three previous occasions, we have attempted to systematically search for and synthesise public health grey literature and information-both to summarise the extent and nature of particular classes of interventions and to synthesise results of evaluations. Here, we briefly describe these three 'case studies' but focus on our post hoc critical reflections on searching for and synthesising grey literature and information garnered from our experiences of these case studies. We believe these reflections will be useful to future researchers working in this area. Issues discussed include search methods, searching efficiency, replicability of searches, data management, data extraction, assessing study 'quality', data synthesis, time and resources, and differentiating evidence synthesis from primary research. Information on applied public health research questions relating to the nature and range of public health interventions, as well as many evaluations of these interventions, may be predominantly, or only, held in grey literature and grey information. Evidence syntheses on these topics need, therefore, to embrace grey literature and information. Many typical systematic review methods for searching, appraising, managing, and synthesising the evidence base can be adapted for use with grey literature and information. Evidence synthesisers should carefully consider the opportunities and problems offered by including grey literature and information

Applying systematic review search methods to the grey literature: a case study examining guidelines for school-based breakfast programs in Canada.

PubMed

Godin, Katelyn; Stapleton, Jackie; Kirkpatrick, Sharon I; Hanning, Rhona M; Leatherdale, Scott T

2015-10-22

identify web-based resources in the grey literature. The search strategy we developed and tested is amenable to adaptation to identify other types of grey literature from other disciplines and answering a wide range of research questions. This method should be further adapted and tested in future research syntheses.

The myoglobin of Emperor penguin (Aptenodytes forsteri): amino acid sequence and functional adaptation to extreme conditions.

PubMed

Tamburrini, M; Romano, M; Giardina, B; di Prisco, G

1999-02-01

In the framework of a study on molecular adaptations of the oxygen-transport and storage systems to extreme conditions in Antarctic marine organisms, we have investigated the structure/function relationship in Emperor penguin (Aptenodytes forsteri) myoglobin, in search of correlation with the bird life style. In contrast with previous reports, the revised amino acid sequence contains one additional residue and 15 differences. The oxygen-binding parameters seem well adapted to the diving behaviour of the penguin and to the environmental conditions of the Antarctic habitat. Addition of lactate has no major effect on myoglobin oxygenation over a large temperature range. Therefore, metabolic acidosis does not impair myoglobin function under conditions of prolonged physical effort, such as diving.

Northern range expansion of European populations of the wasp spider Argiope bruennichi is associated with global warming-correlated genetic admixture and population-specific temperature adaptations.

PubMed

Krehenwinkel, Henrik; Tautz, Diethard

2013-04-01

Poleward range expansions are observed for an increasing number of species, which may be an effect of global warming during the past decades. However, it is still not clear in how far these expansions reflect simple geographical shifts of species ranges, or whether new genetic adaptations play a role as well. Here, we analyse the expansion of the wasp spider Argiope bruennichi into Northern Europe during the last century. We have used a range-wide sampling of contemporary populations and historical specimens from museums to trace the phylogeography and genetic changes associated with the range shift. Based on the analysis of mitochondrial, microsatellite and SNP markers, we observe a higher level of genetic diversity in the expanding populations, apparently due to admixture of formerly isolated lineages. Using reciprocal transplant experiments for testing overwintering tolerance, as well as temperature preference and tolerance tests in the laboratory, we find that the invading spiders have possibly shifted their temperature niche. This may be a key adaptation for survival in Northern latitudes. The museum samples allow a reconstruction of the invasion's genetic history. A first, small-scale range shift started around 1930, in parallel with the onset of global warming. A more massive invasion of Northern Europe associated with genetic admixture and morphological changes occurred in later decades. We suggest that the latter range expansion into far Northern latitudes may be a consequence of the admixture that provided the genetic material for adaptations to new environmental regimes. Hence, global warming could have facilitated the initial admixture of populations and this resulted in genetic lineages with new habitat preferences. © 2013 Blackwell Publishing Ltd.

A fully integrated, wide-load-range, high-power-conversion-efficiency switched capacitor DC-DC converter with adaptive bias comparator for ultra-low-power power management integrated circuit

NASA Astrophysics Data System (ADS)

Asano, Hiroki; Hirose, Tetsuya; Kojima, Yuta; Kuroki, Nobutaka; Numa, Masahiro

2018-04-01

In this paper, we present a wide-load-range switched-capacitor DC-DC buck converter with an adaptive bias comparator for ultra-low-power power management integrated circuit. The proposed converter is based on a conventional one and modified to operate in a wide load range by developing a load current monitor used in an adaptive bias comparator. Measurement results demonstrated that our proposed converter generates a 1.0 V output voltage from a 3.0 V input voltage at a load of up to 100 µA, which is 20 times higher than that of the conventional one. The power conversion efficiency was higher than 60% in the load range from 0.8 to 100 µA.

The search for extra-terrestrial intelligence.

PubMed

Drake, Frank

2011-02-13

Modern history of the search for extra-terrestrial intelligence is reviewed. The history of radio searches is discussed, as well as the major advances that have occurred in radio searches and prospects for new instruments and search strategies. Recent recognition that searches for optical and infrared signals make sense, and the reasons for this are described, as well as the equipment and special detection methods used in optical searches. The long-range future of the search for extra-terrestrial intelligence (SETI) is discussed in the context of the history of rapid change, on the cosmic and even the human time scale, of the paradigms guiding SETI searches. This suggests that SETI searches be conducted with a very open mind.

Making processes reliable: a validated pubmed search strategy for identifying new or emerging technologies.

PubMed

Varela-Lema, Leonora; Punal-Riobóo, Jeanette; Acción, Beatriz Casal; Ruano-Ravina, Alberto; García, Marisa López

2012-10-01

Horizon scanning systems need to handle a wide range of sources to identify new or emerging health technologies. The objective of this study is to develop a validated Medline bibliographic search strategy (PubMed search engine) to systematically identify new or emerging health technologies. The proposed Medline search strategy combines free text terms commonly used in article titles to denote innovation within index terms that make reference to the specific fields of interest. Efficacy was assessed by running the search over a period of 1 year (2009) and analyzing its retrieval performance (number and characteristics). For comparison purposes, all article abstracts published during 2009 in six preselected key research journals and eight high impact surgery journals were scanned. Sensitivity was defined as the proportion of relevant new or emerging technologies published in key journals that would be identified in the search strategy within the first 2 years of publication. The search yielded 6,228 abstracts of potentially new or emerging technologies. Of these, 459 were classified as new or emerging (383 truly new or emerging and 76 new indications). The scanning of 12,061 journal abstracts identified 35 relevant new or emerging technologies. Of these, twenty-nine were located within the Medline search strategy during the first 2 years of publication (sensitivity = 83 percent). The current search strategy, validated against key journals, has demonstrated to be effective for horizon scanning. Even though it can require adaptations depending on the scope of the horizon scanning system, it could serve to simplify and standardize scanning processes.

Search for scalar diphoton resonances in the mass range 65-600 GeV with the ATLAS detector in pp collision data at √s=8 TeV.

PubMed

Aad, G; Abbott, B; Abdallah, J; Abdel Khalek, S; Abdinov, O; Aben, R; Abi, B; Abolins, M; AbouZeid, O S; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adamczyk, L; Adams, D L; Adelman, J; Adomeit, S; Adye, T; Agatonovic-Jovin, T; Aguilar-Saavedra, J A; Agustoni, M; Ahlen, S P; Ahmadov, F; Aielli, G; Akerstedt, H; Akesson, T P A; Akimoto, G; Akimov, A V; Alberghi, G L; Albert, J; Albrand, S; Alconada Verzini, M J; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexandre, G; Alexopoulos, T; Alhroob, M; Alimonti, G; Alio, L; Alison, J; Allbrooke, B M M; Allison, L J; Allport, P P; Almond, J; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Altheimer, A; Alvarez Gonzalez, B; Alviggi, M G; Amako, K; Amaral Coutinho, Y; Amelung, C; Amidei, D; Amor Dos Santos, S P; Amorim, A; Amoroso, S; Amram, N; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anderson, K J; Andreazza, A; Andrei, V; Anduaga, X S; Angelidakis, S; Angelozzi, I; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A V; Anjos, N; Annovi, A; Antonaki, A; Antonelli, M; Antonov, A; Antos, J; Anulli, F; Aoki, M; Aperio Bella, L; Apolle, R; Arabidze, G; Aracena, I; Arai, Y; Araque, J P; Arce, A T H; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Arnaez, O; Arnal, V; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Asai, S; Asbah, N; Ashkenazi, A; Asman, B; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Auerbach, B; Augsten, K; Aurousseau, M; Avolio, G; Azuelos, G; Azuma, Y; Baak, M A; Baas, A; Bacci, C; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Backus Mayes, J; Badescu, E; Bagiacchi, P; Bagnaia, P; Bai, Y; Bain, T; Baines, J T; Baker, O K; Balek, P; Balli, F; Banas, E; Banerjee, Sw; Bannoura, A A E; Bansal, V; Bansil, H S; Barak, L; Baranov, S P; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisonzi, M; Barklow, T; Barlow, N; Barnett, B M; Barnett, R M; Barnovska, Z; Baroncelli, A; Barone, G; Barr, A J; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartos, P; Bartsch, V; Bassalat, A; Basye, A; Bates, R L; Batley, J R; Battaglia, M; Battistin, M; Bauer, F; Bawa, H S; Beattie, M D; Beau, T; Beauchemin, P H; Beccherle, R; Bechtle, P; Beck, H P; Becker, K; Becker, S; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bedikian, S; Bednyakov, V A; Bee, C P; Beemster, L J; Beermann, T A; Begel, M; Behr, K; Belanger-Champagne, C; Bell, P J; Bell, W H; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Benary, O; Benchekroun, D; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez Garcia, J A; Benjamin, D P; Bensinger, J R; Benslama, K; Bentvelsen, S; Berge, D; Bergeaas Kuutmann, E; Berger, N; Berghaus, F; Beringer, J; Bernard, C; Bernat, P; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertsche, C; Bertsche, D; Besana, M I; Besjes, G J; Bessidskaia, O; Bessner, M; Besson, N; Betancourt, C; Bethke, S; Bhimji, W; Bianchi, R M; Bianchini, L; Bianco, M; Biebel, O; Bieniek, S P; Bierwagen, K; Biesiada, J; Biglietti, M; Bilbao De Mendizabal, J; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Black, C W; Black, J E; Black, K M; Blackburn, D; Blair, R E; Blanchard, J-B; Blazek, T; Bloch, I; Blocker, C; Blum, W; Blumenschein, U; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boddy, C R; Boehler, M; Boek, T T; Bogaerts, J A; Bogdanchikov, A G; Bogouch, A; Bohm, C; Bohm, J; Boisvert, V; Bold, T; Boldea, V; Boldyrev, A S; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Borri, M; Borroni, S; Bortfeldt, J; Bortolotto, V; Bos, K; Boscherini, D; Bosman, M; Boterenbrood, H; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Bousson, N; Boutouil, S; Boveia, A; Boyd, J; Boyko, I R; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Brazzale, S F; Brelier, B; Brendlinger, K; Brennan, A J; Brenner, R; Bressler, S; Bristow, K; Bristow, T M; Britton, D; Brochu, F M; Brock, I; Brock, R; Bromberg, C; Bronner, J; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Brown, J; Bruckman de Renstrom, P A; Bruncko, D; Bruneliere, R; Brunet, S; Bruni, A; Bruni, G; Bruschi, M; Bryngemark, L; Buanes, T; Buat, Q; Bucci, F; Buchholz, P; Buckingham, R M; Buckley, A G; Buda, S I; Budagov, I A; Buehrer, F; Bugge, L; Bugge, M K; Bulekov, O; Bundock, A C; Burckhart, H; Burdin, S; Burghgrave, B; Burke, S; Burmeister, I; Busato, E; Büscher, D; Büscher, V; Bussey, P; Buszello, C P; Butler, B; Butler, J M; Butt, A I; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Byszewski, M; Cabrera Urbán, S; Caforio, D; Cakir, O; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Calkins, R; Caloba, L P; Calvet, D; Calvet, S; Camacho Toro, R; Camarda, S; Cameron, D; Caminada, L M; Caminal Armadans, R; Campana, S; Campanelli, M; Campoverde, A; Canale, V; Canepa, A; Cano Bret, M; Cantero, J; Cantrill, R; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capua, M; Caputo, R; Cardarelli, R; Carli, T; Carlino, G; Carminati, L; Caron, S; Carquin, E; Carrillo-Montoya, G D; Carter, J R; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Castaneda-Miranda, E; Castelli, A; Castillo Gimenez, V; Castro, N F; Catastini, P; Catinaccio, A; Catmore, J R; Cattai, A; Cattani, G; Caughron, S; Cavaliere, V; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Ceradini, F; Cerio, B; Cerny, K; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cerv, M; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chalupkova, I; Chang, P; Chapleau, B; Chapman, J D; Charfeddine, D; Charlton, D G; Chau, C C; Chavez Barajas, C A; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, K; Chen, L; Chen, S; Chen, X; Chen, Y; Chen, Y; Cheng, H C; Cheng, Y; Cheplakov, A; Cherkaoui El Moursli, R; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiefari, G; Childers, J T; Chilingarov, A; Chiodini, G; Chisholm, A S; Chislett, R T; Chitan, A; Chizhov, M V; Chouridou, S; Chow, B K B; Chromek-Burckhart, D; Chu, M L; Chudoba, J; Chwastowski, J J; Chytka, L; Ciapetti, G; Ciftci, A K; Ciftci, R; Cinca, D; Cindro, V; Ciocio, A; Cirkovic, P; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, P J; Clarke, R N; Cleland, W; Clemens, J C; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Coffey, L; Cogan, J G; Coggeshall, J; Cole, B; Cole, S; Colijn, A P; Collot, J; Colombo, T; Colon, G; Compostella, G; Conde Muiño, P; Coniavitis, E; Conidi, M C; Connell, S H; Connelly, I A; Consonni, S M; Consorti, V; Constantinescu, S; Conta, C; Conti, G; Conventi, F; Cooke, M; Cooper, B D; Cooper-Sarkar, A M; Cooper-Smith, N J; Copic, K; Cornelissen, T; Corradi, M; Corriveau, F; Corso-Radu, A; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Côté, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Crispin Ortuzar, M; Cristinziani, M; Croft, V; Crosetti, G; Cuciuc, C-M; Cuhadar Donszelmann, T; Cummings, J; Curatolo, M; Cuthbert, C; Czirr, H; Czodrowski, P; Czyczula, Z; D'Auria, S; D'Onofrio, M; Da Cunha Sargedas De Sousa, M J; Da Via, C; Dabrowski, W; Dafinca, A; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Daniells, A C; Dano Hoffmann, M; Dao, V; Darbo, G; Darmora, S; Dassoulas, J A; Dattagupta, A; Davey, W; David, C; Davidek, T; Davies, E; Davies, M; Davignon, O; Davison, A R; Davison, P; Davygora, Y; Dawe, E; Dawson, I; Daya-Ishmukhametova, R K; De, K; de Asmundis, R; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Nooij, L; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vivie De Regie, J B; Dearnaley, W J; Debbe, R; Debenedetti, C; Dechenaux, B; Dedovich, D V; Deigaard, I; Del Peso, J; Del Prete, T; Deliot, F; Delitzsch, C M; Deliyergiyev, M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delsart, P A; Deluca, C; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Ciaccio, A; Di Ciaccio, L; Di Domenico, A; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Mattia, A; Di Micco, B; Di Nardo, R; Di Simone, A; Di Sipio, R; Di Valentino, D; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Dietzsch, T A; Diglio, S; Dimitrievska, A; Dingfelder, J; Dionisi, C; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; do Vale, M A B; Do Valle Wemans, A; Doan, T K O; Dobos, D; Doglioni, C; Doherty, T; Dohmae, T; Dolejsi, J; Dolezal, Z; Dolgoshein, B A; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Dris, M; Dubbert, J; Dube, S; Dubreuil, E; Duchovni, E; Duckeck, G; Ducu, O A; Duda, D; Dudarev, A; Dudziak, F; Duflot, L; Duguid, L; Dührssen, M; Dunford, M; Duran Yildiz, H; Düren, M; Durglishvili, A; Dwuznik, M; Dyndal, M; Ebke, J; Edson, W; Edwards, N C; Ehrenfeld, W; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; El Kacimi, M; Ellert, M; Elles, S; Ellinghaus, F; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Endo, M; Engelmann, R; Erdmann, J; Ereditato, A; Eriksson, D; Ernis, G; Ernst, J; Ernst, M; Ernwein, J; Errede, D; Errede, S; Ertel, E; Escalier, M; Esch, H; Escobar, C; Esposito, B; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Favareto, A; Fayard, L; Federic, P; Fedin, O L; Fedorko, W; Fehling-Kaschek, M; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenyuk, A B; Fernandez Perez, S; Ferrag, S; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Ferretto Parodi, A; Fiascaris, M; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Firan, A; Fischer, A; Fischer, J; Fisher, W C; Fitzgerald, E A; Flechl, M; Fleck, I; Fleischmann, P; Fleischmann, S; Fletcher, G T; Fletcher, G; Flick, T; Floderus, A; Flores Castillo, L R; Florez Bustos, A C; Flowerdew, M J; Formica, A; Forti, A; Fortin, D; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Franchino, S; Francis, D; Franconi, L; Franklin, M; Franz, S; Fraternali, M; French, S T; Friedrich, C; Friedrich, F; Froidevaux, D; Frost, J A; Fukunaga, C; Fullana Torregrosa, E; Fulsom, B G; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, P; Galea, C; Galhardo, B; Gallas, E J; Gallo, V; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Gao, J; Gao, Y S; Garay Walls, F M; Garberson, F; García, C; García Navarro, J E; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gatti, C; Gaudio, G; Gaur, B; Gauthier, L; Gauzzi, P; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Ge, P; Gecse, Z; Gee, C N P; Geerts, D A A; Geich-Gimbel, Ch; Gellerstedt, K; Gemme, C; Gemmell, A; Genest, M H; Gentile, S; George, M; George, S; Gerbaudo, D; Gershon, A; Ghazlane, H; Ghodbane, N; Giacobbe, B; Giagu, S; Giangiobbe, V; Giannetti, P; Gianotti, F; Gibbard, B; Gibson, S M; Gilchriese, M; Gillam, T P S; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giordano, R; Giorgi, F M; Giorgi, F M; Giraud, P F; Giugni, D; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Glonti, G L; Goblirsch-Kolb, M; Goddard, J R; Godfrey, J; Godlewski, J; Goeringer, C; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gomez Fajardo, L S; Gonçalo, R; Goncalves Pinto Firmino Da Costa, J; Gonella, L; González de la Hoz, S; Gonzalez Parra, G; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Gornicki, E; Goshaw, A T; Gössling, C; Gostkin, M I; Gouighri, M; Goujdami, D; Goulette, M P; Goussiou, A G; Goy, C; Gozpinar, S; Grabas, H M X; Graber, L; Grabowska-Bold, I; Grafström, P; Grahn, K-J; Gramling, J; Gramstad, E; Grancagnolo, S; Grassi, V; Gratchev, V; Gray, H M; Graziani, E; Grebenyuk, O G; Greenwood, Z D; Gregersen, K; Gregor, I M; Grenier, P; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grishkevich, Y V; Grivaz, J-F; Grohs, J P; Grohsjean, A; Gross, E; Grosse-Knetter, J; Grossi, G C; Groth-Jensen, J; Grout, Z J; Guan, L; Guescini, F; Guest, D; Gueta, O; Guicheney, C; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Gunther, J; Guo, J; Gupta, S; Gutierrez, P; Gutierrez Ortiz, N G; Gutschow, C; Guttman, N; Guyot, C; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Haefner, P; Hageböck, S; Hajduk, Z; Hakobyan, H; Haleem, M; Hall, D; Halladjian, G; Hamacher, K; Hamal, P; Hamano, K; Hamer, M; Hamilton, A; Hamilton, S; Hamity, G N; Hamnett, P G; Han, L; Hanagaki, K; Hanawa, K; Hance, M; Hanke, P; Hanna, R; Hansen, J B; Hansen, J D; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harper, D; Harrington, R D; Harris, O M; Harrison, P F; Hartjes, F; Hasegawa, M; Hasegawa, S; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauschild, M; Hauser, R; Havranek, M; Hawkes, C M; Hawkings, R J; Hawkins, A D; Hayashi, T; Hayden, D; Hays, C P; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heim, S; Heim, T; Heinemann, B; Heinrich, L; Hejbal, J; Helary, L; Heller, C; Heller, M; Hellman, S; Hellmich, D; Helsens, C; Henderson, J; Henderson, R C W; Heng, Y; Hengler, C; Henrichs, A; Henriques Correia, A M; Henrot-Versille, S; Hensel, C; Herbert, G H; Hernández Jiménez, Y; Herrberg-Schubert, R; Herten, G; Hertenberger, R; Hervas, L; Hesketh, G G; Hessey, N P; Hickling, R; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillert, S; Hillier, S J; Hinchliffe, I; Hines, E; Hirose, M; Hirschbuehl, D; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hoffman, J; Hoffmann, D; Hofmann, J I; Hohlfeld, M; Holmes, T R; Hong, T M; Hooft van Huysduynen, L; Hostachy, J-Y; Hou, S; Hoummada, A; Howard, J; Howarth, J; Hrabovsky, M; Hristova, I; Hrivnac, J; Hryn'ova, T; Hsu, C; Hsu, P J; Hsu, S-C; Hu, D; Hu, X; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Hülsing, T A; Hurwitz, M; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Ideal, E; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikematsu, K; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Inamaru, Y; Ince, T; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Irles Quiles, A; Isaksson, C; Ishino, M; Ishitsuka, M; Ishmukhametov, R; Issever, C; Istin, S; Iturbe Ponce, J M; Iuppa, R; Ivarsson, J; Iwanski, W; Iwasaki, H; Izen, J M; Izzo, V; Jackson, B; Jackson, M; Jackson, P; Jaekel, M R; Jain, V; Jakobs, K; Jakobsen, S; Jakoubek, T; Jakubek, J; Jamin, D O; Jana, D K; Jansen, E; Jansen, H; Janssen, J; Janus, M; Jarlskog, G; Javadov, N; Javůrek, T; Jeanty, L; Jejelava, J; Jeng, G-Y; Jennens, D; Jenni, P; Jentzsch, J; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, Y; Jimenez Belenguer, M; Jin, S; Jinaru, A; Jinnouchi, O; Joergensen, M D; Johansson, K E; Johansson, P; Johns, K A; Jon-And, K; Jones, G; Jones, R W L; Jones, T J; Jongmanns, J; Jorge, P M; Joshi, K D; Jovicevic, J; Ju, X; Jung, C A; Jungst, R M; Jussel, P; Juste Rozas, A; Kaci, M; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kajomovitz, E; Kalderon, C W; Kama, S; Kamenshchikov, A; Kanaya, N; Kaneda, M; Kaneti, S; Kantserov, V A; Kanzaki, J; Kaplan, B; Kapliy, A; Kar, D; Karakostas, K; Karastathis, N; Karnevskiy, M; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kashif, L; Kasieczka, G; Kass, R D; Kastanas, A; Kataoka, Y; Katre, A; Katzy, J; Kaushik, V; Kawagoe, K; Kawamoto, T; Kawamura, G; Kazama, S; Kazanin, V F; Kazarinov, M Y; Keeler, R; Kehoe, R; Keil, M; Keller, J S; Kempster, J J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Kessoku, K; Keung, J; Khalil-Zada, F; Khandanyan, H; Khanov, A; Khodinov, A; Khomich, A; Khoo, T J; Khoriauli, G; Khoroshilov, A; Khovanskiy, V; Khramov, E; Khubua, J; Kim, H Y; Kim, H; Kim, S H; Kimura, N; Kind, O; King, B T; King, M; King, R S B; King, S B; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kiss, F; Kittelmann, T; Kiuchi, K; Kladiva, E; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klinger, J A; Klioutchnikova, T; Klok, P F; Kluge, E-E; Kluit, P; Kluth, S; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koevesarki, P; Koffas, T; Koffeman, E; Kogan, L A; Kohlmann, S; Kohout, Z; Kohriki, T; Koi, T; Kolanoski, H; Koletsou, I; Koll, J; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; König, S; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Köpke, L; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Korotkov, V A; Kortner, O; Kortner, S; Kostyukhin, V V; Kotov, V M; Kotwal, A; Kourkoumelis, C; Kouskoura, V; Koutsman, A; Kowalewski, R; Kowalski, T Z; Kozanecki, W; Kozhin, A S; Kral, V; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Kraus, J K; Kravchenko, A; Kreiss, S; Kretz, M; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Kroeninger, K; Kroha, H; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Kruker, T; Krumnack, N; Krumshteyn, Z V; Kruse, A; Kruse, M C; Kruskal, M; Kubota, T; Kuday, S; Kuehn, S; Kugel, A; Kuhl, A; Kuhl, T; Kukhtin, V; Kulchitsky, Y; Kuleshov, S; Kuna, M; Kunkle, J; Kupco, A; Kurashige, H; Kurochkin, Y A; Kurumida, R; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; La Rosa, A; La Rotonda, L; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Lacuesta, V R; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Laier, H; Lambourne, L; Lammers, S; Lampen, C L; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lang, V S; Lankford, A J; Lanni, F; Lantzsch, K; Laplace, S; Lapoire, C; Laporte, J F; Lari, T; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Le Dortz, O; Le Guirriec, E; Le Menedeu, E; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, H; Lee, J S H; Lee, S C; Lee, L; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Lehmacher, M; Lehmann Miotto, G; Lei, X; Leight, W A; Leisos, A; Leister, A G; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzen, G; Lenzi, B; Leone, R; Leone, S; Leonhardt, K; Leonidopoulos, C; Leontsinis, S; Leroy, C; Lester, C G; Lester, C M; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, A; Lewis, G H; Leyko, A M; Leyton, M; Li, B; Li, B; Li, H; Li, H L; Li, L; Li, L; Li, S; Li, Y; Liang, Z; Liao, H; Liberti, B; Lichard, P; Lie, K; Liebal, J; Liebig, W; Limbach, C; Limosani, A; Lin, S C; Lin, T H; Linde, F; Lindquist, B E; Linnemann, J T; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lissauer, D; Lister, A; Litke, A M; Liu, B; Liu, D; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, M; Liu, Y; Livan, M; Livermore, S S A; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo Sterzo, F; Lobodzinska, E; Loch, P; Lockman, W S; Loddenkoetter, T; Loebinger, F K; Loevschall-Jensen, A E; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Lombardo, V P; Long, B A; Long, J D; Long, R E; Lopes, L; Lopez Mateos, D; Lopez Paredes, B; Lopez Paz, I; Lorenz, J; Lorenzo Martinez, N; Losada, M; Loscutoff, P; Lou, X; Lounis, A; Love, J; Love, P A; Lowe, A J; Lu, F; Lu, N; Lubatti, H J; Luci, C; Lucotte, A; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Lungwitz, M; Lynn, D; Lysak, R; Lytken, E; Ma, H; Ma, L L; Maccarrone, G; Macchiolo, A; Machado Miguens, J; Macina, D; Madaffari, D; Madar, R; Maddocks, H J; Mader, W F; Madsen, A; Maeno, M; Maeno, T; Magradze, E; Mahboubi, K; Mahlstedt, J; Mahmoud, S; Maiani, C; Maidantchik, C; Maier, A A; Maio, A; Majewski, S; Makida, Y; Makovec, N; Mal, P; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyshev, V M; Malyukov, S; Mamuzic, J; Mandelli, B; Mandelli, L; Mandić, I; Mandrysch, R; Maneira, J; Manfredini, A; Manhaes de Andrade Filho, L; Manjarres Ramos, J A; Mann, A; Manning, P M; Manousakis-Katsikakis, A; Mansoulie, B; Mantifel, R; Mapelli, L; March, L; Marchand, J F; Marchiori, G; Marcisovsky, M; Marino, C P; Marjanovic, M; Marques, C N; Marroquim, F; Marsden, S P; Marshall, Z; Marti, L F; Marti-Garcia, S; Martin, B; Martin, B; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, H; Martinez, M; Martin-Haugh, S; Martyniuk, A C; Marx, M; Marzano, F; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, I; Massa, L; Massol, N; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Mattmann, J; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Mazzaferro, L; Mc Goldrick, G; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McCubbin, N A; McFarlane, K W; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McPherson, R A; Meade, A; Mechnich, J; Medinnis, M; Meehan, S; Mehlhase, S; Mehta, A; Meier, K; Meineck, C; Meirose, B; Melachrinos, C; Mellado Garcia, B R; Meloni, F; Mengarelli, A; Menke, S; Meoni, E; Mercurio, K M; Mergelmeyer, S; Meric, N; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Merritt, H; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, C; Meyer, J-P; Meyer, J; Middleton, R P; Migas, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Milstein, D; Minaenko, A A; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Ming, Y; Mir, L M; Mirabelli, G; Mitani, T; Mitrevski, J; Mitsou, V A; Mitsui, S; Miucci, A; Miyagawa, P S; Mjörnmark, J U; Moa, T; Mochizuki, K; Mohapatra, S; Mohr, W; Molander, S; Moles-Valls, R; Mönig, K; Monini, C; Monk, J; Monnier, E; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Moraes, A; Morange, N; Moreno, D; Moreno Llácer, M; Morettini, P; Morgenstern, M; Morii, M; Moritz, S; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Moser, H G; Mosidze, M; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Mouraviev, S V; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, K; Mueller, T; Mueller, T; Muenstermann, D; Munwes, Y; Murillo Quijada, J A; Murray, W J; Musheghyan, H; Musto, E; Myagkov, A G; Myska, M; Nackenhorst, O; Nadal, J; Nagai, K; Nagai, R; Nagai, Y; Nagano, K; Nagarkar, A; Nagasaka, Y; Nagel, M; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Namasivayam, H; Nanava, G; Narayan, R; Nattermann, T; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Nef, P D; Negri, A; Negri, G; Negrini, M; Nektarijevic, S; Nelson, A; Nelson, T K; Nemecek, S; Nemethy, P; Nepomuceno, A A; Nessi, M; Neubauer, M S; Neumann, M; Neves, R M; Nevski, P; Newman, P R; Nguyen, D H; Nickerson, R B; Nicolaidou, R; Nicquevert, B; Nielsen, J; Nikiforou, N; Nikiforov, A; Nikolaenko, V; Nikolic-Audit, I; Nikolics, K; Nikolopoulos, K; Nilsson, P; Ninomiya, Y; Nisati, A; Nisius, R; Nobe, T; Nodulman, L; Nomachi, M; Nomidis, I; Norberg, S; Nordberg, M; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nunes Hanninger, G; Nunnemann, T; Nurse, E; Nuti, F; O'Brien, B J; O'grady, F; O'Neil, D C; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, M I; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Okamura, W; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Olchevski, A G; Olivares Pino, S A; Oliveira Damazio, D; Oliver Garcia, E; Olszewski, A; Olszowska, J; Onofre, A; Onyisi, P U E; Oram, C J; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Oropeza Barrera, C; Orr, R S; Osculati, B; Ospanov, R; Otero Y Garzon, G; Otono, H; Ouchrif, M; Ouellette, E A; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Ovcharova, A; Owen, M; Ozcan, V E; Ozturk, N; Pachal, K; Pacheco Pages, A; Padilla Aranda, C; Pagáčová, M; Pagan Griso, S; Paganis, E; Pahl, C; Paige, F; Pais, P; Pajchel, K; Palacino, G; Palestini, S; Palka, M; Pallin, D; Palma, A; Palmer, J D; Pan, Y B; Panagiotopoulou, E; Panduro Vazquez, J G; Pani, P; Panikashvili, N; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Paredes Hernandez, D; Parker, M A; Parodi, F; Parsons, J A; Parzefall, U; Pasqualucci, E; Passaggio, S; Passeri, A; Pastore, F; Pastore, Fr; Pásztor, G; Pataraia, S; Patel, N D; Pater, J R; Patricelli, S; Pauly, T; Pearce, J; Pedersen, M; Pedraza Lopez, S; Pedro, R; Peleganchuk, S V; Pelikan, D; Peng, H; Penning, B; Penwell, J; Perepelitsa, D V; Perez Codina, E; Pérez García-Estañ, M T; Perez Reale, V; Perini, L; Pernegger, H; Perrino, R; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petrolo, E; Petrucci, F; Pettersson, N E; Pezoa, R; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Piccinini, M; Piegaia, R; Pignotti, D T; Pilcher, J E; Pilkington, A D; Pina, J; Pinamonti, M; Pinder, A; Pinfold, J L; Pingel, A; Pinto, B; Pires, S; Pitt, M; Pizio, C; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Plucinski, P; Poddar, S; Podlyski, F; Poettgen, R; Poggioli, L; Pohl, D; Pohl, M; Polesello, G; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Pontecorvo, L; Pope, B G; Popeneciu, G A; Popovic, D S; Poppleton, A; Portell Bueso, X; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Potter, C T; Poulard, G; Poveda, J; Pozdnyakov, V; Pralavorio, P; Pranko, A; Prasad, S; Pravahan, R; Prell, S; Price, D; Price, J; Price, L E; Prieur, D; Primavera, M; Proissl, M; Prokofiev, K; Prokoshin, F; Protopapadaki, E; Protopopescu, S; Proudfoot, J; Przybycien, M; Przysiezniak, H; Ptacek, E; Puddu, D; Pueschel, E; Puldon, D; Purohit, M; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Quarrie, D R; Quayle, W B; Queitsch-Maitland, M; Quilty, D; Qureshi, A; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Rajagopalan, S; Rammensee, M; Randle-Conde, A S; Rangel-Smith, C; Rao, K; Rauscher, F; Rave, T C; Ravenscroft, T; Raymond, M; Read, A L; Readioff, N P; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reeves, K; Rehnisch, L; Reisin, H; Relich, M; Rembser, C; Ren, H; Ren, Z L; Renaud, A; Rescigno, M; Resconi, S; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Ridel, M; Rieck, P; Rieger, J; Rijssenbeek, M; Rimoldi, A; Rinaldi, L; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Roda, C; Rodrigues, L; Roe, S; Røhne, O; Rolli, S; Romaniouk, A; Romano, M; Romero Adam, E; Rompotis, N; Ronzani, M; Roos, L; Ros, E; Rosati, S; Rosbach, K; Rose, M; Rose, P; Rosendahl, P L; Rosenthal, O; Rossetti, V; Rossi, E; Rossi, L P; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Royon, C R; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rubinskiy, I; Rud, V I; Rudolph, C; Rudolph, M S; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Ruschke, A; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryder, N C; Saavedra, A F; Sacerdoti, S; Saddique, A; Sadeh, I; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Sakamoto, H; Sakurai, Y; Salamanna, G; Salamon, A; Saleem, M; Salek, D; Sales De Bruin, P H; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sampsonidis, D; Sanchez, A; Sánchez, J; Sanchez Martinez, V; Sandaker, H; Sandbach, R L; Sander, H G; Sanders, M P; Sandhoff, M; Sandoval, T; Sandoval, C; Sandstroem, R; Sankey, D P C; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Santoyo Castillo, I; Sapp, K; Sapronov, A; Saraiva, J G; Sarrazin, B; Sartisohn, G; Sasaki, O; Sasaki, Y; Sauvage, G; Sauvan, E; Savard, P; Savu, D O; Sawyer, C; Sawyer, L; Saxon, D H; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schaefer, D; Schaefer, R; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Scherzer, M I; Schiavi, C; Schieck, J; Schillo, C; Schioppa, M; Schlenker, S; Schmidt, E; Schmieden, K; Schmitt, C; Schmitt, S; Schneider, B; Schnellbach, Y J; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schorlemmer, A L S; Schott, M; Schouten, D; Schovancova, J; Schramm, S; Schreyer, M; Schroeder, C; Schuh, N; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwanenberger, C; Schwartzman, A; Schwegler, Ph; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Schwindt, T; Schwoerer, M; Sciacca, F G; Scifo, E; Sciolla, G; Scott, W G; Scuri, F; Scutti, F; Searcy, J; Sedov, G; Sedykh, E; Seidel, S C; Seiden, A; Seifert, F; Seixas, J M; Sekhniaidze, G; Sekula, S J; Selbach, K E; Seliverstov, D M; Sellers, G; Semprini-Cesari, N; Serfon, C; Serin, L; Serkin, L; Serre, T; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shamim, M; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shehu, C Y; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shiyakova, M; Shmeleva, A; Shochet, M J; Short, D; Shrestha, S; Shulga, E; Shupe, M A; Shushkevich, S; Sicho, P; Sidiropoulou, O; Sidorov, D; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silver, Y; Silverstein, D; Silverstein, S B; Simak, V; Simard, O; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simoniello, R; Simonyan, M; Sinervo, P; Sinev, N B; Sipica, V; Siragusa, G; Sircar, A; Sisakyan, A N; Sivoklokov, S Yu; Sjölin, J; Sjursen, T B; Skottowe, H P; Skovpen, K Yu; Skubic, P; Slater, M; Slavicek, T; Sliwa, K; Smakhtin, V; Smart, B H; Smestad, L; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, K M; Smizanska, M; Smolek, K; Snesarev, A A; Snidero, G; Snyder, S; Sobie, R; Socher, F; Soffer, A; Soh, D A; Solans, C A; Solar, M; Solc, J; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Song, H Y; Soni, N; Sood, A; Sopczak, A; Sopko, B; Sopko, V; Sorin, V; Sosebee, M; Soualah, R; Soueid, P; Soukharev, A M; South, D; Spagnolo, S; Spanò, F; Spearman, W R; Spettel, F; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; Spreitzer, T; Spurlock, B; St Denis, R D; Staerz, S; Stahlman, J; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanescu-Bellu, M; Stanitzki, M M; Stapnes, S; Starchenko, E A; Stark, J; Staroba, P; Starovoitov, P; Staszewski, R; Stavina, P; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stern, S; Stewart, G A; Stillings, J A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strandlie, A; Strauss, E; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Subramaniam, R; Succurro, A; Sugaya, Y; Suhr, C; Suk, M; Sulin, V V; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Sundermann, J E; Suruliz, K; Susinno, G; Sutton, M R; Suzuki, Y; Svatos, M; Swedish, S; Swiatlowski, M; Sykora, I; Sykora, T; Ta, D; Taccini, C; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Taiblum, N; Takai, H; Takashima, R; Takeda, H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tam, J Y C; Tan, K G; Tanaka, J; Tanaka, R; Tanaka, S; Tanaka, S; Tanasijczuk, A J; Tannenwald, B B; Tannoury, N; Tapprogge, S; Tarem, S; Tarrade, F; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Tavares Delgado, A; Tayalati, Y; Taylor, F E; Taylor, G N; Taylor, W; Teischinger, F A; Teixeira Dias Castanheira, M; Teixeira-Dias, P; Temming, K K; Ten Kate, H; Teng, P K; Teoh, J J; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Therhaag, J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, E N; Thompson, P D; Thompson, P D; Thompson, R J; Thompson, A S; Thomsen, L A; Thomson, E; Thomson, M; Thong, W M; Thun, R P; Tian, F; Tibbetts, M J; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tiouchichine, E; Tipton, P; Tisserant, S; Todorov, T; Todorova-Nova, S; Toggerson, B; Tojo, J; Tokár, S; Tokushuku, K; Tollefson, K; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Topilin, N D; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Tran, H L; Trefzger, T; Tremblet, L; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Troncon, C; Trottier-McDonald, M; Trovatelli, M; True, P; Trzebinski, M; Trzupek, A; Tsarouchas, C; Tseng, J C-L; Tsiareshka, P V; Tsionou, D; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tudorache, A; Tudorache, V; Tuna, A N; Tupputi, S A; Turchikhin, S; Turecek, D; Turk Cakir, I; Turra, R; Tuts, P M; Tykhonov, A; Tylmad, M; Tyndel, M; Uchida, K; Ueda, I; Ueno, R; Ughetto, M; Ugland, M; Uhlenbrock, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urbaniec, D; Urquijo, P; Usai, G; Usanova, A; Vacavant, L; Vacek, V; Vachon, B; Valencic, N; Valentinetti, S; Valero, A; Valery, L; Valkar, S; Valladolid Gallego, E; Vallecorsa, S; Valls Ferrer, J A; Van Den Wollenberg, W; Van Der Deijl, P C; van der Geer, R; van der Graaf, H; Van Der Leeuw, R; van der Ster, D; van Eldik, N; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vanguri, R; Vaniachine, A; Vankov, P; Vannucci, F; Vardanyan, G; Vari, R; Varnes, E W; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vazeille, F; Vazquez Schroeder, T; Veatch, J; Veloso, F; Veneziano, S; Ventura, A; Ventura, D; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, J C; Vest, A; Vetterli, M C; Viazlo, O; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Vigne, R; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinogradov, V B; Virzi, J; Vivarelli, I; Vives Vaque, F; Vlachos, S; Vladoiu, D; Vlasak, M; Vogel, A; Vogel, M; Vokac, P; Volpi, G; Volpi, M; von der Schmitt, H; von Radziewski, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vu Anh, T; Vuillermet, R; Vukotic, I; Vykydal, Z; Wagner, P; Wagner, W; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wall, R; Waller, P; Walsh, B; Wang, C; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, K; Wang, R; Wang, S M; Wang, T; Wang, X; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Warsinsky, M; Washbrook, A; Wasicki, C; Watkins, P M; Watson, A T; Watson, I J; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, S; Weber, M S; Weber, S W; Webster, J S; Weidberg, A R; Weigell, P; Weinert, B; Weingarten, J; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wendland, D; Weng, Z; Wengler, T; Wenig, S; Wermes, N; Werner, M; Werner, P; Wessels, M; Wetter, J; Whalen, K; White, A; White, M J; White, R; White, S; Whiteson, D; Wicke, D; Wickens, F J; Wiedenmann, W; Wielers, M; Wienemann, P; Wiglesworth, C; Wiik-Fuchs, L A M; Wijeratne, P A; Wildauer, A; Wildt, M A; Wilkens, H G; Will, J Z; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, A; Wilson, J A; Wingerter-Seez, I; Winklmeier, F; Winter, B T; Wittgen, M; Wittig, T; Wittkowski, J; Wollstadt, S J; Wolter, M W; Wolters, H; Wosiek, B K; Wotschack, J; Woudstra, M J; Wozniak, K W; Wright, M; Wu, M; Wu, S L; Wu, X; Wu, Y; Wulf, E; Wyatt, T R; Wynne, B M; Xella, S; Xiao, M; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yakabe, R; Yamada, M; Yamaguchi, H; Yamaguchi, Y; Yamamoto, A; Yamamoto, K; Yamamoto, S; Yamamura, T; Yamanaka, T; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, U K; Yang, Y; Yanush, S; Yao, L; Yao, W-M; Yasu, Y; Yatsenko, E; Yau Wong, K H; Ye, J; Ye, S; Yeletskikh, I; Yen, A L; Yildirim, E; Yilmaz, M; Yoosoofmiya, R; Yorita, K; Yoshida, R; Yoshihara, K; Young, C; Young, C J S; Youssef, S; Yu, D R; Yu, J; Yu, J M; Yu, J; Yuan, L; Yurkewicz, A; Yusuff, I; Zabinski, B; Zaidan, R; Zaitsev, A M; Zaman, A; Zambito, S; Zanello, L; Zanzi, D; Zeitnitz, C; Zeman, M; Zemla, A; Zengel, K; Zenin, O; Zeniš, T; Zerwas, D; Zevi Della Porta, G; Zhang, D; Zhang, F; Zhang, H; Zhang, J; Zhang, L; Zhang, X; Zhang, Z; Zhao, Z; Zhemchugov, A; Zhong, J; Zhou, B; Zhou, L; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, R; Zimmermann, S; Zimmermann, S; Zinonos, Z; Ziolkowski, M; Zobernig, G; Zoccoli, A; Zur Nedden, M; Zurzolo, G; Zutshi, V; Zwalinski, L

2014-10-24

A search for scalar particles decaying via narrow resonances into two photons in the mass range 65-600 GeV is performed using 20.3  fb(-1) of √s 8 TeV pp collision data collected with the ATLAS detector at the Large Hadron Collider. The recently discovered Higgs boson is treated as a background. No significant evidence for an additional signal is observed. The results are presented as limits at the 95% confidence level on the production cross section of a scalar boson times branching ratio into two photons, in a fiducial volume where the reconstruction efficiency is approximately independent of the event topology. The upper limits set extend over a considerably wider mass range than previous searches.

Stochastic Leader Gravitational Search Algorithm for Enhanced Adaptive Beamforming Technique

PubMed Central

Darzi, Soodabeh; Islam, Mohammad Tariqul; Tiong, Sieh Kiong; Kibria, Salehin; Singh, Mandeep

2015-01-01

In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by eliminating the agents with the poorest performances to allow rapid convergence. The performance of the SL-GSA was analyzed for six well-known benchmark functions, and the results are compared with SGSA and some of its variants. Furthermore, the SL-GSA is applied to minimum variance distortionless response (MVDR) beamforming technique to ensure compatibility with real world optimization problems. The proposed algorithm demonstrates superior convergence rate and quality of solution for both real world problems and benchmark functions compared to original algorithm and other recent variants of SGSA. PMID:26552032

Psychosocial Adaptation to Disability Within the Context of Positive Psychology: Findings from the Literature.

PubMed

Martz, Erin; Livneh, Hanoch

2016-03-01

This purpose of this article is to review of the trends of research that examined positive psychology constructs in the context of adapting to chronic illness and disability (CID). This article examines the empirical findings on the relationships between six selected positive psychology-associated constructs (optimism, hope, resilience, benefit-finding, meaning-making, and post-traumatic growth) and adaptation to disability. Six positive psychology constructs were selected to represent the trends found in recent literature published on CID. The process of choosing these six variables included reviewing chapters on positive psychology and CID, reviewing the top rehabilitation journals that typically publish articles on psychosocial adaptation to CID, using search engines to find relevant journal articles published since the year 2000, and selecting the most important constructs based on the authors’ professional judgment. The available evidence supports the unique benefits of these six positive psychology constructs in predicting successful adaptation to a range of disabling conditions. Based on the available findings, the authors offer four suggestions for occupational rehabilitation researchers.

A coronagraphic search for brown dwarfs around nearby stars

NASA Technical Reports Server (NTRS)

Nakajima, T.; Durrance, S. T.; Golimowski, D. A.; Kulkarni, S. R.

1994-01-01

Brown dwarf companions have been searched for around stars within 10 pc of the Sun using the Johns-Hopkins University Adaptive Optics Coronagraph (AOC), a stellar coronagraph with an image stabilizer. The AOC covers the field around the target star with a minimum search radius of 1 sec .5 and a field of view of 1 arcmin sq. We have reached an unprecedented dynamic range of Delta m = 13 in our search for faint companions at I band. Comparison of our survey with other brown dwarf searches shows that the AOC technique is unique in its dynamic range while at the same time just as sensitive to brown dwarfs as the recent brown dwarf surveys. The present survey covered 24 target stars selected from the Gliese catalog. A total of 94 stars were detected in 16 fields. The low-latitude fields are completely dominated by background star contamination. Kolmogorov-Smirnov tests were carried out for a sample restricted to high latitudes and a sample with small angular separations. The high-latitude sample (b greater than or equal to 44 deg) appears to show spatial concentration toward target stars. The small separation sample (Delta Theta less than 20 sec) shows weaker dependence on Galactic coordinates than field stars. These statistical tests suggest that both the high-latitude sample and the small separation sample can include a substantial fraction of true companions. However, the nature of these putative companions is mysterious. They are too faint to be white dwarfs and too blue for brown dwarfs. Ignoring the signif icance of the statistical tests, we can reconcile most of the detections with distant main-sequence stars or white dwarfs except for a candidate next to GL 475. Given the small size of our sample, we conclude that considerably more targets need to be surveyed before a firm conclusion on the possibility of a new class of companions can be made.

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors

PubMed Central

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-01-01

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison. PMID:29614028

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors.

PubMed

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-04-03

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison.

Searching For Vulcanoids

NASA Astrophysics Data System (ADS)

Campins, H.; Davis, D. R.; Weidenschilling, S. J.; Magee, M.

Vulcanoids are a hypothesized population of small asteroid-like bodies in orbits interior to that of Mercury. Their presence or absence would be an important test of cosmogonical theories. There are significant dynamical and thermodynamical constraints that restrict the search area roughly to the ecliptic in the range of 0.1 to 0.25 AU from the Sun. Previous searches rule out only bodies with radii greater than about 50--100 km. We estimate that with current technology a search with a limiting magnitude of 6 at 3.5 microns might be feasible. This limiting magnitude corresponds approximately to the smallest (1 km) objects expected to have survived in this region over the age of the solar system. If such a search were carried out, even the absence of detections would yield definitive results.

Health search engine with e-document analysis for reliable search results.

PubMed

Gaudinat, Arnaud; Ruch, Patrick; Joubert, Michel; Uziel, Philippe; Strauss, Anne; Thonnet, Michèle; Baud, Robert; Spahni, Stéphane; Weber, Patrick; Bonal, Juan; Boyer, Celia; Fieschi, Marius; Geissbuhler, Antoine

2006-01-01

After a review of the existing practical solution available to the citizen to retrieve eHealth document, the paper describes an original specialized search engine WRAPIN. WRAPIN uses advanced cross lingual information retrieval technologies to check information quality by synthesizing medical concepts, conclusions and references contained in the health literature, to identify accurate, relevant sources. Thanks to MeSH terminology [1] (Medical Subject Headings from the U.S. National Library of Medicine) and advanced approaches such as conclusion extraction from structured document, reformulation of the query, WRAPIN offers to the user a privileged access to navigate through multilingual documents without language or medical prerequisites. The results of an evaluation conducted on the WRAPIN prototype show that results of the WRAPIN search engine are perceived as informative 65% (59% for a general-purpose search engine), reliable and trustworthy 72% (41% for the other engine) by users. But it leaves room for improvement such as the increase of database coverage, the explanation of the original functionalities and an audience adaptability. Thanks to evaluation outcomes, WRAPIN is now in exploitation on the HON web site (http://www.healthonnet.org), free of charge. Intended to the citizen it is a good alternative to general-purpose search engines when the user looks up trustworthy health and medical information or wants to check automatically a doubtful content of a Web page.

Intestinal mucosal atrophy and adaptation

PubMed Central

Shaw, Darcy; Gohil, Kartik; Basson, Marc D

2012-01-01

Mucosal adaptation is an essential process in gut homeostasis. The intestinal mucosa adapts to a range of pathological conditions including starvation, short-gut syndrome, obesity, and bariatric surgery. Broadly, these adaptive functions can be grouped into proliferation and differentiation. These are influenced by diverse interactions with hormonal, immune, dietary, nervous, and mechanical stimuli. It seems likely that clinical outcomes can be improved by manipulating the physiology of adaptation. This review will summarize current understanding of the basic science surrounding adaptation, delineate the wide range of potential targets for therapeutic intervention, and discuss how these might be incorporated into an overall treatment plan. Deeper insight into the physiologic basis of adaptation will identify further targets for intervention to improve clinical outcomes. PMID:23197881

Robots that can adapt like animals.

PubMed

Cully, Antoine; Clune, Jeff; Tarapore, Danesh; Mouret, Jean-Baptiste

2015-05-28

Robots have transformed many industries, most notably manufacturing, and have the power to deliver tremendous benefits to society, such as in search and rescue, disaster response, health care and transportation. They are also invaluable tools for scientific exploration in environments inaccessible to humans, from distant planets to deep oceans. A major obstacle to their widespread adoption in more complex environments outside factories is their fragility. Whereas animals can quickly adapt to injuries, current robots cannot 'think outside the box' to find a compensatory behaviour when they are damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. A promising approach to reducing robot fragility involves having robots learn appropriate behaviours in response to damage, but current techniques are slow even with small, constrained search spaces. Here we introduce an intelligent trial-and-error algorithm that allows robots to adapt to damage in less than two minutes in large search spaces without requiring self-diagnosis or pre-specified contingency plans. Before the robot is deployed, it uses a novel technique to create a detailed map of the space of high-performing behaviours. This map represents the robot's prior knowledge about what behaviours it can perform and their value. When the robot is damaged, it uses this prior knowledge to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a behaviour that compensates for the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new algorithm will enable more robust, effective, autonomous robots, and may shed light on the principles

Robots that can adapt like animals

NASA Astrophysics Data System (ADS)

Cully, Antoine; Clune, Jeff; Tarapore, Danesh; Mouret, Jean-Baptiste

2015-05-01

Robots have transformed many industries, most notably manufacturing, and have the power to deliver tremendous benefits to society, such as in search and rescue, disaster response, health care and transportation. They are also invaluable tools for scientific exploration in environments inaccessible to humans, from distant planets to deep oceans. A major obstacle to their widespread adoption in more complex environments outside factories is their fragility. Whereas animals can quickly adapt to injuries, current robots cannot `think outside the box' to find a compensatory behaviour when they are damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. A promising approach to reducing robot fragility involves having robots learn appropriate behaviours in response to damage, but current techniques are slow even with small, constrained search spaces. Here we introduce an intelligent trial-and-error algorithm that allows robots to adapt to damage in less than two minutes in large search spaces without requiring self-diagnosis or pre-specified contingency plans. Before the robot is deployed, it uses a novel technique to create a detailed map of the space of high-performing behaviours. This map represents the robot's prior knowledge about what behaviours it can perform and their value. When the robot is damaged, it uses this prior knowledge to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a behaviour that compensates for the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new algorithm will enable more robust, effective, autonomous robots, and may shed light on the principles

Adaptive process control using fuzzy logic and genetic algorithms

NASA Technical Reports Server (NTRS)

Karr, C. L.

1993-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

Search and the Aging Mind: The Promise and Limits of the Cognitive Control Hypothesis of Age Differences in Search.

PubMed

Mata, Rui; von Helversen, Bettina

2015-07-01

Search is a prerequisite for successful performance in a broad range of tasks ranging from making decisions between consumer goods to memory retrieval. How does aging impact search processes in such disparate situations? Aging is associated with structural and neuromodulatory brain changes that underlie cognitive control processes, which in turn have been proposed as a domain-general mechanism controlling search in external environments as well as memory. We review the aging literature to evaluate the cognitive control hypothesis that suggests that age-related change in cognitive control underlies age differences in both external and internal search. We also consider the limits of the cognitive control hypothesis and propose additional mechanisms such as changes in strategy use and affect that may be necessary to understand how aging affects search. Copyright © 2015 Cognitive Science Society, Inc.

Integrating Climate Change Adaptation into Public Health Practice: Using Adaptive Management to Increase Adaptive Capacity and Build Resilience

PubMed Central

McDowell, Julia Z.; Luber, George

2011-01-01

Background: Climate change is expected to have a range of health impacts, some of which are already apparent. Public health adaptation is imperative, but there has been little discussion of how to increase adaptive capacity and resilience in public health systems. Objectives: We explored possible explanations for the lack of work on adaptive capacity, outline climate–health challenges that may lie outside public health’s coping range, and consider changes in practice that could increase public health’s adaptive capacity. Methods: We conducted a substantive, interdisciplinary literature review focused on climate change adaptation in public health, social learning, and management of socioeconomic systems exhibiting dynamic complexity. Discussion: There are two competing views of how public health should engage climate change adaptation. Perspectives differ on whether climate change will primarily amplify existing hazards, requiring enhancement of existing public health functions, or present categorically distinct threats requiring innovative management strategies. In some contexts, distinctly climate-sensitive health threats may overwhelm public health’s adaptive capacity. Addressing these threats will require increased emphasis on institutional learning, innovative management strategies, and new and improved tools. Adaptive management, an iterative framework that embraces uncertainty, uses modeling, and integrates learning, may be a useful approach. We illustrate its application to extreme heat in an urban setting. Conclusions: Increasing public health capacity will be necessary for certain climate–health threats. Focusing efforts to increase adaptive capacity in specific areas, promoting institutional learning, embracing adaptive management, and developing tools to facilitate these processes are important priorities and can improve the resilience of local public health systems to climate change. PMID:21997387

Parameter learning for performance adaptation

NASA Technical Reports Server (NTRS)

Peek, Mark D.; Antsaklis, Panos J.

1990-01-01

A parameter learning method is introduced and used to broaden the region of operability of the adaptive control system of a flexible space antenna. The learning system guides the selection of control parameters in a process leading to optimal system performance. A grid search procedure is used to estimate an initial set of parameter values. The optimization search procedure uses a variation of the Hooke and Jeeves multidimensional search algorithm. The method is applicable to any system where performance depends on a number of adjustable parameters. A mathematical model is not necessary, as the learning system can be used whenever the performance can be measured via simulation or experiment. The results of two experiments, the transient regulation and the command following experiment, are presented.

Cooperative search and rescue with artificial fishes based on fish-swarm algorithm for underwater wireless sensor networks.

PubMed

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

PubMed Central

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

Making a Library Catalog Adaptive.

ERIC Educational Resources Information Center

Buckland, Michael K.; And Others

1992-01-01

Describes the design of a prototype adaptive online catalog that was implemented as a transparent workstation-based front end system to MELVYL, the online catalog for the University of California libraries. Problems with searching bibliographic retrieval systems are reviewed, including irrelevant retrievals and the inexperience of most users.…

Study of genetic direct search algorithms for function optimization

NASA Technical Reports Server (NTRS)

Zeigler, B. P.

1974-01-01

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Search strategies

NASA Astrophysics Data System (ADS)

Oliver, B. M.

Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.

The "new normal": Adapting doctoral trainee career preparation for broad career paths in science.

PubMed

St Clair, Rebekah; Hutto, Tamara; MacBeth, Cora; Newstetter, Wendy; McCarty, Nael A; Melkers, Julia

2017-01-01

Doctoral recipients in the biomedical sciences and STEM fields are showing increased interest in career opportunities beyond academic positions. While recent research has addressed the interests and preferences of doctoral trainees for non-academic careers, the strategies and resources that trainees use to prepare for a broad job market (non-academic) are poorly understood. The recent adaptation of the Social Cognitive Career Theory to explicitly highlight the interplay of contextual support mechanisms, individual career search efficacy, and self-adaptation of job search processes underscores the value of attention to this explicit career phase. Our research addresses the factors that affect the career search confidence and job search strategies of doctoral trainees with non-academic career interests and is based on nearly 900 respondents from an NIH-funded survey of doctoral students and postdoctoral fellows in the biomedical sciences at two U.S. universities. Using structural equation modeling, we find that trainees pursuing non-academic careers, and/or with low perceived program support for career goals, have lower career development and search process efficacy (CDSE), and receive different levels of support from their advisors/supervisors. We also find evidence of trainee adaptation driven by their career search efficacy, and not by career interests.

Frequent conjugative transfer accelerates adaptation of a broad-host-range plasmid to an unfavorable Pseudomonas putida host.

PubMed

Heuer, Holger; Fox, Randal E; Top, Eva M

2007-03-01

IncP-1 plasmids are known to be promiscuous, but it is not understood if they are equally well adapted to various species within their host range. Moreover, little is known about their fate in bacterial communities. We determined if the IncP-1beta plasmid pB10 was unstable in some Proteobacteria, and whether plasmid stability was enhanced after long-term carriage in a single host and when regularly switched between isogenic hosts. Plasmid pB10 was found to be very unstable in Pseudomonas putida H2, and conferred a high cost (c. 20% decrease in fitness relative to the plasmid-free host). H2(pB10) was then evolved under conditions that selected for plasmid maintenance, with or without regular plasmid transfer (host-switching). When tested in the ancestral host, the evolved plasmids were more stable and their cost was significantly reduced (9% and 16% for plasmids from host-switched and nonswitched lineages, respectively). Our findings suggest that IncP-1 plasmids can rapidly adapt to an unfavorable host by improving their overall stability, and that regular conjugative transfer accelerates this process.

Content range and precision of a computer adaptive test of upper extremity function for children with cerebral palsy.

PubMed

Montpetit, Kathleen; Haley, Stephen; Bilodeau, Nathalie; Ni, Pengsheng; Tian, Feng; Gorton, George; Mulcahey, M J

2011-02-01

This article reports on the content range and measurement precision of an upper extremity (UE) computer adaptive testing (CAT) platform of physical function in children with cerebral palsy. Upper extremity items representing skills of all abilities were administered to 305 parents. These responses were compared with two traditional standardized measures: Pediatric Outcomes Data Collection Instrument and Functional Independence Measure for Children. The UE CAT correlated strongly with the upper extremity component of these measures and had greater precision when describing individual functional ability. The UE item bank has wider range with items populating the lower end of the ability spectrum. This new UE item bank and CAT have the capability to quickly assess children of all ages and abilities with good precision and, most importantly, with items that are meaningful and appropriate for their age and level of physical function.

A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds

NASA Technical Reports Server (NTRS)

Lewis, Robert Michael; Torczon, Virginia

1998-01-01

We give a pattern search adaptation of an augmented Lagrangian method due to Conn, Gould, and Toint. The algorithm proceeds by successive bound constrained minimization of an augmented Lagrangian. In the pattern search adaptation we solve this subproblem approximately using a bound constrained pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of this subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. So far as we know, this is the first provably convergent direct search method for general nonlinear programming.

Second Graders Learn Animal Adaptations through Form and Function Analogy Object Boxes

ERIC Educational Resources Information Center

Rule, Audrey C.; Baldwin, Samantha; Schell, Robert

2008-01-01

This study examined the use of form and function analogy object boxes to teach second graders (n = 21) animal adaptations. The study used a pretest-posttest design to examine animal adaptation content learned through focused analogy activities as compared with reading and Internet searches for information about adaptations of animals followed by…

Are adaptation costs necessary to build up a local adaptation pattern?

PubMed

Magalhães, Sara; Blanchet, Elodie; Egas, Martijn; Olivieri, Isabelle

2009-08-03

Ecological specialization is pervasive in phytophagous arthropods. In such specialization mode, limits to host range are imposed by trade-offs preventing adaptation to several hosts. The occurrence of such trade-offs is inferred by a pattern of local adaptation, i.e., a negative correlation between relative performance on different hosts. To establish a causal link between local adaptation and trade-offs, we performed experimental evolution of spider mites on cucumber, tomato and pepper, starting from a population adapted to cucumber. Spider mites adapted to each novel host within 15 generations and no further evolution was observed at generation 25. A pattern of local adaptation was found, as lines evolving on a novel host performed better on that host than lines evolving on other hosts. However, costs of adaptation were absent. Indeed, lines adapted to tomato had similar or higher performance on pepper than lines evolving on the ancestral host (which represent the initial performance of all lines) and the converse was also true, e.g. negatively correlated responses were not observed on the alternative novel host. Moreover, adapting to novel hosts did not result in decreased performance on the ancestral host. Adaptation did not modify host ranking, as all lines performed best on the ancestral host. Furthermore, mites from all lines preferred the ancestral to novel hosts. Mate choice experiments indicated that crosses between individuals from the same or from a different selection regime were equally likely, hence development of reproductive isolation among lines adapted to different hosts is unlikely. Therefore, performance and preference are not expected to impose limits to host range in our study species. Our results show that the evolution of a local adaptation pattern is not necessarily associated with the evolution of an adaptation cost.

An Application of the Rasch Model to Computerized Adaptive Testing.

ERIC Educational Resources Information Center

Wisniewski, Dennis R.

Three questions concerning the Binary Search Method (BSM) of computerized adaptive testing were studied: (1) whether it provided a reliable and valid estimation of examinee ability; (2) its effect on examinee attitudes toward computerized adaptive testing and conventional paper-and-pencil testing; and (3) the relationship between item response…

Plasticity in reproduction and growth among 52 range-wide populations of a Mediterranean conifer: adaptive responses to environmental stress.

PubMed

Santos-Del-Blanco, L; Bonser, S P; Valladares, F; Chambel, M R; Climent, J

2013-09-01

A plastic response towards enhanced reproduction is expected in stressful environments, but it is assumed to trade off against vegetative growth and efficiency in the use of available resources deployed in reproduction [reproductive efficiency (RE)]. Evidence supporting this expectation is scarce for plants, particularly for long-lived species. Forest trees such as Mediterranean pines provide ideal models to study the adaptive value of allocation to reproduction vs. vegetative growth given their among-population differentiation for adaptive traits and their remarkable capacity to cope with dry and low-fertility environments. We studied 52 range-wide Pinus halepensis populations planted into two environmentally contrasting sites during their initial reproductive stage. We investigated the effect of site, population and their interaction on vegetative growth, threshold size for female reproduction, reproductive-vegetative size relationships and RE. We quantified correlations among traits and environmental variables to identify allocation trade-offs and ecotypic trends. Genetic variation for plasticity was high for vegetative growth, whereas it was nonsignificant for reproduction. Size-corrected reproduction was enhanced in the more stressful site supporting the expectation for adverse conditions to elicit plastic responses in reproductive allometry. However, RE was unrelated with early reproductive investment. Our results followed theoretical predictions and support that phenotypic plasticity for reproduction is adaptive under stressful environments. Considering expectations of increased drought in the Mediterranean, we hypothesize that phenotypic plasticity together with natural selection on reproductive traits will play a relevant role in the future adaptation of forest tree species. © 2013 The Authors. Journal of Evolutionary Biology © 2013 European Society For Evolutionary Biology.

Adaptive learning and control for MIMO system based on adaptive dynamic programming.

PubMed

Fu, Jian; He, Haibo; Zhou, Xinmin

2011-07-01

Adaptive dynamic programming (ADP) is a promising research field for design of intelligent controllers, which can both learn on-the-fly and exhibit optimal behavior. Over the past decades, several generations of ADP design have been proposed in the literature, which have demonstrated many successful applications in various benchmarks and industrial applications. While many of the existing researches focus on multiple-inputs-single-output system with steepest descent search, in this paper we investigate a generalized multiple-input-multiple-output (GMIMO) ADP design for online learning and control, which is more applicable to a wide range of practical real-world applications. Furthermore, an improved weight-updating algorithm based on recursive Levenberg-Marquardt methods is presented and embodied in the GMIMO approach to improve its performance. Finally, we test the performance of this approach based on a practical complex system, namely, the learning and control of the tension and height of the looper system in a hot strip mill. Experimental results demonstrate that the proposed approach can achieve effective and robust performance.

Adaptive and accelerated tracking-learning-detection

NASA Astrophysics Data System (ADS)

Guo, Pengyu; Li, Xin; Ding, Shaowen; Tian, Zunhua; Zhang, Xiaohu

2013-08-01

An improved online long-term visual tracking algorithm, named adaptive and accelerated TLD (AA-TLD) based on Tracking-Learning-Detection (TLD) which is a novel tracking framework has been introduced in this paper. The improvement focuses on two aspects, one is adaption, which makes the algorithm not dependent on the pre-defined scanning grids by online generating scale space, and the other is efficiency, which uses not only algorithm-level acceleration like scale prediction that employs auto-regression and moving average (ARMA) model to learn the object motion to lessen the detector's searching range and the fixed number of positive and negative samples that ensures a constant retrieving time, but also CPU and GPU parallel technology to achieve hardware acceleration. In addition, in order to obtain a better effect, some TLD's details are redesigned, which uses a weight including both normalized correlation coefficient and scale size to integrate results, and adjusts distance metric thresholds online. A contrastive experiment on success rate, center location error and execution time, is carried out to show a performance and efficiency upgrade over state-of-the-art TLD with partial TLD datasets and Shenzhou IX return capsule image sequences. The algorithm can be used in the field of video surveillance to meet the need of real-time video tracking.

DARK ADAPTATION IN DINEUTES

PubMed Central

Clark, Leonard B.

1938-01-01

The level of dark adaptation of the whirligig beetle can be measured in terms of the threshold intensity calling forth a response. The course of dark adaptation was determined at levels of light adaptation of 6.5, 91.6, and 6100 foot-candles. All data can be fitted by the same curve. This indicates that dark adaptation follows parts of the same course irrespective of the level of light adaptation. The intensity of the adapting light determines the level at which dark adaptation will begin. The relation between log aI 0 (instantaneous threshold) and log of adapting light intensity is linear over the range studied. PMID:19873056

A Prototype Search Toolkit

NASA Astrophysics Data System (ADS)

Knepper, Margaret M.; Fox, Kevin L.; Frieder, Ophir

Information overload is now a reality. We no longer worry about obtaining a sufficient volume of data; we now are concerned with sifting and understanding the massive volumes of data available to us. To do so, we developed an integrated information processing toolkit that provides the user with a variety of ways to view their information. The views include keyword search results, a domain specific ranking system that allows for adaptively capturing topic vocabularies to customize and focus the search results, navigation pages for browsing, and a geospatial and temporal component to visualize results in time and space, and provide “what if” scenario playing. Integrating the information from different tools and sources gives the user additional information and another way to analyze the data. An example of the integration is illustrated on reports of the avian influenza (bird flu).

Searching CA Condensates, On-Line and Batch.

ERIC Educational Resources Information Center

Kaminecki, Ronald M.; And Others

Batch mode processing is compared, using cost-effectiveness, with on-line processing for computer-aided searching of chemical abstracts. Consideration for time, need, coverage, and adaptability are found to be the criteria by which a searcher selects a method, and sometimes both methods are used. There is a tradeoff between batch mode's slower…

High dynamic range adaptive real-time smart camera: an overview of the HDR-ARTiST project

NASA Astrophysics Data System (ADS)

Lapray, Pierre-Jean; Heyrman, Barthélémy; Ginhac, Dominique

2015-04-01

Standard cameras capture only a fraction of the information that is visible to the human visual system. This is specifically true for natural scenes including areas of low and high illumination due to transitions between sunlit and shaded areas. When capturing such a scene, many cameras are unable to store the full Dynamic Range (DR) resulting in low quality video where details are concealed in shadows or washed out by sunlight. The imaging technique that can overcome this problem is called HDR (High Dynamic Range) imaging. This paper describes a complete smart camera built around a standard off-the-shelf LDR (Low Dynamic Range) sensor and a Virtex-6 FPGA board. This smart camera called HDR-ARtiSt (High Dynamic Range Adaptive Real-time Smart camera) is able to produce a real-time HDR live video color stream by recording and combining multiple acquisitions of the same scene while varying the exposure time. This technique appears as one of the most appropriate and cheapest solution to enhance the dynamic range of real-life environments. HDR-ARtiSt embeds real-time multiple captures, HDR processing, data display and transfer of a HDR color video for a full sensor resolution (1280 1024 pixels) at 60 frames per second. The main contributions of this work are: (1) Multiple Exposure Control (MEC) dedicated to the smart image capture with alternating three exposure times that are dynamically evaluated from frame to frame, (2) Multi-streaming Memory Management Unit (MMMU) dedicated to the memory read/write operations of the three parallel video streams, corresponding to the different exposure times, (3) HRD creating by combining the video streams using a specific hardware version of the Devebecs technique, and (4) Global Tone Mapping (GTM) of the HDR scene for display on a standard LCD monitor.

A hybrid, auto-adaptive and rule-based multi-agent approach using evolutionary algorithms for improved searching

NASA Astrophysics Data System (ADS)

Izquierdo, Joaquín; Montalvo, Idel; Campbell, Enrique; Pérez-García, Rafael

2016-08-01

Selecting the most appropriate heuristic for solving a specific problem is not easy, for many reasons. This article focuses on one of these reasons: traditionally, the solution search process has operated in a given manner regardless of the specific problem being solved, and the process has been the same regardless of the size, complexity and domain of the problem. To cope with this situation, search processes should mould the search into areas of the search space that are meaningful for the problem. This article builds on previous work in the development of a multi-agent paradigm using techniques derived from knowledge discovery (data-mining techniques) on databases of so-far visited solutions. The aim is to improve the search mechanisms, increase computational efficiency and use rules to enrich the formulation of optimization problems, while reducing the search space and catering to realistic problems.

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.

PubMed

Coelho, V N; Coelho, I M; Souza, M J F; Oliveira, T A; Cota, L P; Haddad, M N; Mladenovic, N; Silva, R C P; Guimarães, F G

2016-01-01

This article presents an Evolution Strategy (ES)--based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure. In view of the specific local search operators for each individual, the proposed population-based approach also fits into the context of the Memetic Algorithms. The proposed variant uses the Greedy Randomized Adaptive Search Procedure with different greedy parameters for generating its initial population, providing an interesting exploration-exploitation balance. To validate the proposal, this framework is applied to solve three different [Formula: see text]-Hard combinatorial optimization problems: an Open-Pit-Mining Operational Planning Problem with dynamic allocation of trucks, an Unrelated Parallel Machine Scheduling Problem with Setup Times, and the calibration of a hybrid fuzzy model for Short-Term Load Forecasting. Computational results point out the convergence of the proposed model and highlight its ability in combining the application of move operations from distinct neighborhood structures along the optimization. The results gathered and reported in this article represent a collective evidence of the performance of the method in challenging combinatorial optimization problems from different application domains. The proposed evolution strategy demonstrates an ability of adapting the strength of the mutation disturbance during the generations of its evolution process. The effectiveness of the proposal motivates the application of this novel evolutionary framework for solving other combinatorial optimization problems.

The “new normal”: Adapting doctoral trainee career preparation for broad career paths in science

PubMed Central

St. Clair, Rebekah; Hutto, Tamara; MacBeth, Cora; Newstetter, Wendy; McCarty, Nael A.

2017-01-01

Doctoral recipients in the biomedical sciences and STEM fields are showing increased interest in career opportunities beyond academic positions. While recent research has addressed the interests and preferences of doctoral trainees for non-academic careers, the strategies and resources that trainees use to prepare for a broad job market (non-academic) are poorly understood. The recent adaptation of the Social Cognitive Career Theory to explicitly highlight the interplay of contextual support mechanisms, individual career search efficacy, and self-adaptation of job search processes underscores the value of attention to this explicit career phase. Our research addresses the factors that affect the career search confidence and job search strategies of doctoral trainees with non-academic career interests and is based on nearly 900 respondents from an NIH-funded survey of doctoral students and postdoctoral fellows in the biomedical sciences at two U.S. universities. Using structural equation modeling, we find that trainees pursuing non-academic careers, and/or with low perceived program support for career goals, have lower career development and search process efficacy (CDSE), and receive different levels of support from their advisors/supervisors. We also find evidence of trainee adaptation driven by their career search efficacy, and not by career interests. PMID:28542304

Finding "hard to find" literature on hard to find groups: A novel technique to search grey literature on refugees and asylum seekers.

PubMed

Enticott, Joanne; Buck, Kimberly; Shawyer, Frances

2018-03-01

There is a lack of information on how to execute effective searches of the grey literature on refugee and asylum seeker groups for inclusion in systematic reviews. High-quality government reports and other grey literature relevant to refugees may not always be identified in conventional literature searches. During the process of conducting a recent systematic review, we developed a novel strategy for systematically searching international refugee and asylum seeker-related grey literature. The approach targets governmental health departments and statistical agencies, who have considerable access to refugee and asylum seeker populations for research purposes but typically do not publish findings in academic forums. Compared to a conventional grey literature search strategy, our novel technique yielded an eightfold increase in relevant high-quality grey sources that provided valuable content in informing our review. Incorporating a search of the grey literature into systematic reviews of refugee and asylum seeker research is essential to providing a more complete view of the evidence. Our novel strategy offers a practical and feasible method of conducting systematic grey literature searches that may be adaptable to a range of research questions, contexts, and resource constraints. Copyright © 2017 John Wiley & Sons, Ltd.

Adaptive phenotypic plasticity and local adaptation for temperature tolerance in freshwater zooplankton

PubMed Central

Yampolsky, Lev Y.; Schaer, Tobias M. M.; Ebert, Dieter

2014-01-01

Many organisms have geographical distributions extending from the tropics to near polar regions or can experience up to 30°C temperature variation within the lifespan of an individual. Two forms of evolutionary adaptation to such wide ranges in ambient temperatures are frequently discussed: local adaptation and phenotypic plasticity. The freshwater planktonic crustacean Daphnia magna, whose range extends from South Africa to near arctic sites, shows strong phenotypic and genotypic variation in response to temperature. In this study, we use D. magna clones from 22 populations (one clone per population) ranging from latitude 0° (Kenya) to 66° North (White Sea) to explore the contributions of phenotypic plasticity and local adaptation to high temperature tolerance. Temperature tolerance was studied as knockout time (time until immobilization, Timm) at 37°C in clones acclimatized to either 20°C or 28°C. Acclimatization to 28°C strongly increased Timm, testifying to adaptive phenotypic plasticity. At the same time, Timm significantly correlated with average high temperature at the clones’ sites of origin, suggesting local adaptation. As earlier studies have found that haemoglobin expression contributes to temperature tolerance, we also quantified haemoglobin concentration in experimental animals and found that both acclimatization temperature (AccT) and temperature at the site of origin are positively correlated with haemoglobin concentration. Furthermore, Daphnia from warmer climates upregulate haemoglobin much more strongly in response to AccT, suggesting local adaptation for plasticity in haemoglobin expression. Our results show that both local adaptation and phenotypic plasticity contribute to temperature tolerance, and elucidate a possible role of haemoglobin in mediating these effects that differs along a cold–warm gradient. PMID:24352948

Adaptive Process Control with Fuzzy Logic and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Karr, C. L.

1993-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision-making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

Adapt

NASA Astrophysics Data System (ADS)

Bargatze, L. F.

2015-12-01

Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted

In search of a general theory of species' range evolution.

PubMed

Connallon, Tim; Sgrò, Carla M

2018-06-13

Despite the pervasiveness of the world's biodiversity, no single species has a truly global distribution. In fact, most species have very restricted distributions. What limits species from expanding beyond their current geographic ranges? This has been classically treated by ecologists as an ecological problem and by evolutionary biologist as an evolutionary problem. Such a dichotomy is false-the problem of species' ranges sits firmly within the realm of evolutionary ecology. In support of this view, Polechová presents new theory that explains species' range limits with reference to two key factors central to both ecological and evolutionary theory-migration and population size. This new model sets the scene for empirical tests of range limit theory and builds the case for assisted gene flow as a key management tool for threatened species.

Respiratory syncytial virus tracking using internet search engine data.

PubMed

Oren, Eyal; Frere, Justin; Yom-Tov, Eran; Yom-Tov, Elad

2018-04-03

Respiratory Syncytial Virus (RSV) is the leading cause of hospitalization in children less than 1 year of age in the United States. Internet search engine queries may provide high resolution temporal and spatial data to estimate and predict disease activity. After filtering an initial list of 613 symptoms using high-resolution Bing search logs, we used Google Trends data between 2004 and 2016 for a smaller list of 50 terms to build predictive models of RSV incidence for five states where long-term surveillance data was available. We then used domain adaptation to model RSV incidence for the 45 remaining US states. Surveillance data sources (hospitalization and laboratory reports) were highly correlated, as were laboratory reports with search engine data. The four terms which were most often statistically significantly correlated as time series with the surveillance data in the five state models were RSV, flu, pneumonia, and bronchiolitis. Using our models, we tracked the spread of RSV by observing the time of peak use of the search term in different states. In general, the RSV peak moved from south-east (Florida) to the north-west US. Our study represents the first time that RSV has been tracked using Internet data results and highlights successful use of search filters and domain adaptation techniques, using data at multiple resolutions. Our approach may assist in identifying spread of both local and more widespread RSV transmission and may be applicable to other seasonal conditions where comprehensive epidemiological data is difficult to collect or obtain.

Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem

NASA Astrophysics Data System (ADS)

Quan, Zhe; Wu, Lei

2017-09-01

This article investigates the use of parallel computing for solving the disjunctively constrained knapsack problem. The proposed parallel computing model can be viewed as a cooperative algorithm based on a multi-neighbourhood search. The cooperation system is composed of a team manager and a crowd of team members. The team members aim at applying their own search strategies to explore the solution space. The team manager collects the solutions from the members and shares the best one with them. The performance of the proposed method is evaluated on a group of benchmark data sets. The results obtained are compared to those reached by the best methods from the literature. The results show that the proposed method is able to provide the best solutions in most cases. In order to highlight the robustness of the proposed parallel computing model, a new set of large-scale instances is introduced. Encouraging results have been obtained.

Strategies to overcome photobleaching in algorithm-based adaptive optics for nonlinear in-vivo imaging.

PubMed

Caroline Müllenbroich, M; McGhee, Ewan J; Wright, Amanda J; Anderson, Kurt I; Mathieson, Keith

2014-01-01

We have developed a nonlinear adaptive optics microscope utilizing a deformable membrane mirror (DMM) and demonstrated its use in compensating for system- and sample-induced aberrations. The optimum shape of the DMM was determined with a random search algorithm optimizing on either two photon fluorescence or second harmonic signals as merit factors. We present here several strategies to overcome photobleaching issues associated with lengthy optimization routines by adapting the search algorithm and the experimental methodology. Optimizations were performed on extrinsic fluorescent dyes, fluorescent beads loaded into organotypic tissue cultures and the intrinsic second harmonic signal of these cultures. We validate the approach of using these preoptimized mirror shapes to compile a robust look-up table that can be applied for imaging over several days and through a variety of tissues. In this way, the photon exposure to the fluorescent cells under investigation is limited to imaging. Using our look-up table approach, we show signal intensity improvement factors ranging from 1.7 to 4.1 in organotypic tissue cultures and freshly excised mouse tissue. Imaging zebrafish in vivo, we demonstrate signal improvement by a factor of 2. This methodology is easily reproducible and could be applied to many photon starved experiments, for example fluorescent life time imaging, or when photobleaching is a concern.

Characterizing the phylogenetic tree-search problem.

PubMed

Money, Daniel; Whelan, Simon

2012-03-01

Phylogenetic trees are important in many areas of biological research, ranging from systematic studies to the methods used for genome annotation. Finding the best scoring tree under any optimality criterion is an NP-hard problem, which necessitates the use of heuristics for tree-search. Although tree-search plays a major role in obtaining a tree estimate, there remains a limited understanding of its characteristics and how the elements of the statistical inferential procedure interact with the algorithms used. This study begins to answer some of these questions through a detailed examination of maximum likelihood tree-search on a wide range of real genome-scale data sets. We examine all 10,395 trees for each of the 106 genes of an eight-taxa yeast phylogenomic data set, then apply different tree-search algorithms to investigate their performance. We extend our findings by examining two larger genome-scale data sets and a large disparate data set that has been previously used to benchmark the performance of tree-search programs. We identify several broad trends occurring during tree-search that provide an insight into the performance of heuristics and may, in the future, aid their development. These trends include a tendency for the true maximum likelihood (best) tree to also be the shortest tree in terms of branch lengths, a weak tendency for tree-search to recover the best tree, and a tendency for tree-search to encounter fewer local optima in genes that have a high information content. When examining current heuristics for tree-search, we find that nearest-neighbor-interchange performs poorly, and frequently finds trees that are significantly different from the best tree. In contrast, subtree-pruning-and-regrafting tends to perform well, nearly always finding trees that are not significantly different to the best tree. Finally, we demonstrate that the precise implementation of a tree-search strategy, including when and where parameters are optimized, can change

SNP-array reveals genome-wide patterns of geographical and potential adaptive divergence across the natural range of Atlantic salmon (Salmo salar).

PubMed

Bourret, Vincent; Kent, Matthew P; Primmer, Craig R; Vasemägi, Anti; Karlsson, Sten; Hindar, Kjetil; McGinnity, Philip; Verspoor, Eric; Bernatchez, Louis; Lien, Sigbjørn

2013-02-01

Atlantic salmon (Salmo salar) is one of the most extensively studied fish species in the world due to its significance in aquaculture, fisheries and ongoing conservation efforts to protect declining populations. Yet, limited genomic resources have hampered our understanding of genetic architecture in the species and the genetic basis of adaptation to the wide range of natural and artificial environments it occupies. In this study, we describe the development of a medium-density Atlantic salmon single nucleotide polymorphism (SNP) array based on expressed sequence tags (ESTs) and genomic sequencing. The array was used in the most extensive assessment of population genetic structure performed to date in this species. A total of 6176 informative SNPs were successfully genotyped in 38 anadromous and freshwater wild populations distributed across the species natural range. Principal component analysis clearly differentiated European and North American populations, and within Europe, three major regional genetic groups were identified for the first time in a single analysis. We assessed the potential for the array to disentangle neutral and putative adaptive divergence of SNP allele frequencies across populations and among regional groups. In Europe, secondary contact zones were identified between major clusters where endogenous and exogenous barriers could be associated, rendering the interpretation of environmental influence on potentially adaptive divergence equivocal. A small number of markers highly divergent in allele frequencies (outliers) were observed between (multiple) freshwater and anadromous populations, between northern and southern latitudes, and when comparing Baltic populations to all others. We also discuss the potential future applications of the SNP array for conservation, management and aquaculture. © 2012 Blackwell Publishing Ltd.

Adaptive critic autopilot design of bank-to-turn missiles using fuzzy basis function networks.

PubMed

Lin, Chuan-Kai

2005-04-01

A new adaptive critic autopilot design for bank-to-turn missiles is presented. In this paper, the architecture of adaptive critic learning scheme contains a fuzzy-basis-function-network based associative search element (ASE), which is employed to approximate nonlinear and complex functions of bank-to-turn missiles, and an adaptive critic element (ACE) generating the reinforcement signal to tune the associative search element. In the design of the adaptive critic autopilot, the control law receives signals from a fixed gain controller, an ASE and an adaptive robust element, which can eliminate approximation errors and disturbances. Traditional adaptive critic reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment, however, the proposed tuning algorithm can significantly shorten the learning time by online tuning all parameters of fuzzy basis functions and weights of ASE and ACE. Moreover, the weight updating law derived from the Lyapunov stability theory is capable of guaranteeing both tracking performance and stability. Computer simulation results confirm the effectiveness of the proposed adaptive critic autopilot.

Citation searches are more sensitive than keyword searches to identify studies using specific measurement instruments.

PubMed

Linder, Suzanne K; Kamath, Geetanjali R; Pratt, Gregory F; Saraykar, Smita S; Volk, Robert J

2015-04-01

To compare the effectiveness of two search methods in identifying studies that used the Control Preferences Scale (CPS), a health care decision-making instrument commonly used in clinical settings. We searched the literature using two methods: (1) keyword searching using variations of "Control Preferences Scale" and (2) cited reference searching using two seminal CPS publications. We searched three bibliographic databases [PubMed, Scopus, and Web of Science (WOS)] and one full-text database (Google Scholar). We report precision and sensitivity as measures of effectiveness. Keyword searches in bibliographic databases yielded high average precision (90%) but low average sensitivity (16%). PubMed was the most precise, followed closely by Scopus and WOS. The Google Scholar keyword search had low precision (54%) but provided the highest sensitivity (70%). Cited reference searches in all databases yielded moderate sensitivity (45-54%), but precision ranged from 35% to 75% with Scopus being the most precise. Cited reference searches were more sensitive than keyword searches, making it a more comprehensive strategy to identify all studies that use a particular instrument. Keyword searches provide a quick way of finding some but not all relevant articles. Goals, time, and resources should dictate the combination of which methods and databases are used. Copyright © 2015 Elsevier Inc. All rights reserved.

Citation searches are more sensitive than keyword searches to identify studies using specific measurement instruments

PubMed Central

Linder, Suzanne K.; Kamath, Geetanjali R.; Pratt, Gregory F.; Saraykar, Smita S.; Volk, Robert J.

2015-01-01

Objective To compare the effectiveness of two search methods in identifying studies that used the Control Preferences Scale (CPS), a healthcare decision-making instrument commonly used in clinical settings. Study Design & Setting We searched the literature using two methods: 1) keyword searching using variations of “control preferences scale” and 2) cited reference searching using two seminal CPS publications. We searched three bibliographic databases [PubMed, Scopus, Web of Science (WOS)] and one full-text database (Google Scholar). We report precision and sensitivity as measures of effectiveness. Results Keyword searches in bibliographic databases yielded high average precision (90%), but low average sensitivity (16%). PubMed was the most precise, followed closely by Scopus and WOS. The Google Scholar keyword search had low precision (54%) but provided the highest sensitivity (70%). Cited reference searches in all databases yielded moderate sensitivity (45–54%), but precision ranged from 35–75% with Scopus being the most precise. Conclusion Cited reference searches were more sensitive than keyword searches, making it a more comprehensive strategy to identify all studies that use a particular instrument. Keyword searches provide a quick way of finding some but not all relevant articles. Goals, time and resources should dictate the combination of which methods and databases are used. PMID:25554521

Search for Scalar Diphoton Resonances in the Mass Range 65–600 GeV with the ATLAS Detector in p p Collision Data at s = 8 TeV

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aad, G.; Abbott, B.; Abdallah, J.

2014-10-20

A search for scalar particles decaying via narrow resonances into two photons in the mass range 65–600 GeV is performed using 20.3 fb ₋1 of √s=8 TeV pp collision data collected with the ATLAS detector at the Large Hadron Collider. The recently discovered Higgs boson is treated as a background. No significant evidence for an additional signal is observed. The results are presented as limits at the 95% confidence level on the production cross section of a scalar boson times branching ratio into two photons, in a fiducial volume where the reconstruction efficiency is approximately independent of the event topology.more » Lastly, the upper limits set extend over a considerably wider mass range than previous searches.« less

Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

PubMed

Dash, Tirtharaj; Sahu, Prabhat K

2015-05-30

The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. © 2015 Wiley Periodicals, Inc.

Attention and apparent motion.

PubMed

Horowitz, T; Treisman, A

1994-01-01

Two dissociations between short- and long-range motion in visual search are reported. Previous research has shown parallel processing for short-range motion and apparently serial processing for long-range motion. This finding has been replicated and it has also been found that search for short-range targets can be impaired both by using bicontrast stimuli, and by prior adaptation to the target direction of motion. Neither factor impaired search in long-range motion displays. Adaptation actually facilitated search with long-range displays, which is attributed to response-level effects. A feature-integration account of apparent motion is proposed. In this theory, short-range motion depends on specialized motion feature detectors operating in parallel across the display, but subject to selective adaptation, whereas attention is needed to link successive elements when they appear at greater separations, or across opposite contrasts.

Autonomous change of behavior for environmental context: An intermittent search model with misunderstanding search pattern

NASA Astrophysics Data System (ADS)

Murakami, Hisashi; Gunji, Yukio-Pegio

2017-07-01

Although foraging patterns have long been predicted to optimally adapt to environmental conditions, empirical evidence has been found in recent years. This evidence suggests that the search strategy of animals is open to change so that animals can flexibly respond to their environment. In this study, we began with a simple computational model that possesses the principal features of an intermittent strategy, i.e., careful local searches separated by longer steps, as a mechanism for relocation, where an agent in the model follows a rule to switch between two phases, but it could misunderstand this rule, i.e., the agent follows an ambiguous switching rule. Thanks to this ambiguity, the agent's foraging strategy can continuously change. First, we demonstrate that our model can exhibit an optimal change of strategy from Brownian-type to Lévy-type depending on the prey density, and we investigate the distribution of time intervals for switching between the phases. Moreover, we show that the model can display higher search efficiency than a correlated random walk.

Spaced-based search coil magnetometers

NASA Astrophysics Data System (ADS)

Hospodarsky, George B.

2016-12-01

Search coil magnetometers are one of the primary tools used to study the magnetic component of low-frequency electromagnetic waves in space. Their relatively small size, mass, and power consumption, coupled with a good frequency range and sensitivity, make them ideal for spaceflight applications. The basic design of a search coil magnetometer consists of many thousands of turns of wire wound on a high permeability core. When a time-varying magnetic field passes through the coil, a time-varying voltage is induced due to Faraday's law of magnetic induction. The output of the coil is usually attached to a preamplifier, which amplifies the induced voltage and conditions the signal for transmission to the main electronics (usually a low-frequency radio receiver). Search coil magnetometers are usually used in conjunction with electric field antenna to measure electromagnetic plasma waves in the frequency range of a few hertz to a few tens of kilohertzs. Search coil magnetometers are used to determine the properties of waves, such as comparing the relative electric and magnetic field amplitudes of the waves, or to investigate wave propagation parameters, such as Poynting flux and wave normal vectors. On a spinning spacecraft, they are also sometimes used to determine the background magnetic field. This paper presents some of the basic design criteria of search coil magnetometers and discusses design characteristics of sensors flown on a number of spacecraft.

Successful adaption of a forensic toxicological screening workflow employing nontargeted liquid chromatography-tandem mass spectrometry to water analysis.

PubMed

Steger, Julia; Arnhard, Kathrin; Haslacher, Sandra; Geiger, Klemens; Singer, Klaus; Schlapp, Michael; Pitterl, Florian; Oberacher, Herbert

2016-04-01

Forensic toxicology and environmental water analysis share the common interest and responsibility in ensuring comprehensive and reliable confirmation of drugs and pharmaceutical compounds in samples analyzed. Dealing with similar analytes, detection and identification techniques should be exchangeable between scientific disciplines. Herein, we demonstrate the successful adaption of a forensic toxicological screening workflow employing nontargeted LC/MS/MS under data-dependent acquisition control and subsequent database search to water analysis. The main modification involved processing of an increased sample volume with SPE (500 mL vs. 1-10 mL) to reach LODs in the low ng/L range. Tandem mass spectra acquired with a qTOF instrument were submitted to database search. The targeted data mining strategy was found to be sensitive and specific; automated search produced hardly any false results. To demonstrate the applicability of the adapted workflow to complex samples, 14 wastewater effluent samples collected on seven consecutive days at the local wastewater-treatment plant were analyzed. Of the 88,970 fragment ion mass spectra produced, 8.8% of spectra were successfully assigned to one of the 1040 reference compounds included in the database, and this enabled the identification of 51 compounds representing important illegal drugs, members of various pharmaceutical compound classes, and metabolites thereof. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Career Adapt-Abilities Scale--Brazilian Form: Psychometric Properties and Relationships to Personality

ERIC Educational Resources Information Center

Teixeira, Marco Antonio Pereira; Bardagi, Marucia Patta; Lassance, Maria Celia Pacheco; Magalhaes, Mauro de Oliveira; Duarte, Maria Eduarda

2012-01-01

The Career Adapt-Abilities Scale--Brazilian Form (CAASBrazil) consists of four scales which measure concern, control, curiosity, and confidence as psychosocial resources for managing occupational transitions, developmental tasks, and work traumas. Internal consistency estimates for the subscale and total scores ranged from good to excellent. The…

DNA profiles, computer searches, and the Fourth Amendment.

PubMed

Kimel, Catherine W

2013-01-01

Pursuant to federal statutes and to laws in all fifty states, the United States government has assembled a database containing the DNA profiles of over eleven million citizens. Without judicial authorization, the government searches each of these profiles one-hundred thousand times every day, seeking to link database subjects to crimes they are not suspected of committing. Yet, courts and scholars that have addressed DNA databasing have focused their attention almost exclusively on the constitutionality of the government's seizure of the biological samples from which the profiles are generated. This Note fills a gap in the scholarship by examining the Fourth Amendment problems that arise when the government searches its vast DNA database. This Note argues that each attempt to match two DNA profiles constitutes a Fourth Amendment search because each attempted match infringes upon database subjects' expectations of privacy in their biological relationships and physical movements. The Note further argues that database searches are unreasonable as they are currently conducted, and it suggests an adaptation of computer-search procedures to remedy the constitutional deficiency.

VisAdapt: A Visualization Tool to Support Climate Change Adaptation.

PubMed

Johansson, Jimmy; Opach, Tomasz; Glaas, Erik; Neset, Tina-Simone; Navarra, Carlo; Linner, Bjorn-Ola; Rod, Jan Ketil

2017-01-01

The web-based visualization VisAdapt tool was developed to help laypeople in the Nordic countries assess how anticipated climate change will impact their homes. The tool guides users through a three-step visual process that helps them explore risks and identify adaptive actions specifically modified to their location and house type. This article walks through the tool's multistep, user-centered design process. Although VisAdapt's target end users are Nordic homeowners, the insights gained from the development process and the lessons learned from the project are applicable to a wide range of domains.

Rivals in the dark: how competition influences search in decisions under uncertainty.

PubMed

Phillips, Nathaniel D; Hertwig, Ralph; Kareev, Yaakov; Avrahami, Judith

2014-10-01

In choices between uncertain options, information search can increase the chances of distinguishing good from bad options. However, many choices are made in the presence of other choosers who may seize the better option while one is still engaged in search. How long do (and should) people search before choosing between uncertain options in the presence of such competition? To address this question, we introduce a new experimental paradigm called the competitive sampling game. We use both simulation and empirical data to compare search and choice between competitive and solitary environments. Simulation results show that minimal search is adaptive when one expects competitors to choose quickly or is uncertain about how long competitors will search. Descriptively, we observe that competition drastically reduces information search prior to choice. Copyright © 2014 Elsevier B.V. All rights reserved.

Dark-matter QCD-axion searches.

PubMed

Rosenberg, Leslie J

2015-10-06

In the late 20th century, cosmology became a precision science. Now, at the beginning of the next century, the parameters describing how our universe evolved from the Big Bang are generally known to a few percent. One key parameter is the total mass density of the universe. Normal matter constitutes only a small fraction of the total mass density. Observations suggest this additional mass, the dark matter, is cold (that is, moving nonrelativistically in the early universe) and interacts feebly if at all with normal matter and radiation. There's no known such elementary particle, so the strong presumption is the dark matter consists of particle relics of a new kind left over from the Big Bang. One of the most important questions in science is the nature of this dark matter. One attractive particle dark-matter candidate is the axion. The axion is a hypothetical elementary particle arising in a simple and elegant extension to the standard model of particle physics that nulls otherwise observable CP-violating effects (where CP is the product of charge reversal C and parity inversion P) in quantum chromo dynamics (QCD). A light axion of mass 10(-(6-3)) eV (the invisible axion) would couple extraordinarily weakly to normal matter and radiation and would therefore be extremely difficult to detect in the laboratory. However, such an axion is a compelling dark-matter candidate and is therefore a target of a number of searches. Compared with other particle dark-matter candidates, the plausible range of axion dark-matter couplings and masses is narrowly constrained. This focused search range allows for definitive searches, where a nonobservation would seriously impugn the dark-matter QCD-axion hypothesis. Axion searches use a wide range of technologies, and the experiment sensitivities are now reaching likely dark-matter axion couplings and masses. This article is a selective overview of the current generation of sensitive axion searches. Not all techniques and experiments

Search for a Standard Model Higgs boson in the mass range 200- 600 GeV in the H → ZZ →ℓ+ℓ- qqbar decay channel with the ATLAS detector

NASA Astrophysics Data System (ADS)

Aad, G.; Abbott, B.; Abdallah, J.; Abdel Khalek, S.; Abdelalim, A. A.; Abdinov, O.; Abi, B.; Abolins, M.; Abouzeid, O. S.; Abramowicz, H.; Abreu, H.; Acerbi, E.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Addy, T. N.; Adelman, J.; Adomeit, S.; Adragna, P.; Adye, T.; Aefsky, S.; Aguilar-Saavedra, J. A.; Agustoni, M.; Aharrouche, M.; Ahlen, S. P.; Ahles, F.; Ahmad, A.; Ahsan, M.; Aielli, G.; Akdogan, T.; Åkesson, T. P. A.; Akimoto, G.; Akimov, A. V.; Alam, M. S.; Alam, M. A.; Albert, J.; Albrand, S.; Aleksa, M.; Aleksandrov, I. N.; Alessandria, F.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Aliev, M.; Alimonti, G.; Alison, J.; Allbrooke, B. M. M.; Allport, P. P.; Allwood-Spiers, S. E.; Almond, J.; Aloisio, A.; Alon, R.; Alonso, A.; Alvarez Gonzalez, B.; Alviggi, M. G.; Amako, K.; Amelung, C.; Ammosov, V. V.; Amorim, A.; Amram, N.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Anduaga, X. S.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A.; Anjos, N.; Annovi, A.; Antonaki, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoun, S.; Aperio Bella, L.; Apolle, R.; Arabidze, G.; Aracena, I.; Arai, Y.; Arce, A. T. H.; Arfaoui, S.; Arguin, J.-F.; Arik, E.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arnault, C.; Artamonov, A.; Artoni, G.; Arutinov, D.; Asai, S.; Asfandiyarov, R.; Ask, S.; Åsman, B.; Asquith, L.; Assamagan, K.; Astbury, A.; Aubert, B.; Auge, E.; Augsten, K.; Aurousseau, M.; Avolio, G.; Avramidou, R.; Axen, D.; Azuelos, G.; Azuma, Y.; Baak, M. A.; Baccaglioni, G.; Bacci, C.; Bach, A. M.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Badescu, E.; Bagnaia, P.; Bahinipati, S.; Bai, Y.; Bailey, D. C.; Bain, T.; Baines, J. T.; Baker, O. K.; Baker, M. D.; Baker, S.; Banas, E.; Banerjee, P.; Banerjee, Sw.; Banfi, D.; Bangert, A.; Bansal, V.; Bansil, H. S.; Barak, L.; Baranov, S. P.; Barbaro Galtieri, A.; Barber, T.; Barberio, E. L.; Barberis, D.; Barbero, M.; Bardin, D. Y.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnett, B. M.; Barnett, R. M.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Barrillon, P.; Bartoldus, R.; Barton, A. E.; Bartsch, V.; Bates, R. L.; Batkova, L.; Batley, J. R.; Battaglia, A.; Battistin, M.; Bauer, F.; Bawa, H. S.; Beale, S.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, A. K.; Becker, S.; Beckingham, M.; Becks, K. H.; Beddall, A. J.; Beddall, A.; Bedikian, S.; Bednyakov, V. A.; Bee, C. P.; Begel, M.; Behar Harpaz, S.; Beimforde, M.; Belanger-Champagne, C.; Bell, P. J.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellina, F.; Bellomo, M.; Belloni, A.; Beloborodova, O.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Benoit, M.; Bensinger, J. R.; Benslama, K.; Bentvelsen, S.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Berglund, E.; Beringer, J.; Bernat, P.; Bernhard, R.; Bernius, C.; Berry, T.; Bertella, C.; Bertin, A.; Bertolucci, F.; Besana, M. I.; Besjes, G. J.; Besson, N.; Bethke, S.; Bhimji, W.; Bianchi, R. M.; Bianco, M.; Biebel, O.; Bieniek, S. P.; Bierwagen, K.; Biesiada, J.; Biglietti, M.; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biscarat, C.; Bitenc, U.; Black, K. M.; Blair, R. E.; Blanchard, J.-B.; Blanchot, G.; Blazek, T.; Blocker, C.; Blocki, J.; Blondel, A.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. B.; Bocchetta, S. S.; Bocci, A.; Boddy, C. R.; Boehler, M.; Boek, J.; Boelaert, N.; Bogaerts, J. A.; Bogdanchikov, A.; Bogouch, A.; Bohm, C.; Bohm, J.; Boisvert, V.; Bold, T.; Boldea, V.; Bolnet, N. M.; Bomben, M.; Bona, M.; Boonekamp, M.; Booth, C. N.; Bordoni, S.; Borer, C.; Borisov, A.; Borissov, G.; Borjanovic, I.; Borri, M.; Borroni, S.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boterenbrood, H.; Bouchami, J.; Boudreau, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozovic-Jelisavcic, I.; Bracinik, J.; Branchini, P.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Brelier, B.; Bremer, J.; Brendlinger, K.; Brenner, R.; Bressler, S.; Britton, D.; Brochu, F. M.; Brock, I.; Brock, R.; Brodet, E.; Broggi, F.; Bromberg, C.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brown, G.; Brown, H.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruneliere, R.; Brunet, S.; Bruni, A.; Bruni, G.; Bruschi, M.; Buanes, T.; Buat, Q.; Bucci, F.; Buchanan, J.; Buchholz, P.; Buckingham, R. M.; Buckley, A. G.; Buda, S. I.; Budagov, I. A.; Budick, B.; Büscher, V.; Bugge, L.; Bulekov, O.; Bundock, A. C.; Bunse, M.; Buran, T.; Burckhart, H.; Burdin, S.; Burgess, T.; Burke, S.; Busato, E.; Bussey, P.; Buszello, C. P.; Butler, B.; Butler, J. M.; Buttar, C. M.; Butterworth, J. M.; Buttinger, W.; Cabrera Urbán, S.; Caforio, D.; Cakir, O.; Calafiura, P.; Calderini, G.; Calfayan, P.; Calkins, R.; Caloba, L. P.; Caloi, R.; Calvet, D.; Calvet, S.; Camacho Toro, R.; Camarri, P.; Cameron, D.; Caminada, L. M.; Campana, S.; Campanelli, M.; Canale, V.; Canelli, F.; Canepa, A.; Cantero, J.; Cantrill, R.; Capasso, L.; Capeans Garrido, M. D. M.; Caprini, I.; Caprini, M.; Capriotti, D.; Capua, M.; Caputo, R.; Cardarelli, R.; Carli, T.; Carlino, G.; Carminati, L.; Caron, B.; Caron, S.; Carquin, E.; Carrillo Montoya, G. D.; Carter, A. A.; Carter, J. R.; Carvalho, J.; Casadei, D.; Casado, M. P.; Cascella, M.; Caso, C.; Castaneda Hernandez, A. M.; Castaneda-Miranda, E.; Castillo Gimenez, V.; Castro, N. F.; Cataldi, G.; Catastini, P.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Cattani, G.; Caughron, S.; Cavalleri, P.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Ceradini, F.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chalupkova, I.; Chan, K.; Chapleau, B.; Chapman, J. D.; Chapman, J. W.; Chareyre, E.; Charlton, D. G.; Chavda, V.; Chavez Barajas, C. A.; Cheatham, S.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, H.; Chen, S.; Chen, X.; Chen, Y.; Cheplakov, A.; Cherkaoui El Moursli, R.; Chernyatin, V.; Cheu, E.; Cheung, S. L.; Chevalier, L.; Chiefari, G.; Chikovani, L.; Childers, J. T.; Chilingarov, A.; Chiodini, G.; Chisholm, A. S.; Chislett, R. T.; Chitan, A.; Chizhov, M. V.; Choudalakis, G.; Chouridou, S.; Christidi, I. A.; Christov, A.; Chromek-Burckhart, D.; Chu, M. L.; Chudoba, J.; Ciapetti, G.; Ciftci, A. K.; Ciftci, R.; Cinca, D.; Cindro, V.; Ciocca, C.; Ciocio, A.; Cirilli, M.; Cirkovic, P.; Citterio, M.; Ciubancan, M.; Clark, A.; Clark, P. J.; Clarke, R. N.; Cleland, W.; Clemens, J. C.; Clement, B.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Cogan, J. G.; Coggeshall, J.; Cogneras, E.; Colas, J.; Colijn, A. P.; Collins, N. J.; Collins-Tooth, C.; Collot, J.; Colombo, T.; Colon, G.; Conde Muiño, P.; Coniavitis, E.; Conidi, M. C.; Consonni, S. M.; Consorti, V.; Constantinescu, S.; Conta, C.; Conti, G.; Conventi, F.; Cooke, M.; Cooper, B. D.; Cooper-Sarkar, A. M.; Copic, K.; Cornelissen, T.; Corradi, M.; Corriveau, F.; Cortes-Gonzalez, A.; Cortiana, G.; Costa, G.; Costa, M. J.; Costanzo, D.; Costin, T.; Côté, D.; Courneyea, L.; Cowan, G.; Cowden, C.; Cox, B. E.; Cranmer, K.; Crescioli, F.; Cristinziani, M.; Crosetti, G.; Crupi, R.; Crépé-Renaudin, S.; Cuciuc, C.-M.; Cuenca Almenar, C.; Cuhadar Donszelmann, T.; Curatolo, M.; Curtis, C. J.; Cuthbert, C.; Cwetanski, P.; Czirr, H.; Czodrowski, P.; Czyczula, Z.; D'Auria, S.; D'Onofrio, M.; D'Orazio, A.; da Cunha Sargedas de Sousa, M. J.; da Via, C.; Dabrowski, W.; Dafinca, A.; Dai, T.; Dallapiccola, C.; Dam, M.; Dameri, M.; Damiani, D. S.; Danielsson, H. O.; Dao, V.; Darbo, G.; Darlea, G. L.; Davey, W.; Davidek, T.; Davidson, N.; Davidson, R.; Davies, E.; Davies, M.; Davison, A. R.; Davygora, Y.; Dawe, E.; Dawson, I.; Daya-Ishmukhametova, R. K.; de, K.; de Asmundis, R.; de Castro, S.; de Cecco, S.; de Graat, J.; de Groot, N.; de Jong, P.; de La Taille, C.; de la Torre, H.; de Lorenzi, F.; de Mora, L.; de Nooij, L.; de Pedis, D.; de Salvo, A.; de Sanctis, U.; de Santo, A.; de Vivie de Regie, J. B.; de Zorzi, G.; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dechenaux, B.; Dedovich, D. V.; Degenhardt, J.; Del Papa, C.; Del Peso, J.; Del Prete, T.; Delemontex, T.; Deliyergiyev, M.; Dell'Acqua, A.; Dell'Asta, L.; Della Pietra, M.; Della Volpe, D.; Delmastro, M.; Delsart, P. A.; Deluca, C.; Demers, S.; Demichev, M.; Demirkoz, B.; Deng, J.; Denisov, S. P.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Devetak, E.; Deviveiros, P. O.; Dewhurst, A.; Dewilde, B.; Dhaliwal, S.; Dhullipudi, R.; di Ciaccio, A.; di Ciaccio, L.; di Girolamo, A.; di Girolamo, B.; di Luise, S.; di Mattia, A.; di Micco, B.; di Nardo, R.; di Simone, A.; di Sipio, R.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Dietzsch, T. A.; Diglio, S.; Dindar Yagci, K.; Dingfelder, J.; Dinut, F.; Dionisi, C.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Do Vale, M. A. B.; Do Valle Wemans, A.; Doan, T. K. O.; Dobbs, M.; Dobinson, R.; Dobos, D.; Dobson, E.; Dodd, J.; Doglioni, C.; Doherty, T.; Doi, Y.; Dolejsi, J.; Dolenc, I.; Dolezal, Z.; Dolgoshein, B. A.; Dohmae, T.; Donadelli, M.; Donini, J.; Dopke, J.; Doria, A.; Dos Anjos, A.; Dotti, A.; Dova, M. T.; Doxiadis, A. D.; Doyle, A. T.; Dris, M.; Dubbert, J.; Dube, S.; Duchovni, E.; Duckeck, G.; Dudarev, A.; Dudziak, F.; Dührssen, M.; Duerdoth, I. P.; Duflot, L.; Dufour, M.-A.; Dunford, M.; Duran Yildiz, H.; Duxfield, R.; Dwuznik, M.; Dydak, F.; Düren, M.; Ebke, J.; Eckweiler, S.; Edmonds, K.; Edson, W.; Edwards, C. A.; Edwards, N. C.; Ehrenfeld, W.; Eifert, T.; Eigen, G.; Einsweiler, K.; Eisenhandler, E.; Ekelof, T.; El Kacimi, M.; Ellert, M.; Elles, S.; Ellinghaus, F.; Ellis, K.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Engelmann, R.; Engl, A.; Epp, B.; Erdmann, J.; Ereditato, A.; Eriksson, D.; Ernst, J.; Ernst, M.; Ernwein, J.; Errede, D.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Espinal Curull, X.; Esposito, B.; Etienne, F.; Etienvre, A. I.; Etzion, E.; Evangelakou, D.; Evans, H.; Fabbri, L.; Fabre, C.; Fakhrutdinov, R. M.; Falciano, S.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farley, J.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassnacht, P.; Fassouliotis, D.; Fatholahzadeh, B.; Favareto, A.; Fayard, L.; Fazio, S.; Febbraro, R.; Federic, P.; Fedin, O. L.; Fedorko, W.; Fehling-Kaschek, M.; Feligioni, L.; Fellmann, D.; Feng, C.; Feng, E. J.; Fenyuk, A. B.; Ferencei, J.; Fernando, W.; Ferrag, S.; Ferrando, J.; Ferrara, V.; Ferrari, A.; Ferrari, P.; Ferrari, R.; Ferreira de Lima, D. E.; Ferrer, A.; Ferrere, D.; Ferretti, C.; Ferretto Parodi, A.; Fiascaris, M.; Fiedler, F.; Filipčič, A.; Filthaut, F.; Fincke-Keeler, M.; Fiolhais, M. C. N.; Fiorini, L.; Firan, A.; Fischer, G.; Fisher, M. J.; Flechl, M.; Fleck, I.; Fleckner, J.; Fleischmann, P.; Fleischmann, S.; Flick, T.; Floderus, A.; Flores Castillo, L. R.; Flowerdew, M. J.; Fonseca Martin, T.; Formica, A.; Forti, A.; Fortin, D.; Fournier, D.; Fox, H.; Francavilla, P.; Franchini, M.; Franchino, S.; Francis, D.; Frank, T.; Franz, S.; Fraternali, M.; Fratina, S.; French, S. T.; Friedrich, C.; Friedrich, F.; Froeschl, R.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Fullana Torregrosa, E.; Fulsom, B. G.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gadfort, T.; Gadomski, S.; Gagliardi, G.; Gagnon, P.; Galea, C.; Gallas, E. J.; Gallo, V.; Gallop, B. J.; Gallus, P.; Gan, K. K.; Gao, Y. S.; Gaponenko, A.; Garberson, F.; Garcia-Sciveres, M.; García, C.; García Navarro, J. E.; Gardner, R. W.; Garelli, N.; Garitaonandia, H.; Garonne, V.; Garvey, J.; Gatti, C.; Gaudio, G.; Gaur, B.; Gauthier, L.; Gauzzi, P.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Ge, P.; Gecse, Z.; Gee, C. N. P.; Geerts, D. A. A.; Geich-Gimbel, Ch.; Gellerstedt, K.; Gemme, C.; Gemmell, A.; Genest, M. H.; Gentile, S.; George, M.; George, S.; Gerlach, P.; Gershon, A.; Geweniger, C.; Ghazlane, H.; Ghodbane, N.; Giacobbe, B.; Giagu, S.; Giakoumopoulou, V.; Giangiobbe, V.; Gianotti, F.; Gibbard, B.; Gibson, A.; Gibson, S. M.; Gillberg, D.; Gillman, A. R.; Gingrich, D. M.; Ginzburg, J.; Giokaris, N.; Giordani, M. P.; Giordano, R.; Giorgi, F. M.; Giovannini, P.; Giraud, P. F.; Giugni, D.; Giunta, M.; Giusti, P.; Gjelsten, B. K.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glazov, A.; Glitza, K. W.; Glonti, G. L.; Goddard, J. R.; Godfrey, J.; Godlewski, J.; Goebel, M.; Göpfert, T.; Goeringer, C.; Gössling, C.; Goldfarb, S.; Golling, T.; Gomes, A.; Gomez Fajardo, L. S.; Gonçalo, R.; Goncalves Pinto Firmino da Costa, J.; Gonella, L.; Gonzalez, S.; González de La Hoz, S.; Gonzalez Parra, G.; Gonzalez Silva, M. L.; Gonzalez-Sevilla, S.; Goodson, J. J.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorfine, G.; Gorini, B.; Gorini, E.; Gorišek, A.; Gornicki, E.; Gosdzik, B.; Goshaw, A. T.; Gosselink, M.; Gostkin, M. I.; Gough Eschrich, I.; Gouighri, M.; Goujdami, D.; Goulette, M. P.; Goussiou, A. G.; Goy, C.; Gozpinar, S.; Grabowska-Bold, I.; Grafström, P.; Grahn, K.-J.; Grancagnolo, F.; Grancagnolo, S.; Grassi, V.; Gratchev, V.; Grau, N.; Gray, H. M.; Gray, J. A.; Graziani, E.; Grebenyuk, O. G.; Greenshaw, T.; Greenwood, Z. D.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Griffiths, J.; Grigalashvili, N.; Grillo, A. A.; Grinstein, S.; Grishkevich, Y. V.; Grivaz, J.-F.; Gross, E.; Grosse-Knetter, J.; Groth-Jensen, J.; Grybel, K.; Guest, D.; Guicheney, C.; Guida, A.; Guindon, S.; Gul, U.; Guler, H.; Gunther, J.; Guo, B.; Guo, J.; Gutierrez, P.; Guttman, N.; Gutzwiller, O.; Guyot, C.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haas, S.; Haber, C.; Hadavand, H. K.; Hadley, D. R.; Haefner, P.; Hahn, F.; Haider, S.; Hajduk, Z.; Hakobyan, H.; Hall, D.; Haller, J.; Hamacher, K.; Hamal, P.; Hamer, M.; Hamilton, A.; Hamilton, S.; Han, L.; Hanagaki, K.; Hanawa, K.; Hance, M.; Handel, C.; Hanke, P.; Hansen, J. R.; Hansen, J. B.; Hansen, J. D.; Hansen, P. H.; Hansson, P.; Hara, K.; Hare, G. A.; Harenberg, T.; Harkusha, S.; Harper, D.; Harrington, R. D.; Harris, O. M.; Hartert, J.; Hartjes, F.; Haruyama, T.; Harvey, A.; Hasegawa, S.; Hasegawa, Y.; Hassani, S.; Haug, S.; Hauschild, M.; Hauser, R.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hawkins, A. D.; Hawkins, D.; Hayakawa, T.; Hayashi, T.; Hayden, D.; Hays, C. P.; Hayward, H. S.; Haywood, S. J.; He, M.; Head, S. J.; Hedberg, V.; Heelan, L.; Heim, S.; Heinemann, B.; Heisterkamp, S.; Helary, L.; Heller, C.; Heller, M.; Hellman, S.; Hellmich, D.; Helsens, C.; Henderson, R. C. W.; Henke, M.; Henrichs, A.; Henriques Correia, A. M.; Henrot-Versille, S.; Hensel, C.; Henß, T.; Hernandez, C. M.; Hernández Jiménez, Y.; Herrberg, R.; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Higón-Rodriguez, E.; Hill, J. C.; Hiller, K. H.; Hillert, S.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hirose, M.; Hirsch, F.; Hirschbuehl, D.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoffman, J.; Hoffmann, D.; Hohlfeld, M.; Holder, M.; Holmgren, S. O.; Holy, T.; Holzbauer, J. L.; Hong, T. M.; Hooft van Huysduynen, L.; Horn, C.; Horner, S.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howard, J.; Howarth, J.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hsu, P. J.; Hsu, S.-C.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huettmann, A.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Hurwitz, M.; Husemann, U.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibbotson, M.; Ibragimov, I.; Iconomidou-Fayard, L.; Idarraga, J.; Iengo, P.; Igonkina, O.; Ikegami, Y.; Ikeno, M.; Iliadis, D.; Ilic, N.; Ince, T.; Inigo-Golfin, J.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Irles Quiles, A.; Isaksson, C.; Ishino, M.; Ishitsuka, M.; Ishmukhametov, R.; Issever, C.; Istin, S.; Ivashin, A. V.; Iwanski, W.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jackson, B.; Jackson, J. N.; Jackson, P.; Jaekel, M. R.; Jain, V.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jakubek, J.; Jana, D. K.; Jansen, E.; Jansen, H.; Jantsch, A.; Janus, M.; Jarlskog, G.; Jeanty, L.; Jen-La Plante, I.; Jenni, P.; Jež, P.; Jézéquel, S.; Jha, M. K.; Ji, H.; Ji, W.; Jia, J.; Jiang, Y.; Jimenez Belenguer, M.; Jin, S.; Jinnouchi, O.; Joergensen, M. D.; Joffe, D.; Johansen, M.; Johansson, K. E.; Johansson, P.; Johnert, S.; Johns, K. A.; Jon-And, K.; Jones, G.; Jones, R. W. L.; Jones, T. J.; Joram, C.; Jorge, P. M.; Joshi, K. D.; Jovicevic, J.; Jovin, T.; Ju, X.; Jung, C. A.; Jungst, R. M.; Juranek, V.; Jussel, P.; Juste Rozas, A.; Kabana, S.; Kaci, M.; Kaczmarska, A.; Kadlecik, P.; Kado, M.; Kagan, H.; Kagan, M.; Kajomovitz, E.; Kalinin, S.; Kalinovskaya, L. V.; Kama, S.; Kanaya, N.; Kaneda, M.; Kaneti, S.; Kanno, T.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kapliy, A.; Kaplon, J.; Kar, D.; Karagounis, M.; Karakostas, K.; Karnevskiy, M.; Kartvelishvili, V.; Karyukhin, A. N.; Kashif, L.; Kasieczka, G.; Kass, R. D.; Kastanas, A.; Kataoka, M.; Kataoka, Y.; Katsoufis, E.; Katzy, J.; Kaushik, V.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kayl, M. S.; Kazanin, V. A.; Kazarinov, M. Y.; Keeler, R.; Kehoe, R.; Keil, M.; Kekelidze, G. D.; Keller, J. S.; Kenyon, M.; Kepka, O.; Kerschen, N.; Kerševan, B. P.; Kersten, S.; Kessoku, K.; Keung, J.; Khalil-Zada, F.; Khandanyan, H.; Khanov, A.; Kharchenko, D.; Khodinov, A.; Khomich, A.; Khoo, T. J.; Khoriauli, G.; Khoroshilov, A.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kim, H.; Kim, S. H.; Kimura, N.; Kind, O.; King, B. T.; King, M.; King, R. S. B.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kittelmann, T.; Kladiva, E.; Klein, M.; Klein, U.; Kleinknecht, K.; Klemetti, M.; Klier, A.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klinger, J. A.; Klinkby, E. B.; Klioutchnikova, T.; Klok, P. F.; Klous, S.; Kluge, E.-E.; Kluge, T.; Kluit, P.; Kluth, S.; Knecht, N. S.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Ko, B. R.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Köneke, K.; König, A. C.; Koenig, S.; Köpke, L.; Koetsveld, F.; Koevesarki, P.; Koffas, T.; Koffeman, E.; Kogan, L. A.; Kohlmann, S.; Kohn, F.; Kohout, Z.; Kohriki, T.; Koi, T.; Kolachev, G. M.; Kolanoski, H.; Kolesnikov, V.; Koletsou, I.; Koll, J.; Kollefrath, M.; Komar, A. A.; Komori, Y.; Kondo, T.; Kono, T.; Kononov, A. I.; Konoplich, R.; Konstantinidis, N.; Koperny, S.; Korcyl, K.; Kordas, K.; Korn, A.; Korol, A.; Korolkov, I.; Korolkova, E. V.; Korotkov, V. A.; Kortner, O.; Kortner, S.; Kostyukhin, V. V.; Kotov, S.; Kotov, V. M.; Kotwal, A.; Kourkoumelis, C.; Kouskoura, V.; Koutsman, A.; Kowalewski, R.; Kowalski, T. Z.; Kozanecki, W.; Kozhin, A. S.; Kral, V.; Kramarenko, V. A.; Kramberger, G.; Krasny, M. W.; Krasznahorkay, A.; Kraus, J.; Kraus, J. K.; Kreiss, S.; Krejci, F.; Kretzschmar, J.; Krieger, N.; Krieger, P.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Kruker, T.; Krumnack, N.; Krumshteyn, Z. V.; Kruth, A.; Kubota, T.; Kuday, S.; Kuehn, S.; Kugel, A.; Kuhl, T.; Kuhn, D.; Kukhtin, V.; Kulchitsky, Y.; Kuleshov, S.; Kummer, C.; Kuna, M.; Kunkle, J.; Kupco, A.; Kurashige, H.; Kurata, M.; Kurochkin, Y. A.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwee, R.; La Rosa, A.; La Rotonda, L.; Labarga, L.; Labbe, J.; Lablak, S.; Lacasta, C.; Lacava, F.; Lacker, H.; Lacour, D.; Lacuesta, V. R.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lagouri, T.; Lai, S.; Laisne, E.; Lamanna, M.; Lambourne, L.; Lampen, C. L.; Lampl, W.; Lancon, E.; Landgraf, U.; Landon, M. P. J.; Lane, J. L.; Lang, V. S.; Lange, C.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Laplace, S.; Lapoire, C.; Laporte, J. F.; Lari, T.; Larner, A.; Lassnig, M.; Laurelli, P.; Lavorini, V.; Lavrijsen, W.; Laycock, P.; Le Dortz, O.; Le Guirriec, E.; Le Maner, C.; Le Menedeu, E.; Lecompte, T.; Ledroit-Guillon, F.; Lee, H.; Lee, J. S. H.; Lee, S. C.; Lee, L.; Lefebvre, M.; Legendre, M.; Legger, F.; Leggett, C.; Lehmacher, M.; Lehmann Miotto, G.; Lei, X.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Lendermann, V.; Leney, K. J. C.; Lenz, T.; Lenzen, G.; Lenzi, B.; Leonhardt, K.; Leontsinis, S.; Lepold, F.; Leroy, C.; Lessard, J.-R.; Lester, C. G.; Lester, C. M.; Levêque, J.; Levin, D.; Levinson, L. J.; Lewis, A.; Lewis, G. H.; Leyko, A. M.; Leyton, M.; Li, B.; Li, H.; Li, S.; Li, X.; Liang, Z.; Liao, H.; Liberti, B.; Lichard, P.; Lichtnecker, M.; Lie, K.; Liebig, W.; Limbach, C.; Limosani, A.; Limper, M.; Lin, S. C.; Linde, F.; Linnemann, J. T.; Lipeles, E.; Lipniacka, A.; Liss, T. M.; Lissauer, D.; Lister, A.; Litke, A. M.; Liu, C.; Liu, D.; Liu, H.; Liu, J. B.; Liu, L.; Liu, M.; Liu, Y.; Livan, M.; Livermore, S. S. A.; Lleres, A.; Llorente Merino, J.; Lloyd, S. L.; Lobodzinska, E.; Loch, P.; Lockman, W. S.; Loddenkoetter, T.; Loebinger, F. K.; Loginov, A.; Loh, C. W.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Lombardo, V. P.; Long, R. E.; Lopes, L.; Lopez Mateos, D.; Lorenz, J.; Lorenzo Martinez, N.; Losada, M.; Loscutoff, P.; Lo Sterzo, F.; Losty, M. J.; Lou, X.; Lounis, A.; Loureiro, K. F.; Love, J.; Love, P. A.; Lowe, A. J.; Lu, F.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Ludwig, A.; Ludwig, D.; Ludwig, I.; Ludwig, J.; Luehring, F.; Luijckx, G.; Lukas, W.; Lumb, D.; Luminari, L.; Lund, E.; Lund-Jensen, B.; Lundberg, B.; Lundberg, J.; Lundberg, O.; Lundquist, J.; Lungwitz, M.; Lynn, D.; Lytken, E.; Ma, H.; Ma, L. L.; Maccarrone, G.; Macchiolo, A.; Maček, B.; Machado Miguens, J.; Mackeprang, R.; Madaras, R. J.; Mader, W. F.; Maenner, R.; Maeno, T.; Mättig, P.; Mättig, S.; Magnoni, L.; Magradze, E.; Mahboubi, K.; Mahmoud, S.; Mahout, G.; Maiani, C.; Maidantchik, C.; Maio, A.; Majewski, S.; Makida, Y.; Makovec, N.; Mal, P.; Malaescu, B.; Malecki, Pa.; Malecki, P.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyshev, V.; Malyukov, S.; Mameghani, R.; Mamuzic, J.; Manabe, A.; Mandelli, L.; Mandić, I.; Mandrysch, R.; Maneira, J.; Mangeard, P. S.; Manhaes de Andrade Filho, L.; Mann, A.; Manning, P. M.; Manousakis-Katsikakis, A.; Mansoulie, B.; Mapelli, A.; Mapelli, L.; March, L.; Marchand, J. F.; Marchese, F.; Marchiori, G.; Marcisovsky, M.; Marino, C. P.; Marroquim, F.; Marshall, Z.; Martens, F. K.; Marti, L. F.; Marti-Garcia, S.; Martin, B.; Martin, B.; Martin, J. P.; Martin, T. A.; Martin, V. J.; Martin Dit Latour, B.; Martin-Haugh, S.; Martinez, M.; Martinez Outschoorn, V.; Martyniuk, A. C.; Marx, M.; Marzano, F.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Massa, I.; Massaro, G.; Massol, N.; Mastroberardino, A.; Masubuchi, T.; Matricon, P.; Matsunaga, H.; Matsushita, T.; Mattravers, C.; Maurer, J.; Maxfield, S. J.; Mayne, A.; Mazini, R.; Mazur, M.; Mazzaferro, L.; Mazzanti, M.; Mc Kee, S. P.; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McCubbin, N. A.; McFarlane, K. W.; McFayden, J. A.; McHedlidze, G.; McLaughlan, T.; McMahon, S. J.; McPherson, R. A.; Meade, A.; Mechnich, J.; Mechtel, M.; Medinnis, M.; Meera-Lebbai, R.; Meguro, T.; Mehdiyev, R.; Mehlhase, S.; Mehta, A.; Meier, K.; Meirose, B.; Melachrinos, C.; Mellado Garcia, B. R.; Meloni, F.; Mendoza Navas, L.; Meng, Z.; Mengarelli, A.; Menke, S.; Meoni, E.; Mercurio, K. M.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Merritt, H.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Meyer, J.; Meyer, T. C.; Meyer, W. T.; Miao, J.; Michal, S.; Micu, L.; Middleton, R. P.; Migas, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Miller, D. W.; Miller, R. J.; Mills, W. J.; Mills, C.; Milov, A.; Milstead, D. A.; Milstein, D.; Minaenko, A. A.; Miñano Moya, M.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Ming, Y.; Mir, L. M.; Mirabelli, G.; Mitrevski, J.; Mitsou, V. A.; Mitsui, S.; Miyagawa, P. S.; Mjörnmark, J. U.; Moa, T.; Moeller, V.; Mönig, K.; Möser, N.; Mohapatra, S.; Mohr, W.; Moles-Valls, R.; Monk, J.; Monnier, E.; Montejo Berlingen, J.; Montesano, S.; Monticelli, F.; Monzani, S.; Moore, R. W.; Moorhead, G. F.; Mora Herrera, C.; Moraes, A.; Morange, N.; Morel, J.; Morello, G.; Moreno, D.; Moreno Llácer, M.; Morettini, P.; Morgenstern, M.; Morii, M.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Morvaj, L.; Moser, H. G.; Mosidze, M.; Moss, J.; Mount, R.; Mountricha, E.; Mouraviev, S. V.; Moyse, E. J. W.; Mueller, F.; Mueller, J.; Mueller, K.; Müller, T. A.; Mueller, T.; Muenstermann, D.; Munwes, Y.; Murray, W. J.; Mussche, I.; Musto, E.; Myagkov, A. G.; Myska, M.; Nadal, J.; Nagai, K.; Nagano, K.; Nagarkar, A.; Nagasaka, Y.; Nagel, M.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Nanava, G.; Napier, A.; Narayan, R.; Nash, M.; Nattermann, T.; Naumann, T.; Navarro, G.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Negri, A.; Negri, G.; Negrini, M.; Nektarijevic, S.; Nelson, A.; Nelson, T. K.; Nemecek, S.; Nemethy, P.; Nepomuceno, A. A.; Nessi, M.; Neubauer, M. S.; Neusiedl, A.; Neves, R. M.; Nevski, P.; Newman, P. R.; Nguyen Thi Hong, V.; Nickerson, R. B.; Nicolaidou, R.; Nicquevert, B.; Niedercorn, F.; Nielsen, J.; Nikiforou, N.; Nikiforov, A.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolics, K.; Nikolopoulos, K.; Nilsen, H.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nisius, R.; Nobe, T.; Nodulman, L.; Nomachi, M.; Nomidis, I.; Nordberg, M.; Norton, P. R.; Novakova, J.; Nozaki, M.; Nozka, L.; Nugent, I. M.; Nuncio-Quiroz, A.-E.; Nunes Hanninger, G.; Nunnemann, T.; Nurse, E.; O'Brien, B. J.; O'Neale, S. W.; O'Neil, D. C.; O'Shea, V.; Oakes, L. B.; Oakham, F. G.; Oberlack, H.; Ocariz, J.; Ochi, A.; Oda, S.; Odaka, S.; Odier, J.; Ogren, H.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohshima, T.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Olchevski, A. G.; Olivares Pino, S. A.; Oliveira, M.; Oliveira Damazio, D.; Oliver Garcia, E.; Olivito, D.; Olszewski, A.; Olszowska, J.; Onofre, A.; Onyisi, P. U. E.; Oram, C. J.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orlando, N.; Orlov, I.; Oropeza Barrera, C.; Orr, R. S.; Osculati, B.; Ospanov, R.; Osuna, C.; Otero Y Garzon, G.; Ottersbach, J. P.; Ouchrif, M.; Ouellette, E. A.; Ould-Saada, F.; Ouraou, A.; Ouyang, Q.; Ovcharova, A.; Owen, M.; Owen, S.; Ozcan, V. E.; Ozturk, N.; Pacheco Pages, A.; Padilla Aranda, C.; Pagan Griso, S.; Paganis, E.; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Paleari, C. P.; Palestini, S.; Pallin, D.; Palma, A.; Palmer, J. D.; Pan, Y. B.; Panagiotopoulou, E.; Pani, P.; Panikashvili, N.; Panitkin, S.; Pantea, D.; Papadelis, A.; Papadopoulou, Th. D.; Paramonov, A.; Paredes Hernandez, D.; Park, W.; Parker, M. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pashapour, S.; Pasqualucci, E.; Passaggio, S.; Passeri, A.; Pastore, F.; Pastore, Fr.; Pásztor, G.; Pataraia, S.; Patel, N.; Pater, J. R.; Patricelli, S.; Pauly, T.; Pecsy, M.; Pedraza Morales, M. I.; Peleganchuk, S. V.; Pelikan, D.; Peng, H.; Penning, B.; Penson, A.; Penwell, J.; Perantoni, M.; Perez, K.; Perez Cavalcanti, T.; Perez Codina, E.; Pérez García-Estañ, M. T.; Perez Reale, V.; Perini, L.; Pernegger, H.; Perrino, R.; Perrodo, P.; Peshekhonov, V. D.; Peters, K.; Petersen, B. A.; Petersen, J.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petrolo, E.; Petrucci, F.; Petschull, D.; Petteni, M.; Pezoa, R.; Phan, A.; Phillips, P. W.; Piacquadio, G.; Picazio, A.; Piccaro, E.; Piccinini, M.; Piec, S. M.; Piegaia, R.; Pignotti, D. T.; Pilcher, J. E.; Pilkington, A. D.; Pina, J.; Pinamonti, M.; Pinder, A.; Pinfold, J. L.; Pinto, B.; Pizio, C.; Plamondon, M.; Pleier, M.-A.; Plotnikova, E.; Poblaguev, A.; Poddar, S.; Podlyski, F.; Poggioli, L.; Poghosyan, T.; Pohl, M.; Polesello, G.; Policicchio, A.; Polini, A.; Poll, J.; Polychronakos, V.; Pomeroy, D.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Popovic, D. S.; Poppleton, A.; Portell Bueso, X.; Pospelov, G. E.; Pospisil, S.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Prabhu, R.; Pralavorio, P.; Pranko, A.; Prasad, S.; Pravahan, R.; Prell, S.; Pretzl, K.; Price, D.; Price, J.; Price, L. E.; Prieur, D.; Primavera, M.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Prudent, X.; Przybycien, M.; Przysiezniak, H.; Psoroulas, S.; Ptacek, E.; Pueschel, E.; Purdham, J.; Purohit, M.; Puzo, P.; Pylypchenko, Y.; Qian, J.; Quadt, A.; Quarrie, D. R.; Quayle, W. B.; Quinonez, F.; Raas, M.; Radescu, V.; Radloff, P.; Rador, T.; Ragusa, F.; Rahal, G.; Rahimi, A. M.; Rahm, D.; Rajagopalan, S.; Rammensee, M.; Rammes, M.; Randle-Conde, A. S.; Randrianarivony, K.; Rauscher, F.; Rave, T. C.; Raymond, M.; Read, A. L.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reeves, K.; Reinherz-Aronis, E.; Reinsch, A.; Reisinger, I.; Rembser, C.; Ren, Z. L.; Renaud, A.; Rescigno, M.; Resconi, S.; Resende, B.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter-Was, E.; Ridel, M.; Rijpstra, M.; Rijssenbeek, M.; Rimoldi, A.; Rinaldi, L.; Rios, R. R.; Riu, I.; Rivoltella, G.; Rizatdinova, F.; Rizvi, E.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Rocha de Lima, J. G.; Roda, C.; Roda Dos Santos, D.; Roe, A.; Roe, S.; Røhne, O.; Rolli, S.; Romaniouk, A.; Romano, M.; Romeo, G.; Romero Adam, E.; Roos, L.; Ros, E.; Rosati, S.; Rosbach, K.; Rose, A.; Rose, M.; Rosenbaum, G. A.; Rosenberg, E. I.; Rosendahl, P. L.; Rosenthal, O.; Rosselet, L.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; Royon, C. R.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rubinskiy, I.; Ruckert, B.; Ruckstuhl, N.; Rud, V. I.; Rudolph, C.; Rudolph, G.; Rühr, F.; Ruiz-Martinez, A.; Rumyantsev, L.; Rurikova, Z.; Rusakovich, N. A.; Rutherfoord, J. P.; Ruwiedel, C.; Ruzicka, P.; Ryabov, Y. F.; Ryan, P.; Rybar, M.; Rybkin, G.; Ryder, N. C.; Saavedra, A. F.; Sadeh, I.; Sadrozinski, H. F.-W.; Sadykov, R.; Safai Tehrani, F.; Sakamoto, H.; Salamanna, G.; Salamon, A.; Saleem, M.; Salek, D.; Salihagic, D.; Salnikov, A.; Salt, J.; Salvachua Ferrando, B. M.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sampsonidis, D.; Samset, B. H.; Sanchez, A.; Sanchez Martinez, V.; Sandaker, H.; Sander, H. G.; Sanders, M. P.; Sandhoff, M.; Sandoval, T.; Sandoval, C.; Sandstroem, R.; Sankey, D. P. C.; Sansoni, A.; Santamarina Rios, C.; Santoni, C.; Santonico, R.; Santos, H.; Saraiva, J. G.; Sarangi, T.; Sarkisyan-Grinbaum, E.; Sarri, F.; Sartisohn, G.; Sasaki, O.; Sasao, N.; Satsounkevitch, I.; Sauvage, G.; Sauvan, E.; Sauvan, J. B.; Savard, P.; Savinov, V.; Savu, D. O.; Sawyer, L.; Saxon, D. H.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scallon, O.; Scannicchio, D. A.; Scarcella, M.; Schaarschmidt, J.; Schacht, P.; Schaefer, D.; Schäfer, U.; Schaepe, S.; Schaetzel, S.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Schamov, A. G.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Scherzer, M. I.; Schiavi, C.; Schieck, J.; Schioppa, M.; Schlenker, S.; Schmidt, E.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, M.; Schneider, B.; Schnoor, U.; Schöning, A.; Schorlemmer, A. L. S.; Schott, M.; Schouten, D.; Schovancova, J.; Schram, M.; Schroeder, C.; Schroer, N.; Schultens, M. J.; Schultes, J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwanenberger, C.; Schwartzman, A.; Schwemling, Ph.; Schwienhorst, R.; Schwierz, R.; Schwindling, J.; Schwindt, T.; Schwoerer, M.; Sciolla, G.; Scott, W. G.; Searcy, J.; Sedov, G.; Sedykh, E.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekula, S. J.; Selbach, K. E.; Seliverstov, D. M.; Sellden, B.; Sellers, G.; Seman, M.; Semprini-Cesari, N.; Serfon, C.; Serin, L.; Serkin, L.; Seuster, R.; Severini, H.; Sfyrla, A.; Shabalina, E.; Shamim, M.; Shan, L. Y.; Shank, J. T.; Shao, Q. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Sherman, D.; Sherwood, P.; Shibata, A.; Shimizu, S.; Shimojima, M.; Shin, T.; Shiyakova, M.; Shmeleva, A.; Shochet, M. J.; Short, D.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silbert, O.; Silva, J.; Silver, Y.; Silverstein, D.; Silverstein, S. B.; Simak, V.; Simard, O.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simoniello, R.; Simonyan, M.; Sinervo, P.; Sinev, N. B.; Sipica, V.; Siragusa, G.; Sircar, A.; Sisakyan, A. N.; Sivoklokov, S. Yu.; Sjölin, J.; Sjursen, T. B.; Skinnari, L. A.; Skottowe, H. P.; Skovpen, K.; Skubic, P.; Slater, M.; Slavicek, T.; Sliwa, K.; Smakhtin, V.; Smart, B. H.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, B. C.; Smith, D.; Smith, K. M.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snow, S. W.; Snow, J.; Snyder, S.; Sobie, R.; Sodomka, J.; Soffer, A.; Solans, C. A.; Solar, M.; Solc, J.; Soldatov, E. Yu.; Soldevila, U.; Solfaroli Camillocci, E.; Solodkov, A. A.; Solovyanov, O. V.; Soni, N.; Sopko, V.; Sopko, B.; Sosebee, M.; Soualah, R.; Soukharev, A.; Spagnolo, S.; Spanò, F.; Spighi, R.; Spigo, G.; Spila, F.; Spiwoks, R.; Spousta, M.; Spreitzer, T.; Spurlock, B.; St. Denis, R. D.; Stahlman, J.; Stamen, R.; Stanecka, E.; Stanek, R. W.; Stanescu, C.; Stanescu-Bellu, M.; Stapnes, S.; Starchenko, E. A.; Stark, J.; Staroba, P.; Starovoitov, P.; Staszewski, R.; Staude, A.; Stavina, P.; Steele, G.; Steinbach, P.; Steinberg, P.; Stekl, I.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stern, S.; Stewart, G. A.; Stillings, J. A.; Stockton, M. C.; Stoerig, K.; Stoicea, G.; Stonjek, S.; Strachota, P.; Stradling, A. R.; Straessner, A.; Strandberg, J.; Strandberg, S.; Strandlie, A.; Strang, M.; Strauss, E.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Strong, J. A.; Stroynowski, R.; Strube, J.; Stugu, B.; Stumer, I.; Stupak, J.; Sturm, P.; Styles, N. A.; Soh, D. A.; Su, D.; Subramania, Hs.; Succurro, A.; Sugaya, Y.; Suhr, C.; Suk, M.; Sulin, V. V.; Sultansoy, S.; Sumida, T.; Sun, X.; Sundermann, J. E.; Suruliz, K.; Susinno, G.; Sutton, M. R.; Suzuki, Y.; Suzuki, Y.; Svatos, M.; Swedish, S.; Sykora, I.; Sykora, T.; Sánchez, J.; Ta, D.; Tackmann, K.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takahashi, Y.; Takai, H.; Takashima, R.; Takeda, H.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A.; Tamsett, M. C.; Tanaka, J.; Tanaka, R.; Tanaka, S.; Tanaka, S.; Tanasijczuk, A. J.; Tani, K.; Tannoury, N.; Tapprogge, S.; Tardif, D.; Tarem, S.; Tarrade, F.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tassi, E.; Tatarkhanov, M.; Tayalati, Y.; Taylor, C.; Taylor, F. E.; Taylor, G. N.; Taylor, W.; Teinturier, M.; Teixeira Dias Castanheira, M.; Teixeira-Dias, P.; Temming, K. K.; Ten Kate, H.; Teng, P. K.; Terada, S.; Terashi, K.; Terron, J.; Testa, M.; Teuscher, R. J.; Therhaag, J.; Theveneaux-Pelzer, T.; Thoma, S.; Thomas, J. P.; Thompson, E. N.; Thompson, P. D.; Thompson, P. D.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Thomson, M.; Thun, R. P.; Tian, F.; Tibbetts, M. J.; Tic, T.; Tikhomirov, V. O.; Tikhonov, Y. A.; Timoshenko, S.; Tipton, P.; Tique Aires Viegas, F. J.; Tisserant, S.; Todorov, T.; Todorova-Nova, S.; Toggerson, B.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tollefson, K.; Tomoto, M.; Tompkins, L.; Toms, K.; Tonoyan, A.; Topfel, C.; Topilin, N. D.; Torchiani, I.; Torrence, E.; Torres, H.; Torró Pastor, E.; Toth, J.; Touchard, F.; Tovey, D. R.; Trefzger, T.; Tremblet, L.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Triplett, N.; Trischuk, W.; Trocmé, B.; Troncon, C.; Trottier-McDonald, M.; Trzebinski, M.; Trzupek, A.; Tsarouchas, C.; Tseng, J. C.-L.; Tsiakiris, M.; Tsiareshka, P. V.; Tsionou, D.; Tsipolitis, G.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsukerman, I. I.; Tsulaia, V.; Tsung, J.-W.; Tsuno, S.; Tsybychev, D.; Tua, A.; Tudorache, A.; Tudorache, V.; Tuggle, J. M.; Turala, M.; Turecek, D.; Turk Cakir, I.; Turlay, E.; Turra, R.; Tuts, P. M.; Tykhonov, A.; Tylmad, M.; Tyndel, M.; Tzanakos, G.; Uchida, K.; Ueda, I.; Ueno, R.; Ugland, M.; Uhlenbrock, M.; Uhrmacher, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Unno, Y.; Urbaniec, D.; Usai, G.; Uslenghi, M.; Vacavant, L.; Vacek, V.; Vachon, B.; Vahsen, S.; Valenta, J.; Valente, P.; Valentinetti, S.; Valero, A.; Valkar, S.; Valladolid Gallego, E.; Vallecorsa, S.; Valls Ferrer, J. A.; van der Graaf, H.; van der Kraaij, E.; van der Leeuw, R.; van der Poel, E.; van der Ster, D.; van Eldik, N.; van Gemmeren, P.; van Vulpen, I.; Vanadia, M.; Vandelli, W.; Vaniachine, A.; Vankov, P.; Vannucci, F.; Vari, R.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vassilakopoulos, V. I.; Vazeille, F.; Vazquez Schroeder, T.; Vegni, G.; Veillet, J. J.; Veloso, F.; Veness, R.; Veneziano, S.; Ventura, A.; Ventura, D.; Venturi, M.; Venturi, N.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Vichou, I.; Vickey, T.; Vickey Boeriu, O. E.; Viehhauser, G. H. A.; Viel, S.; Villa, M.; Villaplana Perez, M.; Vilucchi, E.; Vincter, M. G.; Vinek, E.; Vinogradov, V. B.; Virchaux, M.; Virzi, J.; Vitells, O.; Viti, M.; Vivarelli, I.; Vives Vaque, F.; Vlachos, S.; Vladoiu, D.; Vlasak, M.; Vogel, A.; Vokac, P.; Volpi, G.; Volpi, M.; Volpini, G.; von der Schmitt, H.; von Loeben, J.; von Radziewski, H.; von Toerne, E.; Vorobel, V.; Vorwerk, V.; Vos, M.; Voss, R.; Voss, T. T.; Vossebeld, J. H.; Vranjes, N.; Vranjes Milosavljevic, M.; Vrba, V.; Vreeswijk, M.; Vu Anh, T.; Vuillermet, R.; Vukotic, I.; Wagner, W.; Wagner, P.; Wahlen, H.; Wahrmund, S.; Wakabayashi, J.; Walch, S.; Walder, J.; Walker, R.; Walkowiak, W.; Wall, R.; Waller, P.; Wang, C.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, R.; Wang, S. M.; Wang, T.; Warburton, A.; Ward, C. P.; Warsinsky, M.; Washbrook, A.; Wasicki, C.; Watkins, P. M.; Watson, A. T.; Watson, I. J.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, A. T.; Waugh, B. M.; Weber, M.; Weber, M. S.; Weber, P.; Weidberg, A. R.; Weigell, P.; Weingarten, J.; Weiser, C.; Wellenstein, H.; Wells, P. S.; Wenaus, T.; Wendland, D.; Weng, Z.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M.; Werner, P.; Werth, M.; Wessels, M.; Wetter, J.; Weydert, C.; Whalen, K.; Wheeler-Ellis, S. J.; White, A.; White, M. J.; White, S.; Whitehead, S. R.; Whiteson, D.; Whittington, D.; Wicek, F.; Wicke, D.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wienemann, P.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wijeratne, P. A.; Wildauer, A.; Wildt, M. A.; Wilhelm, I.; Wilkens, H. G.; Will, J. Z.; Williams, E.; Williams, H. H.; Willis, W.; Willocq, S.; Wilson, J. A.; Wilson, M. G.; Wilson, A.; Wingerter-Seez, I.; Winkelmann, S.; Winklmeier, F.; Wittgen, M.; Wollstadt, S. J.; Wolter, M. W.; Wolters, H.; Wong, W. C.; Wooden, G.; Wosiek, B. K.; Wotschack, J.; Woudstra, M. J.; Wozniak, K. W.; Wraight, K.; Wright, C.; Wright, M.; Wrona, B.; Wu, S. L.; Wu, X.; Wu, Y.; Wulf, E.; Wynne, B. M.; Xella, S.; Xiao, M.; Xie, S.; Xu, C.; Xu, D.; Yabsley, B.; Yacoob, S.; Yamada, M.; Yamaguchi, H.; Yamamoto, A.; Yamamoto, K.; Yamamoto, S.; Yamamura, T.; Yamanaka, T.; Yamaoka, J.; Yamazaki, T.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, U. K.; Yang, Y.; Yang, Z.; Yanush, S.; Yao, L.; Yao, Y.; Yasu, Y.; Ybeles Smit, G. V.; Ye, J.; Ye, S.; Yilmaz, M.; Yoosoofmiya, R.; Yorita, K.; Yoshida, R.; Young, C.; Young, C. J.; Youssef, S.; Yu, D.; Yu, J.; Yu, J.; Yuan, L.; Yurkewicz, A.; Byszewski, M.; Zabinski, B.; Zaidan, R.; Zaitsev, A. M.; Zajacova, Z.; Zanello, L.; Zaytsev, A.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zendler, C.; Zenin, O.; Ženiš, T.; Zinonos, Z.; Zenz, S.; Zerwas, D.; Zevi Della Porta, G.; Zhan, Z.; Zhang, D.; Zhang, H.; Zhang, J.; Zhang, X.; Zhang, Z.; Zhao, L.; Zhao, T.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, N.; Zhou, Y.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhuravlov, V.; Zieminska, D.; Zimin, N. I.; Zimmermann, R.; Zimmermann, S.; Zimmermann, S.; Ziolkowski, M.; Zitoun, R.; Živković, L.; Zmouchko, V. V.; Zobernig, G.; Zoccoli, A.; Zur Nedden, M.; Zutshi, V.; Zwalinski, L.; Atlas Collaboration

2012-10-01

A search for a heavy Standard Model Higgs boson decaying via H → ZZ →ℓ+ℓ- qqbar, where ℓ = e or μ, is presented. The search uses a data set of pp collisions at √{ s} = 7 TeV, corresponding to an integrated luminosity of 4.7 fb-1 collected in 2011 by the ATLAS detector at the CERN LHC. No significant excess of events above the estimated background is found. Upper limits at 95% confidence level on the production cross section of a Higgs boson with a mass in the range between 200 and 600 GeV are derived. A Standard Model Higgs boson with a mass in the range 300 GeV ⩽mH ⩽ 322 GeV or 353 GeV ⩽mH ⩽ 410 GeV is excluded at 95% CL. The corresponding expected exclusion range is 351 GeV ⩽mH ⩽ 404 GeV at 95% CL.

Guideline adaptation and implementation planning: a prospective observational study

PubMed Central

2013-01-01

Background Adaptation of high-quality practice guidelines for local use has been advanced as an efficient means to improve acceptability and applicability of evidence-informed care. In a pan-Canadian study, we examined how cancer care groups adapted pre-existing guidelines to their unique context and began implementation planning. Methods Using a mixed-methods, case-study design, five cases were purposefully sampled from self-identified groups and followed as they used a structured method and resources for guideline adaptation. Cases received the ADAPTE Collaboration toolkit, facilitation, methodological and logistical support, resources and assistance as required. Documentary and primary data collection methods captured individual case experience, including monthly summaries of meeting and field notes, email/telephone correspondence, and project records. Site visits, process audits, interviews, and a final evaluation forum with all cases contributed to a comprehensive account of participant experience. Results Study cases took 12 to >24 months to complete guideline adaptation. Although participants appreciated the structure, most found the ADAPTE method complex and lacking practical aspects. They needed assistance establishing individual guideline mandate and infrastructure, articulating health questions, executing search strategies, appraising evidence, and achieving consensus. Facilitation was described as a multi-faceted process, a team effort, and an essential ingredient for guideline adaptation. While front-line care providers implicitly identified implementation issues during adaptation, they identified a need to add an explicit implementation planning component. Conclusions Guideline adaptation is a positive initial step toward evidence-informed care, but adaptation (vs. ‘de novo’ development) did not meet expectations for reducing time or resource commitments. Undertaking adaptation is as much about the process (engagement and capacity building) as it

Remote Sensing of Climate-Driven Range Shifts of Vegetation across North American Mountain Ranges

NASA Astrophysics Data System (ADS)

Kendrick, J. A.; Sax, D. F.; Kellner, J. R.

2015-12-01

Global climate change is driving shifts in local environmental conditions, and many organisms are projected to become poorly adapted to their current ranges. Some species may respond by gradually shifting their range limits to track environmental change. This adaptation strategy is expected to be most feasible in regions with sharp climatic gradients, such as mountain ranges. However, the extent to which this process is taking place is poorly understood, and some evidence suggests that shifts upwards in elevation might be more difficult than expected. Direct empirical evidence of range shifts in response to recent climate change could inform models and conservation strategies. Here we used Monte Carlo spectral unmixing of Landsat surface reflectance data to characterize changes in vegetation cover across major North American mountain ranges over the past 30 years. This approach allows us to observe changes in photosynthetic and nonphotosynthetic vegetation as well as absolute change in vegetation cover. We found evidence of a gradual increase in total vegetation cover at increasing elevations, but this pattern varied in its strength both within and among mountain ranges. We also observed more dramatic changes in vegetation type which differed strongly between regions with different climates. Our analysis shows that upslope range shift is a possible climate response in many cases, but that this process does not occur uniformly.

Transcranial Alternating Current Stimulation Attenuates Neuronal Adaptation.

PubMed

Kar, Kohitij; Duijnhouwer, Jacob; Krekelberg, Bart

2017-03-01

We previously showed that brief application of 2 mA (peak-to-peak) transcranial currents alternating at 10 Hz significantly reduces motion adaptation in humans. This is but one of many behavioral studies showing that weak currents applied to the scalp modulate neural processing. Transcranial stimulation has been shown to improve perception, learning, and a range of clinical symptoms. Few studies, however, have measured the neural consequences of transcranial current stimulation. We capitalized on the strong link between motion perception and neural activity in the middle temporal (MT) area of the macaque monkey to study the neural mechanisms that underlie the behavioral consequences of transcranial alternating current stimulation. First, we observed that 2 mA currents generated substantial intracranial fields, which were much stronger in the stimulated hemisphere (0.12 V/m) than on the opposite side of the brain (0.03 V/m). Second, we found that brief application of transcranial alternating current stimulation at 10 Hz reduced spike-frequency adaptation of MT neurons and led to a broadband increase in the power spectrum of local field potentials. Together, these findings provide a direct demonstration that weak electric fields applied to the scalp significantly affect neural processing in the primate brain and that this includes a hitherto unknown mechanism that attenuates sensory adaptation. SIGNIFICANCE STATEMENT Transcranial stimulation has been claimed to improve perception, learning, and a range of clinical symptoms. Little is known, however, how transcranial current stimulation generates such effects, and the search for better stimulation protocols proceeds largely by trial and error. We investigated, for the first time, the neural consequences of stimulation in the monkey brain. We found that even brief application of alternating current stimulation reduced the effects of adaptation on single-neuron firing rates and local field potentials; this mechanistic

Adaptive infinite impulse response system identification using modified-interior search algorithm with Lèvy flight.

PubMed

Kumar, Manjeet; Rawat, Tarun Kumar; Aggarwal, Apoorva

2017-03-01

In this paper, a new meta-heuristic optimization technique, called interior search algorithm (ISA) with Lèvy flight is proposed and applied to determine the optimal parameters of an unknown infinite impulse response (IIR) system for the system identification problem. ISA is based on aesthetics, which is commonly used in interior design and decoration processes. In ISA, composition phase and mirror phase are applied for addressing the nonlinear and multimodal system identification problems. System identification using modified-ISA (M-ISA) based method involves faster convergence, single parameter tuning and does not require derivative information because it uses a stochastic random search using the concepts of Lèvy flight. A proper tuning of control parameter has been performed in order to achieve a balance between intensification and diversification phases. In order to evaluate the performance of the proposed method, mean square error (MSE), computation time and percentage improvement are considered as the performance measure. To validate the performance of M-ISA based method, simulations has been carried out for three benchmarked IIR systems using same order and reduced order system. Genetic algorithm (GA), particle swarm optimization (PSO), cat swarm optimization (CSO), cuckoo search algorithm (CSA), differential evolution using wavelet mutation (DEWM), firefly algorithm (FFA), craziness based particle swarm optimization (CRPSO), harmony search (HS) algorithm, opposition based harmony search (OHS) algorithm, hybrid particle swarm optimization-gravitational search algorithm (HPSO-GSA) and ISA are also used to model the same examples and simulation results are compared. Obtained results confirm the efficiency of the proposed method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

An adaptive evolutionary multi-objective approach based on simulated annealing.

PubMed

Li, H; Landa-Silva, D

2011-01-01

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a population of solutions. However, the performance of MOEA/D highly depends on the initial setting and diversity of the weight vectors. In this paper, we present an improved version of MOEA/D, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems. In EMOSA, the weight vector of each subproblem is adaptively modified at the lowest temperature in order to diversify the search toward the unexplored parts of the Pareto-optimal front. Our computational results show that EMOSA outperforms six other well established multi-objective metaheuristic algorithms on both the (constrained) multi-objective knapsack problem and the (unconstrained) multi-objective traveling salesman problem. Moreover, the effects of the main algorithmic components and parameter sensitivities on the search performance of EMOSA are experimentally investigated.

Demeter, persephone, and the search for emergence in agent-based models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

North, M. J.; Howe, T. R.; Collier, N. T.

2006-01-01

In Greek mythology, the earth goddess Demeter was unable to find her daughter Persephone after Persephone was abducted by Hades, the god of the underworld. Demeter is said to have embarked on a long and frustrating, but ultimately successful, search to find her daughter. Unfortunately, long and frustrating searches are not confined to Greek mythology. In modern times, agent-based modelers often face similar troubles when searching for agents that are to be to be connected to one another and when seeking appropriate target agents while defining agent behaviors. The result is a 'search for emergence' in that many emergent ormore » potentially emergent behaviors in agent-based models of complex adaptive systems either implicitly or explicitly require search functions. This paper considers a new nested querying approach to simplifying such agent-based modeling and multi-agent simulation search problems.« less

Genetic Diversity and Population Structure in a Legacy Collection of Spring Barley Landraces Adapted to a Wide Range of Climates

PubMed Central

Walther, Alexander; Özkan, Hakan; Graner, Andreas; Kilian, Benjamin

2014-01-01

Global environmental change and increasing human population emphasize the urgent need for higher yielding and better adapted crop plants. One strategy to achieve this aim is to exploit the wealth of so called landraces of crop species, representing diverse traditional domesticated populations of locally adapted genotypes. In this study, we investigated a comprehensive set of 1485 spring barley landraces (Lrc1485) adapted to a wide range of climates, which were selected from one of the largest genebanks worldwide. The landraces originated from 5° to 62.5° N and 16° to 71° E. The whole collection was genotyped using 42 SSR markers to assess the genetic diversity and population structure. With an average allelic richness of 5.74 and 372 alleles, Lrc1485 harbours considerably more genetic diversity than the most polymorphic current GWAS panel for barley. Ten major clusters defined most of the population structure based on geographical origin, row type of the ear and caryopsis type – and were assigned to specific climate zones. The legacy core reference set Lrc648 established in this study will provide a long-lasting resource and a very valuable tool for the scientific community. Lrc648 is best suited for multi-environmental field testing to identify candidate genes underlying quantitative traits but also for allele mining approaches. PMID:25541702

Cultural adaptations to augment health and mental health services: a systematic review.

PubMed

Healey, Priscilla; Stager, Megan L; Woodmass, Kyler; Dettlaff, Alan J; Vergara, Andrew; Janke, Robert; Wells, Susan J

2017-01-05

Membership in diverse racial, ethnic, and cultural groups is often associated with inequitable health and mental health outcomes for diverse populations. Yet, little is known about how cultural adaptations of standard services affect health and mental health outcomes for service recipients. This systematic review identified extant themes in the research regarding cultural adaptations across a broad range of health and mental health services and synthesized the most rigorous experimental research available to isolate and evaluate potential efficacy gains of cultural adaptations to service delivery. MEDLINE, PsycINFO, CINAHL, EMBASE, and grey literature sources were searched for English-language studies published between January 1955 and January 2015. Cultural adaptations to any aspect of a service delivery were considered. Outcomes of interest included changes in service provider behavior or changes in the behavioral, medical, or self-reported experience of recipients. Thirty-one studies met the inclusion criteria. The most frequently tested adaptation occurred in preventive services and consisted of modifying the content of materials or services delivered. None of the included studies focused on making changes in the provider's behavior. Many different populations were studied but most research was concerned with the experiences and outcomes of African Americans. Seventeen of the 31 retained studies observed at least one significant effect in favor of a culturally adapted service. However there were also findings that favored the control group or showed no difference. Researchers did not find consistent evidence supporting implementation of any specific type of adaptation nor increased efficacy with any particular cultural group. Conceptual frameworks to classify cultural adaptations and their resultant health/mental health outcomes were developed and applied in a variety of ways. This review synthesizes the most rigorous research in the field and identifies

Controlling range expansion in habitat networks by adaptively targeting source populations.

PubMed

Hock, Karlo; Wolff, Nicholas H; Beeden, Roger; Hoey, Jessica; Condie, Scott A; Anthony, Kenneth R N; Possingham, Hugh P; Mumby, Peter J

2016-08-01

Controlling the spread of invasive species, pests, and pathogens is often logistically limited to interventions that target specific locations at specific periods. However, in complex, highly connected systems, such as marine environments connected by ocean currents, populations spread dynamically in both space and time via transient connectivity links. This results in nondeterministic future distributions of species in which local populations emerge dynamically and concurrently over a large area. The challenge, therefore, is to choose intervention locations that will maximize the effectiveness of the control efforts. We propose a novel method to manage dynamic species invasions and outbreaks that identifies the intervention locations most likely to curtail population expansion by selectively targeting local populations most likely to expand their future range. Critically, at any point during the development of the invasion or outbreak, the method identifies the local intervention that maximizes the long-term benefit across the ecosystem by restricting species' potential to spread. In so doing, the method adaptively selects the intervention targets under dynamically changing circumstances. To illustrate the effectiveness of the method we applied it to controlling the spread of crown-of-thorns starfish (Acanthaster sp.) outbreaks across Australia's Great Barrier Reef. Application of our method resulted in an 18-fold relative improvement in management outcomes compared with a random targeting of reefs in putative starfish control scenarios. Although we focused on applying the method to reducing the spread of an unwanted species, it can also be used to facilitate the spread of desirable species through connectivity networks. For example, the method could be used to select those fragments of habitat most likely to rebuild a population if they were sufficiently well protected. © 2016 Society for Conservation Biology.

Multipass Target Search in Natural Environments

PubMed Central

Otte, Michael W.; Sofge, Donald; Gupta, Satyandra K.

2017-01-01

Consider a disaster scenario where search and rescue workers must search difficult to access buildings during an earthquake or flood. Often, finding survivors a few hours sooner results in a dramatic increase in saved lives, suggesting the use of drones for expedient rescue operations. Entropy can be used to quantify the generation and resolution of uncertainty. When searching for targets, maximizing mutual information of future sensor observations will minimize expected target location uncertainty by minimizing the entropy of the future estimate. Motion planning for multi-target autonomous search requires planning over an area with an imperfect sensor and may require multiple passes, which is hindered by the submodularity property of mutual information. Further, mission duration constraints must be handled accordingly, requiring consideration of the vehicle’s dynamics to generate feasible trajectories and must plan trajectories spanning the entire mission duration, something which most information gathering algorithms are incapable of doing. If unanticipated changes occur in an uncertain environment, new plans must be generated quickly. In addition, planning multipass trajectories requires evaluating path dependent rewards, requiring planning in the space of all previously selected actions, compounding the problem. We present an anytime algorithm for autonomous multipass target search in natural environments. The algorithm is capable of generating long duration dynamically feasible multipass coverage plans that maximize mutual information using a variety of techniques such as ϵ-admissible heuristics to speed up the search. To the authors’ knowledge this is the first attempt at efficiently solving multipass target search problems of such long duration. The proposed algorithm is based on best first branch and bound and is benchmarked against state of the art algorithms adapted to the problem in natural Simplex environments, gathering the most information in the

Visual search and attention: an overview.

PubMed

Davis, Elizabeth T; Palmer, John

2004-01-01

This special feature issue is devoted to attention and visual search. Attention is a central topic in psychology and visual search is both a versatile paradigm for the study of visual attention and a topic of study in itself. Visual search depends on sensory, perceptual, and cognitive processes. As a result, the search paradigm has been used to investigate a diverse range of phenomena. Manipulating the search task can vary the demands on attention. In turn, attention modulates visual search by selecting and limiting the information available at various levels of processing. Focusing on the intersection of attention and search provides a relatively structured window into the wide world of attentional phenomena. In particular, the effects of divided attention are illustrated by the effects of set size (the number of stimuli in a display) and the effects of selective attention are illustrated by cueing subsets of stimuli within the display. These two phenomena provide the starting point for the articles in this special issue. The articles are organized into four general topics to help structure the issues of attention and search.

Advanced Unmanned Search System (AUSS) Performance Analysis

DTIC Science & Technology

1979-07-15

interference (from thrusters , flow noise , etc.) with sonar data; (4) Sonar range scales can be adjusted, on scene, for viewing the same contacts with...intact. The H-bomb search was performed at 2000 feet, the sub- marine search at 8400 feet. An additional submarine search was selected at 20,000 feet to...Sonar Targets," by Stephen Miller, Marine Physical Laboratory, Scripps Institution of Oceanography, January 1977. 10 Table 2. Baseline towed system

Assisted Design of Antibody and Protein Therapeutics (ADAPT)

PubMed Central

Vivcharuk, Victor; Baardsnes, Jason; Deprez, Christophe; Sulea, Traian; Jaramillo, Maria; Corbeil, Christopher R.; Mullick, Alaka; Magoon, Joanne; Marcil, Anne; Durocher, Yves; O’Connor-McCourt, Maureen D.

2017-01-01

Effective biologic therapeutics require binding affinities that are fine-tuned to their disease-related molecular target. The ADAPT (Assisted Design of Antibody and Protein Therapeutics) platform aids in the selection of mutants that improve/modulate the affinity of antibodies and other biologics. It uses a consensus z-score from three scoring functions and interleaves computational predictions with experimental validation, significantly enhancing the robustness of the design and selection of mutants. The platform was tested on three antibody Fab-antigen systems that spanned a wide range of initial binding affinities: bH1-VEGF-A (44 nM), bH1-HER2 (3.6 nM) and Herceptin-HER2 (0.058 nM). Novel triple mutants were obtained that exhibited 104-, 46- and 32-fold improvements in binding affinity for each system, respectively. Moreover, for all three antibody-antigen systems over 90% of all the intermediate single and double mutants that were designed and tested showed higher affinities than the parent sequence. The contributions of the individual mutants to the change in binding affinity appear to be roughly additive when combined to form double and triple mutants. The new interactions introduced by the affinity-enhancing mutants included long-range electrostatics as well as short-range nonpolar interactions. This diversity in the types of new interactions formed by the mutants was reflected in SPR kinetics that showed that the enhancements in affinities arose from increasing on-rates, decreasing off-rates or a combination of the two effects, depending on the mutation. ADAPT is a very focused search of sequence space and required only 20–30 mutants for each system to be made and tested to achieve the affinity enhancements mentioned above. PMID:28750054

Four-Dimensional Golden Search

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fenimore, Edward E.

2015-02-25

The Golden search technique is a method to search a multiple-dimension space to find the minimum. It basically subdivides the possible ranges of parameters until it brackets, to within an arbitrarily small distance, the minimum. It has the advantages that (1) the function to be minimized can be non-linear, (2) it does not require derivatives of the function, (3) the convergence criterion does not depend on the magnitude of the function. Thus, if the function is a goodness of fit parameter such as chi-square, the convergence does not depend on the noise being correctly estimated or the function correctly followingmore » the chi-square statistic. And, (4) the convergence criterion does not depend on the shape of the function. Thus, long shallow surfaces can be searched without the problem of premature convergence. As with many methods, the Golden search technique can be confused by surfaces with multiple minima.« less

Behavioral and Neural Adaptation in Approach Behavior.

PubMed

Wang, Shuo; Falvello, Virginia; Porter, Jenny; Said, Christopher P; Todorov, Alexander

2018-06-01

People often make approachability decisions based on perceived facial trustworthiness. However, it remains unclear how people learn trustworthiness from a population of faces and whether this learning influences their approachability decisions. Here we investigated the neural underpinning of approach behavior and tested two important hypotheses: whether the amygdala adapts to different trustworthiness ranges and whether the amygdala is modulated by task instructions and evaluative goals. We showed that participants adapted to the stimulus range of perceived trustworthiness when making approach decisions and that these decisions were further modulated by the social context. The right amygdala showed both linear response and quadratic response to trustworthiness level, as observed in prior studies. Notably, the amygdala's response to trustworthiness was not modulated by stimulus range or social context, a possible neural dynamic adaptation. Together, our data have revealed a robust behavioral adaptation to different trustworthiness ranges as well as a neural substrate underlying approach behavior based on perceived facial trustworthiness.

An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem.

PubMed

Lusby, Richard Martin; Schwierz, Martin; Range, Troels Martin; Larsen, Jesper

2016-11-01

The aim of this paper is to provide an improved method for solving the so-called dynamic patient admission scheduling (DPAS) problem. This is a complex scheduling problem that involves assigning a set of patients to hospital beds over a given time horizon in such a way that several quality measures reflecting patient comfort and treatment efficiency are maximized. Consideration must be given to uncertainty in the length of stays of patients as well as the possibility of emergency patients. We develop an adaptive large neighborhood search (ALNS) procedure to solve the problem. This procedure utilizes a Simulated Annealing framework. We thoroughly test the performance of the proposed ALNS approach on a set of 450 publicly available problem instances. A comparison with the current state-of-the-art indicates that the proposed methodology provides solutions that are of comparable quality for small and medium sized instances (up to 1000 patients); the two approaches provide solutions that differ in quality by approximately 1% on average. The ALNS procedure does, however, provide solutions in a much shorter time frame. On larger instances (between 1000-4000 patients) the improvement in solution quality by the ALNS procedure is substantial, approximately 3-14% on average, and as much as 22% on a single instance. The time taken to find such results is, however, in the worst case, a factor 12 longer on average than the time limit which is granted to the current state-of-the-art. The proposed ALNS procedure is an efficient and flexible method for solving the DPAS problem. Copyright © 2016 Elsevier B.V. All rights reserved.

Search for a Higgs boson in the mass range from 145 to 1000 GeV decaying to a pair of W or Z bosons

DOE PAGES

Khachatryan, Vardan

2015-10-22

A search for a heavy Higgs boson in the H → WW and H → ZZ decay channels is reported. The search is based upon proton-proton collision data samples corresponding to an integrated luminosity of up to 5.1 fb –1 at √s = 7 TeV and up to 19.7fb –1 at √s = 8 TeV, recorded by the CMS experiment at the CERN LHC. Several final states of the H → WW and H → ZZ decays are analyzed. The combined upper limit at the 95% confidence level on the product of the cross section and branching fraction exclude amore » Higgs boson with standard model-like couplings and decays in the range 145 < m H < 1000 GeV. In addition, we interpret the results in the context of an electroweak singlet extension of the standard model.« less

Search for a Higgs boson in the mass range from 145 to 1000 GeV decaying to a pair of W or Z bosons

NASA Astrophysics Data System (ADS)

Khachatryan, V.; Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Asilar, E.; Bergauer, T.; Brandstetter, J.; Brondolin, E.; Dragicevic, M.; Erö, J.; Flechl, M.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Hartl, C.; Hörmann, N.; Hrubec, J.; Jeitler, M.; Knünz, V.; König, A.; Krammer, M.; Krätschmer, I.; Liko, D.; Matsushita, T.; Mikulec, I.; Rabady, D.; Rahbaran, B.; Rohringer, H.; Schieck, J.; Schöfbeck, R.; Strauss, J.; Treberer-Treberspurg, W.; Waltenberger, W.; Wulz, C.-E.; Mossolov, V.; Shumeiko, N.; Suarez Gonzalez, J.; Alderweireldt, S.; Cornelis, T.; De Wolf, E. A.; Janssen, X.; Knutsson, A.; Lauwers, J.; Luyckx, S.; Ochesanu, S.; Rougny, R.; Van De Klundert, M.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Van Spilbeeck, A.; Abu Zeid, S.; Blekman, F.; D'Hondt, J.; Daci, N.; De Bruyn, I.; Deroover, K.; Heracleous, N.; Keaveney, J.; Lowette, S.; Moreels, L.; Olbrechts, A.; Python, Q.; Strom, D.; Tavernier, S.; Van Doninck, W.; Van Mulders, P.; Van Onsem, G. P.; Van Parijs, I.; Barria, P.; Caillol, C.; Clerbaux, B.; De Lentdecker, G.; Delannoy, H.; Dobur, D.; Fasanella, G.; Favart, L.; Gay, A. P. R.; Grebenyuk, A.; Léonard, A.; Mohammadi, A.; Perniè, L.; Randleconde, A.; Reis, T.; Seva, T.; Thomas, L.; Vander Velde, C.; Vanlaer, P.; Wang, J.; Zenoni, F.; Zhang, F.; Beernaert, K.; Benucci, L.; Cimmino, A.; Crucy, S.; Fagot, A.; Garcia, G.; Gul, M.; Mccartin, J.; Ocampo Rios, A. A.; Poyraz, D.; Ryckbosch, D.; Salva Diblen, S.; Sigamani, M.; Strobbe, N.; Tytgat, M.; Van Driessche, W.; Yazgan, E.; Zaganidis, N.; Basegmez, S.; Beluffi, C.; Bondu, O.; Bruno, G.; Castello, R.; Caudron, A.; Ceard, L.; Da Silveira, G. G.; Delaere, C.; du Pree, T.; Favart, D.; Forthomme, L.; Giammanco, A.; Hollar, J.; Jafari, A.; Jez, P.; Komm, M.; Lemaitre, V.; Mertens, A.; Nuttens, C.; Perrini, L.; Pin, A.; Piotrzkowski, K.; Popov, A.; Quertenmont, L.; Selvaggi, M.; Vidal Marono, M.; Beliy, N.; Caebergs, T.; Hammad, G. H.; Aldá Júnior, W. L.; Alves, G. A.; Brito, L.; Correa Martins Junior, M.; Dos Reis Martins, T.; Hensel, C.; Mora Herrera, C.; Moraes, A.; Pol, M. E.; Rebello Teles, P.; Belchior Batista Das Chagas, E.; Carvalho, W.; Chinellato, J.; Custódio, A.; Da Costa, E. M.; De Jesus Damiao, D.; De Oliveira Martins, C.; Fonseca De Souza, S.; Huertas Guativa, L. M.; Malbouisson, H.; Matos Figueiredo, D.; Mundim, L.; Nogima, H.; Prado Da Silva, W. L.; Santaolalla, J.; Santoro, A.; Sznajder, A.; Tonelli Manganote, E. J.; Vilela Pereira, A.; Ahuja, S.; Bernardes, C. A.; Dogra, S.; Fernandez Perez Tomei, T. R.; Gregores, E. M.; Mercadante, P. G.; Moon, C. S.; Novaes, S. F.; Padula, Sandra S.; Romero Abad, D.; Ruiz Vargas, J. C.; Aleksandrov, A.; Genchev, V.; Hadjiiska, R.; Iaydjiev, P.; Marinov, A.; Piperov, S.; Rodozov, M.; Stoykova, S.; Sultanov, G.; Vutova, M.; Dimitrov, A.; Glushkov, I.; Litov, L.; Pavlov, B.; Petkov, P.; Ahmad, M.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Chen, M.; Cheng, T.; Du, R.; Jiang, C. H.; Plestina, R.; Romeo, F.; Shaheen, S. M.; Tao, J.; Wang, C.; Wang, Z.; Zhang, H.; Asawatangtrakuldee, C.; Ban, Y.; Li, Q.; Liu, S.; Mao, Y.; Qian, S. J.; Wang, D.; Xu, Z.; Zou, W.; Avila, C.; Cabrera, A.; Chaparro Sierra, L. F.; Florez, C.; Gomez, J. P.; Gomez Moreno, B.; Sanabria, J. C.; Godinovic, N.; Lelas, D.; Polic, D.; Puljak, I.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Kadija, K.; Luetic, J.; Sudic, L.; Attikis, A.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Rykaczewski, H.; Bodlak, M.; Finger, M.; Finger, M.; Ali, A.; Aly, R.; Aly, S.; Assran, Y.; Ellithi Kamel, A.; Lotfy, A.; Mahmoud, M. A.; Masod, R.; Radi, A.; Calpas, B.; Kadastik, M.; Murumaa, M.; Raidal, M.; Tiko, A.; Veelken, C.; Eerola, P.; Voutilainen, M.; Härkönen, J.; Karimäki, V.; Kinnunen, R.; Lampén, T.; Lassila-Perini, K.; Lehti, S.; Lindén, T.; Luukka, P.; Mäenpää, T.; Pekkanen, J.; Peltola, T.; Tuominen, E.; Tuominiemi, J.; Tuovinen, E.; Wendland, L.; Talvitie, J.; Tuuva, T.; Besancon, M.; Couderc, F.; Dejardin, M.; Denegri, D.; Fabbro, B.; Faure, J. L.; Favaro, C.; Ferri, F.; Ganjour, S.; Givernaud, A.; Gras, P.; Hamel de Monchenault, G.; Jarry, P.; Locci, E.; Machet, M.; Malcles, J.; Rander, J.; Rosowsky, A.; Titov, M.; Zghiche, A.; Baffioni, S.; Beaudette, F.; Busson, P.; Cadamuro, L.; Chapon, E.; Charlot, C.; Dahms, T.; Davignon, O.; Filipovic, N.; Florent, A.; Granier de Cassagnac, R.; Lisniak, S.; Mastrolorenzo, L.; Miné, P.; Naranjo, I. N.; Nguyen, M.; Ochando, C.; Ortona, G.; Paganini, P.; Regnard, S.; Salerno, R.; Sauvan, J. B.; Sirois, Y.; Strebler, T.; Yilmaz, Y.; Zabi, A.; Agram, J.-L.; Andrea, J.; Aubin, A.; Bloch, D.; Brom, J.-M.; Buttignol, M.; Chabert, E. C.; Chanon, N.; Collard, C.; Conte, E.; Fontaine, J.-C.; Gelé, D.; Goerlach, U.; Goetzmann, C.; Le Bihan, A.-C.; Merlin, J. A.; Skovpen, K.; Van Hove, P.; Gadrat, S.; Beauceron, S.; Beaupere, N.; Bernet, C.; Boudoul, G.; Bouvier, E.; Brochet, S.; Carrillo Montoya, C. A.; Chasserat, J.; Chierici, R.; Contardo, D.; Courbon, B.; Depasse, P.; El Mamouni, H.; Fan, J.; Fay, J.; Gascon, S.; Gouzevitch, M.; Ille, B.; Laktineh, I. B.; Lethuillier, M.; Mirabito, L.; Pequegnot, A. L.; Perries, S.; Ruiz Alvarez, J. D.; Sabes, D.; Sgandurra, L.; Sordini, V.; Vander Donckt, M.; Verdier, P.; Viret, S.; Xiao, H.; Tsamalaidze, Z.; Autermann, C.; Beranek, S.; Edelhoff, M.; Feld, L.; Heister, A.; Kiesel, M. K.; Klein, K.; Lipinski, M.; Ostapchuk, A.; Preuten, M.; Raupach, F.; Sammet, J.; Schael, S.; Schulte, J. F.; Verlage, T.; Weber, H.; Wittmer, B.; Zhukov, V.; Ata, M.; Brodski, M.; Dietz-Laursonn, E.; Duchardt, D.; Endres, M.; Erdmann, M.; Erdweg, S.; Esch, T.; Fischer, R.; Güth, A.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Klingebiel, D.; Knutzen, S.; Kreuzer, P.; Merschmeyer, M.; Meyer, A.; Millet, P.; Olschewski, M.; Padeken, K.; Papacz, P.; Pook, T.; Radziej, M.; Reithler, H.; Rieger, M.; Scheuch, F.; Sonnenschein, L.; Teyssier, D.; Thüer, S.; Cherepanov, V.; Erdogan, Y.; Flügge, G.; Geenen, H.; Geisler, M.; Haj Ahmad, W.; Hoehle, F.; Kargoll, B.; Kress, T.; Kuessel, Y.; Künsken, A.; Lingemann, J.; Nehrkorn, A.; Nowack, A.; Nugent, I. M.; Pistone, C.; Pooth, O.; Stahl, A.; Aldaya Martin, M.; Asin, I.; Bartosik, N.; Behnke, O.; Behrens, U.; Bell, A. J.; Borras, K.; Burgmeier, A.; Cakir, A.; Calligaris, L.; Campbell, A.; Choudhury, S.; Costanza, F.; Diez Pardos, C.; Dolinska, G.; Dooling, S.; Dorland, T.; Eckerlin, G.; Eckstein, D.; Eichhorn, T.; Flucke, G.; Gallo, E.; Garay Garcia, J.; Geiser, A.; Gizhko, A.; Gunnellini, P.; Hauk, J.; Hempel, M.; Jung, H.; Kalogeropoulos, A.; Karacheban, O.; Kasemann, M.; Katsas, P.; Kieseler, J.; Kleinwort, C.; Korol, I.; Lange, W.; Leonard, J.; Lipka, K.; Lobanov, A.; Lohmann, W.; Mankel, R.; Marfin, I.; Melzer-Pellmann, I.-A.; Meyer, A. B.; Mittag, G.; Mnich, J.; Mussgiller, A.; Naumann-Emme, S.; Nayak, A.; Ntomari, E.; Perrey, H.; Pitzl, D.; Placakyte, R.; Raspereza, A.; Ribeiro Cipriano, P. M.; Roland, B.; Sahin, M. Ö.; Salfeld-Nebgen, J.; Saxena, P.; Schoerner-Sadenius, T.; Schröder, M.; Seitz, C.; Spannagel, S.; Trippkewitz, K. D.; Wissing, C.; Blobel, V.; Centis Vignali, M.; Draeger, A. R.; Erfle, J.; Garutti, E.; Goebel, K.; Gonzalez, D.; Görner, M.; Haller, J.; Hoffmann, M.; Höing, R. S.; Junkes, A.; Klanner, R.; Kogler, R.; Lapsien, T.; Lenz, T.; Marchesini, I.; Marconi, D.; Nowatschin, D.; Ott, J.; Pantaleo, F.; Peiffer, T.; Perieanu, A.; Pietsch, N.; Poehlsen, J.; Rathjens, D.; Sander, C.; Schettler, H.; Schleper, P.; Schlieckau, E.; Schmidt, A.; Seidel, M.; Sola, V.; Stadie, H.; Steinbrück, G.; Tholen, H.; Troendle, D.; Usai, E.; Vanelderen, L.; Vanhoefer, A.; Akbiyik, M.; Barth, C.; Baus, C.; Berger, J.; Böser, C.; Butz, E.; Chwalek, T.; Colombo, F.; De Boer, W.; Descroix, A.; Dierlamm, A.; Feindt, M.; Frensch, F.; Giffels, M.; Gilbert, A.; Hartmann, F.; Husemann, U.; Kassel, F.; Katkov, I.; Kornmayer, A.; Lobelle Pardo, P.; Mozer, M. U.; Müller, T.; Müller, Th.; Plagge, M.; Quast, G.; Rabbertz, K.; Röcker, S.; Roscher, F.; Simonis, H. J.; Stober, F. M.; Ulrich, R.; Wagner-Kuhr, J.; Wayand, S.; Weiler, T.; Wöhrmann, C.; Wolf, R.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Giakoumopoulou, V. A.; Kyriakis, A.; Loukas, D.; Markou, A.; Psallidas, A.; Topsis-Giotis, I.; Agapitos, A.; Kesisoglou, S.; Panagiotou, A.; Saoulidou, N.; Tziaferi, E.; Evangelou, I.; Flouris, G.; Foudas, C.; Kokkas, P.; Loukas, N.; Manthos, N.; Papadopoulos, I.; Paradas, E.; Strologas, J.; Bencze, G.; Hajdu, C.; Hazi, A.; Hidas, P.; Horvath, D.; Sikler, F.; Veszpremi, V.; Vesztergombi, G.; Zsigmond, A. J.; Beni, N.; Czellar, S.; Karancsi, J.; Molnar, J.; Szillasi, Z.; Bartók, M.; Makovec, A.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Mal, P.; Mandal, K.; Sahoo, N.; Swain, S. K.; Bansal, S.; Beri, S. B.; Bhatnagar, V.; Chawla, R.; Gupta, R.; Bhawandeep, U.; Kalsi, A. K.; Kaur, A.; Kaur, M.; Kumar, R.; Mehta, A.; Mittal, M.; Nishu, N.; Singh, J. B.; Walia, G.; Kumar, Ashok; Kumar, Arun; Bhardwaj, A.; Choudhary, B. C.; Garg, R. B.; Kumar, A.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, R.; Sharma, V.; Banerjee, S.; Bhattacharya, S.; Chatterjee, K.; Dey, S.; Dutta, S.; Jain, Sa.; Jain, Sh.; Khurana, R.; Majumdar, N.; Modak, A.; Mondal, K.; Mukherjee, S.; Mukhopadhyay, S.; Roy, A.; Roy, D.; Roy Chowdhury, S.; Sarkar, S.; Sharan, M.; Abdulsalam, A.; Chudasama, R.; Dutta, D.; Jha, V.; Kumar, V.; Mohanty, A. K.; Pant, L. M.; Shukla, P.; Topkar, A.; Aziz, T.; Banerjee, S.; Bhowmik, S.; Chatterjee, R. M.; Dewanjee, R. K.; Dugad, S.; Ganguly, S.; Ghosh, S.; Guchait, M.; Gurtu, A.; Kole, G.; Kumar, S.; Mahakud, B.; Maity, M.; Majumder, G.; Mazumdar, K.; Mitra, S.; Mohanty, G. B.; Parida, B.; Sarkar, T.; Sudhakar, K.; Sur, N.; Sutar, B.; Wickramage, N.; Sharma, S.; Bakhshiansohi, H.; Behnamian, H.; Etesami, S. M.; Fahim, A.; Goldouzian, R.; Khakzad, M.; Mohammadi Najafabadi, M.; Naseri, M.; Paktinat Mehdiabadi, S.; Rezaei Hosseinabadi, F.; Safarzadeh, B.; Zeinali, M.; Felcini, M.; Grunewald, M.; Abbrescia, M.; Calabria, C.; Caputo, C.; Chhibra, S. S.; Colaleo, A.; Creanza, D.; Cristella, L.; De Filippis, N.; De Palma, M.; Fiore, L.; Iaselli, G.; Maggi, G.; Maggi, M.; Miniello, G.; My, S.; Nuzzo, S.; Pompili, A.; Pugliese, G.; Radogna, R.; Ranieri, A.; Selvaggi, G.; Sharma, A.; Silvestris, L.; Venditti, R.; Verwilligen, P.; Abbiendi, G.; Battilana, C.; Benvenuti, A. C.; Bonacorsi, D.; Braibant-Giacomelli, S.; Brigliadori, L.; Campanini, R.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Codispoti, G.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Grandi, C.; Guiducci, L.; Marcellini, S.; Masetti, G.; Montanari, A.; Navarria, F. L.; Perrotta, A.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Travaglini, R.; Cappello, G.; Chiorboli, M.; Costa, S.; Giordano, F.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Ciulli, V.; Civinini, C.; D'Alessandro, R.; Focardi, E.; Gonzi, S.; Gori, V.; Lenzi, P.; Meschini, M.; Paoletti, S.; Puggelli, A.; Sguazzoni, G.; Tropiano, A.; Viliani, L.; Benussi, L.; Bianco, S.; Fabbri, F.; Piccolo, D.; Calvelli, V.; Ferro, F.; Lo Vetere, M.; Robutti, E.; Tosi, S.; Dinardo, M. E.; Fiorendi, S.; Gennai, S.; Gerosa, R.; Ghezzi, A.; Govoni, P.; Malvezzi, S.; Manzoni, R. A.; Marzocchi, B.; Menasce, D.; Moroni, L.; Paganoni, M.; Pedrini, D.; Ragazzi, S.; Redaelli, N.; Tabarelli de Fatis, T.; Buontempo, S.; Cavallo, N.; Di Guida, S.; Esposito, M.; Fabozzi, F.; Iorio, A. O. M.; Lanza, G.; Lista, L.; Meola, S.; Merola, M.; Paolucci, P.; Sciacca, C.; Thyssen, F.; Azzi, P.; Bacchetta, N.; Bisello, D.; Carlin, R.; Carvalho Antunes De Oliveira, A.; Checchia, P.; Dall'Osso, M.; Dorigo, T.; Dosselli, U.; Gasparini, F.; Gasparini, U.; Gonella, F.; Gozzelino, A.; Lacaprara, S.; Margoni, M.; Meneguzzo, A. T.; Michelotto, M.; Pazzini, J.; Pozzobon, N.; Ronchese, P.; Simonetto, F.; Torassa, E.; Tosi, M.; Zanetti, M.; Zotto, P.; Zucchetta, A.; Zumerle, G.; Braghieri, A.; Gabusi, M.; Magnani, A.; Ratti, S. P.; Re, V.; Riccardi, C.; Salvini, P.; Vai, I.; Vitulo, P.; Alunni Solestizi, L.; Biasini, M.; Bilei, G. M.; Ciangottini, D.; Fanò, L.; Lariccia, P.; Mantovani, G.; Menichelli, M.; Saha, A.; Santocchia, A.; Spiezia, A.; Androsov, K.; Azzurri, P.; Bagliesi, G.; Bernardini, J.; Boccali, T.; Broccolo, G.; Castaldi, R.; Ciocci, M. A.; Dell'Orso, R.; Donato, S.; Fedi, G.; Foà, L.; Giassi, A.; Grippo, M. T.; Ligabue, F.; Lomtadze, T.; Martini, L.; Messineo, A.; Palla, F.; Rizzi, A.; Savoy-Navarro, A.; Serban, A. T.; Spagnolo, P.; Squillacioti, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; D'imperio, G.; Del Re, D.; Diemoz, M.; Gelli, S.; Jorda, C.; Longo, E.; Margaroli, F.; Meridiani, P.; Micheli, F.; Organtini, G.; Paramatti, R.; Preiato, F.; Rahatlou, S.; Rovelli, C.; Santanastasio, F.; Soffi, L.; Traczyk, P.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Bellan, R.; Biino, C.; Cartiglia, N.; Casasso, S.; Costa, M.; Covarelli, R.; Degano, A.; Demaria, N.; Finco, L.; Kiani, B.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Musich, M.; Obertino, M. M.; Pacher, L.; Pastrone, N.; Pelliccioni, M.; Pinna Angioni, G. L.; Romero, A.; Ruspa, M.; Sacchi, R.; Solano, A.; Staiano, A.; Tamponi, U.; Belforte, S.; Candelise, V.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Gobbo, B.; La Licata, C.; Marone, M.; Schizzi, A.; Umer, T.; Zanetti, A.; Chang, S.; Kropivnitskaya, A.; Nam, S. K.; Kim, D. H.; Kim, G. N.; Kim, M. S.; Kong, D. J.; Lee, S.; Oh, Y. D.; Sakharov, A.; Son, D. C.; Kim, H.; Kim, T. J.; Ryu, M. S.; Song, S.; Choi, S.; Go, Y.; Gyun, D.; Hong, B.; Jo, M.; Kim, H.; Kim, Y.; Lee, B.; Lee, K.; Lee, K. S.; Lee, S.; Park, S. K.; Roh, Y.; Yoo, H. D.; Choi, M.; Kim, J. H.; Lee, J. S. H.; Park, I. C.; Ryu, G.; Choi, Y.; Choi, Y. K.; Goh, J.; Kim, D.; Kwon, E.; Lee, J.; Yu, I.; Juodagalvis, A.; Vaitkus, J.; Ibrahim, Z. A.; Komaragiri, J. R.; Md Ali, M. A. B.; Mohamad Idris, F.; Wan Abdullah, W. A. T.; Casimiro Linares, E.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-de La Cruz, I.; Hernandez-Almada, A.; Lopez-Fernandez, R.; Ramirez Sanchez, G.; Sanchez-Hernandez, A.; Carrillo Moreno, S.; Vazquez Valencia, F.; Carpinteyro, S.; Pedraza, I.; Salazar Ibarguen, H. A.; Morelos Pineda, A.; Krofcheck, D.; Butler, P. H.; Reucroft, S.; Ahmad, A.; Ahmad, M.; Hassan, Q.; Hoorani, H. R.; Khan, W. A.; Khurshid, T.; Shoaib, M.; Bialkowska, H.; Bluj, M.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Romanowska-Rybinska, K.; Szleper, M.; Zalewski, P.; Brona, G.; Bunkowski, K.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Olszewski, M.; Walczak, M.; Bargassa, P.; Beirão Da Cruz E Silva, C.; Di Francesco, A.; Faccioli, P.; Ferreira Parracho, P. G.; Gallinaro, M.; Lloret Iglesias, L.; Nguyen, F.; Rodrigues Antunes, J.; Seixas, J.; Toldaiev, O.; Vadruccio, D.; Varela, J.; Vischia, P.; Afanasiev, S.; Bunin, P.; Gavrilenko, M.; Golutvin, I.; Gorbunov, I.; Kamenev, A.; Karjavin, V.; Konoplyanikov, V.; Lanev, A.; Malakhov, A.; Matveev, V.; Moisenz, P.; Palichik, V.; Perelygin, V.; Shmatov, S.; Shulha, S.; Skatchkov, N.; Smirnov, V.; Toriashvili, T.; Zarubin, A.; Golovtsov, V.; Ivanov, Y.; Kim, V.; Kuznetsova, E.; Levchenko, P.; Murzin, V.; Oreshkin, V.; Smirnov, I.; Sulimov, V.; Uvarov, L.; Vavilov, S.; Vorobyev, A.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Karneyeu, A.; Kirsanov, M.; Krasnikov, N.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Gavrilov, V.; Lychkovskaya, N.; Popov, V.; Pozdnyakov, I.; Safronov, G.; Spiridonov, A.; Vlasov, E.; Zhokin, A.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Leonidov, A.; Mesyats, G.; Rusakov, S. V.; Vinogradov, A.; Baskakov, A.; Belyaev, A.; Boos, E.; Dubinin, M.; Dudko, L.; Ershov, A.; Gribushin, A.; Klyukhin, V.; Kodolova, O.; Lokhtin, I.; Myagkov, I.; Obraztsov, S.; Petrushanko, S.; Savrin, V.; Snigirev, A.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Kachanov, V.; Kalinin, A.; Konstantinov, D.; Krychkine, V.; Petrov, V.; Ryutin, R.; Sobol, A.; Tourtchanovitch, L.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Ekmedzic, M.; Milosevic, J.; Rekovic, V.; Alcaraz Maestre, J.; Calvo, E.; Cerrada, M.; Chamizo Llatas, M.; Colino, N.; De La Cruz, B.; Delgado Peris, A.; Domínguez Vázquez, D.; Escalante Del Valle, A.; Fernandez Bedoya, C.; Fernández Ramos, J. P.; Flix, J.; Fouz, M. C.; Garcia-Abia, P.; Gonzalez Lopez, O.; Goy Lopez, S.; Hernandez, J. M.; Josa, M. I.; Navarro De Martino, E.; Pérez-Calero Yzquierdo, A.; Puerta Pelayo, J.; Quintario Olmeda, A.; Redondo, I.; Romero, L.; Soares, M. S.; Albajar, C.; de Trocóniz, J. F.; Missiroli, M.; Moran, D.; Brun, H.; Cuevas, J.; Fernandez Menendez, J.; Folgueras, S.; Gonzalez Caballero, I.; Palencia Cortezon, E.; Vizan Garcia, J. M.; Brochero Cifuentes, J. A.; Cabrillo, I. J.; Calderon, A.; Castiñeiras De Saa, J. R.; Duarte Campderros, J.; Fernandez, M.; Gomez, G.; Graziano, A.; Lopez Virto, A.; Marco, J.; Marco, R.; Martinez Rivero, C.; Matorras, F.; Munoz Sanchez, F. J.; Piedra Gomez, J.; Rodrigo, T.; Rodríguez-Marrero, A. Y.; Ruiz-Jimeno, A.; Scodellaro, L.; Vila, I.; Vilar Cortabitarte, R.; Abbaneo, D.; Auffray, E.; Auzinger, G.; Bachtis, M.; Baillon, P.; Ball, A. H.; Barney, D.; Benaglia, A.; Bendavid, J.; Benhabib, L.; Benitez, J. F.; Berruti, G. M.; Bloch, P.; Bocci, A.; Bonato, A.; Botta, C.; Breuker, H.; Camporesi, T.; Cerminara, G.; Colafranceschi, S.; D'Alfonso, M.; d'Enterria, D.; Dabrowski, A.; Daponte, V.; David, A.; De Gruttola, M.; De Guio, F.; De Roeck, A.; De Visscher, S.; Di Marco, E.; Dobson, M.; Dordevic, M.; Dupont-Sagorin, N.; Elliott-Peisert, A.; Franzoni, G.; Funk, W.; Gigi, D.; Gill, K.; Giordano, D.; Girone, M.; Glege, F.; Guida, R.; Gundacker, S.; Guthoff, M.; Hammer, J.; Hansen, M.; Harris, P.; Hegeman, J.; Innocente, V.; Janot, P.; Kirschenmann, H.; Kortelainen, M. J.; Kousouris, K.; Krajczar, K.; Lecoq, P.; Lourenço, C.; Lucchini, M. T.; Magini, N.; Malgeri, L.; Mannelli, M.; Marrouche, J.; Martelli, A.; Masetti, L.; Meijers, F.; Mersi, S.; Meschi, E.; Moortgat, F.; Morovic, S.; Mulders, M.; Nemallapudi, M. V.; Neugebauer, H.; Orfanelli, S.; Orsini, L.; Pape, L.; Perez, E.; Petrilli, A.; Petrucciani, G.; Pfeiffer, A.; Piparo, D.; Racz, A.; Rolandi, G.; Rovere, M.; Ruan, M.; Sakulin, H.; Schäfer, C.; Schwick, C.; Sharma, A.; Silva, P.; Simon, M.; Sphicas, P.; Spiga, D.; Steggemann, J.; Stieger, B.; Stoye, M.; Takahashi, Y.; Treille, D.; Tsirou, A.; Veres, G. I.; Wardle, N.; Wöhri, H. K.; Zagozdzinska, A.; Zeuner, W. D.; Bertl, W.; Deiters, K.; Erdmann, W.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; Kotlinski, D.; Langenegger, U.; Rohe, T.; Bachmair, F.; Bäni, L.; Bianchini, L.; Buchmann, M. A.; Casal, B.; Dissertori, G.; Dittmar, M.; Donegà, M.; Dünser, M.; Eller, P.; Grab, C.; Heidegger, C.; Hits, D.; Hoss, J.; Kasieczka, G.; Lustermann, W.; Mangano, B.; Marini, A. C.; Marionneau, M.; Martinez Ruiz del Arbol, P.; Masciovecchio, M.; Meister, D.; Mohr, N.; Musella, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pata, J.; Pauss, F.; Perrozzi, L.; Peruzzi, M.; Quittnat, M.; Rossini, M.; Starodumov, A.; Takahashi, M.; Tavolaro, V. R.; Theofilatos, K.; Wallny, R.; Weber, H. A.; Aarrestad, T. K.; Amsler, C.; Canelli, M. F.; Chiochia, V.; De Cosa, A.; Galloni, C.; Hinzmann, A.; Hreus, T.; Kilminster, B.; Lange, C.; Ngadiuba, J.; Pinna, D.; Robmann, P.; Ronga, F. J.; Salerno, D.; Taroni, S.; Yang, Y.; Cardaci, M.; Chen, K. H.; Doan, T. H.; Ferro, C.; Konyushikhin, M.; Kuo, C. M.; Lin, W.; Lu, Y. J.; Volpe, R.; Yu, S. S.; Chang, P.; Chang, Y. H.; Chang, Y. W.; Chao, Y.; Chen, K. F.; Chen, P. H.; Dietz, C.; Fiori, F.; Grundler, U.; Hou, W.-S.; Hsiung, Y.; Liu, Y. F.; Lu, R.-S.; Miñano Moya, M.; Petrakou, E.; Tsai, J. f.; Tzeng, Y. M.; Wilken, R.; Asavapibhop, B.; Kovitanggoon, K.; Singh, G.; Srimanobhas, N.; Suwonjandee, N.; Adiguzel, A.; Bakirci, M. N.; Dozen, C.; Dumanoglu, I.; Eskut, E.; Girgis, S.; Gokbulut, G.; Guler, Y.; Gurpinar, E.; Hos, I.; Kangal, E. E.; Onengut, G.; Ozdemir, K.; Polatoz, A.; Sunar Cerci, D.; Vergili, M.; Zorbilmez, C.; Akin, I. V.; Bilin, B.; Bilmis, S.; Isildak, B.; Karapinar, G.; Surat, U. E.; Yalvac, M.; Zeyrek, M.; Albayrak, E. A.; Gülmez, E.; Kaya, M.; Kaya, O.; Yetkin, T.; Cankocak, K.; Günaydin, Y. O.; Vardarlı, F. I.; Grynyov, B.; Levchuk, L.; Sorokin, P.; Aggleton, R.; Ball, F.; Beck, L.; Brooke, J. J.; Clement, E.; Cussans, D.; Flacher, H.; Goldstein, J.; Grimes, M.; Heath, G. P.; Heath, H. F.; Jacob, J.; Kreczko, L.; Lucas, C.; Meng, Z.; Newbold, D. M.; Paramesvaran, S.; Poll, A.; Sakuma, T.; Seif El Nasr-storey, S.; Senkin, S.; Smith, D.; Smith, V. J.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Olaiya, E.; Petyt, D.; Shepherd-Themistocleous, C. H.; Thea, A.; Tomalin, I. R.; Williams, T.; Womersley, W. J.; Worm, S. D.; Baber, M.; Bainbridge, R.; Buchmuller, O.; Bundock, A.; Burton, D.; Citron, M.; Colling, D.; Corpe, L.; Cripps, N.; Dauncey, P.; Davies, G.; De Wit, A.; Della Negra, M.; Dunne, P.; Elwood, A.; Ferguson, W.; Fulcher, J.; Futyan, D.; Hall, G.; Iles, G.; Karapostoli, G.; Kenzie, M.; Lane, R.; Lucas, R.; Lyons, L.; Magnan, A.-M.; Malik, S.; Nash, J.; Nikitenko, A.; Pela, J.; Pesaresi, M.; Petridis, K.; Raymond, D. M.; Richards, A.; Rose, A.; Seez, C.; Sharp, P.; Tapper, A.; Uchida, K.; Vazquez Acosta, M.; Virdee, T.; Zenz, S. C.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Leggat, D.; Leslie, D.; Reid, I. D.; Symonds, P.; Teodorescu, L.; Turner, M.; Borzou, A.; Dittmann, J.; Hatakeyama, K.; Kasmi, A.; Liu, H.; Pastika, N.; Scarborough, T.; Charaf, O.; Cooper, S. I.; Henderson, C.; Rumerio, P.; Avetisyan, A.; Bose, T.; Fantasia, C.; Gastler, D.; Lawson, P.; Rankin, D.; Richardson, C.; Rohlf, J.; St. John, J.; Sulak, L.; Zou, D.; Alimena, J.; Berry, E.; Bhattacharya, S.; Cutts, D.; Demiragli, Z.; Dhingra, N.; Ferapontov, A.; Garabedian, A.; Heintz, U.; Laird, E.; Landsberg, G.; Mao, Z.; Narain, M.; Sagir, S.; Sinthuprasith, T.; Breedon, R.; Breto, G.; Calderon De La Barca Sanchez, M.; Chauhan, S.; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Erbacher, R.; Gardner, M.; Ko, W.; Lander, R.; Mulhearn, M.; Pellett, D.; Pilot, J.; Ricci-Tam, F.; Shalhout, S.; Smith, J.; Squires, M.; Stolp, D.; Tripathi, M.; Wilbur, S.; Yohay, R.; Cousins, R.; Everaerts, P.; Farrell, C.; Hauser, J.; Ignatenko, M.; Rakness, G.; Saltzberg, D.; Takasugi, E.; Valuev, V.; Weber, M.; Burt, K.; Clare, R.; Ellison, J.; Gary, J. W.; Hanson, G.; Heilman, J.; Ivova Rikova, M.; Jandir, P.; Kennedy, E.; Lacroix, F.; Long, O. R.; Luthra, A.; Malberti, M.; Olmedo Negrete, M.; Shrinivas, A.; Sumowidagdo, S.; Wei, H.; Wimpenny, S.; Branson, J. G.; Cerati, G. B.; Cittolin, S.; D'Agnolo, R. T.; Holzner, A.; Kelley, R.; Klein, D.; Kovalskyi, D.; Letts, J.; Macneill, I.; Olivito, D.; Padhi, S.; Pieri, M.; Sani, M.; Sharma, V.; Simon, S.; Tadel, M.; Tu, Y.; Vartak, A.; Wasserbaech, S.; Welke, C.; Würthwein, F.; Yagil, A.; Zevi Della Porta, G.; Barge, D.; Bradmiller-Feld, J.; Campagnari, C.; Dishaw, A.; Dutta, V.; Flowers, K.; Franco Sevilla, M.; Geffert, P.; George, C.; Golf, F.; Gouskos, L.; Gran, J.; Incandela, J.; Justus, C.; Mccoll, N.; Mullin, S. D.; Richman, J.; Stuart, D.; To, W.; West, C.; Yoo, J.; Anderson, D.; Apresyan, A.; Bornheim, A.; Bunn, J.; Chen, Y.; Duarte, J.; Mott, A.; Newman, H. B.; Pena, C.; Pierini, M.; Spiropulu, M.; Vlimant, J. R.; Xie, S.; Zhu, R. Y.; Azzolini, V.; Calamba, A.; Carlson, B.; Ferguson, T.; Iiyama, Y.; Paulini, M.; Russ, J.; Sun, M.; Vogel, H.; Vorobiev, I.; Cumalat, J. P.; Ford, W. T.; Gaz, A.; Jensen, F.; Johnson, A.; Krohn, M.; Mulholland, T.; Nauenberg, U.; Smith, J. G.; Stenson, K.; Wagner, S. R.; Alexander, J.; Chatterjee, A.; Chaves, J.; Chu, J.; Dittmer, S.; Eggert, N.; Mirman, N.; Nicolas Kaufman, G.; Patterson, J. R.; Rinkevicius, A.; Ryd, A.; Skinnari, L.; Sun, W.; Tan, S. M.; Teo, W. D.; Thom, J.; Thompson, J.; Tucker, J.; Weng, Y.; Wittich, P.; Abdullin, S.; Albrow, M.; Anderson, J.; Apollinari, G.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Bolla, G.; Burkett, K.; Butler, J. N.; Cheung, H. W. K.; Chlebana, F.; Cihangir, S.; Elvira, V. D.; Fisk, I.; Freeman, J.; Gottschalk, E.; Gray, L.; Green, D.; Grünendahl, S.; Gutsche, O.; Hanlon, J.; Hare, D.; Harris, R. M.; Hirschauer, J.; Hooberman, B.; Hu, Z.; Jindariani, S.; Johnson, M.; Joshi, U.; Jung, A. W.; Klima, B.; Kreis, B.; Kwan, S.; Lammel, S.; Linacre, J.; Lincoln, D.; Lipton, R.; Liu, T.; Lopes De Sá, R.; Lykken, J.; Maeshima, K.; Marraffino, J. M.; Martinez Outschoorn, V. I.; Maruyama, S.; Mason, D.; McBride, P.; Merkel, P.; Mishra, K.; Mrenna, S.; Nahn, S.; Newman-Holmes, C.; O'Dell, V.; Prokofyev, O.; Sexton-Kennedy, E.; Soha, A.; Spalding, W. J.; Spiegel, L.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vernieri, C.; Verzocchi, M.; Vidal, R.; Whitbeck, A.; Yang, F.; Yin, H.; Acosta, D.; Avery, P.; Bortignon, P.; Bourilkov, D.; Carnes, A.; Carver, M.; Curry, D.; Das, S.; Di Giovanni, G. P.; Field, R. D.; Fisher, M.; Furic, I. K.; Hugon, J.; Konigsberg, J.; Korytov, A.; Kypreos, T.; Low, J. F.; Ma, P.; Matchev, K.; Mei, H.; Milenovic, P.; Mitselmakher, G.; Muniz, L.; Rank, D.; Shchutska, L.; Snowball, M.; Sperka, D.; Wang, S. J.; Yelton, J.; Hewamanage, S.; Linn, S.; Markowitz, P.; Martinez, G.; Rodriguez, J. L.; Ackert, A.; Adams, J. R.; Adams, T.; Askew, A.; Bochenek, J.; Diamond, B.; Haas, J.; Hagopian, S.; Hagopian, V.; Johnson, K. F.; Khatiwada, A.; Prosper, H.; Veeraraghavan, V.; Weinberg, M.; Bhopatkar, V.; Hohlmann, M.; Kalakhety, H.; Mareskas-palcek, D.; Roy, T.; Yumiceva, F.; Adams, M. R.; Apanasevich, L.; Berry, D.; Betts, R. R.; Bucinskaite, I.; Cavanaugh, R.; Evdokimov, O.; Gauthier, L.; Gerber, C. E.; Hofman, D. J.; Kurt, P.; O'Brien, C.; Sandoval Gonzalez, I. D.; Silkworth, C.; Turner, P.; Varelas, N.; Wu, Z.; Zakaria, M.; Bilki, B.; Clarida, W.; Dilsiz, K.; Durgut, S.; Gandrajula, R. P.; Haytmyradov, M.; Khristenko, V.; Merlo, J.-P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Ogul, H.; Onel, Y.; Ozok, F.; Penzo, A.; Sen, S.; Snyder, C.; Tan, P.; Tiras, E.; Wetzel, J.; Yi, K.; Anderson, I.; Barnett, B. A.; Blumenfeld, B.; Bolognesi, S.; Fehling, D.; Feng, L.; Gritsan, A. V.; Maksimovic, P.; Martin, C.; Nash, K.; Osherson, M.; Swartz, M.; Xiao, M.; Xin, Y.; Baringer, P.; Bean, A.; Benelli, G.; Bruner, C.; Gray, J.; Kenny, R. P.; Majumder, D.; Malek, M.; Murray, M.; Noonan, D.; Sanders, S.; Stringer, R.; Wang, Q.; Wood, J. S.; Chakaberia, I.; Ivanov, A.; Kaadze, K.; Khalil, S.; Makouski, M.; Maravin, Y.; Saini, L. K.; Skhirtladze, N.; Svintradze, I.; Lange, D.; Rebassoo, F.; Wright, D.; Anelli, C.; Baden, A.; Baron, O.; Belloni, A.; Calvert, B.; Eno, S. C.; Ferraioli, C.; Gomez, J. A.; Hadley, N. J.; Jabeen, S.; Kellogg, R. G.; Kolberg, T.; Kunkle, J.; Lu, Y.; Mignerey, A. C.; Pedro, K.; Shin, Y. H.; Skuja, A.; Tonjes, M. B.; Tonwar, S. C.; Apyan, A.; Barbieri, R.; Baty, A.; Bierwagen, K.; Brandt, S.; Busza, W.; Cali, I. A.; Di Matteo, L.; Gomez Ceballos, G.; Goncharov, M.; Gulhan, D.; Klute, M.; Lai, Y. S.; Lee, Y.-J.; Levin, A.; Luckey, P. D.; Mcginn, C.; Niu, X.; Paus, C.; Ralph, D.; Roland, C.; Roland, G.; Stephans, G. S. F.; Sumorok, K.; Varma, M.; Velicanu, D.; Veverka, J.; Wang, J.; Wang, T. W.; Wyslouch, B.; Yang, M.; Zhukova, V.; Dahmes, B.; Finkel, A.; Gude, A.; Kao, S. C.; Klapoetke, K.; Kubota, Y.; Mans, J.; Nourbakhsh, S.; Rusack, R.; Tambe, N.; Turkewitz, J.; Acosta, J. G.; Oliveros, S.; Avdeeva, E.; Bloom, K.; Bose, S.; Claes, D. R.; Dominguez, A.; Fangmeier, C.; Gonzalez Suarez, R.; Kamalieddin, R.; Keller, J.; Knowlton, D.; Kravchenko, I.; Lazo-Flores, J.; Meier, F.; Monroy, J.; Ratnikov, F.; Siado, J. E.; Snow, G. R.; Alyari, M.; Dolen, J.; George, J.; Godshalk, A.; Iashvili, I.; Kaisen, J.; Kharchilava, A.; Kumar, A.; Rappoccio, S.; Alverson, G.; Barberis, E.; Baumgartel, D.; Chasco, M.; Hortiangtham, A.; Massironi, A.; Morse, D. M.; Nash, D.; Orimoto, T.; Teixeira De Lima, R.; Trocino, D.; Wang, R.-J.; Wood, D.; Zhang, J.; Hahn, K. A.; Kubik, A.; Mucia, N.; Odell, N.; Pollack, B.; Pozdnyakov, A.; Schmitt, M.; Stoynev, S.; Sung, K.; Trovato, M.; Velasco, M.; Won, S.; Brinkerhoff, A.; Dev, N.; Hildreth, M.; Jessop, C.; Karmgard, D. J.; Kellams, N.; Lannon, K.; Lynch, S.; Marinelli, N.; Meng, F.; Mueller, C.; Musienko, Y.; Pearson, T.; Planer, M.; Ruchti, R.; Smith, G.; Valls, N.; Wayne, M.; Wolf, M.; Woodard, A.; Antonelli, L.; Brinson, J.; Bylsma, B.; Durkin, L. S.; Flowers, S.; Hart, A.; Hill, C.; Hughes, R.; Kotov, K.; Ling, T. Y.; Liu, B.; Luo, W.; Puigh, D.; Rodenburg, M.; Winer, B. L.; Wulsin, H. W.; Driga, O.; Elmer, P.; Hardenbrook, J.; Hebda, P.; Koay, S. A.; Lujan, P.; Marlow, D.; Medvedeva, T.; Mooney, M.; Olsen, J.; Palmer, C.; Piroué, P.; Quan, X.; Saka, H.; Stickland, D.; Tully, C.; Werner, J. S.; Zuranski, A.; Barnes, V. E.; Benedetti, D.; Bortoletto, D.; Gutay, L.; Jha, M. K.; Jones, M.; Jung, K.; Kress, M.; Leonardo, N.; Miller, D. H.; Neumeister, N.; Primavera, F.; Radburn-Smith, B. C.; Shi, X.; Shipsey, I.; Silvers, D.; Sun, J.; Svyatkovskiy, A.; Wang, F.; Xie, W.; Xu, L.; Zablocki, J.; Parashar, N.; Stupak, J.; Adair, A.; Akgun, B.; Chen, Z.; Ecklund, K. M.; Geurts, F. J. M.; Guilbaud, M.; Li, W.; Michlin, B.; Northup, M.; Padley, B. P.; Redjimi, R.; Roberts, J.; Rorie, J.; Tu, Z.; Zabel, J.; Betchart, B.; Bodek, A.; de Barbaro, P.; Demina, R.; Eshaq, Y.; Ferbel, T.; Galanti, M.; Garcia-Bellido, A.; Goldenzweig, P.; Han, J.; Harel, A.; Hindrichs, O.; Khukhunaishvili, A.; Petrillo, G.; Verzetti, M.; Vishnevskiy, D.; Demortier, L.; Arora, S.; Barker, A.; Chou, J. P.; Contreras-Campana, C.; Contreras-Campana, E.; Duggan, D.; Ferencek, D.; Gershtein, Y.; Gray, R.; Halkiadakis, E.; Hidas, D.; Hughes, E.; Kaplan, S.; Kunnawalkam Elayavalli, R.; Lath, A.; Panwalkar, S.; Park, M.; Salur, S.; Schnetzer, S.; Sheffield, D.; Somalwar, S.; Stone, R.; Thomas, S.; Thomassen, P.; Walker, M.; Foerster, M.; Riley, G.; Rose, K.; Spanier, S.; York, A.; Bouhali, O.; Castaneda Hernandez, A.; Dalchenko, M.; De Mattia, M.; Delgado, A.; Dildick, S.; Eusebi, R.; Flanagan, W.; Gilmore, J.; Kamon, T.; Krutelyov, V.; Montalvo, R.; Mueller, R.; Osipenkov, I.; Pakhotin, Y.; Patel, R.; Perloff, A.; Roe, J.; Rose, A.; Safonov, A.; Suarez, I.; Tatarinov, A.; Ulmer, K. A.; Akchurin, N.; Cowden, C.; Damgov, J.; Dragoiu, C.; Dudero, P. R.; Faulkner, J.; Kunori, S.; Lamichhane, K.; Lee, S. W.; Libeiro, T.; Undleeb, S.; Volobouev, I.; Appelt, E.; Delannoy, A. G.; Greene, S.; Gurrola, A.; Janjam, R.; Johns, W.; Maguire, C.; Mao, Y.; Melo, A.; Sheldon, P.; Snook, B.; Tuo, S.; Velkovska, J.; Xu, Q.; Arenton, M. W.; Boutle, S.; Cox, B.; Francis, B.; Goodell, J.; Hirosky, R.; Ledovskoy, A.; Li, H.; Lin, C.; Neu, C.; Wolfe, E.; Wood, J.; Xia, F.; Clarke, C.; Harr, R.; Karchin, P. E.; Kottachchi Kankanamge Don, C.; Lamichhane, P.; Sturdy, J.; Belknap, D. A.; Carlsmith, D.; Cepeda, M.; Christian, A.; Dasu, S.; Dodd, L.; Duric, S.; Friis, E.; Gomber, B.; Hall-Wilton, R.; Herndon, M.; Hervé, A.; Klabbers, P.; Lanaro, A.; Levine, A.; Long, K.; Loveless, R.; Mohapatra, A.; Ojalvo, I.; Perry, T.; Pierro, G. A.; Polese, G.; Ross, I.; Ruggles, T.; Sarangi, T.; Savin, A.; Smith, N.; Smith, W. H.; Taylor, D.; Woods, N.

2015-10-01

A search for a heavy Higgs boson in the H → WW and H → ZZ decay channels is reported. The search is based upon proton-proton collision data samples corresponding to an integrated luminosity of up to 5.1 fb-1 at √{s}=7 TeV and up to 19.7fb-1 at √{s}=8 TeV, recorded by the CMS experiment at the CERN LHC. Several final states of the H → WW and H → ZZ decays are analyzed. The combined upper limit at the 95% confidence level on the product of the cross section and branching fraction exclude a Higgs boson with standard model-like couplings and decays in the range 145 < m H < 1000 GeV. We also interpret the results in the context of an electroweak singlet extension of the standard model. [Figure not available: see fulltext.

A bimodal search strategy for SETI

NASA Technical Reports Server (NTRS)

Gulkis, S.; Olsen, E. T.; Tarter, J.

1980-01-01

The search strategy and resultant observational plan which was developed to carry out a comprehensive Search for Extraterrestrial Intelligence (SETI) over that portion of the electromagnetic spectrum known as the terrestrial microwave window is described. The limiting sensitivity achieved was parameterized and calculated for Deep Space Network antennas as well as several radio astronomy observatories. A brief description of the instrumentation to be employed in the search and the classes of signals to be looked for is given. One observational goal is to survey the entire sky over a wide range of frequency to a relatively constant flux level. This survey ensures that all potential life sites are observed to some limiting equivalent isotropic radiated power depending upon their distance. A second goal is to survey a set of potential transmission sites selected a priori to be especially promising, achieving very high sensitivity over a smaller range of frequency.

SNP discovery in candidate adaptive genes using exon capture in a free-ranging alpine ungulate

Treesearch

Gretchen H. Roffler; Stephen J. Amish; Seth Smith; Ted Cosart; Marty Kardos; Michael K. Schwartz; Gordon Luikart

2016-01-01

Identification of genes underlying genomic signatures of natural selection is key to understanding adaptation to local conditions. We used targeted resequencing to identify SNP markers in 5321 candidate adaptive genes associated with known immunological, metabolic and growth functions in ovids and other ungulates. We selectively targeted 8161 exons in protein-coding...

Climate Change: Resilience and Adaptation in New England (RAINE)

EPA Pesticide Factsheets

This database catalogs vulnerability, resilience and adaptation reports, plans and webpages at the state, regional and community level. It provides links, maps and reports for basic and advanced searches. It includes a comment box for more information.

A chaos wolf optimization algorithm with self-adaptive variable step-size

NASA Astrophysics Data System (ADS)

Zhu, Yong; Jiang, Wanlu; Kong, Xiangdong; Quan, Lingxiao; Zhang, Yongshun

2017-10-01

To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA) with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as "winner-take-all" and the update mechanism as "survival of the fittest" were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

Use of medium-range weather forecasts for drought mitigation and adaptation under a Mediterranean area

NASA Astrophysics Data System (ADS)

Lahlou, Ouiam; Imani, Yasmina; Bennasser Alaoui, Si; Dutra, Emanuel; DiGiuseppe, Francesca; Pappenberger, Florian; Wetterhall, Fredrik

2014-05-01

Use of medium-range weather forecasts for drought mitigation and adaptation under a Mediterranean area Authors: Ouiam Lahlou1, Yasmina Imani1, Si Bennasser Alaoui1, Emmanuel Dutra 2, Francesca Di Guiseppe2, Florian Pappenberger2, Fredrik Wetterhall2 1: Institut Agronomique et Vétérinaire Hassan II (IAV Hassan II) 2: European Center for Medium-Range Weather Forecasts (ECMWF) The main pillar of economic development in Morocco is the agricultural sector employing 40% of the active workforce. Agriculture is still mainly dominated by rainfed agriculture which is vulnerable to an increasing frequency and severity of drought events. In rainfed agriculture, there are few interventions possible once crops are planted. Medium to long range weather forecasts could therefore provide valid information for crop selection and sowing time at the onset of the yield season and later to plan mitigation measures during dry-spell episodes. More than 600 daily forecasts from the European Centre for Medium-Range Weather Forecasts (ECMWF) ensemble forecasting system were analyzed in terms of probabilistic skills scores. Results show that, while daily and weekly accumulated precipitation are poorly predicted there is good skill in the forecast of occurrence and extent of dry periods. The availability of this information to decision makers in the agricultural sector would mean moving from a reactive drought management plan to a proactive one. This is very important, especially for the remote areas where often the needed help comes late. A simulation case-study involving farmers who were made aware of the availability of forecasts for the next seasons, show that medium-range forecasts will allow i) governments and relief agencies to position themselves for more effective and cost-efficient drought interventions, ii) producers to be more aware of their production options and insure their payment rate, iii) Herders, to cope with higher food costs for their cattle iv) farmers to better plan

Adaptive neuro-heuristic hybrid model for fruit peel defects detection.

PubMed

Woźniak, Marcin; Połap, Dawid

2018-02-01

Fusion of machine learning methods benefits in decision support systems. A composition of approaches gives a possibility to use the most efficient features composed into one solution. In this article we would like to present an approach to the development of adaptive method based on fusion of proposed novel neural architecture and heuristic search into one co-working solution. We propose a developed neural network architecture that adapts to processed input co-working with heuristic method used to precisely detect areas of interest. Input images are first decomposed into segments. This is to make processing easier, since in smaller images (decomposed segments) developed Adaptive Artificial Neural Network (AANN) processes less information what makes numerical calculations more precise. For each segment a descriptor vector is composed to be presented to the proposed AANN architecture. Evaluation is run adaptively, where the developed AANN adapts to inputs and their features by composed architecture. After evaluation, selected segments are forwarded to heuristic search, which detects areas of interest. As a result the system returns the image with pixels located over peel damages. Presented experimental research results on the developed solution are discussed and compared with other commonly used methods to validate the efficacy and the impact of the proposed fusion in the system structure and training process on classification results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Mating-related behaviour of grizzly bears inhabiting marginal habitat at the periphery of their North American range.

PubMed

Edwards, Mark A; Derocher, Andrew E

2015-02-01

In comparison to core populations, peripheral populations have low density and recruitment, and are subject to different selective pressures, such as environmental conditions, food type and availability, predation, disease, etc., which may result in behavioural modifications to mating. We test the roam-to-mate hypothesis for a peripheral population of grizzly bears (Ursus arctos) at the northern extent of their North American range, in Canada's Arctic. If bears are roaming-to-mate, we predicted greater range size and daily displacement, and more linear movements for receptive animals during the mating period compared to post-mating. In contrast to our predictions, we found that in general range size and displacement increased from mating to post-mating regardless of reproductive status. When considered across both periods, females with cubs-of-the-year had smaller range use metrics than other reproductive groups, which we attribute to a counter-strategy against sexually selected infanticide and the reduced mobility of cubs. Linearity of movements remained near zero during both periods across all groups, suggesting tortuous movements more characteristic of foraging than of mate-searching. We suggest that for this population, finding quality habitat takes precedence over mate-searching in this marginal Arctic landscape. Alternatively, a more monogamous mating system and sequestering behaviour may have obscured movement differences between the two periods. The behavioural differences in mating that we observed from what is typical of core populations may reflect local adaptation to marginal conditions and could benefit the species in the face of ongoing environmental change. Copyright © 2014 Elsevier B.V. All rights reserved.

Dark-matter QCD-axion searches

DOE PAGES

Rosenberg, Leslie J.

2015-01-12

In the late 20th century, cosmology became a precision science. At the beginning of the next century, the parameters describing how our universe evolved from the Big Bang are generally known to a few percent. One key parameter is the total mass density of the universe. Normal matter constitutes only a small fraction of the total mass density. Observations suggest this additional mass, the dark matter, is cold (that is, moving nonrelativistically in the early universe) and interacts feebly if at all with normal matter and radiation. There’s no known such elementary particle, so the strong presumption is the darkmore » matter consists of particle relics of a new kind left over from the Big Bang. One of the most important questions in science is the nature of this dark matter. One attractive particle dark-matter candidate is the axion. The axion is a hypothetical elementary particle arising in a simple and elegant extension to the standard model of particle physics that nulls otherwise observable CP-violating effects (where CP is the product of charge reversal C and parity inversion P) in quantum chromo dynamics (QCD). A light axion of mass 10 -(6–3) eV (the invisible axion) would couple extraordinarily weakly to normal matter and radiation and would therefore be extremely difficult to detect in the laboratory. But, such an axion is a compelling dark-matter candidate and is therefore a target of a number of searches. Compared with other particle dark-matter candidates, the plausible range of axion dark-matter couplings and masses is narrowly constrained. This focused search range allows for definitive searches, where a nonobservation would seriously impugn the dark-matter QCD-axion hypothesis. Axion searches use a wide range of technologies, and the experiment sensitivities are now reaching likely dark-matter axion couplings and masses. Our paper is a selective overview of the current generation of sensitive axion searches. Finally, not all techniques and

Dark-matter QCD-axion searches

PubMed Central

Rosenberg, Leslie J

2015-01-01

In the late 20th century, cosmology became a precision science. Now, at the beginning of the next century, the parameters describing how our universe evolved from the Big Bang are generally known to a few percent. One key parameter is the total mass density of the universe. Normal matter constitutes only a small fraction of the total mass density. Observations suggest this additional mass, the dark matter, is cold (that is, moving nonrelativistically in the early universe) and interacts feebly if at all with normal matter and radiation. There’s no known such elementary particle, so the strong presumption is the dark matter consists of particle relics of a new kind left over from the Big Bang. One of the most important questions in science is the nature of this dark matter. One attractive particle dark-matter candidate is the axion. The axion is a hypothetical elementary particle arising in a simple and elegant extension to the standard model of particle physics that nulls otherwise observable CP-violating effects (where CP is the product of charge reversal C and parity inversion P) in quantum chromo dynamics (QCD). A light axion of mass 10−(6–3) eV (the invisible axion) would couple extraordinarily weakly to normal matter and radiation and would therefore be extremely difficult to detect in the laboratory. However, such an axion is a compelling dark-matter candidate and is therefore a target of a number of searches. Compared with other particle dark-matter candidates, the plausible range of axion dark-matter couplings and masses is narrowly constrained. This focused search range allows for definitive searches, where a nonobservation would seriously impugn the dark-matter QCD-axion hypothesis. Axion searches use a wide range of technologies, and the experiment sensitivities are now reaching likely dark-matter axion couplings and masses. This article is a selective overview of the current generation of sensitive axion searches. Not all techniques and

How Choice Ecology Influences Search in Decisions from Experience

ERIC Educational Resources Information Center

Lejarraga, Tomas; Hertwig, Ralph; Gonzalez, Cleotilde

2012-01-01

Research into human decision-making has often sidestepped the question of search despite its importance across a wide range of domains such as search for food, mates, allies, visual targets or information. Recently, research on decisions from experience has made progress in finding out how individual characteristics shape search for information.…

A lunar base for SETI (Search for Extraterrestrial Intelligence)

NASA Technical Reports Server (NTRS)

Oliver, Bernard M.

1988-01-01

The possibilities of using lanar based radio antennas in search of intelligent extraterrestrial communications is explored. The proposed NASA search will have two search modes: (1) An all sky survey covering the frequency range from 1 to 10 GHz; and (2) A high sensitivity targeted search listening for signals from the approx. 800 solar type stars within 80 light years of the Sun, and covering 1 to 3 GHz.

Policy implications for familial searching

PubMed Central

2011-01-01

In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforcement agencies a powerful tool for developing investigative leads, apprehending criminals, revitalizing cold cases and exonerating wrongfully convicted individuals. As familial searching involves a range of logistical, social, ethical and legal considerations, states are now grappling with policy options for implementing familial searching to balance crime fighting with its potential impact on society. When developing policies for familial searching, legislators should take into account the impact of familial searching on select populations and the need to minimize personal intrusion on relatives of individuals in the DNA database. This review describes the approaches used to narrow a suspect pool from a partial match search of CODIS and summarizes the economic, ethical, logistical and political challenges of implementing familial searching. We examine particular US state policies and the policy options adopted to address these issues. The aim of this review is to provide objective background information on the controversial approach of familial searching to inform policy decisions in this area. Herein we highlight key policy options and recommendations regarding effective utilization of familial searching that minimize harm to and afford maximum protection of US citizens. PMID:22040348

Policy implications for familial searching.

PubMed

Kim, Joyce; Mammo, Danny; Siegel, Marni B; Katsanis, Sara H

2011-11-01

In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforcement agencies a powerful tool for developing investigative leads, apprehending criminals, revitalizing cold cases and exonerating wrongfully convicted individuals. As familial searching involves a range of logistical, social, ethical and legal considerations, states are now grappling with policy options for implementing familial searching to balance crime fighting with its potential impact on society. When developing policies for familial searching, legislators should take into account the impact of familial searching on select populations and the need to minimize personal intrusion on relatives of individuals in the DNA database. This review describes the approaches used to narrow a suspect pool from a partial match search of CODIS and summarizes the economic, ethical, logistical and political challenges of implementing familial searching. We examine particular US state policies and the policy options adopted to address these issues. The aim of this review is to provide objective background information on the controversial approach of familial searching to inform policy decisions in this area. Herein we highlight key policy options and recommendations regarding effective utilization of familial searching that minimize harm to and afford maximum protection of US citizens.

Intrinsic Lévy behaviour in organisms - searching for a mechanism. Comment on "Liberating Lévy walk research from the shackles of optimal foraging" by A.M. Reynolds

NASA Astrophysics Data System (ADS)

Sims, David W.

2015-09-01

The seminal papers by Viswanathan and colleagues in the late 1990s [1,2] proposed not only that scale-free, superdiffusive Lévy walks can describe the free-ranging movement patterns observed in animals such as the albatross [1], but that the Lévy walk was optimal for searching for sparsely and randomly distributed resource targets [2]. This distinct advantage, now shown to be present over a much broader set of conditions than originally theorised [3], implied that the Lévy walk is a search strategy that should be found very widely in organisms [4]. In the years since there have been several influential empirical studies showing that Lévy walks can indeed be detected in the movement patterns of a very broad range of taxa, from jellyfish, insects, fish, reptiles, seabirds, humans [5-10], and even in the fossilised trails of extinct invertebrates [11]. The broad optimality and apparent deep evolutionary origin of movement (search) patterns that are well approximated by Lévy walks led to the development of the Lévy flight foraging (LFF) hypothesis [12], which states that "since Lévy flights and walks can optimize search efficiencies, therefore natural selection should have led to adaptations for Lévy flight foraging".

apGA: An adaptive parallel genetic algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liepins, G.E.; Baluja, S.

1991-01-01

We develop apGA, a parallel variant of the standard generational GA, that combines aggressive search with perpetual novelty, yet is able to preserve enough genetic structure to optimally solve variably scaled, non-uniform block deceptive and hierarchical deceptive problems. apGA combines elitism, adaptive mutation, adaptive exponential scaling, and temporal memory. We present empirical results for six classes of problems, including the DeJong test suite. Although we have not investigated hybrids, we note that apGA could be incorporated into other recent GA variants such as GENITOR, CHC, and the recombination stage of mGA. 12 refs., 2 figs., 2 tabs.

Adaptation of evidence-based guideline recommendations to address urinary incontinence in nursing home residents according to the ADAPTE-process.

PubMed

Hoedl, Manuela; Schoberer, Daniela; Halfens, Ruud J G; Lohrmann, Christa

2018-04-27

To adapt international guideline recommendations for the conservative management of urinary incontinence (UI), defined as any involuntary loss of urine, in Austrian nursing home residents following the ADAPTE-process. Many international guidelines for managing UI are available. Nevertheless, the international recommendations have not yet been adapted to address the Austrian nursing home context. This crucial adaptation process will enhance the acceptance and applicability of the recommendations as well as encourage adherence among Austrian nurses and nursing home residents. This study is a methodological study based on the ADAPTE-process, including a systematic search, quality appraisal of the guidelines using the Appraisal of Clinical Guidelines for REsearch & Evaluation II (AGREE II) instrument as well as an external review by means of a Delphi technique. The guidelines had to be topic-relevant, published within the last 3 years and achieve a rigor of development score of 80% using the AGREE II instrument. We searched international guideline databases to identify adequate guidelines. Two raters assessed the quality of each guideline, ascertaining that it fulfilled the inclusion criteria using the AGREE II instrument. We translated the identified recommendations into German and externally reviewed for their applicability in the Austrian context. We identified 1,612 hits in 10 databases. After applying inclusion and exclusion criteria, we assessed five international clinical guidelines for quality using the AGREE II instrument. One clinical guideline fulfilled the inclusion criteria. This clinical guideline contains 116 recommendations, of which 29 were applicable in the Austrian nursing home setting. We identified only one suitable guideline, possibly due to the stringent nature of the inclusion criteria. However, following low-quality guidelines may result in the use of recommendations that are not based on evidence and, therefore, may lead to suboptimal nursing

Enabling Searches on Wavelengths in a Hyperspectral Indices Database

NASA Astrophysics Data System (ADS)

Piñuela, F.; Cerra, D.; Müller, R.

2017-10-01

Spectral indices derived from hyperspectral reflectance measurements are powerful tools to estimate physical parameters in a non-destructive and precise way for several fields of applications, among others vegetation health analysis, coastal and deep water constituents, geology, and atmosphere composition. In the last years, several micro-hyperspectral sensors have appeared, with both full-frame and push-broom acquisition technologies, while in the near future several hyperspectral spaceborne missions are planned to be launched. This is fostering the use of hyperspectral data in basic and applied research causing a large number of spectral indices to be defined and used in various applications. Ad hoc search engines are therefore needed to retrieve the most appropriate indices for a given application. In traditional systems, query input parameters are limited to alphanumeric strings, while characteristics such as spectral range/ bandwidth are not used in any existing search engine. Such information would be relevant, as it enables an inverse type of search: given the spectral capabilities of a given sensor or a specific spectral band, find all indices which can be derived from it. This paper describes a tool which enables a search as described above, by using the central wavelength or spectral range used by a given index as a search parameter. This offers the ability to manage numeric wavelength ranges in order to select indices which work at best in a given set of wavelengths or wavelength ranges.

Landscape genomics in Atlantic salmon (Salmo salar): searching for gene-environment interactions driving local adaptation.

PubMed

Vincent, Bourret; Dionne, Mélanie; Kent, Matthew P; Lien, Sigbjørn; Bernatchez, Louis

2013-12-01

A growing number of studies are examining the factors driving historical and contemporary evolution in wild populations. By combining surveys of genomic variation with a comprehensive assessment of environmental parameters, such studies can increase our understanding of the genomic and geographical extent of local adaptation in wild populations. We used a large-scale landscape genomics approach to examine adaptive and neutral differentiation across 54 North American populations of Atlantic salmon representing seven previously defined genetically distinct regional groups. Over 5500 genome-wide single nucleotide polymorphisms were genotyped in 641 individuals and 28 bulk assays of 25 pooled individuals each. Genome scans, linkage map, and 49 environmental variables were combined to conduct an innovative landscape genomic analysis. Our results provide valuable insight into the links between environmental variation and both neutral and potentially adaptive genetic divergence. In particular, we identified markers potentially under divergent selection, as well as associated selective environmental factors and biological functions with the observed adaptive divergence. Multivariate landscape genetic analysis revealed strong associations of both genetic and environmental structures. We found an enrichment of growth-related functions among outlier markers. Climate (temperature-precipitation) and geological characteristics were significantly associated with both potentially adaptive and neutral genetic divergence and should be considered as candidate loci involved in adaptation at the regional scale in Atlantic salmon. Hence, this study significantly contributes to the improvement of tools used in modern conservation and management schemes of Atlantic salmon wild populations. © 2013 The Author(s). Evolution © 2013 The Society for the Study of Evolution.

Density-dependent selection on mate search and evolution of Allee effects.

PubMed

Berec, Luděk; Kramer, Andrew M; Bernhauerová, Veronika; Drake, John M

2018-01-01

Sexually reproducing organisms require males and females to find each other. Increased difficulty of females finding mates as male density declines is the most frequently reported mechanism of Allee effects in animals. Evolving more effective mate search may alleviate Allee effects, but may depend on density regimes a population experiences. In particular, high-density populations may evolve mechanisms that induce Allee effects which become detrimental when populations are reduced and maintained at a low density. We develop an individual-based, eco-genetic model to study how mating systems and fitness trade-offs interact with changes in population density to drive evolution of the rate at which males or females search for mates. Finite mate search rate triggers Allee effects in our model and we explore how these Allee effects respond to such evolution. We allow a population to adapt to several population density regimes and examine whether high-density populations are likely to reverse adaptations attained at low densities. We find density-dependent selection in most of scenarios, leading to search rates that result in lower Allee thresholds in populations kept at lower densities. This mainly occurs when fecundity costs are imposed on mate search, and provides an explanation for why Allee effects are often observed in anthropogenically rare species. Optimizing selection, where the attained trait value minimizes the Allee threshold independent of population density, depended on the trade-off between search and survival, combined with monogamy when females were searching. Other scenarios led to runaway selection on the mate search rate, including evolutionary suicide. Trade-offs involved in mate search may thus be crucial to determining how density influences the evolution of Allee effects. Previous studies did not examine evolution of a trait related to the strength of Allee effects under density variation. We emphasize the crucial role that mating systems, fitness

Adaptive Optics Communications Performance Analysis

NASA Technical Reports Server (NTRS)

Srinivasan, M.; Vilnrotter, V.; Troy, M.; Wilson, K.

2004-01-01

The performance improvement obtained through the use of adaptive optics for deep-space communications in the presence of atmospheric turbulence is analyzed. Using simulated focal-plane signal-intensity distributions, uncoded pulse-position modulation (PPM) bit-error probabilities are calculated assuming the use of an adaptive focal-plane detector array as well as an adaptively sized single detector. It is demonstrated that current practical adaptive optics systems can yield performance gains over an uncompensated system ranging from approximately 1 dB to 6 dB depending upon the PPM order and background radiation level.

Searching for the right word: Hybrid visual and memory search for words.

PubMed

Boettcher, Sage E P; Wolfe, Jeremy M

2015-05-01

In "hybrid search" (Wolfe Psychological Science, 23(7), 698-703, 2012), observers search through visual space for any of multiple targets held in memory. With photorealistic objects as the stimuli, response times (RTs) increase linearly with the visual set size and logarithmically with the memory set size, even when over 100 items are committed to memory. It is well-established that pictures of objects are particularly easy to memorize (Brady, Konkle, Alvarez, & Oliva Proceedings of the National Academy of Sciences, 105, 14325-14329, 2008). Would hybrid-search performance be similar if the targets were words or phrases, in which word order can be important, so that the processes of memorization might be different? In Experiment 1, observers memorized 2, 4, 8, or 16 words in four different blocks. After passing a memory test, confirming their memorization of the list, the observers searched for these words in visual displays containing two to 16 words. Replicating Wolfe (Psychological Science, 23(7), 698-703, 2012), the RTs increased linearly with the visual set size and logarithmically with the length of the word list. The word lists of Experiment 1 were random. In Experiment 2, words were drawn from phrases that observers reported knowing by heart (e.g., "London Bridge is falling down"). Observers were asked to provide four phrases, ranging in length from two words to no less than 20 words (range 21-86). All words longer than two characters from the phrase, constituted the target list. Distractor words were matched for length and frequency. Even with these strongly ordered lists, the results again replicated the curvilinear function of memory set size seen in hybrid search. One might expect to find serial position effects, perhaps reducing the RTs for the first (primacy) and/or the last (recency) members of a list (Atkinson & Shiffrin, 1968; Murdock Journal of Experimental Psychology, 64, 482-488, 1962). Surprisingly, we showed no reliable effects of word order

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

NASA Astrophysics Data System (ADS)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Search for three-nucleon short-range correlations in light nuclei

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ye, Z.; Solvignon, P.; Nguyen, D.

Here, we present new data probing short-range correlations (SRCs) in nuclei through the measurement of electron scattering off high-momentum nucleons in nuclei. The inclusive 4He/ 3He cross section ratio is observed to be both x and Q 2 independent for 1.5 < x < 2, confirming the dominance of two- nucleon (2N) short-range correlations (SRCs). For x > 2, our data do not support a previous claim of three-nucleon (3N) correlation dominance. While contributions beyond those from stationary 2N- SRCs are observed, our data show that isolating 3N-SRCs is more complicated than for 2N-SRCs.

Search for three-nucleon short-range correlations in light nuclei

DOE PAGES

Ye, Z.; Solvignon, P.; Nguyen, D.; ...

2018-06-18

Here, we present new data probing short-range correlations (SRCs) in nuclei through the measurement of electron scattering off high-momentum nucleons in nuclei. The inclusive 4He/ 3He cross section ratio is observed to be both x and Q 2 independent for 1.5 < x < 2, confirming the dominance of two- nucleon (2N) short-range correlations (SRCs). For x > 2, our data do not support a previous claim of three-nucleon (3N) correlation dominance. While contributions beyond those from stationary 2N- SRCs are observed, our data show that isolating 3N-SRCs is more complicated than for 2N-SRCs.

Losing your edge: climate change and the conservation value of range-edge populations.

PubMed

Rehm, Evan M; Olivas, Paulo; Stroud, James; Feeley, Kenneth J

2015-10-01

Populations occurring at species' range edges can be locally adapted to unique environmental conditions. From a species' perspective, range-edge environments generally have higher severity and frequency of extreme climatic events relative to the range core. Under future climates, extreme climatic events are predicted to become increasingly important in defining species' distributions. Therefore, range-edge genotypes that are better adapted to extreme climates relative to core populations may be essential to species' persistence during periods of rapid climate change. We use relatively simple conceptual models to highlight the importance of locally adapted range-edge populations (leading and trailing edges) for determining the ability of species to persist under future climates. Using trees as an example, we show how locally adapted populations at species' range edges may expand under future climate change and become more common relative to range-core populations. We also highlight how large-scale habitat destruction occurring in some geographic areas where many species range edge converge, such as biome boundaries and ecotones (e.g., the arc of deforestation along the rainforest-cerrado ecotone in the southern Amazonia), can have major implications for global biodiversity. As climate changes, range-edge populations will play key roles in helping species to maintain or expand their geographic distributions. The loss of these locally adapted range-edge populations through anthropogenic disturbance is therefore hypothesized to reduce the ability of species to persist in the face of rapid future climate change.

Wide distribution range of rhizobial symbionts associated with pantropical sea-dispersed legumes.

PubMed

Bamba, Masaru; Nakata, Sayuri; Aoki, Seishiro; Takayama, Koji; Núñez-Farfán, Juan; Ito, Motomi; Miya, Masaki; Kajita, Tadashi

2016-12-01

To understand the geographic distributions of rhizobia that associated with widely distributed wild legumes, 66 nodules obtained from 41 individuals including three sea-dispersed legumes (Vigna marina, Vigna luteola, and Canavalia rosea) distributed across the tropical and subtropical coastal regions of the world were studied. Partial sequences of 16S rRNA and nodC genes extracted from the nodules showed that only Bradyrhizobium and Sinorhizobium were associated with the pantropical legumes, and some of the symbiont strains were widely distributed over the Pacific. Horizontal gene transfer of nodulation genes were observed within the Bradyrhizobium and Sinorhizobium lineages. BLAST searches in GenBank also identified records of these strains from various legumes across the world, including crop species. However, one of the rhizobial strains was not found in GenBank, which implies the strain may have adapted to the littoral environment. Our results suggested that some rhizobia, which associate with the widespread sea-dispersed legume, distribute across a broad geographic range. By establishing symbiotic relationships with widely distributed rhizobia, the pantropical legumes may also be able to extend their range much further than other legume species.

An improved harmony search algorithm with dynamically varying bandwidth

NASA Astrophysics Data System (ADS)

Kalivarapu, J.; Jain, S.; Bag, S.

2016-07-01

The present work demonstrates a new variant of the harmony search (HS) algorithm where bandwidth (BW) is one of the deciding factors for the time complexity and the performance of the algorithm. The BW needs to have both explorative and exploitative characteristics. The ideology is to use a large BW to search in the full domain and to adjust the BW dynamically closer to the optimal solution. After trying a series of approaches, a methodology inspired by the functioning of a low-pass filter showed satisfactory results. This approach was implemented in the self-adaptive improved harmony search (SIHS) algorithm and tested on several benchmark functions. Compared to the existing HS algorithm and its variants, SIHS showed better performance on most of the test functions. Thereafter, the algorithm was applied to geometric parameter optimization of a friction stir welding tool.

The Search for Life on Mars

NASA Technical Reports Server (NTRS)

Mumma, Michael J.

2012-01-01

For centuries, the planet Mars has been regarded as a possible abode for life. Serious searches for the signatures of life began in the 19th century, and continue via telescopic investigations and landed missions. While early work focused on phenomenology and bordered on fantasy, modern scientific inquiry has emphasized the search for chemical signatures of life in the soil and rocks at the planet's surface, and the search for biomarker gases in the atmosphere. Living systems produce more than 90% of Earth's atmospheric methane; the balance is of geochemical origin. The discovery of methane on Mars will be described, along with the ongoing extended search for clues to its origins. The possible origins of Mars methane will be discussed in the context of terrestrial analogue sites where geologic and biologic methane production now occurs - ranging from sub-permafrost zones in the arctic to hydrothermal vents in the deep ocean. Terrestrial organisms that could prosper on Mars today will be mentioned. I will briefly touch upon experiments conducted by landed spacecraft, ranging from the Viking Life Science Experiments in 1976 to the impending Mars Science laboratory, and the Trace Gas Orbiter and ExoMars missions now being developed for flight in the coming decade.

Navigating the job search superhighway.

PubMed

Linney, B J

2000-01-01

The recent Cyberforum on "Navigating the Job Search Superhighway" gave 131 American College of Physician Executive members the opportunity to discuss the job search process, addressing questions and sharing what they've learned through their experiences in the medical management job market. Several comments that convey the essence of the discussion are listed, representing the various viewpoints of the participants. The words are from physician executives who have gone through the job search process and from some who have been involved in hiring decisions. The topics range from the value of experience to the importance of having a management degree to tips on networking to preparing for the interview. The final section on contract negotiation is a composite of comments on the subject during the Cyberforum.

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

PubMed

Smith, J E

2012-01-01

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes

Visual-search models for location-known detection tasks

NASA Astrophysics Data System (ADS)

Gifford, H. C.; Karbaschi, Z.; Banerjee, K.; Das, M.

2017-03-01

Lesion-detection studies that analyze a fixed target position are generally considered predictive of studies involving lesion search, but the extent of the correlation often goes untested. The purpose of this work was to develop a visual-search (VS) model observer for location-known tasks that, coupled with previous work on localization tasks, would allow efficient same-observer assessments of how search and other task variations can alter study outcomes. The model observer featured adjustable parameters to control the search radius around the fixed lesion location and the minimum separation between suspicious locations. Comparisons were made against human observers, a channelized Hotelling observer and a nonprewhitening observer with eye filter in a two-alternative forced-choice study with simulated lumpy background images containing stationary anatomical and quantum noise. These images modeled single-pinhole nuclear medicine scans with different pinhole sizes. When the VS observer's search radius was optimized with training images, close agreement was obtained with human-observer results. Some performance differences between the humans could be explained by varying the model observer's separation parameter. The range of optimal pinhole sizes identified by the VS observer was in agreement with the range determined with the channelized Hotelling observer.

Modified Parameters of Harmony Search Algorithm for Better Searching

NASA Astrophysics Data System (ADS)

Farraliza Mansor, Nur; Abal Abas, Zuraida; Samad Shibghatullah, Abdul; Rahman, Ahmad Fadzli Nizam Abdul

2017-08-01

The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. In this research, the integrated scheduling and rostering bus driver problems are defined as maximising the balance of the assignment of tasks in term of distribution of shifts and routes. It is essential to achieve is fairer among driver because this can bring to increase in driver levels of satisfaction. The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration. These parameters influence the overall performance of the HS algorithm, and therefore it is crucial to fine-tune them. The contributions to this research are the HMCR parameter using step function while the fret spacing concept on guitars that is associated with mathematical formulae is also applied in the BW parameter. The model of constant step function is introduced in the alteration of HMCR parameter. The experimental results revealed that our proposed approach is superior than parameter adaptive harmony search algorithm. In conclusion, this proposed approach managed to generate a fairer roster and was thus capable of maximising the balancing distribution of shifts and routes among drivers, which contributed to the lowering of illness, incidents, absenteeism and accidents.

Next-Generation Search Engines for Information Retrieval

DOE Office of Scientific and Technical Information (OSTI.GOV)

Devarakonda, Ranjeet; Hook, Leslie A; Palanisamy, Giri

In the recent years, there have been significant advancements in the areas of scientific data management and retrieval techniques, particularly in terms of standards and protocols for archiving data and metadata. Scientific data is rich, and spread across different places. In order to integrate these pieces together, a data archive and associated metadata should be generated. Data should be stored in a format that can be retrievable and more importantly it should be in a format that will continue to be accessible as technology changes, such as XML. While general-purpose search engines (such as Google or Bing) are useful formore » finding many things on the Internet, they are often of limited usefulness for locating Earth Science data relevant (for example) to a specific spatiotemporal extent. By contrast, tools that search repositories of structured metadata can locate relevant datasets with fairly high precision, but the search is limited to that particular repository. Federated searches (such as Z39.50) have been used, but can be slow and the comprehensiveness can be limited by downtime in any search partner. An alternative approach to improve comprehensiveness is for a repository to harvest metadata from other repositories, possibly with limits based on subject matter or access permissions. Searches through harvested metadata can be extremely responsive, and the search tool can be customized with semantic augmentation appropriate to the community of practice being served. One such system, Mercury, a metadata harvesting, data discovery, and access system, built for researchers to search to, share and obtain spatiotemporal data used across a range of climate and ecological sciences. Mercury is open-source toolset, backend built on Java and search capability is supported by the some popular open source search libraries such as SOLR and LUCENE. Mercury harvests the structured metadata and key data from several data providing servers around the world and builds a

First Search for Gravitational Waves from the Youngest Known Neutron Star

NASA Astrophysics Data System (ADS)

Abadie, J.; Abbott, B. P.; Abbott, R.; Abernathy, M.; Adams, C.; Adhikari, R.; Ajith, P.; Allen, B.; Allen, G.; Amador Ceron, E.; Amin, R. S.; Anderson, S. B.; Anderson, W. G.; Arain, M. A.; Araya, M.; Aronsson, M.; Aso, Y.; Aston, S.; Atkinson, D. E.; Aufmuth, P.; Aulbert, C.; Babak, S.; Baker, P.; Ballmer, S.; Barker, D.; Barnum, S.; Barr, B.; Barriga, P.; Barsotti, L.; Barton, M. A.; Bartos, I.; Bassiri, R.; Bastarrika, M.; Bauchrowitz, J.; Behnke, B.; Benacquista, M.; Bertolini, A.; Betzwieser, J.; Beveridge, N.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Biswas, R.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bland, B.; Bock, O.; Bodiya, T. P.; Bondarescu, R.; Bork, R.; Born, M.; Bose, S.; Boyle, M.; Brady, P. R.; Braginsky, V. B.; Brau, J. E.; Breyer, J.; Bridges, D. O.; Brinkmann, M.; Britzger, M.; Brooks, A. F.; Brown, D. A.; Buonanno, A.; Burguet-Castell, J.; Burmeister, O.; Byer, R. L.; Cadonati, L.; Camp, J. B.; Campsie, P.; Cannizzo, J.; Cannon, K. C.; Cao, J.; Capano, C.; Caride, S.; Caudill, S.; Cavaglià, M.; Cepeda, C.; Chalermsongsak, T.; Chalkley, E.; Charlton, P.; Chelkowski, S.; Chen, Y.; Christensen, N.; Chua, S. S. Y.; Chung, C. T. Y.; Clark, D.; Clark, J.; Clayton, J. H.; Conte, R.; Cook, D.; Corbitt, T. R.; Cornish, N.; Costa, C. A.; Coward, D.; Coyne, D. C.; Creighton, J. D. E.; Creighton, T. D.; Cruise, A. M.; Culter, R. M.; Cumming, A.; Cunningham, L.; Dahl, K.; Danilishin, S. L.; Dannenberg, R.; Danzmann, K.; Das, K.; Daudert, B.; Davies, G.; Davis, A.; Daw, E. J.; Dayanga, T.; DeBra, D.; Degallaix, J.; Dergachev, V.; DeRosa, R.; DeSalvo, R.; Devanka, P.; Dhurandhar, S.; Di Palma, I.; Díaz, M.; Donovan, F.; Dooley, K. L.; Doomes, E. E.; Dorsher, S.; Douglas, E. S. D.; Drever, R. W. P.; Driggers, J. C.; Dueck, J.; Dumas, J.-C.; Eberle, T.; Edgar, M.; Edwards, M.; Effler, A.; Ehrens, P.; Engel, R.; Etzel, T.; Evans, M.; Evans, T.; Fairhurst, S.; Fan, Y.; Farr, B. F.; Fazi, D.; Fehrmann, H.; Feldbaum, D.; Finn, L. S.; Flanigan, M.; Flasch, K.; Foley, S.; Forrest, C.; Forsi, E.; Fotopoulos, N.; Frede, M.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Friedrich, D.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Garofoli, J. A.; Gholami, I.; Ghosh, S.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Gill, C.; Goetz, E.; Goggin, L. M.; González, G.; Gorodetsky, M. L.; Goßler, S.; Graef, C.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Grosso, R.; Grote, H.; Grunewald, S.; Gustafson, E. K.; Gustafson, R.; Hage, B.; Hall, P.; Hallam, J. M.; Hammer, D.; Hammond, G.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Haughian, K.; Hayama, K.; Heefner, J.; Heng, I. S.; Heptonstall, A.; Hewitson, M.; Hild, S.; Hirose, E.; Hoak, D.; Hodge, K. A.; Holt, K.; Hosken, D. J.; Hough, J.; Howell, E.; Hoyland, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Ju, L.; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kanner, J.; Katsavounidis, E.; Kawabe, K.; Kawamura, S.; Kawazoe, F.; Kells, W.; Keppel, D. G.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, H.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kondrashov, V.; Kopparapu, R.; Koranda, S.; Kozak, D.; Krause, T.; Kringel, V.; Krishnamurthy, S.; Krishnan, B.; Kuehn, G.; Kullman, J.; Kumar, R.; Kwee, P.; Landry, M.; Lang, M.; Lantz, B.; Lastzka, N.; Lazzarini, A.; Leaci, P.; Leong, J.; Leonor, I.; Li, J.; Lin, H.; Lindquist, P. E.; Lockerbie, N. A.; Lodhia, D.; Lormand, M.; Lu, P.; Luan, J.; Lubiński, M.; Lucianetti, A.; Lück, H.; Lundgren, A.; Machenschalk, B.; MacInnis, M.; Mageswaran, M.; Mailand, K.; Mak, C.; Mandel, I.; Mandic, V.; Márka, S.; Márka, Z.; Maros, E.; Martin, I. W.; Martin, R. M.; Marx, J. N.; Mason, K.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIvor, G.; McKechan, D. J. A.; Meadors, G.; Mehmet, M.; Meier, T.; Melatos, A.; Melissinos, A. C.; Mendell, G.; Menéndez, D. F.; Mercer, R. A.; Merill, L.; Meshkov, S.; Messenger, C.; Meyer, M. S.; Miao, H.; Miller, J.; Mino, Y.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Mohanty, S. D.; Mohapatra, S. R. P.; Moraru, D.; Moreno, G.; Morioka, T.; Mors, K.; Mossavi, K.; MowLowry, C.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Müller-Ebhardt, H.; Munch, J.; Murray, P. G.; Nash, T.; Nawrodt, R.; Nelson, J.; Newton, G.; Nishizawa, A.; Nolting, D.; Ochsner, E.; O'Dell, J.; Ogin, G. H.; Oldenburg, R. G.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Page, A.; Pan, Y.; Pankow, C.; Papa, M. A.; Pareja, M.; Patel, P.; Pedraza, M.; Pekowsky, L.; Penn, S.; Peralta, C.; Perreca, A.; Pickenpack, M.; Pinto, I. M.; Pitkin, M.; Pletsch, H. J.; Plissi, M. V.; Postiglione, F.; Predoi, V.; Price, L. R.; Prijatelj, M.; Principe, M.; Prix, R.; Prokhorov, L.; Puncken, O.; Quetschke, V.; Raab, F. J.; Radke, T.; Radkins, H.; Raffai, P.; Rakhmanov, M.; Rankins, B.; Raymond, V.; Reed, C. M.; Reed, T.; Reid, S.; Reitze, D. H.; Riesen, R.; Riles, K.; Roberts, P.; Robertson, N. A.; Robinson, C.; Robinson, E. L.; Roddy, S.; Röver, C.; Rollins, J.; Romano, J. D.; Romie, J. H.; Rowan, S.; Rüdiger, A.; Ryan, K.; Sakata, S.; Sakosky, M.; Salemi, F.; Sammut, L.; Sancho de la Jordana, L.; Sandberg, V.; Sannibale, V.; Santamaría, L.; Santostasi, G.; Saraf, S.; Sathyaprakash, B. S.; Sato, S.; Satterthwaite, M.; Saulson, P. R.; Savage, R.; Schilling, R.; Schnabel, R.; Schofield, R.; Schulz, B.; Schutz, B. F.; Schwinberg, P.; Scott, J.; Scott, S. M.; Searle, A. C.; Seifert, F.; Sellers, D.; Sengupta, A. S.; Sergeev, A.; Shaddock, D.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sibley, A.; Siemens, X.; Sigg, D.; Singer, A.; Sintes, A. M.; Skelton, G.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M. R.; Smith, N. D.; Somiya, K.; Sorazu, B.; Speirits, F. C.; Stein, A. J.; Stein, L. C.; Steinlechner, S.; Steplewski, S.; Stochino, A.; Stone, R.; Strain, K. A.; Strigin, S.; Stroeer, A.; Stuver, A. L.; Summerscales, T. Z.; Sung, M.; Susmithan, S.; Sutton, P. J.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, J. R.; Taylor, R.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Thüring, A.; Titsler, C.; Tokmakov, K. V.; Torres, C.; Torrie, C. I.; Traylor, G.; Trias, M.; Tseng, K.; Ugolini, D.; Urbanek, K.; Vahlbruch, H.; Vaishnav, B.; Vallisneri, M.; Van Den Broeck, C.; van der Sluys, M. V.; van Veggel, A. A.; Vass, S.; Vaulin, R.; Vecchio, A.; Veitch, J.; Veitch, P. J.; Veltkamp, C.; Villar, A.; Vorvick, C.; Vyachanin, S. P.; Waldman, S. J.; Wallace, L.; Wanner, A.; Ward, R. L.; Wei, P.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Wen, S.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; Whitcomb, S. E.; White, D. J.; Whiting, B. F.; Wilkinson, C.; Willems, P. A.; Williams, L.; Willke, B.; Winkelmann, L.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Woan, G.; Wooley, R.; Worden, J.; Yakushin, I.; Yamamoto, H.; Yamamoto, K.; Yeaton-Massey, D.; Yoshida, S.; Yu, P. P.; Zanolin, M.; Zhang, L.; Zhang, Z.; Zhao, C.; Zotov, N.; Zucker, M. E.; Zweizig, J.; LIGO Scientific Collaboration

2010-10-01

We present a search for periodic gravitational waves from the neutron star in the supernova remnant Cassiopeia A. The search coherently analyzes data in a 12 day interval taken from the fifth science run of the Laser Interferometer Gravitational-Wave Observatory. It searches gravitational-wave frequencies from 100 to 300 Hz and covers a wide range of first and second frequency derivatives appropriate for the age of the remnant and for different spin-down mechanisms. No gravitational-wave signal was detected. Within the range of search frequencies, we set 95% confidence upper limits of (0.7-1.2) × 10-24 on the intrinsic gravitational-wave strain, (0.4-4) × 10-4 on the equatorial ellipticity of the neutron star, and 0.005-0.14 on the amplitude of r-mode oscillations of the neutron star. These direct upper limits beat indirect limits derived from energy conservation and enter the range of theoretical predictions involving crystalline exotic matter or runaway r-modes. This paper is also the first gravitational-wave search to present upper limits on the r-mode amplitude.

Adaptation strategies and approaches: Chapter 2

Treesearch

Patricia Butler; Chris Swanston; Maria Janowiak; Linda Parker; Matt St. Pierre; Leslie Brandt

2012-01-01

A wealth of information is available on climate change adaptation, but much of it is very broad and of limited use at the finer spatial scales most relevant to land managers. This chapter contains a "menu" of adaptation actions and provides land managers in northern Wisconsin with a range of options to help forest ecosystems adapt to climate change impacts....

Patient-Centered Tools for Medication Information Search.

PubMed

Wilcox, Lauren; Feiner, Steven; Elhadad, Noémie; Vawdrey, David; Tran, Tran H

2014-05-20

Recent research focused on online health information seeking highlights a heavy reliance on general-purpose search engines. However, current general-purpose search interfaces do not necessarily provide adequate support for non-experts in identifying suitable sources of health information. Popular search engines have recently introduced search tools in their user interfaces for a range of topics. In this work, we explore how such tools can support non-expert, patient-centered health information search. Scoping the current work to medication-related search, we report on findings from a formative study focused on the design of patient-centered, medication-information search tools. Our study included qualitative interviews with patients, family members, and domain experts, as well as observations of their use of Remedy, a technology probe embodying a set of search tools. Post-operative cardiothoracic surgery patients and their visiting family members used the tools to find information about their hospital medications and were interviewed before and after their use. Domain experts conducted similar search tasks and provided qualitative feedback on their preferences and recommendations for designing these tools. Findings from our study suggest the importance of four valuation principles underlying our tools: credibility, readability, consumer perspective, and topical relevance.

Phase Adaptation and Correction by Adaptive Optics

NASA Astrophysics Data System (ADS)

Tiziani, Hans J.

2010-04-01

Adaptive optical elements and systems for imaging or laser beam propagation are used for some time in particular in astronomy, where the image quality is degraded by atmospheric turbulence. In astronomical telescopes a deformable mirror is frequently used to compensate wavefront-errors due to deformations of the large mirror, vibrations as well as turbulence and hence to increase the image quality. In the last few years interesting elements like Spatial Light Modulators, SLM's, such as photorefractive crystals, liquid crystals and micro mirrors and membrane mirrors were introduced. The development of liquid crystals and micro mirrors was driven by data projectors as consumer products. They contain typically a matrix of individually addressable pixels of liquid crystals and flip mirrors respectively or more recently piston mirrors for special applications. Pixel sizes are in the order of a few microns and therefore also appropriate as active diffractive elements in digital holography or miniature masks. Although liquid crystals are mainly optimized for intensity modulation; they can be used for phase modulation. Adaptive optics is a technology for beam shaping and wavefront adaptation. The application of spatial light modulators for wavefront adaptation and correction and defect analysis as well as sensing will be discussed. Dynamic digital holograms are generated with liquid crystal devices (LCD) and used for wavefront correction as well as for beam shaping and phase manipulation, for instance. Furthermore, adaptive optics is very useful to extend the measuring range of wavefront sensors and for the wavefront adaptation in order to measure and compare the shape of high precision aspherical surfaces.

A Search for Point Sources of EeV Neutrons

NASA Astrophysics Data System (ADS)

Pierre Auger Collaboration; Abreu, P.; Aglietta, M.; Ahlers, M.; Ahn, E. J.; Albuquerque, I. F. M.; Allard, D.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Alves Batista, R.; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Antiči'c, T.; Aramo, C.; Arganda, E.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Badescu, A. M.; Balzer, M.; Barber, K. B.; Barbosa, A. F.; Bardenet, R.; Barroso, S. L. C.; Baughman, B.; Bäuml, J.; Baus, C.; Beatty, J. J.; Becker, K. H.; Bellétoile, A.; Bellido, J. A.; BenZvi, S.; Berat, C.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blanco, F.; Blanco, M.; Bleve, C.; Blümer, H.; Boháčová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Brogueira, P.; Brown, W. C.; Bruijn, R.; Buchholz, P.; Bueno, A.; Buroker, L.; Burton, R. E.; Caballero-Mora, K. S.; Caccianiga, B.; Caramete, L.; Caruso, R.; Castellina, A.; Catalano, O.; Cataldi, G.; Cazon, L.; Cester, R.; Chauvin, J.; Cheng, S. H.; Chiavassa, A.; Chinellato, J. A.; Chirinos Diaz, J.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Cocciolo, G.; Collica, L.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cook, H.; Cooper, M. J.; Coppens, J.; Cordier, A.; Coutu, S.; Covault, C. E.; Creusot, A.; Criss, A.; Cronin, J.; Curutiu, A.; Dagoret-Campagne, S.; Dallier, R.; Daniel, B.; Dasso, S.; Daumiller, K.; Dawson, B. R.; de Almeida, R. M.; De Domenico, M.; De Donato, C.; de Jong, S. J.; De La Vega, G.; de Mello Junior, W. J. M.; de Mello Neto, J. R. T.; De Mitri, I.; de Souza, V.; de Vries, K. D.; del Peral, L.; del Río, M.; Deligny, O.; Dembinski, H.; Dhital, N.; Di Giulio, C.; Díaz Castro, M. L.; Diep, P. N.; Diogo, F.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dong, P. N.; Dorofeev, A.; dos Anjos, J. C.; Dova, M. T.; D'Urso, D.; Dutan, I.; Ebr, J.; Engel, R.; Erdmann, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Facal San Luis, P.; Falcke, H.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fick, B.; Figueira, J. M.; Filevich, A.; Filipčič, A.; Fliescher, S.; Fracchiolla, C. E.; Fraenkel, E. D.; Fratu, O.; Fröhlich, U.; Fuchs, B.; Gaior, R.; Gamarra, R. F.; Gambetta, S.; García, B.; Garcia Roca, S. T.; Garcia-Gamez, D.; Garcia-Pinto, D.; Gascon Bravo, A.; Gemmeke, H.; Ghia, P. L.; Giller, M.; Gitto, J.; Glass, H.; Gold, M. S.; Golup, G.; Gomez Albarracin, F.; Gómez Berisso, M.; Gómez Vitale, P. F.; Gonçalves, P.; Gonzalez, J. G.; Gookin, B.; Gorgi, A.; Gouffon, P.; Grashorn, E.; Grebe, S.; Griffith, N.; Grigat, M.; Grillo, A. F.; Guardincerri, Y.; Guarino, F.; Guedes, G. P.; Hansen, P.; Harari, D.; Harrison, T. A.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Herve, A. E.; Hojvat, C.; Hollon, N.; Holmes, V. C.; Homola, P.; Hörandel, J. R.; Horvath, P.; Hrabovský, M.; Huber, D.; Huege, T.; Insolia, A.; Ionita, F.; Italiano, A.; Jansen, S.; Jarne, C.; Jiraskova, S.; Josebachuili, M.; Kadija, K.; Kampert, K. H.; Karhan, P.; Kasper, P.; Katkov, I.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kelley, J. L.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Knapp, J.; Koang, D.-H.; Kotera, K.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuempel, D.; Kulbartz, J. K.; Kunka, N.; La Rosa, G.; Lachaud, C.; LaHurd, D.; Latronico, L.; Lauer, R.; Lautridou, P.; Le Coz, S.; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Lopez Agüera, A.; Louedec, K.; Lozano Bahilo, J.; Lu, L.; Lucero, A.; Ludwig, M.; Lyberis, H.; Maccarone, M. C.; Macolino, C.; Maldera, S.; Maller, J.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, J.; Marin, V.; Maris, I. C.; Marquez Falcon, H. R.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Martínez Bravo, O.; Martraire, D.; Masías Meza, J. J.; Mathes, H. J.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mazur, P. O.; Medina-Tanco, G.; Melissas, M.; Melo, D.; Menichetti, E.; Menshikov, A.; Mertsch, P.; Meurer, C.; Meyhandan, R.; Mi'canovi'c, S.; Micheletti, M. I.; Minaya, I. A.; Miramonti, L.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Monnier Ragaigne, D.; Montanet, F.; Morales, B.; Morello, C.; Moreno, E.; Moreno, J. C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navarro, J. L.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nhung, P. T.; Niechciol, M.; Niemietz, L.; Nierstenhoefer, N.; Nitz, D.; Nosek, D.; Nožka, L.; Oehlschläger, J.; Olinto, A.; Ortiz, M.; Pacheco, N.; Pakk Selmi-Dei, D.; Palatka, M.; Pallotta, J.; Palmieri, N.; Parente, G.; Parizot, E.; Parra, A.; Pastor, S.; Paul, T.; Pech, M.; Peķala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Pesce, R.; Petermann, E.; Petrera, S.; Petrolini, A.; Petrov, Y.; Pfendner, C.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Plum, M.; Ponce, V. H.; Pontz, M.; Porcelli, A.; Privitera, P.; Prouza, M.; Quel, E. J.; Querchfeld, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.; Revenu, B.; Ridky, J.; Riggi, S.; Risse, M.; Ristori, P.; Rivera, H.; Rizi, V.; Roberts, J.; Rodrigues de Carvalho, W.; Rodriguez, G.; Rodriguez Cabo, I.; Rodriguez Martino, J.; Rodriguez Rojo, J.; Rodríguez-Frías, M. D.; Ros, G.; Rosado, J.; Rossler, T.; Roth, M.; Rouillé-d'Orfeuil, B.; Roulet, E.; Rovero, A. C.; Rühle, C.; Saftoiu, A.; Salamida, F.; Salazar, H.; Salesa Greus, F.; Salina, G.; Sánchez, F.; Santo, C. E.; Santos, E.; Santos, E. M.; Sarazin, F.; Sarkar, B.; Sarkar, S.; Sato, R.; Scharf, N.; Scherini, V.; Schieler, H.; Schiffer, P.; Schmidt, A.; Scholten, O.; Schoorlemmer, H.; Schovancova, J.; Schovánek, P.; Schröder, F.; Schulte, S.; Schuster, D.; Sciutto, S. J.; Scuderi, M.; Segreto, A.; Settimo, M.; Shadkam, A.; Shellard, R. C.; Sidelnik, I.; Sigl, G.; Silva Lopez, H. H.; Sima, O.; 'Smiałkowski, A.; Šmída, R.; Snow, G. R.; Sommers, P.; Sorokin, J.; Spinka, H.; Squartini, R.; Srivastava, Y. N.; Stanic, S.; Stapleton, J.; Stasielak, J.; Stephan, M.; Stutz, A.; Suarez, F.; Suomijärvi, T.; Supanitsky, A. D.; Šuša, T.; Sutherland, M. S.; Swain, J.; Szadkowski, Z.; Szuba, M.; Tapia, A.; Tartare, M.; Taşcău, O.; Tcaciuc, R.; Thao, N. T.; Thomas, D.; Tiffenberg, J.; Timmermans, C.; Tkaczyk, W.; Todero Peixoto, C. J.; Toma, G.; Tomankova, L.; Tomé, B.; Tonachini, A.; Travnicek, P.; Tridapalli, D. B.; Tristram, G.; Trovato, E.; Tueros, M.; Ulrich, R.; Unger, M.; Urban, M.; Valdés Galicia, J. F.; Valiño, I.; Valore, L.; van Aar, G.; van den Berg, A. M.; van Vliet, A.; Varela, E.; Vargas Cárdenas, B.; Vázquez, J. R.; Vázquez, R. A.; Veberič, D.; Verzi, V.; Vicha, J.; Videla, M.; Villaseñor, L.; Wahlberg, H.; Wahrlich, P.; Wainberg, O.; Walz, D.; Watson, A. A.; Weber, M.; Weidenhaupt, K.; Weindl, A.; Werner, F.; Westerhoff, S.; Whelan, B. J.; Widom, A.; Wieczorek, G.; Wiencke, L.; Wilczyńska, B.; Wilczyński, H.; Will, M.; Williams, C.; Winchen, T.; Wommer, M.; Wundheiler, B.; Yamamoto, T.; Yapici, T.; Younk, P.; Yuan, G.; Yushkov, A.; Zamorano Garcia, B.; Zas, E.; Zavrtanik, D.; Zavrtanik, M.; Zaw, I.; Zepeda, A.; Zhou, J.; Zhu, Y.; Zimbres Silva, M.; Ziolkowski, M.

2012-12-01

A thorough search of the sky exposed at the Pierre Auger Cosmic Ray Observatory reveals no statistically significant excess of events in any small solid angle that would be indicative of a flux of neutral particles from a discrete source. The search covers from -90° to +15° in declination using four different energy ranges above 1 EeV (1018 eV). The method used in this search is more sensitive to neutrons than to photons. The upper limit on a neutron flux is derived for a dense grid of directions for each of the four energy ranges. These results constrain scenarios for the production of ultrahigh energy cosmic rays in the Galaxy.

Adaptive feature selection using v-shaped binary particle swarm optimization.

PubMed

Teng, Xuyang; Dong, Hongbin; Zhou, Xiurong

2017-01-01

Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.

Adaptive feature selection using v-shaped binary particle swarm optimization

PubMed Central

Dong, Hongbin; Zhou, Xiurong

2017-01-01

Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers. PMID:28358850

Searching for the right word: Hybrid visual and memory search for words

PubMed Central

Boettcher, Sage E. P.; Wolfe, Jeremy M.

2016-01-01

In “Hybrid Search” (Wolfe 2012) observers search through visual space for any of multiple targets held in memory. With photorealistic objects as stimuli, response times (RTs) increase linearly with the visual set size and logarithmically with memory set size even when over 100 items are committed to memory. It is well established that pictures of objects are particularly easy to memorize (Brady, Konkle, Alvarez, & Olivia, 2008). Would hybrid search performance be similar if the targets were words or phrases where word order can be important and where the processes of memorization might be different? In Experiment One, observers memorized 2, 4, 8, or 16 words in 4 different blocks. After passing a memory test, confirming memorization of the list, observers searched for these words in visual displays containing 2 to 16 words. Replicating Wolfe (2012), RTs increased linearly with the visual set size and logarithmically with the length of the word list. The word lists of Experiment One were random. In Experiment Two, words were drawn from phrases that observers reported knowing by heart (E.G. “London Bridge is falling down”). Observers were asked to provide four phrases ranging in length from 2 words to a phrase of no less than 20 words (range 21–86). Words longer than 2 characters from the phrase constituted the target list. Distractor words were matched for length and frequency. Even with these strongly ordered lists, results again replicated the curvilinear function of memory set size seen in hybrid search. One might expect serial position effects; perhaps reducing RTs for the first (primacy) and/or last (recency) members of a list (Atkinson & Shiffrin 1968; Murdock, 1962). Surprisingly we showed no reliable effects of word order. Thus, in “London Bridge is falling down”, “London” and “down” are found no faster than “falling”. PMID:25788035

Adaptive Behavior for Mobile Robots

NASA Technical Reports Server (NTRS)

Huntsberger, Terrance

2009-01-01

The term "System for Mobility and Access to Rough Terrain" (SMART) denotes a theoretical framework, a control architecture, and an algorithm that implements the framework and architecture, for enabling a land-mobile robot to adapt to changing conditions. SMART is intended to enable the robot to recognize adverse terrain conditions beyond its optimal operational envelope, and, in response, to intelligently reconfigure itself (e.g., adjust suspension heights or baseline distances between suspension points) or adapt its driving techniques (e.g., engage in a crabbing motion as a switchback technique for ascending steep terrain). Conceived for original application aboard Mars rovers and similar autonomous or semi-autonomous mobile robots used in exploration of remote planets, SMART could also be applied to autonomous terrestrial vehicles to be used for search, rescue, and/or exploration on rough terrain.

Adaptive Perception for Autonomous Vehicles

DTIC Science & Technology

1994-05-02

AD-A282 780 Adaptive Perception for Autonomous Vehicles Alonzo Kelly CMU-RI-TR-94-1 8 D IC SELECTF - pUG01 �j ~G U The Robotics Inttt ’I 94-2i...way of doing range image perception. Adaptive Perception for Autonomous Vehicles page 1. LZ Commentary The throughput problem of autonomous navigaticn...idea will be applied to the problem of terrain mapping in outdoor rough terrain. Adaptive Perception for Autonomous Vehicles page 2. 2. Analytical

The adaptive vehicle

DOT National Transportation Integrated Search

1986-10-08

The purpose of this study was to develop a concept for a vehicle which adapts its : performance to the preferences and capabilities of different drivers under a wide range of : driving and environmental conditions.

The effects of phenotypic plasticity and local adaptation on forecasts of species range shifts under climate change.

PubMed

Valladares, Fernando; Matesanz, Silvia; Guilhaumon, François; Araújo, Miguel B; Balaguer, Luis; Benito-Garzón, Marta; Cornwell, Will; Gianoli, Ernesto; van Kleunen, Mark; Naya, Daniel E; Nicotra, Adrienne B; Poorter, Hendrik; Zavala, Miguel A

2014-11-01

Species are the unit of analysis in many global change and conservation biology studies; however, species are not uniform entities but are composed of different, sometimes locally adapted, populations differing in plasticity. We examined how intraspecific variation in thermal niches and phenotypic plasticity will affect species distributions in a warming climate. We first developed a conceptual model linking plasticity and niche breadth, providing five alternative intraspecific scenarios that are consistent with existing literature. Secondly, we used ecological niche-modeling techniques to quantify the impact of each intraspecific scenario on the distribution of a virtual species across a geographically realistic setting. Finally, we performed an analogous modeling exercise using real data on the climatic niches of different tree provenances. We show that when population differentiation is accounted for and dispersal is restricted, forecasts of species range shifts under climate change are even more pessimistic than those using the conventional assumption of homogeneously high plasticity across a species' range. Suitable population-level data are not available for most species so identifying general patterns of population differentiation could fill this gap. However, the literature review revealed contrasting patterns among species, urging greater levels of integration among empirical, modeling and theoretical research on intraspecific phenotypic variation. © 2014 The Authors. Ecology Letters published by John Wiley & Sons Ltd and CNRS.

Simulation for noise cancellation using LMS adaptive filter

NASA Astrophysics Data System (ADS)

Lee, Jia-Haw; Ooi, Lu-Ean; Ko, Ying-Hao; Teoh, Choe-Yung

2017-06-01

In this paper, the fundamental algorithm of noise cancellation, Least Mean Square (LMS) algorithm is studied and enhanced with adaptive filter. The simulation of the noise cancellation using LMS adaptive filter algorithm is developed. The noise corrupted speech signal and the engine noise signal are used as inputs for LMS adaptive filter algorithm. The filtered signal is compared to the original noise-free speech signal in order to highlight the level of attenuation of the noise signal. The result shows that the noise signal is successfully canceled by the developed adaptive filter. The difference of the noise-free speech signal and filtered signal are calculated and the outcome implies that the filtered signal is approaching the noise-free speech signal upon the adaptive filtering. The frequency range of the successfully canceled noise by the LMS adaptive filter algorithm is determined by performing Fast Fourier Transform (FFT) on the signals. The LMS adaptive filter algorithm shows significant noise cancellation at lower frequency range.

Reactive Searching and Infotaxis in Odor Source Localization

PubMed Central

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-01-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching. PMID:25330317

Reactive searching and infotaxis in odor source localization.

PubMed

Voges, Nicole; Chaffiol, Antoine; Lucas, Philippe; Martinez, Dominique

2014-10-01

Male moths aiming to locate pheromone-releasing females rely on stimulus-adapted search maneuvers complicated by a discontinuous distribution of pheromone patches. They alternate sequences of upwind surge when perceiving the pheromone and cross- or downwind casting when the odor is lost. We compare four search strategies: three reactive versus one cognitive. The former consist of pre-programmed movement sequences triggered by pheromone detections while the latter uses Bayesian inference to build spatial probability maps. Based on the analysis of triphasic responses of antennal lobe neurons (On, inhibition, Off), we propose three reactive strategies. One combines upwind surge (representing the On response to a pheromone detection) and spiral casting, only. The other two additionally include crosswind (zigzag) casting representing the Off phase. As cognitive strategy we use the infotaxis algorithm which was developed for searching in a turbulent medium. Detection events in the electroantennogram of a moth attached to a robot indirectly control this cyborg, depending on the strategy in use. The recorded trajectories are analyzed with regard to success rates, efficiency, and other features. In addition, we qualitatively compare our robotic trajectories to behavioral search paths. Reactive searching is more efficient (yielding shorter trajectories) for higher pheromone doses whereas cognitive searching works better for lower doses. With respect to our experimental conditions (2 m from starting position to pheromone source), reactive searching with crosswind zigzag yields the shortest trajectories (for comparable success rates). Assuming that the neuronal Off response represents a short-term memory, zigzagging is an efficient movement to relocate a recently lost pheromone plume. Accordingly, such reactive strategies offer an interesting alternative to complex cognitive searching.

Career Adapt-Abilities Scale--Netherlands Form: Psychometric Properties and Relationships to Ability, Personality, and Regulatory Focus

ERIC Educational Resources Information Center

van Vianen, Annelies E. M.; Klehe, Ute-Christine; Koen, Jessie; Dries, Nicky

2012-01-01

The Career Adapt-Abilities Scale (CAAS)--Netherlands Form consists of four scales, each with six items, which measure concern, control, curiosity, and confidence as psychosocial resources for managing occupational transitions, developmental tasks, and work traumas. Internal consistency estimates for the subscale and total scores ranged from…

Enhanced adaptive signal control using dedicated short-range communications.

DOT National Transportation Integrated Search

2014-05-01

Connected vehicle technology with dedicated short-range communications can provide traffic : information in a spatial domain that conventional fixed-point detectors cannot provide. However, because : of low market penetration with this new data sourc...

Supporting inter-topic entity search for biomedical Linked Data based on heterogeneous relationships.

PubMed

Zong, Nansu; Lee, Sungin; Ahn, Jinhyun; Kim, Hong-Gee

2017-08-01

The keyword-based entity search restricts search space based on the preference of search. When given keywords and preferences are not related to the same biomedical topic, existing biomedical Linked Data search engines fail to deliver satisfactory results. This research aims to tackle this issue by supporting an inter-topic search-improving search with inputs, keywords and preferences, under different topics. This study developed an effective algorithm in which the relations between biomedical entities were used in tandem with a keyword-based entity search, Siren. The algorithm, PERank, which is an adaptation of Personalized PageRank (PPR), uses a pair of input: (1) search preferences, and (2) entities from a keyword-based entity search with a keyword query, to formalize the search results on-the-fly based on the index of the precomputed Individual Personalized PageRank Vectors (IPPVs). Our experiments were performed over ten linked life datasets for two query sets, one with keyword-preference topic correspondence (intra-topic search), and the other without (inter-topic search). The experiments showed that the proposed method achieved better search results, for example a 14% increase in precision for the inter-topic search than the baseline keyword-based search engine. The proposed method improved the keyword-based biomedical entity search by supporting the inter-topic search without affecting the intra-topic search based on the relations between different entities. Copyright © 2017 Elsevier Ltd. All rights reserved.

Adaptive Correlation Space Adjusted Open-Loop Tracking Approach for Vehicle Positioning with Global Navigation Satellite System in Urban Areas

PubMed Central

Ruan, Hang; Li, Jian; Zhang, Lei; Long, Teng

2015-01-01

For vehicle positioning with Global Navigation Satellite System (GNSS) in urban areas, open-loop tracking shows better performance because of its high sensitivity and superior robustness against multipath. However, no previous study has focused on the effects of the code search grid size on the code phase measurement accuracy of open-loop tracking. Traditional open-loop tracking methods are performed by the batch correlators with fixed correlation space. The code search grid size, which is the correlation space, is a constant empirical value and the code phase measuring accuracy will be largely degraded due to the improper grid size, especially when the signal carrier-to-noise density ratio (C/N0) varies. In this study, the Adaptive Correlation Space Adjusted Open-Loop Tracking Approach (ACSA-OLTA) is proposed to improve the code phase measurement dependent pseudo range accuracy. In ACSA-OLTA, the correlation space is adjusted according to the signal C/N0. The novel Equivalent Weighted Pseudo Range Error (EWPRE) is raised to obtain the optimal code search grid sizes for different C/N0. The code phase measuring errors of different measurement calculation methods are analyzed for the first time. The measurement calculation strategy of ACSA-OLTA is derived from the analysis to further improve the accuracy but reduce the correlator consumption. Performance simulation and real tests confirm that the pseudo range and positioning accuracy of ASCA-OLTA are better than the traditional open-loop tracking methods in the usual scenarios of urban area. PMID:26343683

Multicriteria adaptation principle on example of groups of mobile robots

NASA Astrophysics Data System (ADS)

Nelyubin, A. P.; Misyurin, S. Yu

2017-12-01

The article presents a multicriteria approach to the adaptation of groups of search, explore or research robots to unknown and volatile environment conditions. The basis of this approach is the application of multicriteria analysis both at the design stage of a group of mobile robots and at the stage of its adaptation in real-time conditions. It is proposed to maintain a variety of robots by properties and by optimality criteria in order to take into account the preferred mode of operation.

Adaptive evolution of Mediterranean pines.

PubMed

Grivet, Delphine; Climent, José; Zabal-Aguirre, Mario; Neale, David B; Vendramin, Giovanni G; González-Martínez, Santiago C

2013-09-01

Mediterranean pines represent an extremely heterogeneous assembly. Although they have evolved under similar environmental conditions, they diversified long ago, ca. 10 Mya, and present distinct biogeographic and demographic histories. Therefore, it is of special interest to understand whether and to what extent they have developed specific strategies of adaptive evolution through time and space. To explore evolutionary patterns, the Mediterranean pines' phylogeny was first reconstructed analyzing a new set of 21 low-copy nuclear genes with multilocus Bayesian tree reconstruction methods. Secondly, a phylogenetic approach was used to search for footprints of natural selection and to examine the evolution of multiple phenotypic traits. We identified two genes (involved in pines' defense and stress responses) that have likely played a role in the adaptation of Mediterranean pines to their environment. Moreover, few life-history traits showed historical or evolutionary adaptive convergence in Mediterranean lineages, while patterns of character evolution revealed various evolutionary trade-offs linking growth-development, reproduction and fire-related traits. Assessing the evolutionary path of important life-history traits, as well as the genomic basis of adaptive variation is central to understanding the past evolutionary success of Mediterranean pines and their future response to environmental changes. Copyright © 2013 Elsevier Inc. All rights reserved.

Physiologic adaptation to space - Space adaptation syndrome

NASA Technical Reports Server (NTRS)

Vanderploeg, J. M.

1985-01-01

The adaptive changes of the neurovestibular system to microgravity, which result in space motion sickness (SMS), are studied. A list of symptoms, which range from vomiting to drowsiness, is provided. The two patterns of symptom development, rapid and gradual, and the duration of the symptoms are described. The concept of sensory conflict and rearrangements to explain SMS is being investigated.

Tuning into Scorpius X-1: adapting a continuous gravitational-wave search for a known binary system

NASA Astrophysics Data System (ADS)

Meadors, Grant David; Goetz, Evan; Riles, Keith

2016-05-01

We describe how the TwoSpect data analysis method for continuous gravitational waves (GWs) has been tuned for directed sources such as the low-mass X-ray binary (LMXB), Scorpius X-1 (Sco X-1). A comparison of five search algorithms generated simulations of the orbital and GW parameters of Sco X-1. Whereas that comparison focused on relative performance, here the simulations help quantify the sensitivity enhancement and parameter estimation abilities of this directed method, derived from an all-sky search for unknown sources, using doubly Fourier-transformed data. Sensitivity is shown to be enhanced when the source sky location and period are known, because we can run a fully templated search, bypassing the all-sky hierarchical stage using an incoherent harmonic sum. The GW strain and frequency, as well as the projected semi-major axis of the binary system, are recovered and uncertainty estimated, for simulated signals that are detected. Upper limits for GW strain are set for undetected signals. Applications to future GW observatory data are discussed. Robust against spin-wandering and computationally tractable despite an unknown frequency, this directed search is an important new tool for finding gravitational signals from LMXBs.

g_contacts: Fast contact search in bio-molecular ensemble data

NASA Astrophysics Data System (ADS)

Blau, Christian; Grubmuller, Helmut

2013-12-01

Short-range interatomic interactions govern many bio-molecular processes. Therefore, identifying close interaction partners in ensemble data is an essential task in structural biology and computational biophysics. A contact search can be cast as a typical range search problem for which efficient algorithms have been developed. However, none of those has yet been adapted to the context of macromolecular ensembles, particularly in a molecular dynamics (MD) framework. Here a set-decomposition algorithm is implemented which detects all contacting atoms or residues in maximum O(Nlog(N)) run-time, in contrast to the O(N2) complexity of a brute-force approach. Catalogue identifier: AEQA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEQA_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 8945 No. of bytes in distributed program, including test data, etc.: 981604 Distribution format: tar.gz Programming language: C99. Computer: PC. Operating system: Linux. RAM: ≈Size of input frame Classification: 3, 4.14. External routines: Gromacs 4.6[1] Nature of problem: Finding atoms or residues that are closer to one another than a given cut-off. Solution method: Excluding distant atoms from distance calculations by decomposing the given set of atoms into disjoint subsets. Running time:≤O(Nlog(N)) References: [1] S. Pronk, S. Pall, R. Schulz, P. Larsson, P. Bjelkmar, R. Apostolov, M. R. Shirts, J.C. Smith, P. M. Kasson, D. van der Spoel, B. Hess and Erik Lindahl, Gromacs 4.5: a high-throughput and highly parallel open source molecular simulation toolkit, Bioinformatics 29 (7) (2013).

Patient-Centered Tools for Medication Information Search

PubMed Central

Wilcox, Lauren; Feiner, Steven; Elhadad, Noémie; Vawdrey, David; Tran, Tran H.

2016-01-01

Recent research focused on online health information seeking highlights a heavy reliance on general-purpose search engines. However, current general-purpose search interfaces do not necessarily provide adequate support for non-experts in identifying suitable sources of health information. Popular search engines have recently introduced search tools in their user interfaces for a range of topics. In this work, we explore how such tools can support non-expert, patient-centered health information search. Scoping the current work to medication-related search, we report on findings from a formative study focused on the design of patient-centered, medication-information search tools. Our study included qualitative interviews with patients, family members, and domain experts, as well as observations of their use of Remedy, a technology probe embodying a set of search tools. Post-operative cardiothoracic surgery patients and their visiting family members used the tools to find information about their hospital medications and were interviewed before and after their use. Domain experts conducted similar search tasks and provided qualitative feedback on their preferences and recommendations for designing these tools. Findings from our study suggest the importance of four valuation principles underlying our tools: credibility, readability, consumer perspective, and topical relevance. PMID:28163972

The adaptation of polar fishes to climatic changes: Structure, function and phylogeny of haemoglobin.

PubMed

Verde, Cinzia; Giordano, Daniela; di Prisco, Guido

2008-01-01

In the Antarctic, fishes of dominant suborder Notothenioidei have evolved in a unique thermal scenario. Phylogenetically related taxa of the suborder live in a wide range of latitudes, in Antarctic, sub-Antarctic and temperate oceans. Consequently, they offer a remarkable opportunity to study the physiological and biochemical characters gained and, conversely, lost during their evolutionary history. The evolutionary perspective has also been pursued by comparative studies of some features of the heme protein devoted to O(2) transport in fish living in the other polar region, the Arctic. The two polar regions differ by age and isolation. Fish living in each habitat have undergone regional constraints and fit into different evolutionary histories. The aim of this contribution is to survey the current knowledge of molecular structure, functional features, phylogeny and adaptations of the haemoglobins of fish thriving in the Antarctic, sub-Antarctic and Arctic regions (with some excursions in the temperate latitudes), in search of insights into the convergent processes evolved in response to cooling. Current climate change may disturb adaptation, calling for strategies aimed at neutralising threats to biodiversity.

Membrane adaptive optics

NASA Astrophysics Data System (ADS)

Marker, Dan K.; Wilkes, James M.; Ruggiero, Eric J.; Inman, Daniel J.

2005-08-01

An innovative adaptive optic is discussed that provides a range of capabilities unavailable with either existing, or newly reported, research devices. It is believed that this device will be inexpensive and uncomplicated to construct and operate, with a large correction range that should dramatically relax the static and dynamic structural tolerances of a telescope. As the areal density of a telescope primary is reduced, the optimal optical figure and the structural stiffness are inherently compromised and this phenomenon will require a responsive, range-enhanced wavefront corrector. In addition to correcting for the aberrations in such innovative primary mirrors, sufficient throw remains to provide non-mechanical steering to dramatically improve the Field of regard. Time dependent changes such as thermal disturbances can also be accommodated. The proposed adaptive optic will overcome some of the issues facing conventional deformable mirrors, as well as current and proposed MEMS-based deformable mirrors and liquid crystal based adaptive optics. Such a device is scalable to meter diameter apertures, eliminates high actuation voltages with minimal power consumption, provides long throw optical path correction, provides polychromatic dispersion free operation, dramatically reduces the effects of adjacent actuator influence, and provides a nearly 100% useful aperture. This article will reveal top-level details of the proposed construction and include portions of a static, dynamic, and residual aberration analysis. This device will enable certain designs previously conceived by visionaries in the optical community.

Improving Search Algorithms by Using Intelligent Coordinates

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan; Bandari, Esfandiar

2004-01-01

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent eta is self-interested; it sets its variable to maximize its own function g (sub eta). Three factors govern such a distributed algorithm's performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit alI three factors by modifying a search algorithm's exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based player engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Shape and Color Features for Object Recognition Search

NASA Technical Reports Server (NTRS)

Duong, Tuan A.; Duong, Vu A.; Stubberud, Allen R.

2012-01-01

A bio-inspired shape feature of an object of interest emulates the integration of the saccadic eye movement and horizontal layer in vertebrate retina for object recognition search where a single object can be used one at a time. The optimal computational model for shape-extraction-based principal component analysis (PCA) was also developed to reduce processing time and enable the real-time adaptive system capability. A color feature of the object is employed as color segmentation to empower the shape feature recognition to solve the object recognition in the heterogeneous environment where a single technique - shape or color - may expose its difficulties. To enable the effective system, an adaptive architecture and autonomous mechanism were developed to recognize and adapt the shape and color feature of the moving object. The bio-inspired object recognition based on bio-inspired shape and color can be effective to recognize a person of interest in the heterogeneous environment where the single technique exposed its difficulties to perform effective recognition. Moreover, this work also demonstrates the mechanism and architecture of the autonomous adaptive system to enable the realistic system for the practical use in the future.

VisSearch: A Collaborative Web Searching Environment

ERIC Educational Resources Information Center

Lee, Young-Jin

2005-01-01

VisSearch is a collaborative Web searching environment intended for sharing Web search results among people with similar interests, such as college students taking the same course. It facilitates students' Web searches by visualizing various Web searching processes. It also collects the visualized Web search results and applies an association rule…

Adaptive Development

NASA Technical Reports Server (NTRS)

2005-01-01

The goal of this research is to develop and demonstrate innovative adaptive seal technologies that can lead to dramatic improvements in engine performance, life, range, and emissions, and enhance operability for next generation gas turbine engines. This work is concentrated on the development of self-adaptive clearance control systems for gas turbine engines. Researchers have targeted the high-pressure turbine (HPT) blade tip seal location for following reasons: Current active clearance control (ACC) systems (e.g., thermal case-cooling schemes) cannot respond to blade tip clearance changes due to mechanical, thermal, and aerodynamic loads. As such they are prone to wear due to the required tight running clearances during operation. Blade tip seal wear (increased clearances) reduces engine efficiency, performance, and service life. Adaptive sealing technology research has inherent impact on all envisioned 21st century propulsion systems (e.g. distributed vectored, hybrid and electric drive propulsion concepts).

TALE proteins search DNA using a rotationally decoupled mechanism.

PubMed

Cuculis, Luke; Abil, Zhanar; Zhao, Huimin; Schroeder, Charles M

2016-10-01

Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins used extensively for gene editing. Despite recent progress, however, little is known about their sequence search mechanism. Here, we use single-molecule experiments to study TALE search along DNA. Our results show that TALEs utilize a rotationally decoupled mechanism for nonspecific search, despite remaining associated with DNA templates during the search process. Our results suggest that the protein helical structure enables TALEs to adopt a loosely wrapped conformation around DNA templates during nonspecific search, facilitating rapid one-dimensional (1D) diffusion under a range of solution conditions. Furthermore, this model is consistent with a previously reported two-state mechanism for TALE search that allows these proteins to overcome the search speed-stability paradox. Taken together, our results suggest that TALE search is unique among the broad class of sequence-specific DNA-binding proteins and supports efficient 1D search along DNA.

Practical characteristics of adaptive design in phase 2 and 3 clinical trials.

PubMed

Sato, A; Shimura, M; Gosho, M

2018-04-01

Adaptive design methods are expected to be ethical, reflect real medical practice, increase the likelihood of research and development success and reduce the allocation of patients into ineffective treatment groups by the early termination of clinical trials. However, the comprehensive details regarding which types of clinical trials will include adaptive designs remain unclear. We examined the practical characteristics of adaptive design used in clinical trials. We conducted a literature search of adaptive design clinical trials published from 2012 to 2015 using PubMed, EMBASE, and the Cochrane Central Register of Controlled Trials, with common search terms related to adaptive design. We systematically assessed the types and characteristics of adaptive designs and disease areas employed in the adaptive design trials. Our survey identified 245 adaptive design clinical trials. The number of trials by the publication year increased from 2012 to 2013 and did not greatly change afterwards. The most frequently used adaptive design was group sequential design (n = 222, 90.6%), especially for neoplasm or cardiovascular disease trials. Among the other types of adaptive design, adaptive dose/treatment group selection (n = 21, 8.6%) and adaptive sample-size adjustment (n = 19, 7.8%) were frequently used. The adaptive randomization (n = 8, 3.3%) and adaptive seamless design (n = 6, 2.4%) were less frequent. Adaptive dose/treatment group selection and adaptive sample-size adjustment were frequently used (up to 23%) in "certain infectious and parasitic diseases," "diseases of nervous system," and "mental and behavioural disorders" in comparison with "neoplasms" (<6.6%). For "mental and behavioural disorders," adaptive randomization was used in two trials of eight trials in total (25%). Group sequential design and adaptive sample-size adjustment were used frequently in phase 3 trials or in trials where study phase was not specified, whereas the other types of adaptive

Allele Surfing Promotes Microbial Adaptation from Standing Variation

PubMed Central

Gralka, Matti; Stiewe, Fabian; Farrell, Fred; Möbius, Wolfram; Waclaw, Bartek; Hallatschek, Oskar

2016-01-01

The coupling of ecology and evolution during range expansions enables mutations to establish at expanding range margins and reach high frequencies. This phenomenon, called allele surfing, is thought to have caused revolutions in the gene pool of many species, most evidently in microbial communities. It has remained unclear, however, under which conditions allele surfing promotes or hinders adaptation. Here, using microbial experiments and simulations, we show that, starting with standing adaptive variation, range expansions generate a larger increase in mean fitness than spatially uniform population expansions. The adaptation gain results from ‘soft’ selective sweeps emerging from surfing beneficial mutations. The rate of these surfing events is shown to sensitively depend on the strength of genetic drift, which varies among strains and environmental conditions. More generally, allele surfing promotes the rate of adaptation per biomass produced, which could help developing biofilms and other resource-limited populations to cope with environmental challenges. PMID:27307400

Beyond upgrading typologies - In search of a better deal for honey value chains in Brazil.

PubMed

Figueiredo Junior, Hugo S de; Meuwissen, Miranda P M; van der Lans, Ivo A; Oude Lansink, Alfons G J M

2017-01-01

Selection of value chain strategies by development practitioners and value chain participants themselves has been restricted to preset types of upgrading. This paper argues for an extension of the range of strategy solutions to value chains. An empirical application identifies successful strategies for honey value chains in Brazil for 2015-2020. Strategy and performance indicators were selected using the value chain Structure-Conduct-Performance (SCP) framework. Experts' opinion was elicited in a Delphi for business scenarios, and adaptive conjoint analysis was used to identify strategies for increasing production growth and local value-added. This study identifies important strategies beyond upgrading typologies, and finds that important strategies differ by performance goal and scenario. The value chain SCP allows searching for promising strategies towards performance-the "better deal"-in an integrated way.

Reducing the width of confidence intervals for the difference between two population means by inverting adaptive tests.

PubMed

O'Gorman, Thomas W

2018-05-01

In the last decade, it has been shown that an adaptive testing method could be used, along with the Robbins-Monro search procedure, to obtain confidence intervals that are often narrower than traditional confidence intervals. However, these confidence interval limits require a great deal of computation and some familiarity with stochastic search methods. We propose a method for estimating the limits of confidence intervals that uses only a few tests of significance. We compare these limits to those obtained by a lengthy Robbins-Monro stochastic search and find that the proposed method is nearly as accurate as the Robbins-Monro search. Adaptive confidence intervals that are produced by the proposed method are often narrower than traditional confidence intervals when the distributions are long-tailed, skewed, or bimodal. Moreover, the proposed method of estimating confidence interval limits is easy to understand, because it is based solely on the p-values from a few tests of significance.

An Adaptive Cross-Architecture Combination Method for Graph Traversal

DOE Office of Scientific and Technical Information (OSTI.GOV)

You, Yang; Song, Shuaiwen; Kerbyson, Darren J.

2014-06-18

Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.

Where to search top-K biomedical ontologies?

PubMed

Oliveira, Daniela; Butt, Anila Sahar; Haller, Armin; Rebholz-Schuhmann, Dietrich; Sahay, Ratnesh

2018-03-20

Searching for precise terms and terminological definitions in the biomedical data space is problematic, as researchers find overlapping, closely related and even equivalent concepts in a single or multiple ontologies. Search engines that retrieve ontological resources often suggest an extensive list of search results for a given input term, which leads to the tedious task of selecting the best-fit ontological resource (class or property) for the input term and reduces user confidence in the retrieval engines. A systematic evaluation of these search engines is necessary to understand their strengths and weaknesses in different search requirements. We have implemented seven comparable Information Retrieval ranking algorithms to search through ontologies and compared them against four search engines for ontologies. Free-text queries have been performed, the outcomes have been judged by experts and the ranking algorithms and search engines have been evaluated against the expert-based ground truth (GT). In addition, we propose a probabilistic GT that is developed automatically to provide deeper insights and confidence to the expert-based GT as well as evaluating a broader range of search queries. The main outcome of this work is the identification of key search factors for biomedical ontologies together with search requirements and a set of recommendations that will help biomedical experts and ontology engineers to select the best-suited retrieval mechanism in their search scenarios. We expect that this evaluation will allow researchers and practitioners to apply the current search techniques more reliably and that it will help them to select the right solution for their daily work. The source code (of seven ranking algorithms), ground truths and experimental results are available at https://github.com/danielapoliveira/bioont-search-benchmark.

Recovery and adaptation after wildfire on the Colorado Front Range (2010–12)

Treesearch

Miranda H. Mockrin; Susan I. Stewart; Volker C. Radeloff; Roger B. Hammer

2016-01-01

Following the loss of homes to wildfire, when risk has been made apparent, homeowners must decide whether to rebuild, and choose materials and vegetation, while local governments guide recovery and rebuilding. As wildfires are smaller and more localised than other disasters, it is unclear if recovery after wildfire results in policy change and adaptation, decreasing...

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

PubMed

Xia, Yangkun; Fu, Zhuo; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order

PubMed Central

Xia, Yangkun; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can’t be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution. PMID:29763419

Experimental studies of adaptation in Clarkia xantiana. II. Fitness variation across a subspecies border.

PubMed

Geber, Monica A; Eckhart, Vincent M

2005-03-01

Because the range boundary is the locale beyond which a taxon fails to persist, it provides a unique opportunity for studying the limits on adaptive evolution. Adaptive constraints on range expansion are perplexing in view of widespread ecotypic differentiation by habitat and region within a species' range (regional adaptation) and rapid evolutionary response to novel environments. In this study of two parapatric subspecies, Clarkia xantiana ssp. xantiana and C. x. ssp. parviflora, we compared the fitness of population transplants within their native region, in a non-native region within the native range, and in the non-native range to assess whether range expansion might be limited by a greater intensity of selection on colonists of a new range versus a new region within the range. The combined range of the two subspecies spans a west-to-east gradient of declining precipitation in the Sierra Nevada of California, with ssp. xantiana in the west being replaced by ssp. parviflora in the east. Both subspecies had significantly higher fitness in the native range (range adaptation), whereas regional adaptation was weak and was found only in the predominantly outcrossing ssp. xantiana but was absent in the inbreeding ssp. parvifilora. Because selection intensity on transplants was much stronger in the non-native range relative to non-native regions, there is a larger adaptive barrier to range versus regional expansion. Three of five sequential fitness components accounted for regional and range adaptation, but only one of them, survivorship from germination to flowering, contributed to both. Flower number contributed to regional adaptation in ssp. xantiana and fruit set (number of fruits per flower) to range adaptation. Differential survivorship of the two taxa or regional populations of ssp. xantiana in non-native environments was attributable, in part, to biotic interactions, including competition, herbivory, and pollination. For example, low fruit set in ssp. xantiana

Adapting populations in space: clonal interference and genetic diversity

NASA Astrophysics Data System (ADS)

Weissman, Daniel; Barton, Nick

Most species inhabit ranges much larger than the scales over which individuals interact. How does this spatial structure interact with adaptive evolution? We consider a simple model of a spatially-extended, adapting population and show that, while clonal interference severely limits the adaptation of purely asexual populations, even rare recombination is enough to allow adaptation at rates approaching those of well-mixed populations. We also find that the genetic hitchhiking produced by the adaptive alleles sweeping through the population has strange effects on the patterns of genetic diversity. In large spatial ranges, even low rates of adaptation cause all individuals in the population to rapidly trace their ancestry back to individuals living in a small region in the center of the range. The probability of fixation of an allele is thus strongly dependent on the allele's spatial location, with alleles from the center favored. Surprisingly, these effects are seen genome-wide (instead of being localized to the regions of the genome undergoing the sweeps). The spatial concentration of ancestry produces a power-law dependence of relatedness on distance, so that even individuals sampled far apart are likely to be fairly closely related, masking the underlying spatial structure.

Plants of the highest Santa Lucia and Diablo Range

Treesearch

James R. Griffin

1975-01-01

A search for vascular plants was conducted on six of the highest ridges in the south Coast Ranges of California. It covered five prominent peaks in the Santa Lucia Range, Monterey County, and the tallest mountain in the Diablo Range, San Benito-Fresno counties. Listed are all species found above 1200 m (3937-feet) elevation on at least one peak. Relative abundance is...

Lagging adaptation to warming climate in Arabidopsis thaliana.

PubMed

Wilczek, Amity M; Cooper, Martha D; Korves, Tonia M; Schmitt, Johanna

2014-06-03

If climate change outpaces the rate of adaptive evolution within a site, populations previously well adapted to local conditions may decline or disappear, and banked seeds from those populations will be unsuitable for restoring them. However, if such adaptational lag has occurred, immigrants from historically warmer climates will outperform natives and may provide genetic potential for evolutionary rescue. We tested for lagging adaptation to warming climate using banked seeds of the annual weed Arabidopsis thaliana in common garden experiments in four sites across the species' native European range: Valencia, Spain; Norwich, United Kingdom; Halle, Germany; and Oulu, Finland. Genotypes originating from geographic regions near the planting site had high relative fitness in each site, direct evidence for broad-scale geographic adaptation in this model species. However, genotypes originating in sites historically warmer than the planting site had higher average relative fitness than local genotypes in every site, especially at the northern range limit in Finland. This result suggests that local adaptive optima have shifted rapidly with recent warming across the species' native range. Climatic optima also differed among seasonal germination cohorts within the Norwich site, suggesting that populations occurring where summer germination is common may have greater evolutionary potential to persist under future warming. If adaptational lag has occurred over just a few decades in banked seeds of an annual species, it may be an important consideration for managing longer-lived species, as well as for attempts to conserve threatened populations through ex situ preservation.

Lagging adaptation to warming climate in Arabidopsis thaliana

PubMed Central

Wilczek, Amity M.; Cooper, Martha D.; Korves, Tonia M.; Schmitt, Johanna

2014-01-01

If climate change outpaces the rate of adaptive evolution within a site, populations previously well adapted to local conditions may decline or disappear, and banked seeds from those populations will be unsuitable for restoring them. However, if such adaptational lag has occurred, immigrants from historically warmer climates will outperform natives and may provide genetic potential for evolutionary rescue. We tested for lagging adaptation to warming climate using banked seeds of the annual weed Arabidopsis thaliana in common garden experiments in four sites across the species’ native European range: Valencia, Spain; Norwich, United Kingdom; Halle, Germany; and Oulu, Finland. Genotypes originating from geographic regions near the planting site had high relative fitness in each site, direct evidence for broad-scale geographic adaptation in this model species. However, genotypes originating in sites historically warmer than the planting site had higher average relative fitness than local genotypes in every site, especially at the northern range limit in Finland. This result suggests that local adaptive optima have shifted rapidly with recent warming across the species’ native range. Climatic optima also differed among seasonal germination cohorts within the Norwich site, suggesting that populations occurring where summer germination is common may have greater evolutionary potential to persist under future warming. If adaptational lag has occurred over just a few decades in banked seeds of an annual species, it may be an important consideration for managing longer-lived species, as well as for attempts to conserve threatened populations through ex situ preservation. PMID:24843140

Misleading contextual cues: how do they affect visual search?

PubMed

Manginelli, Angela A; Pollmann, Stefan

2009-03-01

Contextual cueing occurs when repetitions of the distractor configuration are implicitly learned. This implicit learning leads to faster search times in repeated displays. Here, we investigated how search adapts to a change of the target location in old displays from a consistent location in the learning phase to a consistent new location in the transfer phase. In agreement with the literature, contextual cueing was accompanied by fewer fixations, a more efficient scan path and, specifically, an earlier onset of a monotonic gaze approach phase towards the target location in repeated displays. When the repeated context was no longer predictive of the old target location, search times and number of fixations for old displays increased to the level of novel displays. Along with this, scan paths for old and new displays became equally efficient. After the target location change, there was a bias of exploration towards the old target location, which soon disappeared. Thus, change of implicitly learned spatial relations between target and distractor configuration eliminated the advantageous effects of contextual cueing, but did not lead to a lasting impairment of search in repeated displays relative to novel displays.

Women's role in adapting to climate change and variability

NASA Astrophysics Data System (ADS)

Carvajal-Escobar, Y.; Quintero-Angel, M.; García-Vargas, M.

2008-04-01

Given that women are engaged in more climate-related change activities than what is recognized and valued in the community, this article highlights their important role in the adaptation and search for safer communities, which leads them to understand better the causes and consequences of changes in climatic conditions. It is concluded that women have important knowledge and skills for orienting the adaptation processes, a product of their roles in society (productive, reproductive and community); and the importance of gender equity in these processes is recognized. The relationship among climate change, climate variability and the accomplishment of the Millennium Development Goals is considered.

A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

NASA Astrophysics Data System (ADS)

Nguyen, Viet-Phuong; Prins, Christian; Prodhon, Caroline

This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.

Improving search algorithms by using intelligent coordinates

NASA Astrophysics Data System (ADS)

Wolpert, David; Tumer, Kagan; Bandari, Esfandiar

2004-01-01

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent η is self-interested; it sets its variable to maximize its own function gη. Three factors govern such a distributed algorithm’s performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit all three factors by modifying a search algorithm’s exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based “player” engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Social and natural sciences differ in their research strategies, adapted to work for different knowledge landscapes.

PubMed

Jaffe, Klaus

2014-01-01

Do different fields of knowledge require different research strategies? A numerical model exploring different virtual knowledge landscapes, revealed two diverging optimal search strategies. Trend following is maximized when the popularity of new discoveries determine the number of individuals researching it. This strategy works best when many researchers explore few large areas of knowledge. In contrast, individuals or small groups of researchers are better in discovering small bits of information in dispersed knowledge landscapes. Bibliometric data of scientific publications showed a continuous bipolar distribution of these strategies, ranging from natural sciences, with highly cited publications in journals containing a large number of articles, to the social sciences, with rarely cited publications in many journals containing a small number of articles. The natural sciences seem to adapt their research strategies to landscapes with large concentrated knowledge clusters, whereas social sciences seem to have adapted to search in landscapes with many small isolated knowledge clusters. Similar bipolar distributions were obtained when comparing levels of insularity estimated by indicators of international collaboration and levels of country-self citations: researchers in academic areas with many journals such as social sciences, arts and humanities, were the most isolated, and that was true in different regions of the world. The work shows that quantitative measures estimating differences between academic disciplines improve our understanding of different research strategies, eventually helping interdisciplinary research and may be also help improve science policies worldwide.

Experimental Search for a Heavy Electron

DOE R&D Accomplishments Database

Boley, C. D.; Elias, J. E.; Friedman, J. I.; Hartmann, G. C.; Kendall, H. W.; Kirk, P.N.; Sogard, M. R.; Van Speybroeck, L. P.; de Pagter, J. K.

1967-09-01

A search for a heavy electron of the type considered by Low and Blackmon has been made by studying the inelastic scattering of 5 BeV electrons from hydrogen. The search was made over a range of values of the mass of the heavy electron from 100 t0 1300 MeV. No evidence for such a particle was observed. Upper limits on the production cross sections were determined and employed to deducelimits on the values of the electron-photon-heavy electron coupling constant in Low and Blackmon=s theory.

A computational model of visual marking using an inter-connected network of spiking neurons: the spiking search over time & space model (sSoTS).

PubMed

Mavritsaki, Eirini; Heinke, Dietmar; Humphreys, Glyn W; Deco, Gustavo

2006-01-01

In the real world, visual information is selected over time as well as space, when we prioritise new stimuli for attention. Watson and Humphreys [Watson, D., Humphreys, G.W., 1997. Visual marking: prioritizing selection for new objects by top-down attentional inhibition of old objects. Psychological Review 104, 90-122] presented evidence that new information in search tasks is prioritised by (amongst other processes) active ignoring of old items - a process they termed visual marking. In this paper we present, for the first time, an explicit computational model of visual marking using biologically plausible activation functions. The "spiking search over time and space" model (sSoTS) incorporates different synaptic components (NMDA, AMPA, GABA) and a frequency adaptation mechanism based on [Ca(2+)] sensitive K(+) current. This frequency adaptation current can act as a mechanism that suppresses the previously attended items. We show that, when coupled with a process of active inhibition applied to old items, frequency adaptation leads to old items being de-prioritised (and new items prioritised) across time in search. Furthermore, the time course of these processes mimics the time course of the preview effect in human search. The results indicate that the sSoTS model can provide a biologically plausible account of human search over time as well as space.

G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

NASA Technical Reports Server (NTRS)

Rogers, David

1991-01-01

G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

The geography of sex-specific selection, local adaptation, and sexual dimorphism.

PubMed

Connallon, Tim

2015-09-01

Local adaptation and sexual dimorphism are iconic evolutionary scenarios of intraspecific adaptive differentiation in the face of gene flow. Although theory has traditionally considered local adaptation and sexual dimorphism as conceptually distinct processes, emerging data suggest that they often act concurrently during evolutionary diversification. Here, I merge theories of local adaptation in space and sex-specific adaptation over time, and show that their confluence yields several new predictions about the roles of context-specific selection, migration, and genetic correlations, in adaptive diversification. I specifically revisit two influential predictions from classical studies of clinal adaptation and sexual dimorphism: (1) that local adaptation should decrease with distance from the species' range center and (2) that opposing directional selection between the sexes (sexual antagonism) should inevitably accompany the evolution of sexual dimorphism. I show that both predictions can break down under clinally varying selection. First, the geography of local adaptation can be sexually dimorphic, with locations of relatively high local adaptation differing profoundly between the sexes. Second, the intensity of sexual antagonism varies across the species' range, with subpopulations near the range center representing hotspots for antagonistic selection. The results highlight the context-dependent roles of migration versus sexual conflict as primary constraints to adaptive diversification. © 2015 The Author(s). Evolution © 2015 The Society for the Study of Evolution.

Northwest range-plant symbols adapted to automatic data processing.

Treesearch

George A. Garrison; Jon M. Skovlin

1960-01-01

Many range technicians, agronomists, foresters, biologists, and botanists of various educational institutions and government agencies in the Northwest have been using a four-letter symbol list or code compiled 12 years ago from records of plants collected by the U.S. Forest Service in Oregon and Washington, This code has served well as a means of entering plant names...

In Search of Speedier Searches.

ERIC Educational Resources Information Center

Peterson, Ivars

1984-01-01

Methods to make computer searching as simple and efficient as possible have led to the development of various data structures. Data structures specify the items involved in searching and what can be done to them. The nature and advantages of using "self-adjusting" data structures (self-adjusting binary search trees) are discussed. (JN)

Final Hazard Search

NASA Image and Video Library

2015-07-08

This single frame from a four-frame movie shows New Horizons' final deep search for hazardous material around Pluto, obtained on July 1, 2015. These data allow a highly sensitive search for any new moons. The images were taken with the spacecraft's Long Range Reconnaissance Imager (LORRI) over a 100-minute period, and were the final observations in the series of dedicated searches for hazards in the Pluto system which began on May 11. The images show all five known satellites of Pluto moving in their orbits around the dwarf planet, but analysis of these data has so far not revealed the existence of any additional moons. This means that any undiscovered Plutonian moons further than a few thousand miles from Pluto must be smaller than about 1 mile (1.6 kilometers) in diameter, if their surfaces have similar brightness to Pluto's big moon Charon. For comparison, Pluto's faintest known moon, Styx, which is conspicuous in the lower left quadrant of these images, is about 4 miles (7 kilometers) across, assuming the same surface brightness. The absence of additional moons, and also the absence of detectable rings in the hazard search data, imply that the spacecraft is very unlikely to be damaged by collisions with rings, or dust particles ejected from moons, during its high-speed passage through the Pluto system. The four movie frames were taken at 16:28, 16:38, 17:52, and 18:04 UTC on July 1, from a range of 9.4 million miles (15.2 million kilometers). Each frame is a mosaic of four sets of overlapping images, with a total exposure time of 120 seconds. The images have been heavily processed to remove the glare of Pluto and Charon, and the dense background of stars, though blemishes remain at the locations of many of the brighter stars. The "tails" extending to the right or downward from Pluto and Charon are camera artifacts caused by the extreme overexposure of both objects. Pluto and its five moons Charon, Styx, Nix, Kerberos and Hydra are identified by their initials

Searching for light dark matter with the SLAC millicharge experiment.

PubMed

Diamond, M; Schuster, P

2013-11-27

New sub-GeV gauge forces ("dark photons") that kinetically mix with the photon provide a promising scenario for MeV-GeV dark matter and are the subject of a program of searches at fixed-target and collider facilities around the world. In such models, dark photons produced in collisions may decay invisibly into dark-matter states, thereby evading current searches. We reexamine results of the SLAC mQ electron beam dump experiment designed to search for millicharged particles and find that it was strongly sensitive to any secondary beam of dark matter produced by electron-nucleus collisions in the target. The constraints are competitive for dark photon masses in the ~1-30 MeV range, covering part of the parameter space that can reconcile the apparent (g-2)(μ) anomaly. Simple adjustments to the original SLAC search for millicharges may extend sensitivity to cover a sizable portion of the remaining (g-2)(μ) anomaly-motivated region. The mQ sensitivity is therefore complementary to ongoing searches for visible decays of dark photons. Compared to existing direct-detection searches, mQ sensitivity to electron-dark-matter scattering cross sections is more than an order of magnitude better for a significant range of masses and couplings in simple models.

T Cell Adaptive Immunity Proceeds through Environment-Induced Adaptation from the Exposure of Cryptic Genetic Variation

PubMed Central

Whitacre, James M.; Lin, Joseph; Harding, Angus

2011-01-01

Evolution is often characterized as a process involving incremental genetic changes that are slowly discovered and fixed in a population through genetic drift and selection. However, a growing body of evidence is finding that changes in the environment frequently induce adaptations that are much too rapid to occur by an incremental genetic search process. Rapid evolution is hypothesized to be facilitated by mutations present within the population that are silent or “cryptic” within the first environment but are co-opted or “exapted” to the new environment, providing a selective advantage once revealed. Although cryptic mutations have recently been shown to facilitate evolution in RNA enzymes, their role in the evolution of complex phenotypes has not been proven. In support of this wider role, this paper describes an unambiguous relationship between cryptic genetic variation and complex phenotypic responses within the immune system. By reviewing the biology of the adaptive immune system through the lens of evolution, we show that T cell adaptive immunity constitutes an exemplary model system where cryptic alleles drive rapid adaptation of complex traits. In naive T cells, normally cryptic differences in T cell receptor reveal diversity in activation responses when the cellular population is presented with a novel environment during infection. We summarize how the adaptive immune response presents a well studied and appropriate experimental system that can be used to confirm and expand upon theoretical evolutionary models describing how seemingly small and innocuous mutations can drive rapid cellular evolution. PMID:22363338

Rapid and selective updating of the target template in visual search.

PubMed

Sha, Li Z; Remington, Roger W; Jiang, Yuhong V

2017-01-01

Frequent target stimuli are detected more rapidly than infrequent ones. Here, we examined whether the frequency effect reflected durable attentional biases toward frequent target features, and whether the effect was confined to featural properties that defined the target. Participants searched for two specific target colors among distractors of heterogeneous colors and reported the line orientation of the target. The target was more often in one specific feature (e.g., a specific color or a specific orientation) than another in a training phase. This frequency difference was removed or reversed in a testing phase. Experiments 1 and 2 showed that when frequency differences were introduced to the target's defining feature, participants more rapidly found the high-frequency target than the low-frequency target. However, changes in attention were not durable-the search advantage vanished immediately when the frequency differences were removed. Experiments 3-5 showed that only featural properties that defined the target facilitated search of the more frequent feature. Features that did not define the target, such as the target feature that participants reported, sped up response but did not facilitate search. These data showed that when searching for multiple targets in a feature search task, people selectively and rapidly adapt to the frequency in the target's defining feature.

Real time optimization algorithm for wavefront sensorless adaptive optics OCT (Conference Presentation)

NASA Astrophysics Data System (ADS)

Verstraete, Hans R. G. W.; Heisler, Morgan; Ju, Myeong Jin; Wahl, Daniel J.; Bliek, Laurens; Kalkman, Jeroen; Bonora, Stefano; Sarunic, Marinko V.; Verhaegen, Michel; Jian, Yifan

2017-02-01

Optical Coherence Tomography (OCT) has revolutionized modern ophthalmology, providing depth resolved images of the retinal layers in a system that is suited to a clinical environment. A limitation of the performance and utilization of the OCT systems has been the lateral resolution. Through the combination of wavefront sensorless adaptive optics with dual variable optical elements, we present a compact lens based OCT system that is capable of imaging the photoreceptor mosaic. We utilized a commercially available variable focal length lens to correct for a wide range of defocus commonly found in patient eyes, and a multi-actuator adaptive lens after linearization of the hysteresis in the piezoelectric actuators for aberration correction to obtain near diffraction limited imaging at the retina. A parallel processing computational platform permitted real-time image acquisition and display. The Data-based Online Nonlinear Extremum seeker (DONE) algorithm was used for real time optimization of the wavefront sensorless adaptive optics OCT, and the performance was compared with a coordinate search algorithm. Cross sectional images of the retinal layers and en face images of the cone photoreceptor mosaic acquired in vivo from research volunteers before and after WSAO optimization are presented. Applying the DONE algorithm in vivo for wavefront sensorless AO-OCT demonstrates that the DONE algorithm succeeds in drastically improving the signal while achieving a computational time of 1 ms per iteration, making it applicable for high speed real time applications.

Beyond upgrading typologies – In search of a better deal for honey value chains in Brazil

PubMed Central

Meuwissen, Miranda P. M.; van der Lans, Ivo A.; Oude Lansink, Alfons G. J. M.

2017-01-01

Selection of value chain strategies by development practitioners and value chain participants themselves has been restricted to preset types of upgrading. This paper argues for an extension of the range of strategy solutions to value chains. An empirical application identifies successful strategies for honey value chains in Brazil for 2015–2020. Strategy and performance indicators were selected using the value chain Structure-Conduct-Performance (SCP) framework. Experts’ opinion was elicited in a Delphi for business scenarios, and adaptive conjoint analysis was used to identify strategies for increasing production growth and local value-added. This study identifies important strategies beyond upgrading typologies, and finds that important strategies differ by performance goal and scenario. The value chain SCP allows searching for promising strategies towards performance–the “better deal”–in an integrated way. PMID:28742804

Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment

NASA Astrophysics Data System (ADS)

Du, N.; Force, N.; Khatiwada, R.; Lentz, E.; Ottens, R.; Rosenberg, L. J.; Rybka, G.; Carosi, G.; Woollett, N.; Bowring, D.; Chou, A. S.; Sonnenschein, A.; Wester, W.; Boutan, C.; Oblath, N. S.; Bradley, R.; Daw, E. J.; Dixit, A. V.; Clarke, J.; O'Kelley, S. R.; Crisosto, N.; Gleason, J. R.; Jois, S.; Sikivie, P.; Stern, I.; Sullivan, N. S.; Tanner, D. B.; Hilton, G. C.; ADMX Collaboration

2018-04-01

This Letter reports the results from a haloscope search for dark matter axions with masses between 2.66 and 2.81 μ eV . The search excludes the range of axion-photon couplings predicted by plausible models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume haloscope at subkelvin temperatures, thereby reducing thermal noise as well as the excess noise from the ultralow-noise superconducting quantum interference device amplifier used for the signal power readout. Ongoing searches will provide nearly definitive tests of the invisible axion model over a wide range of axion masses.

Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment.

PubMed

Du, N; Force, N; Khatiwada, R; Lentz, E; Ottens, R; Rosenberg, L J; Rybka, G; Carosi, G; Woollett, N; Bowring, D; Chou, A S; Sonnenschein, A; Wester, W; Boutan, C; Oblath, N S; Bradley, R; Daw, E J; Dixit, A V; Clarke, J; O'Kelley, S R; Crisosto, N; Gleason, J R; Jois, S; Sikivie, P; Stern, I; Sullivan, N S; Tanner, D B; Hilton, G C

2018-04-13

This Letter reports the results from a haloscope search for dark matter axions with masses between 2.66 and 2.81  μeV. The search excludes the range of axion-photon couplings predicted by plausible models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume haloscope at subkelvin temperatures, thereby reducing thermal noise as well as the excess noise from the ultralow-noise superconducting quantum interference device amplifier used for the signal power readout. Ongoing searches will provide nearly definitive tests of the invisible axion model over a wide range of axion masses.

Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment

DOE PAGES

Du, N.; Force, N.; Khatiwada, R.; ...

2018-04-09

This Letter reports the results from a haloscope search for dark matter axions with masses between 2.66 and 2.81 μ eV . The search excludes the range of axion-photon couplings predicted by plausible models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume haloscope at subkelvin temperatures, thereby reducing thermal noise as well as the excess noise from the ultralow-noise superconducting quantum interference device amplifier used for the signal power readout. Finally, ongoing searches will provide nearly definitive tests of the invisible axion model over a wide range of axion masses.

Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Du, N.; Force, N.; Khatiwada, R.

This Letter reports results from a haloscope search for dark matter axions with masses between 18 2.66 and 2.81 eV. The search excludes the range of axion-photon couplings predicted by plausible 19 models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume 20 haloscope at sub-Kelvin temperatures, thereby reducing thermal noise as well as the excess noise 21 from the ultra-low-noise SQUID amplier used for the signal power readout. Ongoing searches will 22 provide nearly denitive tests of the invisible axion model over a wide range of axion masses.

Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Du, N.; Force, N.; Khatiwada, R.

This Letter reports the results from a haloscope search for dark matter axions with masses between 2.66 and 2.81 μ eV . The search excludes the range of axion-photon couplings predicted by plausible models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume haloscope at subkelvin temperatures, thereby reducing thermal noise as well as the excess noise from the ultralow-noise superconducting quantum interference device amplifier used for the signal power readout. Finally, ongoing searches will provide nearly definitive tests of the invisible axion model over a wide range of axion masses.

A map of local adaptation in Arabidopsis thaliana.

PubMed

Fournier-Level, A; Korte, A; Cooper, M D; Nordborg, M; Schmitt, J; Wilczek, A M

2011-10-07

Local adaptation is critical for species persistence in the face of rapid environmental change, but its genetic basis is not well understood. Growing the model plant Arabidopsis thaliana in field experiments in four sites across the species' native range, we identified candidate loci for local adaptation from a genome-wide association study of lifetime fitness in geographically diverse accessions. Fitness-associated loci exhibited both geographic and climatic signatures of local adaptation. Relative to genomic controls, high-fitness alleles were generally distributed closer to the site where they increased fitness, occupying specific and distinct climate spaces. Independent loci with different molecular functions contributed most strongly to fitness variation in each site. Independent local adaptation by distinct genetic mechanisms may facilitate a flexible evolutionary response to changing environment across a species range.

Results on SUSY and Higgs searches at CMS

ScienceCinema

Tapper, Alex

2018-02-16

We present the results of searches for Supersymmetry and the Higgs boson performed using data collected in 2010 by the CMS experiment at the LHC in pp-collisions at a centre-of-mass energy of 7 TeV. Searches for Supersymmetry are performed in all-hadronic final states with jets and missing transverse energy and in final states including one or more isolated leptons or photons. No evidence for new physics is observed and limits are set on the predictions of a range of Supersymmetric scenarios. The results of searches for the Higgs boson are presented and limits set.

The role of female search behaviour in determining host plant range in plant feeding insects: a test of the information processing hypothesis

PubMed Central

Janz, N.; Nylin, S.

1997-01-01

Recent theoretical studies have suggested that host range in herbivorous insects may be more restricted by constraints on information processing on the ovipositing females than by trade-offs in larval feeding efficiency. We have investigated if females from polyphagous species have to pay for their ability to localize and evaluate plants from different species with a lower ability to discriminate between conspecific host plants with differences in quality. Females of the monophagous butterflies Polygonia satyrus, Vanessa indica and Inachis io and the polyphagous P. c-album and Cynthia cardui (all in Lepidoptera, Nymphalidae) were given a simultaneous choice of stinging nettles (Urtica dioica) of different quality. In addition, the same choice trial was given to females from two populations of P. c-album with different degrees of specificity. As predicted from the information processing hypothesis, all specialists discriminated significantly against the bad quality nettle, whereas the generalists laid an equal amount of eggs on both types of nettle. There were no corresponding differences between specialist and generalist larvae in their ability to utilize poor quality leaves. Our study therefore suggests that female host-searching behaviour plays an important role in determining host plant range.

The Role of Female Search Behaviour in Determining Host Plant Range in Plant Feeding Insects: A Test of the Information Processing Hypothesis

NASA Astrophysics Data System (ADS)

Janz, Niklas; Nylin, Soren

1997-05-01

Recent theoretical studies have suggested that host range in herbivorous insects may be more restricted by constraints on information processing on the ovipositing females than by trade-offs in larval feeding efficiency. We have investigated if females from polyphagous species have to pay for their ability to localize and evaluate plants from different species with a lower ability to discriminate between conspecific host plants with differences in quality. Females of the monophagous butterflies Polygonia satyrus, Vanessa indica and Inachis io and the polyphagous P. c-album and Cynthia cardui (all in Lepidoptera, Nymphalidae) were given a simultaneous choice of stinging nettles (Urtica dioica) of different quality. In addition, the same choice trial was given to females from two populations of P. c-album with different degrees of specificity. As predicted from the information processing hypothesis, all specialists discriminated significantly against the bad quality nettle, whereas the generalists laid an equal amount of eggs on both types of nettle. There were no corresponding differences between specialist and generalist larvae in their ability to utilize poor quality leaves. Our study therefore suggests that female host-searching behaviour plays an important role in determining host plant range.

Lack of adaptation from standing genetic variation despite the presence of putatively adaptive alleles in introduced sweet vernal grass (Anthoxanthum odoratum).

PubMed

Gould, B; Geber, M

2016-01-01

Population genetic theory predicts that the availability of appropriate standing genetic variation should facilitate rapid evolution when species are introduced to new environments. However, few tests of rapid evolution have been paired with empirical surveys for the presence of previously identified adaptive genetic variants in natural populations. In this study, we examined local adaptation to soil Al toxicity in the introduced range of sweet vernal grass (Anthoxanthum odoratum), and we genotyped populations for the presence of Al tolerance alleles previously identified at the long-term ecological Park Grass Experiment (PGE, Harpenden, UK) in the species native range. We found that markers associated with Al tolerance at the PGE were present at appreciable frequency in introduced populations. Despite this, there was no strong evidence of local adaptation to soil Al toxicity among populations. Populations demonstrated significantly different intrinsic root growth rates in the absence of Al. This suggests that selection on correlated root growth traits may constrain the ability of populations to evolve significantly different root growth responses to Al. Our results demonstrate that genotype-phenotype associations may differ substantially between the native and introduced parts of a species range and that adaptive alleles from a native species range may not necessarily promote phenotypic differentiation in the introduced range. © 2015 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2015 European Society For Evolutionary Biology.

Adding Statistical Machine Translation Adaptation to Computer-Assisted Translation

DTIC Science & Technology

2013-09-01

are automatically searched and used to suggest possible translations; (2) spell-checkers; (3) glossaries; (4) dictionaries ; (5) alignment and...matching against TMs to propose translations; spell-checking, glossary, and dictionary look-up; support for multiple file formats; regular expressions...on Telecommunications. Tehran, 2012, 822–826. Bertoldi, N.; Federico, M. Domain Adaptation for Statistical Machine Translation with Monolingual

An Adaptive Cultural Algorithm with Improved Quantum-behaved Particle Swarm Optimization for Sonar Image Detection.

PubMed

Wang, Xingmei; Hao, Wenqian; Li, Qiming

2017-12-18

This paper proposes an adaptive cultural algorithm with improved quantum-behaved particle swarm optimization (ACA-IQPSO) to detect the underwater sonar image. In the population space, to improve searching ability of particles, iterative times and the fitness value of particles are regarded as factors to adaptively adjust the contraction-expansion coefficient of the quantum-behaved particle swarm optimization algorithm (QPSO). The improved quantum-behaved particle swarm optimization algorithm (IQPSO) can make particles adjust their behaviours according to their quality. In the belief space, a new update strategy is adopted to update cultural individuals according to the idea of the update strategy in shuffled frog leaping algorithm (SFLA). Moreover, to enhance the utilization of information in the population space and belief space, accept function and influence function are redesigned in the new communication protocol. The experimental results show that ACA-IQPSO can obtain good clustering centres according to the grey distribution information of underwater sonar images, and accurately complete underwater objects detection. Compared with other algorithms, the proposed ACA-IQPSO has good effectiveness, excellent adaptability, a powerful searching ability and high convergence efficiency. Meanwhile, the experimental results of the benchmark functions can further demonstrate that the proposed ACA-IQPSO has better searching ability, convergence efficiency and stability.

Guiding Conformation Space Search with an All-Atom Energy Potential

PubMed Central

Brunette, TJ; Brock, Oliver

2009-01-01

The most significant impediment for protein structure prediction is the inadequacy of conformation space search. Conformation space is too large and the energy landscape too rugged for existing search methods to consistently find near-optimal minima. To alleviate this problem, we present model-based search, a novel conformation space search method. Model-based search uses highly accurate information obtained during search to build an approximate, partial model of the energy landscape. Model-based search aggregates information in the model as it progresses, and in turn uses this information to guide exploration towards regions most likely to contain a near-optimal minimum. We validate our method by predicting the structure of 32 proteins, ranging in length from 49 to 213 amino acids. Our results demonstrate that model-based search is more effective at finding low-energy conformations in high-dimensional conformation spaces than existing search methods. The reduction in energy translates into structure predictions of increased accuracy. PMID:18536015

Searching for grey literature for systematic reviews: challenges and benefits.

PubMed

Mahood, Quenby; Van Eerd, Dwayne; Irvin, Emma

2014-09-01

There is ongoing interest in including grey literature in systematic reviews. Including grey literature can broaden the scope to more relevant studies, thereby providing a more complete view of available evidence. Searching for grey literature can be challenging despite greater access through the Internet, search engines and online bibliographic databases. There are a number of publications that list sources for finding grey literature in systematic reviews. However, there is scant information about how searches for grey literature are executed and how it is included in the review process. This level of detail is important to ensure that reviews follow explicit methodology to be systematic, transparent and reproducible. The purpose of this paper is to provide a detailed account of one systematic review team's experience in searching for grey literature and including it throughout the review. We provide a brief overview of grey literature before describing our search and review approach. We also discuss the benefits and challenges of including grey literature in our systematic review, as well as the strengths and limitations to our approach. Detailed information about incorporating grey literature in reviews is important in advancing methodology as review teams adapt and build upon the approaches described. Copyright © 2013 John Wiley & Sons, Ltd.

The Climate Adaptation Frontier

DOE Office of Scientific and Technical Information (OSTI.GOV)

Preston, Benjamin L

2013-01-01

Climate adaptation has emerged as a mainstream risk management strategy for assisting in maintaining socio-ecological systems within the boundaries of a safe operating space. Yet, there are limits to the ability of systems to adapt. Here, we introduce the concept of an adaptation frontier , which is defined as a socio-ecological system s transitional adaptive operating space between safe and unsafe domains. A number of driving forces are responsible for determining the sustainability of systems on the frontier. These include path dependence, adaptation/development deficits, values conflicts and discounting of future loss and damage. The cumulative implications of these driving forcesmore » are highly uncertain. Nevertheless, the fact that a broad range of systems already persist at the edge of their frontiers suggests a high likelihood that some limits will eventually be exceeded. The resulting system transformation is likely to manifest as anticipatory modification of management objectives or loss and damage. These outcomes vary significantly with respect to their ethical implications. Successful navigation of the adaptation frontier will necessitate new paradigms of risk governance to elicit knowledge that encourages reflexive reevaluation of societal values that enable or constrain sustainability.« less

The influence of artificial scotomas on eye movements during visual search.

PubMed

Cornelissen, Frans W; Bruin, Klaas J; Kooijman, Aart C

2005-01-01

Fixation durations are normally adapted to the difficulty of the foveal analysis task. We examine to what extent artificial central and peripheral visual field defects interfere with this adaptation process. Subjects performed a visual search task while their eye movements were registered. The latter were used to drive a real-time gaze-dependent display that was used to create artificial central and peripheral visual field defects. Recorded eye movements were used to determine saccadic amplitude, number of fixations, fixation durations, return saccades, and changes in saccade direction. For central defects, although fixation duration increased with the size of the absolute central scotoma, this increase was too small to keep recognition performance optimal, evident from an associated increase in the rate of return saccades. Providing a relatively small amount of visual information in the central scotoma did substantially reduce subjects' search times but not their fixation durations. Surprisingly, reducing the size of the tunnel also prolonged fixation duration for peripheral defects. This manipulation also decreased the rate of return saccades, suggesting that the fixations were prolonged beyond the duration required by the foveal task. Although we find that adaptation of fixation duration to task difficulty clearly occurs in the presence of artificial scotomas, we also find that such field defects may render the adaptation suboptimal for the task at hand. Thus, visual field defects may not only hinder vision by limiting what the subject sees of the environment but also by limiting the visual system's ability to program efficient eye movements. We speculate this is because of how visual field defects bias the balance between saccade generation and fixation stabilization.

Information search and decision making: effects of age and complexity on strategy use.

PubMed

Queen, Tara L; Hess, Thomas M; Ennis, Gilda E; Dowd, Keith; Grühn, Daniel

2012-12-01

The impact of task complexity on information search strategy and decision quality was examined in a sample of 135 young, middle-aged, and older adults. We were particularly interested in the competing roles of fluid cognitive ability and domain knowledge and experience, with the former being a negative influence and the latter being a positive influence on older adults' performance. Participants utilized 2 decision matrices, which varied in complexity, regarding a consumer purchase. Using process tracing software and an algorithm developed to assess decision strategy, we recorded search behavior, strategy selection, and final decision. Contrary to expectations, older adults were not more likely than the younger age groups to engage in information-minimizing search behaviors in response to increases in task complexity. Similarly, adults of all ages used comparable decision strategies and adapted their strategies to the demands of the task. We also examined decision outcomes in relation to participants' preferences. Overall, it seems that older adults utilize simpler sets of information primarily reflecting the most valued attributes in making their choice. The results of this study suggest that older adults are adaptive in their approach to decision making and that this ability may benefit from accrued knowledge and experience. 2013 APA, all rights reserved

Application of adaptive cluster sampling to low-density populations of freshwater mussels

USGS Publications Warehouse

Smith, D.R.; Villella, R.F.; Lemarie, D.P.

2003-01-01

Freshwater mussels appear to be promising candidates for adaptive cluster sampling because they are benthic macroinvertebrates that cluster spatially and are frequently found at low densities. We applied adaptive cluster sampling to estimate density of freshwater mussels at 24 sites along the Cacapon River, WV, where a preliminary timed search indicated that mussels were present at low density. Adaptive cluster sampling increased yield of individual mussels and detection of uncommon species; however, it did not improve precision of density estimates. Because finding uncommon species, collecting individuals of those species, and estimating their densities are important conservation activities, additional research is warranted on application of adaptive cluster sampling to freshwater mussels. However, at this time we do not recommend routine application of adaptive cluster sampling to freshwater mussel populations. The ultimate, and currently unanswered, question is how to tell when adaptive cluster sampling should be used, i.e., when is a population sufficiently rare and clustered for adaptive cluster sampling to be efficient and practical? A cost-effective procedure needs to be developed to identify biological populations for which adaptive cluster sampling is appropriate.

Individual differences in BEV drivers' range stress during first encounter of a critical range situation.

PubMed

Franke, Thomas; Rauh, Nadine; Krems, Josef F

2016-11-01

It is commonly held that range anxiety, in the form of experienced range stress, constitutes a usage barrier, particularly during the early period of battery electric vehicle (BEV) usage. To better understand factors that play a role in range stress during this critical period of adaptation to limited-range mobility, we examined individual differences in experienced range stress in the context of a critical range situation. In a field experiment, 74 participants drove a BEV on a 94-km round trip, which was tailored to lead to a critical range situation (i.e., small available range safety buffer). Higher route familiarity, trust in the range estimation system, system knowledge, subjective range competence, and internal control beliefs in dealing with technology were clearly related to lower experienced range stress; emotional stability (i.e., low neuroticism) was partly related to lower range stress. These results can inform strategies aimed at reducing range stress during early BEV usage, as well as contribute to a better understanding of factors that drive user experience in low-resource systems, which is a key topic in the field of green ergonomics. Copyright © 2015 Elsevier Ltd. All rights reserved.

Search for Lorentz Violation in a Short-Range Gravity Experiment

NASA Astrophysics Data System (ADS)

Bennett, D.; Skavysh, V.; Long, J.

2011-12-01

An experimental test of the Newtonian inverse square law at short range has been used to set limits on Lorentz violation in the pure gravity sector of the Standard-Model Extension. On account of the planar test mass geometry, nominally null with respect to 1/r2 forces, the limits derived for the SME coefficients of Lorentz violation are on the order bar sJK ˜ 104 .

Directed evolution of adaptive traits

USDA-ARS?s Scientific Manuscript database

As a species, switchgrass is adapted to an amazingly broad range of environments, spanning hardiness zones ranging from HZ3 to HZ9 (Canada to Mexico), from the mid-grass prairie to the Atlantic Seaboard, from sandy soils to heavy clay soils, from acid to alkaline soils, and from wetland to dryland h...

Beyond Adapting to Climate Change: Embedding Adaptation in Responses to Multiple Threats and Stresses

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilbanks, Thomas J; Kates, Dr. Robert W.

2010-01-01

Climate change impacts are already being experienced in every region of the United States and every part of the world most severely in Arctic regions and adaptation is needed now. Although climate change adaptation research is still in its infancy, significant adaptation planning in the United States has already begun in a number of localities. This article seeks to broaden the adaptation effort by integrating it with broader frameworks of hazards research, sustainability science, and community and regional resilience. To extend the range of experience, we draw from ongoing case studies in the Southeastern United States and the environmental historymore » of New Orleans to consider the multiple threats and stresses that all communities and regions experience. Embedding climate adaptation in responses to multiple threats and stresses helps us to understand climate change impacts, themselves often products of multiple stresses, to achieve community acceptance of needed adaptations as co-benefits of addressing multiple threats, and to mainstream the process of climate adaptation through the larger envelope of social relationships, communication channels, and broad-based awareness of needs for risk management that accompany community resilience.« less

Multipath search coding of stationary signals with applications to speech

NASA Astrophysics Data System (ADS)

Fehn, H. G.; Noll, P.

1982-04-01

This paper deals with the application of multipath search coding (MSC) concepts to the coding of stationary memoryless and correlated sources, and of speech signals, at a rate of one bit per sample. Use is made of three MSC classes: (1) codebook coding, or vector quantization, (2) tree coding, and (3) trellis coding. This paper explains the performances of these coders and compares them both with those of conventional coders and with rate-distortion bounds. The potentials of MSC coding strategies are demonstrated by illustrations. The paper reports also on results of MSC coding of speech, where both the strategy of adaptive quantization and of adaptive prediction were included in coder design.

Biochemical adaptation to ocean acidification.

PubMed

Stillman, Jonathon H; Paganini, Adam W

2015-06-01

The change in oceanic carbonate chemistry due to increased atmospheric PCO2  has caused pH to decline in marine surface waters, a phenomenon known as ocean acidification (OA). The effects of OA on organisms have been shown to be widespread among diverse taxa from a wide range of habitats. The majority of studies of organismal response to OA are in short-term exposures to future levels of PCO2 . From such studies, much information has been gathered on plastic responses organisms may make in the future that are beneficial or harmful to fitness. Relatively few studies have examined whether organisms can adapt to negative-fitness consequences of plastic responses to OA. We outline major approaches that have been used to study the adaptive potential for organisms to OA, which include comparative studies and experimental evolution. Organisms that inhabit a range of pH environments (e.g. pH gradients at volcanic CO2 seeps or in upwelling zones) have great potential for studies that identify adaptive shifts that have occurred through evolution. Comparative studies have advanced our understanding of adaptation to OA by linking whole-organism responses with cellular mechanisms. Such optimization of function provides a link between genetic variation and adaptive evolution in tuning optimal function of rate-limiting cellular processes in different pH conditions. For example, in experimental evolution studies of organisms with short generation times (e.g. phytoplankton), hundreds of generations of growth under future conditions has resulted in fixed differences in gene expression related to acid-base regulation. However, biochemical mechanisms for adaptive responses to OA have yet to be fully characterized, and are likely to be more complex than simply changes in gene expression or protein modification. Finally, we present a hypothesis regarding an unexplored area for biochemical adaptation to ocean acidification. In this hypothesis, proteins and membranes exposed to the

Search for the optimal diet.

PubMed

Mullin, Gerard E

2010-12-01

Since the beginning of time, we have been searching for diets that satisfy our palates while simultaneously optimizing health and well-being. Every year, there are hundreds of new diet books on the market that make a wide range of promises but rarely deliver. Unfortunately, consumers are gullible and believe much of the marketing hype because they are desperately seeking ways to maximize their health. As a result, they continue to purchase these diet books, sending many of them all the way to the bestseller list. Because many of these meal plans are not sustainable and are questionable in their approaches, the consumer is ultimately left to continue searching, only able to choose from the newest "fad" promoted by publicists rather than being grounded in science. Thus, the search for the optimal diet continues to be the "holy grail" for many of us today, presenting a challenge for nutritionists and practitioners to provide sound advice to consumers.

Multimedia explorer: image database, image proxy-server and search-engine.

PubMed

Frankewitsch, T; Prokosch, U

1999-01-01

Multimedia plays a major role in medicine. Databases containing images, movies or other types of multimedia objects are increasing in number, especially on the WWW. However, no good retrieval mechanism or search engine currently exists to efficiently track down such multimedia sources in the vast of information provided by the WWW. Secondly, the tools for searching databases are usually not adapted to the properties of images. HTML pages do not allow complex searches. Therefore establishing a more comfortable retrieval involves the use of a higher programming level like JAVA. With this platform independent language it is possible to create extensions to commonly used web browsers. These applets offer a graphical user interface for high level navigation. We implemented a database using JAVA objects as the primary storage container which are then stored by a JAVA controlled ORACLE8 database. Navigation depends on a structured vocabulary enhanced by a semantic network. With this approach multimedia objects can be encapsulated within a logical module for quick data retrieval.

Interrupted Visual Searches Reveal Volatile Search Memory

ERIC Educational Resources Information Center

Shen, Y. Jeremy; Jiang, Yuhong V.

2006-01-01

This study investigated memory from interrupted visual searches. Participants conducted a change detection search task on polygons overlaid on scenes. Search was interrupted by various disruptions, including unfilled delay, passive viewing of other scenes, and additional search on new displays. Results showed that performance was unaffected by…

In Search of the Unifying Principles of Psychotherapy: Conceptual, Empirical, and Clinical Convergence

ERIC Educational Resources Information Center

Magnavita, Jeffrey J.

2006-01-01

The search for the principles of unified psychotherapy is an important stage in the advancement of the field. Converging evidence from various streams of clinical science allows the identification of some of the major domains of human functioning, adaptation, and dysfunction. These principles, supported by animal modeling, neuroscience, and…

Experimental Forests and climate change: views of long-term employees on ecological change and the role of Experimental Forests and Ranges in understanding and adapting to climate change

Treesearch

Laurie Yung; Mason Bradbury; Daniel R. Williams

2012-01-01

In this project, we examined the views of 21 long-term employees on climate change in 14 Rocky Mountain Research Station Experimental Forests and Ranges (EFRs). EFRs were described by employees as uniquely positioned to advance knowledge of climate change impacts and adaptation strategies due to the research integrity they provide for long-term studies, the ability to...

Adaptive functional systems: learning with chaos.

PubMed

Komarov, M A; Osipov, G V; Burtsev, M S

2010-12-01

We propose a new model of adaptive behavior that combines a winnerless competition principle and chaos to learn new functional systems. The model consists of a complex network of nonlinear dynamical elements producing sequences of goal-directed actions. Each element describes dynamics and activity of the functional system which is supposed to be a distributed set of interacting physiological elements such as nerve or muscle that cooperates to obtain certain goal at the level of the whole organism. During "normal" behavior, the dynamics of the system follows heteroclinic channels, but in the novel situation chaotic search is activated and a new channel leading to the target state is gradually created simulating the process of learning. The model was tested in single and multigoal environments and had demonstrated a good potential for generation of new adaptations. © 2010 American Institute of Physics.

Search prefilters to assist in library searching of infrared spectra of automotive clear coats.

PubMed

Lavine, Barry K; Fasasi, Ayuba; Mirjankar, Nikhil; White, Collin; Sandercock, Mark

2015-01-01

Clear coat searches of the infrared (IR) spectral library of the paint data query (PDQ) forensic database often generate an unusable number of hits that span multiple manufacturers, assembly plants, and years. To improve the accuracy of the hit list, pattern recognition methods have been used to develop search prefilters (i.e., principal component models) that differentiate between similar but non-identical IR spectra of clear coats on the basis of manufacturer (e.g., General Motors, Ford, Chrysler) or assembly plant. A two step procedure to develop these search prefilters was employed. First, the discrete wavelet transform was used to decompose each IR spectrum into wavelet coefficients to enhance subtle but significant features in the spectral data. Second, a genetic algorithm for IR spectral pattern recognition was employed to identify wavelet coefficients characteristic of the manufacturer or assembly plant of the vehicle. Even in challenging trials where the paint samples evaluated were all from the same manufacturer (General Motors) within a limited production year range (2000-2006), the respective assembly plant of the vehicle was correctly identified. Search prefilters to identify assembly plants were successfully validated using 10 blind samples provided by the Royal Canadian Mounted Police (RCMP) as part of a study to populate PDQ to current production years, whereas the search prefilter to discriminate among automobile manufacturers was successfully validated using IR spectra obtained directly from the PDQ database. Copyright © 2014 Elsevier B.V. All rights reserved.

Validity and reliability of the Diagnostic Adaptive Behaviour Scale.

PubMed

Tassé, M J; Schalock, R L; Balboni, G; Spreat, S; Navas, P

2016-01-01

The Diagnostic Adaptive Behaviour Scale (DABS) is a new standardised adaptive behaviour measure that provides information for evaluating limitations in adaptive behaviour for the purpose of determining a diagnosis of intellectual disability. This article presents validity evidence and reliability data for the DABS. Validity evidence was based on comparing DABS scores with scores obtained on the Vineland Adaptive Behaviour Scale, second edition. The stability of the test scores was measured using a test and retest, and inter-rater reliability was assessed by computing the inter-respondent concordance. The DABS convergent validity coefficients ranged from 0.70 to 0.84, while the test-retest reliability coefficients ranged from 0.78 to 0.95, and the inter-rater concordance as measured by intraclass correlation coefficients ranged from 0.61 to 0.87. All obtained validity and reliability indicators were strong and comparable with the validity and reliability coefficients of the most commonly used adaptive behaviour instruments. These results and the advantages of the DABS for clinician and researcher use are discussed. © 2015 MENCAP and International Association of the Scientific Study of Intellectual and Developmental Disabilities and John Wiley & Sons Ltd.

43 CFR 46.145 - Using adaptive management.

Code of Federal Regulations, 2011 CFR

2011-10-01

... implementation decisions. The NEPA analysis conducted in the context of an adaptive management approach should identify the range of management options that may be taken in response to the results of monitoring and should analyze the effects of such options. The environmental effects of any adaptive management strategy...

43 CFR 46.145 - Using adaptive management.

Code of Federal Regulations, 2010 CFR

2010-10-01

... implementation decisions. The NEPA analysis conducted in the context of an adaptive management approach should identify the range of management options that may be taken in response to the results of monitoring and should analyze the effects of such options. The environmental effects of any adaptive management strategy...

Adaptive hybrid optimal quantum control for imprecisely characterized systems.

PubMed

Egger, D J; Wilhelm, F K

2014-06-20

Optimal quantum control theory carries a huge promise for quantum technology. Its experimental application, however, is often hindered by imprecise knowledge of the input variables, the quantum system's parameters. We show how to overcome this by adaptive hybrid optimal control, using a protocol named Ad-HOC. This protocol combines open- and closed-loop optimal control by first performing a gradient search towards a near-optimal control pulse and then an experimental fidelity estimation with a gradient-free method. For typical settings in solid-state quantum information processing, adaptive hybrid optimal control enhances gate fidelities by an order of magnitude, making optimal control theory applicable and useful.

VFS interjudge reliability using a free and directed search.

PubMed

Bryant, Karen N; Finnegan, Eileen; Berbaum, Kevin

2012-03-01

Reports in the literature suggest that clinicians demonstrate poor reliability in rating videofluoroscopic swallow (VFS) variables. Contemporary perception theories suggest that the methods used in VFS reliability studies constrain subjects to make judgments in an abnormal way. The purpose of this study was to determine whether a directed search or a free search approach to rating swallow studies results in better interjudge reliability. Ten speech pathologists served as judges. Five clinical judges were assigned to the directed search group (use checklist) and five to the free search group (unguided observations). Clinical judges interpreted 20 VFS examinations of swallowing. Interjudge reliability of ratings of dysphagia severity, affected stage of swallow, dysphagia symptoms, and attributes identified by clinical judges using a directed search was compared with that using a free search approach. Interjudge reliability for rating the presence of aspiration and penetration was significantly better using a free search ("substantial" to "almost perfect" agreement) compared to a directed search ("moderate" agreement). Reliability of dysphagia severity ratings ranged from "moderate" to "almost perfect" agreement for both methods of search. Reliability for reporting all other symptoms and attributes of dysphagia was variable and was not significantly different between the groups.

Hand-held microwave search detector

NASA Astrophysics Data System (ADS)

Daniels, David J.; Philippakis, Mike

2005-05-01

This paper describes the further development of a patented, novel, low cost, microwave search detector using noise radar technology operating in the 27-40GHz range of frequencies, initially reported in SPIE 2004. Initial experiments have shown that plastic explosives, ceramics and plastic material hidden on the body can be detected with the system. This paper considers the basic physics of the technique and reports on the development of a initial prototype system for hand search of suspects and addresses the work carried out on optimisation of PD and FAR. The radar uses a novel lens system and the design and modelling of this for optimum depth of field of focus will be reported.

Fast range estimation based on active range-gated imaging for coastal surveillance

NASA Astrophysics Data System (ADS)

Kong, Qingshan; Cao, Yinan; Wang, Xinwei; Tong, Youwan; Zhou, Yan; Liu, Yuliang

2012-11-01

Coastal surveillance is very important because it is useful for search and rescue, illegal immigration, or harbor security and so on. Furthermore, range estimation is critical for precisely detecting the target. Range-gated laser imaging sensor is suitable for high accuracy range especially in night and no moonlight. Generally, before detecting the target, it is necessary to change delay time till the target is captured. There are two operating mode for range-gated imaging sensor, one is passive imaging mode, and the other is gate viewing mode. Firstly, the sensor is passive mode, only capturing scenes by ICCD, once the object appears in the range of monitoring area, we can obtain the course range of the target according to the imaging geometry/projecting transform. Then, the sensor is gate viewing mode, applying micro second laser pulses and sensor gate width, we can get the range of targets by at least two continuous images with trapezoid-shaped range intensity profile. This technique enables super-resolution depth mapping with a reduction of imaging data processing. Based on the first step, we can calculate the rough value and quickly fix delay time which the target is detected. This technique has overcome the depth resolution limitation for 3D active imaging and enables super-resolution depth mapping with a reduction of imaging data processing. By the two steps, we can quickly obtain the distance between the object and sensor.

Adaptive-randomised self-calibration of electro-mechanical shutters for space imaging

NASA Astrophysics Data System (ADS)

De Cecco, Mariolino; Debei, Stefano; Zaccariotto, Mirco; Pertile, Marco

2006-11-01

This work describes the self-calibration of a high-precision open-loop mechanism. The self-calibration method is applied to a mechanical shutter for space applications, which was launched onboard the ESA-ROSETTA mission (launch: 2 March 2004). It is based on an adaptive 'model reference' and a 'randomised' search method which may be generalised to applications in which high performance and functionality are strongly interconnected. The method makes use of an adaptive 'model-reference' control approach [K.J. Astrom, B. Wittenmark, On self-tuning regulators Automatica 9 (1973) 185-199 [16]; K.J. Astrom, Theory and application of adaptive control, in: Proceedings of the Eighth IFAC World Conference, Kyoto, Japan, 1981 [17]; D.E. Seborg, S.L. Shah, T.F. Edgar, Adaptive control strategies for process control, AIChE Journal 6(32) (1986) 881-895 [18

Adaptive Vibration Reduction Controls for a Cryocooler With a Passive Balancer

NASA Technical Reports Server (NTRS)

Kopasakis, George; Cairelli, James E.; Traylor, Ryan M.

2001-01-01

In this paper an adaptive vibration reduction control (AVRC) design is described for a Stirling cryocooler combined with a passive balancer. The AVRC design was based on a mass-spring model of the cooler and balancer, and the AVRC algorithm described in this paper was based on an adaptive binary search. Results are shown comparing the baseline uncontrolled cooler with no balancer, the cooler with the balancer, and, finally, the cooler with the balancer and the AVRC. The comparison shows that it may be possible to meet stringent vibration reduction requirements without an active balancer.

A flexible motif search technique based on generalized profiles.

PubMed

Bucher, P; Karplus, K; Moeri, N; Hofmann, K

1996-03-01

A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety of motif descriptors implemented in other methods, including regular expression-like patterns, weight matrices, previously used profiles, and certain types of hidden Markov models (HMMs). The relationship between generalized profiles and other biomolecular motif descriptors is analyzed in detail, with special attention to HMMs. Generalized profiles are shown to be equivalent to a particular class of HMMs, and conversion procedures in both directions are given. The conversion procedures provide an interpretation for local alignment in the framework of stochastic models, allowing for clear, simple significance tests. A mathematical statement of the motif search problem defines the new method exactly without linking it to a specific algorithmic solution. Part of the definition includes a new definition of disjointness of alignments.

On Searching Available Channels with Asynchronous MAC-Layer Spectrum Sensing

NASA Astrophysics Data System (ADS)

Jiang, Chunxiao; Ma, Xin; Chen, Canfeng; Ma, Jian; Ren, Yong

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

Choosing and using methodological search filters: searchers' views.

PubMed

Beale, Sophie; Duffy, Steven; Glanville, Julie; Lefebvre, Carol; Wright, Dianne; McCool, Rachael; Varley, Danielle; Boachie, Charles; Fraser, Cynthia; Harbour, Jenny; Smith, Lynne

2014-06-01

Search filters or hedges are search strategies developed to assist information specialists and librarians to retrieve different types of evidence from bibliographic databases. The objectives of this project were to learn about searchers' filter use, how searchers choose search filters and what information they would like to receive to inform their choices. Interviews with information specialists working in, or for, the National Institute for Health and Care Excellence (NICE) were conducted. An online questionnaire survey was also conducted and advertised via a range of email lists. Sixteen interviews were undertaken and 90 completed questionnaires were received. The use of search filters tends to be linked to reducing a large amount of literature, introducing focus and assisting with searches that are based on a single study type. Respondents use numerous ways to identify search filters and can find choosing between different filters problematic because of knowledge gaps and lack of time. Search filters are used mainly for reducing large result sets (introducing focus) and assisting with searches focused on a single study type. Features that would help with choosing filters include making information about filters less technical, offering ratings and providing more detail about filter validation strategies and filter provenance. © 2014 The authors. Health Information and Libraries Journal © 2014 Health Libraries Group.

Public Health Adaptation to Climate Change in OECD Countries.

PubMed

Austin, Stephanie E; Biesbroek, Robbert; Berrang-Ford, Lea; Ford, James D; Parker, Stephen; Fleury, Manon D

2016-09-07

Climate change is a major challenge facing public health. National governments play a key role in public health adaptation to climate change, but there are competing views on what responsibilities and obligations this will-or should-include in different nations. This study aims to: (1) examine how national-level public health adaptation is occurring in Organization for Economic Cooperation and Development (OECD) countries; (2) examine the roles national governments are taking in public health adaptation; and (3) critically appraise three key governance dimensions of national-level health adaptation-cross-sectoral collaboration, vertical coordination and national health adaptation planning-and identify practical examples suited to different contexts. We systematically reviewed publicly available public health adaptation to climate change documents and webpages by national governments in ten OECD countries using systematic web searches, assessment of self-reporting, and content analysis. Our findings suggest national governments are primarily addressing infectious disease and heat-related risks posed by climate change, typically emphasizing capacity building or information-based groundwork initiatives. We find national governments are taking a variety of approaches to public health adaptation to climate change that do not follow expected convergence and divergence by governance structure. We discuss practical options for incorporating cross-sectoral collaboration, vertical coordination and national health adaptation planning into a variety of contexts and identify leaders national governments can look to to inform their public health adaptation planning. Following the adoption of the Paris Agreement and subsequent increased momentum for adaptation, research tracking adaptation is needed to define what health adaptation looks like in practice, reveal insights that can be taken up across states and sectors, and ensure policy orientated learning.

Addressing uncertainty in adaptation planning for agriculture.

PubMed

Vermeulen, Sonja J; Challinor, Andrew J; Thornton, Philip K; Campbell, Bruce M; Eriyagama, Nishadi; Vervoort, Joost M; Kinyangi, James; Jarvis, Andy; Läderach, Peter; Ramirez-Villegas, Julian; Nicklin, Kathryn J; Hawkins, Ed; Smith, Daniel R

2013-05-21

We present a framework for prioritizing adaptation approaches at a range of timeframes. The framework is illustrated by four case studies from developing countries, each with associated characterization of uncertainty. Two cases on near-term adaptation planning in Sri Lanka and on stakeholder scenario exercises in East Africa show how the relative utility of capacity vs. impact approaches to adaptation planning differ with level of uncertainty and associated lead time. An additional two cases demonstrate that it is possible to identify uncertainties that are relevant to decision making in specific timeframes and circumstances. The case on coffee in Latin America identifies altitudinal thresholds at which incremental vs. transformative adaptation pathways are robust options. The final case uses three crop-climate simulation studies to demonstrate how uncertainty can be characterized at different time horizons to discriminate where robust adaptation options are possible. We find that impact approaches, which use predictive models, are increasingly useful over longer lead times and at higher levels of greenhouse gas emissions. We also find that extreme events are important in determining predictability across a broad range of timescales. The results demonstrate the potential for robust knowledge and actions in the face of uncertainty.

Addressing uncertainty in adaptation planning for agriculture

PubMed Central

Vermeulen, Sonja J.; Challinor, Andrew J.; Thornton, Philip K.; Campbell, Bruce M.; Eriyagama, Nishadi; Vervoort, Joost M.; Kinyangi, James; Jarvis, Andy; Läderach, Peter; Ramirez-Villegas, Julian; Nicklin, Kathryn J.; Hawkins, Ed; Smith, Daniel R.

2013-01-01

We present a framework for prioritizing adaptation approaches at a range of timeframes. The framework is illustrated by four case studies from developing countries, each with associated characterization of uncertainty. Two cases on near-term adaptation planning in Sri Lanka and on stakeholder scenario exercises in East Africa show how the relative utility of capacity vs. impact approaches to adaptation planning differ with level of uncertainty and associated lead time. An additional two cases demonstrate that it is possible to identify uncertainties that are relevant to decision making in specific timeframes and circumstances. The case on coffee in Latin America identifies altitudinal thresholds at which incremental vs. transformative adaptation pathways are robust options. The final case uses three crop–climate simulation studies to demonstrate how uncertainty can be characterized at different time horizons to discriminate where robust adaptation options are possible. We find that impact approaches, which use predictive models, are increasingly useful over longer lead times and at higher levels of greenhouse gas emissions. We also find that extreme events are important in determining predictability across a broad range of timescales. The results demonstrate the potential for robust knowledge and actions in the face of uncertainty. PMID:23674681

Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.

PubMed

Mavrovouniotis, Michalis; Muller, Felipe M; Yang, Shengxiang

2016-06-13

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can significantly improve the performance of ACO. In this paper, a memetic ACO algorithm, where a local search operator (called unstring and string) is integrated into ACO, is proposed to address DTSPs. The best solution from ACO is passed to the local search operator, which removes and inserts cities in such a way that improves the solution quality. The proposed memetic ACO algorithm is designed to address both symmetric and asymmetric DTSPs. The experimental results show the efficiency of the proposed memetic algorithm for addressing DTSPs in comparison with other state-of-the-art algorithms.

All-sky search for short gravitational-wave bursts in the first Advanced LIGO run

NASA Astrophysics Data System (ADS)

Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Allen, B.; Allocca, A.; Altin, P. A.; Ananyeva, A.; Anderson, S. B.; Anderson, W. G.; Appert, S.; Arai, K.; Araya, M. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Avila-Alvarez, A.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Beer, C.; Bejger, M.; Belahcene, I.; Belgin, M.; Bell, A. S.; Berger, B. K.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Billman, C. R.; Birch, J.; Birney, R.; Birnholtz, O.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blackman, J.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Boer, M.; Bogaert, G.; Bohe, A.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Broida, J. E.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Brunett, S.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T. A.; Calloni, E.; Camp, J. B.; Canepa, M.; Cannon, K. C.; Cao, H.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Cheeseboro, B. D.; Chen, H. Y.; Chen, Y.; Cheng, H.-P.; Chincarini, A.; Chiummo, A.; Chmiel, T.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, A. J. K.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Cocchieri, C.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M.; Conti, L.; Cooper, S. J.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Covas, P. B.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cullen, T. J.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dasgupta, A.; Da Silva Costa, C. F.; Dattilo, V.; Dave, I.; Davier, M.; Davies, G. S.; Davis, D.; Daw, E. J.; Day, B.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Devenson, J.; Devine, R. C.; Dhurandhar, S.; Díaz, M. C.; Di Fiore, L.; Di Giovanni, M.; Di Girolamo, T.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Doctor, Z.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dorrington, I.; Douglas, R.; Dovale Álvarez, M.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Eisenstein, R. A.; Essick, R. C.; Etienne, Z.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Farinon, S.; Farr, B.; Farr, W. M.; Fauchon-Jones, E. J.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Fernández Galiana, A.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fong, H.; Forsyth, S. S.; Fournier, J.-D.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fries, E. M.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H.; Gadre, B. U.; Gaebel, S. M.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gaur, G.; Gayathri, V.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghonge, S.; Ghosh, Abhirup; Ghosh, Archisman; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Grado, A.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Healy, J.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Henry, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hofman, D.; Holt, K.; Holz, D. E.; Hopkins, P.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; Junker, J.; Kalaghatgi, C. V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Karvinen, K. S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kéfélian, F.; Keitel, D.; Kelley, D. B.; Kennedy, R.; Key, J. S.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, Chunglee; Kim, J. C.; Kim, Whansun; Kim, W.; Kim, Y.-M.; Kimbrell, S. J.; King, E. J.; King, P. J.; Kirchhoff, R.; Kissel, J. S.; Klein, B.; Kleybolte, L.; Klimenko, S.; Koch, P.; Koehlenbeck, S. M.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Krämer, C.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lang, R. N.; Lange, J.; Lantz, B.; Lanza, R. K.; Lartaux-Vollard, A.; Lasky, P. D.; Laxen, M.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lehmann, J.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Liu, J.; Lockerbie, N. A.; Lombardi, A. L.; London, L. T.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lovelace, G.; Lück, H.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macfoy, S.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martynov, D. V.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Mastrogiovanni, S.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGrath, C.; McGuire, S. C.; McIntyre, G.; McIver, J.; McManus, D. J.; McRae, T.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mendoza-Gandara, D.; Mercer, R. A.; Merilh, E. L.; Merzougui, M.; Meshkov, S.; Messenger, C.; Messick, C.; Metzdorff, R.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, A. L.; Miller, A.; Miller, B. B.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Muniz, E. A. M.; Murray, P. G.; Mytidis, A.; Napier, K.; Nardecchia, I.; Naticchioni, L.; Nelemans, G.; Nelson, T. J. N.; Neri, M.; Nery, M.; Neunzert, A.; Newport, J. M.; Newton, G.; Nguyen, T. T.; Nissanke, S.; Nitz, A.; Noack, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pace, A. E.; Page, J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perez, C. J.; Perreca, A.; Perri, L. M.; Pfeiffer, H. P.; Phelps, M.; Piccinni, O. J.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poe, M.; Poggiani, R.; Popolizio, P.; Post, A.; Powell, J.; Prasad, J.; Pratt, J. W. W.; Predoi, V.; Prestegard, T.; Prijatelj, M.; Principe, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L. G.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Qiu, S.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rajan, C.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Rhoades, E.; Ricci, F.; Riles, K.; Rizzo, M.; Robertson, N. A.; Robie, R.; Robinet, F.; Rocchi, A.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Sakellariadou, M.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sampson, L. M.; Sanchez, E. J.; Sandberg, V.; Sanders, J. R.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Scheuer, J.; Schmidt, E.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Schwalbe, S. G.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Setyawati, Y.; Shaddock, D. A.; Shaffer, T. J.; Shahriar, M. S.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sieniawska, M.; Sigg, D.; Silva, A. D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, B.; Smith, J. R.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Spencer, A. P.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stevenson, S. P.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strigin, S. E.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sunil, S.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Taracchini, A.; Taylor, R.; Theeg, T.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thrane, E.; Tippens, T.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Toland, K.; Tomlinson, C.; Tonelli, M.; Tornasi, Z.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Trinastic, J.; Tringali, M. C.; Trozzo, L.; Tse, M.; Tso, R.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Varma, V.; Vass, S.; Vasúth, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Venugopalan, G.; Verkindt, D.; Vetrano, F.; Viceré, A.; Viets, A. D.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D. V.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Watchi, J.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Weßels, P.; Westphal, T.; Wette, K.; Whelan, J. T.; Whiting, B. F.; Whittle, C.; Williams, D.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wittel, H.; Woan, G.; Woehler, J.; Worden, J.; Wright, J. L.; Wu, D. S.; Wu, G.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, Hang; Yu, Haocun; Yvert, M.; ZadroŻny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, L.; Zhang, M.; Zhang, T.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, S. J.; Zhu, X. J.; Zucker, M. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

2017-02-01

We present the results from an all-sky search for short-duration gravitational waves in the data of the first run of the Advanced LIGO detectors between September 2015 and January 2016. The search algorithms use minimal assumptions on the signal morphology, so they are sensitive to a wide range of sources emitting gravitational waves. The analyses target transient signals with duration ranging from milliseconds to seconds over the frequency band of 32 to 4096 Hz. The first observed gravitational-wave event, GW150914, has been detected with high confidence in this search; the other known gravitational-wave event, GW151226, falls below the search's sensitivity. Besides GW150914, all of the search results are consistent with the expected rate of accidental noise coincidences. Finally, we estimate rate-density limits for a broad range of non-binary-black-hole transient gravitational-wave sources as a function of their gravitational radiation emission energy and their characteristic frequency. These rate-density upper limits are stricter than those previously published by an order of magnitude.

In search of an adaptive social-ecological approach to understanding a tropical city