Reconstruction techniques in supersymmetry searches in the ATLAS experiment

CERN Document Server

Gramstad, Eirik; The ATLAS collaboration

2018-01-01

Many supersymmetric scenarios feature final states with non-standard final state objects. The production of massive sparticles can lead to the production of boosted top quarks or vector bosons, high-pt b-jets. At the same time, transitions between nearly mass-degenerate sparticles can challenge the standard reconstruction because of the presence of very soft leptons or jets. The talk will review the application of innovative reconstruction techniques to supersymmetry searches in ATLAS.

Search Techniques for the Web of Things: A Taxonomy and Survey

Directory of Open Access Journals (Sweden)

Yuchao Zhou

2016-04-01

Full Text Available The Web of Things aims to make physical world objects and their data accessible through standard Web technologies to enable intelligent applications and sophisticated data analytics. Due to the amount and heterogeneity of the data, it is challenging to perform data analysis directly; especially when the data is captured from a large number of distributed sources. However, the size and scope of the data can be reduced and narrowed down with search techniques, so that only the most relevant and useful data items are selected according to the application requirements. Search is fundamental to the Web of Things while challenging by nature in this context, e.g., mobility of the objects, opportunistic presence and sensing, continuous data streams with changing spatial and temporal properties, efficient indexing for historical and real time data. The research community has developed numerous techniques and methods to tackle these problems as reported by a large body of literature in the last few years. A comprehensive investigation of the current and past studies is necessary to gain a clear view of the research landscape and to identify promising future directions. This survey reviews the state-of-the-art search methods for the Web of Things, which are classified according to three different viewpoints: basic principles, data/knowledge representation, and contents being searched. Experiences and lessons learned from the existing work and some EU research projects related to Web of Things are discussed, and an outlook to the future research is presented.

ONTOLOGY BASED MEANINGFUL SEARCH USING SEMANTIC WEB AND NATURAL LANGUAGE PROCESSING TECHNIQUES

Directory of Open Access Journals (Sweden)

K. Palaniammal

2013-10-01

Full Text Available The semantic web extends the current World Wide Web by adding facilities for the machine understood description of meaning. The ontology based search model is used to enhance efficiency and accuracy of information retrieval. Ontology is the core technology for the semantic web and this mechanism for representing formal and shared domain descriptions. In this paper, we proposed ontology based meaningful search using semantic web and Natural Language Processing (NLP techniques in the educational domain. First we build the educational ontology then we present the semantic search system. The search model consisting three parts which are embedding spell-check, finding synonyms using WordNet API and querying ontology using SPARQL language. The results are both sensitive to spell check and synonymous context. This paper provides more accurate results and the complete details for the selected field in a single page.

Applications of Modern Analysis Techniques in Searching back Ancient Art Ceramic Technologies

Directory of Open Access Journals (Sweden)

Nguyen Quang Liem

2011-12-01

Full Text Available This report highlights the promising applications of modern analysis techniques such as Scanning Electron Microsopy, X-ray fluorescence, X-ray diffraction, Raman scattering spectroscopy, and thermal expansion measurement in searching back the ancient art ceramics technologies.

Search for Chameleon Particles Using a Photon-Regeneration Technique

International Nuclear Information System (INIS)

Chou, A. S.; Wester, W.; Baumbaugh, A.; Irizarry-Valle, Y.; Mazur, P. O.; Steffen, J. H.; Tomlin, R.; Yang, X.; Yoo, J.; Gustafson, H. R.; Upadhye, A.; Weltman, A.

2009-01-01

We report the first results from the GammeV search for chameleon particles, which may be created via photon-photon interactions within a strong magnetic field. Chameleons are hypothesized scalar fields that could explain the dark energy problem. We implement a novel technique to create and trap the reflective particles within a jar and to detect them later via their afterglow as they slowly convert back into photons. These measurements provide the first experimental constraints on the couplings of chameleons to photons

Artificial intelligence search techniques for optimization of the cold source geometry

International Nuclear Information System (INIS)

Azmy, Y.Y.

1988-01-01

Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness which produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometrical shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape which is the unknown in such a study. We draw an analogy between this problem and a state space search, then we use a simple Artificial Intelligence (AI) search technique to determine the optimum cold source shape based on a two-group, r-z diffusion model. We implemented this AI design concept in the computer program AID which consists of two modules, a physical model module and a search module, which can be independently modified, improved, or made more sophisticated. 7 refs., 1 fig

Artificial intelligence search techniques for the optimization of cold source geometry

International Nuclear Information System (INIS)

Azmy, Y.Y.

1988-01-01

Most optimization studies of cold neutron sources have concentrated on the numerical prediction or experimental measurement of the cold moderator optimum thickness that produces the largest cold neutron leakage for a given thermal neutron source. Optimizing the geometric shape of the cold source, however, is a more difficult problem because the optimized quantity, the cold neutron leakage, is an implicit function of the shape, which is the unknown in such a study. An analogy is drawn between this problem and a state space search, then a simple artificial intelligence (AI) search technique is used to determine the optimum cold source shape based on a two-group, r-z diffusion model. This AI design concept was implemented in the computer program AID, which consists of two modules, a physical model module, and a search module, which can be independently modified, improved, or made more sophisticated

A SOUND SOURCE LOCALIZATION TECHNIQUE TO SUPPORT SEARCH AND RESCUE IN LOUD NOISE ENVIRONMENTS

Science.gov (United States)

Yoshinaga, Hiroshi; Mizutani, Koichi; Wakatsuki, Naoto

At some sites of earthquakes and other disasters, rescuers search for people buried under rubble by listening for the sounds which they make. Thus developing a technique to localize sound sources amidst loud noise will support such search and rescue operations. In this paper, we discuss an experiment performed to test an array signal processing technique which searches for unperceivable sound in loud noise environments. Two speakers simultaneously played a noise of a generator and a voice decreased by 20 dB (= 1/100 of power) from the generator noise at an outdoor space where cicadas were making noise. The sound signal was received by a horizontally set linear microphone array 1.05 m in length and consisting of 15 microphones. The direction and the distance of the voice were computed and the sound of the voice was extracted and played back as an audible sound by array signal processing.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Zhiwei Ye

2015-01-01

Full Text Available 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.

Search for Axionlike Particles Using a Variable-Baseline Photon-Regeneration Technique

International Nuclear Information System (INIS)

Chou, A. S.; Wester, W.; Baumbaugh, A.; Irizarry-Valle, Y.; Mazur, P. O.; Steffen, J. H.; Tomlin, R.; Yang, X.; Yoo, J.; Gustafson, H. R.

2008-01-01

We report the first results of the GammeV experiment, a search for milli-eV mass particles with axionlike couplings to two photons. The search is performed using a ''light shining through a wall'' technique where incident photons oscillate into new weakly interacting particles that are able to pass through the wall and subsequently regenerate back into detectable photons. The oscillation baseline of the apparatus is variable, thus allowing probes of different values of particle mass. We find no excess of events above background and are able to constrain the two-photon couplings of possible new scalar (pseudoscalar) particles to be less than 3.1x10 -7 GeV -1 (3.5x10 -7 GeV -1 ) in the limit of massless particles

A multi-variate discrimination technique based on range-searching

International Nuclear Information System (INIS)

Carli, T.; Koblitz, B.

2003-01-01

We present a fast and transparent multi-variate event classification technique, called PDE-RS, which is based on sampling the signal and background densities in a multi-dimensional phase space using range-searching. The employed algorithm is presented in detail and its behaviour is studied with simple toy examples representing basic patterns of problems often encountered in High Energy Physics data analyses. In addition an example relevant for the search for instanton-induced processes in deep-inelastic scattering at HERA is discussed. For all studied examples, the new presented method performs as good as artificial Neural Networks and has furthermore the advantage to need less computation time. This allows to carefully select the best combination of observables which optimally separate the signal and background and for which the simulations describe the data best. Moreover, the systematic and statistical uncertainties can be easily evaluated. The method is therefore a powerful tool to find a small number of signal events in the large data samples expected at future particle colliders

A Search for WIMP Dark Matter Using an Optimized Chi-square Technique on the Final Data from the Cryogenic Dark Matter Search Experiment (CDMS II)

Energy Technology Data Exchange (ETDEWEB)

Manungu Kiveni, Joseph [Syracuse Univ., NY (United States)

2012-12-01

This dissertation describes the results of a WIMP search using CDMS II data sets accumulated at the Soudan Underground Laboratory in Minnesota. Results from the original analysis of these data were published in 2009; two events were observed in the signal region with an expected leakage of 0.9 events. Further investigation revealed an issue with the ionization-pulse reconstruction algorithm leading to a software upgrade and a subsequent reanalysis of the data. As part of the reanalysis, I performed an advanced discrimination technique to better distinguish (potential) signal events from backgrounds using a 5-dimensional chi-square method. This dataanalysis technique combines the event information recorded for each WIMP-search event to derive a backgrounddiscrimination parameter capable of reducing the expected background to less than one event, while maintaining high efficiency for signal events. Furthermore, optimizing the cut positions of this 5-dimensional chi-square parameter for the 14 viable germanium detectors yields an improved expected sensitivity to WIMP interactions relative to previous CDMS results. This dissertation describes my improved (and optimized) discrimination technique and the results obtained from a blind application to the reanalyzed CDMS II WIMP-search data.

Bomb Threats and Bomb Search Techniques.

Science.gov (United States)

Department of the Treasury, Washington, DC.

This pamphlet explains how to be prepared and plan for bomb threats and describes procedures to follow once a call has been received. The content covers (1) preparation for bomb threats, (2) evacuation procedures, (3) room search methods, (4) procedures to follow once a bomb has been located, and (5) typical problems that search teams will…

Search engine optimization

OpenAIRE

Marolt, Klemen

2013-01-01

Search engine optimization techniques, often shortened to “SEO,” should lead to first positions in organic search results. Some optimization techniques do not change over time, yet still form the basis for SEO. However, as the Internet and web design evolves dynamically, new optimization techniques flourish and flop. Thus, we looked at the most important factors that can help to improve positioning in search results. It is important to emphasize that none of the techniques can guarantee high ...

An enhanced search methodology for special nuclear materials

International Nuclear Information System (INIS)

Carichner, S.

1996-06-01

This report is an overview of the first phase of work done to use data fusion to improve the search process for weaponizable radioactive materials. Various methods were examined to provide a system-level optimization to the problem. Data fusion signal- processing techniques using sensor counts and sensor position information with reasonable computation time showed an initial four- fold improvement in the overall search system performance compared to optimal processing without knowledge of sensor position. With the inclusion of data visualization techniques, a centralized search controller has access to information that improves the main search parameters: range, search time, and search confidence. The improvement is significant enough to justify the next phase of work which includes: adding neutron sensor data, investigating the position location system, and further tests and refinements of the system

Differential harmony search algorithm to optimize PWRs loading pattern

Energy Technology Data Exchange (ETDEWEB)

Poursalehi, N., E-mail: npsalehi@yahoo.com [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of); Zolfaghari, A.; Minuchehr, A. [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of)

2013-04-15

Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms.

Differential harmony search algorithm to optimize PWRs loading pattern

International Nuclear Information System (INIS)

Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.

2013-01-01

Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms

The search for neuroimaging biomarkers of Alzheimer's disease with advanced MRI techniques

International Nuclear Information System (INIS)

Li, Tie-Qiang; Wahlund, Lars-Olof

2011-01-01

The aim of this review is to examine the recent literature on using advanced magnetic resonance imaging (MRI) techniques for finding neuroimaging biomarkers that are sensitive to the detection of risks for Alzheimer's disease (AD). Since structural MRI techniques, such as brain structural volumetry and voxel based morphometry (VBM), have been widely used for AD studies and extensively reviewed, we will only briefly touch on the topics of volumetry and morphometry. The focus of the current review is about the more recent developments in the search for AD neuroimaging biomarkers with functional MRI (fMRI), resting-state functional connectivity MRI (fcMRI), diffusion tensor imaging (DTI), arterial spin-labeling (ASL), and magnetic resonance spectroscopy (MRS)

Search for free fractional electric charge elementary particles using an automated millikan oil drop technique

Science.gov (United States)

Halyo; Kim; Lee; Lee; Loomba; Perl

2000-03-20

We have carried out a direct search in bulk matter for free fractional electric charge elementary particles using the largest mass single sample ever studied-about 17.4 mg of silicone oil. The search used an improved and highly automated Millikan oil drop technique. No evidence for fractional charge particles was found. The concentration of particles with fractional charge more than 0. 16e ( e being the magnitude of the electron charge) from the nearest integer charge is less than 4.71x10(-22) particles per nucleon with 95% confidence.

Magnetic monopole search experiments

International Nuclear Information System (INIS)

Stone, J.L.

1986-01-01

Experimental searches for the elusive magnetic monopole have extended over 50 years -- ever since Dirac showed that the existence of isolated magnetic charges could account for the observation of quantized electric charge. Early searches for Dirac's monopole were hampered since there was no indication of the expected monopole mass, velocity, or origin in the theory. Consequently, numerous experiments searched more or less blindly for relativistic low mass monopoles in the cosmic rays and in particle collisions at high energy accelerators. In this paper, the author reviews briefly the monopole properties which are relevant for their detection and summarize current experimental efforts using induction, ionization/excitation, and catalysis techniques

Extension of instance search technique by geometric coding and quantization error compensation

OpenAIRE

García Del Molino, Ana

2013-01-01

[ANGLÈS] This PFC analyzes two ways of improving the video retrieval techniques for instance search problem. In one hand, "Pairing Interest Points for a better Signature using Sparse Detector's Spatial Information", allows the Bag-of-Words model to keep some spatial information. In the other, "Study of the Hamming Embedding Signature Symmetry in Video Retrieval" provides binary signatures that refine the matching based on visual words, and aims to find the best way of matching taking into acc...

Modernizing quantum annealing using local searches

International Nuclear Information System (INIS)

Chancellor, Nicholas

2017-01-01

I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm (QAA). Such protocols will have numerous advantages over simple quantum annealing. By using such searches the effect of problem mis-specification can be reduced, as only energy differences between the searched states will be relevant. The QAA is an analogue of simulated annealing, a classical numerical technique which has now been superseded. Hence, I explore two strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms. Specifically, I show how sequential calls to quantum annealers can be used to construct analogues of population annealing and parallel tempering which use quantum searches as subroutines. The techniques given here can be applied not only to optimization, but also to sampling. I examine the feasibility of these protocols on real devices and note that implementing such protocols should require minimal if any change to the current design of the flux qubit-based annealers by D-Wave Systems Inc. I further provide proof-of-principle numerical experiments based on quantum Monte Carlo that demonstrate simple examples of the discussed techniques. (paper)

Efficient protein structure search using indexing methods.

Science.gov (United States)

Kim, Sungchul; Sael, Lee; Yu, Hwanjo

2013-01-01

Understanding functions of proteins is one of the most important challenges in many studies of biological processes. The function of a protein can be predicted by analyzing the functions of structurally similar proteins, thus finding structurally similar proteins accurately and efficiently from a large set of proteins is crucial. A protein structure can be represented as a vector by 3D-Zernike Descriptor (3DZD) which compactly represents the surface shape of the protein tertiary structure. This simplified representation accelerates the searching process. However, computing the similarity of two protein structures is still computationally expensive, thus it is hard to efficiently process many simultaneous requests of structurally similar protein search. This paper proposes indexing techniques which substantially reduce the search time to find structurally similar proteins. In particular, we first exploit two indexing techniques, i.e., iDistance and iKernel, on the 3DZDs. After that, we extend the techniques to further improve the search speed for protein structures. The extended indexing techniques build and utilize an reduced index constructed from the first few attributes of 3DZDs of protein structures. To retrieve top-k similar structures, top-10 × k similar structures are first found using the reduced index, and top-k structures are selected among them. We also modify the indexing techniques to support θ-based nearest neighbor search, which returns data points less than θ to the query point. The results show that both iDistance and iKernel significantly enhance the searching speed. In top-k nearest neighbor search, the searching time is reduced 69.6%, 77%, 77.4% and 87.9%, respectively using iDistance, iKernel, the extended iDistance, and the extended iKernel. In θ-based nearest neighbor serach, the searching time is reduced 80%, 81%, 95.6% and 95.6% using iDistance, iKernel, the extended iDistance, and the extended iKernel, respectively.

IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

Science.gov (United States)

Fogle, F. R.

1994-01-01

IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

Background estimation techniques in searches for heavy resonances at CMS

CERN Document Server

Benato, Lisa

2017-01-01

Many Beyond Standard Model theories foresee the existence of heavy resonances (over 1 TeV) decaying into final states that include a high-energetic, boosted jet and charged leptons or neutrinos. In these very peculiar conditions, Monte Carlo predictions are not reliable enough to reproduce accurately the expected Standard Model background. A data-Monte Carlo hybrid approach (alpha method) has been successfully adopted since Run 1 in searches for heavy Higgs bosons performed by the CMS Collaboration. By taking advantage of data in signal-free control regions, determined exploiting the boosted jet substructure, predictions are extracted in the signal region. The alpha method and jet substructure techniques are described in detail, along with some recent results obtained with 2016 Run 2 data collected by the CMS detector.

Search method optimization technique for thermal design of high power RFQ structure

International Nuclear Information System (INIS)

Sharma, N.K.; Joshi, S.C.

2009-01-01

RRCAT has taken up the development of 3 MeV RFQ structure for the low energy part of 100 MeV H - ion injector linac. RFQ is a precision machined resonating structure designed for high rf duty factor. RFQ structural stability during high rf power operation is an important design issue. The thermal analysis of RFQ has been performed using ANSYS finite element analysis software and optimization of various parameters is attempted using Search Method optimization technique. It is an effective optimization technique for the systems governed by a large number of independent variables. The method involves examining a number of combinations of values of independent variables and drawing conclusions from the magnitude of the objective function at these combinations. In these methods there is a continuous improvement in the objective function throughout the course of the search and hence these methods are very efficient. The method has been employed in optimization of various parameters (called independent variables) of RFQ like cooling water flow rate, cooling water inlet temperatures, cavity thickness etc. involved in RFQ thermal design. The temperature rise within RFQ structure is the objective function during the thermal design. Using ANSYS Programming Development Language (APDL), various multiple iterative programmes are written and the analysis are performed to minimize the objective function. The dependency of the objective function on various independent variables is established and the optimum values of the parameters are evaluated. The results of the analysis are presented in the paper. (author)

Critical Assessment of Analytical Techniques in the Search for Biomarkers on Mars: A Mummified Microbial Mat from Antarctica as a Best-Case Scenario

Science.gov (United States)

Blanco, Yolanda; Gallardo-Carreño, Ignacio; Ruiz-Bermejo, Marta; Puente-Sánchez, Fernando; Cavalcante-Silva, Erika; Quesada, Antonio; Prieto-Ballesteros, Olga; Parro, Víctor

2017-10-01

The search for biomarkers of present or past life is one of the major challenges for in situ planetary exploration. Multiple constraints limit the performance and sensitivity of remote in situ instrumentation. In addition, the structure, chemical, and mineralogical composition of the sample may complicate the analysis and interpretation of the results. The aim of this work is to highlight the main constraints, performance, and complementarity of several techniques that have already been implemented or are planned to be implemented on Mars for detection of organic and molecular biomarkers on a best-case sample scenario. We analyzed a 1000-year-old desiccated and mummified microbial mat from Antarctica by Raman and IR (infrared) spectroscopies (near- and mid-IR), thermogravimetry (TG), differential thermal analysis, mass spectrometry (MS), and immunological detection with a life detector chip. In spite of the high organic content (ca. 20% wt/wt) of the sample, the Raman spectra only showed the characteristic spectral peaks of the remaining beta-carotene biomarker and faint peaks of phyllosilicates over a strong fluorescence background. IR spectra complemented the mineralogical information from Raman spectra and showed the main molecular vibrations of the humic acid functional groups. The TG-MS system showed the release of several volatile compounds attributed to biopolymers. An antibody microarray for detecting cyanobacteria (CYANOCHIP) detected biomarkers from Chroococcales, Nostocales, and Oscillatoriales orders. The results highlight limitations of each technique and suggest the necessity of complementary approaches in the search for biomarkers because some analytical techniques might be impaired by sample composition, presentation, or processing.

Knowing How Good Our Searches Are: An Approach Derived from Search Filter Development Methodology

Directory of Open Access Journals (Sweden)

Sarah Hayman

2015-12-01

Full Text Available Objective – Effective literature searching is of paramount importance in supporting evidence based practice, research, and policy. Missed references can have adverse effects on outcomes. This paper reports on the development and evaluation of an online learning resource, designed for librarians and other interested searchers, presenting an evidence based approach to enhancing and testing literature searches. Methods – We developed and evaluated the set of free online learning modules for librarians called Smart Searching, suggesting the use of techniques derived from search filter development undertaken by the CareSearch Palliative Care Knowledge Network and its associated project Flinders Filters. The searching module content has been informed by the processes and principles used in search filter development. The self-paced modules are intended to help librarians and other interested searchers test the effectiveness of their literature searches, provide evidence of search performance that can be used to improve searches, as well as to evaluate and promote searching expertise. Each module covers one of four techniques, or core principles, employed in search filter development: (1 collaboration with subject experts; (2 use of a reference sample set; (3 term identification through frequency analysis; and (4 iterative testing. Evaluation of the resource comprised ongoing monitoring of web analytics to determine factors such as numbers of users and geographic origin; a user survey conducted online elicited qualitative information about the usefulness of the resource. Results – The resource was launched in May 2014. Web analytics show over 6,000 unique users from 101 countries (at 9 August 2015. Responses to the survey (n=50 indicated that 80% would recommend the resource to a colleague. Conclusions – An evidence based approach to searching, derived from search filter development methodology, has been shown to have value as an online learning

TOWARDS ACTIVE SEO (SEARCH ENGINE OPTIMIZATION 2.0

Directory of Open Access Journals (Sweden)

Charles-Victor Boutet

2012-12-01

Full Text Available In the age of writable web, new skills and new practices are appearing. In an environment that allows everyone to communicate information globally, internet referencing (or SEO is a strategic discipline that aims to generate visibility, internet traffic and a maximum exploitation of sites publications. Often misperceived as a fraud, SEO has evolved to be a facilitating tool for anyone who wishes to reference their website with search engines. In this article we show that it is possible to achieve the first rank in search results of keywords that are very competitive. We show methods that are quick, sustainable and legal; while applying the principles of active SEO 2.0. This article also clarifies some working functions of search engines, some advanced referencing techniques (that are completely ethical and legal and we lay the foundations for an in depth reflection on the qualities and advantages of these techniques.

PWR loading pattern optimization using Harmony Search algorithm

International Nuclear Information System (INIS)

Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.

2013-01-01

Highlights: ► Numerical results reveal that the HS method is reliable. ► The great advantage of HS is significant gain in computational cost. ► On the average, the final band width of search fitness values is narrow. ► Our experiments show that the search approaches the optimal value fast. - Abstract: In this paper a core reloading technique using Harmony Search, HS, is presented in the context of finding an optimal configuration of fuel assemblies, FA, in pressurized water reactors. To implement and evaluate the proposed technique a Harmony Search along Nodal Expansion Code for 2-D geometry, HSNEC2D, is developed to obtain nearly optimal arrangement of fuel assemblies in PWR cores. This code consists of two sections including Harmony Search algorithm and Nodal Expansion modules using fourth degree flux expansion which solves two dimensional-multi group diffusion equations with one node per fuel assembly. Two optimization test problems are investigated to demonstrate the HS algorithm capability in converging to near optimal loading pattern in the fuel management field and other subjects. Results, convergence rate and reliability of the method are quite promising and show the HS algorithm performs very well and is comparable to other competitive algorithms such as Genetic Algorithm and Particle Swarm Intelligence. Furthermore, implementation of nodal expansion technique along HS causes considerable reduction of computational time to process and analysis optimization in the core fuel management problems

Toward an automaton Constraint for Local Search

Directory of Open Access Journals (Sweden)

Jun He

2009-10-01

Full Text Available We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search. We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].

Search techniques in intelligent classification systems

CERN Document Server

Savchenko, Andrey V

2016-01-01

A unified methodology for categorizing various complex objects is presented in this book. Through probability theory, novel asymptotically minimax criteria suitable for practical applications in imaging and data analysis are examined including the special cases such as the Jensen-Shannon divergence and the probabilistic neural network. An optimal approximate nearest neighbor search algorithm, which allows faster classification of databases is featured. Rough set theory, sequential analysis and granular computing are used to improve performance of the hierarchical classifiers. Practical examples in face identification (including deep neural networks), isolated commands recognition in voice control system and classification of visemes captured by the Kinect depth camera are included. This approach creates fast and accurate search procedures by using exact probability densities of applied dissimilarity measures. This book can be used as a guide for independent study and as supplementary material for a technicall...

Searching fundamental information in ordinary differential equations. Nondimensionalization technique.

Science.gov (United States)

Sánchez Pérez, J F; Conesa, M; Alhama, I; Alhama, F; Cánovas, M

2017-01-01

Classical dimensional analysis and nondimensionalization are assumed to be two similar approaches in the search for dimensionless groups. Both techniques, simplify the study of many problems. The first approach does not need to know the mathematical model, being sufficient a deep understanding of the physical phenomenon involved, while the second one begins with the governing equations and reduces them to their dimensionless form by simple mathematical manipulations. In this work, a formal protocol is proposed for applying the nondimensionalization process to ordinary differential equations, linear or not, leading to dimensionless normalized equations from which the resulting dimensionless groups have two inherent properties: In one hand, they are physically interpreted as balances between counteracting quantities in the problem, and on the other hand, they are of the order of magnitude unity. The solutions provided by nondimensionalization are more precise in every case than those from dimensional analysis, as it is illustrated by the applications studied in this work.

Geochemical Exploration Techniques Applicable in the Search for Copper Deposits

Science.gov (United States)

Chaffee, Maurice A.

1975-01-01

Geochemical exploration is an important part of copper-resource evaluation. A large number of geochemical exploration techniques, both proved and untried, are available to the geochemist to use in the search for new copper deposits. Analyses of whole-rock samples have been used in both regional and local geochemical exploration surveys in the search for copper. Analyses of mineral separates, such as biotite, magnetite, and sulfides, have also been used. Analyses of soil samples are widely used in geochemical exploration, especially for localized surveys. It is important to distinguish between residual and transported soil types. Orientation studies should always be conducted prior to a geochemical investigation in a given area in order to determine the best soil horizon and the best size of soil material for sampling in that area. Silty frost boils, caliche, and desert varnish are specialized types of soil samples that might be useful sampling media. Soil gas is a new and potentially valuable geochemical sampling medium, especially in exploring for buried mineral deposits in arid regions. Gaseous products in samples of soil may be related to base-metal deposits and include mercury vapor, sulfur dioxide, hydrogen sulfide, carbon oxysulfide, carbon dioxide, hydrogen, oxygen, nitrogen, the noble gases, the halogens, and many hydrocarbon compounds. Transported materials that have been used in geochemical sampling programs include glacial float boulders, glacial till, esker gravels, stream sediments, stream-sediment concentrates, and lake sediments. Stream-sediment sampling is probably the most widely used and most successful geochemical exploration technique. Hydrogeochemical exploration programs have utilized hot- and cold-spring waters and their precipitates as well as waters from lakes, streams, and wells. Organic gel found in lakes and at stream mouths is an unproved sampling medium. Suspended material and dissolved gases in any type of water may also be useful

Revue d'Information Scientifique et Technique: Advanced Search

African Journals Online (AJOL)

Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

Searching for millisecond pulsars: surveys, techniques and prospects

International Nuclear Information System (INIS)

Stovall, K; Lorimer, D R; Lynch, R S

2013-01-01

Searches for millisecond pulsars (which we here loosely define as those with periods < 20 ms) in the galactic field have undergone a renaissance in the past five years. New or recently refurbished radio telescopes utilizing cooled receivers and state-of-the art digital data acquisition systems are carrying out surveys of the entire sky at a variety of radio frequencies. Targeted searches for millisecond pulsars in point sources identified by the Fermi Gamma-ray Space Telescope have proved phenomenally successful, with over 50 discoveries in the past five years. The current sample of millisecond pulsars now numbers almost 200 and, for the first time in 25 years, now outnumbers their counterparts in galactic globular clusters. While many of these searches are motivated to find pulsars which form part of pulsar timing arrays, a wide variety of interesting systems are now being found. Following a brief overview of the millisecond pulsar phenomenon, we describe these searches and present some of the highlights of the new discoveries in the past decade. We conclude with predictions and prospects for ongoing and future surveys. (paper)

Critical Assessment of Analytical Techniques in the Search for Biomarkers on Mars: A Mummified Microbial Mat from Antarctica as a Best-Case Scenario.

Science.gov (United States)

Blanco, Yolanda; Gallardo-Carreño, Ignacio; Ruiz-Bermejo, Marta; Puente-Sánchez, Fernando; Cavalcante-Silva, Erika; Quesada, Antonio; Prieto-Ballesteros, Olga; Parro, Víctor

2017-10-01

The search for biomarkers of present or past life is one of the major challenges for in situ planetary exploration. Multiple constraints limit the performance and sensitivity of remote in situ instrumentation. In addition, the structure, chemical, and mineralogical composition of the sample may complicate the analysis and interpretation of the results. The aim of this work is to highlight the main constraints, performance, and complementarity of several techniques that have already been implemented or are planned to be implemented on Mars for detection of organic and molecular biomarkers on a best-case sample scenario. We analyzed a 1000-year-old desiccated and mummified microbial mat from Antarctica by Raman and IR (infrared) spectroscopies (near- and mid-IR), thermogravimetry (TG), differential thermal analysis, mass spectrometry (MS), and immunological detection with a life detector chip. In spite of the high organic content (ca. 20% wt/wt) of the sample, the Raman spectra only showed the characteristic spectral peaks of the remaining beta-carotene biomarker and faint peaks of phyllosilicates over a strong fluorescence background. IR spectra complemented the mineralogical information from Raman spectra and showed the main molecular vibrations of the humic acid functional groups. The TG-MS system showed the release of several volatile compounds attributed to biopolymers. An antibody microarray for detecting cyanobacteria (CYANOCHIP) detected biomarkers from Chroococcales, Nostocales, and Oscillatoriales orders. The results highlight limitations of each technique and suggest the necessity of complementary approaches in the search for biomarkers because some analytical techniques might be impaired by sample composition, presentation, or processing. Key Words: Planetary exploration-Life detection-Microbial mat-Life detector chip-Thermogravimetry-Raman spectroscopy-NIR-DRIFTS. Astrobiology 17, 984-996.

Spatial Search Techniques for Mobile 3D Queries in Sensor Web Environments

Directory of Open Access Journals (Sweden)

James D. Carswell

2013-03-01

Full Text Available Developing mobile geo-information systems for sensor web applications involves technologies that can access linked geographical and semantically related Internet information. Additionally, in tomorrow’s Web 4.0 world, it is envisioned that trillions of inexpensive micro-sensors placed throughout the environment will also become available for discovery based on their unique geo-referenced IP address. Exploring these enormous volumes of disparate heterogeneous data on today’s location and orientation aware smartphones requires context-aware smart applications and services that can deal with “information overload”. 3DQ (Three Dimensional Query is our novel mobile spatial interaction (MSI prototype that acts as a next-generation base for human interaction within such geospatial sensor web environments/urban landscapes. It filters information using “Hidden Query Removal” functionality that intelligently refines the search space by calculating the geometry of a three dimensional visibility shape (Vista space at a user’s current location. This 3D shape then becomes the query “window” in a spatial database for retrieving information on only those objects visible within a user’s actual 3D field-of-view. 3DQ reduces information overload and serves to heighten situation awareness on constrained commercial off-the-shelf devices by providing visibility space searching as a mobile web service. The effects of variations in mobile spatial search techniques in terms of query speed vs. accuracy are evaluated and presented in this paper.

The search for neuroimaging biomarkers of Alzheimer's disease with advanced MRI techniques

Energy Technology Data Exchange (ETDEWEB)

Li, Tie-Qiang (Karolinska Huddinge - Medical Physics, Stockholm (Sweden)), email: tieqiang.li@karolinska.se; Wahlund, Lars-Olof (Dept. of Neurobiology, Care Sciences and Society, Karolinska Institute, Stockholm (Sweden))

2011-02-15

The aim of this review is to examine the recent literature on using advanced magnetic resonance imaging (MRI) techniques for finding neuroimaging biomarkers that are sensitive to the detection of risks for Alzheimer's disease (AD). Since structural MRI techniques, such as brain structural volumetry and voxel based morphometry (VBM), have been widely used for AD studies and extensively reviewed, we will only briefly touch on the topics of volumetry and morphometry. The focus of the current review is about the more recent developments in the search for AD neuroimaging biomarkers with functional MRI (fMRI), resting-state functional connectivity MRI (fcMRI), diffusion tensor imaging (DTI), arterial spin-labeling (ASL), and magnetic resonance spectroscopy (MRS)

Motion Vector Estimation Using Line-Square Search Block Matching Algorithm for Video Sequences

Directory of Open Access Journals (Sweden)

Guo Bao-long

2004-09-01

Full Text Available Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreover, the accurate search is achieved because the small square search pattern is used. It has a best-case scenario of only 9 search points, which is 4 search points less than the diamond search algorithm. Simulation results show that, compared with the previous techniques, the LSPS algorithm significantly reduces the computational requirements for finding motion vectors, and also produces close performance in terms of motion compensation errors.

ERRATUM: TOWARDS ACTIVE SEO (SEARCH ENGINE OPTIMIZATION 2.0

Directory of Open Access Journals (Sweden)

Charles-Victor Boutet

2013-04-01

Full Text Available In the age of writable web, new skills and new practices are appearing. In an environment that allows everyone to communicate information globally, internet referencing (or SEO is a strategic discipline that aims to generate visibility, internet traffic and a maximum exploitation of sites publications. Often misperceived as a fraud, SEO has evolved to be a facilitating tool for anyone who wishes to reference their website with search engines. In this article we show that it is possible to achieve the first rank in search results of keywords that are very competitive. We show methods that are quick, sustainable and legal; while applying the principles of active SEO 2.0. This article also clarifies some working functions of search engines, some advanced referencing techniques (that are completely ethical and legal and we lay the foundations for an in depth reflection on the qualities and advantages of these techniques.

Tabu search, a versatile technique for the functions optimization; Busqueda Tabu, una tecnica versatil para la optimizacion de funciones

Energy Technology Data Exchange (ETDEWEB)

Castillo M, J.A. [ININ, 52045 Ocoyoacac, Estado de Mexico (Mexico)

2003-07-01

The basic elements of the Tabu search technique are presented, putting emphasis in the qualities that it has in comparison with the traditional methods of optimization known as in descending pass. Later on some modifications are sketched that have been implemented in the technique along the time, so that this it is but robust. Finally they are given to know some areas where this technique has been applied, obtaining successful results. (Author)

Network module detection: Affinity search technique with the multi-node topological overlap measure.

Science.gov (United States)

Li, Ai; Horvath, Steve

2009-07-20

Many clustering procedures only allow the user to input a pairwise dissimilarity or distance measure between objects. We propose a clustering method that can input a multi-point dissimilarity measure d(i1, i2, ..., iP) where the number of points P can be larger than 2. The work is motivated by gene network analysis where clusters correspond to modules of highly interconnected nodes. Here, we define modules as clusters of network nodes with high multi-node topological overlap. The topological overlap measure is a robust measure of interconnectedness which is based on shared network neighbors. In previous work, we have shown that the multi-node topological overlap measure yields biologically meaningful results when used as input of network neighborhood analysis. We adapt network neighborhood analysis for the use of module detection. We propose the Module Affinity Search Technique (MAST), which is a generalized version of the Cluster Affinity Search Technique (CAST). MAST can accommodate a multi-node dissimilarity measure. Clusters grow around user-defined or automatically chosen seeds (e.g. hub nodes). We propose both local and global cluster growth stopping rules. We use several simulations and a gene co-expression network application to argue that the MAST approach leads to biologically meaningful results. We compare MAST with hierarchical clustering and partitioning around medoid clustering. Our flexible module detection method is implemented in the MTOM software which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/MTOM/

System reliability analysis using dominant failure modes identified by selective searching technique

International Nuclear Information System (INIS)

Kim, Dong-Seok; Ok, Seung-Yong; Song, Junho; Koh, Hyun-Moo

2013-01-01

The failure of a redundant structural system is often described by innumerable system failure modes such as combinations or sequences of local failures. An efficient approach is proposed to identify dominant failure modes in the space of random variables, and then perform system reliability analysis to compute the system failure probability. To identify dominant failure modes in the decreasing order of their contributions to the system failure probability, a new simulation-based selective searching technique is developed using a genetic algorithm. The system failure probability is computed by a multi-scale matrix-based system reliability (MSR) method. Lower-scale MSR analyses evaluate the probabilities of the identified failure modes and their statistical dependence. A higher-scale MSR analysis evaluates the system failure probability based on the results of the lower-scale analyses. Three illustrative examples demonstrate the efficiency and accuracy of the approach through comparison with existing methods and Monte Carlo simulations. The results show that the proposed method skillfully identifies the dominant failure modes, including those neglected by existing approaches. The multi-scale MSR method accurately evaluates the system failure probability with statistical dependence fully considered. The decoupling between the failure mode identification and the system reliability evaluation allows for effective applications to larger structural systems

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Directory of Open Access Journals (Sweden)

Vatutin Eduard

2017-12-01

Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

Science.gov (United States)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

COBRA: a Bayesian approach to pulsar searching

Science.gov (United States)

Lentati, L.; Champion, D. J.; Kramer, M.; Barr, E.; Torne, P.

2018-02-01

We introduce COBRA, a GPU-accelerated Bayesian analysis package for performing pulsar searching, that uses candidates from traditional search techniques to set the prior used for the periodicity of the source, and performs a blind search in all remaining parameters. COBRA incorporates models for both isolated and accelerated systems, as well as both Keplerian and relativistic binaries, and exploits pulse phase information to combine search epochs coherently, over time, frequency or across multiple telescopes. We demonstrate the efficacy of our approach in a series of simulations that challenge typical search techniques, including highly aliased signals, and relativistic binary systems. In the most extreme case, we simulate an 8 h observation containing 24 orbits of a pulsar in a binary with a 30 M⊙ companion. Even in this scenario we show that we can build up from an initial low-significance candidate, to fully recovering the signal. We also apply the method to survey data of three pulsars from the globular cluster 47Tuc: PSRs J0024-7204D, J0023-7203J and J0024-7204R. This final pulsar is in a 1.6 h binary, the shortest of any pulsar in 47Tuc, and additionally shows significant scintillation. By allowing the amplitude of the source to vary as a function of time, however, we show that we are able to obtain optimal combinations of such noisy data. We also demonstrate the ability of COBRA to perform high-precision pulsar timing directly on the single pulse survey data, and obtain a 95 per cent upper limit on the eccentricity of PSR J0024-7204R of εb < 0.0007.

A Survey in Indexing and Searching XML Documents.

Science.gov (United States)

Luk, Robert W. P.; Leong, H. V.; Dillon, Tharam S.; Chan, Alvin T. S.; Croft, W. Bruce; Allan, James

2002-01-01

Discussion of XML focuses on indexing techniques for XML documents, grouping them into flat-file, semistructured, and structured indexing paradigms. Highlights include searching techniques, including full text search and multistage search; search result presentations; database and information retrieval system integration; XML query languages; and…

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

Science.gov (United States)

Jonsson, Ari K.; Frank, Jeremy

2000-01-01

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

The Complex Dynamics of Sponsored Search Markets

Science.gov (United States)

Robu, Valentin; La Poutré, Han; Bohte, Sander

This paper provides a comprehensive study of the structure and dynamics of online advertising markets, mostly based on techniques from the emergent discipline of complex systems analysis. First, we look at how the display rank of a URL link influences its click frequency, for both sponsored search and organic search. Second, we study the market structure that emerges from these queries, especially the market share distribution of different advertisers. We show that the sponsored search market is highly concentrated, with less than 5% of all advertisers receiving over 2/3 of the clicks in the market. Furthermore, we show that both the number of ad impressions and the number of clicks follow power law distributions of approximately the same coefficient. However, we find this result does not hold when studying the same distribution of clicks per rank position, which shows considerable variance, most likely due to the way advertisers divide their budget on different keywords. Finally, we turn our attention to how such sponsored search data could be used to provide decision support tools for bidding for combinations of keywords. We provide a method to visualize keywords of interest in graphical form, as well as a method to partition these graphs to obtain desirable subsets of search terms.

Environmental monitoring using autonomous vehicles: a survey of recent searching techniques.

Science.gov (United States)

Bayat, Behzad; Crasta, Naveena; Crespi, Alessandro; Pascoal, António M; Ijspeert, Auke

2017-06-01

Autonomous vehicles are becoming an essential tool in a wide range of environmental applications that include ambient data acquisition, remote sensing, and mapping of the spatial extent of pollutant spills. Among these applications, pollution source localization has drawn increasing interest due to its scientific and commercial interest and the emergence of a new breed of robotic vehicles capable of operating in harsh environments without human supervision. The aim is to find the location of a region that is the source of a given substance of interest (e.g. a chemical pollutant at sea or a gas leakage in air) using a group of cooperative autonomous vehicles. Motivated by fast paced advances in this challenging area, this paper surveys recent advances in searching techniques that are at the core of environmental monitoring strategies using autonomous vehicles. Copyright © 2017 Elsevier Ltd. All rights reserved.

Fast Structural Search in Phylogenetic Databases

Directory of Open Access Journals (Sweden)

William H. Piel

2005-01-01

Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising

Exploration of the search space of the in-core fuel management problem by knowledge-based techniques

International Nuclear Information System (INIS)

Galperin, A.

1995-01-01

The process of generating reload configuration patterns is presented as a search procedure. The search space of the problem is found to contain ∼ 10 12 possible problem states. If computational resources and execution time necessary to evaluate a single solution are taken into account, this problem may be described as a ''large space search problem.'' Understanding of the structure of the search space, i.e., distribution of the optimal (or nearly optimal) solutions, is necessary to choose an appropriate search method and to utilize adequately domain heuristic knowledge. A worth function is developed based on two performance parameters: cycle length and power peaking factor. A series of numerical experiments was carried out; 300,000 patterns were generated in 40 sessions. All these patterns were analyzed by simulating the power production cycle and by evaluating the two performance parameters. The worth function was calculated and plotted. Analysis of the worth function reveals quite a complicated search space structure. The fine structure shows an extremely large number of local peaks: about one peak per hundred configurations. The direct implication of this discovery is that within a search space of 10 12 states, there are ∼10 10 local optima. Further consideration of the worth function shape shows that the distribution of the local optima forms a contour with much slower variations, where ''better'' or ''worse'' groups of patterns are spaced within a few thousand or tens of thousands of configurations, and finally very broad subregions of the whole space display variations of the worth function, where optimal regions include tens of thousands of patterns and are separated by hundreds of thousands and millions

A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract

Directory of Open Access Journals (Sweden)

Quang Dung Pham

2009-10-01

Full Text Available Constrained Optimum Path (COP problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP. We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

VisualRank: applying PageRank to large-scale image search.

Science.gov (United States)

Jing, Yushi; Baluja, Shumeet

2008-11-01

Because of the relative ease in understanding and processing text, commercial image-search systems often rely on techniques that are largely indistinguishable from text-search. Recently, academic studies have demonstrated the effectiveness of employing image-based features to provide alternative or additional signals. However, it remains uncertain whether such techniques will generalize to a large number of popular web queries, and whether the potential improvement to search quality warrants the additional computational cost. In this work, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose VisualRank to analyze the visual link structures among images. The images found to be "authorities" are chosen as those that answer the image-queries well. To understand the performance of such an approach in a real system, we conducted a series of large-scale experiments based on the task of retrieving images for 2000 of the most popular products queries. Our experimental results show significant improvement, in terms of user satisfaction and relevancy, in comparison to the most recent Google Image Search results. Maintaining modest computational cost is vital to ensuring that this procedure can be used in practice; we describe the techniques required to make this system practical for large scale deployment in commercial search engines.

Mode analysis of heuristic behavior of searching for multimodal optimum point

Energy Technology Data Exchange (ETDEWEB)

Kamei, K; Araki, Y; Inoue, K

1982-01-01

Describes an experimental study of a heuristic behavior of searching for the global optimum (maximum) point of a two-dimensional, multimodal, nonlinear and unknown function. First, the authors define three modes dealing with the trial purposes, called the purpose modes and show the heuristic search behaviors expressed by the purpose modes which the human subjects select in the search experiments. Second, the authors classify the heuristic search behaviors into three types according to the mode transitions and extracts eight states of searches which cause the mode transitions. Third, a model of the heuristic search behavior is composed of the eight mode transitions. The analysis of the heuristic search behaviors by use of the purpose modes plays an important role in the heuristic search techniques. 6 references.

Google Power Search

CERN Document Server

Spencer, Stephan

2011-01-01

Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit

Search and optimization by metaheuristics techniques and algorithms inspired by nature

CERN Document Server

Du, Ke-Lin

2016-01-01

This textbook provides a comprehensive introduction to nature-inspired metaheuristic methods for search and optimization, including the latest trends in evolutionary algorithms and other forms of natural computing. Over 100 different types of these methods are discussed in detail. The authors emphasize non-standard optimization problems and utilize a natural approach to the topic, moving from basic notions to more complex ones. An introductory chapter covers the necessary biological and mathematical backgrounds for understanding the main material. Subsequent chapters then explore almost all of the major metaheuristics for search and optimization created based on natural phenomena, including simulated annealing, recurrent neural networks, genetic algorithms and genetic programming, differential evolution, memetic algorithms, particle swarm optimization, artificial immune systems, ant colony optimization, tabu search and scatter search, bee and bacteria foraging algorithms, harmony search, biomolecular computin...

A VLSI Implementation of Rank-Order Searching Circuit Employing a Time-Domain Technique

Directory of Open Access Journals (Sweden)

Trong-Tu Bui

2013-01-01

Full Text Available We present a compact and low-power rank-order searching (ROS circuit that can be used for building associative memories and rank-order filters (ROFs by employing time-domain computation and floating-gate MOS techniques. The architecture inherits the accuracy and programmability of digital implementations as well as the compactness and low-power consumption of analog ones. We aim to implement identification function as the first priority objective. Filtering function would be implemented once the location identification function has been carried out. The prototype circuit was designed and fabricated in a 0.18 μm CMOS technology. It consumes only 132.3 μW for an eight-input demonstration case.

Visual search for conjunctions of physical and numerical size shows that they are processed independently.

Science.gov (United States)

Sobel, Kenith V; Puri, Amrita M; Faulkenberry, Thomas J; Dague, Taylor D

2017-03-01

The size congruity effect refers to the interaction between numerical magnitude and physical digit size in a symbolic comparison task. Though this effect is well established in the typical 2-item scenario, the mechanisms at the root of the interference remain unclear. Two competing explanations have emerged in the literature: an early interaction model and a late interaction model. In the present study, we used visual conjunction search to test competing predictions from these 2 models. Participants searched for targets that were defined by a conjunction of physical and numerical size. Some distractors shared the target's physical size, and the remaining distractors shared the target's numerical size. We held the total number of search items fixed and manipulated the ratio of the 2 distractor set sizes. The results from 3 experiments converge on the conclusion that numerical magnitude is not a guiding feature for visual search, and that physical and numerical magnitude are processed independently, which supports a late interaction model of the size congruity effect. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Four-Dimensional Golden Search

Energy Technology Data Exchange (ETDEWEB)

Fenimore, Edward E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

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 following 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.

Science et Technique, Sciences de la Santé: Advanced Search

African Journals Online (AJOL)

Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

Design of PCB search coils for AC magnetic flux density measurement

Science.gov (United States)

Ulvr, Michal

2018-04-01

This paper presents single-layer, double-layer and ten-layer planar square search coils designed for AC magnetic flux density amplitude measurement up to 1 T in the low frequency range in a 10 mm air gap. The printed-circuit-board (PCB) method was used for producing the search coils. Special attention is given to a full characterization of the PCB search coils including a comparison between the detailed analytical design method and the finite integration technique method (FIT) on the one hand, and experimental results on the other. The results show very good agreement in the resistance, inductance and search coil constant values (the area turns) and also in the frequency dependence of the search coil constant.

Jet Substructure as a New Higgs-Search Channel at the Large Hadron Collider

International Nuclear Information System (INIS)

Butterworth, Jonathan M.; Davison, Adam R.; Rubin, Mathieu; Salam, Gavin P.

2008-01-01

It is widely considered that, for Higgs boson searches at the CERN Large Hadron Colider, WH and ZH production where the Higgs boson decays to bb are poor search channels due to large backgrounds. We show that at high transverse momenta, employing state-of-the-art jet reconstruction and decomposition techniques, these processes can be recovered as promising search channels for the standard model Higgs boson around 120 GeV in mass

Do Targeted Hiring Subsidies and Profiling Techniques Reduce Unemployment?

DEFF Research Database (Denmark)

Jahn, Elke; Wagner, Thomas

2008-01-01

To reduce equilibrium unemployment targeted hiring subsidies and profiling techniques for long-term unemployed are often recommended. To analyze the effects of these two instruments, our model combines two search methods: the public employment service and random search, jobseekers choose between...... an active and a passive search strategy, while labour market policy has two options available. First, only the long-term unemployed placed by the public employment service are subsidized. Second, the subsidy is paid for each match with a long-term unemployed irrespective of the search method used. We show...

Do Targeted Hiring Subsidies and Profiling Techniques Reduce Unemployment?

DEFF Research Database (Denmark)

Jahn, Elke; Wagner, Thomas

To reduce equilibrium unemployment targeted hiring subsidies and profilin techniques for long-term unemployed are often recommended. To analyze the effects of these two instruments, our model combines two search methods: the public employment serviceand random search, jobseekers choose between...... an active and a passive search strategy, while labour market policy has two options available. First, only the long-term unemployed placed by the public employment service are subsidized. Second, the subsidy is paid for each match with a long-term unemployed irrespective of the search method used. We show...

Measuring productivity differences in equilibrium search models

DEFF Research Database (Denmark)

Lanot, Gauthier; Neumann, George R.

1996-01-01

Equilibrium search models require unobserved heterogeneity in productivity to fit observed wage distribution data, but provide no guidance about the location parameter of the heterogeneity. In this paper we show that the location of the productivity heterogeneity implies a mode in a kernel density...... estimate of the wage distribution. The number of such modes and their location are identified using bump hunting techniques due to Silverman (1981). These techniques are applied to Danish panel data on workers and firms. These estimates are used to assess the importance of employer wage policy....

Heuristic Search Theory and Applications

CERN Document Server

Edelkamp, Stefan

2011-01-01

Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constra

Developing a Systematic Patent Search Training Program

Science.gov (United States)

Zhang, Li

2009-01-01

This study aims to develop a systematic patent training program using patent analysis and citation analysis techniques applied to patents held by the University of Saskatchewan. The results indicate that the target audience will be researchers in life sciences, and aggregated patent database searching and advanced search techniques should be…

Study of Search Engine Transaction Logs Shows Little Change in How Users use Search Engines. A review of: Jansen, Bernard J., and Amanda Spink. “How Are We Searching the World Wide Web? A Comparison of Nine Search Engine Transaction Logs.” Information Processing & Management 42.1 (2006: 248‐263.

Directory of Open Access Journals (Sweden)

David Hook

2006-09-01

implies that users are tending to view fewer results per web query. There was also a significant difference in the percentage of queries using Boolean operators between the US‐based and the European‐based search engines. One of the study’s findings was that results from a study of a particular search engine cannot necessarily be applied to all search engines. Finally, web search topics show a trend towards information or commerce searching rather than entertainment.

Combining results of multiple search engines in proteomics.

Science.gov (United States)

Shteynberg, David; Nesvizhskii, Alexey I; Moritz, Robert L; Deutsch, Eric W

2013-09-01

A crucial component of the analysis of shotgun proteomics datasets is the search engine, an algorithm that attempts to identify the peptide sequence from the parent molecular ion that produced each fragment ion spectrum in the dataset. There are many different search engines, both commercial and open source, each employing a somewhat different technique for spectrum identification. The set of high-scoring peptide-spectrum matches for a defined set of input spectra differs markedly among the various search engine results; individual engines each provide unique correct identifications among a core set of correlative identifications. This has led to the approach of combining the results from multiple search engines to achieve improved analysis of each dataset. Here we review the techniques and available software for combining the results of multiple search engines and briefly compare the relative performance of these techniques.

Combining Results of Multiple Search Engines in Proteomics*

Science.gov (United States)

Shteynberg, David; Nesvizhskii, Alexey I.; Moritz, Robert L.; Deutsch, Eric W.

2013-01-01

A crucial component of the analysis of shotgun proteomics datasets is the search engine, an algorithm that attempts to identify the peptide sequence from the parent molecular ion that produced each fragment ion spectrum in the dataset. There are many different search engines, both commercial and open source, each employing a somewhat different technique for spectrum identification. The set of high-scoring peptide-spectrum matches for a defined set of input spectra differs markedly among the various search engine results; individual engines each provide unique correct identifications among a core set of correlative identifications. This has led to the approach of combining the results from multiple search engines to achieve improved analysis of each dataset. Here we review the techniques and available software for combining the results of multiple search engines and briefly compare the relative performance of these techniques. PMID:23720762

An efficient search method for finding the critical slip surface using the compositional Monte Carlo technique

International Nuclear Information System (INIS)

Goshtasbi, K.; Ahmadi, M; Naeimi, Y.

2008-01-01

Locating the critical slip surface and the associated minimum factor of safety are two complementary parts in a slope stability analysis. A large number of computer programs exist to solve slope stability problems. Most of these programs, however, have used inefficient and unreliable search procedures to locate the global minimum factor of safety. This paper presents an efficient and reliable method to determine the global minimum factor of safety coupled with a modified version of the Monte Carlo technique. Examples arc presented to illustrate the reliability of the proposed method

Improved Particle Swarm Optimization with a Collective Local Unimodal Search for Continuous Optimization Problems

Science.gov (United States)

Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

2014-01-01

A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants. PMID:24723827

Mastering Search Analytics Measuring SEO, SEM and Site Search

CERN Document Server

Chaters, Brent

2011-01-01

Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt

Model of intelligent information searching system

International Nuclear Information System (INIS)

Yastrebkov, D.I.

2004-01-01

A brief description of the technique to search for electronic documents in large archives as well as drawbacks is presented. A solution close to intelligent information searching systems is proposed. (author)

Search for top squark Production at the LHC at $\\sqrt{\\text{s}}=13$ TeV with the ATLAS Detector Using Multivariate Analysis Techniques

CERN Document Server

AUTHOR|(CDS)2230945; Köhler, Nicolas Maximilian; Junggeburth, Johannes Josef

Supersymmetry is a very promising extension of the Standard Model. It predicts new heavy particles, which are currently searched for in the ATLAS experiment at the Large Hadron Collider at a center-of-mass energy of 13 TeV. So far, all searches for supersymmetric particles use a cut-based signal selection. In this thesis, the use of multivariate selection techniques, Boosted Decision Trees and Artificial Neural Networks, is explored for the search for top squarks, the supersymmetric partner of the top quark. The multivariate methods increase the expected lower limit in the mass of top squarks by approximately 90 GeV from currently 990 GeV for small neutralino masses.

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

Science.gov (United States)

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.

People searching for people: analysis of a people search engine log

NARCIS (Netherlands)

Weerkamp, W.; Berendsen, R.; Kovachev, B.; Meij, E.; Balog, K.; de Rijke, M.

2011-01-01

Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of

2nd International Conference on Harmony Search Algorithm

CERN Document Server

Geem, Zong

2016-01-01

The Harmony Search Algorithm (HSA) is one of the most well-known techniques in the field of soft computing, an important paradigm in the science and engineering community.  This volume, the proceedings of the 2nd International Conference on Harmony Search Algorithm 2015 (ICHSA 2015), brings together contributions describing the latest developments in the field of soft computing with a special focus on HSA techniques. It includes coverage of new methods that have potentially immense application in various fields. Contributed articles cover aspects of the following topics related to the Harmony Search Algorithm: analytical studies; improved, hybrid and multi-objective variants; parameter tuning; and large-scale applications.  The book also contains papers discussing recent advances on the following topics: genetic algorithms; evolutionary strategies; the firefly algorithm and cuckoo search; particle swarm optimization and ant colony optimization; simulated annealing; and local search techniques.   This book ...

Personalization in professional academic search

NARCIS (Netherlands)

Verberne, S.; Sappelli, M.; Sørensen, D.R.; Kraaij, W.

2013-01-01

In this paper, we investigated how academic search can profit from personalization by incorporating query history and background knowledge in the ranking of the results. We implemented both techniques in a language modelling framework, using the Indri search engine. For our experiments, we used the

INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

OpenAIRE

Fadhilah Mat Yamin; T. Ramayah

2013-01-01

The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...

SearchGUI: An open-source graphical user interface for simultaneous OMSSA and X!Tandem searches.

Science.gov (United States)

Vaudel, Marc; Barsnes, Harald; Berven, Frode S; Sickmann, Albert; Martens, Lennart

2011-03-01

The identification of proteins by mass spectrometry is a standard technique in the field of proteomics, relying on search engines to perform the identifications of the acquired spectra. Here, we present a user-friendly, lightweight and open-source graphical user interface called SearchGUI (http://searchgui.googlecode.com), for configuring and running the freely available OMSSA (open mass spectrometry search algorithm) and X!Tandem search engines simultaneously. Freely available under the permissible Apache2 license, SearchGUI is supported on Windows, Linux and OSX. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A hybrid search algorithm for swarm robots searching in an unknown environment.

Science.gov (United States)

Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao

2014-01-01

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.

Personalizing Web Search based on User Profile

OpenAIRE

Utage, Sharyu; Ahire, Vijaya

2016-01-01

Web Search engine is most widely used for information retrieval from World Wide Web. These Web Search engines help user to find most useful information. When different users Searches for same information, search engine provide same result without understanding who is submitted that query. Personalized web search it is search technique for proving useful result. This paper models preference of users as hierarchical user profiles. a framework is proposed called UPS. It generalizes profile and m...

Suicide prevention through online gatekeeping using search advertising techniques: a feasibility study.

Science.gov (United States)

Sueki, Hajime; Ito, Jiro

2015-01-01

Nurturing gatekeepers is an effective suicide prevention strategy. Internet-based methods to screen those at high risk of suicide have been developed in recent years but have not been used for online gatekeeping. A preliminary study was conducted to examine the feasibility and effects of online gatekeeping. Advertisements to promote e-mail psychological consultation service use among Internet users were placed on web pages identified by searches using suicide-related keywords. We replied to all emails received between July and December 2013 and analyzed their contents. A total of 139 consultation service users were analyzed. The mean age was 23.8 years (SD = 9.7), and female users accounted for 80% of the sample. Suicidal ideation was present in 74.1%, and 12.2% had a history of suicide attempts. After consultation, positive changes in mood were observed in 10.8%, 16.5% showed intentions to seek help from new supporters, and 10.1% of all 139 users actually took help-seeking actions. Online gatekeeping to prevent suicide by placing advertisements on web search pages to promote consultation service use among Internet users with suicidal ideation may be feasible.

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

Science.gov (United States)

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...

Dark matter search

International Nuclear Information System (INIS)

Bernabei, R.

2003-01-01

Some general arguments on the particle Dark Matter search are addressed. The WIMP direct detection technique is mainly considered and recent results obtained by exploiting the annual modulation signature are summarized. (author)

Dark matter search

Energy Technology Data Exchange (ETDEWEB)

Bernabei, R [Dipto. di Fisica, Universita di Roma ' Tor Vergata' and INFN, sez. Roma2, Rome (Italy)

2003-08-15

Some general arguments on the particle Dark Matter search are addressed. The WIMP direct detection technique is mainly considered and recent results obtained by exploiting the annual modulation signature are summarized. (author)

Searches for Long-lived Particles at the Tevatron Collider

International Nuclear Information System (INIS)

Adams, T.; Florida State U.

2008-01-01

Several searches for long-lived particles have been performed using data from p(bar p) collisions from Run II at the Tevatron. In most cases, new analysis techniques have been developed to carry out each search and/or estimate the backgrounds. These searches expand the discovery potential of the CDF and D0 experiments to new physics that may have been missed by traditional search techniques. This review discusses searches for (1) neutral, long-lived particles decaying to muons, (2) massive, neutral, long-lived particles decaying to a photon and missing energy, (3) stopped gluinos, and (4) charged massive stable particles. It summarizes some of the theoretical and experimental motivations for such searches

Search-Order Independent State Caching

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2009-01-01

State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination.We propose and experimentally evaluate an extension of the state caching method for general state...... exploring algorithms that are independent of the search order (i.e., search algorithms that partition the state space into closed (visited) states, open (to visit) states and unmet states)....

Understanding search trees via statistical physics

Indian Academy of Sciences (India)

ary search tree model (where stands for the number of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results.

Search for vector-like quarks using jet substructure techniques with the CMS experiment

International Nuclear Information System (INIS)

Nowatschin, Dominik

2017-01-01

In this thesis, a search for pair produced vector-like T quarks in pp collision data from the LRC at √(s)=13 TeV is presented. The data were collected with the CMS detector and correspond to an integrated luminosity of up to 2.6 fb"-"1. Vector-like quarks are hypothetical new particles predicted by many extensions of the Standard Model in which the Higgs boson is a composite state of an unknown strong interaction. Vector-like T quarks are assumed to decay via three different decay modes to either bW, tZ or tH, with branching fractions that are not fixed and can vary depending on the particular model featuring vector-like quarks. This search focuses on decays of the T anti T system in which at least one muon or electron is present in the final state, and in which at least one of the T quarks decays to a top quark and a Higgs boson. As the T quarks are expected to be quite heavy, their decay products are significantly Lorentz-boasted in the reference frame of the T anti T system. The subsequent decay products of the Higgs boson are then emitted with a very small angle between them. This search is optimised for the main decay channel of the Higgs boson to two bottom quarks and attempts to reconstruct the two b quarks within a single jet with a large cone size. Dedicated jet substructure techniques, in combination with algorithms to identify jets originating from the fragmentation of a b quark, are then used to reconstruct the entire H→b anti b decay. The event categories of this search are also combined with the categories of a search for pair-produced T quarks that focuses on the T→bW decay. This approach provides a high sensitivity to T anti T production for many different combinations of branching fractions to the three possible decay modes. No excess of the data above the expected background contribution from the Standard Model is observed in any of the final event categories. Upper limits on the T anti T production cross section are calculated at 95

Search for vector-like quarks using jet substructure techniques with the CMS experiment

Energy Technology Data Exchange (ETDEWEB)

Nowatschin, Dominik

2017-07-03

In this thesis, a search for pair produced vector-like T quarks in pp collision data from the LRC at √(s)=13 TeV is presented. The data were collected with the CMS detector and correspond to an integrated luminosity of up to 2.6 fb{sup -1}. Vector-like quarks are hypothetical new particles predicted by many extensions of the Standard Model in which the Higgs boson is a composite state of an unknown strong interaction. Vector-like T quarks are assumed to decay via three different decay modes to either bW, tZ or tH, with branching fractions that are not fixed and can vary depending on the particular model featuring vector-like quarks. This search focuses on decays of the T anti T system in which at least one muon or electron is present in the final state, and in which at least one of the T quarks decays to a top quark and a Higgs boson. As the T quarks are expected to be quite heavy, their decay products are significantly Lorentz-boasted in the reference frame of the T anti T system. The subsequent decay products of the Higgs boson are then emitted with a very small angle between them. This search is optimised for the main decay channel of the Higgs boson to two bottom quarks and attempts to reconstruct the two b quarks within a single jet with a large cone size. Dedicated jet substructure techniques, in combination with algorithms to identify jets originating from the fragmentation of a b quark, are then used to reconstruct the entire H→b anti b decay. The event categories of this search are also combined with the categories of a search for pair-produced T quarks that focuses on the T→bW decay. This approach provides a high sensitivity to T anti T production for many different combinations of branching fractions to the three possible decay modes. No excess of the data above the expected background contribution from the Standard Model is observed in any of the final event categories. Upper limits on the T anti T production cross section are calculated at 95

Simulation Optimization by Genetic Search: A Comprehensive Study with Applications to Production Management

National Research Council Canada - National Science Library

Yunker, James

2003-01-01

In this report, a relatively new simulation optimization technique, the genetic search, is compared to two more established simulation techniques-the pattern search and the response surface methodology search...

Intelligent search in Big Data

Science.gov (United States)

Birialtsev, E.; Bukharaev, N.; Gusenkov, A.

2017-10-01

An approach to data integration, aimed on the ontology-based intelligent search in Big Data, is considered in the case when information objects are represented in the form of relational databases (RDB), structurally marked by their schemes. The source of information for constructing an ontology and, later on, the organization of the search are texts in natural language, treated as semi-structured data. For the RDBs, these are comments on the names of tables and their attributes. Formal definition of RDBs integration model in terms of ontologies is given. Within framework of the model universal RDB representation ontology, oil production subject domain ontology and linguistic thesaurus of subject domain language are built. Technique of automatic SQL queries generation for subject domain specialists is proposed. On the base of it, information system for TATNEFT oil-producing company RDBs was implemented. Exploitation of the system showed good relevance with majority of queries.

Complicated problem solution techniques in optimal parameter searching

International Nuclear Information System (INIS)

Gergel', V.P.; Grishagin, V.A.; Rogatneva, E.A.; Strongin, R.G.; Vysotskaya, I.N.; Kukhtin, V.V.

1992-01-01

An algorithm is presented of a global search for numerical solution of multidimentional multiextremal multicriteria optimization problems with complicated constraints. A boundedness of object characteristic changes is assumed at restricted changes of its parameters (Lipschitz condition). The algorithm was realized as a computer code. The algorithm was realized as a computer code. The programme was used to solve in practice the different applied optimization problems. 10 refs.; 3 figs

Fast, Inclusive Searches for Geographic Names Using Digraphs

Science.gov (United States)

Donato, David I.

2008-01-01

An algorithm specifies how to quickly identify names that approximately match any specified name when searching a list or database of geographic names. Based on comparisons of the digraphs (ordered letter pairs) contained in geographic names, this algorithmic technique identifies approximately matching names by applying an artificial but useful measure of name similarity. A digraph index enables computer name searches that are carried out using this technique to be fast enough for deployment in a Web application. This technique, which is a member of the class of n-gram algorithms, is related to, but distinct from, the soundex, PHONIX, and metaphone phonetic algorithms. Despite this technique's tendency to return some counterintuitive approximate matches, it is an effective aid for fast, inclusive searches for geographic names when the exact name sought, or its correct spelling, is unknown.

Fingerprinting Keywords in Search Queries over Tor

Directory of Open Access Journals (Sweden)

Oh Se Eun

2017-10-01

Full Text Available Search engine queries contain a great deal of private and potentially compromising information about users. One technique to prevent search engines from identifying the source of a query, and Internet service providers (ISPs from identifying the contents of queries is to query the search engine over an anonymous network such as Tor.

Top-k Keyword Search Over Graphs Based On Backward Search

Directory of Open Access Journals (Sweden)

Zeng Jia-Hui

2017-01-01

Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.

Speed control with torque ripple reduction of switched reluctance motor by Hybrid Many Optimizing Liaison Gravitational Search technique

Directory of Open Access Journals (Sweden)

Nutan Saha

2017-06-01

Full Text Available This paper presents a control scheme for simultaneous control of the speed of Switched Reluctance Motor (SRM and minimizing the torque ripple employing Hybrid Many Optimizing Liaison Gravitational Search Algorithm (Hybrid MOLGSA technique. The control mechanism includes two controlling loops, the outer loop is governed for speed control and a current controller for the inner loop, intelligent selection of turn on and turn off angle for a 60 KW, 3-phase 6/8 SRM. It is noticed that the torque ripple coefficient, ISE of speed & current are reduced by 12.81%, 38.60%, 16.74% respectively by Hybrid MOLGSA algorithm compared to Gravitational Search Algorithm (GSA algorithm. It is also observed that the settling times for the controller using the parameter values for obtaining best values of torque ripple, Integral square error of speed and current are reduced by 51.25%, 58.04% and 59.375% by proposed Hybrid MOLGSA algorithm compared to the GSA algorithm.

ISART: A Generic Framework for Searching Books with Social Information.

Science.gov (United States)

Yin, Xu-Cheng; Zhang, Bo-Wen; Cui, Xiao-Ping; Qu, Jiao; Geng, Bin; Zhou, Fang; Song, Li; Hao, Hong-Wei

2016-01-01

Effective book search has been discussed for decades and is still future-proof in areas as diverse as computer science, informatics, e-commerce and even culture and arts. A variety of social information contents (e.g, ratings, tags and reviews) emerge with the huge number of books on the Web, but how they are utilized for searching and finding books is seldom investigated. Here we develop an Integrated Search And Recommendation Technology (IsArt), which breaks new ground by providing a generic framework for searching books with rich social information. IsArt comprises a search engine to rank books with book contents and professional metadata, a Generalized Content-based Filtering model to thereafter rerank books with user-generated social contents, and a learning-to-rank technique to finally combine a wide range of diverse reranking results. Experiments show that this technology permits embedding social information to promote book search effectiveness, and IsArt, by making use of it, has the best performance on CLEF/INEX Social Book Search Evaluation datasets of all 4 years (from 2011 to 2014), compared with some other state-of-the-art methods.

Fast business process similarity search

NARCIS (Netherlands)

Yan, Z.; Dijkman, R.M.; Grefen, P.W.P.J.

2012-01-01

Nowadays, it is common for organizations to maintain collections of hundreds or even thousands of business processes. Techniques exist to search through such a collection, for business process models that are similar to a given query model. However, those techniques compare the query model to each

PIE the search: searching PubMed literature for protein interaction information.

Science.gov (United States)

Kim, Sun; Kwon, Dongseop; Shin, Soo-Yong; Wilbur, W John

2012-02-15

Finding protein-protein interaction (PPI) information from literature is challenging but an important issue. However, keyword search in PubMed(®) is often time consuming because it requires a series of actions that refine keywords and browse search results until it reaches a goal. Due to the rapid growth of biomedical literature, it has become more difficult for biologists and curators to locate PPI information quickly. Therefore, a tool for prioritizing PPI informative articles can be a useful assistant for finding this PPI-relevant information. PIE (Protein Interaction information Extraction) the search is a web service implementing a competition-winning approach utilizing word and syntactic analyses by machine learning techniques. For easy user access, PIE the search provides a PubMed-like search environment, but the output is the list of articles prioritized by PPI confidence scores. By obtaining PPI-related articles at high rank, researchers can more easily find the up-to-date PPI information, which cannot be found in manually curated PPI databases. http://www.ncbi.nlm.nih.gov/IRET/PIE/.

The use of magnetic susceptibility as a forensic search tool.

Science.gov (United States)

Pringle, Jamie K; Giubertoni, Matteo; Cassidy, Nigel J; Wisniewski, Kristopher D; Hansen, James D; Linford, Neil T; Daniels, Rebecca M

2015-01-01

There are various techniques available for forensic search teams to employ to successfully detect a buried object. Near-surface geophysical search methods have been dominated by ground penetrating radar but recently other techniques, such as electrical resistivity, have become more common. This paper discusses magnetic susceptibility as a simple surface search tool illustrated by various research studies. These suggest magnetic susceptibility to be a relatively low cost, quick and effective tool, compared to other geophysical methods, to determine disturbed ground above buried objects and burnt surface remains in a variety of soil types. Further research should collect datasets over objects of known burial ages for comparison purposes and used in forensic search cases to validate the technique. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Spatial Indexing for Data Searching in Mobile Sensing Environments.

Science.gov (United States)

Zhou, Yuchao; De, Suparna; Wang, Wei; Moessner, Klaus; Palaniswami, Marimuthu S

2017-06-18

Data searching and retrieval is one of the fundamental functionalities in many Web of Things applications, which need to collect, process and analyze huge amounts of sensor stream data. The problem in fact has been well studied for data generated by sensors that are installed at fixed locations; however, challenges emerge along with the popularity of opportunistic sensing applications in which mobile sensors keep reporting observation and measurement data at variable intervals and changing geographical locations. To address these challenges, we develop the Geohash-Grid Tree, a spatial indexing technique specially designed for searching data integrated from heterogeneous sources in a mobile sensing environment. Results of the experiments on a real-world dataset collected from the SmartSantander smart city testbed show that the index structure allows efficient search based on spatial distance, range and time windows in a large time series database.

NATO Advanced Research Institute on Search Theory and Applications

CERN Document Server

Stone, Lawrence

1980-01-01

The NATO Advanced Research Institute on Search Theory and Appli­ cations was held at the Hotel Algarve in Praia Da Rocha, Portugal, from March 26 through March 30, 1979, and was sponsored by the NATO Special Programme Panel on Systems Science. There were forty-one participants representing a wide range of backgrounds and interests. The purpose of the institute was to bring together people working in search theory and applications with potential users of search techniques to stimulate the increased application of recent­ ly developed search technology to civilian problems such as search and rescue, mineral exploration, surveillance, and fishing. Con­ versely, it was felt that by exposing search analysts to potential applications and new problems, they would be stimulated to develop new techniques for these applications and problems. The exchange of ideas and problems necessary to accomplish these goals was provided in the meeting workshops. There were three workshops, Search and Rescue, Exploration, and Sur...

Pseudodynamic Bearing Capacity Analysis of Shallow Strip Footing Using the Advanced Optimization Technique “Hybrid Symbiosis Organisms Search Algorithm” with Numerical Validation

Directory of Open Access Journals (Sweden)

Arijit Saha

2018-01-01

Full Text Available The analysis of shallow foundations subjected to seismic loading has been an important area of research for civil engineers. This paper presents an upper-bound solution for bearing capacity of shallow strip footing considering composite failure mechanisms by the pseudodynamic approach. A recently developed hybrid symbiosis organisms search (HSOS algorithm has been used to solve this problem. In the HSOS method, the exploration capability of SQI and the exploitation potential of SOS have been combined to increase the robustness of the algorithm. This combination can improve the searching capability of the algorithm for attaining the global optimum. Numerical analysis is also done using dynamic modules of PLAXIS-8.6v for the validation of this analytical solution. The results obtained from the present analysis using HSOS are thoroughly compared with the existing available literature and also with the other optimization techniques. The significance of the present methodology to analyze the bearing capacity is discussed, and the acceptability of HSOS technique is justified to solve such type of engineering problems.

Photographic emulsion versus bubble chambers in charm and beauty searches

International Nuclear Information System (INIS)

Sacton, J.

1984-01-01

This chapter discusses the use of visual detectors in the search for charm and other flavors. The photographic emulsion and the bubble chamber techniques are compared. The main difficulties encounted in searching for charmed and beautiful hadrons are related to the short lifetimes of these particles and to their small production cross-sections, even at SPS energies. Resolution, visibility, the data analysis rate, and exposure time are considered. Most of the charmed hadrons present a large variety of decay modes of which only a fraction has been identified to date. First results from CESR indicate that the average charged particle multiplicity in the hadronic decay of beautiful hadrons is as high as 6.31 + or - 0.35; no B meson decay has yet been kinematically reconstructed. The case of hadronic charmed particle production at SPS energies is examined. The data show that 1) the bubble chamber technique (high resolution or holographic optics) is well suited to the study of charmed hadrons with lifetimes in the range 10 -13 to 10 -12 s; 2) searches for beautiful hadrons remain presently a domain for triggered emulsion experiments due to the smallness of the production cross-sections (provided the lifetime is not much shorter than 10 -14 s); and 3) for particles of lifetimes shorter than a few times 10 -14 s the emulsion technique is still without competitor

Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches

Science.gov (United States)

Ghani, N. H. A.; Mohamed, N. S.; Zull, N.; Shoid, S.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search.

A combined analysis technique for the search for fast magnetic monopoles with the MACRO detector

CERN Document Server

Ambrosio, M; Auriemma, G; Bakari, D; Baldini, A; Barbarino, G C; Barish, B C; Battistoni, G; Becherini, Y; Bellotti, R; Bemporad, C; Bernardini, P; Bilokon, H; Bloise, C; Bower, C; Brigida, M; Bussino, S; Cafagna, F; Calicchio, M; Campana, D; Carboni, M; Caruso, R; Cecchini, S; Cei, F; Chiarella, V; Choudhary, B C; Coutu, S; De Cataldo, G; Dekhissi, H; De Marzo, C; De Mitri, I; Derkaoui, J E; De Vincenzi, M; Di Credico, A; Erriquez, O; Favuzzi, C; Forti, C; Fusco, P; Giacomelli, G; Giannini, G; Giglietto, N; Giorgini, M; Grassi, M; Grillo, A; Guarino, F; Gustavino, C; Habig, A; Heinz, R; Iarocci, E; Katsavounidis, E; Katsavounidis, I; Kearns, E; Kim, H; Kyriazopoulou, S; Lamanna, E; Lane, C; Levin, D S; Lipari, P; Longley, N P; Longo, M J; Loparco, F; Maaroufi, F; Mancarella, G; Mandrioli, G; Manzoor, S; Margiotta, A; Marini, A; Martello, D; Marzari-Chiesa, A; Mazziotta, M N; Michael, D G; Monacelli, P; Montaruli, T; Monteno, M; Mufson, S L; Musser, J; Nicolò, D; Nolty, R; Orth, C; Osteria, G; Palamara, O; Patera, V; Patrizii, L; Pazzi, R; Peck, C W; Perrone, L; Petrera, S; Popa, V; Reynoldson, J; Ronga, F; Rrhioua, A; Satriano, C; Scapparone, E; Scholberg, K; Sciubba, A; Serra, P; Sioli, M; Sirri, G; Sitta, M; Spinelli, P; Spinetti, M; Spurio, M; Steinberg, R; Stone, J L; Sulak, L R; Surdo, A; Tarle, G; Togo, V; Vakili, M; Walter, C W; Webb, R

2002-01-01

We describe a search method for fast moving ( beta = v/c > 5 * 10/sup -3/) magnetic monopoles using simultaneously the scintillator, streamer tube and track-etch subdetectors of the MACRO apparatus. The first two subdetectors are used primarily for the identification of candidates while the track-etch one is used as the final tool for their rejection or confirmation. Using this technique, a first sample of more than two years of data has been analyzed without any evidence of a magnetic monopole. We set a 90% CL upper limit to the local monopole flux of 1.5 * 10/sup -15/ cm/sup -2/s/sup -1/sr/sup -1/ in the velocity range 5 * 10/sup -3/

Sound Search Engine Concept

DEFF Research Database (Denmark)

2006-01-01

Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

New technique for system simplification using Cuckoo search and ESA

Indian Academy of Sciences (India)

Afzal Sikander

2017-08-17

Aug 17, 2017 ... previously published work and the results are compared in terms of performance indices. Keywords. Cuckoo search; Eigen spectrum analysis; optimization; reduced ... et al [7], by which they demonstrated the advantages of.

Google Patents: The global patent search engine

OpenAIRE

Noruzi, Alireza; Abdekhoda, Mohammadhiwa

2014-01-01

Google Patents (www.google.com/patents) includes over 8 million full-text patents. Google Patents works in the same way as the Google search engine. Google Patents is the global patent search engine that lets users search through patents from the USPTO (United States Patent and Trademark Office), EPO (European Patent Office), etc. This study begins with an overview of how to use Google Patent and identifies advanced search techniques not well-documented by Google Patent. It makes several sug...

Search Analytics for Your Site

CERN Document Server

Rosenfeld, Louis

2011-01-01

Any organization that has a searchable web site or intranet is sitting on top of hugely valuable and usually under-exploited data: logs that capture what users are searching for, how often each query was searched, and how many results each query retrieved. Search queries are gold: they are real data that show us exactly what users are searching for in their own words. This book shows you how to use search analytics to carry on a conversation with your customers: listen to and understand their needs, and improve your content, navigation and search performance to meet those needs.

A Hybrid Model Ranking Search Result for Research Paper Searching on Social Bookmarking

Directory of Open Access Journals (Sweden)

pijitra jomsri

2015-11-01

Full Text Available Social bookmarking and publication sharing systems are essential tools for web resource discovery. The performance and capabilities of search results from research paper bookmarking system are vital. Many researchers use social bookmarking for searching papers related to their topics of interest. This paper proposes a combination of similarity based indexing “tag title and abstract” and static ranking to improve search results. In this particular study, the year of the published paper and type of research paper publication are combined with similarity ranking called (HybridRank. Different weighting scores are employed. The retrieval performance of these weighted combination rankings are evaluated using mean values of NDCG. The results suggest that HybridRank and similarity rank with weight 75:25 has the highest NDCG scores. From the preliminary result of experiment, the combination ranking technique provide more relevant research paper search results. Furthermore the chosen heuristic ranking can improve the efficiency of research paper searching on social bookmarking websites.

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

Science.gov (United States)

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.

VPD residue search by monitoring scattered x-rays

International Nuclear Information System (INIS)

Mori, Y.; Yamagami, M.; Yamada, T.

2000-01-01

Recently, VPD-TXRF has come into wide use for semiconductor analysis. In VPD-TXRF technique, adjusting the mechanical measuring point to the center of dried residue is of importance for accurate determination. Until now, the following searching methods have been used: monitoring light scattering under bright illumination, using laser scattering particle mapper, applying internal standard as a marker. However, each method has individual disadvantage. For example, interference of Kβ line (ex. Sc-Kβ to Ti-Kα) occurs in the internal standard method. We propose a new searching method 'scattered x-ray search' which utilizes x-ray scattering form the dried residue as a marker. Since the line profile of x-ray scattering agrees with that of fluorescent x-rays, scattered x-ray can be used as an alternative marker instead of internal standard. According to our experimental results, this search method shows the same accuracy as internal standard method. The merits are as follows: 1) no need to add internal standard, 2) rapid search because of high intensity of scattered x-rays, 3) searching software for internal standard can be applied without any modification. In this method, diffraction of incident x-rays by substrate causes irregular change over the detected scattering x-rays. Therefore, this method works better under x-y controlled stage than r-Θ one. (author)

Quark search conference

International Nuclear Information System (INIS)

Anon.

1981-01-01

In spite of (or perhaps because of) the present doctrine of total quark confinement held by the majority of particle theorists, experimental searches for free fractional charge and other anomalous stable particles in ordinary matter have been increasing in number during recent years, using a range of techniques of increasing sophistication and sensitivity. As a result, researchers in this area had a conference to themselves in June. About 40 participants and 150 observers gathered at San Francisco State University to report progress and discuss future plans, with representatives present from almost every group involved in quark searches

NA64 Search for Dark Photons

CERN Document Server

Shiakas, Christos

2017-01-01

The NA64 experiment, known as P348 before official approval, was proposed to the CERN SPSC on January 2014 with main goal the search for the following decay modes A′ → invisible A′ → e−e+ (1) In March 2016 P348 was granted approval by the CERN Research Board and received the title NA64. Since having been promoted, the experiment has been conducting the searches the searches for the processes mentioned above at the CERN SPS. NA64 is a fixed target experiment which utilizes the active beam dump. The detection of rare processes is based on the missing energy techniques. Such techniques are used for particles whose interaction with the detector is very small, so that they escape the detection and carry away some energy. A significant missing energy in the experiment means that such particles are produced. The method of the search for the A′ → invisible decay is as follows. If the A′ exists it could be produced via the kinetic mixing with bremsstrahlung photons in the reaction of high-energy elec...

The potential use of unmanned aircraft systems (drones) in mountain search and rescue operations.

Science.gov (United States)

Karaca, Yunus; Cicek, Mustafa; Tatli, Ozgur; Sahin, Aynur; Pasli, Sinan; Beser, Muhammed Fatih; Turedi, Suleyman

2018-04-01

This study explores the potential use of drones in searching for and locating victims and of motorized transportation of search and rescue providers in a mountain environment using a simulation model. This prospective randomized simulation study was performed in order to compare two different search and rescue techniques in searching for an unconscious victim on snow-covered ground. In the control arm, the Classical Line Search Technique (CLT) was used, in which the search is performed on foot and the victim is reached on foot. In the intervention arm, the Drone-snowmobile Technique (DST) was used, the search being performed by drone and the victim reached by snowmobile. The primary outcome of the study was the comparison of the two search and rescue techniques in terms of first human contact time. Twenty search and rescue operations were conducted in this study. Median time to arrival at the mannequin was 57.3min for CLT, compared to 8.9min for DST. The median value of the total searched area was 88,322.0m 2 for CLT and 228,613.0m 2 for DST. The median area searched per minute was 1489.6m 2 for CLT and 32,979.9m 2 for DST (pdrone using DST compared to the classical technique, and the victim can be located faster and reached earlier with rescuers transported by snowmobile. Copyright © 2017 Elsevier Inc. All rights reserved.

Spatial search by quantum walk

International Nuclear Information System (INIS)

Childs, Andrew M.; Goldstone, Jeffrey

2004-01-01

Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order √(N) for d>2, and in time of order √(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous-time quantum walk on a graph. The case of the complete graph gives the continuous-time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that √(N) speedup can also be achieved on the hypercube. We show that full √(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order √(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup

Spatial Indexing for Data Searching in Mobile Sensing Environments

Directory of Open Access Journals (Sweden)

Yuchao Zhou

2017-06-01

Full Text Available Data searching and retrieval is one of the fundamental functionalities in many Web of Things applications, which need to collect, process and analyze huge amounts of sensor stream data. The problem in fact has been well studied for data generated by sensors that are installed at fixed locations; however, challenges emerge along with the popularity of opportunistic sensing applications in which mobile sensors keep reporting observation and measurement data at variable intervals and changing geographical locations. To address these challenges, we develop the Geohash-Grid Tree, a spatial indexing technique specially designed for searching data integrated from heterogeneous sources in a mobile sensing environment. Results of the experiments on a real-world dataset collected from the SmartSantander smart city testbed show that the index structure allows efficient search based on spatial distance, range and time windows in a large time series database.

Recent developments in MrBUMP: better search-model preparation, graphical interaction with search models, and solution improvement and assessment.

Science.gov (United States)

Keegan, Ronan M; McNicholas, Stuart J; Thomas, Jens M H; Simpkin, Adam J; Simkovic, Felix; Uski, Ville; Ballard, Charles C; Winn, Martyn D; Wilson, Keith S; Rigden, Daniel J

2018-03-01

Increasing sophistication in molecular-replacement (MR) software and the rapid expansion of the PDB in recent years have allowed the technique to become the dominant method for determining the phases of a target structure in macromolecular X-ray crystallography. In addition, improvements in bioinformatic techniques for finding suitable homologous structures for use as MR search models, combined with developments in refinement and model-building techniques, have pushed the applicability of MR to lower sequence identities and made weak MR solutions more amenable to refinement and improvement. MrBUMP is a CCP4 pipeline which automates all stages of the MR procedure. Its scope covers everything from the sourcing and preparation of suitable search models right through to rebuilding of the positioned search model. Recent improvements to the pipeline include the adoption of more sensitive bioinformatic tools for sourcing search models, enhanced model-preparation techniques including better ensembling of homologues, and the use of phase improvement and model building on the resulting solution. The pipeline has also been deployed as an online service through CCP4 online, which allows its users to exploit large bioinformatic databases and coarse-grained parallelism to speed up the determination of a possible solution. Finally, the molecular-graphics application CCP4mg has been combined with MrBUMP to provide an interactive visual aid to the user during the process of selecting and manipulating search models for use in MR. Here, these developments in MrBUMP are described with a case study to explore how some of the enhancements to the pipeline and to CCP4mg can help to solve a difficult case.

In Search of Search Engine Marketing Strategy Amongst SME's in Ireland

Science.gov (United States)

Barry, Chris; Charleton, Debbie

Researchers have identified the Web as a searchers first port of call for locating information. Search Engine Marketing (SEM) strategies have been noted as a key consideration when developing, maintaining and managing Websites. A study presented here of SEM practices of Irish small to medium enterprises (SMEs) reveals they plan to spend more resources on SEM in the future. Most firms utilize an informal SEM strategy, where Website optimization is perceived most effective in attracting traffic. Respondents cite the use of ‘keywords in title and description tags’ as the most used SEM technique, followed by the use of ‘keywords throughout the whole Website’; while ‘Pay for Placement’ was most widely used Paid Search technique. In concurrence with the literature, measuring SEM performance remains a significant challenge with many firms unsure if they measure it effectively. An encouraging finding is that Irish SMEs adopt a positive ethical posture when undertaking SEM.

Teachers of Advertising Media Courses Describe Techniques, Show Computer Applications.

Science.gov (United States)

Lancaster, Kent M.; Martin, Thomas C.

1989-01-01

Reports on a survey of university advertising media teachers regarding textbooks and instructional aids used, teaching techniques, computer applications, student placement, instructor background, and faculty publishing. (SR)

Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm

OpenAIRE

Savsani, Vimal; Patel, Vivek; Gadhvi, Bhargav; Tawhid, Mohamed

2017-01-01

Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS) algorithm, which is based on the search technique of heat transfer search (HTS) algorithm. MOHTS employs the elitist nondominated sorting and crowding dis...

Application of multiple tabu search algorithm to solve dynamic economic dispatch considering generator constraints

International Nuclear Information System (INIS)

Pothiya, Saravuth; Ngamroo, Issarachai; Kongprawechnon, Waree

2008-01-01

This paper presents a new optimization technique based on a multiple tabu search algorithm (MTS) to solve the dynamic economic dispatch (ED) problem with generator constraints. In the constrained dynamic ED problem, the load demand and spinning reserve capacity as well as some practical operation constraints of generators, such as ramp rate limits and prohibited operating zone are taken into consideration. The MTS algorithm introduces additional mechanisms such as initialization, adaptive searches, multiple searches, crossover and restarting process. To show its efficiency, the MTS algorithm is applied to solve constrained dynamic ED problems of power systems with 6 and 15 units. The results obtained from the MTS algorithm are compared to those achieved from the conventional approaches, such as simulated annealing (SA), genetic algorithm (GA), tabu search (TS) algorithm and particle swarm optimization (PSO). The experimental results show that the proposed MTS algorithm approaches is able to obtain higher quality solutions efficiently and with less computational time than the conventional approaches

A speedup technique for (l, d-motif finding algorithms

Directory of Open Access Journals (Sweden)

Dinh Hieu

2011-03-01

Full Text Available Abstract Background The discovery of patterns in DNA, RNA, and protein sequences has led to the solution of many vital biological problems. For instance, the identification of patterns in nucleic acid sequences has resulted in the determination of open reading frames, identification of promoter elements of genes, identification of intron/exon splicing sites, identification of SH RNAs, location of RNA degradation signals, identification of alternative splicing sites, etc. In protein sequences, patterns have proven to be extremely helpful in domain identification, location of protease cleavage sites, identification of signal peptides, protein interactions, determination of protein degradation elements, identification of protein trafficking elements, etc. Motifs are important patterns that are helpful in finding transcriptional regulatory elements, transcription factor binding sites, functional genomics, drug design, etc. As a result, numerous papers have been written to solve the motif search problem. Results Three versions of the motif search problem have been proposed in the literature: Simple Motif Search (SMS, (l, d-motif search (or Planted Motif Search (PMS, and Edit-distance-based Motif Search (EMS. In this paper we focus on PMS. Two kinds of algorithms can be found in the literature for solving the PMS problem: exact and approximate. An exact algorithm identifies the motifs always and an approximate algorithm may fail to identify some or all of the motifs. The exact version of PMS problem has been shown to be NP-hard. Exact algorithms proposed in the literature for PMS take time that is exponential in some of the underlying parameters. In this paper we propose a generic technique that can be used to speedup PMS algorithms. Conclusions We present a speedup technique that can be used on any PMS algorithm. We have tested our speedup technique on a number of algorithms. These experimental results show that our speedup technique is indeed very

Guided Text Search Using Adaptive Visual Analytics

Energy Technology Data Exchange (ETDEWEB)

Steed, Chad A [ORNL; Symons, Christopher T [ORNL; Senter, James K [ORNL; DeNap, Frank A [ORNL

2012-10-01

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 interacts 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.

An introduction to XML query processing and keyword search

CERN Document Server

Lu, Jiaheng

2013-01-01

This book systematically and comprehensively covers the latest advances in XML data searching. It presents an extensive overview of the current query processing and keyword search techniques on XML data.

Beyond the search surface: visual search and attentional engagement.

Science.gov (United States)

Duncan, J; Humphreys, G

1992-05-01

Treisman (1991) described a series of visual search studies testing feature integration theory against an alternative (Duncan & Humphreys, 1989) in which feature and conjunction search are basically similar. Here the latter account is noted to have 2 distinct levels: (a) a summary of search findings in terms of stimulus similarities, and (b) a theory of how visual attention is brought to bear on relevant objects. Working at the 1st level, Treisman found that even when similarities were calibrated and controlled, conjunction search was much harder than feature search. The theory, however, can only really be tested at the 2nd level, because the 1st is an approximation. An account of the findings is developed at the 2nd level, based on the 2 processes of input-template matching and spreading suppression. New data show that, when both of these factors are controlled, feature and conjunction search are equally difficult. Possibilities for unification of the alternative views are considered.

SUSY Searches at ATLAS and CMS

CERN Document Server

Urquijo, P; The ATLAS collaboration

2009-01-01

We review the current strategies to search for Supersymmetry (SUSY) with the ATLAS and CMS detectors at the LHC. The early data discovery potential will be presented for search channels based on missing transverse momentum from undetected neutralinos and multiple high transverse momentum jets. We describe the search for models of gauge-mediated SUSY breaking for which the next to lightest SUSY particle is a neutralino that decays into a photon and gravitino. Examples of measurement techniques that probe the SUSY mass scale in the first data, through reconstruction of kinematic endpoints, are also shown.

Search strategies on the Internet: general and specific.

Science.gov (United States)

Bottrill, Krys

2004-06-01

Some of the most up-to-date information on scientific activity is to be found on the Internet; for example, on the websites of academic and other research institutions and in databases of currently funded research studies provided on the websites of funding bodies. Such information can be valuable in suggesting new approaches and techniques that could be applicable in a Three Rs context. However, the Internet is a chaotic medium, not subject to the meticulous classification and organisation of classical information resources. At the same time, Internet search engines do not match the sophistication of search systems used by database hosts. Also, although some offer relatively advanced features, user awareness of these tends to be low. Furthermore, much of the information on the Internet is not accessible to conventional search engines, giving rise to the concept of the "Invisible Web". General strategies and techniques for Internet searching are presented, together with a comparative survey of selected search engines. The question of how the Invisible Web can be accessed is discussed, as well as how to keep up-to-date with Internet content and improve searching skills.

Connecting Archaeological Data and Grey Literature via Semantic Cross Search

Directory of Open Access Journals (Sweden)

Douglas Tudhope

2011-07-01

Full Text Available Differing terminology and database structure hinders meaningful cross search of excavation datasets. Matching free text grey literature reports with datasets poses yet more challenges. Conventional search techniques are unable to cross search between archaeological datasets and Web-based grey literature. Results are reported from two AHRC funded research projects that investigated the use of semantic techniques to link digital archive databases, vocabularies and associated grey literature. STAR (Semantic Technologies for Archaeological Resources was a collaboration between the University of Glamorgan, Hypermedia Research Unit and English Heritage (EH. The main outcome is a research Demonstrator (available online, which cross searches over excavation datasets from different database schemas, including Raunds Roman, Raunds Prehistoric, Museum of London, Silchester Roman and Stanwick sampling. The system additionally cross searches over an extract of excavation reports from the OASIS index of grey literature, operated by the Archaeology Data Service (ADS. A conceptual framework provided by the CIDOC Conceptual Reference Model (CRM integrates the different database structures and the metadata automatically generated from the OASIS reports by natural language processing techniques. The methods employed for extracting semantic RDF representations from the datasets and the information extraction from grey literature are described. The STELLAR project provides freely available tools to reduce the costs of mapping and extracting data to semantic search systems such as the Demonstrator and to linked data representation generally. Detailed use scenarios (and a screen capture video provide a basis for a discussion of key issues, including cost-benefits, ontology modelling, mapping, terminology control, semantic implementation and information extraction issues. The scenarios show that semantic interoperability can be achieved by mapping and extracting

Active Search on Carcasses versus Pitfall Traps: a Comparison of Sampling Methods.

Science.gov (United States)

Zanetti, N I; Camina, R; Visciarelli, E C; Centeno, N D

2016-04-01

The study of insect succession in cadavers and the classification of arthropods have mostly been done by placing a carcass in a cage, protected from vertebrate scavengers, which is then visited periodically. An alternative is to use specific traps. Few studies on carrion ecology and forensic entomology involving the carcasses of large vertebrates have employed pitfall traps. The aims of this study were to compare both sampling methods (active search on a carcass and pitfall trapping) for each coleopteran family, and to establish whether there is a discrepancy (underestimation and/or overestimation) in the presence of each family by either method. A great discrepancy was found for almost all families with some of them being more abundant in samples obtained through active search on carcasses and others in samples from traps, whereas two families did not show any bias towards a given sampling method. The fact that families may be underestimated or overestimated by the type of sampling technique highlights the importance of combining both methods, active search on carcasses and pitfall traps, in order to obtain more complete information on decomposition, carrion habitat and cadaveric families or species. Furthermore, a hypothesis advanced on the reasons for the underestimation by either sampling method showing biases towards certain families. Information about the sampling techniques indicating which would be more appropriate to detect or find a particular family is provided.

An Improved Forensic Science Information Search.

Science.gov (United States)

Teitelbaum, J

2015-01-01

Although thousands of search engines and databases are available online, finding answers to specific forensic science questions can be a challenge even to experienced Internet users. Because there is no central repository for forensic science information, and because of the sheer number of disciplines under the forensic science umbrella, forensic scientists are often unable to locate material that is relevant to their needs. The author contends that using six publicly accessible search engines and databases can produce high-quality search results. The six resources are Google, PubMed, Google Scholar, Google Books, WorldCat, and the National Criminal Justice Reference Service. Carefully selected keywords and keyword combinations, designating a keyword phrase so that the search engine will search on the phrase and not individual keywords, and prompting search engines to retrieve PDF files are among the techniques discussed. Copyright © 2015 Central Police University.

Refining comparative proteomics by spectral counting to account for shared peptides and multiple search engines.

Science.gov (United States)

Chen, Yao-Yi; Dasari, Surendra; Ma, Ze-Qiang; Vega-Montoto, Lorenzo J; Li, Ming; Tabb, David L

2012-09-01

Spectral counting has become a widely used approach for measuring and comparing protein abundance in label-free shotgun proteomics. However, when analyzing complex samples, the ambiguity of matching between peptides and proteins greatly affects the assessment of peptide and protein inventories, differentiation, and quantification. Meanwhile, the configuration of database searching algorithms that assign peptides to MS/MS spectra may produce different results in comparative proteomic analysis. Here, we present three strategies to improve comparative proteomics through spectral counting. We show that comparing spectral counts for peptide groups rather than for protein groups forestalls problems introduced by shared peptides. We demonstrate the advantage and flexibility of this new method in two datasets. We present four models to combine four popular search engines that lead to significant gains in spectral counting differentiation. Among these models, we demonstrate a powerful vote counting model that scales well for multiple search engines. We also show that semi-tryptic searching outperforms tryptic searching for comparative proteomics. Overall, these techniques considerably improve protein differentiation on the basis of spectral count tables.

LoyalTracker: Visualizing Loyalty Dynamics in Search Engines.

Science.gov (United States)

Shi, Conglei; Wu, Yingcai; Liu, Shixia; Zhou, Hong; Qu, Huamin

2014-12-01

The huge amount of user log data collected by search engine providers creates new opportunities to understand user loyalty and defection behavior at an unprecedented scale. However, this also poses a great challenge to analyze the behavior and glean insights into the complex, large data. In this paper, we introduce LoyalTracker, a visual analytics system to track user loyalty and switching behavior towards multiple search engines from the vast amount of user log data. We propose a new interactive visualization technique (flow view) based on a flow metaphor, which conveys a proper visual summary of the dynamics of user loyalty of thousands of users over time. Two other visualization techniques, a density map and a word cloud, are integrated to enable analysts to gain further insights into the patterns identified by the flow view. Case studies and the interview with domain experts are conducted to demonstrate the usefulness of our technique in understanding user loyalty and switching behavior in search engines.

Investigation of active interrogation techniques to detect special nuclear material in maritime environments: Boarded search of a cargo container ship

International Nuclear Information System (INIS)

Grogan, Brandon R.; Henkel, James J.; Johnson, Jeffrey O.; Mihalczo, John T.; Miller, Thomas M.; Patton, Bruce W.

2013-01-01

The detonation of a terrorist nuclear weapon in the United States would result in the massive loss of life and grave economic damage. Even if a device was not detonated, its known or suspected presence aboard a cargo container ship in a U.S. port would have major economic and political consequences. One possible means to prevent this threat would be to board a ship at sea and search for the device before it reaches port. The scenario considered here involves a small Coast Guard team with strong intelligence boarding a container ship to search for a nuclear device. Using active interrogation, the team would nonintrusively search a block of shipping containers to locate the fissile material. Potential interrogation source and detector technologies for the team are discussed. The methodology of the scan is presented along with a technique for calculating the required interrogation source strength using computer simulations. MCNPX was used to construct a computer model of a container ship, and several search scenarios were simulated. The results of the simulations are presented in terms of the source strength required for each interrogation scenario. Validation measurements were performed in order to scale these simulation results to expected performance. Interrogations through the short (2.4 m) axis of a standardized shipping container appear to be feasible given the entire range of container loadings tested. Interrogations through several containers at once or a single container through its long (12.2 m) axis do not appear to be viable with a portable interrogation system

Investigation of active interrogation techniques to detect special nuclear material in maritime environments: Boarded search of a cargo container ship

Energy Technology Data Exchange (ETDEWEB)

Grogan, Brandon R., E-mail: groganbr@ornl.gov; Henkel, James J.; Johnson, Jeffrey O.; Mihalczo, John T.; Miller, Thomas M.; Patton, Bruce W.

2013-12-01

The detonation of a terrorist nuclear weapon in the United States would result in the massive loss of life and grave economic damage. Even if a device was not detonated, its known or suspected presence aboard a cargo container ship in a U.S. port would have major economic and political consequences. One possible means to prevent this threat would be to board a ship at sea and search for the device before it reaches port. The scenario considered here involves a small Coast Guard team with strong intelligence boarding a container ship to search for a nuclear device. Using active interrogation, the team would nonintrusively search a block of shipping containers to locate the fissile material. Potential interrogation source and detector technologies for the team are discussed. The methodology of the scan is presented along with a technique for calculating the required interrogation source strength using computer simulations. MCNPX was used to construct a computer model of a container ship, and several search scenarios were simulated. The results of the simulations are presented in terms of the source strength required for each interrogation scenario. Validation measurements were performed in order to scale these simulation results to expected performance. Interrogations through the short (2.4 m) axis of a standardized shipping container appear to be feasible given the entire range of container loadings tested. Interrogations through several containers at once or a single container through its long (12.2 m) axis do not appear to be viable with a portable interrogation system.

Searches for heavy resonances in all-jet final states with top quarks using jet substructure techniques with the CMS experiment

Energy Technology Data Exchange (ETDEWEB)

Usai, Emanuele

2017-12-15

While the Standard Model is very successful in describing subnuclear phenomena, it is not a complete theory of particle physics. Several new theories have been developed to address its issues. Many extensions of the Standard Model predict the existence of high-mass resonances. In some cases these resonances have an enhanced coupling to third generation quarks or to a hypothetical new generation of heavy non-chiral quarks. This thesis describes two searches for new phenomena compatible with these theories, in particular a search is presented for resonant top-antitop production, and the first search for heavy resonances decaying to a top quark and a heavy top quark partner T is shown. The searches target the all-jets decay channels and use data collected by the CMS Experiment at the CERN LHC between 2012 and 2015 at a center-of-mass energy of 8 TeV and 13 TeV. Due to the high mass of the resonances considered, the final state particles have a high Lorentz-boost. To reconstruct the hadronic decay of the top quarks and W bosons, jet substructure techniques such as top quark and W boson tagging algorithms, and boosted b jet identification are employed. These algorithms are studied with a particular focus on their validation and performance assessment. No signs of physics beyond the Standard Model are observed, but stringent limits are placed on the production of heavy resonances decaying to top-antitop quark pairs or a top quark and a heavy T quark.

Searches for heavy resonances in all-jet final states with top quarks using jet substructure techniques with the CMS experiment

International Nuclear Information System (INIS)

Usai, Emanuele

2017-12-01

While the Standard Model is very successful in describing subnuclear phenomena, it is not a complete theory of particle physics. Several new theories have been developed to address its issues. Many extensions of the Standard Model predict the existence of high-mass resonances. In some cases these resonances have an enhanced coupling to third generation quarks or to a hypothetical new generation of heavy non-chiral quarks. This thesis describes two searches for new phenomena compatible with these theories, in particular a search is presented for resonant top-antitop production, and the first search for heavy resonances decaying to a top quark and a heavy top quark partner T is shown. The searches target the all-jets decay channels and use data collected by the CMS Experiment at the CERN LHC between 2012 and 2015 at a center-of-mass energy of 8 TeV and 13 TeV. Due to the high mass of the resonances considered, the final state particles have a high Lorentz-boost. To reconstruct the hadronic decay of the top quarks and W bosons, jet substructure techniques such as top quark and W boson tagging algorithms, and boosted b jet identification are employed. These algorithms are studied with a particular focus on their validation and performance assessment. No signs of physics beyond the Standard Model are observed, but stringent limits are placed on the production of heavy resonances decaying to top-antitop quark pairs or a top quark and a heavy T quark.

LETTER TO THE EDITOR: Constant-time solution to the global optimization problem using Brüschweiler's ensemble search algorithm

Science.gov (United States)

Protopopescu, V.; D'Helon, C.; Barhen, J.

2003-06-01

A constant-time solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Brüschweiler's ensemble search algorithm is applied. For adequate sensitivities of the measurement technique, the query complexity of the ensemble search algorithm depends linearly on the size of the function's domain. Advantages and limitations of an eventual NMR implementation are discussed.

An Innovative Approach for online Meta Search Engine Optimization

OpenAIRE

Manral, Jai; Hossain, Mohammed Alamgir

2015-01-01

This paper presents an approach to identify efficient techniques used in Web Search Engine Optimization (SEO). Understanding SEO factors which can influence page ranking in search engine is significant for webmasters who wish to attract large number of users to their website. Different from previous relevant research, in this study we developed an intelligent Meta search engine which aggregates results from various search engines and ranks them based on several important SEO parameters. The r...

Evaluating Semantic Indexing Techniques through Cross-Language Fingerprinting

NARCIS (Netherlands)

Hoenkamp, E.C.M.; Dijk, A.H. van

2005-01-01

Users in search of on-line document sources are usually looking for content, not words. Hence, IR researchers generally agree that search techniques should be geared toward the meaning underlying documents rather than toward the text itself. The most visible examples of such techniques are Latent

Combinatorial search from algorithms to systems

CERN Document Server

Hamadi, Youssef

2013-01-01

This book details key techniques in constraint networks, dealing in particular with constraint satisfaction, search, satisfiability, and applications in machine learning and constraint programming. Includes case studies.

Search for surviving companions in type Ia supernova remnants

International Nuclear Information System (INIS)

Pan, Kuo-Chuan; Ricker, Paul M.; Taam, Ronald E.

2014-01-01

The nature of the progenitor systems of type Ia supernovae (SNe Ia) is still unclear. One way to distinguish between the single-degenerate scenario and double-degenerate scenario for their progenitors is to search for the surviving companions (SCs). Using a technique that couples the results from multi-dimensional hydrodynamics simulations with calculations of the structure and evolution of main-sequence- (MS-) and helium-rich SCs, the color and magnitude of MS- and helium-rich SCs are predicted as functions of time. The SC candidates in Galactic type Ia supernova remnants (Ia SNR) and nearby extragalactic Ia SNRs are discussed. We find that the maximum detectable distance of MS SCs (helium-rich SCs) is 0.6-4 Mpc (0.4-16 Mpc), if the apparent magnitude limit is 27 in the absence of extinction, suggesting that the Large and Small Magellanic Clouds and the Andromeda Galaxy are excellent environments in which to search for SCs. However, only five Ia SNRs have been searched for SCs, showing little support for the standard channels in the singe-degenerate scenario. To better understand the progenitors of SNe Ia, we encourage the search for SCs in other nearby Ia SNRs.

BioCarian: search engine for exploratory searches in heterogeneous biological databases.

Science.gov (United States)

Zaki, Nazar; Tennakoon, Chandana

2017-10-02

There are a large number of biological databases publicly available for scientists in the web. Also, there are many private databases generated in the course of research projects. These databases are in a wide variety of formats. Web standards have evolved in the recent times and semantic web technologies are now available to interconnect diverse and heterogeneous sources of data. Therefore, integration and querying of biological databases can be facilitated by techniques used in semantic web. Heterogeneous databases can be converted into Resource Description Format (RDF) and queried using SPARQL language. Searching for exact queries in these databases is trivial. However, exploratory searches need customized solutions, especially when multiple databases are involved. This process is cumbersome and time consuming for those without a sufficient background in computer science. In this context, a search engine facilitating exploratory searches of databases would be of great help to the scientific community. We present BioCarian, an efficient and user-friendly search engine for performing exploratory searches on biological databases. The search engine is an interface for SPARQL queries over RDF databases. We note that many of the databases can be converted to tabular form. We first convert the tabular databases to RDF. The search engine provides a graphical interface based on facets to explore the converted databases. The facet interface is more advanced than conventional facets. It allows complex queries to be constructed, and have additional features like ranking of facet values based on several criteria, visually indicating the relevance of a facet value and presenting the most important facet values when a large number of choices are available. For the advanced users, SPARQL queries can be run directly on the databases. Using this feature, users will be able to incorporate federated searches of SPARQL endpoints. We used the search engine to do an exploratory search

When Gravity Fails: Local Search Topology

Science.gov (United States)

Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

1997-01-01

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Extracting Structure from Optical Flow Using the Fast Error Search Technique

National Research Council Canada - National Science Library

Srinivasan, Sridar

1998-01-01

...) of an optical flow field, using fast partial search. For each candidate location on a discrete sampling of the image area, we generate a linear system of equations for determining the remaining unknowns, viz...

Hough transform search for continuous gravitational waves

International Nuclear Information System (INIS)

Krishnan, Badri; Papa, Maria Alessandra; Sintes, Alicia M.; Schutz, Bernard F.; Frasca, Sergio; Palomba, Cristiano

2004-01-01

This paper describes an incoherent method to search for continuous gravitational waves based on the Hough transform, a well-known technique used for detecting patterns in digital images. We apply the Hough transform to detect patterns in the time-frequency plane of the data produced by an earth-based gravitational wave detector. Two different flavors of searches will be considered, depending on the type of input to the Hough transform: either Fourier transforms of the detector data or the output of a coherent matched-filtering type search. We present the technical details for implementing the Hough transform algorithm for both kinds of searches, their statistical properties, and their sensitivities

A New Search for Elementary Particles with Fractional Electric Charge Using an Improved Millikan Technique

Energy Technology Data Exchange (ETDEWEB)

Mar, Nancy

2003-08-18

The authors have devised and demonstrated the successful operation of a low cost, high mass throughput technique capable of performing bulk matter searches for fractionally charged particles based on an improved Millikan liquid drop method. The method uses a stroboscopic lamp and a CCD video camera to image the trajectories of silicone oil drops falling through air in the presence of a vertical, alternating electric field. The images of the trajectories are computer processed in real time, the electric charge on a drop being measured with an rms error of 0.025 of an electron charge. This error is dominated by Brownian motion. In the first use of this method, they have looked at 5,974,941 drops and found no evidence for fractional charges in 1.07 mg of oil. With 95% confidence, the concentration of isolated quarks with {+-} 1/3e or {+-} 2/3e in silicone oil is less than one per 2.14 x 10{sup 20} nucleons.

Ringed Seal Search for Global Optimization via a Sensitive Search Model.

Directory of Open Access Journals (Sweden)

Younes Saadi

Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search

Science.gov (United States)

Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-01

Background Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these “experts.” Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. Objective The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the “Google generation” than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Methods Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is “Google-like,” enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Results Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F 1,19=37.3, Peffect of task (F 3,57=6.3, Pinterface (F 1,19=18.0, Peffect of task (F 2,38=4.1, P=.025, Greenhouse

Searches for New Physics in boosted topologies at ATLAS

CERN Multimedia

CERN. Geneva

2016-01-01

The large increase in collision energy that the LHC reached in Run 2  provides an unprecedented opportunity to search for new physics beyond the Standard Model (SM). Various extensions of the SM predict heavy resonances at the TeV scale, which couple predominantly to the Higgs and electroweak gauge bosons and to top and bottom quarks. At resonance masses well above 1 TeV, these searches face specific challenges and  employ new identification techniques to disentangle the decay products of the boson in highly boosted configurations. This talk will review recent ATLAS Run-2 searches in various possible final states as well as  the dedicated techniques related to the specificity of such event topologies.

Indirect search for New Physics: complementarity to direct searches

CERN Document Server

Mahmoudi, F

2013-01-01

We present an overview on the interplay between direct searches for new physics at the LHC and indirect constraints from the flavour sector, with an emphasis on the implications of the recent LHCb results. The complementarity with the Higgs search results will also be addressed. We show the correlation and complementarity between the different sectors in the context of a few specific examples in supersymmetry.

Retrospective search on biomass harvesting techniques including materials handling and storage

Energy Technology Data Exchange (ETDEWEB)

1985-10-01

This literature search covers the period 1977 to date. The harvesting, materials handling and storage of the following materials: wood; crops and crop residues; peat; sugar cane; reeds, grasses and fers; algae and jojoba shrubs are covered.

Applications of prospecting geochemical techniques to the search for and to the study of uranium deposits in metropolitan France

International Nuclear Information System (INIS)

Grimbert, Arnold

1957-01-01

After having recalled facts which leaded the CEA to use new geochemical techniques for the prospecting of uranium deposits through sampling and analysis of soils and waters, the author describes the organisation and methods implemented for this prospecting activity: team composition for sampling and analysis, role of each engineer and technician in the prospecting stages (preliminary study, routine prospecting, result interpretation), sampling and analysis processes. He also reports campaigns of geochemical prospecting: study of the La Chapelle Largeau deposit (objectives, geological context, preliminary study, routine prospecting, study of geochemical anomalies), tactical research on Verneix indices (study of radioactivity anomaly discovered by radio-prospecting), strategical searches in a non prospected area in the South of Avallon. The author discusses the issues of efficiency and cost price of this geochemical prospecting technique in soils and in waters. Appendices present the equipment and operation modality for soil sampling, and for soil sample preparation, and principles, equipment and products for soil analysis and for water analysis [fr

Use of search engine optimization factors for Google page rank prediction

OpenAIRE

Tvrdi, Barbara

2012-01-01

Over the years, search engines have become an important tool for finding information. It is known that users select the link on the first page of search results in 62% of the cases. Search engine optimization techniques enable website improvement and therefore a better ranking in search engines. The exact specification of the factors that affect website ranking is not disclosed by search engine owners. In this thesis we tried to choose some most frequently mentioned search engine optimizatio...

An operational search and rescue model for the Norwegian Sea and the North Sea

Science.gov (United States)

Breivik, Øyvind; Allen, Arthur A.

A new operational, ensemble-based search and rescue model for the Norwegian Sea and the North Sea is presented. The stochastic trajectory model computes the net motion of a range of search and rescue objects. A new, robust formulation for the relation between the wind and the motion of the drifting object (termed the leeway of the object) is employed. Empirically derived coefficients for 63 categories of search objects compiled by the US Coast Guard are ingested to estimate the leeway of the drifting objects. A Monte Carlo technique is employed to generate an ensemble that accounts for the uncertainties in forcing fields (wind and current), leeway drift properties, and the initial position of the search object. The ensemble yields an estimate of the time-evolving probability density function of the location of the search object, and its envelope defines the search area. Forcing fields from the operational oceanic and atmospheric forecast system of The Norwegian Meteorological Institute are used as input to the trajectory model. This allows for the first time high-resolution wind and current fields to be used to forecast search areas up to 60 h into the future. A limited set of field exercises show good agreement between model trajectories, search areas, and observed trajectories for life rafts and other search objects. Comparison with older methods shows that search areas expand much more slowly using the new ensemble method with high resolution forcing fields and the new leeway formulation. It is found that going to higher-order stochastic trajectory models will not significantly improve the forecast skill and the rate of expansion of search areas.

A Linear Time Complexity of Breadth-First Search Using P System with Membrane Division

Directory of Open Access Journals (Sweden)

Einallah Salehi

2013-01-01

Full Text Available One of the known methods for solving the problems with exponential time complexity such as NP-complete problems is using the brute force algorithms. Recently, a new parallel computational framework called Membrane Computing is introduced which can be applied in brute force algorithms. The usual way to find a solution for the problems with exponential time complexity with Membrane Computing techniques is by P System with active membrane using division rule. It makes an exponential workspace and solves the problems with exponential complexity in a polynomial (even linear time. On the other hand, searching is currently one of the most used methods for finding solution for problems in real life, that the blind search algorithms are accurate, but their time complexity is exponential such as breadth-first search (BFS algorithm. In this paper, we proposed a new approach for implementation of BFS by using P system with division rule technique for first time. The theorem shows time complexity of BSF in this framework on randomly binary trees reduced from O(2d to O(d.

Neural field model of memory-guided search.

Science.gov (United States)

Kilpatrick, Zachary P; Poll, Daniel B

2017-12-01

Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

Neural field model of memory-guided search

Science.gov (United States)

Kilpatrick, Zachary P.; Poll, Daniel B.

2017-12-01

Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Ho-Lung Hung

2008-08-01

Full Text Available A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

A Suboptimal PTS Algorithm Based on Particle Swarm Optimization Technique for PAPR Reduction in OFDM Systems

Directory of Open Access Journals (Sweden)

Lee Shu-Hong

2008-01-01

Full Text Available Abstract A suboptimal partial transmit sequence (PTS based on particle swarm optimization (PSO algorithm is presented for the low computation complexity and the reduction of the peak-to-average power ratio (PAPR of an orthogonal frequency division multiplexing (OFDM system. In general, PTS technique can improve the PAPR statistics of an OFDM system. However, it will come with an exhaustive search over all combinations of allowed phase weighting factors and the search complexity increasing exponentially with the number of subblocks. In this paper, we work around potentially computational intractability; the proposed PSO scheme exploits heuristics to search the optimal combination of phase factors with low complexity. Simulation results show that the new technique can effectively reduce the computation complexity and PAPR reduction.

Modeling visual search using three-parameter probability functions in a hierarchical Bayesian framework.

Science.gov (United States)

Lin, Yi-Shin; Heinke, Dietmar; Humphreys, Glyn W

2015-04-01

In this study, we applied Bayesian-based distributional analyses to examine the shapes of response time (RT) distributions in three visual search paradigms, which varied in task difficulty. In further analyses we investigated two common observations in visual search-the effects of display size and of variations in search efficiency across different task conditions-following a design that had been used in previous studies (Palmer, Horowitz, Torralba, & Wolfe, Journal of Experimental Psychology: Human Perception and Performance, 37, 58-71, 2011; Wolfe, Palmer, & Horowitz, Vision Research, 50, 1304-1311, 2010) in which parameters of the response distributions were measured. Our study showed that the distributional parameters in an experimental condition can be reliably estimated by moderate sample sizes when Monte Carlo simulation techniques are applied. More importantly, by analyzing trial RTs, we were able to extract paradigm-dependent shape changes in the RT distributions that could be accounted for by using the EZ2 diffusion model. The study showed that Bayesian-based RT distribution analyses can provide an important means to investigate the underlying cognitive processes in search, including stimulus grouping and the bottom-up guidance of attention.

GammeV: a milli-eV particle search at Fermilab

International Nuclear Information System (INIS)

Wester, William Carl III

2008-01-01

GammeV is an experiment conducted at Fermilab that employs the light shining through a wall technique to search for axion-like particles and employs a particle in a jar technique to search for dilaton-like chameleon particles. We obtain limits on the coupling of photons to an axion-like particle that extend previous limits for both scalars and pseudoscalars in the milli-eV mass range. We are able to exclude the axion-like particle interpretation of the anomalous PVLAS 2006 result by more than 5 standard deviations. We also present results on a search for chameleons and set limits on their possible coupling to photons

Intelligent bioinformatics : the application of artificial intelligence techniques to bioinformatics problems

National Research Council Canada - National Science Library

Keedwell, Edward

2005-01-01

... Intelligence and Computer Science 3.1 Introduction to search 3.2 Search algorithms 3.3 Heuristic search methods 3.4 Optimal search strategies 3.5 Problems with search techniques 3.6 Complexity of...

ElasticSearch server

CERN Document Server

Rogozinski, Marek

2014-01-01

This book is a detailed, practical, hands-on guide packed with real-life scenarios and examples which will show you how to implement an ElasticSearch search engine on your own websites.If you are a web developer or a user who wants to learn more about ElasticSearch, then this is the book for you. You do not need to know anything about ElastiSeach, Java, or Apache Lucene in order to use this book, though basic knowledge about databases and queries is required.

Multipath Detection Using Boolean Satisfiability Techniques

Directory of Open Access Journals (Sweden)

Fadi A. Aloul

2011-01-01

Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.

Does linear separability really matter? Complex visual search is explained by simple search

Science.gov (United States)

Vighneshvel, T.; Arun, S. P.

2013-01-01

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search. PMID:24029822

Exotic diboson searches in the $\\ell\

CERN Document Server

Biesuz, Nicolo Vladi; The ATLAS collaboration

2017-01-01

Analyses searching for diboson resonances are very powerful tools to investigate many beyond the Standard Model (BSM) scenarios such as extension of the Higgs sector, Heavy Vector triplets (W’ and Z’) or excited states of Gravitons. These searches exploit the many decay channels of the two bosons allowing to select topologies with varied signal to background ratios and statistics. Among these searches the search for WW/WZ in the semileptonic final state finds a compromise between the high signal statistics allowed by the high branching ratio of the hadronic decay of the gauge boson while profiting of the good trigger and analysis signature of the lepton, decay product of the second gauge boson. The WW/WZ search for TeV scale resonances in the ℓνqq channel will be detailed, explaining the current boson-tagging techniques and the signal categorization used to improve sensitivity. The limit presently set in the various scenarios using 2015-2016 dataset will be reported.

The Higgs Boson Search and Discovery

CERN Document Server

Bernardi, Gregorio

2016-01-01

We present a brief account of the search for the Higgs boson at the three major colliders that have operated over the last three decades: LEP, the Tevatron, and the LHC. The experimental challenges encountered stemmed from the distinct event phenomenology as determined by the colliders energy and the possible values for the Higgs boson mass, and from the capability of these colliders to deliver as much collision data as possible to fully explore the mass spectrum within their reach. Focusing more on the hadron collider searches during the last decade, we discuss how the search for the Higgs boson was advanced through mastering the experimental signatures of standard theory backgrounds, through the comprehensive utilization of the features of the detectors involved in the searches, and by means of advanced data analysis techniques. The search culminated in 2012 with the discovery, by the ATLAS and CMS collaborations, of a Higgs-like particle with mass close to 125 GeV, confirmed more recently to have propertie...

Approximate search for Big Data with applications in information security – A survey

Directory of Open Access Journals (Sweden)

Slobodan Petrović

2015-04-01

Full Text Available This paper is a survey of approximate search techniques in very large data sets (so-called Big Data. After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malware detection, intrusion detection are reviewed. Finally, the need for constraints in approximate search regarding the number of so-called elementary edit operations and the run lengths of particular elementary edit operations is explained and the status of on-going research on efficient implementation of approximate search algorithms with various constraints is given.

Undergraduate Students' Information Search Practices

Science.gov (United States)

Nikolopoulou, Kleopatra; Gialamas, Vasilis

2011-01-01

This paper investigates undergraduate students' information search practices. The subjects were 250 undergraduate students from two university departments in Greece, and a questionnaire was used to document their search practices. The results showed that the Web was the primary information system searched in order to find information for…

Search for strange baryon electric dipole moment at LHCb

CERN Document Server

Lewis, Daniel James

2017-01-01

A search for the EDM of $\\Lambda$ baryons using the LHCb detector is proposed. In order to perform this search, the reconstruction of $\\Lambda$ baryons using T tracks must be possible. This note presents the reconstruction techniques and resolution studies that demonstrate that this is indeed feasible.

Searching Choices: Quantifying Decision-Making Processes Using Search Engine Data.

Science.gov (United States)

Moat, Helen Susannah; Olivola, Christopher Y; Chater, Nick; Preis, Tobias

2016-07-01

When making a decision, humans consider two types of information: information they have acquired through their prior experience of the world, and further information they gather to support the decision in question. Here, we present evidence that data from search engines such as Google can help us model both sources of information. We show that statistics from search engines on the frequency of content on the Internet can help us estimate the statistical structure of prior experience; and, specifically, we outline how such statistics can inform psychological theories concerning the valuation of human lives, or choices involving delayed outcomes. Turning to information gathering, we show that search query data might help measure human information gathering, and it may predict subsequent decisions. Such data enable us to compare information gathered across nations, where analyses suggest, for example, a greater focus on the future in countries with a higher per capita GDP. We conclude that search engine data constitute a valuable new resource for cognitive scientists, offering a fascinating new tool for understanding the human decision-making process. Copyright © 2016 The Authors. Topics in Cognitive Science published by Wiley Periodicals, Inc. on behalf of Cognitive Science Society.

Content Based Searching for INIS

International Nuclear Information System (INIS)

Jain, V.; Jain, R.K.

2016-01-01

Full text: Whatever a user wants is available on the internet, but to retrieve the information efficiently, a multilingual and most-relevant document search engine is a must. Most current search engines are word based or pattern based. They do not consider the meaning of the query posed to them; purely based on the keywords of the query; no support of multilingual query and and dismissal of nonrelevant results. Current information-retrieval techniques either rely on an encoding process, using a certain perspective or classification scheme, to describe a given item, or perform a full-text analysis, searching for user-specified words. Neither case guarantees content matching because an encoded description might reflect only part of the content and the mere occurrence of a word does not necessarily reflect the document’s content. For general documents, there doesn’t yet seem to be a much better option than lazy full-text analysis, by manually going through those endless results pages. In contrast to this, new search engine should extract the meaning of the query and then perform the search based on this extracted meaning. New search engine should also employ Interlingua based machine translation technology to present information in the language of choice of the user. (author

Dark-matter QCD-axion searches

International Nuclear Information System (INIS)

Rosenberg, Leslie J

2010-01-01

The axion is a hypothetical elementary particle appearing in a simple and elegant extension to the Standard Model of particle physics that cancels otherwise huge CP-violating effects in QCD; this extension has a broken U(1) axial symmetry, where the resulting Goldstone Boson is the axion. A light axion of mass 10 -(6-3) eV (the so-called i nvisible 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 would be a compelling dark-matter candidate and is therefore a target of a number of searches. Compared to other dark-matter candidates, the plausible range of axion dark-matter couplings and masses is narrowly constrained. This restricted search space allows for 'definitive' searches, where non-observation would seriously impugn the dark-matter QCD-axion hypothesis. Axion searches employ a wide range of technologies and techniques, from astrophysical observations to laboratory electromagnetic signal detection. For some experiments, sensitivities are have reached likely dark-matter axion couplings and masses. This is a brief and selective overview of axion searches. With only very limited space, I briefly describe just two of the many experiments that are searching for dark-matter axions.

Search-Order Independent State Caching

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2010-01-01

State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search to ensure termination.We propose and experimentally evaluate an extension of the state caching method for general state...

Search for high-mass $\\mathrm{ Z }\\gamma$ resonances in proton-proton collisions at $\\sqrt{s}=$ 8 and 13 TeV using jet substructure techniques

CERN Document Server

Sirunyan, Albert M; Adam, Wolfgang; Aşılar, Ece; Bergauer, Thomas; Brandstetter, Johannes; Brondolin, Erica; Dragicevic, Marko; Erö, Janos; Flechl, Martin; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hartl, Christian; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; König, Axel; Krätschmer, Ilse; Liko, Dietrich; Matsushita, Takashi; Mikulec, Ivan; Rabady, Dinyar; Rad, Navid; Rahbaran, Babak; Rohringer, Herbert; Schieck, Jochen; Strauss, Josef; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Dvornikov, Oleg; Makarenko, Vladimir; Mossolov, Vladimir; Suarez Gonzalez, Juan; Zykunov, Vladimir; Shumeiko, Nikolai; Alderweireldt, Sara; De Wolf, Eddi A; Janssen, Xavier; Lauwers, Jasper; Van De Klundert, Merijn; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Abu Zeid, Shimaa; Blekman, Freya; D'Hondt, Jorgen; Daci, Nadir; De Bruyn, Isabelle; Deroover, Kevin; Lowette, Steven; Moortgat, Seth; Moreels, Lieselotte; Olbrechts, Annik; Python, Quentin; Skovpen, Kirill; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Parijs, Isis; Brun, Hugues; Clerbaux, Barbara; De Lentdecker, Gilles; Delannoy, Hugo; Fasanella, Giuseppe; Favart, Laurent; Goldouzian, Reza; Grebenyuk, Anastasia; Karapostoli, Georgia; Lenzi, Thomas; Léonard, Alexandre; Luetic, Jelena; Maerschalk, Thierry; Marinov, Andrey; Randle-conde, Aidan; Seva, Tomislav; Vander Velde, Catherine; Vanlaer, Pascal; Vannerom, David; Yonamine, Ryo; Zenoni, Florian; Zhang, Fengwangdong; Cimmino, Anna; Cornelis, Tom; Dobur, Didar; Fagot, Alexis; Gul, Muhammad; Khvastunov, Illia; Poyraz, Deniz; Salva Diblen, Sinem; Schöfbeck, Robert; Tytgat, Michael; Van Driessche, Ward; Yazgan, Efe; Zaganidis, Nicolas; Bakhshiansohi, Hamed; Beluffi, Camille; Bondu, Olivier; Brochet, Sébastien; Bruno, Giacomo; Caudron, Adrien; De Visscher, Simon; Delaere, Christophe; Delcourt, Martin; Francois, Brieuc; Giammanco, Andrea; Jafari, Abideh; Komm, Matthias; Krintiras, Georgios; Lemaitre, Vincent; Magitteri, Alessio; Mertens, Alexandre; Musich, Marco; Piotrzkowski, Krzysztof; Quertenmont, Loic; Selvaggi, Michele; Vidal Marono, Miguel; Wertz, Sébastien; Beliy, Nikita; Aldá Júnior, Walter Luiz; Alves, Fábio Lúcio; Alves, Gilvan; Brito, Lucas; Hensel, Carsten; Moraes, Arthur; Pol, Maria Elena; Rebello Teles, Patricia; Belchior Batista Das Chagas, Ewerton; Carvalho, Wagner; Chinellato, Jose; Custódio, Analu; Melo Da Costa, Eliza; Da Silveira, Gustavo Gil; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Huertas Guativa, Lina Milena; Malbouisson, Helena; Matos Figueiredo, Diego; Mora Herrera, Clemencia; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Sznajder, Andre; Tonelli Manganote, Edmilson José; Torres Da Silva De Araujo, Felipe; Vilela Pereira, Antonio; Ahuja, Sudha; Bernardes, Cesar Augusto; Dogra, Sunil; Tomei, Thiago; De Moraes Gregores, Eduardo; Mercadante, Pedro G; Moon, Chang-Seong; Novaes, Sergio F; Padula, Sandra; Romero Abad, David; Ruiz Vargas, José Cupertino; Aleksandrov, Aleksandar; Hadjiiska, Roumyana; Iaydjiev, Plamen; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Vutova, Mariana; Dimitrov, Anton; Glushkov, Ivan; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Fang, Wenxing; Ahmad, Muhammad; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Chen, Mingshui; Chen, Ye; Cheng, Tongguang; Jiang, Chun-Hua; Leggat, Duncan; Liu, Zhenan; Romeo, Francesco; Ruan, Manqi; Shaheen, Sarmad Masood; Spiezia, Aniello; Tao, Junquan; Wang, Chunjie; Wang, Zheng; Zhang, Huaqiao; Zhao, Jingzhou; Ban, Yong; Chen, Geng; Li, Qiang; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Wang, Dayong; Xu, Zijun; Avila, Carlos; Cabrera, Andrés; Chaparro Sierra, Luisa Fernanda; Florez, Carlos; Gomez, Juan Pablo; González Hernández, Carlos Felipe; Ruiz Alvarez, José David; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Puljak, Ivica; Ribeiro Cipriano, Pedro M; Sculac, Toni; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Ferencek, Dinko; Kadija, Kreso; Mesic, Benjamin; Susa, Tatjana; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Rykaczewski, Hans; Tsiakkouri, Demetra; Finger, Miroslav; Finger Jr, Michael; Carrera Jarrin, Edgar; El-khateeb, Esraa; Elgammal, Sherif; Mohamed, Amr; Kadastik, Mario; Perrini, Lucia; Raidal, Martti; Tiko, Andres; Veelken, Christian; Eerola, Paula; Pekkanen, Juska; Voutilainen, Mikko; Härkönen, Jaakko; Jarvinen, Terhi; Karimäki, Veikko; Kinnunen, Ritva; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Tuominiemi, Jorma; Tuovinen, Esa; Wendland, Lauri; Talvitie, Joonas; Tuuva, Tuure; Besancon, Marc; Couderc, Fabrice; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Favaro, Carlotta; Ferri, Federico; Ganjour, Serguei; Ghosh, Saranya; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Kucher, Inna; Locci, Elizabeth; Machet, Martina; Malcles, Julie; Rander, John; Rosowsky, André; Titov, Maksym; Abdulsalam, Abdulla; Antropov, Iurii; Baffioni, Stephanie; Beaudette, Florian; Busson, Philippe; Cadamuro, Luca; Chapon, Emilien; Charlot, Claude; Davignon, Olivier; Granier de Cassagnac, Raphael; Jo, Mihee; Lisniak, Stanislav; Miné, Philippe; Nguyen, Matthew; Ochando, Christophe; Ortona, Giacomo; Paganini, Pascal; Pigard, Philipp; Regnard, Simon; Salerno, Roberto; Sirois, Yves; Strebler, Thomas; Yilmaz, Yetkin; Zabi, Alexandre; Zghiche, Amina; Agram, Jean-Laurent; Andrea, Jeremy; Aubin, Alexandre; Bloch, Daniel; Brom, Jean-Marie; Buttignol, Michael; Chabert, Eric Christian; Chanon, Nicolas; Collard, Caroline; Conte, Eric; Coubez, Xavier; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Le Bihan, Anne-Catherine; Van Hove, Pierre; Gadrat, Sébastien; Beauceron, Stephanie; Bernet, Colin; Boudoul, Gaelle; Carrillo Montoya, Camilo Andres; Chierici, Roberto; Contardo, Didier; Courbon, Benoit; Depasse, Pierre; El Mamouni, Houmani; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Grenier, Gérald; Ille, Bernard; Lagarde, Francois; Laktineh, Imad Baptiste; Lethuillier, Morgan; Mirabito, Laurent; Pequegnot, Anne-Laure; Perries, Stephane; Popov, Andrey; Sabes, David; Sordini, Viola; Vander Donckt, Muriel; Verdier, Patrice; Viret, Sébastien; Khvedelidze, Arsen; Tsamalaidze, Zviad; Autermann, Christian; Beranek, Sarah; Feld, Lutz; Kiesel, Maximilian Knut; Klein, Katja; Lipinski, Martin; Preuten, Marius; Schomakers, Christian; Schulz, Johannes; Verlage, Tobias; Albert, Andreas; Brodski, Michael; Dietz-Laursonn, Erik; Duchardt, Deborah; Endres, Matthias; Erdmann, Martin; Erdweg, Sören; Esch, Thomas; Fischer, Robert; Güth, Andreas; Hamer, Matthias; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Knutzen, Simon; Merschmeyer, Markus; Meyer, Arnd; Millet, Philipp; Mukherjee, Swagata; Olschewski, Mark; Padeken, Klaas; Pook, Tobias; Radziej, Markus; Reithler, Hans; Rieger, Marcel; Scheuch, Florian; Sonnenschein, Lars; Teyssier, Daniel; Thüer, Sebastian; Cherepanov, Vladimir; Flügge, Günter; Kargoll, Bastian; Kress, Thomas; Künsken, Andreas; Lingemann, Joschka; Müller, Thomas; Nehrkorn, Alexander; Nowack, Andreas; Pistone, Claudia; Pooth, Oliver; Stahl, Achim; Aldaya Martin, Maria; Arndt, Till; Asawatangtrakuldee, Chayanit; Beernaert, Kelly; Behnke, Olaf; Behrens, Ulf; Bin Anuar, Afiq Aizuddin; Borras, Kerstin; Campbell, Alan; Connor, Patrick; Contreras-Campana, Christian; Costanza, Francesco; Diez Pardos, Carmen; Dolinska, Ganna; Eckerlin, Guenter; Eckstein, Doris; Eichhorn, Thomas; Eren, Engin; Gallo, Elisabetta; Garay Garcia, Jasone; Geiser, Achim; Gizhko, Andrii; Grados Luyando, Juan Manuel; Grohsjean, Alexander; Gunnellini, Paolo; Harb, Ali; Hauk, Johannes; Hempel, Maria; Jung, Hannes; Kalogeropoulos, Alexis; Karacheban, Olena; Kasemann, Matthias; Keaveney, James; Kleinwort, Claus; Korol, Ievgen; Krücker, Dirk; Lange, Wolfgang; Lelek, Aleksandra; Lenz, Teresa; Leonard, Jessica; Lipka, Katerina; Lobanov, Artur; Lohmann, Wolfgang; Mankel, Rainer; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mittag, Gregor; Mnich, Joachim; Mussgiller, Andreas; Pitzl, Daniel; Placakyte, Ringaile; Raspereza, Alexei; Roland, Benoit; Sahin, Mehmet Özgür; Saxena, Pooja; Schoerner-Sadenius, Thomas; Spannagel, Simon; Stefaniuk, Nazar; Van Onsem, Gerrit Patrick; Walsh, Roberval; Wissing, Christoph; Blobel, Volker; Centis Vignali, Matteo; Draeger, Arne-Rasmus; Dreyer, Torben; Garutti, Erika; Gonzalez, Daniel; Haller, Johannes; Hoffmann, Malte; Junkes, Alexandra; Klanner, Robert; Kogler, Roman; Kovalchuk, Nataliia; Lapsien, Tobias; Marchesini, Ivan; Marconi, Daniele; Meyer, Mareike; Niedziela, Marek; Nowatschin, Dominik; Pantaleo, Felice; Peiffer, Thomas; Perieanu, Adrian; Scharf, Christian; Schleper, Peter; Schmidt, Alexander; Schumann, Svenja; Schwandt, Joern; Stadie, Hartmut; Steinbrück, Georg; Stober, Fred-Markus Helmut; Stöver, Marc; Tholen, Heiner; Troendle, Daniel; Usai, Emanuele; Vanelderen, Lukas; Vanhoefer, Annika; Vormwald, Benedikt; Akbiyik, Melike; Barth, Christian; Baur, Sebastian; Baus, Colin; Berger, Joram; Butz, Erik; Caspart, René; Chwalek, Thorsten; Colombo, Fabio; De Boer, Wim; Dierlamm, Alexander; Fink, Simon; Freund, Benedikt; Friese, Raphael; Giffels, Manuel; Gilbert, Andrew; Goldenzweig, Pablo; Haitz, Dominik; Hartmann, Frank; Heindl, Stefan Michael; Husemann, Ulrich; Katkov, Igor; Kudella, Simon; Mildner, Hannes; Mozer, Matthias Ulrich; Müller, Thomas; Plagge, Michael; Quast, Gunter; Rabbertz, Klaus; Röcker, Steffen; Roscher, Frank; Schröder, Matthias; Shvetsov, Ivan; Sieber, Georg; Simonis, Hans-Jürgen; Ulrich, Ralf; Wayand, Stefan; Weber, Marc; Weiler, Thomas; Williamson, Shawn; Wöhrmann, Clemens; Wolf, Roger; Anagnostou, Georgios; Daskalakis, Georgios; Geralis, Theodoros; Giakoumopoulou, Viktoria Athina; Kyriakis, Aristotelis; Loukas, Demetrios; Topsis-Giotis, Iasonas; Kesisoglou, Stilianos; Panagiotou, Apostolos; Saoulidou, Niki; Tziaferi, Eirini; Evangelou, Ioannis; Flouris, Giannis; Foudas, Costas; Kokkas, Panagiotis; Loukas, Nikitas; Manthos, Nikolaos; Papadopoulos, Ioannis; Paradas, Evangelos; Filipovic, Nicolas; Pasztor, Gabriella; Bencze, Gyorgy; Hajdu, Csaba; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Zsigmond, Anna Julia; Beni, Noemi; Czellar, Sandor; Karancsi, János; Makovec, Alajos; Molnar, Jozsef; Szillasi, Zoltan; Bartók, Márton; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Komaragiri, Jyothsna Rani; Bahinipati, Seema; Bhowmik, Sandeep; Choudhury, Somnath; Mal, Prolay; Mandal, Koushik; Nayak, Aruna; Sahoo, Deepak Kumar; Sahoo, Niladribihari; Swain, Sanjay Kumar; Bansal, Sunil; Beri, Suman Bala; Bhatnagar, Vipin; Chawla, Ridhi; Bhawandeep, Bhawandeep; Kalsi, Amandeep Kaur; Kaur, Anterpreet; Kaur, Manjit; Kumar, Ramandeep; Kumari, Priyanka; Mehta, Ankita; Mittal, Monika; Singh, Jasbir; Walia, Genius; Kumar, Ashok; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Garg, Rocky Bala; Keshri, Sumit; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Ramkrishna; Sharma, Varun; Bhattacharya, Rajarshi; Bhattacharya, Satyaki; Chatterjee, Kalyanmoy; Dey, Sourav; Dutt, Suneel; Dutta, Suchandra; Ghosh, Shamik; Majumdar, Nayana; Modak, Atanu; Mondal, Kuntal; Mukhopadhyay, Supratik; Nandan, Saswati; Purohit, Arnab; Roy, Ashim; Roy, Debarati; Roy Chowdhury, Suvankar; Sarkar, Subir; Sharan, Manoj; Thakur, Shalini; Behera, Prafulla Kumar; Chudasama, Ruchi; Dutta, Dipanwita; Jha, Vishwajeet; Kumar, Vineet; Mohanty, Ajit Kumar; Netrakanti, Pawan Kumar; Pant, Lalit Mohan; Shukla, Prashant; Topkar, Anita; Aziz, Tariq; Dugad, Shashikant; Kole, Gouranga; Mahakud, Bibhuprasad; Mitra, Soureek; Mohanty, Gagan Bihari; Parida, Bibhuti; Sur, Nairit; Sutar, Bajrang; Banerjee, Sudeshna; Dewanjee, Ram Krishna; Ganguly, Sanmay; Guchait, Monoranjan; Jain, Sandhya; Kumar, Sanjeev; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Sarkar, Tanmay; Wickramage, Nadeesha; Chauhan, Shubhanshu; Dube, Sourabh; Hegde, Vinay; Kapoor, Anshul; Kothekar, Kunal; Pandey, Shubham; Rane, Aditee; Sharma, Seema; Chenarani, Shirin; Eskandari Tadavani, Esmaeel; Etesami, Seyed Mohsen; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Naseri, Mohsen; Paktinat Mehdiabadi, Saeid; Rezaei Hosseinabadi, Ferdos; Safarzadeh, Batool; Zeinali, Maryam; Felcini, Marta; Grunewald, Martin; Abbrescia, Marcello; Calabria, Cesare; Caputo, Claudio; Colaleo, Anna; Creanza, Donato; Cristella, Leonardo; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Maggi, Giorgio; Maggi, Marcello; Miniello, Giorgia; My, Salvatore; Nuzzo, Salvatore; Pompili, Alexis; Pugliese, Gabriella; Radogna, Raffaella; Ranieri, Antonio; Selvaggi, Giovanna; Sharma, Archana; Silvestris, Lucia; Venditti, Rosamaria; Verwilligen, Piet; Abbiendi, Giovanni; Battilana, Carlo; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Campanini, Renato; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Chhibra, Simranjit Singh; Codispoti, Giuseppe; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Montanari, Alessandro; Navarria, Francesco; Perrotta, Andrea; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Tosi, Nicolò; Albergo, Sebastiano; Costa, Salvatore; Di Mattia, Alessandro; Giordano, Ferdinando; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Lenzi, Piergiulio; Meschini, Marco; Paoletti, Simone; Russo, Lorenzo; Sguazzoni, Giacomo; Strom, Derek; Viliani, Lorenzo; Benussi, Luigi; Bianco, Stefano; Fabbri, Franco; Piccolo, Davide; Primavera, Federica; Calvelli, Valerio; Ferro, Fabrizio; Monge, Maria Roberta; Robutti, Enrico; Tosi, Silvano; Brianza, Luca; Brivio, Francesco; Ciriolo, Vincenzo; Dinardo, Mauro Emanuele; Fiorendi, Sara; Gennai, Simone; Ghezzi, Alessio; Govoni, Pietro; Malberti, Martina; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Pigazzini, Simone; Ragazzi, Stefano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Cavallo, Nicola; De Nardo, Guglielmo; Di Guida, Salvatore; Esposito, Marco; Fabozzi, Francesco; Fienga, Francesco; Iorio, Alberto Orso Maria; Lanza, Giuseppe; Lista, Luca; Meola, Sabino; Paolucci, Pierluigi; Sciacca, Crisostomo; Thyssen, Filip; Azzi, Patrizia; Bacchetta, Nicola; Benato, Lisa; Bisello, Dario; Boletti, Alessio; Carlin, Roberto; Carvalho Antunes De Oliveira, Alexandra; Checchia, Paolo; Dall'Osso, Martino; De Castro Manzano, Pablo; Dorigo, Tommaso; Dosselli, Umberto; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Lacaprara, Stefano; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Zanetti, Marco; Zotto, Pierluigi; Zumerle, Gianni; Braghieri, Alessandro; Fallavollita, Francesco; Magnani, Alice; Montagna, Paolo; Ratti, Sergio P; Re, Valerio; Riccardi, Cristina; Salvini, Paola; Vai, Ilaria; Vitulo, Paolo; Alunni Solestizi, Luisa; Bilei, Gian Mario; Ciangottini, Diego; Fanò, Livio; Lariccia, Paolo; Leonardi, Roberto; Mantovani, Giancarlo; Menichelli, Mauro; Saha, Anirban; Santocchia, Attilio; Androsov, Konstantin; Azzurri, Paolo; Bagliesi, Giuseppe; Bernardini, Jacopo; Boccali, Tommaso; Castaldi, Rino; Ciocci, Maria Agnese; Dell'Orso, Roberto; Donato, Silvio; Fedi, Giacomo; Giassi, Alessandro; Grippo, Maria Teresa; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Palla, Fabrizio; Rizzi, Andrea; Savoy-Navarro, Aurore; Spagnolo, Paolo; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Barone, Luciano; Cavallari, Francesca; Cipriani, Marco; Del Re, Daniele; Diemoz, Marcella; Gelli, Simone; Longo, Egidio; Margaroli, Fabrizio; Marzocchi, Badder; Meridiani, Paolo; Organtini, Giovanni; Paramatti, Riccardo; Preiato, Federico; Rahatlou, Shahram; Rovelli, Chiara; Santanastasio, Francesco; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Bartosik, Nazar; Bellan, Riccardo; Biino, Cristina; Cartiglia, Nicolo; Cenna, Francesca; Costa, Marco; Covarelli, Roberto; Degano, Alessandro; Demaria, Natale; Finco, Linda; Kiani, Bilal; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Monteil, Ennio; Monteno, Marco; Obertino, Maria Margherita; Pacher, Luca; Pastrone, Nadia; Pelliccioni, Mario; Pinna Angioni, Gian Luca; Ravera, Fabio; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Shchelina, Ksenia; Sola, Valentina; Solano, Ada; Staiano, Amedeo; Traczyk, Piotr; Belforte, Stefano; Casarsa, Massimo; Cossutti, Fabio; Della Ricca, Giuseppe; Zanetti, Anna; Kim, Dong Hee; Kim, Gui Nyun; Kim, Min Suk; Lee, Sangeun; Lee, Seh Wook; Oh, Young Do; Sekmen, Sezen; Son, Dong-Chul; Yang, Yu Chul; Lee, Ari; Kim, Hyunchul; Brochero Cifuentes, Javier Andres; Kim, Tae Jeong; Cho, Sungwoong; Choi, Suyong; Go, Yeonju; Gyun, Dooyeon; Ha, Seungkyu; Hong, Byung-Sik; Jo, Youngkwon; Kim, Yongsun; Lee, Kisoo; Lee, Kyong Sei; Lee, Songkyo; Lim, Jaehoon; Park, Sung Keun; Roh, Youn; Almond, John; Kim, Junho; Lee, Haneol; Oh, Sung Bin; Radburn-Smith, Benjamin Charles; Seo, Seon-hee; Yang, Unki; Yoo, Hwi Dong; Yu, Geum Bong; Choi, Minkyoo; Kim, Hyunyong; Kim, Ji Hyun; Lee, Jason Sang Hun; Park, Inkyu; Ryu, Geonmo; Ryu, Min Sang; Choi, Young-Il; Goh, Junghwan; Hwang, Chanwook; Lee, Jongseok; Yu, Intae; Dudenas, Vytautas; Juodagalvis, Andrius; Vaitkus, Juozas; Ahmed, Ijaz; Ibrahim, Zainol Abidin; Md Ali, Mohd Adli Bin; Mohamad Idris, Faridah; Wan Abdullah, Wan Ahmad Tajuddin; Yusli, Mohd Nizam; Zolkapli, Zukhaimira; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-De La Cruz, Ivan; Hernandez-Almada, Alberto; Lopez-Fernandez, Ricardo; Magaña Villalba, Ricardo; Mejia Guisao, Jhovanny; Sánchez Hernández, Alberto; Carrillo Moreno, Salvador; Oropeza Barrera, Cristina; Vazquez Valencia, Fabiola; Carpinteyro, Severiano; Pedraza, Isabel; Salazar Ibarguen, Humberto Antonio; Uribe Estrada, Cecilia; Morelos Pineda, Antonio; Krofcheck, David; Butler, Philip H; Ahmad, Ashfaq; Ahmad, Muhammad; Hassan, Qamar; Hoorani, Hafeez R; Khan, Wajid Ali; Saddique, Asif; Shah, Mehar Ali; Shoaib, Muhammad; Waqas, Muhammad; Bialkowska, Helena; Bluj, Michal; Boimska, Bożena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Zalewski, Piotr; Bunkowski, Karol; Byszuk, Adrian; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Olszewski, Michal; Walczak, Marek; Bargassa, Pedrame; Beirão Da Cruz E Silva, Cristóvão; Calpas, Betty; Di Francesco, Agostino; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Hollar, Jonathan; Leonardo, Nuno; Lloret Iglesias, Lara; Nemallapudi, Mythra Varun; Rodrigues Antunes, Joao; Seixas, Joao; Toldaiev, Oleksii; Vadruccio, Daniele; Varela, Joao; Vischia, Pietro; Afanasiev, Serguei; Bunin, Pavel; Golutvin, Igor; Gorbunov, Ilya; Kamenev, Alexey; Karjavin, Vladimir; Lanev, Alexander; Malakhov, Alexander; Matveev, Viktor; Palichik, Vladimir; Perelygin, Victor; Savina, Maria; Shmatov, Sergey; Shulha, Siarhei; Skatchkov, Nikolai; Smirnov, Vitaly; Voytishin, Nikolay; Zarubin, Anatoli; Chtchipounov, Leonid; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Kuznetsova, Ekaterina; Murzin, Victor; Oreshkin, Vadim; Sulimov, Valentin; Vorobyev, Alexey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Karneyeu, Anton; Kirsanov, Mikhail; Krasnikov, Nikolai; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Gavrilov, Vladimir; Lychkovskaya, Natalia; Popov, Vladimir; Pozdnyakov, Ivan; Safronov, Grigory; Spiridonov, Alexander; Toms, Maria; Vlasov, Evgueni; Zhokin, Alexander; Aushev, Tagir; Bylinkin, Alexander; Chadeeva, Marina; Markin, Oleg; Tarkovskii, Evgenii; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Terkulov, Adel; Baskakov, Alexey; Belyaev, Andrey; Boos, Edouard; Bunichev, Viacheslav; Dubinin, Mikhail; Dudko, Lev; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Miagkov, Igor; Obraztsov, Stepan; Petrushanko, Sergey; Savrin, Viktor; Snigirev, Alexander; Blinov, Vladimir; Skovpen, Yuri; Shtol, Dmitry; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Elumakhov, Dmitry; Kachanov, Vassili; Kalinin, Alexey; Konstantinov, Dmitri; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Cirkovic, Predrag; Devetak, Damir; Dordevic, Milos; Milosevic, Jovan; Rekovic, Vladimir; Alcaraz Maestre, Juan; Barrio Luna, Mar; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Escalante Del Valle, Alberto; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Navarro De Martino, Eduardo; Pérez-Calero Yzquierdo, Antonio María; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Senghi Soares, Mara; de Trocóniz, Jorge F; Missiroli, Marino; Moran, Dermot; Cuevas, Javier; Fernandez Menendez, Javier; Gonzalez Caballero, Isidro; González Fernández, Juan Rodrigo; Palencia Cortezon, Enrique; Sanchez Cruz, Sergio; Suárez Andrés, Ignacio; Vizan Garcia, Jesus Manuel; Cabrillo, Iban Jose; Calderon, Alicia; Curras, Esteban; Fernandez, Marcos; Garcia-Ferrero, Juan; Gomez, Gervasio; Lopez Virto, Amparo; Marco, Jesus; Martinez Rivero, Celso; Matorras, Francisco; Piedra Gomez, Jonatan; Rodrigo, Teresa; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Trevisani, Nicolò; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Baillon, Paul; Ball, Austin; Barney, David; Bloch, Philippe; Bocci, Andrea; Botta, Cristina; Camporesi, Tiziano; Castello, Roberto; Cepeda, Maria; Cerminara, Gianluca; Chen, Yi; D'Enterria, David; Dabrowski, Anne; Daponte, Vincenzo; David Tinoco Mendes, Andre; De Gruttola, Michele; De Roeck, Albert; Di Marco, Emanuele; Dobson, Marc; Dorney, Brian; Du Pree, Tristan; Duggan, Daniel; Dünser, Marc; Dupont, Niels; Elliott-Peisert, Anna; Everaerts, Pieter; Fartoukh, Stephane; Franzoni, Giovanni; Fulcher, Jonathan; Funk, Wolfgang; Gigi, Dominique; Gill, Karl; Girone, Maria; Glege, Frank; Gulhan, Doga; Gundacker, Stefan; Guthoff, Moritz; Harris, Philip; Hegeman, Jeroen; Innocente, Vincenzo; Janot, Patrick; Kieseler, Jan; Kirschenmann, Henning; Knünz, Valentin; Kornmayer, Andreas; Kortelainen, Matti J; Kousouris, Konstantinos; Krammer, Manfred; Lange, Clemens; Lecoq, Paul; Lourenco, Carlos; Lucchini, Marco Toliman; Malgeri, Luca; Mannelli, Marcello; Martelli, Arabella; Meijers, Frans; Merlin, Jeremie Alexandre; Mersi, Stefano; Meschi, Emilio; Milenovic, Predrag; Moortgat, Filip; Morovic, Srecko; Mulders, Martijn; Neugebauer, Hannes; Orfanelli, Styliani; Orsini, Luciano; Pape, Luc; Perez, Emmanuel; Peruzzi, Marco; Petrilli, Achille; Petrucciani, Giovanni; Pfeiffer, Andreas; Pierini, Maurizio; Racz, Attila; Reis, Thomas; Rolandi, Gigi; Rovere, Marco; Sakulin, Hannes; Sauvan, Jean-Baptiste; Schäfer, Christoph; Schwick, Christoph; Seidel, Markus; Sharma, Archana; Silva, Pedro; Sphicas, Paraskevas; Steggemann, Jan; Stoye, Markus; Takahashi, Yuta; Tosi, Mia; Treille, Daniel; Triossi, Andrea; Tsirou, Andromachi; Veckalns, Viesturs; Veres, Gabor Istvan; Verweij, Marta; Wardle, Nicholas; Wöhri, Hermine Katharina; Zagoździńska, Agnieszka; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; Kotlinski, Danek; Langenegger, Urs; Rohe, Tilman; Wiederkehr, Stephan Albert; Bachmair, Felix; Bäni, Lukas; Bianchini, Lorenzo; Casal, Bruno; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Grab, Christoph; Heidegger, Constantin; Hits, Dmitry; Hoss, Jan; Kasieczka, Gregor; Lustermann, Werner; Mangano, Boris; Marionneau, Matthieu; Martinez Ruiz del Arbol, Pablo; Masciovecchio, Mario; Meinhard, Maren Tabea; Meister, Daniel; Micheli, Francesco; Musella, Pasquale; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pata, Joosep; Pauss, Felicitas; Perrin, Gaël; Perrozzi, Luca; Quittnat, Milena; Rossini, Marco; Schönenberger, Myriam; Starodumov, Andrei; Tavolaro, Vittorio Raoul; Theofilatos, Konstantinos; Wallny, Rainer; Aarrestad, Thea Klaeboe; Amsler, Claude; Caminada, Lea; Canelli, Maria Florencia; De Cosa, Annapaola; Galloni, Camilla; Hinzmann, Andreas; Hreus, Tomas; Kilminster, Benjamin; Ngadiuba, Jennifer; Pinna, Deborah; Rauco, Giorgia; Robmann, Peter; Salerno, Daniel; Seitz, Claudia; Yang, Yong; Zucchetta, Alberto; Candelise, Vieri; Doan, Thi Hien; Jain, Shilpi; Khurana, Raman; Konyushikhin, Maxim; Kuo, Chia-Ming; Lin, Willis; Pozdnyakov, Andrey; Yu, Shin-Shan; Kumar, Arun; Chang, Paoti; Chang, You-Hao; Chao, Yuan; Chen, Kai-Feng; Chen, Po-Hsun; Fiori, Francesco; Hou, George Wei-Shu; Hsiung, Yee; Liu, Yueh-Feng; Lu, Rong-Shyang; Miñano Moya, Mercedes; Paganis, Efstathios; Psallidas, Andreas; Tsai, Jui-fa; Asavapibhop, Burin; Singh, Gurpreet; Srimanobhas, Norraphat; Suwonjandee, Narumon; Adiguzel, Aytul; Cerci, Salim; Damarseckin, Serdal; Demiroglu, Zuhal Seyma; Dozen, Candan; Dumanoglu, Isa; Girgis, Semiray; Gokbulut, Gul; Guler, Yalcin; Hos, Ilknur; Kangal, Evrim Ersin; Kara, Ozgun; Kayis Topaksu, Aysel; Kiminsu, Ugur; Oglakci, Mehmet; Onengut, Gulsen; Ozdemir, Kadri; Sunar Cerci, Deniz; Tali, Bayram; Turkcapar, Semra; Zorbakir, Ibrahim Soner; Zorbilmez, Caglar; Bilin, Bugra; Bilmis, Selcuk; Isildak, Bora; Karapinar, Guler; Yalvac, Metin; Zeyrek, Mehmet; Gülmez, Erhan; Kaya, Mithat; Kaya, Ozlem; Yetkin, Elif Asli; Yetkin, Taylan; Cakir, Altan; Cankocak, Kerem; Sen, Sercan; Grynyov, Boris; Levchuk, Leonid; Sorokin, Pavel; Aggleton, Robin; Ball, Fionn; Beck, Lana; Brooke, James John; Burns, Douglas; Clement, Emyr; Cussans, David; Flacher, Henning; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Jacob, Jeson; Kreczko, Lukasz; Lucas, Chris; Newbold, Dave M; Paramesvaran, Sudarshan; Poll, Anthony; Sakuma, Tai; Seif El Nasr-storey, Sarah; Smith, Dominic; Smith, Vincent J; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Calligaris, Luigi; Cieri, Davide; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Olaiya, Emmanuel; Petyt, David; Shepherd-Themistocleous, Claire; Thea, Alessandro; Tomalin, Ian R; Williams, Thomas; Baber, Mark; Bainbridge, Robert; Buchmuller, Oliver; Bundock, Aaron; Burton, Darren; Casasso, Stefano; Citron, Matthew; Colling, David; Corpe, Louie; Dauncey, Paul; Davies, Gavin; De Wit, Adinda; Della Negra, Michel; Di Maria, Riccardo; Dunne, Patrick; Elwood, Adam; Futyan, David; Haddad, Yacine; Hall, Geoffrey; Iles, Gregory; James, Thomas; Lane, Rebecca; Laner, Christian; Lucas, Robyn; Lyons, Louis; Magnan, Anne-Marie; Malik, Sarah; Mastrolorenzo, Luca; Nash, Jordan; Nikitenko, Alexander; Pela, Joao; Penning, Bjoern; Pesaresi, Mark; Raymond, David Mark; Richards, Alexander; Rose, Andrew; Scott, Edward; Seez, Christopher; Summers, Sioni; Tapper, Alexander; Uchida, Kirika; Vazquez Acosta, Monica; Virdee, Tejinder; Wright, Jack; Zenz, Seth Conrad; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Borzou, Ahmad; Call, Kenneth; Dittmann, Jay; Hatakeyama, Kenichi; Liu, Hongxuan; Pastika, Nathaniel; Bartek, Rachel; Dominguez, Aaron; Buccilli, Andrew; Cooper, Seth; Henderson, Conor; Rumerio, Paolo; West, Christopher; Arcaro, Daniel; Avetisyan, Aram; Bose, Tulika; Gastler, Daniel; Rankin, Dylan; Richardson, Clint; Rohlf, James; Sulak, Lawrence; Zou, David; Benelli, Gabriele; Cutts, David; Garabedian, Alex; Hakala, John; Heintz, Ulrich; Hogan, Julie Managan; Jesus, Orduna; Kwok, Ka Hei Martin; Laird, Edward; Landsberg, Greg; Mao, Zaixing; Narain, Meenakshi; Piperov, Stefan; Sagir, Sinan; Spencer, Eric; Syarif, Rizki; Breedon, Richard; Burns, Dustin; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Erbacher, Robin; Flores, Chad; Funk, Garrett; Gardner, Michael; Ko, Winston; Lander, Richard; Mclean, Christine; Mulhearn, Michael; Pellett, Dave; Pilot, Justin; Shalhout, Shalhout; Shi, Mengyao; Smith, John; Squires, Michael; Stolp, Dustin; Tos, Kyle; Tripathi, Mani; Bachtis, Michail; Bravo, Cameron; Cousins, Robert; Dasgupta, Abhigyan; Florent, Alice; Hauser, Jay; Ignatenko, Mikhail; Mccoll, Nickolas; Saltzberg, David; Schnaible, Christian; Valuev, Vyacheslav; Weber, Matthias; Bouvier, Elvire; Burt, Kira; Clare, Robert; Ellison, John Anthony; Gary, J William; Ghiasi Shirazi, Seyyed Mohammad Amin; Hanson, Gail; Heilman, Jesse; Jandir, Pawandeep; Kennedy, Elizabeth; Lacroix, Florent; Long, Owen Rosser; Olmedo Negrete, Manuel; Paneva, Mirena Ivova; Shrinivas, Amithabh; Si, Weinan; Wei, Hua; Wimpenny, Stephen; Yates, Brent; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; Derdzinski, Mark; Gerosa, Raffaele; Holzner, André; Klein, Daniel; Krutelyov, Vyacheslav; Letts, James; Macneill, Ian; Olivito, Dominick; Padhi, Sanjay; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Tadel, Matevz; Vartak, Adish; Wasserbaech, Steven; Welke, Charles; Wood, John; Würthwein, Frank; Yagil, Avraham; Zevi Della Porta, Giovanni; Amin, Nick; Bhandari, Rohan; Bradmiller-Feld, John; Campagnari, Claudio; Dishaw, Adam; Dutta, Valentina; Franco Sevilla, Manuel; George, Christopher; Golf, Frank; Gouskos, Loukas; Gran, Jason; Heller, Ryan; Incandela, Joe; Mullin, Sam Daniel; Ovcharova, Ana; Qu, Huilin; Richman, Jeffrey; Stuart, David; Suarez, Indara; Yoo, Jaehyeok; Anderson, Dustin; Bendavid, Joshua; Bornheim, Adolf; Bunn, Julian; Duarte, Javier; Lawhorn, Jay Mathew; Mott, Alexander; Newman, Harvey B; Pena, Cristian; Spiropulu, Maria; Vlimant, Jean-Roch; Xie, Si; Zhu, Ren-Yuan; Andrews, Michael Benjamin; Ferguson, Thomas; Paulini, Manfred; Russ, James; Sun, Menglei; Vogel, Helmut; Vorobiev, Igor; Weinberg, Marc; Cumalat, John Perry; Ford, William T; Jensen, Frank; Johnson, Andrew; Krohn, Michael; Leontsinis, Stefanos; Mulholland, Troy; Stenson, Kevin; Wagner, Stephen Robert; Alexander, James; Chaves, Jorge; Chu, Jennifer; Dittmer, Susan; Mcdermott, Kevin; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Rinkevicius, Aurelijus; Ryd, Anders; Skinnari, Louise; Soffi, Livia; Tan, Shao Min; Tao, Zhengcheng; Thom, Julia; Tucker, Jordan; Wittich, Peter; Zientek, Margaret; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Apollinari, Giorgio; Apresyan, Artur; Banerjee, Sunanda; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bolla, Gino; Burkett, Kevin; Butler, Joel Nathan; Cheung, Harry; Chlebana, Frank; Cihangir, Selcuk; Cremonesi, Matteo; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gottschalk, Erik; Gray, Lindsey; Green, Dan; Grünendahl, Stefan; Gutsche, Oliver; Hare, Daryl; Harris, Robert M; Hasegawa, Satoshi; Hirschauer, James; Hu, Zhen; Jayatilaka, Bodhitha; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kreis, Benjamin; Lammel, Stephan; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Liu, Miaoyuan; Liu, Tiehui; Lopes De Sá, Rafael; Lykken, Joseph; Maeshima, Kaori; Magini, Nicolo; Marraffino, John Michael; Maruyama, Sho; Mason, David; McBride, Patricia; Merkel, Petra; Mrenna, Stephen; Nahn, Steve; O'Dell, Vivian; Pedro, Kevin; Prokofyev, Oleg; Rakness, Gregory; Ristori, Luciano; Sexton-Kennedy, Elizabeth; Soha, Aron; Spalding, William J; Spiegel, Leonard; Stoynev, Stoyan; Strait, James; Strobbe, Nadja; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vernieri, Caterina; Verzocchi, Marco; Vidal, Richard; Wang, Michael; Weber, Hannsjoerg Artur; Whitbeck, Andrew; Wu, Yujun; Acosta, Darin; Avery, Paul; Bortignon, Pierluigi; Bourilkov, Dimitri; Brinkerhoff, Andrew; Carnes, Andrew; Carver, Matthew; Curry, David; Das, Souvik; Field, Richard D; Furic, Ivan-Kresimir; Konigsberg, Jacobo; Korytov, Andrey; Low, Jia Fu; Ma, Peisen; Matchev, Konstantin; Mei, Hualin; Mitselmakher, Guenakh; Rank, Douglas; Shchutska, Lesya; Sperka, David; Thomas, Laurent; Wang, Jian; Wang, Sean-Jiun; Yelton, John; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Ackert, Andrew; Adams, Todd; Askew, Andrew; Bein, Samuel; Hagopian, Sharon; Hagopian, Vasken; Johnson, Kurtis F; Kolberg, Ted; Prosper, Harrison; Santra, Arka; Yohay, Rachel; Baarmand, Marc M; Bhopatkar, Vallary; Colafranceschi, Stefano; Hohlmann, Marcus; Noonan, Daniel; Roy, Titas; Yumiceva, Francisco; Adams, Mark Raymond; Apanasevich, Leonard; Berry, Douglas; Betts, Russell Richard; Bucinskaite, Inga; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Jung, Kurt; Sandoval Gonzalez, Irving Daniel; Varelas, Nikos; Wang, Hui; Wu, Zhenbin; Zakaria, Mohammed; Zhang, Jingyu; Bilki, Burak; Clarida, Warren; Dilsiz, Kamuran; Durgut, Süleyman; Gandrajula, Reddy Pratap; Haytmyradov, Maksat; Khristenko, Viktor; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Ogul, Hasan; Onel, Yasar; Ozok, Ferhat; Penzo, Aldo; Snyder, Christina; Tiras, Emrah; Wetzel, James; Yi, Kai; Blumenfeld, Barry; Cocoros, Alice; Eminizer, Nicholas; Fehling, David; Feng, Lei; Gritsan, Andrei; Maksimovic, Petar; Roskes, Jeffrey; Sarica, Ulascan; Swartz, Morris; Xiao, Meng; You, Can; Al-bataineh, Ayman; Baringer, Philip; Bean, Alice; Boren, Samuel; Bowen, James; Castle, James; Forthomme, Laurent; Kenny III, Raymond Patrick; Khalil, Sadia; Kropivnitskaya, Anna; Majumder, Devdatta; Mcbrayer, William; Murray, Michael; Sanders, Stephen; Stringer, Robert; Tapia Takaki, Daniel; Wang, Quan; Ivanov, Andrew; Kaadze, Ketino; Maravin, Yurii; Mohammadi, Abdollah; Saini, Lovedeep Kaur; Skhirtladze, Nikoloz; Toda, Sachiko; Rebassoo, Finn; Wright, Douglas; Anelli, Christopher; Baden, Drew; Baron, Owen; Belloni, Alberto; Calvert, Brian; Eno, Sarah Catherine; Ferraioli, Charles; Gomez, Jaime; Hadley, Nicholas John; Jabeen, Shabnam; Jeng, Geng-Yuan; Kellogg, Richard G; Kunkle, Joshua; Mignerey, Alice; Ricci-Tam, Francesca; Shin, Young Ho; Skuja, Andris; Tonjes, Marguerite; Tonwar, Suresh C; Abercrombie, Daniel; Allen, Brandon; Apyan, Aram; Azzolini, Virginia; Barbieri, Richard; Baty, Austin; Bi, Ran; Bierwagen, Katharina; Brandt, Stephanie; Busza, Wit; Cali, Ivan Amos; D'Alfonso, Mariarosaria; Demiragli, Zeynep; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Hsu, Dylan; Iiyama, Yutaro; Innocenti, Gian Michele; Klute, Markus; Kovalskyi, Dmytro; Krajczar, Krisztian; Lai, Yue Shi; Lee, Yen-Jie; Levin, Andrew; Luckey, Paul David; Maier, Benedikt; Marini, Andrea Carlo; Mcginn, Christopher; Mironov, Camelia; Narayanan, Siddharth; Niu, Xinmei; Paus, Christoph; Roland, Christof; Roland, Gunther; Salfeld-Nebgen, Jakob; Stephans, George; Tatar, Kaya; Velicanu, Dragos; Wang, Jing; Wang, Ta-Wei; Wyslouch, Bolek; Benvenuti, Alberto; Chatterjee, Rajdeep Mohan; Evans, Andrew; Hansen, Peter; Kalafut, Sean; Kao, Shih-Chuan; Kubota, Yuichi; Lesko, Zachary; Mans, Jeremy; Nourbakhsh, Shervin; Ruckstuhl, Nicole; Rusack, Roger; Tambe, Norbert; Turkewitz, Jared; Acosta, John Gabriel; Oliveros, Sandra; Avdeeva, Ekaterina; Bloom, Kenneth; Claes, Daniel R; Fangmeier, Caleb; Gonzalez Suarez, Rebeca; Kamalieddin, Rami; Kravchenko, Ilya; Malta Rodrigues, Alan; Monroy, Jose; Siado, Joaquin Emilo; Snow, Gregory R; Stieger, Benjamin; Alyari, Maral; Dolen, James; Godshalk, Andrew; Harrington, Charles; Iashvili, Ia; Kaisen, Josh; Nguyen, Duong; Parker, Ashley; Rappoccio, Salvatore; Roozbahani, Bahareh; Alverson, George; Barberis, Emanuela; Hortiangtham, Apichart; Massironi, Andrea; Morse, David Michael; Nash, David; Orimoto, Toyoko; Teixeira De Lima, Rafael; Trocino, Daniele; Wang, Ren-Jie; Wood, Darien; Bhattacharya, Saptaparna; Charaf, Otman; Hahn, Kristan Allan; Kumar, Ajay; Mucia, Nicholas; Odell, Nathaniel; Pollack, Brian; Schmitt, Michael Henry; Sung, Kevin; Trovato, Marco; Velasco, Mayda; Dev, Nabarun; Hildreth, Michael; Hurtado Anampa, Kenyi; Jessop, Colin; Karmgard, Daniel John; Kellams, Nathan; Lannon, Kevin; Marinelli, Nancy; Meng, Fanbo; Mueller, Charles; Musienko, Yuri; Planer, Michael; Reinsvold, Allison; Ruchti, Randy; Rupprecht, Nathaniel; Smith, Geoffrey; Taroni, Silvia; Wayne, Mitchell; Wolf, Matthias; Woodard, Anna; Alimena, Juliette; Antonelli, Louis; Bylsma, Ben; Durkin, Lloyd Stanley; Flowers, Sean; Francis, Brian; Hart, Andrew; Hill, Christopher; Hughes, Richard; Ji, Weifeng; Liu, Bingxuan; Luo, Wuming; Puigh, Darren; Winer, Brian L; Wulsin, Howard Wells; Cooperstein, Stephane; Driga, Olga; Elmer, Peter; Hardenbrook, Joshua; Hebda, Philip; Lange, David; Luo, Jingyu; Marlow, Daniel; Medvedeva, Tatiana; Mei, Kelvin; Ojalvo, Isabel; Olsen, James; Palmer, Christopher; Piroué, Pierre; Stickland, David; Svyatkovskiy, Alexey; Tully, Christopher; Malik, Sudhir; Barker, Anthony; Barnes, Virgil E; Folgueras, Santiago; Gutay, Laszlo; Jha, Manoj; Jones, Matthew; Jung, Andreas Werner; Khatiwada, Ajeeta; Miller, David Harry; Neumeister, Norbert; Schulte, Jan-Frederik; Shi, Xin; Sun, Jian; Wang, Fuqiang; Xie, Wei; Parashar, Neeti; Stupak, John; Adair, Antony; Akgun, Bora; Chen, Zhenyu; Ecklund, Karl Matthew; Geurts, Frank JM; Guilbaud, Maxime; Li, Wei; Michlin, Benjamin; Northup, Michael; Padley, Brian Paul; Roberts, Jay; Rorie, Jamal; Tu, Zhoudunming; Zabel, James; Betchart, Burton; Bodek, Arie; de Barbaro, Pawel; Demina, Regina; Duh, Yi-ting; Ferbel, Thomas; Galanti, Mario; Garcia-Bellido, Aran; Han, Jiyeon; Hindrichs, Otto; Khukhunaishvili, Aleko; Lo, Kin Ho; Tan, Ping; Verzetti, Mauro; Agapitos, Antonis; Chou, John Paul; Gershtein, Yuri; Gómez Espinosa, Tirso Alejandro; Halkiadakis, Eva; Heindl, Maximilian; Hughes, Elliot; Kaplan, Steven; Kunnawalkam Elayavalli, Raghav; Kyriacou, Savvas; Lath, Amitabh; Nash, Kevin; Osherson, Marc; Saka, Halil; Salur, Sevil; Schnetzer, Steve; Sheffield, David; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Thomassen, Peter; Walker, Matthew; Delannoy, Andrés G; Foerster, Mark; Heideman, Joseph; Riley, Grant; Rose, Keith; Spanier, Stefan; Thapa, Krishna; Bouhali, Othmane; Celik, Ali; Dalchenko, Mykhailo; De Mattia, Marco; Delgado, Andrea; Dildick, Sven; Eusebi, Ricardo; Gilmore, Jason; Huang, Tao; Juska, Evaldas; Kamon, Teruki; Mueller, Ryan; Pakhotin, Yuriy; Patel, Rishi; Perloff, Alexx; Perniè, Luca; Rathjens, Denis; Safonov, Alexei; Tatarinov, Aysen; Ulmer, Keith; Akchurin, Nural; Cowden, Christopher; Damgov, Jordan; De Guio, Federico; Dragoiu, Cosmin; Dudero, Phillip Russell; Faulkner, James; Gurpinar, Emine; Kunori, Shuichi; Lamichhane, Kamal; Lee, Sung Won; Libeiro, Terence; Peltola, Timo; Undleeb, Sonaina; Volobouev, Igor; Wang, Zhixing; Greene, Senta; Gurrola, Alfredo; Janjam, Ravi; Johns, Willard; Maguire, Charles; Melo, Andrew; Ni, Hong; Sheldon, Paul; Tuo, Shengquan; Velkovska, Julia; Xu, Qiao; Arenton, Michael Wayne; Barria, Patrizia; Cox, Bradley; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Li, Hengne; Neu, Christopher; Sinthuprasith, Tutanon; Sun, Xin; Wang, Yanchu; Wolfe, Evan; Xia, Fan; Clarke, Christopher; Harr, Robert; Karchin, Paul Edmund; Sturdy, Jared; Belknap, Donald; Buchanan, James; Caillol, Cécile; Dasu, Sridhara; Dodd, Laura; Duric, Senka; Gomber, Bhawna; Grothe, Monika; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Lanaro, Armando; Levine, Aaron; Long, Kenneth; Loveless, Richard; Perry, Thomas; Pierro, Giuseppe Antonio; Polese, Giovanni; Ruggles, Tyler; Savin, Alexander; Smith, Nicholas; Smith, Wesley H; Taylor, Devin; Woods, Nathaniel

2017-09-10

A search for massive resonances decaying to a Z boson and a photon is performed in events with a hadronically decaying Z boson candidate, separately in light-quark and b quark decay modes, identified using jet substructure and advanced b tagging techniques. Results are based on samples of proton-proton collisions collected with the CMS detector at the LHC at center-of-mass energies of 8 and 13 TeV, corresponding to integrated luminosities of 19.7 and 2.7 fb$^{-1}$, respectively. The results of the search are combined with those of a similar search in the leptonic decay modes of the Z boson, based on the same data sets. Spin-0 resonances with various widths and with masses in a range between 0.2 and 3.0 TeV are considered. No significant excess is observed either in the individual analyses or the combination. The results are presented in terms of upper limits on the production cross section of such resonances and constitute the most stringent limits to date for a wide range of masses.

Searching for Criteria in Evaluating the Monofin Swimming Turn from the Perspective of Coaching and Improving Technique

Science.gov (United States)

Rejman, Marek; Borowska, Grażyna

2008-01-01

This study aims to analysise the selected kinematic parameters of the monofin swimming turn. The high complexity of performing turns is hindered by the large surface of the monofin, which disturbs control and sense of the body in water. A lack of objective data available on monofin swimming turns has resulted in field research connected with the specification of parameters needed for the evaluation of the technique. Therefore, turns observed in elite swimmers contain underlying conclusions for objective criteria, ensuring the highest level of coaching and the improving of turns in young swimmers. Six, high level, male swimmers participated in the study. The subject of the analysis was the fastest turn, from one out of three trial turns made after swimming a distance of 25 m. Images of the turns were collected from two cameras located under water in accordance with the procedures of the previous analyses of freestyle turns. The images were digitized and analysed by the SIMI®- Movement Analysis System. The interdependency of the total turn time and the remaining recorded parameters, constituted the basis for analysis of the kinematic parameters of five turn phases. The interdependency was measured using r- Pearson’s correlation coefficients. The novel character of the subject covered in this study, forced interpretation of the results on the basis of turn analyses in freestyle swimming. The results allow for the creation of a diagram outlinig area of search for an effective and efficient monofin swimming turn mechanism. The activities performed from the moment of wall contact until the commencement of stroking seem to be crucial for turn improvement. A strong belief has resulted that, the correct monofin swimming turn, is more than just a simple consequence of the fastest performance of all its components. The most important criteria in evaluating the quality of the monofin swimming turn are: striving for the optimal extension of wall contact time, push-off time

Phylogenetic search through partial tree mixing

Science.gov (United States)

2012-01-01

Background Recent advances in sequencing technology have created large data sets upon which phylogenetic inference can be performed. Current research is limited by the prohibitive time necessary to perform tree search on a reasonable number of individuals. This research develops new phylogenetic algorithms that can operate on tens of thousands of species in a reasonable amount of time through several innovative search techniques. Results When compared to popular phylogenetic search algorithms, better trees are found much more quickly for large data sets. These algorithms are incorporated in the PSODA application available at http://dna.cs.byu.edu/psoda Conclusions The use of Partial Tree Mixing in a partition based tree space allows the algorithm to quickly converge on near optimal tree regions. These regions can then be searched in a methodical way to determine the overall optimal phylogenetic solution. PMID:23320449

Is searching full text more effective than searching abstracts?

Science.gov (United States)

Lin, Jimmy

2009-02-03

With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata) to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE abstracts, full-text articles, and spans (paragraphs) within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Is searching full text more effective than searching abstracts?

Directory of Open Access Journals (Sweden)

Lin Jimmy

2009-02-01

Full Text Available Abstract Background With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE® abstracts, full-text articles, and spans (paragraphs within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Results Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Conclusion Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.

Intermittent search strategies

Science.gov (United States)

Bénichou, O.; Loverdo, C.; Moreau, M.; Voituriez, R.

2011-01-01

This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. It is first shown that intermittent search strategies are actually widely observed at various scales. At the macroscopic scale, this is, for example, the case of animals looking for food; at the microscopic scale, intermittent transport patterns are involved in a reaction pathway of DNA-binding proteins as well as in intracellular transport. Second, generic stochastic models are introduced, which show that intermittent strategies are efficient strategies that enable the minimization of search time. This suggests that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature. Last, beyond these modeling aspects, it is proposed that intermittent strategies could also be used in a broader context to design and accelerate search processes.

An automatic system to search, acquire, and analyse chromosomal aberrations obtained using FISH technique

International Nuclear Information System (INIS)

Esposito, R.D.

2003-01-01

Full text: Chromosomal aberrations (CA) analysis in peripheral blood lymphocytes is useful both in prenatal diagnoses and cancer cytogenetics, as well as in toxicology to determine the biologically significant dose of specific, both physical and chemical, genotoxic agents to which an individual is exposed. A useful cytogenetic technique for CAs analysis is Fluorescence-in-situ-Hybridization (FISH) which simplifies the automatic Identification and characterisation of aberrations, allowing the visualisation of chromosomes as bright signals on a dark background, and a fast analysis of stable aberrations, which are particularly interesting for late effects. The main limitation of CA analysis is the rarity with which these events occur, and therefore the time necessary to single out a statistically significant number of aberrant cells. In order to address this problem, a prototype system, capable of automatically searching, acquiring, and recognising chromosomal images of samples prepared using FISH, has been developed. The system is able to score large number of samples in a reasonable time using predefined search criteria. The system is based on the appropriately implemented and characterised automatic metaphase finder Metafer4 (MetaSystems), coupled with a specific module for the acquisition of high magnification metaphase images with any combination of fluorescence filters. These images are then analysed and classified using our software. The prototype is currently capable of separating normal metaphase images from presumed aberrant ones. This system is currently in use in our laboratories both by ourselves and by other researchers not involved in its development, in order to carry out analyses of CAs induced by ionising radiation. The prototype allows simple acquisition and management of large quantities of images and makes it possible to carry out methodological studies -such as the comparison of results obtained by different operators- as well as increasing the

E12 sheet plastination: Techniques and applications.

Science.gov (United States)

Ottone, Nicolas Ernesto; Baptista, Carlos A C; Latorre, Rafael; Bianchi, Homero Felipe; Del Sol, Mariano; Fuentes, Ramon

2017-10-30

Plastination is an anatomical technique that consists of replacing the liquids and fat of specimens by reactive polymers through forced impregnation in a vacuum. These are then polymerized to achieve the final result. E12 sheet plastination involves epoxy resin impregnation of thin (2-4 mm) and ultra-thin (SciELO databases, and manual searches. After searching, 616 records were found using the online and manual searches (MEDLINE, n: 207; EMBASE, n: 346; SciELO, n: 44; Manual search: 23). Finally, 96 records were included in this review (after duplicates and articles unrelated to the subject were excluded). The aim of this work was to review the E12 sheet plastination technique, searching for articles concerning views of it, identifying the different variants implemented by researchers since its creation by Gunther von Hagens, and to identify its applications from teaching and research in anatomy to morphological sciences. Clin. Anat., 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Mobile Search and Advertising

OpenAIRE

Lovitskii, Vladimir; McCaffery, Colin; Thrasher, Michael; Traynor, David; Wright, Peter

2009-01-01

Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a general rule such search result exceed 1...

Local search heuristics for the probabilistic dial-a-ride problem

DEFF Research Database (Denmark)

Ho, Sin C.; Haugland, Dag

2011-01-01

evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one...

Goiania 1987: searching for radiation

International Nuclear Information System (INIS)

Clarke Binns, D.A.

1998-01-01

The founding of the Searching for Radiation Group following the radiation accident in Goiania, Brazil, in 1987, is described. Particulars on the equipment and detector used, the number of people monitored, the techniques used to gather information on the probable date of the accident, about possibly contaminated places and people are provided and communicating with the general public is addressed. The discussion is divided into three main parts: 1) how the Searching for Radiation Group was formed; 2) the participation of the state Health Secretariat and the street children in the Group and 3) the lessons learned. (author)

Influence of social presence on eye movements in visual search tasks.

Science.gov (United States)

Liu, Na; Yu, Ruifeng

2017-12-01

This study employed an eye-tracking technique to investigate the influence of social presence on eye movements in visual search tasks. A total of 20 male subjects performed visual search tasks in a 2 (target presence: present vs. absent) × 2 (task complexity: complex vs. simple) × 2 (social presence: alone vs. a human audience) within-subject experiment. Results indicated that the presence of an audience could evoke a social facilitation effect on response time in visual search tasks. Compared with working alone, the participants made fewer and shorter fixations, larger saccades and shorter scan path in simple search tasks and more and longer fixations, smaller saccades and longer scan path in complex search tasks when working with an audience. The saccade velocity and pupil diameter in the audience-present condition were larger than those in the working-alone condition. No significant change in target fixation number was observed between two social presence conditions. Practitioner Summary: This study employed an eye-tracking technique to examine the influence of social presence on eye movements in visual search tasks. Results clarified the variation mechanism and characteristics of oculomotor scanning induced by social presence in visual search.

Far-infrared contraband-detection-system development for personnel-search applications

International Nuclear Information System (INIS)

Schellenbaum, R.L.

1982-09-01

Experiments have been conducted toward the development of an active near-millimeter-wave, far infrared, personnel search system for the detection of contraband. These experiments employed a microwave hybrid tee interferometer/radiometer scanning system and quasi-optical techniques at 3.3-mm wavelength to illuminate and detect the reflection from target objects against a human body background. Clothing and other common concealing materials are transport at this wavelength. Retroreflector arrays, in conjunction with a Gunn diode radiation source, were investigated to provide all-angle illumination and detection of specular reflections from unaligned and irregular-shaped objects. Results indicate that, under highly controlled search conditions, metal objects greater than or equal to 25 cm 2 can be detected in an enclosure lined with retroreflectors. Further development is required to produce a practical personnel search system. The investigation and feasibility of alternate far infrared search techniques are presented. 23 figures, 2 tables

Stochastic local search foundations and applications

CERN Document Server

Hoos, Holger H; Stutzle, Thomas

2004-01-01

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics. Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful too...

Search for Hadronic Resonances in CMS

CERN Multimedia

CERN. Geneva

2012-01-01

Many models of new physics involve colored particles predicted to decay into hadronic final states. We present the results of searches for new heavy resonances in final states with up to 8 jets. Dedicated techniques have been developed to take advantage of the boosted topology and identify W and Z bosons. We also discuss a trigger strategy to extend the dijet search well below 1 TeV. These results are based on pp collision data collected with the CMS detector in 2011 and 2012.

Optimal Semi-Adaptive Search With False Targets

Science.gov (United States)

2017-12-01

Kress, K. Y. Lin, and R. Szechtman, “Optimal discrete search with imperfect specificity,” Math Meth Oper Res, vol. 68, pp. 539–549, 2008. [16] L. D...constraints on employment of physical search assets will involve discrete approximations to the continuous solutions given by these techniques. These...model assumes. We optimize in the continuous case, to be able then to make the best possible discrete approximations if needed, given the constraints of a

Refining search terms for nanotechnology

International Nuclear Information System (INIS)

Porter, Alan L.; Youtie, Jan; Shapira, Philip; Schoeneck, David J.

2008-01-01

The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as 'nano') given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed

Refining search terms for nanotechnology

Energy Technology Data Exchange (ETDEWEB)

Porter, Alan L. [Georgia Institute of Technology (United States); Youtie, Jan [Georgia Institute of Technology, Enterprise Innovation Institute (United States)], E-mail: jan.youtie@innovate.gatech.edu; Shapira, Philip [Georgia Institute of Technology (United States); Schoeneck, David J. [Search Technology, Inc. (United States)

2008-05-15

The ability to delineate the boundaries of an emerging technology is central to obtaining an understanding of the technology's research paths and commercialization prospects. Nowhere is this more relevant than in the case of nanotechnology (hereafter identified as 'nano') given its current rapid growth and multidisciplinary nature. (Under the rubric of nanotechnology, we also include nanoscience and nanoengineering.) Past efforts have utilized several strategies, including simple term search for the prefix nano, complex lexical and citation-based approaches, and bootstrapping techniques. This research introduces a modularized Boolean approach to defining nanotechnology which has been applied to several research and patenting databases. We explain our approach to downloading and cleaning data, and report initial results. Comparisons of this approach with other nanotechnology search formulations are presented. Implications for search strategy development and profiling of the nanotechnology field are discussed.

Partial Transmit Sequence Optimization Using Improved Harmony Search Algorithm for PAPR Reduction in OFDM

Directory of Open Access Journals (Sweden)

Mangal Singh

2017-12-01

Full Text Available This paper considers the use of the Partial Transmit Sequence (PTS technique to reduce the Peak‐to‐Average Power Ratio (PAPR of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search‐based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.

Physics and Analysis at a Hadron Collider - Searching for New Physics (2/3)

CERN Multimedia

CERN. Geneva

2010-01-01

This is the second lecture of three which together discuss the physics of hadron colliders with an emphasis on experimental techniques used for data analysis. This second lecture discusses techniques important for analyses searching for new physics using the CDF B_s --> mu+ mu- search as a specific example. The lectures are aimed at graduate students.

ChemSearch Journal: Submissions

African Journals Online (AJOL)

AFRICAN JOURNALS ONLINE (AJOL) · Journals · Advanced Search · USING ... SCOPE: ChemSearch Journal is a peer-reviewed journal that publishes ... Authors whose papers have been accepted for publication will be notified in writing. ... The literature cited must be discussed to show the relationships between the ...

Dijet Searches with the ATLAS Detector

CERN Document Server

Beresford, Lydia; The ATLAS collaboration

2017-01-01

During the last two years the LHC produced pp collisions at the record center-of-mass energy of 13 TeV. The sensitivity of searches for new phenomena with a high mass scale greatly benefited from the energy increase with respect to the LHC run-1 data. Events with two hadronic jets in the final state are of particular interest: new phenomena produced in parton collisions are likely to produce final states with (at least) two partons. In this talk several searches performed by the ATLAS collaboration are presented. The very high mass and the low mass regions have both been investigated, by exploiting dedicated signatures and, in case of the latter, new techniques to overcome trigger limitations. Results and perspectives for these searches will be presented.

Prospects for neutron-antineutron transition search

International Nuclear Information System (INIS)

Kamyshkov, Y.; Tennessee Univ., Knoxville, TN

1996-01-01

Presently-available sources of free neutrons can allow an improvement in the discovery potential of a neutron-antineutron transition search by four orders of magnitude as compared to that of the most recent reactor-based search experiment performed at ILL in Grenoble. This would be equivalent to a characteristic neutron-antineutron transition time limit of >10 10 seconds. With future dedicated neutron-source Facilities, with further progress in cold-neutron- moderator techniques, and with a vertical experiment layout, the discovery potential could ultimately be pushed by another factor of ∼100 corresponding to a characteristic transition time limit of ∼10 11 seconds. Prospects for, and relative merits of, a neutron-antineutron oscillation search in intranuclear transitions are also discussed

A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search

Science.gov (United States)

Ghani, Nur Hamizah Abdul; Mamat, Mustafa; Rivaie, Mohd

2017-08-01

Conjugate gradient (CG) method is an important technique in unconstrained optimization, due to its effectiveness and low memory requirements. The focus of this paper is to introduce a new CG method for solving large scale unconstrained optimization. Theoretical proofs show that the new method fulfills sufficient descent condition if strong Wolfe-Powell inexact line search is used. Besides, computational results show that our proposed method outperforms to other existing CG methods.

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Energy Technology Data Exchange (ETDEWEB)

Gonzales, Antonio [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Blazier, Nicholas Paul [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-02-01

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

Search across Different Media: Numeric Data Sets and Text Files

Directory of Open Access Journals (Sweden)

Michael Buckland

2006-12-01

Full Text Available Digital technology encourages the hope of searching across and between different media forms (text, sound, image, numeric data. Topic searches are described in two different media: text files and socioeconomic numeric databases and also for transverse searching, whereby retrieved text is used to find topically related numeric data and vice versa. Direct transverse searching across different media is impossible. Descriptive metadata provide enabling infrastructure, but usually require mappings between different vocabularies and a search-term recommender system. Statistical association techniques and natural-language processing can help. Searches in socioeconomic numeric databases ordinarily require that place and time be specified.

Topical medication instillation techniques for glaucoma.

Science.gov (United States)

Xu, Li; Wang, Xuemei; Wu, Meijing

2017-02-20

Glaucoma is a leading cause of irreversible blindness worldwide and the second most common cause of blindness after cataracts. The primary treatment for glaucoma aims to lower intraocular pressure (IOP) with the use of topical medicines. Topical medication instillation techniques, such as eyelid closure and nasolacrimal occlusion when instilling drops, have been proposed as potential methods to increase ocular absorption and decrease systemic absorption of the drops. To investigate the effectiveness of topical medication instillation techniques compared with usual care or another method of instillation of topical medication in the management of glaucoma or ocular hypertension. We searched the Cochrane Central Register of Controlled Trials (CENTRAL) (which contains the Cochrane Eyes and Vision Trials Register) (2016, Issue 12), MEDLINE Ovid (1946 to 8 December 2016), Embase Ovid (1947 to 8 December 2016), PubMed (1948 to 8 December 2016), LILACS (Latin American and Caribbean Health Sciences Literature Database) (1982 to 8 December 2016), International Pharmaceutical Abstracts Database (1970 to 8 December 2016), the metaRegister of Controlled Trials (mRCT) (www.controlled-trials.com) (last searched 13 May 2013), ClinicalTrials.gov (www.clinicaltrials.gov) (searched 8 December 2016) and the WHO International Clinical Trials Registry Platform (ICTRP) (www.who.int/ictrp/search/en) (searched 8 December 2016). We did not use any date or language restrictions in the electronic searches for trials. We included randomized controlled trials which had compared any topical medication instillation technique with usual care or a different method of instillation of topical medication. Two review authors independently screened records from the searches for eligibility, assessed the risk of bias, and extracted data. We followed methods recommended by Cochrane. We identified two trials (122 eyes of 61 participants) that had evaluated a topical medication instillation technique. We

Reactive power planning with FACTS devices using gravitational search algorithm

Directory of Open Access Journals (Sweden)

Biplab Bhattacharyya

2015-09-01

Full Text Available In this paper, Gravitational Search Algorithm (GSA is used as optimization method in reactive power planning using FACTS (Flexible AC transmission system devices. The planning problem is formulated as a single objective optimization problem where the real power loss and bus voltage deviations are minimized under different loading conditions. GSA based optimization algorithm and particle swarm optimization techniques (PSO are applied on IEEE 30 bus system. Results show that GSA can also be a very effective tool for reactive power planning.

Annotating images by mining image search results.

Science.gov (United States)

Wang, Xin-Jing; Zhang, Lei; Li, Xirong; Ma, Wei-Ying

2008-11-01

Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel attempt at model-free image annotation, which is a data-driven approach that annotates images by mining their search results. Some 2.4 million images with their surrounding text are collected from a few photo forums to support this approach. The entire process is formulated in a divide-and-conquer framework where a query keyword is provided along with the uncaptioned image to improve both the effectiveness and efficiency. This is helpful when the collected data set is not dense everywhere. In this sense, our approach contains three steps: 1) the search process to discover visually and semantically similar search results, 2) the mining process to identify salient terms from textual descriptions of the search results, and 3) the annotation rejection process to filter out noisy terms yielded by Step 2. To ensure real-time annotation, two key techniques are leveraged-one is to map the high-dimensional image visual features into hash codes, the other is to implement it as a distributed system, of which the search and mining processes are provided as Web services. As a typical result, the entire process finishes in less than 1 second. Since no training data set is required, our approach enables annotating with unlimited vocabulary and is highly scalable and robust to outliers. Experimental results on both real Web images and a benchmark image data set show the effectiveness and efficiency of the proposed algorithm. It is also worth noting that, although the entire approach is illustrated within the divide-and conquer framework, a query keyword is not crucial to our current implementation. We provide experimental results to prove this.

Pharmacophore definition and 3D searches.

Science.gov (United States)

Langer, T; Wolber, G

2004-12-01

The most common pharmacophore building concepts based on either 3D structure of the target or ligand information are discussed together with the application of such models as queries for 3D database search. An overview of the key techniques available on the market is given and differences with respect to algorithms used and performance obtained are highlighted. Pharmacophore modelling and 3D database search are shown to be successful tools for enriching screening experiments aimed at the discovery of novel bio-active compounds.: © 2004 Elsevier Ltd . All rights reserved.

High performance technique for database applicationsusing a hybrid GPU/CPU platform

KAUST Repository

Zidan, Mohammed A.

2012-07-28

Many database applications, such as sequence comparing, sequence searching, and sequence matching, etc, process large database sequences. we introduce a novel and efficient technique to improve the performance of database applica- tions by using a Hybrid GPU/CPU platform. In particular, our technique solves the problem of the low efficiency result- ing from running short-length sequences in a database on a GPU. To verify our technique, we applied it to the widely used Smith-Waterman algorithm. The experimental results show that our Hybrid GPU/CPU technique improves the average performance by a factor of 2.2, and improves the peak performance by a factor of 2.8 when compared to earlier implementations. Copyright © 2011 by ASME.

Efficient Multi-keyword Ranked Search over Outsourced Cloud Data based on Homomorphic Encryption

Directory of Open Access Journals (Sweden)

Nie Mengxi

2016-01-01

Full Text Available With the development of cloud computing, more and more data owners are motivated to outsource their data to the cloud server for great flexibility and less saving expenditure. Because the security of outsourced data must be guaranteed, some encryption methods should be used which obsoletes traditional data utilization based on plaintext, e.g. keyword search. To solve the search of encrypted data, some schemes were proposed to solve the search of encrypted data, e.g. top-k single or multiple keywords retrieval. However, the efficiency of these proposed schemes is not high enough to be impractical in the cloud computing. In this paper, we propose a new scheme based on homomorphic encryption to solve this challenging problem of privacy-preserving efficient multi-keyword ranked search over outsourced cloud data. In our scheme, the inner product is adopted to measure the relevance scores and the technique of relevance feedback is used to reflect the search preference of the data users. Security analysis shows that the proposed scheme can meet strict privacy requirements for such a secure cloud data utilization system. Performance evaluation demonstrates that the proposed scheme can achieve low overhead on both computation and communication.

Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem

Directory of Open Access Journals (Sweden)

Suk Ho Jin

2017-06-01

Full Text Available The nurse rostering problem is an important search problem that features many constraints. In a nurse rostering problem, these constraints are defined by processes such as maintaining work regulations, assigning nurse shifts, and considering nurse preferences. A number of approaches to address these constraints, such as penalty function methods, have been investigated in the literature. We propose two types of hybrid metaheuristic approaches for solving the nurse rostering problem, which are based on combining harmony search techniques and artificial immune systems to balance local and global searches and prevent slow convergence speeds and prematurity. The proposed algorithms are evaluated against a benchmarking dataset of nurse rostering problems; the results show that they identify better or best known solutions compared to those identified in other studies for most instances. The results also show that the combination of harmony search and artificial immune systems is better suited than using single metaheuristic or other hybridization methods for finding upper-bound solutions for nurse rostering problems and discrete optimization problems.

Where to search top-K biomedical ontologies?

Science.gov (United States)

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.

Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search.

Science.gov (United States)

Jay, Caroline; Harper, Simon; Dunlop, Ian; Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain

2016-01-14

Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these "experts." Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the "Google generation" than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is "Google-like," enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F1,19=37.3, Pnatural language search interfaces for variable search supporting in particular: query reformulation; data browsing; faceted search; surrogates; relevance

Search for long-lived heavy charged particles using a ring imaging Cherenkov technique at LHCb

NARCIS (Netherlands)

Aaij, R.; Adeva, B.; Adinolfi, M.; Affolder, A.; Ajaltouni, Z.; Akar, S.; Albrecht, J.; Alessio, F.; Alexander, M.; Ali, S.; Alkhazov, G.; Cartelle, P. Alvarez; Alves, A. A., Jr.; Amato, S.; Amerio, S.; Amhis, Y.; Everse, LA; Anderlini, L.; Anderson, J.; Andreotti, M.; Andrews, J.E.; Appleby, R. B.; Gutierrez, O. Aquines; Archilli, F.; d'Argent, P.; Artamonov, A.; Artuso, M.; Aslanides, E.; Auriemma, G.; Baalouch, M.; Bachmann, S.; Back, J. J.; Badalov, A.; Baesso, C.; Baldini, W.; Barlow, R. J.; Barschel, C.; Barsuk, S.; Barter, W.; Batozskaya, V.; Battista, V.; Bay, A.; Beaucourt, L.; Beddow, J.; Bedeschi, F.; Bediaga, I.; Bel, L. J.; Belyaev, I.; Ben-Haim, E.; Bencivenni, G.; Benson, S.; Benton, J.; Berezhnoy, A.; Bernet, R.; Bertolin, A.; Bettler, M-O.; Van Beuzekom, Martin; Bien, A.; Bifani, S.; Bird, T.D.; Birnkraut, A.; Bizzeti, A.; Blake, T.; Blanc, F.; Blouw, J.; Blusk, S.; Bocci, V.; Bondar, A.; Bondar, N.; Bonivento, W.; Borghi, S.; Borgia, A.; Borsato, M.; Bowcock, T. J. V.; Bowen, E.; Bozzi, C.; Brett, D.; Britsch, M.; Britton, T.; Brodzicka, J.; Brook, N. H.; Bursche, A.; Buytaert, J.; Cadeddu, S.; Calabrese, R.; Calvi, M.; Calvo Gomez, M.; Campana, P.; Perez, D. H. Campora; Capriotti, L.; Carbone, A.; Carboni, G.; Cardinale, R.; Cardini, A.; Carniti, P.; Carson, L.; Carvalho Akiba, K.; Casanova Mohr, R.; Casse, G.; Cassina, L.; Garcia, L. Castillo; Cattaneo, M.; Cauet, Ch; Cavallero, G.; Cenci, R.; Charles, M.; Charpentier, Ph; Chefdeville, M.; Chen, S.; Cheung, S-F.; Chiapolini, N.; Chrzaszcz, M.; Vidal, X. Cid; Ciezarek, G.; Clarke, P. E. L.; Clemencic, M.; Cliff, H. V.; Closier, J.; Coco, V.; Cogan, J.; Cogneras, E.; Cogoni, V.; Cojocariu, L.; Collazuol, G.; Collins, P.; Comerma-Montells, A.; Contu, A.; Cook, A.; Coombes, M.; Coquereau, S.; Corti, G.; Corvo, M.; Counts, I.; Couturier, B.; Cowan, G. A.; Craik, D. C.; Crocombe, A.; CruzTorres, M.; Cunliffe, S.; Currie, C.R.; D'Ambrosio, C.; Dalseno, J.; David, P. N. Y.; Davis, A.; De Bruyn, K.; De Capua, S.; De Cian, M.; de Miranda, J. M.; Paula, L.E.; da-Silva, W.S.; De Simone, P.; Dean, C-T.; Decamp, D.; Deckenhoff, M.; Del Buono, L.; Deleage, N.; Derkach, D.; Deschamps, O.; Dettori, F.; Dey, B.; Di Canto, A.; Di Ruscio, F.; Dijkstra, H.; Donleavy, S.; Dordei, F.; Dorigo, M.; Dosil Suarez, A.; Dossett, D.; Dovbnya, A.; Dreimanis, K.; Dujany, G.; Dupertuis, F.; Durante, P.; Dzhelyadin, R.; Dziurda, A.; Dzyuba, A.; Easo, S.; Egede, U.; Egorychev, V.; Eidelman, S.; Eisenhardt, S.; Eitschberger, U.; Ekelhof, R.; Eklund, L.; ElRifai, I.; Elsasser, Ch.; Ely, S.; Esen, S.; Evans, H. M.; Evans, T. M.; Falabella, A.; Faerber, C.; Farinelli, C.; Farley, N.; Farry, S.; Fay, R.; Ferguson, D.; Fernandez Albor, V.; Ferrari, F.; Ferreira Rodrigues, F.; Ferro-Luzzi, M.; Filippov, S.; Fiore, M.; Fiorini, M.; Firlej, M.; Fitzpatrick, C.; Fiutowski, T.; Fol, P.; Fontana, Mark; Fontanelli, F.; Forty, R.; De Aguiar Francisco, O.; Frank, M.; Frei, C.; Frosini, M.; Fu, J.; Furfaro, E.; Torreira, A. Gallas; Galli, D.; Gallorini, S.; Gambetta, S.; Gandelman, M.; Gandini, P.; Gao, Y.; Garcia Pardinas, J.; Garofoli, J.; Tico, J. Garra; Garrido, L.; Gascon, D.; Carvalho-Gaspar, M.; Gauld, Rhorry; Gavardi, L.; Gazzoni, G.; Geraci, A.; Gerick, D.; Gersabeck, E.; Gersabeck, M.; Gershon, T. J.; Ghez, Ph; Gianelle, A.; Giani, S.; Gibson, V.; Giubega, L.; Gligorov, V. V.; Goebel, C.; Golubkov, D.; Golutvin, A.; Gomes, A.Q.; Gotti, C.; Gandara, M. Grabalosa; Diaz, R. Graciani; Cardoso, L. A. Granado; Grauges, E.; Graverini, E.; Graziani, G.; Grecu, A.; Greening, E.; Gregson, S.; Griffith, P.; Grillo, L.; Gruenberg, O.; Gui, B.; Gushchin, E.; Guz, Yu; Gys, T.; Hadjivasiliou, C.; Haefeli, G.; Haen, C.; Haines, S. C.; Hall, S.; Hamilton, B.; Hampson, T.; Han, X.; Hansmann-Menzemer, S.; Harnew, N.; Harnew, S. T.; Harrison, J.; He, J.; Head, T.; Heijne, V.; Hennessy, K.; Henrard, P.; Henry, L.; Hernando Morata, J. A.; van Herwijnen, E.; Hess, H.M.; Hicheur, A.; Hill, D.; Hoballah, M.; Hombach, C.; Hulsbergen, W.; Humair, T.; Hussain, N.; Hutchcroft, D. E.; Hynds, D.; Idzik, M.; Ilten, P.; Jacobsson, R.; Jaeger, A.; Jalocha, J.; Jans, E.; Jawahery, A.; Jing, F.; John, M.; Johnson, D.; Jones, C. R.; Joram, C.; Jost, B.; Jurik, N.; Kandybei, S.; Kanso, W.; Karacson, M.; Karbach, T. M.; Karodia, S.; Kelsey, M. H.; Kenyon, I. R.; Kenzie, M.; Ketel, T.; Khanji, B.; Khurewathanakul, C.; Klaver, S.M.; Klimaszewski, K.; Kochebina, O.; Kolpin, M.; Komarov, I.; Koopman, R. F.; Koppenburg, P.; Kravchuk, L.; Kreplin, K.; Kreps, M.; Krocker, G.; Krokovny, P.; Kruse, F.; Kucewicz, W.; Kucharczyk, M.; Kudryavtsev, V.; Kurek, K.; Kvaratskheliya, T.; La Thi, V. N.; Lacarrere, D.; Lafferty, G. D.; Lai, A.; Lambert, D.M.; Lambert, R. W.; Lanfranchi, G.; Langenbruch, C.; Langhans, B.; Latham, T. E.; Lazzeroni, C.; Le Gac, R.; van Leerdam, J.; Lees, J. P.; Lefevre, R.; Leflat, A.; Lefrancois, J.; Leroy, O.; Lesiak, T.; Leverington, B.; Li, Y.; Likhomanenko, T.; Liles, M.; Lindner, R.; Linn, S.C.; Lionetto, F.; Liu, B.; Lohn, S.; Longstaff, I.; Lopes, J. H.; Lucchesi, D.; Luo, H.; Lupato, A.; Luppi, E.; Lupton, O.; Machefert, F.; Machikhiliyan, I. V.; Maciuc, F.; Maev, O.; Malde, S.; Malinin, A.; Manca, G.; Mancinelli, G.; Manning, P.; Mapelli, A.; Maratas, J.; Marchand, J. F.; Marconi, U.; Marin Benito, C.; Marino, P.; Maerki, R.; Marks, J.; Martellotti, G.; Martinelli-Boneschi, F.; Santos, D. Martinez; Martinez-Vidal, F.; Martins Tostes, D.; Massafferri, A.; Matev, R.; Mathe, Z.; Matteuzzi, C.; Mauri, A.; Maurin, B.; Mazurov, A.; McCann, M.; McCarthy, J.; Mcnab, A.; McNulty, R.; McSkelly, B.; Meadows, B. T.; Meier, F.; Meissner, M.; Merk, M.; Milanes, D. A.; Minard, M. N.; Mitzel, D. S.; Molina Rodriguez, J.; Monteil, S.; Morandin, M.; Morawski, P.; Morda, A.; Morello, M. J.; Moron, J.; Morris, A. B.; Mountain, R.; Muheim, F.; Mueller, J.; Mueller, Karl; Mueller, V.; Mussini, M.; Muster, B.; Naik, P.; Nakada, T.; Nandakumar, R.; Nasteva, I.; Needham, M.; Neri, N.; Neubert, S.; Neufeld, N.; Neuner, M.; Nguyen, A. D.; Nguyen, T. D.; Nguyen-Mau, C.; Niess, V.; Niet, R.; Nikitin, N.; Nikodem, T.; Novoselov, A.; O'Hanlon, D. P.; Oblakowska-Mucha, A.; Obraztsov, V.; Ogilvy, S.; Okhrimenko, O.; Oldeman, R.; Onderwater, C. J. G.; Osorio Rodrigues, B.; Otalora Goicochea, J. M.; Otto, E.A.; Owen, R.P.; Oyanguren, A.; Palano, A.; Palombo, F.; Palutan, M.; Panman, J.; Papanestis, A.; Pappagallo, M.; Pappalardo, L.L.; Parkes, C.; Passaleva, G.; Patel, G. D.; Patel, M.; Patrignani, C.; Pearce, D.A.; Pellegrino, A.; Penso, G.; Altarelli, M. Pepe; Perazzini, S.; Perret, P.; Pescatore, L.; Petridis, K.; Petrolini, A.; Olloqui, E. Picatoste; Pietrzyk, B.; Pilar, T.; Pinci, D.; Pistone, A.; Playfer, S.; Plo Casasus, M.; Poikela, T.; Polci, F.; Poluektov, A.; Polyakov, I.; Polycarpo, E.; Popov, A.; Popov, D.; Popovici, B.; Potterat, C.; Price, M. E.; Price, J.D.; Prisciandaro, J.; Pritchard, C.A.; Prouve, C.; Pugatch, V.; Navarro, A. Puig; Punzi, G.; Qian, Y.W.; Quagliani, R.; Rachwal, B.; Rademacker, J. H.; Rakotomiaramanana, B.; Rama, M.; Rangel, M. S.; Raniuk, I.; Rauschmayr, N.; Raven, G.; Redi, F.; Reichert, S.; Reid, M.; dos Reis, A. C.; Ricciardi, S.; Richards, Jennifer S; Rihl, M.; Rinnert, K.; Rives Molina, V.; Robbe, P.; Rodrigues, A. B.; Rodrigues, L.E.T.; Perez, P. Rodriguez; Roiser, S.; Romanovsky, V.; Romero Vidal, A.; Rotondo, M.; Rouvinet, J.; Ruf, T.; Ruiz, van Hapere; Ruiz Valls, P.; Saborido Silva, J. J.; Sagidova, N.; Sail, P.; Saitta, B.; Salustino Guimaraes, V.; Sanchez Mayordomo, C.; Sanmartin Sedes, B.; Santacesaria, R.; Santamarina Rios, C.; Santovetti, E.; Sarti, A.; Satriano, C.; Satta, A.; Saunders, D. M.; Savrina, D.; Schiller, M.; Schindler, R. H.; Schlupp, M.; Schmelling, M.; Schmelzer, T.; Schmidt, B.; Schneider, O.; Schopper, A.; Schune, M. H.; Schwemmer, R.; Sciascia, B.; Sciubba, A.; Semennikov, A.; Sepp, I.; Serra, N.; Serrano, J.; Sestini, L.; Seyfert, P.; Shapkin, M.; Shapoval, I.; Shcheglov, Y.; Shears, T.; Shekhtman, L.; Shevchenko, V.; Shires, A.; Coutinho, R. Silva; Simi, G.; Sirendi, M.; Skidmore, N.; Skillicorn, I.; Skwarnicki, T.; Smith, E.; Smith, E.; Smith, J; Smith, M.; Snoek, H.; Sokoloff, M. D.; Soler, F. J. P.; Soomro, F.; de Souza, D.K.; Souza De Paula, B.; Spaan, B.; Spradlin, P.; Sridharan, S.; Stagni, F.; Stahl, M.; Stahl, S.; Steinkamp, O.; Stenyakin, O.; Sterpka, F.; Stevenson-Moore, P.; Stoica, S.; Stone, S.; Storaci, B.; Stracka, S.; Straticiuc, M.; Straumann, U.; Stroili, R.; Sun, L.; Sutcliffe, W.; Swientek, K.; Swientek, S.; Syropoulos, V.; Szczekowski, M.; Szczypka, P.; Szumlak, T.; T'Jampens, S.; Tekampe, T.; Teklishyn, M.; Tellarini, G.; Teubert, F.; Thomas, C.; Thomas, E.; van Tilburg, J.; Tisserand, V.; Tobin, M. N.; Todd, Jim; Tolk, S.; Tomassetti, L.; Tonelli, D.; Topp-Joergensen, S.; Torr, N.; Tournefier, E.; Tourneur, S.; Trabelsi, K.; Tran, N.T.M.T.; Tresch, M.; Trisovic, A.; Tsaregorodtsev, A.; Tsopelas, P.; Tuning, N.; Garcia, M. Ubeda; Ukleja, A.; Ustyuzhanin, A.; Uwer, U.; Vacca, C.; Vagnoni, V.; Valenti, G.; Vallier, A.; Gomez, R. Vazquez; Vazquez Regueiro, P.; Vazquez Sierra, C.; Vecchi, S.; Velthuis, M.J.; Veltri, M.; Veneziano, G.; Vesterinen, M.; Viaud, B.; Vieira, D.; Vieites Diaz, M.; Vilasis-Cardona, X.; Vollhardt, A.; Volyanskyy, D.; Voong, D.; Vorobyev, A.; Vorobyev, V.; Voss, C.; de Vries, J. A.; Waldi, R.; Wallace, C.; Wallace, R.; Walsh, John; Wandernoth, S.; Wang, J.; Ward, D. R.; Watson, N. K.; Websdale, D.; Weiden, A.; Whitehead, M.; Wiedner, D.; Wilkinson, G.; Wilkinson, M.; Williams, M.; Williams, M.P.; Williams, M.; Wilson, James F; Wimberley, J.; Wishahi, J.; Wislicki, W.; Witek, M.; Wormser, G.; Wotton, S. A.; Wright, S.J.; Wyllie, K.; Xie, Y.; Xu, Z.; Yang, Z.; Yuan, X.; Yushchenko, O.; Zangoli, M.; Zavertyaev, M.; Zhang, L.; Zhang, Y.; Zhelezov, A.; Zhokhov, A.; Zhong, L.

2015-01-01

A search is performed for heavy long-lived charged particles using 3.0 fb(-1) of proton-proton collisions collected at √s = 7 and 8 TeV with the LHCb detector. The search is mainly based on the response of the ring imaging Cherenkov detectors to distinguish the heavy, slow-moving particles from

Searching for Suicide Information on Web Search Engines in Chinese

Directory of Open Access Journals (Sweden)

Yen-Feng Lee

2017-01-01

Full Text Available Introduction: Recently, suicide prevention has been an important public health issue. However, with the growing access to information in cyberspace, the harmful information is easily accessible online. To investigate the accessibility of potentially harmful suicide-related information on the internet, we discuss the following issue about searching suicide information on the internet to draw attention to it. Methods: We use five search engines (Google, Yahoo, Bing, Yam, and Sina and four suicide-related search queries (suicide, how to suicide, suicide methods, and want to die in traditional Chinese in April 2016. We classified the first thirty linkages of the search results on each search engine by a psychiatric doctor into suicide prevention, pro-suicide, neutral, unrelated to suicide, or error websites. Results: Among the total 352 unique websites generated, the suicide prevention websites were the most frequent among the search results (37.8%, followed by websites unrelated to suicide (25.9% and neutral websites (23.0%. However, pro-suicide websites were still easily accessible (9.7%. Besides, compared with the USA and China, the search engine originating in Taiwan had the lowest accessibility to pro-suicide information. The results of ANOVA showed a significant difference between the groups, F = 8.772, P < 0.001. Conclusions: This study results suggest a need for further restrictions and regulations of pro-suicide information on the internet. Providing more supportive information online may be an effective plan for suicidal prevention.

Searching for supersymmetry scalelessly

Energy Technology Data Exchange (ETDEWEB)

Schlaffer, M. [DESY, Hamburg (Germany); Weizmann Institute of Science, Department of Particle Physics and Astrophysics, Rehovot (Israel); Spannowsky, M. [Durham University, Department of Physics, Institute for Particle Physics Phenomenology, Durham (United Kingdom); Weiler, A. [Technische Universitaet Muenchen, Physik Department T75, Garching (Germany)

2016-08-15

In this paper we propose a scale invariant search strategy for hadronic top or bottom plus missing energy final states. We present a method which shows flat efficiencies and background rejection factors over broad ranges of parameters and masses. The resulting search can easily be recast into a limit on alternative models. We show the strength of the method in a natural SUSY setup where stop and sbottom squarks are pair produced and decay into hadronically decaying top quarks or bottom quarks and higgsinos. (orig.)

Enhancing the Search in MOLAP Sparse Data 

Directory of Open Access Journals (Sweden)

Joseph Zalaket

2012-11-01

Full Text Available Multidimensional on-line analytical processing (MOLAP systems deal well with dense data than relational ones (ROLAP. In the existence of sparse data, MOLAP systems become memory consuming, which may limit and slow down data processing tasks. Many compression techniques have been proposed to deal with the sparsity of data in MOLAP systems. One of these techniques is the bitmap compression, which allows a significant reduction of the memory space used for data processing. In this article, we propose an extension to the bitmap compression technique by storing the compressed data as bits into multiple efficient data structures based on a new indexing strategy instead of the linear structure. Compared with the classical bitmap, the proposed enhancement not only allows space reduction but also reduces the search time through the compressed data. We present some algorithms that allow maintaining and searching within the compressed structure without the need for decompression. We demonstrate that the complexity of the proposed algorithms varies from logarithmic to constant, compared with the linear complexity of the classical bitmap technique. 

Remarks on search methods for stable, massive, elementary particles

International Nuclear Information System (INIS)

Perl, Martin L.

2001-01-01

This paper was presented at the 69th birthday celebration of Professor Eugene Commins, honoring his research achievements. These remarks are about the experimental techniques used in the search for new stable, massive particles, particles at least as massive as the electron. A variety of experimental methods such as accelerator experiments, cosmic ray studies, searches for halo particles in the galaxy and searches for exotic particles in bulk matter are described. A summary is presented of the measured limits on the existence of new stable, massive particle

Searches over graphs representing geospatial-temporal remote sensing data

Science.gov (United States)

Brost, Randolph; Perkins, David Nikolaus

2018-03-06

Various technologies pertaining to identifying objects of interest in remote sensing images by searching over geospatial-temporal graph representations are described herein. Graphs are constructed by representing objects in remote sensing images as nodes, and connecting nodes with undirected edges representing either distance or adjacency relationships between objects and directed edges representing changes in time. Geospatial-temporal graph searches are made computationally efficient by taking advantage of characteristics of geospatial-temporal data in remote sensing images through the application of various graph search techniques.

Towards improving searches for optimal phylogenies.

Science.gov (United States)

Ford, Eric; St John, Katherine; Wheeler, Ward C

2015-01-01

Finding the optimal evolutionary history for a set of taxa is a challenging computational problem, even when restricting possible solutions to be "tree-like" and focusing on the maximum-parsimony optimality criterion. This has led to much work on using heuristic tree searches to find approximate solutions. We present an approach for finding exact optimal solutions that employs and complements the current heuristic methods for finding optimal trees. Given a set of taxa and a set of aligned sequences of characters, there may be subsets of characters that are compatible, and for each such subset there is an associated (possibly partially resolved) phylogeny with edges corresponding to each character state change. These perfect phylogenies serve as anchor trees for our constrained search space. We show that, for sequences with compatible sites, the parsimony score of any tree [Formula: see text] is at least the parsimony score of the anchor trees plus the number of inferred changes between [Formula: see text] and the anchor trees. As the maximum-parsimony optimality score is additive, the sum of the lower bounds on compatible character partitions provides a lower bound on the complete alignment of characters. This yields a region in the space of trees within which the best tree is guaranteed to be found; limiting the search for the optimal tree to this region can significantly reduce the number of trees that must be examined in a search of the space of trees. We analyze this method empirically using four different biological data sets as well as surveying 400 data sets from the TreeBASE repository, demonstrating the effectiveness of our technique in reducing the number of steps in exact heuristic searches for trees under the maximum-parsimony optimality criterion. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Overview of the CLEF 2016 Social Book Search Lab

DEFF Research Database (Denmark)

Koolen, Marijn; Bogers, Toine; Gäde, Maria

2016-01-01

systems. The aim of the Interactive Track is to develop user interfaces that support users through each stage during complex search tasks and to investigate how users exploit professional metadata and user-generated content. The Mining Track focuses on detecting and linking book titles in online book......The Social Book Search (SBS) Lab investigates book search in scenarios where users search with more than just a query, and look for more than objective metadata. Real-world information needs are generally complex, yet almost all research focuses instead on either relatively simple search based...... on queries, or on profile-based recommendation. The goal is to research and develop techniques to support users in complex book search tasks. The SBS Lab has three tracks. The aim of the Suggestion Track is to develop test collections for evaluating ranking effectiveness of book retrieval and recommender...

ARSTEC, Nonlinear Optimization Program Using Random Search Method

International Nuclear Information System (INIS)

Rasmuson, D. M.; Marshall, N. H.

1979-01-01

1 - Description of problem or function: The ARSTEC program was written to solve nonlinear, mixed integer, optimization problems. An example of such a problem in the nuclear industry is the allocation of redundant parts in the design of a nuclear power plant to minimize plant unavailability. 2 - Method of solution: The technique used in ARSTEC is the adaptive random search method. The search is started from an arbitrary point in the search region and every time a point that improves the objective function is found, the search region is centered at that new point. 3 - Restrictions on the complexity of the problem: Presently, the maximum number of independent variables allowed is 10. This can be changed by increasing the dimension of the arrays

The search for a heavy Higgs boson

International Nuclear Information System (INIS)

Dawson, S.

1989-02-01

Theoretical limits on the mass of the Higgs boson from vacuum stability and perturbative unitarity are examined. Search techniques for heavy Higgs bosons, M/sub H/ > 200 GeV, are also reviewed. 8 refs., 5 figs

Traditional genetic improvement and use of biotechnological techniques in searching of resistance to main fungi pathogens of Musa spp.

Directory of Open Access Journals (Sweden)

Michel Leiva-Mora

2006-07-01

Full Text Available Bananas and plantain are important food staple in human diet, even cooked or consumed fresh. Fungal diseases caused by Fusarium oxysporum f. sp. cubense (Foc and Mycosphaerella fijiensis have threated to distroy Musa spp. Those crops are difficult to breed genetically because they are steriles, do not produce fertil seeds and they are partenocarpic. Genetic crossing by hibridization have been used successfully in FHIA and IITA Musa breeding programs, they have released numerous improved hybrids to those diseases. Plant Biotechnology has developed a set of techniques for Musa micropropagation to increase multiplication rates, healthy and safety plant material for plantation. Mutagenic techniques, somaclonal variation, somatic embryogenesis and more recient genetic transformation have enabled advances and complementation with clasical Musa breeding for searching resistance to principal fungal pathogen of Musa spp. Field evaluation systems to find Musa resistant genotypes to Foc and M. fijiensis have demostrated to be usefull but laborious. Nevertheless to enhance eficacy in selection of promissory genotypes the development of reproducible early evaluation methodologies by using fungal pathogens or their derivates is needed. Key words: evaluation and selection, Fusarium oxysporum, improvement

Photovoltaic and Wind Turbine Integration Applying Cuckoo Search for Probabilistic Reliable Optimal Placement

OpenAIRE

R. A. Swief; T. S. Abdel-Salam; Noha H. El-Amary

2018-01-01

This paper presents an efficient Cuckoo Search Optimization technique to improve the reliability of electrical power systems. Various reliability objective indices such as Energy Not Supplied, System Average Interruption Frequency Index, System Average Interruption, and Duration Index are the main indices indicating reliability. The Cuckoo Search Optimization (CSO) technique is applied to optimally place the protection devices, install the distributed generators, and to determine the size of ...

Parallel Harmony Search Based Distributed Energy Resource Optimization

Energy Technology Data Exchange (ETDEWEB)

Ceylan, Oguzhan [ORNL; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)

2015-01-01

This paper presents a harmony search based parallel optimization algorithm to minimize voltage deviations in three phase unbalanced electrical distribution systems and to maximize active power outputs of distributed energy resources (DR). The main contribution is to reduce the adverse impacts on voltage profile during a day as photovoltaics (PVs) output or electrical vehicles (EVs) charging changes throughout a day. The IEEE 123- bus distribution test system is modified by adding DRs and EVs under different load profiles. The simulation results show that by using parallel computing techniques, heuristic methods may be used as an alternative optimization tool in electrical power distribution systems operation.

Predicting consumer behavior with Web search.

Science.gov (United States)

Goel, Sharad; Hofman, Jake M; Lahaie, Sébastien; Pennock, David M; Watts, Duncan J

2010-10-12

Recent work has demonstrated that Web search volume can "predict the present," meaning that it can be used to accurately track outcomes such as unemployment levels, auto and home sales, and disease prevalence in near real time. Here we show that what consumers are searching for online can also predict their collective future behavior days or even weeks in advance. Specifically we use search query volume to forecast the opening weekend box-office revenue for feature films, first-month sales of video games, and the rank of songs on the Billboard Hot 100 chart, finding in all cases that search counts are highly predictive of future outcomes. We also find that search counts generally boost the performance of baseline models fit on other publicly available data, where the boost varies from modest to dramatic, depending on the application in question. Finally, we reexamine previous work on tracking flu trends and show that, perhaps surprisingly, the utility of search data relative to a simple autoregressive model is modest. We conclude that in the absence of other data sources, or where small improvements in predictive performance are material, search queries provide a useful guide to the near future.

Searches for new physics at ATLAS

CERN Document Server

Pachal, Katherine; The ATLAS collaboration

2018-01-01

Throughout Run II ATLAS has maintained an extensive, varied program of searches for physics beyond the Standard Model. Searches for supersymmetry cover strong and electroweak production as well as R-parity violating scenarios, while Exotic analyses search for heavy bosons, dark matter mediators, exotic Higgs production, and much more. This talk will show highlights of the Run II search results so far and lay out plans for analyses in the full dataset and beyond.

A new greedy search method for the design of digital IIR filter

Directory of Open Access Journals (Sweden)

Ranjit Kaur

2015-07-01

Full Text Available A new greedy search method is applied in this paper to design the optimal digital infinite impulse response (IIR filter. The greedy search method is based on binary successive approximation (BSA and evolutionary search (ES. The suggested greedy search method optimizes the magnitude response and the phase response simultaneously and also finds the lowest order of the filter. The order of the filter is controlled by a control gene whose value is also optimized along with the filter coefficients to obtain optimum order of designed IIR filter. The stability constraints of IIR filter are taken care of during the design procedure. To determine the trade-off relationship between conflicting objectives in the non-inferior domain, the weighting method is exploited. The proposed approach is effectively applied to solve the multiobjective optimization problems of designing the digital low-pass (LP, high-pass (HP, bandpass (BP, and bandstop (BS filters. It has been demonstrated that this technique not only fulfills all types of filter performance requirements, but also the lowest order of the filter can be found. The computational experiments show that the proposed approach gives better digital IIR filters than the existing evolutionary algorithm (EA based methods.

A technique for searching for the 2 K capture in 124Xe with a copper proportional counter

Science.gov (United States)

Gavrilyuk, Yu. M.; Gangapshev, A. M.; Kazalov, V. V.; Kuzminov, V. V.; Panasenko, S. I.; Ratkevich, S. S.; Tekueva, D. A.; Yakimenko, S. P.

2015-12-01

An experimental technique for searching for the 2 K capture in 124Xe with a large low-background copper proportional counter is described. Such an experiment is conducted at the Baksan Neutrino Observatory of the Institute for Nuclear Research of the Russian Academy of Sciences. The experimental setup is located in the Low-Background Deep-Level Laboratory at a depth of 4900 m.w.e., where the flux of muons of cosmic rays is suppressed by a factor of 107 relative to that at the Earth's surface. The setup incorporates a proportional counter and low-background shielding (18 cm of copper, 15 cm of lead, and 8 cm of borated polyethylene). The results of processing the data obtained in 5 months of live measurement time are presented. A new limit on the half-life of 124Xe with respect to the 2 K capture is set at the level of 2.5 × 1021 years.

Searches for new physics using jet grooming and substructure

CERN Document Server

Burr, Jonathan Thomas Peter; The ATLAS collaboration

2017-01-01

Models predicting the production and decay of supersymmetric (SUSY) particles often have promising search channels involving decays through heavy intermediate states such as top quarks and heavy bosons. However, unlike in most exotics scenarios these heavy states are only moderately boosted which can make traditional substructure techniques less useful and motivates the development of alternative techniques. The results of several SUSY analyses using substructure techniques are presented.

Genetic local search algorithm for optimization design of diffractive optical elements.

Science.gov (United States)

Zhou, G; Chen, Y; Wang, Z; Song, H

1999-07-10

We propose a genetic local search algorithm (GLSA) for the optimization design of diffractive optical elements (DOE's). This hybrid algorithm incorporates advantages of both genetic algorithm (GA) and local search techniques. It appears better able to locate the global minimum compared with a canonical GA. Sample cases investigated here include the optimization design of binary-phase Dammann gratings, continuous surface-relief grating array generators, and a uniform top-hat focal plane intensity profile generator. Two GLSA's whose incorporated local search techniques are the hill-climbing method and the simulated annealing algorithm are investigated. Numerical experimental results demonstrate that the proposed algorithm is highly efficient and robust. DOE's that have high diffraction efficiency and excellent uniformity can be achieved by use of the algorithm we propose.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Science.gov (United States)

Wang, Yifan; Wu, Lingdan; Luo, Liang; Zhang, Yifen; Dong, Guangheng

2017-01-01

The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Short-term Internet search using makes people rely on search engines when facing unknown issues.

Directory of Open Access Journals (Sweden)

Yifan Wang

Full Text Available The Internet search engines, which have powerful search/sort functions and ease of use features, have become an indispensable tool for many individuals. The current study is to test whether the short-term Internet search training can make people more dependent on it. Thirty-one subjects out of forty subjects completed the search training study which included a pre-test, a six-day's training of Internet search, and a post-test. During the pre- and post- tests, subjects were asked to search online the answers to 40 unusual questions, remember the answers and recall them in the scanner. Un-learned questions were randomly presented at the recalling stage in order to elicited search impulse. Comparing to the pre-test, subjects in the post-test reported higher impulse to use search engines to answer un-learned questions. Consistently, subjects showed higher brain activations in dorsolateral prefrontal cortex and anterior cingulate cortex in the post-test than in the pre-test. In addition, there were significant positive correlations self-reported search impulse and brain responses in the frontal areas. The results suggest that a simple six-day's Internet search training can make people dependent on the search tools when facing unknown issues. People are easily dependent on the Internet search engines.

Hybridisations of Variable Neighbourhood Search and Modified Simplex Elements to Harmony Search and Shuffled Frog Leaping Algorithms for Process Optimisations

Science.gov (United States)

Aungkulanon, P.; Luangpaiboon, P.

2010-10-01

Nowadays, the engineering problem systems are large and complicated. An effective finite sequence of instructions for solving these problems can be categorised into optimisation and meta-heuristic algorithms. Though the best decision variable levels from some sets of available alternatives cannot be done, meta-heuristics is an alternative for experience-based techniques that rapidly help in problem solving, learning and discovery in the hope of obtaining a more efficient or more robust procedure. All meta-heuristics provide auxiliary procedures in terms of their own tooled box functions. It has been shown that the effectiveness of all meta-heuristics depends almost exclusively on these auxiliary functions. In fact, the auxiliary procedure from one can be implemented into other meta-heuristics. Well-known meta-heuristics of harmony search (HSA) and shuffled frog-leaping algorithms (SFLA) are compared with their hybridisations. HSA is used to produce a near optimal solution under a consideration of the perfect state of harmony of the improvisation process of musicians. A meta-heuristic of the SFLA, based on a population, is a cooperative search metaphor inspired by natural memetics. It includes elements of local search and global information exchange. This study presents solution procedures via constrained and unconstrained problems with different natures of single and multi peak surfaces including a curved ridge surface. Both meta-heuristics are modified via variable neighbourhood search method (VNSM) philosophy including a modified simplex method (MSM). The basic idea is the change of neighbourhoods during searching for a better solution. The hybridisations proceed by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this local solution. The results show that the variant of HSA with VNSM and MSM seems to be better in terms of the mean and variance of design points and yields.

PhAST: pharmacophore alignment search tool.

Science.gov (United States)

Hähnke, Volker; Hofmann, Bettina; Grgat, Tomislav; Proschak, Ewgenij; Steinhilber, Dieter; Schneider, Gisbert

2009-04-15

We present a ligand-based virtual screening technique (PhAST) for rapid hit and lead structure searching in large compound databases. Molecules are represented as strings encoding the distribution of pharmacophoric features on the molecular graph. In contrast to other text-based methods using SMILES strings, we introduce a new form of text representation that describes the pharmacophore of molecules. This string representation opens the opportunity for revealing functional similarity between molecules by sequence alignment techniques in analogy to homology searching in protein or nucleic acid sequence databases. We favorably compared PhAST with other current ligand-based virtual screening methods in a retrospective analysis using the BEDROC metric. In a prospective application, PhAST identified two novel inhibitors of 5-lipoxygenase product formation with minimal experimental effort. This outcome demonstrates the applicability of PhAST to drug discovery projects and provides an innovative concept of sequence-based compound screening with substantial scaffold hopping potential. 2008 Wiley Periodicals, Inc.

Exotics searches in ATLAS

CERN Document Server

Wang, Renjie; The ATLAS collaboration

2017-01-01

Many theories beyond the Standard Model predict new physics accessible by the LHC. The ATLAS experiment all have rigorous search programs ongoing with the aim to find indications for new physics involving state of the art analysis techniques. This talk reports on new results obtained using the pp collision data sample collected in 2015 and 2016 at the LHC with a centre-of-mass energy of 13 TeV.

A naïve ontology for concepts of time and space for searching and learning

Directory of Open Access Journals (Sweden)

M. Miwa

2007-01-01

Full Text Available Introduction. In this paper, we propose a new approach for developing a naïve ontology as the basis for optimal information access interfaces for multimedia digital documents intended for novice users. Method. We try to elicit the knowledge structure of domain novices and patterns of its modification in their searching and learning processes by eye-tracker and showing eye-movements in the post-search interviews. Analysis. Recorded interview data were fully transcribed and coded using Atlas.ti and analysed following a bottom-up strategy of the constant-comparative technique. Results. We developed a taxonomy of knowledge modification which includes (1 adding, (2 correcting, (3 limiting, (4 relating, (5 specifying and (6 transforming. Conclusion. The taxonomy may be expanded and elaborated as the project progress and findings are expected to be incorporated into the design of the naïve ontology. The study results provided theoretical implications on knowledge building, methodological implications on data collection using eye-tracker and showing eye-movements in the post-search interviews and useful information on the design of information access interface for novices users.

Raising Reliability of Web Search Tool Research through Replication and Chaos Theory

OpenAIRE

Nicholson, Scott

1999-01-01

Because the World Wide Web is a dynamic collection of information, the Web search tools (or "search engines") that index the Web are dynamic. Traditional information retrieval evaluation techniques may not provide reliable results when applied to the Web search tools. This study is the result of ten replications of the classic 1996 Ding and Marchionini Web search tool research. It explores the effects that replication can have on transforming unreliable results from one iteration into replica...

User Oriented Trajectory Search for Trip Recommendation

KAUST Repository

Ding, Ruogu

2012-01-01

Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User

A Systematic Review of Techniques and Sources of Big Data in the Healthcare Sector.

Science.gov (United States)

Alonso, Susel Góngora; de la Torre Díez, Isabel; Rodrigues, Joel J P C; Hamrioui, Sofiane; López-Coronado, Miguel

2017-10-14

The main objective of this paper is to present a review of existing researches in the literature, referring to Big Data sources and techniques in health sector and to identify which of these techniques are the most used in the prediction of chronic diseases. Academic databases and systems such as IEEE Xplore, Scopus, PubMed and Science Direct were searched, considering the date of publication from 2006 until the present time. Several search criteria were established as 'techniques' OR 'sources' AND 'Big Data' AND 'medicine' OR 'health', 'techniques' AND 'Big Data' AND 'chronic diseases', etc. Selecting the paper considered of interest regarding the description of the techniques and sources of Big Data in healthcare. It found a total of 110 articles on techniques and sources of Big Data on health from which only 32 have been identified as relevant work. Many of the articles show the platforms of Big Data, sources, databases used and identify the techniques most used in the prediction of chronic diseases. From the review of the analyzed research articles, it can be noticed that the sources and techniques of Big Data used in the health sector represent a relevant factor in terms of effectiveness, since it allows the application of predictive analysis techniques in tasks such as: identification of patients at risk of reentry or prevention of hospital or chronic diseases infections, obtaining predictive models of quality.

A Cooperative Harmony Search Algorithm for Function Optimization

Directory of Open Access Journals (Sweden)

Gang Li

2014-01-01

Full Text Available Harmony search algorithm (HS is a new metaheuristic algorithm which is inspired by a process involving musical improvisation. HS is a stochastic optimization technique that is similar to genetic algorithms (GAs and particle swarm optimizers (PSOs. It has been widely applied in order to solve many complex optimization problems, including continuous and discrete problems, such as structure design, and function optimization. A cooperative harmony search algorithm (CHS is developed in this paper, with cooperative behavior being employed as a significant improvement to the performance of the original algorithm. Standard HS just uses one harmony memory and all the variables of the object function are improvised within the harmony memory, while the proposed algorithm CHS uses multiple harmony memories, so that each harmony memory can optimize different components of the solution vector. The CHS was then applied to function optimization problems. The results of the experiment show that CHS is capable of finding better solutions when compared to HS and a number of other algorithms, especially in high-dimensional problems.

New Capabilities in the Astrophysics Multispectral Archive Search Engine

Science.gov (United States)

Cheung, C. Y.; Kelley, S.; Roussopoulos, N.

The Astrophysics Multispectral Archive Search Engine (AMASE) uses object-oriented database techniques to provide a uniform multi-mission and multi-spectral interface to search for data in the distributed archives. We describe our experience of porting AMASE from Illustra object-relational DBMS to the Informix Universal Data Server. New capabilities and utilities have been developed, including a spatial datablade that supports Nearest Neighbor queries.

Search for a Supersymmetric Partner to the Top Quark using a Multivariate Analysis Technique.

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00337045

Supersymmetry (SUSY) is an extension to the Standard Model (SM) which introduces supersymmetric partners of the known fermions and bosons. Top squark (stop) searches are a natural extension of inclusive SUSY searches at the Large Hadron Collider (LHC). If SUSY solves the naturalness problem, the stop should be light enough to cancel the top loop contribution to the Higgs mass parameter. The 3rd generation squarks may be the first SUSY particles to be discovered at the LHC. The stop can decay into a variety of final states, depending, amongst other factors, on the hierarchy of the mass eigenstates formed from the linear superposition of the SUSY partners of the Higgs boson and electroweak gauge bosons. In this study the relevant mass eigenstates are the lightest chargino ($\\chi_{1}^{\\pm}$) and the neutralino ($\\chi_{1}^{0}$). A search is presented for a heavy SUSY top partner decaying to a lepton, neutrino and the lightest supersymmetric particle ($\\chi_{1}^{0}$), via a b-quark and a chargino ($\\chi_{1}^{\\p...

Analysis of Search Engines and Meta Search Engines\\\\\\' Position by University of Isfahan Users Based on Rogers\\\\\\' Diffusion of Innovation Theory

Directory of Open Access Journals (Sweden)

Maryam Akbari

2012-10-01

Full Text Available The present study investigated the analysis of search engines and meta search engines adoption process by University of Isfahan users during 2009-2010 based on the Rogers' diffusion of innovation theory. The main aim of the research was to study the rate of adoption and recognizing the potentials and effective tools in search engines and meta search engines adoption among University of Isfahan users. The research method was descriptive survey study. The cases of the study were all of the post graduate students of the University of Isfahan. 351 students were selected as the sample and categorized by a stratified random sampling method. Questionnaire was used for collecting data. The collected data was analyzed using SPSS 16 in both descriptive and analytic statistic. For descriptive statistic frequency, percentage and mean were used, while for analytic statistic t-test and Kruskal-Wallis non parametric test (H-test were used. The finding of t-test and Kruscal-Wallis indicated that the mean of search engines and meta search engines adoption did not show statistical differences gender, level of education and the faculty. Special search engines adoption process was different in terms of gender but not in terms of the level of education and the faculty. Other results of the research indicated that among general search engines, Google had the most adoption rate. In addition, among the special search engines, Google Scholar and among the meta search engines Mamma had the most adopting rate. Findings also showed that friends played an important role on how students adopted general search engines while professors had important role on how students adopted special search engines and meta search engines. Moreover, results showed that the place where students got the most acquaintance with search engines and meta search engines was in the university. The finding showed that the curve of adoption rate was not normal and it was not also in S-shape. Morover

Robust Circle Detection Using Harmony Search

Directory of Open Access Journals (Sweden)

Jaco Fourie

2017-01-01

Full Text Available Automatic circle detection is an important element of many image processing algorithms. Traditionally the Hough transform has been used to find circular objects in images but more modern approaches that make use of heuristic optimisation techniques have been developed. These are often used in large complex images where the presence of noise or limited computational resources make the Hough transform impractical. Previous research on the use of the Harmony Search (HS in circle detection showed that HS is an attractive alternative to many of the modern circle detectors based on heuristic optimisers like genetic algorithms and simulated annealing. We propose improvements to this work that enables our algorithm to robustly find multiple circles in larger data sets and still work on realistic images that are heavily corrupted by noisy edges.

Progress on stochastic background search codes for LIGO

International Nuclear Information System (INIS)

Whelan, John T; Anderson, Warren G; Casquette, Martha; Diaz, Mario C; Heng, Ik Siong; McHugh, Martin; Romano, Joseph D; Jr, Charlie W Torres; Trejo, Rosa M; Vecchio, Alberto

2002-01-01

One of the types of signals for which the LIGO interferometric gravitational wave detectors will search is a stochastic background of gravitational radiation. We review the technique of searching for a background using the optimally filtered cross-correlation statistic, and describe the state of plans to perform such cross-correlations between the two LIGO interferometers as well as between LIGO and other gravitational-wave detectors, in particular the preparation of software to perform such data analysis

News search, blogs and feeds a toolkit

CERN Document Server

Vage, Lars

2010-01-01

This book is about news search and monitoring. Aimed at professionals with a strategic need of monitoring the surrounding world, users with a need to find the best news sources, monitoring services and news search strategies and techniques will benefit from reading this book. The main purpose is to present a practical handbook with an analysis of readily available tools, blending with passages of a theoretical nature. It is also useful for students at LIS programmes and related information programmes and for librarians and information professionals. The authors aim to aid the reader in reachin

Search for narrow resonances in dijet final states at $\\sqrt{s}= $ 8 TeV with the novel CMS technique of data scouting

CERN Document Server

Khachatryan, Vardan; Tumasyan, Armen; Adam, Wolfgang; Aşılar, Ece; Bergauer, Thomas; Brandstetter, Johannes; Brondolin, Erica; Dragicevic, Marko; Erö, Janos; Flechl, Martin; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hartl, Christian; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; König, Axel; Krätschmer, Ilse; Liko, Dietrich; Matsushita, Takashi; Mikulec, Ivan; Rabady, Dinyar; Rad, Navid; Rahbaran, Babak; Rohringer, Herbert; Schieck, Jochen; Strauss, Josef; Treberer-Treberspurg, Wolfgang; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Alderweireldt, Sara; De Wolf, Eddi A; Janssen, Xavier; Knutsson, Albert; Lauwers, Jasper; Van De Klundert, Merijn; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Abu Zeid, Shimaa; Blekman, Freya; D'Hondt, Jorgen; Daci, Nadir; De Bruyn, Isabelle; Deroover, Kevin; Heracleous, Natalie; Lowette, Steven; Moortgat, Seth; Moreels, Lieselotte; Olbrechts, Annik; Python, Quentin; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Parijs, Isis; Brun, Hugues; Caillol, Cécile; Clerbaux, Barbara; De Lentdecker, Gilles; Delannoy, Hugo; Fasanella, Giuseppe; Favart, Laurent; Goldouzian, Reza; Grebenyuk, Anastasia; Karapostoli, Georgia; Lenzi, Thomas; Léonard, Alexandre; Luetic, Jelena; Maerschalk, Thierry; Marinov, Andrey; Randle-conde, Aidan; Seva, Tomislav; Vander Velde, Catherine; Vanlaer, Pascal; Yonamine, Ryo; Zenoni, Florian; Zhang, Fengwangdong; Cimmino, Anna; Cornelis, Tom; Dobur, Didar; Fagot, Alexis; Garcia, Guillaume; Gul, Muhammad; Mccartin, Joseph; Poyraz, Deniz; Salva Diblen, Sinem; Schöfbeck, Robert; Tytgat, Michael; Van Driessche, Ward; Yazgan, Efe; Zaganidis, Nicolas; Beluffi, Camille; Bondu, Olivier; Brochet, Sébastien; Bruno, Giacomo; Caudron, Adrien; Ceard, Ludivine; De Visscher, Simon; Delaere, Christophe; Delcourt, Martin; Forthomme, Laurent; Francois, Brieuc; Giammanco, Andrea; Jafari, Abideh; Jez, Pavel; Komm, Matthias; Lemaitre, Vincent; Magitteri, Alessio; Mertens, Alexandre; Musich, Marco; Nuttens, Claude; Piotrzkowski, Krzysztof; Quertenmont, Loic; Selvaggi, Michele; Vidal Marono, Miguel; Wertz, Sébastien; Beliy, Nikita; Aldá Júnior, Walter Luiz; Alves, Fábio Lúcio; Alves, Gilvan; Brito, Lucas; Correa Martins Junior, Marcos; Hensel, Carsten; Moraes, Arthur; Pol, Maria Elena; Rebello Teles, Patricia; Belchior Batista Das Chagas, Ewerton; Carvalho, Wagner; Chinellato, Jose; Custódio, Analu; Melo Da Costa, Eliza; Da Silveira, Gustavo Gil; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Huertas Guativa, Lina Milena; Malbouisson, Helena; Matos Figueiredo, Diego; Mora Herrera, Clemencia; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Sznajder, Andre; Tonelli Manganote, Edmilson José; Vilela Pereira, Antonio; Ahuja, Sudha; Bernardes, Cesar Augusto; Dogra, Sunil; Tomei, Thiago; De Moraes Gregores, Eduardo; Mercadante, Pedro G; Moon, Chang-Seong; Novaes, Sergio F; Padula, Sandra; Romero Abad, David; Ruiz Vargas, José Cupertino; Aleksandrov, Aleksandar; Hadjiiska, Roumyana; Iaydjiev, Plamen; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Vutova, Mariana; Dimitrov, Anton; Glushkov, Ivan; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Fang, Wenxing; Ahmad, Muhammad; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Chen, Mingshui; Chen, Ye; Cheng, Tongguang; Du, Ran; Jiang, Chun-Hua; Leggat, Duncan; Liu, Zhenan; Romeo, Francesco; Shaheen, Sarmad Masood; Spiezia, Aniello; Tao, Junquan; Wang, Chunjie; Wang, Zheng; Zhang, Huaqiao; Zhao, Jingzhou; Asawatangtrakuldee, Chayanit; Ban, Yong; Li, Qiang; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Wang, Dayong; Xu, Zijun; Avila, Carlos; Cabrera, Andrés; Chaparro Sierra, Luisa Fernanda; Florez, Carlos; Gomez, Juan Pablo; González Hernández, Carlos Felipe; Ruiz Alvarez, José David; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Puljak, Ivica; Ribeiro Cipriano, Pedro M; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Ferencek, Dinko; Kadija, Kreso; Micanovic, Sasa; Sudic, Lucija; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Rykaczewski, Hans; Finger, Miroslav; Finger Jr, Michael; Carrera Jarrin, Edgar; Elgammal, Sherif; Mohamed, Amr; Mohammed, Yasser; Salama, Elsayed; Calpas, Betty; Kadastik, Mario; Murumaa, Marion; Perrini, Lucia; Raidal, Martti; Tiko, Andres; Veelken, Christian; Eerola, Paula; Pekkanen, Juska; Voutilainen, Mikko; Härkönen, Jaakko; Karimäki, Veikko; Kinnunen, Ritva; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Peltola, Timo; Tuominiemi, Jorma; Tuovinen, Esa; Wendland, Lauri; Talvitie, Joonas; Tuuva, Tuure; Besancon, Marc; Couderc, Fabrice; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Favaro, Carlotta; Ferri, Federico; Ganjour, Serguei; Ghosh, Saranya; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Kucher, Inna; Locci, Elizabeth; Machet, Martina; Malcles, Julie; Rander, John; Rosowsky, André; Titov, Maksym; Zghiche, Amina; Abdulsalam, Abdulla; Antropov, Iurii; Baffioni, Stephanie; Beaudette, Florian; Busson, Philippe; Cadamuro, Luca; Chapon, Emilien; Charlot, Claude; Davignon, Olivier; Granier de Cassagnac, Raphael; Jo, Mihee; Lisniak, Stanislav; Miné, Philippe; Naranjo, Ivo Nicolas; Nguyen, Matthew; Ochando, Christophe; Ortona, Giacomo; Paganini, Pascal; Pigard, Philipp; Regnard, Simon; Salerno, Roberto; Sirois, Yves; Strebler, Thomas; Yilmaz, Yetkin; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Aubin, Alexandre; Bloch, Daniel; Brom, Jean-Marie; Buttignol, Michael; Chabert, Eric Christian; Chanon, Nicolas; Collard, Caroline; Conte, Eric; Coubez, Xavier; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Le Bihan, Anne-Catherine; Merlin, Jeremie Alexandre; Skovpen, Kirill; Van Hove, Pierre; Gadrat, Sébastien; Beauceron, Stephanie; Bernet, Colin; Boudoul, Gaelle; Bouvier, Elvire; Carrillo Montoya, Camilo Andres; Chierici, Roberto; Contardo, Didier; Courbon, Benoit; Depasse, Pierre; El Mamouni, Houmani; Fan, Jiawei; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Grenier, Gérald; Ille, Bernard; Lagarde, Francois; Laktineh, Imad Baptiste; Lethuillier, Morgan; Mirabito, Laurent; Pequegnot, Anne-Laure; Perries, Stephane; Popov, Andrey; Sabes, David; Sordini, Viola; Vander Donckt, Muriel; Verdier, Patrice; Viret, Sébastien; Toriashvili, Tengizi; Lomidze, David; Autermann, Christian; Beranek, Sarah; Feld, Lutz; Heister, Arno; Kiesel, Maximilian Knut; Klein, Katja; Lipinski, Martin; Ostapchuk, Andrey; Preuten, Marius; Raupach, Frank; Schael, Stefan; Schomakers, Christian; Schulte, Jan-Frederik; Schulz, Johannes; Verlage, Tobias; Weber, Hendrik; Zhukov, Valery; Brodski, Michael; Dietz-Laursonn, Erik; Duchardt, Deborah; Endres, Matthias; Erdmann, Martin; Erdweg, Sören; Esch, Thomas; Fischer, Robert; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Knutzen, Simon; Merschmeyer, Markus; Meyer, Arnd; Millet, Philipp; Mukherjee, Swagata; Olschewski, Mark; Padeken, Klaas; Papacz, Paul; Pook, Tobias; Radziej, Markus; Reithler, Hans; Rieger, Marcel; Scheuch, Florian; Sonnenschein, Lars; Teyssier, Daniel; Thüer, Sebastian; Cherepanov, Vladimir; Erdogan, Yusuf; Flügge, Günter; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Künsken, Andreas; Lingemann, Joschka; Nehrkorn, Alexander; Nowack, Andreas; Nugent, Ian Michael; Pistone, Claudia; Pooth, Oliver; Stahl, Achim; Aldaya Martin, Maria; Asin, Ivan; Beernaert, Kelly; Behnke, Olaf; Behrens, Ulf; Bin Anuar, Afiq Aizuddin; Borras, Kerstin; Campbell, Alan; Connor, Patrick; Contreras-Campana, Christian; Costanza, Francesco; Diez Pardos, Carmen; Dolinska, Ganna; Eckerlin, Guenter; Eckstein, Doris; Eichhorn, Thomas; Gallo, Elisabetta; Garay Garcia, Jasone; Geiser, Achim; Gizhko, Andrii; Grados Luyando, Juan Manuel; Gunnellini, Paolo; Harb, Ali; Hauk, Johannes; Hempel, Maria; Jung, Hannes; Kalogeropoulos, Alexis; Karacheban, Olena; Kasemann, Matthias; Keaveney, James; Kieseler, Jan; Kleinwort, Claus; Korol, Ievgen; Lange, Wolfgang; Lelek, Aleksandra; Leonard, Jessica; Lipka, Katerina; Lobanov, Artur; Lohmann, Wolfgang; Mankel, Rainer; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mittag, Gregor; Mnich, Joachim; Mussgiller, Andreas; Ntomari, Eleni; Pitzl, Daniel; Placakyte, Ringaile; Raspereza, Alexei; Roland, Benoit; Sahin, Mehmet Özgür; Saxena, Pooja; Schoerner-Sadenius, Thomas; Seitz, Claudia; Spannagel, Simon; Stefaniuk, Nazar; Trippkewitz, Karim Damun; Van Onsem, Gerrit Patrick; Walsh, Roberval; Wissing, Christoph; Blobel, Volker; Centis Vignali, Matteo; Draeger, Arne-Rasmus; Dreyer, Torben; Erfle, Joachim; Garutti, Erika; Goebel, Kristin; Gonzalez, Daniel; Görner, Martin; Haller, Johannes; Hoffmann, Malte; Höing, Rebekka Sophie; Junkes, Alexandra; Klanner, Robert; Kogler, Roman; Kovalchuk, Nataliia; Lapsien, Tobias; Lenz, Teresa; Marchesini, Ivan; Marconi, Daniele; Meyer, Mareike; Niedziela, Marek; Nowatschin, Dominik; Ott, Jochen; Pantaleo, Felice; Peiffer, Thomas; Perieanu, Adrian; Pietsch, Niklas; Poehlsen, Jennifer; Sander, Christian; Scharf, Christian; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Schumann, Svenja; Schwandt, Joern; Stadie, Hartmut; Steinbrück, Georg; Stober, Fred-Markus Helmut; Stöver, Marc; Tholen, Heiner; Troendle, Daniel; Usai, Emanuele; Vanelderen, Lukas; Vanhoefer, Annika; Vormwald, Benedikt; Barth, Christian; Baus, Colin; Berger, Joram; Butz, Erik; Chwalek, Thorsten; Colombo, Fabio; De Boer, Wim; Dierlamm, Alexander; Fink, Simon; Friese, Raphael; Giffels, Manuel; Gilbert, Andrew; Haitz, Dominik; Hartmann, Frank; Heindl, Stefan Michael; Husemann, Ulrich; Katkov, Igor; Kornmayer, Andreas; Lobelle Pardo, Patricia; Maier, Benedikt; Mildner, Hannes; Mozer, Matthias Ulrich; Müller, Thomas; Müller, Thomas; Plagge, Michael; Quast, Gunter; Rabbertz, Klaus; Röcker, Steffen; Roscher, Frank; Schröder, Matthias; Sieber, Georg; Simonis, Hans-Jürgen; Ulrich, Ralf; Wagner-Kuhr, Jeannine; Wayand, Stefan; Weber, Marc; Weiler, Thomas; Williamson, Shawn; Wöhrmann, Clemens; Wolf, Roger; Anagnostou, Georgios; Daskalakis, Georgios; Geralis, Theodoros; Giakoumopoulou, Viktoria Athina; Kyriakis, Aristotelis; Loukas, Demetrios; Topsis-Giotis, Iasonas; Agapitos, Antonis; Kesisoglou, Stilianos; Panagiotou, Apostolos; Saoulidou, Niki; Tziaferi, Eirini; Evangelou, Ioannis; Flouris, Giannis; Foudas, Costas; Kokkas, Panagiotis; Loukas, Nikitas; Manthos, Nikolaos; Papadopoulos, Ioannis; Paradas, Evangelos; Filipovic, Nicolas; Bencze, Gyorgy; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Zsigmond, Anna Julia; Beni, Noemi; Czellar, Sandor; Karancsi, János; Molnar, Jozsef; Szillasi, Zoltan; Bartók, Márton; Makovec, Alajos; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Bahinipati, Seema; Choudhury, Somnath; Mal, Prolay; Mandal, Koushik; Nayak, Aruna; Sahoo, Deepak Kumar; Sahoo, Niladribihari; Swain, Sanjay Kumar; Bansal, Sunil; Beri, Suman Bala; Bhatnagar, Vipin; Chawla, Ridhi; Gupta, Ruchi; Bhawandeep, Bhawandeep; Kalsi, Amandeep Kaur; Kaur, Anterpreet; Kaur, Manjit; Kumar, Ramandeep; Mehta, Ankita; Mittal, Monika; Singh, Jasbir; Walia, Genius; Kumar, Ashok; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Garg, Rocky Bala; Keshri, Sumit; Kumar, Ajay; Malhotra, Shivali; Naimuddin, Md; Nishu, Nishu; Ranjan, Kirti; Sharma, Ramkrishna; Sharma, Varun; Bhattacharya, Rajarshi; Bhattacharya, Satyaki; Chatterjee, Kalyanmoy; Dey, Sourav; Dutt, Suneel; Dutta, Suchandra; Ghosh, Shamik; Majumdar, Nayana; Modak, Atanu; Mondal, Kuntal; Mukhopadhyay, Supratik; Nandan, Saswati; Purohit, Arnab; Roy, Ashim; Roy, Debarati; Roy Chowdhury, Suvankar; Sarkar, Subir; Sharan, Manoj; Thakur, Shalini; Behera, Prafulla Kumar; Chudasama, Ruchi; Dutta, Dipanwita; Jha, Vishwajeet; Kumar, Vineet; Mohanty, Ajit Kumar; Netrakanti, Pawan Kumar; Pant, Lalit Mohan; Shukla, Prashant; Topkar, Anita; Aziz, Tariq; Dugad, Shashikant; Kole, Gouranga; Mahakud, Bibhuprasad; Mitra, Soureek; Mohanty, Gagan Bihari; Sur, Nairit; Sutar, Bajrang; Banerjee, Sudeshna; Bhowmik, Sandeep; Dewanjee, Ram Krishna; Ganguly, Sanmay; Guchait, Monoranjan; Jain, Sandhya; Kumar, Sanjeev; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Parida, Bibhuti; Sarkar, Tanmay; Wickramage, Nadeesha; Chauhan, Shubhanshu; Dube, Sourabh; Kapoor, Anshul; Kothekar, Kunal; Rane, Aditee; Sharma, Seema; Bakhshiansohi, Hamed; Behnamian, Hadi; Chenarani, Shirin; Eskandari Tadavani, Esmaeel; Etesami, Seyed Mohsen; Fahim, Ali; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Naseri, Mohsen; Paktinat Mehdiabadi, Saeid; Rezaei Hosseinabadi, Ferdos; Safarzadeh, Batool; Zeinali, Maryam; Felcini, Marta; Grunewald, Martin; Abbrescia, Marcello; Calabria, Cesare; Caputo, Claudio; Colaleo, Anna; Creanza, Donato; Cristella, Leonardo; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Maggi, Giorgio; Maggi, Marcello; Miniello, Giorgia; My, Salvatore; Nuzzo, Salvatore; Pompili, Alexis; Pugliese, Gabriella; Radogna, Raffaella; Ranieri, Antonio; Selvaggi, Giovanna; Silvestris, Lucia; Venditti, Rosamaria; Abbiendi, Giovanni; Battilana, Carlo; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Campanini, Renato; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Chhibra, Simranjit Singh; Codispoti, Giuseppe; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Montanari, Alessandro; Navarria, Francesco; Perrotta, Andrea; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Tosi, Nicolò; Albergo, Sebastiano; Chiorboli, Massimiliano; Costa, Salvatore; Di Mattia, Alessandro; Giordano, Ferdinando; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Gori, Valentina; Lenzi, Piergiulio; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Viliani, Lorenzo; Benussi, Luigi; Bianco, Stefano; Fabbri, Franco; Piccolo, Davide; Primavera, Federica; Calvelli, Valerio; Ferro, Fabrizio; Lo Vetere, Maurizio; Monge, Maria Roberta; Robutti, Enrico; Tosi, Silvano; Brianza, Luca; Dinardo, Mauro Emanuele; Fiorendi, Sara; Gennai, Simone; Ghezzi, Alessio; Govoni, Pietro; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Marzocchi, Badder; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Pigazzini, Simone; Ragazzi, Stefano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Cavallo, Nicola; De Nardo, Guglielmo; Di Guida, Salvatore; Esposito, Marco; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lanza, Giuseppe; Lista, Luca; Meola, Sabino; Merola, Mario; Paolucci, Pierluigi; Sciacca, Crisostomo; Thyssen, Filip; Azzi, Patrizia; Bacchetta, Nicola; Benato, Lisa; Bisello, Dario; Boletti, Alessio; Carlin, Roberto; Carvalho Antunes De Oliveira, Alexandra; Checchia, Paolo; Dall'Osso, Martino; De Castro Manzano, Pablo; Dorigo, Tommaso; Dosselli, Umberto; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Lacaprara, Stefano; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Zanetti, Marco; Zotto, Pierluigi; Zucchetta, Alberto; Zumerle, Gianni; Braghieri, Alessandro; Magnani, Alice; Montagna, Paolo; Ratti, Sergio P; Re, Valerio; Riccardi, Cristina; Salvini, Paola; Vai, Ilaria; Vitulo, Paolo; Alunni Solestizi, Luisa; Bilei, Gian Mario; Ciangottini, Diego; Fanò, Livio; Lariccia, Paolo; Leonardi, Roberto; Mantovani, Giancarlo; Menichelli, Mauro; Saha, Anirban; Santocchia, Attilio; Androsov, Konstantin; Azzurri, Paolo; Bagliesi, Giuseppe; Bernardini, Jacopo; Boccali, Tommaso; Castaldi, Rino; Ciocci, Maria Agnese; Dell'Orso, Roberto; Donato, Silvio; Fedi, Giacomo; Giassi, Alessandro; Grippo, Maria Teresa; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Palla, Fabrizio; Rizzi, Andrea; Savoy-Navarro, Aurore; Spagnolo, Paolo; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Barone, Luciano; Cavallari, Francesca; Cipriani, Marco; D'imperio, Giulia; Del Re, Daniele; Diemoz, Marcella; Gelli, Simone; Jorda, Clara; Longo, Egidio; Margaroli, Fabrizio; Meridiani, Paolo; Organtini, Giovanni; Paramatti, Riccardo; Preiato, Federico; Rahatlou, Shahram; Rovelli, Chiara; Santanastasio, Francesco; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Bartosik, Nazar; Bellan, Riccardo; Biino, Cristina; Cartiglia, Nicolo; Costa, Marco; Covarelli, Roberto; Degano, Alessandro; Demaria, Natale; Finco, Linda; Kiani, Bilal; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Monteil, Ennio; Obertino, Maria Margherita; Pacher, Luca; Pastrone, Nadia; Pelliccioni, Mario; Pinna Angioni, Gian Luca; Ravera, Fabio; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Shchelina, Ksenia; Sola, Valentina; Solano, Ada; Staiano, Amedeo; Traczyk, Piotr; Belforte, Stefano; Candelise, Vieri; Casarsa, Massimo; Cossutti, Fabio; Della Ricca, Giuseppe; La Licata, Chiara; Schizzi, Andrea; Zanetti, Anna; Kim, Dong Hee; Kim, Gui Nyun; Kim, Min Suk; Lee, Sangeun; Lee, Seh Wook; Oh, Young Do; Sekmen, Sezen; Son, Dong-Chul; Yang, Yu Chul; Kim, Hyunsoo; Lee, Ari; Brochero Cifuentes, Javier Andres; Kim, Tae Jeong; Cho, Sungwoong; Choi, Suyong; Go, Yeonju; Gyun, Dooyeon; Ha, Seungkyu; Hong, Byung-Sik; Jo, Youngkwon; Kim, Yongsun; Lee, Byounghoon; Lee, Kisoo; Lee, Kyong Sei; Lee, Songkyo; Lim, Jaehoon; Park, Sung Keun; Roh, Youn; Almond, John; Kim, Junho; Oh, Sung Bin; Seo, Seon-hee; Yang, Unki; Yoo, Hwi Dong; Yu, Geum Bong; Choi, Minkyoo; Kim, Hyunchul; Kim, Hyunyong; Kim, Ji Hyun; Lee, Jason Sang Hun; Park, Inkyu; Ryu, Geonmo; Ryu, Min Sang; Choi, Young-Il; Goh, Junghwan; Kim, Donghyun; Kwon, Eunhyang; Lee, Jongseok; Yu, Intae; Dudenas, Vytautas; Juodagalvis, Andrius; Vaitkus, Juozas; Ahmed, Ijaz; Ibrahim, Zainol Abidin; Komaragiri, Jyothsna Rani; Md Ali, Mohd Adli Bin; Mohamad Idris, Faridah; Wan Abdullah, Wan Ahmad Tajuddin; Yusli, Mohd Nizam; Zolkapli, Zukhaimira; Casimiro Linares, Edgar; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-De La Cruz, Ivan; Hernandez-Almada, Alberto; Lopez-Fernandez, Ricardo; Mejia Guisao, Jhovanny; Sánchez Hernández, Alberto; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Pedraza, Isabel; Salazar Ibarguen, Humberto Antonio; Uribe Estrada, Cecilia; Morelos Pineda, Antonio; Krofcheck, David; Butler, Philip H; Ahmad, Ashfaq; Ahmad, Muhammad; Hassan, Qamar; Hoorani, Hafeez R; Khan, Wajid Ali; Qazi, Shamona; Shoaib, Muhammad; Waqas, Muhammad; Bialkowska, Helena; Bluj, Michal; Boimska, Bożena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Zalewski, Piotr; Bunkowski, Karol; Byszuk, Adrian; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Olszewski, Michal; Walczak, Marek; Bargassa, Pedrame; Beirão Da Cruz E Silva, Cristóvão; Di Francesco, Agostino; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Hollar, Jonathan; Leonardo, Nuno; Lloret Iglesias, Lara; Nemallapudi, Mythra Varun; Rodrigues Antunes, Joao; Seixas, Joao; Toldaiev, Oleksii; Vadruccio, Daniele; Varela, Joao; Vischia, Pietro; Bunin, Pavel; Gavrilenko, Mikhail; Golutvin, Igor; Gorbounov, Nikolai; Gorbunov, Ilya; Karjavin, Vladimir; Kozlov, Guennady; Lanev, Alexander; Malakhov, Alexander; Matveev, Viktor; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Savina, Maria; Shmatov, Sergey; Shulha, Siarhei; Skatchkov, Nikolai; Smirnov, Vitaly; Zarubin, Anatoli; Chtchipounov, Leonid; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Kuznetsova, Ekaterina; Murzin, Victor; Oreshkin, Vadim; Sulimov, Valentin; Vorobyev, Alexey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Karneyeu, Anton; Kirsanov, Mikhail; Krasnikov, Nikolai; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Gavrilov, Vladimir; Lychkovskaya, Natalia; Popov, Vladimir; Pozdnyakov, Ivan; Safronov, Grigory; Spiridonov, Alexander; Toms, Maria; Vlasov, Evgueni; Zhokin, Alexander; Chadeeva, Marina; Danilov, Mikhail; Zhemchugov, Evgenii; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Rusakov, Sergey V; Terkulov, Adel; Baskakov, Alexey; Belyaev, Andrey; Boos, Edouard; Dubinin, Mikhail; Dudko, Lev; Ershov, Alexander; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Miagkov, Igor; Obraztsov, Stepan; Petrushanko, Sergey; Savrin, Viktor; Snigirev, Alexander; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Elumakhov, Dmitry; Kachanov, Vassili; Kalinin, Alexey; Konstantinov, Dmitri; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Cirkovic, Predrag; Devetak, Damir; Milosevic, Jovan; Rekovic, Vladimir; Alcaraz Maestre, Juan; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Escalante Del Valle, Alberto; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Navarro De Martino, Eduardo; Pérez-Calero Yzquierdo, Antonio María; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Senghi Soares, Mara; de Trocóniz, Jorge F; Missiroli, Marino; Moran, Dermot; Cuevas, Javier; Fernandez Menendez, Javier; Gonzalez Caballero, Isidro; Palencia Cortezon, Enrique; Sanchez Cruz, Sergio; Vizan Garcia, Jesus Manuel; Cabrillo, Iban Jose; Calderon, Alicia; Castiñeiras De Saa, Juan Ramon; Curras, Esteban; Fernandez, Marcos; Garcia-Ferrero, Juan; Gomez, Gervasio; Lopez Virto, Amparo; Marco, Jesus; Martinez Rivero, Celso; Matorras, Francisco; Piedra Gomez, Jonatan; Rodrigo, Teresa; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Trevisani, Nicolò; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Bachtis, Michail; Baillon, Paul; Ball, Austin; Barney, David; Bloch, Philippe; Bocci, Andrea; Bonato, Alessio; Botta, Cristina; Camporesi, Tiziano; Castello, Roberto; Cepeda, Maria; Cerminara, Gianluca; D'Alfonso, Mariarosaria; D'Enterria, David; Dabrowski, Anne; Daponte, Vincenzo; David Tinoco Mendes, Andre; De Gruttola, Michele; De Guio, Federico; De Roeck, Albert; Di Marco, Emanuele; Dobson, Marc; Dordevic, Milos; Dorney, Brian; Du Pree, Tristan; Duggan, Daniel; Dünser, Marc; Dupont, Niels; Elliott-Peisert, Anna; Fartoukh, Stephane; Franzoni, Giovanni; Fulcher, Jonathan; Funk, Wolfgang; Gigi, Dominique; Gill, Karl; Girone, Maria; Glege, Frank; Gundacker, Stefan; Guthoff, Moritz; Hammer, Josef; Harris, Philip; Hegeman, Jeroen; Innocente, Vincenzo; Janot, Patrick; Kirschenmann, Henning; Knünz, Valentin; Kortelainen, Matti J; Kousouris, Konstantinos; Krammer, Manfred; Lecoq, Paul; Lourenco, Carlos; Lucchini, Marco Toliman; Magini, Nicolo; Malgeri, Luca; Mannelli, Marcello; Martelli, Arabella; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moortgat, Filip; Morovic, Srecko; Mulders, Martijn; Neugebauer, Hannes; Orfanelli, Styliani; Orsini, Luciano; Pape, Luc; Perez, Emmanuelle; Peruzzi, Marco; Petrilli, Achille; Petrucciani, Giovanni; Pfeiffer, Andreas; Pierini, Maurizio; Racz, Attila; Reis, Thomas; Rolandi, Gigi; Rovere, Marco; Ruan, Manqi; Sakulin, Hannes; Sauvan, Jean-Baptiste; Schäfer, Christoph; Schwick, Christoph; Seidel, Markus; Sharma, Archana; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Steggemann, Jan; Stoye, Markus; Takahashi, Yuta; Treille, Daniel; Triossi, Andrea; Tsirou, Andromachi; Veckalns, Viesturs; Veres, Gabor Istvan; Wardle, Nicholas; Zagoździńska, Agnieszka; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; Kotlinski, Danek; Langenegger, Urs; Rohe, Tilman; Bachmair, Felix; Bäni, Lukas; Bianchini, Lorenzo; Casal, Bruno; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Eller, Philipp; Grab, Christoph; Heidegger, Constantin; Hits, Dmitry; Hoss, Jan; Kasieczka, Gregor; Lecomte, Pierre; Lustermann, Werner; Mangano, Boris; Marionneau, Matthieu; Martinez Ruiz del Arbol, Pablo; Masciovecchio, Mario; Meinhard, Maren Tabea; Meister, Daniel; Micheli, Francesco; Musella, Pasquale; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pata, Joosep; Pauss, Felicitas; Perrin, Gaël; Perrozzi, Luca; Quittnat, Milena; Rossini, Marco; Schönenberger, Myriam; Starodumov, Andrei; Takahashi, Maiko; Tavolaro, Vittorio Raoul; Theofilatos, Konstantinos; Wallny, Rainer; Aarrestad, Thea Klaeboe; Amsler, Claude; Caminada, Lea; Canelli, Maria Florencia; Chiochia, Vincenzo; De Cosa, Annapaola; Galloni, Camilla; Hinzmann, Andreas; Hreus, Tomas; Kilminster, Benjamin; Lange, Clemens; Ngadiuba, Jennifer; Pinna, Deborah; Rauco, Giorgia; Robmann, Peter; Salerno, Daniel; Yang, Yong; Doan, Thi Hien; Jain, Shilpi; Khurana, Raman; Konyushikhin, Maxim; Kuo, Chia-Ming; Lin, Willis; Lu, Yun-Ju; Pozdnyakov, Andrey; Yu, Shin-Shan; Kumar, Arun; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Chen, Po-Hsun; Dietz, Charles; Fiori, Francesco; Hou, George Wei-Shu; Hsiung, Yee; Liu, Yueh-Feng; Lu, Rong-Shyang; Miñano Moya, Mercedes; Paganis, Efstathios; Psallidas, Andreas; Tsai, Jui-fa; Tzeng, Yeng-Ming; Asavapibhop, Burin; Singh, Gurpreet; Srimanobhas, Norraphat; Suwonjandee, Narumon; Adiguzel, Aytul; Cerci, Salim; Damarseckin, Serdal; Demiroglu, Zuhal Seyma; Dozen, Candan; Dumanoglu, Isa; Girgis, Semiray; Gokbulut, Gul; Guler, Yalcin; Gurpinar, Emine; Hos, Ilknur; Kangal, Evrim Ersin; Onengut, Gulsen; Ozdemir, Kadri; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Zorbilmez, Caglar; Bilin, Bugra; Bilmis, Selcuk; Isildak, Bora; Karapinar, Guler; Yalvac, Metin; Zeyrek, Mehmet; Gülmez, Erhan; Kaya, Mithat; Kaya, Ozlem; Yetkin, Elif Asli; Yetkin, Taylan; Cakir, Altan; Cankocak, Kerem; Sen, Sercan; Vardarlı, Fuat Ilkehan; Grynyov, Boris; Levchuk, Leonid; Sorokin, Pavel; Aggleton, Robin; Ball, Fionn; Beck, Lana; Brooke, James John; Burns, Douglas; Clement, Emyr; Cussans, David; Flacher, Henning; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Jacob, Jeson; Kreczko, Lukasz; Lucas, Chris; Meng, Zhaoxia; Newbold, Dave M; Paramesvaran, Sudarshan; Poll, Anthony; Sakuma, Tai; Seif El Nasr-storey, Sarah; Senkin, Sergey; Smith, Dominic; Smith, Vincent J; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Calligaris, Luigi; Cieri, Davide; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Olaiya, Emmanuel; Petyt, David; Shepherd-Themistocleous, Claire; Thea, Alessandro; Tomalin, Ian R; Williams, Thomas; Baber, Mark; Bainbridge, Robert; Buchmuller, Oliver; Bundock, Aaron; Burton, Darren; Casasso, Stefano; Citron, Matthew; Colling, David; Corpe, Louie; Dauncey, Paul; Davies, Gavin; De Wit, Adinda; Della Negra, Michel; Dunne, Patrick; Elwood, Adam; Futyan, David; Haddad, Yacine; Hall, Geoffrey; Iles, Gregory; Lane, Rebecca; Laner, Christian; Lucas, Robyn; Lyons, Louis; Magnan, Anne-Marie; Malik, Sarah; Mastrolorenzo, Luca; Nash, Jordan; Nikitenko, Alexander; Pela, Joao; Penning, Bjoern; Pesaresi, Mark; Raymond, David Mark; Richards, Alexander; Rose, Andrew; Seez, Christopher; Tapper, Alexander; Uchida, Kirika; Vazquez Acosta, Monica; Virdee, Tejinder; Zenz, Seth Conrad; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leslie, Dawn; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Borzou, Ahmad; Call, Kenneth; Dittmann, Jay; Hatakeyama, Kenichi; Liu, Hongxuan; Pastika, Nathaniel; Charaf, Otman; Cooper, Seth; Henderson, Conor; Rumerio, Paolo; Arcaro, Daniel; Avetisyan, Aram; Bose, Tulika; Gastler, Daniel; Rankin, Dylan; Richardson, Clint; Rohlf, James; Sulak, Lawrence; Zou, David; Benelli, Gabriele; Berry, Edmund; Cutts, David; Ferapontov, Alexey; Garabedian, Alex; Hakala, John; Heintz, Ulrich; Jesus, Orduna; Laird, Edward; Landsberg, Greg; Mao, Zaixing; Narain, Meenakshi; Piperov, Stefan; Sagir, Sinan; Spencer, Eric; Syarif, Rizki; Breedon, Richard; Breto, Guillermo; Burns, Dustin; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Erbacher, Robin; Flores, Chad; Funk, Garrett; Gardner, Michael; Ko, Winston; Lander, Richard; Mclean, Christine; Mulhearn, Michael; Pellett, Dave; Pilot, Justin; Ricci-Tam, Francesca; Shalhout, Shalhout; Smith, John; Squires, Michael; Stolp, Dustin; Tripathi, Mani; Wilbur, Scott; Yohay, Rachel; Cousins, Robert; Everaerts, Pieter; Florent, Alice; Hauser, Jay; Ignatenko, Mikhail; Saltzberg, David; Takasugi, Eric; Valuev, Vyacheslav; Weber, Matthias; Burt, Kira; Clare, Robert; Ellison, John Anthony; Gary, J William; Hanson, Gail; Heilman, Jesse; Jandir, Pawandeep; Kennedy, Elizabeth; Lacroix, Florent; Long, Owen Rosser; Malberti, Martina; Olmedo Negrete, Manuel; Paneva, Mirena Ivova; Shrinivas, Amithabh; Wei, Hua; Wimpenny, Stephen; Yates, Brent; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; D'Agnolo, Raffaele Tito; Derdzinski, Mark; Gerosa, Raffaele; Holzner, André; Kelley, Ryan; Klein, Daniel; Letts, James; Macneill, Ian; Olivito, Dominick; Padhi, Sanjay; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Tadel, Matevz; Vartak, Adish; Wasserbaech, Steven; Welke, Charles; Wood, John; Würthwein, Frank; Yagil, Avraham; Zevi Della Porta, Giovanni; Bhandari, Rohan; Bradmiller-Feld, John; Campagnari, Claudio; Dishaw, Adam; Dutta, Valentina; Flowers, Kristen; Franco Sevilla, Manuel; Geffert, Paul; George, Christopher; Golf, Frank; Gouskos, Loukas; Gran, Jason; Heller, Ryan; Incandela, Joe; Mccoll, Nickolas; Mullin, Sam Daniel; Ovcharova, Ana; Richman, Jeffrey; Stuart, David; Suarez, Indara; West, Christopher; Yoo, Jaehyeok; Anderson, Dustin; Apresyan, Artur; Bendavid, Joshua; Bornheim, Adolf; Bunn, Julian; Chen, Yi; Duarte, Javier; Mott, Alexander; Newman, Harvey B; Pena, Cristian; Spiropulu, Maria; Vlimant, Jean-Roch; Xie, Si; Zhu, Ren-Yuan; Andrews, Michael Benjamin; Azzolini, Virginia; Calamba, Aristotle; Carlson, Benjamin; Ferguson, Thomas; Paulini, Manfred; Russ, James; Sun, Menglei; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Ford, William T; Jensen, Frank; Johnson, Andrew; Krohn, Michael; Mulholland, Troy; Stenson, Kevin; Wagner, Stephen Robert; Alexander, James; Chaves, Jorge; Chu, Jennifer; Dittmer, Susan; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Rinkevicius, Aurelijus; Ryd, Anders; Skinnari, Louise; Sun, Werner; Tan, Shao Min; Tao, Zhengcheng; Thom, Julia; Tucker, Jordan; Wittich, Peter; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Apollinari, Giorgio; Banerjee, Sunanda; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bolla, Gino; Burkett, Kevin; Butler, Joel Nathan; Cheung, Harry; Chlebana, Frank; Cihangir, Selcuk; Cremonesi, Matteo; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gottschalk, Erik; Gray, Lindsey; Green, Dan; Grünendahl, Stefan; Gutsche, Oliver; Hare, Daryl; Harris, Robert M; Hasegawa, Satoshi; Hirschauer, James; Hu, Zhen; Jayatilaka, Bodhitha; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kreis, Benjamin; Lammel, Stephan; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Liu, Tiehui; Lopes De Sá, Rafael; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Maruyama, Sho; Mason, David; McBride, Patricia; Merkel, Petra; Mrenna, Stephen; Nahn, Steve; Newman-Holmes, Catherine; O'Dell, Vivian; Pedro, Kevin; Prokofyev, Oleg; Rakness, Gregory; Ristori, Luciano; Sexton-Kennedy, Elizabeth; Soha, Aron; Spalding, William J; Spiegel, Leonard; Stoynev, Stoyan; Strobbe, Nadja; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vernieri, Caterina; Verzocchi, Marco; Vidal, Richard; Wang, Michael; Weber, Hannsjoerg Artur; Whitbeck, Andrew; Acosta, Darin; Avery, Paul; Bortignon, Pierluigi; Bourilkov, Dimitri; Brinkerhoff, Andrew; Carnes, Andrew; Carver, Matthew; Curry, David; Das, Souvik; Field, Richard D; Furic, Ivan-Kresimir; Konigsberg, Jacobo; Korytov, Andrey; Ma, Peisen; Matchev, Konstantin; Mei, Hualin; Milenovic, Predrag; Mitselmakher, Guenakh; Rank, Douglas; Shchutska, Lesya; Sperka, David; Thomas, Laurent; Wang, Jian; Wang, Sean-Jiun; Yelton, John; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Ackert, Andrew; Adams, Jordon Rowe; Adams, Todd; Askew, Andrew; Bein, Samuel; Diamond, Brendan; Hagopian, Sharon; Hagopian, Vasken; Johnson, Kurtis F; Khatiwada, Ajeeta; Prosper, Harrison; Santra, Arka; Weinberg, Marc; Baarmand, Marc M; Bhopatkar, Vallary; Colafranceschi, Stefano; Hohlmann, Marcus; Kalakhety, Himali; Noonan, Daniel; Roy, Titas; Yumiceva, Francisco; Adams, Mark Raymond; Apanasevich, Leonard; Berry, Douglas; Betts, Russell Richard; Bucinskaite, Inga; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Kurt, Pelin; O'Brien, Christine; Sandoval Gonzalez, Irving Daniel; Turner, Paul; Varelas, Nikos; Wu, Zhenbin; Zakaria, Mohammed; Zhang, Jingyu; Bilki, Burak; Clarida, Warren; Dilsiz, Kamuran; Durgut, Süleyman; Gandrajula, Reddy Pratap; Haytmyradov, Maksat; Khristenko, Viktor; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Ogul, Hasan; Onel, Yasar; Ozok, Ferhat; Penzo, Aldo; Snyder, Christina; Tiras, Emrah; Wetzel, James; Yi, Kai; Anderson, Ian; Blumenfeld, Barry; Cocoros, Alice; Eminizer, Nicholas; Fehling, David; Feng, Lei; Gritsan, Andrei; Maksimovic, Petar; Osherson, Marc; Roskes, Jeffrey; Sarica, Ulascan; Swartz, Morris; Xiao, Meng; Xin, Yongjie; You, Can; Al-bataineh, Ayman; Baringer, Philip; Bean, Alice; Bowen, James; Bruner, Christopher; Castle, James; Kenny III, Raymond Patrick; Kropivnitskaya, Anna; Majumder, Devdatta; Mcbrayer, William; Murray, Michael; Sanders, Stephen; Stringer, Robert; Tapia Takaki, Daniel; Wang, Quan; Ivanov, Andrew; Kaadze, Ketino; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Mohammadi, Abdollah; Saini, Lovedeep Kaur; Skhirtladze, Nikoloz; Toda, Sachiko; Lange, David; Rebassoo, Finn; Wright, Douglas; Anelli, Christopher; Baden, Drew; Baron, Owen; Belloni, Alberto; Calvert, Brian; Eno, Sarah Catherine; Ferraioli, Charles; Gomez, Jaime; Hadley, Nicholas John; Jabeen, Shabnam; Kellogg, Richard G; Kolberg, Ted; Kunkle, Joshua; Lu, Ying; Mignerey, Alice; Shin, Young Ho; Skuja, Andris; Tonjes, Marguerite; Tonwar, Suresh C; Apyan, Aram; Barbieri, Richard; Baty, Austin; Bi, Ran; Bierwagen, Katharina; Brandt, Stephanie; Busza, Wit; Cali, Ivan Amos; Demiragli, Zeynep; Di Matteo, Leonardo; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Gulhan, Doga; Hsu, Dylan; Iiyama, Yutaro; Innocenti, Gian Michele; Klute, Markus; Kovalskyi, Dmytro; Krajczar, Krisztian; Lai, Yue Shi; Lee, Yen-Jie; Levin, Andrew; Luckey, Paul David; Marini, Andrea Carlo; Mcginn, Christopher; Mironov, Camelia; Narayanan, Siddharth; Niu, Xinmei; Paus, Christoph; Roland, Christof; Roland, Gunther; Salfeld-Nebgen, Jakob; Stephans, George; Sumorok, Konstanty; Tatar, Kaya; Varma, Mukund; Velicanu, Dragos; Veverka, Jan; Wang, Jing; Wang, Ta-Wei; Wyslouch, Bolek; Yang, Mingming; Zhukova, Victoria; Benvenuti, Alberto; Chatterjee, Rajdeep Mohan; Dahmes, Bryan; Evans, Andrew; Finkel, Alexey; Gude, Alexander; Hansen, Peter; Kalafut, Sean; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Lesko, Zachary; Mans, Jeremy; Nourbakhsh, Shervin; Ruckstuhl, Nicole; Rusack, Roger; Tambe, Norbert; Turkewitz, Jared; Acosta, John Gabriel; Oliveros, Sandra; Avdeeva, Ekaterina; Bartek, Rachel; Bloom, Kenneth; Bose, Suvadeep; Claes, Daniel R; Dominguez, Aaron; Fangmeier, Caleb; Gonzalez Suarez, Rebeca; Kamalieddin, Rami; Knowlton, Dan; Kravchenko, Ilya; Meier, Frank; Monroy, Jose; Siado, Joaquin Emilo; Snow, Gregory R; Stieger, Benjamin; Alyari, Maral; Dolen, James; George, Jimin; Godshalk, Andrew; Harrington, Charles; Iashvili, Ia; Kaisen, Josh; Kharchilava, Avto; Kumar, Ashish; Parker, Ashley; Rappoccio, Salvatore; Roozbahani, Bahareh; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Hortiangtham, Apichart; Massironi, Andrea; Morse, David Michael; Nash, David; Orimoto, Toyoko; Teixeira De Lima, Rafael; Trocino, Daniele; Wang, Ren-Jie; Wood, Darien; Bhattacharya, Saptaparna; Hahn, Kristan Allan; Kubik, Andrew; Low, Jia Fu; Mucia, Nicholas; Odell, Nathaniel; Pollack, Brian; Schmitt, Michael Henry; Sung, Kevin; Trovato, Marco; Velasco, Mayda; Dev, Nabarun; Hildreth, Michael; Hurtado Anampa, Kenyi; Jessop, Colin; Karmgard, Daniel John; Kellams, Nathan; Lannon, Kevin; Marinelli, Nancy; Meng, Fanbo; Mueller, Charles; Musienko, Yuri; Planer, Michael; Reinsvold, Allison; Ruchti, Randy; Rupprecht, Nathaniel; Smith, Geoffrey; Taroni, Silvia; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Woodard, Anna; Alimena, Juliette; Antonelli, Louis; Brinson, Jessica; Bylsma, Ben; Durkin, Lloyd Stanley; Flowers, Sean; Francis, Brian; Hart, Andrew; Hill, Christopher; Hughes, Richard; Ji, Weifeng; Liu, Bingxuan; Luo, Wuming; Puigh, Darren; Rodenburg, Marissa; Winer, Brian L; Wulsin, Howard Wells; Cooperstein, Stephane; Driga, Olga; Elmer, Peter; Hardenbrook, Joshua; Hebda, Philip; Luo, Jingyu; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Palmer, Christopher; Piroué, Pierre; Stickland, David; Tully, Christopher; Zuranski, Andrzej; Malik, Sudhir; Barker, Anthony; Barnes, Virgil E; Benedetti, Daniele; Folgueras, Santiago; Gutay, Laszlo; Jha, Manoj; Jones, Matthew; Jung, Andreas Werner; Jung, Kurt; Miller, David Harry; Neumeister, Norbert; Radburn-Smith, Benjamin Charles; Shi, Xin; Sun, Jian; Svyatkovskiy, Alexey; Wang, Fuqiang; Xie, Wei; Xu, Lingshan; Parashar, Neeti; Stupak, John; Adair, Antony; Akgun, Bora; Chen, Zhenyu; Ecklund, Karl Matthew; Geurts, Frank JM; Guilbaud, Maxime; Li, Wei; Michlin, Benjamin; Northup, Michael; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Rorie, Jamal; Tu, Zhoudunming; Zabel, James; Betchart, Burton; Bodek, Arie; de Barbaro, Pawel; Demina, Regina; Duh, Yi-ting; Ferbel, Thomas; Galanti, Mario; Garcia-Bellido, Aran; Han, Jiyeon; Hindrichs, Otto; Khukhunaishvili, Aleko; Lo, Kin Ho; Tan, Ping; Verzetti, Mauro; Chou, John Paul; Contreras-Campana, Emmanuel; Gershtein, Yuri; Gómez Espinosa, Tirso Alejandro; Halkiadakis, Eva; Heindl, Maximilian; Hidas, Dean; Hughes, Elliot; Kaplan, Steven; Kunnawalkam Elayavalli, Raghav; Kyriacou, Savvas; Lath, Amitabh; Nash, Kevin; Saka, Halil; Salur, Sevil; Schnetzer, Steve; Sheffield, David; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Thomassen, Peter; Walker, Matthew; Foerster, Mark; Heideman, Joseph; Riley, Grant; Rose, Keith; Spanier, Stefan; Thapa, Krishna; Bouhali, Othmane; Castaneda Hernandez, Alfredo; Celik, Ali; Dalchenko, Mykhailo; De Mattia, Marco; Delgado, Andrea; Dildick, Sven; Eusebi, Ricardo; Gilmore, Jason; Huang, Tao; Juska, Evaldas; Kamon, Teruki; Krutelyov, Vyacheslav; Mueller, Ryan; Pakhotin, Yuriy; Patel, Rishi; Perloff, Alexx; Perniè, Luca; Rathjens, Denis; Rose, Anthony; Safonov, Alexei; Tatarinov, Aysen; Ulmer, Keith; Akchurin, Nural; Cowden, Christopher; Damgov, Jordan; Dragoiu, Cosmin; Dudero, Phillip Russell; Faulkner, James; Kunori, Shuichi; Lamichhane, Kamal; Lee, Sung Won; Libeiro, Terence; Undleeb, Sonaina; Volobouev, Igor; Wang, Zhixing; Delannoy, Andrés G; Greene, Senta; Gurrola, Alfredo; Janjam, Ravi; Johns, Willard; Maguire, Charles; Melo, Andrew; Ni, Hong; Sheldon, Paul; Tuo, Shengquan; Velkovska, Julia; Xu, Qiao; Arenton, Michael Wayne; Barria, Patrizia; Cox, Bradley; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Li, Hengne; Neu, Christopher; Sinthuprasith, Tutanon; Sun, Xin; Wang, Yanchu; Wolfe, Evan; Xia, Fan; Clarke, Christopher; Harr, Robert; Karchin, Paul Edmund; Lamichhane, Pramod; Sturdy, Jared; Belknap, Donald; Dasu, Sridhara; Dodd, Laura; Duric, Senka; Gomber, Bhawna; Grothe, Monika; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Lanaro, Armando; Levine, Aaron; Long, Kenneth; Loveless, Richard; Ojalvo, Isabel; Perry, Thomas; Pierro, Giuseppe Antonio; Polese, Giovanni; Ruggles, Tyler; Savin, Alexander; Sharma, Archana; Smith, Nicholas; Smith, Wesley H; Taylor, Devin; Verwilligen, Piet; Woods, Nathaniel

2016-07-14

A search for narrow resonances decaying into dijet final states is performed on data from proton-proton collisions at a center-of-mass energy of 8 TeV, corresponding to an integrated luminosity of 18.8 fb$^{-1}$. The data were collected with the CMS detector using a novel technique called data scouting, in which the information associated with these selected events is much reduced, permitting collection of larger data samples. This technique enables CMS to record events containing jets at a rate of 1 kHz, by collecting the data from the high-level-trigger system. In this way, the sensitivity to low-mass resonances is increased significantly, allowing previously inaccessible couplings of new resonances to quarks and gluons to be probed. The resulting dijet mass distribution yields no evidence of narrow resonances. Upper limits are presented on the resonance cross sections as a function of mass, and compared with a variety of models predicting narrow resonances. The limits are translated into upper limits on th...

A comparison of results of empirical studies of supplementary search techniques and recommendations in review methodology handbooks: a methodological review.

Science.gov (United States)

Cooper, Chris; Booth, Andrew; Britten, Nicky; Garside, Ruth

2017-11-28

The purpose and contribution of supplementary search methods in systematic reviews is increasingly acknowledged. Numerous studies have demonstrated their potential in identifying studies or study data that would have been missed by bibliographic database searching alone. What is less certain is how supplementary search methods actually work, how they are applied, and the consequent advantages, disadvantages and resource implications of each search method. The aim of this study is to compare current practice in using supplementary search methods with methodological guidance. Four methodological handbooks in informing systematic review practice in the UK were read and audited to establish current methodological guidance. Studies evaluating the use of supplementary search methods were identified by searching five bibliographic databases. Studies were included if they (1) reported practical application of a supplementary search method (descriptive) or (2) examined the utility of a supplementary search method (analytical) or (3) identified/explored factors that impact on the utility of a supplementary method, when applied in practice. Thirty-five studies were included in this review in addition to the four methodological handbooks. Studies were published between 1989 and 2016, and dates of publication of the handbooks ranged from 1994 to 2014. Five supplementary search methods were reviewed: contacting study authors, citation chasing, handsearching, searching trial registers and web searching. There is reasonable consistency between recommended best practice (handbooks) and current practice (methodological studies) as it relates to the application of supplementary search methods. The methodological studies provide useful information on the effectiveness of the supplementary search methods, often seeking to evaluate aspects of the method to improve effectiveness or efficiency. In this way, the studies advance the understanding of the supplementary search methods. Further

Techniques to Evaluate Dental Erosion: A Systematic Review of Literature.

Science.gov (United States)

Joshi, Mahasweta; Joshi, Nikhil; Kathariya, Rahul; Angadi, Prabhakar; Raikar, Sonal

2016-10-01

This article reviews different techniques for evaluating dental erosion, weighs the advantages and disadvantages of these techniques, and presents the latest trends in the study of dental erosion. In May 2014, an initial search was carried out in the PubMed/MEDLINE database of indexed journals from 1975 to 2013 using the following keywords: dental erosion; dental erosion In-vitro; and dental erosion in-vivo. Bibliographic citations from the papers found were then used to find other useful sources. The authors categorize the techniques into three classes: in-vitro, in-vivo and in-vitro/in-vivo. The article discusses the instrumentation required to use each of these techniques, as well as their rationale, merits and applications. The emergence of in-vitro/in-vivo techniques offers the potential to accurately quantify tooth wear in clinical situations. Cross-sectional as well as longitudinal studies show that these techniques will improve diagnosis, treatment planning and management of dental erosion.

Upgrading Enterprise Search

Energy Technology Data Exchange (ETDEWEB)

McDunn, R

2005-04-28

This presentation will describe the process we went through this past year to upgrade our enterprise search tool from a very old version of Inktomi to the latest version of Verity Ultraseek. We started with requirements gathering and then compared requirements against several available products to determine which product to choose. After purchasing the product, we worked through several defined phases of implementation and customization, with initial rollout late January 2004. Finally, we will show you where we are today and describe future search plans.

A Novel Personalized Web Search Model

Institute of Scientific and Technical Information of China (English)

ZHU Zhengyu; XU Jingqiu; TIAN Yunyan; REN Xiang

2007-01-01

A novel personalized Web search model is proposed.The new system, as a middleware between a user and a Web search engine, is set up on the client machine. It can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, the system can automatically generate a few personalized expansion words by computing the term-term associations according to the current user profile, and then these words together with the query keywords are submitted to a popular search engine such as Yahoo or Google.These expansion words help to express accurately the user's search intention. The new Web search model can make a common search engine personalized, that is, the search engine can return different search results to different users who input the same keywords. The experimental results show the feasibility and applicability of the presented work.

Self-regulation during job search: the opposing effects of employment self-efficacy and job search behavior self-efficacy.

Science.gov (United States)

Liu, Songqi; Wang, Mo; Liao, Hui; Shi, Junqi

2014-11-01

Adopting a self-regulatory perspective, the current study examined the within-person relationships among job search cognitions, job search behaviors, and job search success (i.e., number of job offers received). Specifically, conceptualizing job search behaviors as guided by a hierarchy of means-end (i.e., job search behavior-employment) goal structure, we differentiated employment self-efficacy from job search behavior self-efficacy. Our results showed that higher levels of perceived job search progress could lead to more frequent job search behaviors through enhancing job search behavior self-efficacy. However, higher levels of perceived job search progress could also lead to less frequent job search behaviors through elevating employment self-efficacy. In addition, the relationships between perceived job search progress and efficacy beliefs were moderated by job seekers' level of internal attribution of their progress. Finally, we found that at the within-person level, frequency of job search behaviors was positively related to number of job offers received. These findings were discussed in terms of their theoretical and practical implications. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space

KAUST Repository

Tao, Yufei

2010-07-01

Nearest Neighbor (NN) search in high-dimensional space is an important problem in many applications. From the database perspective, a good solution needs to have two properties: (i) it can be easily incorporated in a relational database, and (ii) its query cost should increase sublinearly with the dataset size, regardless of the data and query distributions. Locality-Sensitive Hashing (LSH) is a well-known methodology fulfilling both requirements, but its current implementations either incur expensive space and query cost, or abandon its theoretical guarantee on the quality of query results. Motivated by this, we improve LSH by proposing an access method called the Locality-Sensitive B-tree (LSB-tree) to enable fast, accurate, high-dimensional NN search in relational databases. The combination of several LSB-trees forms a LSB-forest that has strong quality guarantees, but improves dramatically the efficiency of the previous LSH implementation having the same guarantees. In practice, the LSB-tree itself is also an effective index which consumes linear space, supports efficient updates, and provides accurate query results. In our experiments, the LSB-tree was faster than: (i) iDistance (a famous technique for exact NN search) by two orders ofmagnitude, and (ii) MedRank (a recent approximate method with nontrivial quality guarantees) by one order of magnitude, and meanwhile returned much better results. As a second step, we extend our LSB technique to solve another classic problem, called Closest Pair (CP) search, in high-dimensional space. The long-term challenge for this problem has been to achieve subquadratic running time at very high dimensionalities, which fails most of the existing solutions. We show that, using a LSB-forest, CP search can be accomplished in (worst-case) time significantly lower than the quadratic complexity, yet still ensuring very good quality. In practice, accurate answers can be found using just two LSB-trees, thus giving a substantial

A γ dose distribution evaluation technique using the k-d tree for nearest neighbor searching

International Nuclear Information System (INIS)

Yuan Jiankui; Chen Weimin

2010-01-01

Purpose: The authors propose an algorithm based on the k-d tree for nearest neighbor searching to improve the γ calculation time for 2D and 3D dose distributions. Methods: The γ calculation method has been widely used for comparisons of dose distributions in clinical treatment plans and quality assurances. By specifying the acceptable dose and distance-to-agreement criteria, the method provides quantitative measurement of the agreement between the reference and evaluation dose distributions. The γ value indicates the acceptability. In regions where γ≤1, the predefined criterion is satisfied and thus the agreement is acceptable; otherwise, the agreement fails. Although the concept of the method is not complicated and a quick naieve implementation is straightforward, an efficient and robust implementation is not trivial. Recent algorithms based on exhaustive searching within a maximum radius, the geometric Euclidean distance, and the table lookup method have been proposed to improve the computational time for multidimensional dose distributions. Motivated by the fact that the least searching time for finding a nearest neighbor can be an O(log N) operation with a k-d tree, where N is the total number of the dose points, the authors propose an algorithm based on the k-d tree for the γ evaluation in this work. Results: In the experiment, the authors found that the average k-d tree construction time per reference point is O(log N), while the nearest neighbor searching time per evaluation point is proportional to O(N 1/k ), where k is between 2 and 3 for two-dimensional and three-dimensional dose distributions, respectively. Conclusions: Comparing with other algorithms such as exhaustive search and sorted list O(N), the k-d tree algorithm for γ evaluation is much more efficient.

Taking It to the Top: A Lesson in Search Engine Optimization

Science.gov (United States)

Frydenberg, Mark; Miko, John S.

2011-01-01

Search engine optimization (SEO), the promoting of a Web site so it achieves optimal position with a search engine's rankings, is an important strategy for organizations and individuals in order to promote their brands online. Techniques for achieving SEO are relevant to students of marketing, computing, media arts, and other disciplines, and many…

Database Search Engines: Paradigms, Challenges and Solutions.

Science.gov (United States)

Verheggen, Kenneth; Martens, Lennart; Berven, Frode S; Barsnes, Harald; Vaudel, Marc

2016-01-01

The first step in identifying proteins from mass spectrometry based shotgun proteomics data is to infer peptides from tandem mass spectra, a task generally achieved using database search engines. In this chapter, the basic principles of database search engines are introduced with a focus on open source software, and the use of database search engines is demonstrated using the freely available SearchGUI interface. This chapter also discusses how to tackle general issues related to sequence database searching and shows how to minimize their impact.

Target-nontarget similarity decreases search efficiency and increases stimulus-driven control in visual search.

Science.gov (United States)

Barras, Caroline; Kerzel, Dirk

2017-10-01

Some points of criticism against the idea that attentional selection is controlled by bottom-up processing were dispelled by the attentional window account. The attentional window account claims that saliency computations during visual search are only performed for stimuli inside the attentional window. Therefore, a small attentional window may avoid attentional capture by salient distractors because it is likely that the salient distractor is located outside the window. In contrast, a large attentional window increases the chances of attentional capture by a salient distractor. Large and small attentional windows have been associated with efficient (parallel) and inefficient (serial) search, respectively. We compared the effect of a salient color singleton on visual search for a shape singleton during efficient and inefficient search. To vary search efficiency, the nontarget shapes were either similar or dissimilar with respect to the shape singleton. We found that interference from the color singleton was larger with inefficient than efficient search, which contradicts the attentional window account. While inconsistent with the attentional window account, our results are predicted by computational models of visual search. Because of target-nontarget similarity, the target was less salient with inefficient than efficient search. Consequently, the relative saliency of the color distractor was higher with inefficient than with efficient search. Accordingly, stronger attentional capture resulted. Overall, the present results show that bottom-up control by stimulus saliency is stronger when search is difficult, which is inconsistent with the attentional window account.

Making Temporal Search More Central in Spatial Data Infrastructures

Science.gov (United States)

Corti, P.; Lewis, B.

2017-10-01

A temporally enabled Spatial Data Infrastructure (SDI) is a framework of geospatial data, metadata, users, and tools intended to provide an efficient and flexible way to use spatial information which includes the historical dimension. One of the key software components of an SDI is the catalogue service which is needed to discover, query, and manage the metadata. A search engine is a software system capable of supporting fast and reliable search, which may use any means necessary to get users to the resources they need quickly and efficiently. These techniques may include features such as full text search, natural language processing, weighted results, temporal search based on enrichment, visualization of patterns in distributions of results in time and space using temporal and spatial faceting, and many others. In this paper we will focus on the temporal aspects of search which include temporal enrichment using a time miner - a software engine able to search for date components within a larger block of text, the storage of time ranges in the search engine, handling historical dates, and the use of temporal histograms in the user interface to display the temporal distribution of search results.

Automated Search-Based Robustness Testing for Autonomous Vehicle Software

Directory of Open Access Journals (Sweden)

Kevin M. Betts

2016-01-01

Full Text Available Autonomous systems must successfully operate in complex time-varying spatial environments even when dealing with system faults that may occur during a mission. Consequently, evaluating the robustness, or ability to operate correctly under unexpected conditions, of autonomous vehicle control software is an increasingly important issue in software testing. New methods to automatically generate test cases for robustness testing of autonomous vehicle control software in closed-loop simulation are needed. Search-based testing techniques were used to automatically generate test cases, consisting of initial conditions and fault sequences, intended to challenge the control software more than test cases generated using current methods. Two different search-based testing methods, genetic algorithms and surrogate-based optimization, were used to generate test cases for a simulated unmanned aerial vehicle attempting to fly through an entryway. The effectiveness of the search-based methods in generating challenging test cases was compared to both a truth reference (full combinatorial testing and the method most commonly used today (Monte Carlo testing. The search-based testing techniques demonstrated better performance than Monte Carlo testing for both of the test case generation performance metrics: (1 finding the single most challenging test case and (2 finding the set of fifty test cases with the highest mean degree of challenge.

Numerical Algorithms for Personalized Search in Self-organizing Information Networks

CERN Document Server

Kamvar, Sep

2010-01-01

This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. Representing much of the foundational research in this field, the book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Sep Kamvar focuses on eigenvector-based techniques in Web search, introducing a personalized variant of Google's PageRank algorithm, and he outlines algorithms--such as the now-famous quad

Searches for Electroweak Signatures of Supersymmetry at ATLAS and CMS

CERN Document Server

Khoo, Teng Jian; The ATLAS collaboration

2018-01-01

Searches for strongly-produced superparticles at the Large Hadron Collider have excluded gluinos and squarks of all generations up to the TeV scale. While limited by statistics, electroweak signatures remain less thoroughly explored, and in particular the Higgsino sector has proven challenging. Conventional searches for leptons associated with missing transverse momentum do not fully cover the phase space, requiring new approaches to extend experimental sensitivity. Dedicated reconstruction techniques address the challenge posed by mass-degenerate spectra. By looking beyond the assumption of leptonic signatures, searches for gauge-mediated supersymmetry have broken new ground.

Searching in small-world networks

International Nuclear Information System (INIS)

Moura, Alessandro P.S. de; Motter, Adilson E.; Grebogi, Celso

2003-01-01

We study the average time it takes to find a desired node in the Watts-Strogatz family of networks. We consider the case when the look-up time can be neglected and when it is important, where the look-up time is the time needed to choose one among all the neighboring nodes of a node at each step in the search. We show that in both cases, the search time is minimum in the small-world regime, when an appropriate distance between the nodes is defined. Through an analytical model, we show that the search time scales as N 1/D(D+1) for small-world networks, where N is the number of nodes and D is the dimension of the underlying lattice. This model is shown to be in agreement with numerical simulations

Nuclear techniques in analytical chemistry

CERN Document Server

Moses, Alfred J; Gordon, L

1964-01-01

Nuclear Techniques in Analytical Chemistry discusses highly sensitive nuclear techniques that determine the micro- and macro-amounts or trace elements of materials. With the increasingly frequent demand for the chemical determination of trace amounts of elements in materials, the analytical chemist had to search for more sensitive methods of analysis. This book accustoms analytical chemists with nuclear techniques that possess the desired sensitivity and applicability at trace levels. The topics covered include safe handling of radioactivity; measurement of natural radioactivity; and neutron a

Visual search by chimpanzees (Pan): assessment of controlling relations.

Science.gov (United States)

Tomonaga, M

1995-03-01

Three experimentally sophisticated chimpanzees (Pan), Akira, Chloe, and Ai, were trained on visual search performance using a modified multiple-alternative matching-to-sample task in which a sample stimulus was followed by the search display containing one target identical to the sample and several uniform distractors (i.e., negative comparison stimuli were identical to each other). After they acquired this task, they were tested for transfer of visual search performance to trials in which the sample was not followed by the uniform search display (odd-item search). Akira showed positive transfer of visual search performance to odd-item search even when the display size (the number of stimulus items in the search display) was small, whereas Chloe and Ai showed a transfer only when the display size was large. Chloe and Ai used some nonrelational cues such as perceptual isolation of the target among uniform distractors (so-called pop-out). In addition to the odd-item search test, various types of probe trials were presented to clarify the controlling relations in multiple-alternative matching to sample. Akira showed a decrement of accuracy as a function of the display size when the search display was nonuniform (i.e., each "distractor" stimulus was not the same), whereas Chloe and Ai showed perfect performance. Furthermore, when the sample was identical to the uniform distractors in the search display, Chloe and Ai never selected an odd-item target, but Akira selected it when the display size was large. These results indicated that Akira's behavior was controlled mainly by relational cues of target-distractor oddity, whereas an identity relation between the sample and the target strongly controlled the performance of Chloe and Ai.

Job shop scheduling by local search

NARCIS (Netherlands)

Aarts, E.H.L.; Lenstra, J.K.; Laarhoven, van P.J.M.; Ulder, N.L.J.

1992-01-01

We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense

Permutation based decision making under fuzzy environment using Tabu search

Directory of Open Access Journals (Sweden)

Mahdi Bashiri

2012-04-01

Full Text Available One of the techniques, which are used for Multiple Criteria Decision Making (MCDM is the permutation. In the classical form of permutation, it is assumed that weights and decision matrix components are crisp. However, when group decision making is under consideration and decision makers could not agree on a crisp value for weights and decision matrix components, fuzzy numbers should be used. In this article, the fuzzy permutation technique for MCDM problems has been explained. The main deficiency of permutation is its big computational time, so a Tabu Search (TS based algorithm has been proposed to reduce the computational time. A numerical example has illustrated the proposed approach clearly. Then, some benchmark instances extracted from literature are solved by proposed TS. The analyses of the results show the proper performance of the proposed method.

Supersymmetry search via gauge boson fusion

Indian Academy of Sciences (India)

Abstract. We propose a novel method for the search of supersymmetry, especially for the elec- troweak gauginos at the large hadron collider (LHC). Gauge boson fusion technique was shown to be useful for heavy and intermediate mass Higgs bosons. In this article, we have shown that this method can also be applied to ...

A technique for searching for the 2K capture in {sup 124}Xe with a copper proportional counter

Energy Technology Data Exchange (ETDEWEB)

Gavrilyuk, Yu. M.; Gangapshev, A. M.; Kazalov, V. V.; Kuzminov, V. V. [Russian Academy of Sciences, Institute for Nuclear Research (Russian Federation); Panasenko, S. I.; Ratkevich, S. S. [Karazin Kharkiv National University (Ukraine); Tekueva, D. A., E-mail: t.jami.a@mail.ru; Yakimenko, S. P. [Russian Academy of Sciences, Institute for Nuclear Research (Russian Federation)

2015-12-15

An experimental technique for searching for the 2K capture in {sup 124}Xe with a large low-background copper proportional counter is described. Such an experiment is conducted at the Baksan Neutrino Observatory of the Institute for Nuclear Research of the Russian Academy of Sciences. The experimental setup is located in the Low-Background Deep-Level Laboratory at a depth of 4900 m.w.e., where the flux of muons of cosmic rays is suppressed by a factor of 10{sup 7} relative to that at the Earth’s surface. The setup incorporates a proportional counter and low-background shielding (18 cm of copper, 15 cm of lead, and 8 cm of borated polyethylene). The results of processing the data obtained in 5 months of live measurement time are presented. A new limit on the half-life of {sup 124}Xe with respect to the 2K capture is set at the level of 2.5 × 10{sup 21} years.

Pattern Nulling of Linear Antenna Arrays Using Backtracking Search Optimization Algorithm

Directory of Open Access Journals (Sweden)

Kerim Guney

2015-01-01

Full Text Available An evolutionary method based on backtracking search optimization algorithm (BSA is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO, genetic algorithm (GA, modified touring ant colony algorithm (MTACO, quadratic programming method (QPM, bacterial foraging algorithm (BFA, bees algorithm (BA, clonal selection algorithm (CLONALG, plant growth simulation algorithm (PGSA, tabu search algorithm (TSA, memetic algorithm (MA, nondominated sorting GA-2 (NSGA-2, multiobjective differential evolution (MODE, decomposition with differential evolution (MOEA/D-DE, comprehensive learning PSO (CLPSO, harmony search algorithm (HSA, seeker optimization algorithm (SOA, and mean variance mapping optimization (MVMO. The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.

Enhancing Divergent Search through Extinction Events

DEFF Research Database (Denmark)

Lehman, Joel; Miikkulainen, Risto

2015-01-01

for the capacity to evolve. This hypothesis is tested through experiments in two evolutionary robotics domains. The results show that combining extinction events with divergent search increases evolvability, while combining them with convergent search offers no similar benefit. The conclusion is that extinction...

Learning Search Algorithms: An Educational View

Directory of Open Access Journals (Sweden)

Ales Janota

2014-12-01

Full Text Available Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.

Virtual Power Plant and Microgrids controller for Energy Management based on optimization techniques

Directory of Open Access Journals (Sweden)

Maher G. M. Abdolrasol

2017-06-01

Full Text Available This paper discuss virtual power plant (VPP and Microgrid controller for energy management system (EMS based on optimization techniques by using two optimization techniques namely Backtracking search algorithm (BSA and particle swarm optimization algorithm (PSO. The research proposes use of multi Microgrid in the distribution networks to aggregate the power form distribution generation and form it into single Microgrid and let these Microgrid deal directly with the central organizer called virtual power plant. VPP duties are price forecast, demand forecast, weather forecast, production forecast, shedding loads, make intelligent decision and for aggregate & optimizes the data. This huge system has been tested and simulated by using Matlab simulink. These paper shows optimizations of two methods were really significant in the results. But BSA is better than PSO to search for better parameters which could make more power saving as in the results and the discussion.

Search for chameleon particles via photon regeneration

International Nuclear Information System (INIS)

Chou, Aaron S.; CCPP, New York U.

2008-01-01

We report the first results from the GammeV search for chameleon particles, which may be created via photon-photon interactions within a strong magnetic field. The chameleons are assumed to have matter effects sufficiently strong that they reflect from all solid surfaces of the apparatus, thus evading detection in our previous search for weakly-interacting axion-like particles. We implement a novel technique to create and trap the reflective particles within a jar and to detect them later via their afterglow as they slowly convert back into photons. These measurements provide the first experimental constraints on the couplings of chameleons to photons

Selective Laser Melting Technique of Co-Cr Dental Alloys: A Review of Structure and Properties and Comparative Analysis with Other Available Techniques.

Science.gov (United States)

Koutsoukis, Theodoros; Zinelis, Spiros; Eliades, George; Al-Wazzan, Khalid; Rifaiy, Mohammed Al; Al Jabbari, Youssef S

2015-06-01

The aim of this study was to review the effect of selective laser melting (SLM) procedure on the properties of dental structures made of Co-Cr alloys and to evaluate its quality and compare it to those produced by conventional casting and milling fabrication techniques. A computerized database search using PubMed and Scopus was conducted for peer-reviewed scientific research studies regarding the use of SLM in Co-Cr dental alloys with no restrictions for publication years. The search engines provided hundreds of results, and only 48 scientific research papers, case studies, or literature reviews were considered relevant for this review. The innovative manufacturing concept of SLM offers many advantages compared with casting and milling fabrication techniques. SLM provides different microstructure from casting and milling with minimal internal porosity and internal fitting, marginal adaptation, and comparable bond strength to porcelain. Mechanical and electrochemical properties of SLM structures are enhanced compared to cast, while clinical longevity of single-metal ceramic crowns is comparable to Au-Pt dental alloy. The SLM technique provides dental prosthetic restorations more quickly and less expensively without compromising their quality compared with restorations prepared by casting and milling techniques. The current SLM devices provide metallic restorations made of Co-Cr alloys for removable and fixed partial dentures without compromising the alloy or restoration properties at a fraction of the time and cost, showing great potential to replace the aforementioned fabrication techniques in the long term; however, further clinical studies are essential to increase the acceptance of this technology by the worldwide dental community. © 2015 by the American College of Prosthodontists.

The Search Performance Evaluation and Prediction in Exploratory Search

OpenAIRE

LIU, FEI

2016-01-01

The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

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

Science.gov (United States)

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.

Multipass Target Search in Natural Environments.

Science.gov (United States)

Kuhlman, Michael J; Otte, Michael W; Sofge, Donald; Gupta, Satyandra K

2017-11-02

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

Artificial intelligence techniques in Prolog

CERN Document Server

Shoham, Yoav

1993-01-01

Artificial Intelligence Techniques in Prolog introduces the reader to the use of well-established algorithmic techniques in the field of artificial intelligence (AI), with Prolog as the implementation language. The techniques considered cover general areas such as search, rule-based systems, and truth maintenance, as well as constraint satisfaction and uncertainty management. Specific application domains such as temporal reasoning, machine learning, and natural language are also discussed.Comprised of 10 chapters, this book begins with an overview of Prolog, paying particular attention to Prol

Experimental Searches for Exotic Short-Range Forces Using Mechanical Oscillators

Science.gov (United States)

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.

Simultaneous recordings of human microsaccades and drifts with a contemporary video eye tracker and the search coil technique.

Directory of Open Access Journals (Sweden)

Michael B McCamy

Full Text Available Human eyes move continuously, even during visual fixation. These "fixational eye movements" (FEMs include microsaccades, intersaccadic drift and oculomotor tremor. Research in human FEMs has grown considerably in the last decade, facilitated by the manufacture of noninvasive, high-resolution/speed video-oculography eye trackers. Due to the small magnitude of FEMs, obtaining reliable data can be challenging, however, and depends critically on the sensitivity and precision of the eye tracking system. Yet, no study has conducted an in-depth comparison of human FEM recordings obtained with the search coil (considered the gold standard for measuring microsaccades and drift and with contemporary, state-of-the art video trackers. Here we measured human microsaccades and drift simultaneously with the search coil and a popular state-of-the-art video tracker. We found that 95% of microsaccades detected with the search coil were also detected with the video tracker, and 95% of microsaccades detected with video tracking were also detected with the search coil, indicating substantial agreement between the two systems. Peak/mean velocities and main sequence slopes of microsaccades detected with video tracking were significantly higher than those of the same microsaccades detected with the search coil, however. Ocular drift was significantly correlated between the two systems, but drift speeds were higher with video tracking than with the search coil. Overall, our combined results suggest that contemporary video tracking now approaches the search coil for measuring FEMs.

Short-term perceptual learning in visual conjunction search.

Science.gov (United States)

Su, Yuling; Lai, Yunpeng; Huang, Wanyi; Tan, Wei; Qu, Zhe; Ding, Yulong

2014-08-01

Although some studies showed that training can improve the ability of cross-dimension conjunction search, less is known about the underlying mechanism. Specifically, it remains unclear whether training of visual conjunction search can successfully bind different features of separated dimensions into a new function unit at early stages of visual processing. In the present study, we utilized stimulus specificity and generalization to provide a new approach to investigate the mechanisms underlying perceptual learning (PL) in visual conjunction search. Five experiments consistently showed that after 40 to 50 min of training of color-shape/orientation conjunction search, the ability to search for a certain conjunction target improved significantly and the learning effects did not transfer to a new target that differed from the trained target in both color and shape/orientation features. However, the learning effects were not strictly specific. In color-shape conjunction search, although the learning effect could not transfer to a same-shape different-color target, it almost completely transferred to a same-color different-shape target. In color-orientation conjunction search, the learning effect partly transferred to a new target that shared same color or same orientation with the trained target. Moreover, the sum of transfer effects for the same color target and the same orientation target in color-orientation conjunction search was algebraically equivalent to the learning effect for trained target, showing an additive transfer effect. The different transfer patterns in color-shape and color-orientation conjunction search learning might reflect the different complexity and discriminability between feature dimensions. These results suggested a feature-based attention enhancement mechanism rather than a unitization mechanism underlying the short-term PL of color-shape/orientation conjunction search.

Surface-Assisted Dynamic Search Processes.

Science.gov (United States)

Shin, Jaeoh; Kolomeisky, Anatoly B

2018-03-01

Many chemical and biological systems exhibit intermittent search phenomena when participating particles alternate between dynamic regimes with different dimensionalities. Here we investigate theoretically a dynamic search process of finding a small target on a two-dimensional surface starting from a bulk solution, which is an example of such an intermittent search process. Both continuum and discrete-state stochastic descriptions are developed. It is found that depending on the scanning length λ, which describes the area visited by the reacting molecule during one search cycle, the system can exhibit three different search regimes: (i) For small λ values, the reactant finds the target mostly via three-dimensional bulk diffusion; (ii) for large λ values, the reactant molecule associates to the target mostly via surface diffusion; and (iii) for intermediate λ values, the reactant reaches the target via a combination of three-dimensional and two-dimensional search cycles. Our analysis also shows that the mean search times have different scalings as a function of the size of the surface segment depending on the nature of the dynamic search regime. Search dynamics are also sensitive to the position of the target for large scanning lengths. In addition, it is argued that the continuum description underestimates mean search times and does not always correctly describe the most optimal conditions for the surface-assisted dynamic processes. The importance of our findings for real natural systems is discussed.

One visual search, many memory searches: An eye-tracking investigation of hybrid search.

Science.gov (United States)

Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M

2017-09-01

Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.

The Search for Extension: 7 Steps to Help People Find Research-Based Information on the Internet

Science.gov (United States)

Hill, Paul; Rader, Heidi B.; Hino, Jeff

2012-01-01

For Extension's unbiased, research-based content to be found by people searching the Internet, it needs to be organized in a way conducive to the ranking criteria of a search engine. With proper web design and search engine optimization techniques, Extension's content can be found, recognized, and properly indexed by search engines and…

Can electronic search engines optimize screening of search results in systematic reviews: an empirical study.

Science.gov (United States)

Sampson, Margaret; Barrowman, Nicholas J; Moher, David; Clifford, Tammy J; Platt, Robert W; Morrison, Andra; Klassen, Terry P; Zhang, Li

2006-02-24

Most electronic search efforts directed at identifying primary studies for inclusion in systematic reviews rely on the optimal Boolean search features of search interfaces such as DIALOG and Ovid. Our objective is to test the ability of an Ultraseek search engine to rank MEDLINE records of the included studies of Cochrane reviews within the top half of all the records retrieved by the Boolean MEDLINE search used by the reviewers. Collections were created using the MEDLINE bibliographic records of included and excluded studies listed in the review and all records retrieved by the MEDLINE search. Records were converted to individual HTML files. Collections of records were indexed and searched through a statistical search engine, Ultraseek, using review-specific search terms. Our data sources, systematic reviews published in the Cochrane library, were included if they reported using at least one phase of the Cochrane Highly Sensitive Search Strategy (HSSS), provided citations for both included and excluded studies and conducted a meta-analysis using a binary outcome measure. Reviews were selected if they yielded between 1000-6000 records when the MEDLINE search strategy was replicated. Nine Cochrane reviews were included. Included studies within the Cochrane reviews were found within the first 500 retrieved studies more often than would be expected by chance. Across all reviews, recall of included studies into the top 500 was 0.70. There was no statistically significant difference in ranking when comparing included studies with just the subset of excluded studies listed as excluded in the published review. The relevance ranking provided by the search engine was better than expected by chance and shows promise for the preliminary evaluation of large results from Boolean searches. A statistical search engine does not appear to be able to make fine discriminations concerning the relevance of bibliographic records that have been pre-screened by systematic reviewers.

The Cost of Cache-Oblivious Searching

DEFF Research Database (Denmark)

Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf

2003-01-01

, multilevel memory hierarchies can be modelled. It is shown that as k grows, the search costs of the optimal k-level DAM search structure and of the optimal cache-oblivious search structure rapidly converge. This demonstrates that for a multilevel memory hierarchy, a simple cache-oblivious structure almost......Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e log B N block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes...... the random placement of the rst element of the structure in memory. As searching in the Disk Access Model (DAM) can be performed in log B N + 1 block transfers, this result shows a separation between the 2-level DAM and cacheoblivious memory-hierarchy models. By extending the DAM model to k levels...

A search for close-mass lepton doublet

International Nuclear Information System (INIS)

Riles, J.K.

1989-04-01

Described is a search for a heavy charged lepton with an associated neutrino of nearly the same mass, together known as a close-mass lepton doublet. The search is conducted in e + e/sup/minus// annihilation data taken with the Mark II detector at a center-of-mass energy of 29 GeV. In order to suppress contamination from conventional two-photon reactions, the search applies a novel, radiative-tagging technique. Requiring the presence of an isolated, energetic photon allows exploration for lepton doublets with a mass splitting smaller than that previously accessible to experiment. No evidence for such a new lepton has been found, enabling limits to be placed on allowed mass combinations. Mass differences as low as 250-300 MeV are excluded for charged lepton masses up to 10 GeV. 78 refs., 64 figs., 8 tabs

Versatile directional searches for gravitational waves with Pulsar Timing Arrays

Science.gov (United States)

Madison, D. R.; Zhu, X.-J.; Hobbs, G.; Coles, W.; Shannon, R. M.; Wang, J. B.; Tiburzi, C.; Manchester, R. N.; Bailes, M.; Bhat, N. D. R.; Burke-Spolaor, S.; Dai, S.; Dempsey, J.; Keith, M.; Kerr, M.; Lasky, P.; Levin, Y.; Osłowski, S.; Ravi, V.; Reardon, D.; Rosado, P.; Spiewak, R.; van Straten, W.; Toomey, L.; Wen, L.; You, X.

2016-02-01

By regularly monitoring the most stable millisecond pulsars over many years, pulsar timing arrays (PTAs) are positioned to detect and study correlations in the timing behaviour of those pulsars. Gravitational waves (GWs) from supermassive black hole binaries (SMBHBs) are an exciting potentially detectable source of such correlations. We describe a straightforward technique by which a PTA can be `phased-up' to form time series of the two polarization modes of GWs coming from a particular direction of the sky. Our technique requires no assumptions regarding the time-domain behaviour of a GW signal. This method has already been used to place stringent bounds on GWs from individual SMBHBs in circular orbits. Here, we describe the methodology and demonstrate the versatility of the technique in searches for a wide variety of GW signals including bursts with unmodelled waveforms. Using the first six years of data from the Parkes Pulsar Timing Array, we conduct an all-sky search for a detectable excess of GW power from any direction. For the lines of sight to several nearby massive galaxy clusters, we carry out a more detailed search for GW bursts with memory, which are distinct signatures of SMBHB mergers. In all cases, we find that the data are consistent with noise.

Scattering quantum random-walk search with errors

International Nuclear Information System (INIS)

Gabris, A.; Kiss, T.; Jex, I.

2007-01-01

We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value

Wastewater Treatment Optimization for Fish Migration Using Harmony Search

Directory of Open Access Journals (Sweden)

Zong Woo Geem

2014-01-01

Full Text Available Certain types of fish migrate between the sea and fresh water to spawn. In order for them to swim without any breathing problem, river should contain enough oxygen. If fish is passing along the river in municipal area, it needs sufficient dissolved oxygen level which is influenced by dumped amount of wastewater into the river. If existing treatment methods such as settling and biological oxidation are not enough, we have to consider additional treatment methods such as microscreening filtration and nitrification. This study constructed a wastewater treatment optimization model for migratory fish, which considers three costs (filtration cost, nitrification cost, and irrigation cost and two environmental constraints (minimal dissolved oxygen level and maximal nitrate-nitrogen concentration. Results show that the metaheuristic technique such as harmony search could find good solutions robustly while calculus-based technique such as generalized reduced gradient method was trapped in local optima or even divergent.

Verification of Single-Peptide Protein Identifications by the Application of Complementary Database Search Algorithms

National Research Council Canada - National Science Library

Rohrbough, James G; Breci, Linda; Merchant, Nirav; Miller, Susan; Haynes, Paul A

2005-01-01

.... One such technique, known as the Multi-Dimensional Protein Identification Technique, or MudPIT, involves the use of computer search algorithms that automate the process of identifying proteins...

Finger Search in the Implicit Model

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob

2012-01-01

We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no information is stored between operations, except the array of elements. We show that for any implicit dictionary supporting finger searches in q(t) = Ω(logt) time, the time to move...... the finger to another element is Ω(q− 1(logn)), where t is the rank distance between the query element and the finger. We present an optimal implicit static structure matching this lower bound. We furthermore present a near optimal implicit dynamic structure supporting search, change-finger, insert......, and delete in times $\\mathcal{O}(q(t))$, $\\mathcal{O}(q^{-1}(\\log n)\\log n)$, $\\mathcal{O}(\\log n)$, and $\\mathcal{O}(\\log n)$, respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element...

PLANE MATCHING WITH OBJECT-SPACE SEARCHING USING INDEPENDENTLY RECTIFIED IMAGES

Directory of Open Access Journals (Sweden)

H. Takeda

2012-07-01

Full Text Available In recent years, the social situation in cities has changed significantly such as redevelopment due to the massive earthquake and large-scale urban development. For example, numerical simulations can be used to study this phenomenon. Such simulations require the construction of high-definition three-dimensional city models that accurately reflect the real world. Progress in sensor technology allows us to easily obtain multi-view images. However, the existing multi-image matching techniques are inadequate. In this paper, we propose a new technique for multi-image matching. Since the existing method of feature searching is complicated, we have developed a rectification method that can be processed independently for each image does not depend on the stereo-pair. The object-space searching method that produces mismatches due to the occlusion or distortion of wall textures on images is the focus of our study. Our proposed technique can also match the building wall surface. The proposed technique has several advantages, and its usefulness is clarified through an experiment using actual images.

SearchResultFinder: federated search made easy

NARCIS (Netherlands)

Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd

Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up

ATLAS searches for New Physics with Boosted Objects

CERN Multimedia

CERN. Geneva

2013-01-01

With the increase of energy and luminosity at the LHC, searches for new physics are focusing on the multi-TeV mass range. Decays of heavy resonances associated with new physics in this mass range often result in highly boosted very massive objects such as W/Z bosons or Top quarks. New reconstruction techniques, based on jet sub-structure algorithms, are needed to efficiently reconstruct such decay signatures. We will review recent ATLAS developments of jet sub-structure reconstruction tools, and their application to searches for physics beyond the Standard Model.

Improved Degree Search Algorithms in Unstructured P2P Networks

Directory of Open Access Journals (Sweden)

Guole Liu

2012-01-01

Full Text Available Searching and retrieving the demanded correct information is one important problem in networks; especially, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer (P2P networks. Breadth-first search (BFS and depth-first search (DFS are the current two typical search methods. BFS-based algorithms show the perfect performance in the aspect of search success rate of network resources, while bringing the huge search messages. On the contrary, DFS-based algorithms reduce the search message quantity and also cause the dropping of search success ratio. To address the problem that only one of performances is excellent, we propose two memory function degree search algorithms: memory function maximum degree algorithm (MD and memory function preference degree algorithm (PD. We study their performance including the search success rate and the search message quantity in different networks, which are scale-free networks, random graph networks, and small-world networks. Simulations show that the two performances are both excellent at the same time, and the performances are improved at least 10 times.

Pathfinder: multiresolution region-based searching of pathology images using IRM.

OpenAIRE

Wang, J. Z.

2000-01-01

The fast growth of digitized pathology slides has created great challenges in research on image database retrieval. The prevalent retrieval technique involves human-supplied text annotations to describe slide contents. These pathology images typically have very high resolution, making it difficult to search based on image content. In this paper, we present Pathfinder, an efficient multiresolution region-based searching system for high-resolution pathology image libraries. The system uses wave...

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters

Directory of Open Access Journals (Sweden)

Lefkowitz Elliot J

2004-10-01

Full Text Available Abstract Background Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. Results We describe the implementation of SS-Wrapper (Similarity Search Wrapper, a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST that provides a complementary solution for BLAST searches when the database is too large to fit into

SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters.

Science.gov (United States)

Wang, Chunlin; Lefkowitz, Elliot J

2004-10-28

Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary. We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node. Used together

Investigation on the improvement of genetic algorithm for PWR loading pattern search and its benchmark verification

International Nuclear Information System (INIS)

Li Qianqian; Jiang Xiaofeng; Zhang Shaohong

2009-01-01

In this study, the age technique, the concepts of relativeness degree and worth function are exploited to improve the performance of genetic algorithm (GA) for PWR loading pattern search. Among them, the age technique endows the algorithm be capable of learning from previous search 'experience' and guides it to do a better search in the vicinity ora local optimal; the introduction of the relativeness degree checks the relativeness of two loading patterns before performing crossover between them, which can significantly reduce the possibility of prematurity of the algorithm; while the application of the worth function makes the algorithm be capable of generating new loading patterns based on the statistics of common features of evaluated good loading patterns. Numerical verification against a loading pattern search benchmark problem ora two-loop reactor demonstrates that the adoption of these techniques is able to significantly enhance the efficiency of the genetic algorithm while improves the quality of the final solution as well. (authors)

Parameter Search Algorithms for Microwave Radar-Based Breast Imaging: Focal Quality Metrics as Fitness Functions.

Science.gov (United States)

O'Loughlin, Declan; Oliveira, Bárbara L; Elahi, Muhammad Adnan; Glavin, Martin; Jones, Edward; Popović, Milica; O'Halloran, Martin

2017-12-06

Inaccurate estimation of average dielectric properties can have a tangible impact on microwave radar-based breast images. Despite this, recent patient imaging studies have used a fixed estimate although this is known to vary from patient to patient. Parameter search algorithms are a promising technique for estimating the average dielectric properties from the reconstructed microwave images themselves without additional hardware. In this work, qualities of accurately reconstructed images are identified from point spread functions. As the qualities of accurately reconstructed microwave images are similar to the qualities of focused microscopic and photographic images, this work proposes the use of focal quality metrics for average dielectric property estimation. The robustness of the parameter search is evaluated using experimental dielectrically heterogeneous phantoms on the three-dimensional volumetric image. Based on a very broad initial estimate of the average dielectric properties, this paper shows how these metrics can be used as suitable fitness functions in parameter search algorithms to reconstruct clear and focused microwave radar images.

Composite Differential Search Algorithm

Directory of Open Access Journals (Sweden)

Bo Liu

2014-01-01

Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.

Fractal Image Compression Based on High Entropy Values Technique

Directory of Open Access Journals (Sweden)

Douaa Younis Abbaas

2018-04-01

Full Text Available There are many attempts tried to improve the encoding stage of FIC because it consumed time. These attempts worked by reducing size of the search pool for pair range-domain matching but most of them led to get a bad quality, or a lower compression ratio of reconstructed image. This paper aims to present a method to improve performance of the full search algorithm by combining FIC (lossy compression and another lossless technique (in this case entropy coding is used. The entropy technique will reduce size of the domain pool (i. e., number of domain blocks based on the entropy value of each range block and domain block and then comparing the results of full search algorithm and proposed algorithm based on entropy technique to see each of which give best results (such as reduced the encoding time with acceptable values in both compression quali-ty parameters which are C. R (Compression Ratio and PSNR (Image Quality. The experimental results of the proposed algorithm proven that using the proposed entropy technique reduces the encoding time while keeping compression rates and reconstruction image quality good as soon as possible.

Prospects for R-Parity Conserving SUSY searches at the LHC

CERN Document Server

The ATLAS collaboration

2009-01-01

The talk reviews the current strategies to search for generic SUSY models with R-parity conservation in the ATLAS and CMS detectors at the LHC. The discovery reach in early data is presented for different search channels based on missing transverse momentum from undetected neutralinos and multiple jets. The talk will also describe the search for models of gauge-mediated supersymmetry breaking for which the NLSP is a neutralino decaying to a photon and a gravitino. In this scenario, the search strategy exploits the distinct signature of a non-pointing photon. Finally, we present recent work on techniques used to reconstruct the decays of SUSY particles at the LHC in early data, based on the selection of final-state exclusive decay chains.

Strong Production SUSY Searches at ATLAS and CMS

CERN Document Server

Marshall, Z L

2015-01-01

The results of searches for strongly-produced supersymmetry at the Large Hadron Collider by the ATLAS and CMS collaborations are presented. Several of the historically strongest zero-and one-lepton final state searches have been updated to include multi-bin fits and combinations. In addition, new two-lepton final state search results are shown from CMS and ATLAS, which show 2.6 and 3.0 standard deviation excesses, respectively, above the standard model expectation, albeit in different regions of phase space. Both collaborations have also shown new searches that cover areas uncovered by previous searches, in both searches for light stops and searches for stealth supersymmetry.

The search for charm, beauty, and truth at high energies. Vol. 16

International Nuclear Information System (INIS)

Bellini, G.; Ting, S.C.C.

1984-01-01

This book examines present experimental knowledge on branching ratios, lifetimes, cross sections, and production mechanisms of charm and heavy flavors. The bases of the theoretical ideas and predictions, and such experimental methods as triggers, techniques, and devices are discussed. Topics covered include the search for charm and beauty with e + e - beams, the search for charm and beauty at Fermilab, the search for charm with bubble chambers, the use of visual detectors in the search for charm and other flavors, lifetime measurements, live targets for lifetime measurements, production cross sections of charm and new flavors, high resolution vertex detectors to search for charm and other flavors, the search for heavy flavors, and special triggers to search for charm and heavy flavors. The contributors participated in the Europhysics Study Conference on High-Energy Physics held in Italy in 1981

Simulation to Support Local Search in Trajectory Optimization Planning

Science.gov (United States)

Morris, Robert A.; Venable, K. Brent; Lindsey, James

2012-01-01

NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploiting powerful search techniques coming from artificial intelligence coupled with simulation and field tests to design low-noise flight profiles which can be tested in simulation or through field tests. This paper investigates the use of simulation based on predictive physical models to facilitate the search for low-noise trajectories using a class of automated search algorithms called local search. A novel feature of this approach is the ability to incorporate constraints directly into the problem formulation that addresses passenger safety and comfort.

DNA polymorphisms revealed by the RAPD technique show differences between radionuclide-contaminated and uncontaminated mosquitofish populations

International Nuclear Information System (INIS)

Theodorakis, C.W.; Shugart, L.R.

1993-01-01

In 1977, approximately 250 Mosquitofish (Gambusia affines) were transplanted from a relatively uncontaminated site into a small pond on the Oak Ridge Reservation that is heavily contaminated with radionuclides. DNA polymorphisms, using the RAPD technique, were examined in order to determine if any genetic differentiation had occurred between the two populations. Also, fish from another radionuclide-contaminated population (White Oak Lake) and two unrelated non-contaminated populations were also examined. The RAPD (Randomly Amplified Polymorphic DNA) technique uses the polymerase chain reaction with a short oligonucleotide primer to produce DNA fragments of various lengths. When analyzed by gel electrophoresis, these fragments form banding patterns similar to DNA fingerprints. A total of 26 primers were used to produce DNA band patterns, many of which revealed population differences. In addition several primers revealed banding patterns which differentiated between the Crystal Springs and Pond 3513 populations. Furthermore, bands found at high frequency in Pond 3513 and White Oak Lake populations were absent or present at a lower frequency in the non-contaminated populations. For some primers, the contaminated populations showed more DNA bands per individual, and fish with more bands had fewer DNA strand breaks than the fish with fewer bands. These data will be discussed with relation to biomonitoring programs and evolution of resistance to genotoxins in natural populations

Mathematical programming solver based on local search

CERN Document Server

Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain

2014-01-01

This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...

PAPR Reduction of OFDM Signals by Novel Global Harmony Search in PTS Scheme

Directory of Open Access Journals (Sweden)

Hojjat Salehinejad

2012-01-01

Full Text Available The orthogonal frequency division multiplexing (OFDM modulation technique is one of the key strategies for multiuser signal transmission especially in smart grids and wind farms. This paper introduces an approach for peak-to-average power ratio (PAPR reduction of such signals based on novel global harmony search (NGHS and partial transmit sequence (PTS schemes. In PTS technique, the data block to be transmitted is partitioned into disjoint subblocks, which are combined using phase factors to minimize PAPR. The PTS requires an exhaustive search over all combinations of allowed phase factors. Therefore, with respect to the fast implementation and simplicity of NGHS technique, we could achieve significant reduction of PAPR.

The Effect of Search, Solve, Create, And Share (SSCS Learning Model towards Student’s Critical Thinking Skills

Directory of Open Access Journals (Sweden)

Burhanudin Milama

2017-11-01

Full Text Available The aim of this study is determine the effect of search, solve, create, and share (SSCS learning model on critical thinking skills of hydrocarbons and petroleum material. The method used in this study was quasi experimental design, with research design nonequivalent control group design. The sample was taken by purposive sampling and divided into two groups consist of control group and experimental group. The data gathering techniques in this study was through 8 items of essay test instrument which is analyzed by using t-test. The results of t-test data showed that tcount ttable or 16.36 1.980 at significance level 5%, value tcount lies in the region reject H0 and accept Ha. The result shows that there are significant search, solve, create, and share (SSCS learning model on student’s critical thinking skills.

A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles.

Science.gov (United States)

Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

2016-01-01

Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words.

A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles

Science.gov (United States)

Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

2016-01-01

Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words. PMID:27313605

Search For Trapped Antihydrogen

CERN Document Server

Andresen, Gorm B.; Baquero-Ruiz, Marcelo; Bertsche, William; Bowe, Paul D.; Bray, Crystal C.; Butler, Eoin; Cesar, Claudio L.; Chapman, Steven; Charlton, Michael; Fajans, Joel; Friesen, Tim; Fujiwara, Makoto C.; Gill, David R.; Hangst, Jeffrey S.; Hardy, Walter N.; Hayano, Ryugo S.; Hayden, Michael E.; Humphries, Andrew J.; Hydomako, Richard; Jonsell, Svante; Jorgensen, Lars V.; Kurchaninov, Lenoid; Lambo, Ricardo; Madsen, Niels; Menary, Scott; Nolan, Paul; Olchanski, Konstantin; Olin, Art; Povilus, Alexander; Pusa, Petteri; Robicheaux, Francis; Sarid, Eli; Nasr, Sarah Seif El; Silveira, Daniel M.; So, Chukman; Storey, James W.; Thompson, Robert I.; van der Werf, Dirk P.; Wilding, Dean; Wurtele, Jonathan S.; Yamazaki, Yasunori

2011-01-01

We present the results of an experiment to search for trapped antihydrogen atoms with the ALPHA antihydrogen trap at the CERN Antiproton Decelerator. Sensitive diagnostics of the temperatures, sizes, and densities of the trapped antiproton and positron plasmas have been developed, which in turn permitted development of techniques to precisely and reproducibly control the initial experimental parameters. The use of a position-sensitive annihilation vertex detector, together with the capability of controllably quenching the superconducting magnetic minimum trap, enabled us to carry out a high-sensitivity and low-background search for trapped synthesised antihydrogen atoms. We aim to identify the annihilations of antihydrogen atoms held for at least 130 ms in the trap before being released over ~30 ms. After a three-week experimental run in 2009 involving mixing of 10^7 antiprotons with 1.3 10^9 positrons to produce 6 10^5 antihydrogen atoms, we have identified six antiproton annihilation events that are consist...

Universal Keyword Classifier on Public Key Based Encrypted Multikeyword Fuzzy Search in Public Cloud.

Science.gov (United States)

Munisamy, Shyamala Devi; Chokkalingam, Arun

2015-01-01

Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider's premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization.

User Oriented Trajectory Search for Trip Recommendation

KAUST Repository

Ding, Ruogu

2012-07-08

Trajectory sharing and searching have received significant attention in recent years. In this thesis, we propose and investigate the methods to find and recommend the best trajectory to the traveler, and mainly focus on a novel technique named User Oriented Trajectory Search (UOTS) query processing. In contrast to conventional trajectory search by locations (spatial domain only), we consider both spatial and textual domains in the new UOTS query. Given a trajectory data set, the query input contains a set of intended places given by the traveler and a set of textual attributes describing the traveler’s preference. If a trajectory is connecting/close to the specified query locations, and the textual attributes of the trajectory are similar to the traveler’s preference, it will be recommended to the traveler. This type of queries can enable many popular applications such as trip planning and recommendation. There are two challenges in UOTS query processing, (i) how to constrain the searching range in two domains and (ii) how to schedule multiple query sources effectively. To overcome the challenges and answer the UOTS query efficiently, a novel collaborative searching approach is developed. Conceptually, the UOTS query processing is conducted in the spatial and textual domains alternately. A pair of upper and lower bounds are devised to constrain the searching range in two domains. In the meantime, a heuristic searching strategy based on priority ranking is adopted for scheduling the multiple query sources, which can further reduce the searching range and enhance the query efficiency notably. Furthermore, the devised collaborative searching approach can be extended to situations where the query locations are ordered. Extensive experiments are conducted on both real and synthetic trajectory data in road networks. Our approach is verified to be effective in reducing both CPU time and disk I/O time.

High Multiplicity Searches at the LHC Using Jet Masses

Energy Technology Data Exchange (ETDEWEB)

Hook, Anson; /SLAC /Stanford U., Appl. Phys. Dept.; Izaguirre, Eder; /SLAC /Stanford U., Phys. Dept.; Lisanti, Mariangela; /Princeton U.; Wacker, Jay G.; /SLAC /Stanford U., ITP

2012-04-24

This article introduces a new class of searches for physics beyond the Standard Model that improves the sensitivity to signals with high jet multiplicity. The proposed searches gain access to high multiplicity signals by reclustering events into large-radius, or 'fat', jets and by requiring that each event has multiple massive jets. This technique is applied to supersymmetric scenarios in which gluinos are pair-produced and then subsequently decay to final states with either moderate quantities of missing energy or final states without missing energy. In each of these scenarios, the use of jet mass improves the estimated reach in gluino mass by 20% to 50% over current LHC searches.

Searching for patterns in TJ-II time evolution signals

International Nuclear Information System (INIS)

Farias, G.; Dormido-Canto, S.; Vega, J.; Sanchez, J.; Duro, N.; Dormido, R.; Ochando, M.; Santos, M.; Pajares, G.

2006-01-01

Since fusion plasma experiments generate hundreds of signals, it is important for their analysis to have automatic mechanisms for searching for similarities and retrieving specific data from the signal database. This paper describes a technique for searching in the TJ-II database that combines support vector machines and similarity query methods. Firstly, plasma signals are pre-processed by wavelet transform or discrete Fourier transform to reduce the dimensionality of the problem and to extract their main features. Secondly, support vector machines are used to classify a set of signals by reference to an input signal. Finally, similarity query methods (Euclidean distance and bounding envelope) are used to search the set of signals that best matches the input signal

Results from searches for exotic phenomena

CERN Document Server

Martyniuk, Alex; The ATLAS collaboration

2017-01-01

This talk will review the current state of experimental searches for "exotic" physics beyond the standard model of particle physics. The talk will cover a wide range of searches from ATLAS and CMS, in a (hopefully) jargon free pedagogical fashion, showing the big picture of the field at this time.

Study of order effects in the search for information on the Web: the case of an experiment about smoking cessation techniques

Directory of Open Access Journals (Sweden)

Stéphane AMATO

2013-07-01

Full Text Available This article deals with cognitive biases that could affect the judgment of net surfers while reading a list of answers, after a query in a search engine. The hypothesis is made that order effects i.e primacy and/or recency could be observed in such contexts. The authors choose to test it by doing an experiment in controlled-environment. So they decide to focus more particularly on the field of smoking cessation techniques and refine their questioning as follows: After a query into a search engine, does the place of a medication in a list determines the idea of its relevance, for a student population? By comparing three different groups, the authors demonstrate a primacy effect and no recency effect. In addition, they highlight five moderating variables: sex of the individual, the fact that he is a smoker or not, the fact that he had, or not, originally any opinion about methods of smoking cessation, the fact whether or not he is affected by health problems related to smoking, speed reading on the Web interface. The authors conclude speaking in favour of information literacy education. For them, in the case presented, it would be relevant as a medical point of view, in terms of public health, as a point of socio-economic development.

Search for an in-line nitric acid analyzer

International Nuclear Information System (INIS)

Gallagher, K.Y.; Johnson, C.M.

1980-10-01

A literature search was conducted to identify possible techniques for measuring mineral acid normality in the presence of heavy metal salts, undissolved solids, and high radiation fields. Of the techniques noted, eight were identified that could be applicable to the objective. The possibilities were reduced to two methods, which warrant further investigation. These two are refractometry and a modified coulometric-polarographic method. All methods are discussed in detail followed by rationale for including or rejecting each for further investigation

Search-based model identification of smart-structure damage

Science.gov (United States)

Glass, B. J.; Macalou, A.

1991-01-01

This paper describes the use of a combined model and parameter identification approach, based on modal analysis and artificial intelligence (AI) techniques, for identifying damage or flaws in a rotating truss structure incorporating embedded piezoceramic sensors. This smart structure example is representative of a class of structures commonly found in aerospace systems and next generation space structures. Artificial intelligence techniques of classification, heuristic search, and an object-oriented knowledge base are used in an AI-based model identification approach. A finite model space is classified into a search tree, over which a variant of best-first search is used to identify the model whose stored response most closely matches that of the input. Newly-encountered models can be incorporated into the model space. This adaptativeness demonstrates the potential for learning control. Following this output-error model identification, numerical parameter identification is used to further refine the identified model. Given the rotating truss example in this paper, noisy data corresponding to various damage configurations are input to both this approach and a conventional parameter identification method. The combination of the AI-based model identification with parameter identification is shown to lead to smaller parameter corrections than required by the use of parameter identification alone.

User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.

Science.gov (United States)

Ensor, Pat

1992-01-01

Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…

BIOMedical Search Engine Framework: Lightweight and customized implementation of domain-specific biomedical search engines.

Science.gov (United States)

Jácome, Alberto G; Fdez-Riverola, Florentino; Lourenço, Anália

2016-07-01

Text mining and semantic analysis approaches can be applied to the construction of biomedical domain-specific search engines and provide an attractive alternative to create personalized and enhanced search experiences. Therefore, this work introduces the new open-source BIOMedical Search Engine Framework for the fast and lightweight development of domain-specific search engines. The rationale behind this framework is to incorporate core features typically available in search engine frameworks with flexible and extensible technologies to retrieve biomedical documents, annotate meaningful domain concepts, and develop highly customized Web search interfaces. The BIOMedical Search Engine Framework integrates taggers for major biomedical concepts, such as diseases, drugs, genes, proteins, compounds and organisms, and enables the use of domain-specific controlled vocabulary. Technologies from the Typesafe Reactive Platform, the AngularJS JavaScript framework and the Bootstrap HTML/CSS framework support the customization of the domain-oriented search application. Moreover, the RESTful API of the BIOMedical Search Engine Framework allows the integration of the search engine into existing systems or a complete web interface personalization. The construction of the Smart Drug Search is described as proof-of-concept of the BIOMedical Search Engine Framework. This public search engine catalogs scientific literature about antimicrobial resistance, microbial virulence and topics alike. The keyword-based queries of the users are transformed into concepts and search results are presented and ranked accordingly. The semantic graph view portraits all the concepts found in the results, and the researcher may look into the relevance of different concepts, the strength of direct relations, and non-trivial, indirect relations. The number of occurrences of the concept shows its importance to the query, and the frequency of concept co-occurrence is indicative of biological relations

Open meta-search with OpenSearch: a case study

OpenAIRE

O'Riordan, Adrian P.

2007-01-01

The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...

Obtention control bars patterns for a BWR using Tabo search

International Nuclear Information System (INIS)

Castillo, A.; Ortiz, J.J.; Alonso, G.; Morales, L.B.; Valle, E. del

2004-01-01

The obtained results when implementing the technique of tabu search, for to optimize patterns of control bars in a BWR type reactor, using the CM-PRESTO code are presented. The patterns of control bars were obtained for the designs of fuel reloads obtained in a previous work, using the same technique. The obtained results correspond to a cycle of 18 months using 112 fresh fuels enriched at the 3.53 of U-235. The used technique of tabu search, prohibits recently visited movements, in the position that correspond to the axial positions of the control bars, additionally the tiempo t abu matrix is used for to manage a size of variable tabu list and the objective function is punished with the frequency of the forbidden movements. The obtained patterns of control bars improve the longitude of the cycle with regard to the reference values and they complete the restrictions of safety. (Author)

Hard Ware Implementation of Diamond Search Algorithm for Motion Estimation and Object Tracking

International Nuclear Information System (INIS)

Hashimaa, S.M.; Mahmoud, I.I.; Elazm, A.A.

2009-01-01

Object tracking is very important task in computer vision. Fast search algorithms emerged as important search technique to achieve real time tracking results. To enhance the performance of these algorithms, we advocate the hardware implementation of such algorithms. Diamond search block matching motion estimation has been proposed recently to reduce the complexity of motion estimation. In this paper we selected the diamond search algorithm (DS) for implementation using FPGA. This is due to its fundamental role in all fast search patterns. The proposed architecture is simulated and synthesized using Xilinix and modelsim soft wares. The results agree with the algorithm implementation in Matlab environment.

A Dynamical System Approach to the Surface Search of Debris from MH370

Science.gov (United States)

Mancho, Ana M.; Garcia-Garrido, V. J.; Wiggins, S.; Mendoza, C.

2015-11-01

The disappearance of Malaysia Airlines flight MH370 on the morning of the 8th of March 2014 is one of the great mysteries of our time. One relevant aspect of this mystery is that not a single piece of debris from the aircraft was found during the intensive surface search carried out in the months following the crash. Difficulties in the search efforts, due to the uncertainty in the plane's final impact point and the time passed since the accident, brought the question on how the debris was scattered in an always moving ocean, for which there were multiple datasets that do not uniquely determined its state. Our approach to this problem is based on dynamical systems tools that identify dynamic barriers and coherent structures governing transport. By combining different ocean data with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the search services and determining regions where one might have expected impact debris to be located and that have not been subjected to any exploration. This research has been supported by MINECO under grants MTM2014-56392-R and ICMAT Severo Ochoa project SEV-2011-0087 and ONR grant No. N00014- 01-1-0769. Computational support from CESGA is acknowledged.

People Recognition for Loja ECU911 applying artificial vision techniques

Directory of Open Access Journals (Sweden)

Diego Cale

2016-05-01

Full Text Available This article presents a technological proposal based on artificial vision which aims to search people in an intelligent way by using IP video cameras. Currently, manual searching process is time and resource demanding in contrast to automated searching one, which means that it could be replaced. In order to obtain optimal results, three different techniques of artificial vision were analyzed (Eigenfaces, Fisherfaces, Local Binary Patterns Histograms. The selection process considered factors like lighting changes, image quality and changes in the angle of focus of the camera. Besides, a literature review was conducted to evaluate several points of view regarding artificial vision techniques.

Extrasolar planets searches today and tomorrow

CERN Multimedia

2000-01-01

So far the searches for extrasolar planets have found 40 planetary companions orbiting around nearby stars. In December 1999 a transit has been observed for one of them, providing the first independent confirmation of the reality of close-in planets as well as a measurement of its density. The techniques used to detect planets are limited and the detection threshold is biased but a first picture of the planet diversity and distribution emerges. Results of the search for extra-solar planets and their impacts on planetary formation will be reviewed. Future instruments are foreseen to detect Earth-like planets and possible signatures of organic activity. An overview of these future projects will be presented and more particularly the Darwin-IRSI mission studied by ESA for Horizon 2015.

Revisiting the Practicality of Search on Encrypted Data: From the Security Broker’s Perspective

Directory of Open Access Journals (Sweden)

Peiyi Han

2016-01-01

Full Text Available The primary business challenge for the customers to use outsourced computation and storage is the loss of data control and security. So encryption will become a commodity in the near future. There is big diffusion with the above scenario: take advantage of current application’s full functionalities at the same time ensuring their sensitive data remains protected and under customers’ control. Prior works have achieved effective progress towards satisfying both sides. But there are still some technical challenges, such as supporting file or data-stream based applications and supporting full-text and advanced searches. In this paper, a novel security broker based encrypted data search scheme, called Enc-YUN, is proposed, which transparently builds a reverse index at the security broker when the data flow is transmitted to the cloud. And search firstly takes place on the index, in which the mapping structure corresponds to and retrieves the very encrypted data in the cloud on behalf of the client. With this scheme, updated-to-date full-text search techniques can be easily integrated to carry out the most advanced search functionalities, at the same time, maintaining the strongest levels of data protection from curious providers or third parties. Experimental results show that Enc-YUN is effective with broad categories of cloud applications, and the performance overhead induced is minor and acceptable according to user’s perceptual experience.

Google Searches for "Cheap Cigarettes" Spike at Tax Increases: Evidence from an Algorithm to Detect Spikes in Time Series Data.

Science.gov (United States)

Caputi, Theodore L

2018-05-03

Online cigarette dealers have lower prices than brick-and-mortar retailers and advertise tax-free status.1-8 Previous studies show smokers search out these online alternatives at the time of a cigarette tax increase.9,10 However, these studies rely upon researchers' decision to consider a specific date and preclude the possibility that researchers focus on the wrong date. The purpose of this study is to introduce an unbiased methodology to the field of observing search patterns and to use this methodology to determine whether smokers search Google for "cheap cigarettes" at cigarette tax increases and, if so, whether the increased level of searches persists. Publicly available data from Google Trends is used to observe standardized search volumes for the term, "cheap cigarettes". Seasonal Hybrid Extreme Studentized Deviate and E-Divisive with Means tests were performed to observe spikes and mean level shifts in search volume. Of the twelve cigarette tax increases studied, ten showed spikes in searches for "cheap cigarettes" within two weeks of the tax increase. However, the mean level shifts did not occur for any cigarette tax increase. Searches for "cheap cigarettes" spike around the time of a cigarette tax increase, but the mean level of searches does not shift in response to a tax increase. The SHESD and EDM tests are unbiased methodologies that can be used to identify spikes and mean level shifts in time series data without an a priori date to be studied. SHESD and EDM affirm spikes in interest are related to tax increases. • Applies improved statistical techniques (SHESD and EDM) to Google search data related to cigarettes, reducing bias and increasing power • Contributes to the body of evidence that state and federal tax increases are associated with spikes in searches for cheap cigarettes and may be good dates for increased online health messaging related to tobacco.

Exposure to arousal-inducing sounds facilitates visual search.

Science.gov (United States)

Asutay, Erkin; Västfjäll, Daniel

2017-09-04

Exposure to affective stimuli could enhance perception and facilitate attention via increasing alertness, vigilance, and by decreasing attentional thresholds. However, evidence on the impact of affective sounds on perception and attention is scant. Here, a novel aspect of affective facilitation of attention is studied: whether arousal induced by task-irrelevant auditory stimuli could modulate attention in a visual search. In two experiments, participants performed a visual search task with and without auditory-cues that preceded the search. Participants were faster in locating high-salient targets compared to low-salient targets. Critically, search times and search slopes decreased with increasing auditory-induced arousal while searching for low-salient targets. Taken together, these findings suggest that arousal induced by sounds can facilitate attention in a subsequent visual search. This novel finding provides support for the alerting function of the auditory system by showing an auditory-phasic alerting effect in visual attention. The results also indicate that stimulus arousal modulates the alerting effect. Attention and perception are our everyday tools to navigate our surrounding world and the current findings showing that affective sounds could influence visual attention provide evidence that we make use of affective information during perceptual processing.

Search for the Standard Model Higgs Boson associated with a W Boson using Matrix Element Technique in the CDF detector at the Tevatron

Energy Technology Data Exchange (ETDEWEB)

Gonzalez, Barbara Alvarez [Univ. of Oviedo (Spain)

2010-05-01

In this thesis a direct search for the Standard Model Higgs boson production in association with a W boson at the CDF detector in the Tevatron is presented. This search contributes predominantly in the region of low mass Higgs region, when the mass of Higgs boson is less than about 135 GeV. The search is performed in a final state where the Higgs boson decays into two b quarks, and the W boson decays leptonically, to a charged lepton (it can be an electron or a muon) and a neutrino. This work is organized as follows. Chapter 2 gives an overview of the Standard Model theory of particle physics and presents the SM Higgs boson search results at LEP, and the Tevatron colliders, as well as the prospects for the SM Higgs boson searches at the LHC. The dataset used in this analysis corresponds to 4.8 fb^-1 of integrated luminosity of p$\\bar{p}$ collisions at a center of mass energy of 1.96 TeV. That is the luminosity acquired between the beginning of the CDF Run II experiment, February 2002, and May 2009. The relevant aspects, for this analysis, of the Tevatron accelerator and the CDF detector are shown in Chapter 3. In Chapter 4 the particles and observables that make up the WH final state, electrons, muons, E_T, and jets are presented. The CDF standard b-tagging algorithms to identify b jets, and the neural network flavor separator to distinguish them from other flavor jets are also described in Chapter 4. The main background contributions are those coming from heavy flavor production processes, such as those coming from Wbb, Wcc or Wc and tt. The signal and background signatures are discussed in Chapter 5 together with the Monte CArlo generators that have been used to simulate almost all the events used in this thesis. WH candidate events have a high-p_T lepton (electron or muon), high missing transverse energy, and two or more than two jets in the final state. Chapter 6 describes the event selection applied in this analysis and the

Self Esteem, Information Search and Problem Solving Efficiency.

Science.gov (United States)

1979-05-01

Weiss (1977, 1978) has shown that low self esteem workers are more likely to model the role behaviors and work values of superiors than are high self ...task where search is functional. Results showed that, as expected, low self esteem subjects searched for more information, search was functional and low ...situation. He has also argued that high self esteem individuals search for less information on problem solving tasks and are therefore less likely to

Non-contact method of search and analysis of pulsating vessels

Science.gov (United States)

Avtomonov, Yuri N.; Tsoy, Maria O.; Postnov, Dmitry E.

2018-04-01

Despite the variety of existing methods of recording the human pulse and a solid history of their development, there is still considerable interest in this topic. The development of new non-contact methods, based on advanced image processing, caused a new wave of interest in this issue. We present a simple but quite effective method for analyzing the mechanical pulsations of blood vessels lying close to the surface of the skin. Our technique is a modification of imaging (or remote) photoplethysmography (i-PPG). We supplemented this method with the addition of a laser light source, which made it possible to use other methods of searching for the proposed pulsation zone. During the testing of the method, several series of experiments were carried out with both artificial oscillating objects as well as with the target signal source (human wrist). The obtained results show that our method allows correct interpretation of complex data. To summarize, we proposed and tested an alternative method for the search and analysis of pulsating vessels.

Prospects for R-Parity Conserving SUSY searches at the LHC

CERN Document Server

Genest, Marie-Helene

2009-01-01

We review the current strategies to search for generic SUSY models with R-parity conservation in the ATLAS and CMS detectors at the LHC. The discovery reach in early data will be presented for the different search channels based on missing transverse momentum from undetected neutralinos and multiple jets. We will also describe the search for models of gauge-mediated supersymmetry breaking for which the NLSP is a neutralino decaying to a photon and a gravitino. Finally, we will present recent work on techniques used to reconstruct the decays of SUSY particles at the LHC in early data, based on the selection of final-state exclusive decay chains.

How Do Children Reformulate Their Search Queries?

Science.gov (United States)

Rutter, Sophie; Ford, Nigel; Clough, Paul

2015-01-01

Introduction: This paper investigates techniques used by children in year 4 (age eight to nine) of a UK primary school to reformulate their queries, and how they use information retrieval systems to support query reformulation. Method: An in-depth study analysing the interactions of twelve children carrying out search tasks in a primary school…

Using Fuzz Testing for Searching Software Vulnerabilities

Directory of Open Access Journals (Sweden)

Bogdan Leonidovich Kozirsky

2014-12-01

Full Text Available This article deals with fuzz testing (fuzzing, a software testing and vulnerability searching technique based on providing inputs of programs with random data and further analysis of their behavior. The basics of implementing cmdline argument fuzzer, environment variable fuzzer and syscall fuzzer in any UNIX-like OS have been closely investigated.

ATLAS Searches for VH, HH, VV, V+gamma/gammagamma Resonances

CERN Document Server

Biesuz, Nicolo Vladi; The ATLAS collaboration

2017-01-01

The discovery of a Higgs boson at the Large Hadron Collider (LHC) motivates searches for physics beyond the Standard Model (SM) in channels involving coupling to the Higgs boson. A search for a massive resonance decaying into a standard model Higgs boson (h) and a W or Z boson or two a standard model Higgs bosons is performed. Final states with different number of leptons or photons and where in many cases at least one Higgs decays into a b-quark pair are studied using different jet reconstruction techniques which are complementary in their acceptance for low and high mass transverse momentum. This talk summarizes ATLAS searches for diboson resonances including at least one h boson in the final state and searches for resonant and non-resonant di-Higgs production with LHC Run 2 data.

Visual search asymmetries within color-coded and intensity-coded displays.

Science.gov (United States)

Yamani, Yusuke; McCarley, Jason S

2010-06-01

Color and intensity coding provide perceptual cues to segregate categories of objects within a visual display, allowing operators to search more efficiently for needed information. Even within a perceptually distinct subset of display elements, however, it may often be useful to prioritize items representing urgent or task-critical information. The design of symbology to produce search asymmetries (Treisman & Souther, 1985) offers a potential technique for doing this, but it is not obvious from existing models of search that an asymmetry observed in the absence of extraneous visual stimuli will persist within a complex color- or intensity-coded display. To address this issue, in the current study we measured the strength of a visual search asymmetry within displays containing color- or intensity-coded extraneous items. The asymmetry persisted strongly in the presence of extraneous items that were drawn in a different color (Experiment 1) or a lower contrast (Experiment 2) than the search-relevant items, with the targets favored by the search asymmetry producing highly efficient search. The asymmetry was attenuated but not eliminated when extraneous items were drawn in a higher contrast than search-relevant items (Experiment 3). Results imply that the coding of symbology to exploit visual search asymmetries can facilitate visual search for high-priority items even within color- or intensity-coded displays. PsycINFO Database Record (c) 2010 APA, all rights reserved.

Monte-Carlo Tree Search by Best Arm Identification

NARCIS (Netherlands)

E. Kaufmann (Emilie); W.M. Koolen-Wijkstra (Wouter)

2017-01-01

textabstractRecent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal is to quickly identify the optimal move in a

Monte-Carlo tree search by best arm identification

NARCIS (Netherlands)

E. Kaufmann (Emilie); W.M. Koolen-Wijkstra (Wouter)

2017-01-01

textabstractRecent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal is to quickly identify the optimal move in a

The FLARES project: An innovative detector technology for rare events searches

Energy Technology Data Exchange (ETDEWEB)

Capelli, S., E-mail: capelli@mib.infn.it [Dipatimento di Fisica, Università di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); INFN Sezione di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); Baldazzi, G. [Università di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); INFN Sezione di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); Beretta, M. [Dipatimento di Fisica, Università di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); INFN Sezione di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); Bonvicini, V. [Dipartimento di Scienza dei Materiali, Università di Milano Bicocca, Via Roberto Cozzi 55, 20126 Milano (Italy); Campana, R. [Università di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); INFN Sezione di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); Evangelista, Y. [INAF - IAPS, Via del Fosso del Cavaliere 100, I-00133, Roma (Italy); INFN Sezione di Roma Tor Vergata, Via della Ricerca Scientifica 1, I-00133 Roma (Italy); Fasoli, M. [INFN Sezione di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); Dipartimento di Scienza dei Materiali, Università di Milano Bicocca, Via Roberto Cozzi 55, 20126 Milano (Italy); Feroci, M. [INAF - IAPS, Via del Fosso del Cavaliere 100, I-00133, Roma (Italy); INFN Sezione di Roma Tor Vergata, Via della Ricerca Scientifica 1, I-00133 Roma (Italy); Fuschino, F. [INFN Sezione di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); Università di Bologna, Viale Berti Pichat 6/2, 40127 Bologna (Italy); Gironi, L. [Dipatimento di Fisica, Università di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); INFN Sezione di Milano Bicocca, piazza della Scienza 3, 20126 Milano (Italy); and others

2017-02-11

FLARES is an innovative project in the field of rare events searches, such as the search for the neutrinoless double beta decay. It aims at demonstrating the high potential of a technique that combines ultra-pure scintillating crystals with arrays of high performance silicon drift detectors, operated at about 120 K, to reach a 1% level energy resolution. The proposed technique will combine in a single device all the demanding features needed by an ideal experiment looking for rare events. The performance of a first production of matrices of silicon drift detectors as well as first measurements of the low temperature light yield of a selection of high purity scintillating crystals will be presented and discussed.

Interaction-aided continuous time quantum search

International Nuclear Information System (INIS)

Bae, Joonwoo; Kwon, Younghun; Baek, Inchan; Yoon, Dalsun

2005-01-01

The continuous quantum search algorithm (based on the Farhi-Gutmann Hamiltonian evolution) is known to be analogous to the Grover (or discrete time quantum) algorithm. Any errors introduced in Grover algorithm are fatal to its success. In the same way the Farhi-Gutmann Hamiltonian algorithm has a severe difficulty when the Hamiltonian is perturbed. In this letter we will show that the interaction term in quantum search Hamiltonian (actually which is in the generalized quantum search Hamiltonian) can save the perturbed Farhi-Gutmann Hamiltonian that should otherwise fail. We note that this fact is quite remarkable since it implies that introduction of interaction can be a way to correct some errors on the continuous time quantum search

Alephweb: a search engine based on the federated structure ...

African Journals Online (AJOL)

Revue d'Information Scientifique et Technique. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 7, No 1 (1997) >. Log in or Register to get access to full text downloads.

THE QUASIPERIODIC AUTOMATED TRANSIT SEARCH ALGORITHM

International Nuclear Information System (INIS)

Carter, Joshua A.; Agol, Eric

2013-01-01

We present a new algorithm for detecting transiting extrasolar planets in time-series photometry. The Quasiperiodic Automated Transit Search (QATS) algorithm relaxes the usual assumption of strictly periodic transits by permitting a variable, but bounded, interval between successive transits. We show that this method is capable of detecting transiting planets with significant transit timing variations without any loss of significance— s mearing — as would be incurred with traditional algorithms; however, this is at the cost of a slightly increased stochastic background. The approximate times of transit are standard products of the QATS search. Despite the increased flexibility, we show that QATS has a run-time complexity that is comparable to traditional search codes and is comparably easy to implement. QATS is applicable to data having a nearly uninterrupted, uniform cadence and is therefore well suited to the modern class of space-based transit searches (e.g., Kepler, CoRoT). Applications of QATS include transiting planets in dynamically active multi-planet systems and transiting planets in stellar binary systems.

Epsilon-Q: An Automated Analyzer Interface for Mass Spectral Library Search and Label-Free Protein Quantification.

Science.gov (United States)

Cho, Jin-Young; Lee, Hyoung-Joo; Jeong, Seul-Ki; Paik, Young-Ki

2017-12-01

Mass spectrometry (MS) is a widely used proteome analysis tool for biomedical science. In an MS-based bottom-up proteomic approach to protein identification, sequence database (DB) searching has been routinely used because of its simplicity and convenience. However, searching a sequence DB with multiple variable modification options can increase processing time, false-positive errors in large and complicated MS data sets. Spectral library searching is an alternative solution, avoiding the limitations of sequence DB searching and allowing the detection of more peptides with high sensitivity. Unfortunately, this technique has less proteome coverage, resulting in limitations in the detection of novel and whole peptide sequences in biological samples. To solve these problems, we previously developed the "Combo-Spec Search" method, which uses manually multiple references and simulated spectral library searching to analyze whole proteomes in a biological sample. In this study, we have developed a new analytical interface tool called "Epsilon-Q" to enhance the functions of both the Combo-Spec Search method and label-free protein quantification. Epsilon-Q performs automatically multiple spectral library searching, class-specific false-discovery rate control, and result integration. It has a user-friendly graphical interface and demonstrates good performance in identifying and quantifying proteins by supporting standard MS data formats and spectrum-to-spectrum matching powered by SpectraST. Furthermore, when the Epsilon-Q interface is combined with the Combo-Spec search method, called the Epsilon-Q system, it shows a synergistic function by outperforming other sequence DB search engines for identifying and quantifying low-abundance proteins in biological samples. The Epsilon-Q system can be a versatile tool for comparative proteome analysis based on multiple spectral libraries and label-free quantification.

NASA Indexing Benchmarks: Evaluating Text Search Engines

Science.gov (United States)

Esler, Sandra L.; Nelson, Michael L.

1997-01-01

The current proliferation of on-line information resources underscores the requirement for the ability to index collections of information and search and retrieve them in a convenient manner. This study develops criteria for analytically comparing the index and search engines and presents results for a number of freely available search engines. A product of this research is a toolkit capable of automatically indexing, searching, and extracting performance statistics from each of the focused search engines. This toolkit is highly configurable and has the ability to run these benchmark tests against other engines as well. Results demonstrate that the tested search engines can be grouped into two levels. Level one engines are efficient on small to medium sized data collections, but show weaknesses when used for collections 100MB or larger. Level two search engines are recommended for data collections up to and beyond 100MB.

Comparative analysis of some search engines

Directory of Open Access Journals (Sweden)

Taiwo O. Edosomwan

2010-10-01

Full Text Available We compared the information retrieval performances of some popular search engines (namely, Google, Yahoo, AlltheWeb, Gigablast, Zworks and AltaVista and Bing/MSN in response to a list of ten queries, varying in complexity. These queries were run on each search engine and the precision and response time of the retrieved results were recorded. The first ten documents on each retrieval output were evaluated as being ‘relevant’ or ‘non-relevant’ for evaluation of the search engine’s precision. To evaluate response time, normalised recall ratios were calculated at various cut-off points for each query and search engine. This study shows that Google appears to be the best search engine in terms of both average precision (70% and average response time (2 s. Gigablast and AlltheWeb performed the worst overall in this study.

Searches for new physics

International Nuclear Information System (INIS)

Ellis, J.; Pauss, F.

1989-01-01

The CERN p bar p Collider has been the first accelerator to operate in a completely new energy domain, reaching center-of-mass energies an order of magnitude larger than those previously available with the intersecting Storage Rings (ISR) at CERN, or with the Positron-Electron Tandem Ring Accelerator (PETRA) at DESY and the Positron-Electron Project (PEP) at SLAC. Naturally there has been great interest in the searches for new physics in this virgin territory. Theorists have approached these searches from either or both of two rival points of view. Either they have had an a priori prejudice as to what new physics should be searched for, and what its signatures should be, or they have tried to interpret a posteriori some experimental observations. The basic building-blocks of new physics in the 100 GeV energy domain are jets j, charged leptons l, photons γ, and missing transverse energy E T . Therefore searches have been conducted in channels which are combinations of these elements. It also shows some of the main a priori theoretical prejudices which can be explored in each of these channels. The layout of the rest of this paper is as follows. There are sections discussing each of the major prejudices: the Standard Model supersymmetry; extra gauge degrees of freedom; composite models; and other possibilities. Each of these sections contains a description of the motivations and characteristics of the new physics to be searched for, followed by a review of the searches made up to now at the CERN p bar p Collider. Finally, it summarizes the lessons to be learnt so far from searches for new physics at the CERN p bar p Collider, and previews some of the prospects for the next rounds of collider searches at CERN and FNAL

Adiabatic quantum search algorithm for structured problems

International Nuclear Information System (INIS)

Roland, Jeremie; Cerf, Nicolas J.

2003-01-01

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size

Searches with Boosted Objects at ATLAS and CMS

CERN Document Server

Behr, K; The ATLAS collaboration

2014-01-01

This talk presents an overview of searches for new physics in boosted final states conducted by the ATLAS and CMS experiments during Run-I of the LHC. An emphasis is put on techniques for the reconstruction and identification of both hadronic and leptonic decays of objects with large transverse momenta: Various substructure and grooming techniques as well as modified lepton isolation criteria are reviewed and their use in the most common algorithms for boosted top and boson tagging is discussed.

Minimum Time Search in Uncertain Dynamic Domains with Complex Sensorial Platforms

Science.gov (United States)

Lanillos, Pablo; Besada-Portas, Eva; Lopez-Orozco, Jose Antonio; de la Cruz, Jesus Manuel

2014-01-01

The minimum time search in uncertain domains is a searching task, which appears in real world problems such as natural disasters and sea rescue operations, where a target has to be found, as soon as possible, by a set of sensor-equipped searchers. The automation of this task, where the time to detect the target is critical, can be achieved by new probabilistic techniques that directly minimize the Expected Time (ET) to detect a dynamic target using the observation probability models and actual observations collected by the sensors on board the searchers. The selected technique, described in algorithmic form in this paper for completeness, has only been previously partially tested with an ideal binary detection model, in spite of being designed to deal with complex non-linear/non-differential sensorial models. This paper covers the gap, testing its performance and applicability over different searching tasks with searchers equipped with different complex sensors. The sensorial models under test vary from stepped detection probabilities to continuous/discontinuous differentiable/non-differentiable detection probabilities dependent on distance, orientation, and structured maps. The analysis of the simulated results of several static and dynamic scenarios performed in this paper validates the applicability of the technique with different types of sensor models. PMID:25093345

Search for vector-like quarks

CERN Document Server

Varnes, Erich; The ATLAS collaboration

2017-01-01

Vector like quarks appear in many theories beyond the Standard Model as a way to cancel the mass divergence for the Higgs boson. The current status of the ATLAS searches for the production of vector like quarks will be reviewed for proton-proton collisions at 13 TeV. This presentation will address the analysis techniques, in particular the selection criteria, the background modeling and the related experimental uncertainties. The phenomenological implications of the obtained results will also be discussed.

List search hardware for interpretive software

CERN Document Server

Altaber, Jacques; Mears, B; Rausch, R

1979-01-01

Interpreted languages, e.g. BASIC, are simple to learn, easy to use, quick to modify and in general 'user-friendly'. However, a critically time consuming process during interpretation is that of list searching. A special microprogrammed device for fast list searching has therefore been developed at the SPS Division of CERN. It uses bit- sliced hardware. Fast algorithms perform search, insert and delete of a six-character name and its value in a list of up to 1000 pairs. The prototype shows retrieval times of the order of 10-30 microseconds. (11 refs).

Radiotherapy Planning Using an Improved Search Strategy in Particle Swarm Optimization.

Science.gov (United States)

Modiri, Arezoo; Gu, Xuejun; Hagan, Aaron M; Sawant, Amit

2017-05-01

Evolutionary stochastic global optimization algorithms are widely used in large-scale, nonconvex problems. However, enhancing the search efficiency and repeatability of these techniques often requires well-customized approaches. This study investigates one such approach. We use particle swarm optimization (PSO) algorithm to solve a 4D radiation therapy (RT) inverse planning problem, where the key idea is to use respiratory motion as an additional degree of freedom in lung cancer RT. The primary goal is to administer a lethal dose to the tumor target while sparing surrounding healthy tissue. Our optimization iteratively adjusts radiation fluence-weights for all beam apertures across all respiratory phases. We implement three PSO-based approaches: conventionally used unconstrained, hard-constrained, and our proposed virtual search. As proof of concept, five lung cancer patient cases are optimized over ten runs using each PSO approach. For comparison, a dynamically penalized likelihood (DPL) algorithm-a popular RT optimization technique is also implemented and used. The proposed technique significantly improves the robustness to random initialization while requiring fewer iteration cycles to converge across all cases. DPL manages to find the global optimum in 2 out of 5 RT cases over significantly more iterations. The proposed virtual search approach boosts the swarm search efficiency, and consequently, improves the optimization convergence rate and robustness for PSO. RT planning is a large-scale, nonconvex optimization problem, where finding optimal solutions in a clinically practical time is critical. Our proposed approach can potentially improve the optimization efficiency in similar time-sensitive problems.

Searches for new resonances decaying into bosons with the ATLAS detector

CERN Document Server

Meehan, Samuel; The ATLAS collaboration

2016-01-01

Many extensions to the Standard Model predict new particles decaying into two bosons or jets. Searches for diboson resonances (WW, WZ, ZZ, WH, ZH, and HH) have been performed in final states with different numbers of leptons and using jets where new identification techniques to disentangle the decay products in highly boosted hadronic topologies are used. This talk summarizes ATLAS searches for such resonance signatures with LHC Run 2 data.

Cover times of random searches

Science.gov (United States)

Chupeau, Marie; Bénichou, Olivier; Voituriez, Raphaël

2015-10-01

How long must one undertake a random search to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not only the discovery of a single target. Examples range from immune-system cells chasing pathogens to animals harvesting resources, from robotic exploration for cleaning or demining to the task of improving search algorithms. Despite its broad relevance, the cover time has remained elusive and so far explicit results have been scarce and mostly limited to regular random walks. Here we determine the full distribution of the cover time for a broad range of random search processes, including Lévy strategies, intermittent strategies, persistent random walks and random walks on complex networks, and reveal its universal features. We show that for all these examples the mean cover time can be minimized, and that the corresponding optimal strategies also minimize the mean search time for a single target, unambiguously pointing towards their robustness.

Dual-target cost in visual search for multiple unfamiliar faces.

Science.gov (United States)

Mestry, Natalie; Menneer, Tamaryn; Cave, Kyle R; Godwin, Hayward J; Donnelly, Nick

2017-08-01

The efficiency of visual search for one (single-target) and either of two (dual-target) unfamiliar faces was explored to understand the manifestations of capacity and guidance limitations in face search. The visual similarity of distractor faces to target faces was manipulated using morphing (Experiments 1 and 2) and multidimensional scaling (Experiment 3). A dual-target cost was found in all experiments, evidenced by slower and less accurate search in dual- than single-target conditions. The dual-target cost was unequal across the targets, with performance being maintained on one target and reduced on the other, which we label "preferred" and "non-preferred" respectively. We calculated the capacity for each target face and show reduced capacity for representing the non-preferred target face. However, results show that the capacity for the non-preferred target can be increased when the dual-target condition is conducted after participants complete the single-target conditions. Analyses of eye movements revealed evidence for weak guidance of fixations in single-target search, and when searching for the preferred target in dual-target search. Overall, the experiments show dual-target search for faces is capacity- and guidance-limited, leading to superior search for 1 face over the other in dual-target search. However, learning faces individually may improve capacity with the second face. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Search Patterns

CERN Document Server

Morville, Peter

2010-01-01

What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

Universal Keyword Classifier on Public Key Based Encrypted Multikeyword Fuzzy Search in Public Cloud

Directory of Open Access Journals (Sweden)

Shyamala Devi Munisamy

2015-01-01

Full Text Available Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider’s premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization.

Neutral Supersymmetric Higgs Boson Searches

Energy Technology Data Exchange (ETDEWEB)

Robinson, Stephen Luke [Imperial College, London (United Kingdom)

2008-07-01

In some Supersymmetric extensions of the Standard Model, including the Minimal Supersymmetric Standard Model (MSSM), the coupling of Higgs bosons to b-quarks is enhanced. This enhancement makes the associated production of the Higgs with b-quarks an interesting search channel for the Higgs and Supersymmetry at D0. The identification of b-quarks, both online and offline, is essential to this search effort. This thesis describes the author's involvement in the development of both types of b-tagging and in the application of these techniques to the MSSM Higgs search. Work was carried out on the Level-3 trigger b-tagging algorithms. The impact parameter (IP) b-tagger was retuned and the effects of increased instantaneous luminosity on the tagger were studied. An extension of the IP-tagger to use the z-tracking information was developed. A new b-tagger using secondary vertices was developed and commissioned. A tool was developed to allow the use of large multi-run samples for trigger studies involving b-quarks. Offline, a neural network (NN) b-tagger was trained combining the existing offline lifetime based b-tagging tools. The efficiency and fake rate of the NN b-tagger were measured in data and MC. This b-tagger was internally reviewed and certified by the Collaboration and now provides the official b-tagging for all analyses using the Run IIa dataset at D0. A search was performed for neutral MSSM Higgs bosons decaying to a b{bar b} pair and produced in association with one or more b-quarks. Limits are set on the cross-section times the branching ratio for such a process. The limits were interpreted in various MSSM scenarios. This analysis uses the NN b-tagger and was the first to use this tool. The analysis also relies on triggers using the Level-3 IP b-tagging tool described previously. A likelihood discriminant was used to improve the analysis and a neural network was developed to cross-check this technique. The result of the analysis has been submitted to PRL

Optimization of refueling-shuffling scheme in PWR core by random search strategy

International Nuclear Information System (INIS)

Wu Yuan

1991-11-01

A random method for simulating optimization of refueling management in a pressurized water reactor (PWR) core is described. The main purpose of the optimization was to select the 'best' refueling arrangement scheme which would produce maximum economic benefits under certain imposed conditions. To fulfill this goal, an effective optimization strategy, two-stage random search method was developed. First, the search was made in a manner similar to the stratified sampling technique. A local optimum can be reached by comparison of the successive results. Then the other random experiences would be carried on between different strata to try to find the global optimum. In general, it can be used as a practical tool for conventional fuel management scheme. However, it can also be used in studies on optimization of Low-Leakage fuel management. Some calculations were done for a typical PWR core on a CYBER-180/830 computer. The results show that the method proposed can obtain satisfactory approach at reasonable low computational cost

Personalized Search

CERN Document Server

AUTHOR|(SzGeCERN)749939

2015-01-01

As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

A Search for Neutral Supersymmetric Higgs Bosons at DØ

Energy Technology Data Exchange (ETDEWEB)

Osman, Nicolas Ahmed [Imperial College, London (United Kingdom)

2010-09-01

A search for Higgs bosons in multijet data from the DØ detector is reported in this thesis. The Higgs boson is the only remaining undiscovered particle in the Standard Model of particle physics, and plays an integral role in this model. It is known that this model is not a complete description of fundamental physics (it does not describe gravity, for example), and so searches for physics beyond the Standard Model are an important part of particle physics. One extension of the Standard Model, the Minimal Supersymmetric Standard Model (MSSM), predicts the existence of five Higgs bosons, two of which can show an enhanced coupling to bottom quarks. For this reason, a search in the bbb (multijet) channel is a sensitive test of Higgs boson physics. The analysis described in this thesis was conducted over 6.6 fb^-1 of data. At the time of writing, the best limits on tan β (a key parameter of the MSSM) in the multijet channel were set by DØ. The new analysis described in this thesis included more data than the previous analysis in the channel, and made use of a new trigger and event-based analysis method. An improved Multivariate Analysis technique was used to separate signal and background events and produce a final discriminant for the limit setting process. These changes increased the expected sensitivity of this measurement by roughly 50% more than would be expected from the increase in the size of data sample alone.

Search for dark sectors in missing energy events

CERN Multimedia

Enik, T; Rubbia, A; Depero, E; Krasnikov, N; Petukhov, O; Kuleshov, S; Volkov, P; Trifonov, A; Radics, B; Toropin, A; Dermenev, A; Ahmed, N; Peshekhonov, D; Peshekhonov, V; Kekelidze, G; Dusaev, R; Vasilishin, B; Crivelli, P; Tlisov, D; Karjavine, V; Donskov, S; Lyubovitsky, V; Zhukov, K; Kirsanov, M; Karneyeu, A; Matveev, V; Lysan, V; Samoylenko, V

The NA64 experiment (known as P348 at the proposal stage) is a fixed-target experiment at the CERN SPS combining the active beam dump and missing energy techniques to search for rare events. The experiment will build and operate a fully hermetic detector placed on the H4 beam line with the primary goal to search for light dark bosons (Z') from dark sector that are coupled to photons, e.g. dark photons (A'), or sub-GeV Z' coupled only to quarks. In some cases the Z' is coupled only to µ or tau, so we call the Z′ the dark leptonic gauge boson. The experiment is also capable to search for K_L -> invisible decay, which is complementary to K+ -> π+ + ν ν, and invisible decays of π0, η, η′, K_S mesons.

Tokyo Motor Show 2003; Tokyo Motor Show 2003

Energy Technology Data Exchange (ETDEWEB)

Joly, E.

2004-01-01

The text which follows present the different techniques exposed during the 37. Tokyo Motor Show. The report points out the great tendencies of developments of the Japanese automobile industry. The hybrid electric-powered vehicles or those equipped with fuel cells have been highlighted by the Japanese manufacturers which allow considerable budgets in the research of less polluting vehicles. The exposed models, although being all different according to the manufacturer, use always a hybrid system: fuel cell/battery. The manufacturers have stressed too on the intelligent systems for navigation and safety as well as on the design and comfort. (O.M.)

Vasectomy occlusion techniques for male sterilization.

Science.gov (United States)

Cook, L A; Vliet, H; Pun, A; Gallo, M F

2004-01-01

Vasectomy is an increasingly popular and effective family planning method. A variety of vasectomy techniques are used worldwide including various vas occlusion techniques (excision and ligation, thermal or electrocautery, and mechanical and chemical occlusion methods), vas irrigation and fascial interposition. Vasectomy guidelines largely rely on information from observational studies. Ideally, the choice of vasectomy techniques should be based on the best available evidence from randomized controlled trials. The objective of this review was to compare the effectiveness, safety, acceptability and costs of vasectomy techniques for male sterilization. We searched the computerized databases the Cochrane Central Register of Controlled Trials (CENTRAL), MEDLINE, EMBASE, Popline and LILACS. In addition, we searched the reference lists of relevant articles and book chapters. We included randomized controlled trials and controlled clinical trials comparing vasectomy techniques. We assessed all titles and abstracts located in the literature searches and two reviewers independently extracted articles identified for inclusion. Data were presented in the text of the review. Outcome measures include contraceptive efficacy, safety, discontinuation, and acceptability. Two trials compared vas occlusion with clips versus a conventional vasectomy technique; both were of poor quality. Neither trial found a difference between the two groups with regard to the primary outcome of failure to reach azoospermia. Four trials examined vas irrigation: three compared water irrigation with no irrigation and one compared water irrigation with euflavine. All of the trials were of poor quality. None of the trials found a significant difference between the groups with respect to the primary outcome of time to azoospermia. However, one trial found that the median number of ejaculations to azoospermia was significantly lower in the euflavine group compared to the water irrigation group. The one trial

A Search for Free Fractional Electric Charge Elementary Particles

Energy Technology Data Exchange (ETDEWEB)

Halyo, Valerie

2000-12-04

A direct search was carried out in bulk matter for free fractional electric charge elementary particles using the largest mass single sample ever studied--about 17.4 mg of silicone oil. The search used an improved and highly automated Millikan oil drop technique. No evidence for fractional charge particles was found. The concentration of particles with fractional charge more than 0.16 e (e being the magnitude of the electron charge) from the nearest integer charge is less than 4.71 x 10{sup -22} particles per nucleon with 95% confidence.

A Search for Free Fractional Electric Charge Elementary Particles

Energy Technology Data Exchange (ETDEWEB)

Halyo, Valerie

2000-12-04

A direct search was carried out in bulk matter for free fractional electric charge elementary particles using the largest mass single sample ever studied| about 17.4 mg of silicone oil. The search used an improved and highly automated Millikan oil drop technique. No evidence for fractional charge particles was found. The concentration of particles with fractional charge more than 0.16 e (e being the magnitude of the electron charge) from the nearest integer charge is less than 4.71 x 10{sup -22} particles per nucleon with 95% confidence.

Pulsar searching and timing with the Parkes telescope

Science.gov (United States)

Ng, C. W. Y.

2014-11-01

Pulsars are highly magnetised, rapidly rotating neutron stars that radiate a beam of coherent radio emission from their magnetic poles. An introduction to the pulsar phenomenology is presented in Chapter 1 of this thesis. The extreme conditions found in and around such compact objects make pulsars fantastic natural laboratories, as their strong gravitational fields provide exclusive insights to a rich variety of fundamental physics and astronomy. The discovery of pulsars is therefore a gateway to new science. An overview of the standard pulsar searching technique is described in Chapter 2, as well as a discussion on notable pulsar searching efforts undertaken thus far with various telescopes. The High Time Resolution Universe (HTRU) Pulsar Survey conducted with the 64-m Parkes radio telescope in Australia forms the bulk of this PhD. In particular, the author has led the search effort of the HTRU low-latitude Galactic plane project part which is introduced in Chapter 3. We discuss the computational challenges arising from the processing of the petabyte-sized survey data. Two new radio interference mitigation techniques are introduced, as well as a partially-coherent segmented acceleration search algorithm which aims to increase our chances of discovering highly-relativistic short-orbit binary systems, covering a parameter space including the potential pulsar-black hole binaries. We show that under a linear acceleration approximation, a ratio of ~0.1 of data length over orbital period results in the highest effectiveness for this search algorithm. Chapter 4 presents the initial results from the HTRU low-latitude Galactic plane survey. From the 37 per cent of data processed thus far, we have re-detected 348 previously known pulsars and discovered a further 47 pulsars. Two of which are fast-spinning pulsars with periods less than 30 ms. PSR J1101-6424 is a millisecond pulsar (MSP) with a heavy white dwarf companion while its short spin period of 5 ms indicates

Measurements and searches with top quarks

International Nuclear Information System (INIS)

Peters, Reinhild Yvonne

2008-01-01

to search for charged or neutral Higgs bosons. Depending on its mass, the charged Higgs boson is expected to decay either into top quarks or be the decay product of a top quark. For masses below the top quark mass, the top decay into a charged Higgs boson and a b quark can occur at a certain rate, additionally to the decays into W bosons and a b quark. The different decays of W and charged Higgs bosons can lead to deviations of the observed final number of events in certain final states with respect to the Standard Model expectation. A global search for charged Higgs bosons in top quark pair events is presented in this thesis, resulting in the most stringent limits to-date. Besides the decay of top quarks into charged Higgs or W bosons, new physics can also show up in the quark part of the decay. While in the Standard Model the top quark decays with a rate of about 100% into a W boson and a b quark, there are models where the top quark can decay into a W boson and a non-b quark. The ratio of branching fractions in which the top quark decays into a b quark over the branching fractions in which the top quark decays into all quarks is measured as part of this thesis, yielding the most precise measurement today. Furthermore, the Standard Model top quark pair production cross section is essential to be known precisely since the top quark pair production is the main background for t(bar t)H production and many other Higgs and beyond the Standard Model searches. However, not only the search or the test of the Standard Model itself make the precise measurement of the top quark pair production cross section interesting. As the cross section is calculated with high accuracy in perturbative QCD, a comparison of the measurement to the theory expectation yields the possibility to extract the top quark mass from the cross section measurement. Although many dedicated techniques exist to measure the top quark mass, the extraction from the cross section represents an important

Job Search and Savings: Wealth Effects and Duration Dependence

DEFF Research Database (Denmark)

Lentz, Rasmus; Tranæs, Torben

2005-01-01

This article studies a risk‐averse worker’s optimal savings and job search behavior as she moves back and forth between employment and unemployment. We show that job search effort is negatively related to wealth under the assumption of additively separable utility. Consequently, job search exhibi...

Search Help

Science.gov (United States)

Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

Characterizing economic trends by Bayesian stochastic model specification search

DEFF Research Database (Denmark)

Grassi, Stefano; Proietti, Tommaso

We extend a recently proposed Bayesian model selection technique, known as stochastic model specification search, for characterising the nature of the trend in macroeconomic time series. In particular, we focus on autoregressive models with possibly time-varying intercept and slope and decide on ...

Search for anomalous kinematics in tt dilepton events at CDF II.

Science.gov (United States)

Acosta, D; Adelman, J; Affolder, T; Akimoto, T; Albrow, M G; Ambrose, D; Amerio, S; Amidei, D; Anastassov, A; Anikeev, K; Annovi, A; Antos, J; Aoki, M; Apollinari, G; Arisawa, T; Arguin, J-F; Artikov, A; Ashmanskas, W; Attal, A; Azfar, F; Azzi-Bacchetta, P; Bacchetta, N; Bachacou, H; Badgett, W; Barbaro-Galtieri, A; Barker, G J; Barnes, V E; Barnett, B A; Baroiant, S; Barone, M; Bauer, G; Bedeschi, F; Behari, S; Belforte, S; Bellettini, G; Bellinger, J; Ben-Haim, E; Benjamin, D; Beretvas, A; Bhatti, A; Binkley, M; Bisello, D; Bishai, M; Blair, R E; Blocker, C; Bloom, K; Blumenfeld, B; Bocci, A; Bodek, A; Bolla, G; Bolshov, A; Booth, P S L; Bortoletto, D; Boudreau, J; Bourov, S; Brau, B; Bromberg, C; Brubaker, E; Budagov, J; Budd, H S; Burkett, K; Busetto, G; Bussey, P; Byrum, K L; Cabrera, S; Campanelli, M; Campbell, M; Canepa, A; Casarsa, M; Carlsmith, D; Carron, S; Carosi, R; Cavalli-Sforza, M; Castro, A; Catastini, P; Cauz, D; Cerri, A; Cerrito, L; Chapman, J; Chen, C; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, I; Cho, K; Chokheli, D; Chou, J P; Chu, M L; Chuang, S; Chung, J Y; Chung, W-H; Chung, Y S; Ciobanu, C I; Ciocci, M A; Clark, A G; Clark, D; Coca, M; Connolly, A; Convery, M; Conway, J; Cooper, B; Cordelli, M; Cortiana, G; Cranshaw, J; Cuevas, J; Culbertson, R; Currat, C; Cyr, D; Dagenhart, D; Da Ronco, S; D'Auria, S; de Barbaro, P; De Cecco, S; De Lentdecker, G; Dell'Agnello, S; Dell'Orso, M; Demers, S; Demortier, L; Deninno, M; De Pedis, D; Derwent, P F; Dionisi, C; Dittmann, J R; Dörr, C; Doksus, P; Dominguez, A; Donati, S; Donega, M; Donini, J; D'Onofrio, M; Dorigo, T; Drollinger, V; Ebina, K; Eddy, N; Ehlers, J; Ely, R; Erbacher, R; Erdmann, M; Errede, D; Errede, S; Eusebi, R; Fang, H-C; Farrington, S; Fedorko, I; Fedorko, W T; Feild, R G; Feindt, M; Fernandez, J P; Ferretti, C; Field, R D; Flanagan, G; Flaugher, B; Flores-Castillo, L R; Foland, A; Forrester, S; Foster, G W; Franklin, M; Freeman, J C; Fujii, Y; Furic, I; Gajjar, A; Gallas, A; Galyardt, J; Gallinaro, M; Garcia-Sciveres, M; Garfinkel, A F; Gay, C; Gerberich, H; Gerdes, D W; Gerchtein, E; Giagu, S; Giannetti, P; Gibson, A; Gibson, K; Ginsburg, C; Giolo, K; Giordani, M; Giunta, M; Giurgiu, G; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Goldstein, D; Goldstein, J; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Gotra, Y; Goulianos, K; Gresele, A; Griffiths, M; Grosso-Pilcher, C; Grundler, U; Guenther, M; Guimaraes da Costa, J; Haber, C; Hahn, K; Hahn, S R; Halkiadakis, E; Hamilton, A; Han, B-Y; Handler, R; Happacher, F; Hara, K; Hare, M; Harr, R F; Harris, R M; Hartmann, F; Hatakeyama, K; Hauser, J; Hays, C; Hayward, H; Heider, E; Heinemann, B; Heinrich, J; Hennecke, M; Herndon, M; Hill, C; Hirschhbuehl, D; Hocker, A; Hoffman, K D; Holloway, A; Hou, S; Houlden, M A; Huffman, B T; Huang, Y; Hughes, R E; Huston, J; Ikado, K; Incandela, J; Introzzi, G; Iori, M; Ishizawa, Y; Issever, C; Ivanov, A; Iwata, Y; Iyutin, B; James, E; Jang, D; Jarrell, J; Jeans, D; Jensen, H; Jeon, E J; Jones, M; Joo, K K; Jun, S Y; Junk, T; Kamon, T; Kang, J; Karagoz Unel, M; Karchin, P E; Kartal, S; Kato, Y; Kemp, Y; Kephart, R; Kerzel, U; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, M S; Kim, S B; Kim, S H; Kim, T H; Kim, Y K; King, B T; Kirby, M; Kirsch, L; Klimenko, S; Knuteson, B; Ko, B R; Kobayashi, H; Koehn, P; Kong, D J; Kondo, K; Konigsberg, J; Kordas, K; Korn, A; Korytov, A; Kotelnikov, K; Kotwal, A V; Kovalev, A; Kraus, J; Kravchenko, I; Kreymer, A; Kroll, J; Kruse, M; Krutelyov, V; Kuhlmann, S E; Kwang, S; Laasanen, A T; Lai, S; Lami, S; Lammel, S; Lancaster, J; Lancaster, M; Lander, R; Lannon, K; Lath, A; Latino, G; Lauhakangas, R; Lazzizzera, I; Le, Y; Lecci, C; LeCompte, T; Lee, J; Lee, J; Lee, S W; Lefèvre, R; Leonardo, N; Leone, S; Levy, S; Lewis, J D; Li, K; Lin, C; Lin, C S; Lindgren, M; Liss, T M; Lister, A; Litvintsev, D O; Liu, T; Liu, Y; Lockyer, N S; Loginov, A; Loreti, M; Loverre, P; Lu, R-S; Lucchesi, D; Lujan, P; Lukens, P; Lungu, G; Lyons, L; Lys, J; Lysak, R; MacQueen, D; Madrak, R; Maeshima, K; Maksimovic, P; Malferrari, L; Manca, G; Marginean, R; Marino, C; Martin, A; Martin, M; Martin, V; Martínez, M; Maruyama, T; Matsunaga, H; Mattson, M; Mazzanti, P; McFarland, K S; McGivern, D; McIntyre, P M; McNamara, P; NcNulty, R; Mehta, A; Menzemer, S; Menzione, A; Merkel, P; Mesropian, C; Messina, A; Miao, T; Miladinovic, N; Miller, L; Miller, R; Miller, J S; Miquel, R; Miscetti, S; Mitselmakher, G; Miyamoto, A; Miyazaki, Y; Moggi, N; Mohr, B; Moore, R; Morello, M; Movilla Fernandez, P A; Mukherjee, A; Mulhearn, M; Muller, T; Mumford, R; Munar, A; Murat, P; Nachtman, J; Nahn, S; Nakamura, I; Nakano, I; Napier, A; Napora, R; Naumov, D; Necula, V; Niell, F; Nielsen, J; Nelson, C; Nelson, T; Neu, C; Neubauer, M S; Newman-Holmes, C; Nigmanov, T; Nodulman, L; Norniella, O; Oesterberg, K; Ogawa, T; Oh, S H; Oh, Y D; Ohsugi, T; Okusawa, T; Oldeman, R; Orava, R; Orejudos, W; Pagliarone, C; Palencia, E; Paoletti, R; Papadimitriou, V; Pashapour, S; Patrick, J; Pauletta, G; Paulini, M; Pauly, T; Paus, C; Pellett, D; Penzo, A; Phillips, T J; Piacentino, G; Piedra, J; Pitts, K T; Plager, C; Pompos, A; Pondrom, L; Pope, G; Portell, X; Poukhov, O; Prakoshyn, F; Pratt, T; Pronko, A; Proudfoot, J; Ptohos, F; Punzi, G; Rademachker, J; Rahaman, M A; Rakitine, A; Rappoccio, S; Ratnikov, F; Ray, H; Reisert, B; Rekovic, V; Renton, P; Rescigno, M; Rimondi, F; Rinnert, K; Ristori, L; Robertson, W J; Robson, A; Rodrigo, T; Rolli, S; Rosenson, L; Roser, R; Rossin, R; Rott, C; Russ, J; Rusu, V; Ruiz, A; Ryan, D; Saarikko, H; Sabik, S; Safonov, A; St Denis, R; Sakumoto, W K; Salamanna, G; Saltzberg, D; Sanchez, C; Sansoni, A; Santi, L; Sarkar, S; Sato, K; Savard, P; Savoy-Navarro, A; Schlabach, P; Schmidt, E E; Schmidt, M P; Schmitt, M; Scodellaro, L; Scribano, A; Scuri, F; Sedov, A; Seidel, S; Seiya, Y; Semeria, F; Sexton-Kennedy, L; Sfiligoi, I; Shapiro, M D; Shears, T; Shepard, P F; Sherman, D; Shimojima, M; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Siegrist, J; Siket, M; Sill, A; Sinervo, P; Sisakyan, A; Skiba, A; Slaughter, A J; Sliwa, K; Smirnov, D; Smith, J R; Snider, F D; Snihur, R; Soha, A; Somalwar, S V; Spalding, J; Spezziga, M; Spiegel, L; Spinella, F; Spiropulu, M; Squillacioti, P; Stadie, H; Stelzer, B; Stelzer-Chilton, O; Strologas, J; Stuart, D; Sukhanov, A; Sumorok, K; Sun, H; Suzuki, T; Taffard, A; Tafirout, R; Takach, S F; Takano, H; Takashima, R; Takeuchi, Y; Takikawa, K; Tanaka, M; Tanaka, R; Tanimoto, N; Tapprogge, S; Tecchio, M; Teng, P K; Terashi, K; Tesarek, R J; Tether, S; Thom, J; Thompson, A S; Thomson, E; Tipton, P; Tiwari, V; Trkaczyk, S; Toback, D; Tollefson, K; Tomura, T; Tonelli, D; Tönnesmann, M; Torre, S; Torretta, D; Tourneur, S; Trischuk, W; Tseng, J; Tsuchiya, R; Tsuno, S; Tsybychev, D; Turini, N; Turner, M; Ukegawa, F; Unverhau, T; Uozumi, S; Usynin, D; Vacavant, L; Vaiciulis, A; Varganov, A; Vataga, E; Vejcik, S; Velev, G; Veszpremi, V; Veramendi, G; Vickey, T; Vidal, R; Vila, I; Vilar, R; Vollrath, I; Volobouev, I; von der Mey, M; Wagner, P; Wagner, R G; Wagner, R L; Wagner, W; Wallny, R; Walter, T; Yamashita, T; Yamamoto, K; Wan, Z; Wang, M J; Wang, S M; Warburton, A; Ward, B; Waschke, S; Waters, D; Watts, T; Weber, M; Wester, W C; Whitehouse, B; Wicklund, A B; Wicklund, E; Williams, H H; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolter, M; Worcester, M; Worm, S; Wright, T; Wu, X; Würthwein, F; Wyatt, A; Yagil, A; Yang, C; Yang, U K; Yao, W; Yeh, G P; Yi, K; Yoh, J; Yoon, P; Yorita, K; Yoshida, T; Yu, I; Yu, S; Yu, Z; Yun, J C; Zanello, L; Zanetti, A; Zaw, I; Zetti, F; Zhou, J; Zsenei, A; Zucchelli, S

2005-07-08

We report on a search for anomalous kinematics of tt dilepton events in pp collisions at square root of s=1.96 TeV using 193 pb(-1) of data collected with the CDF II detector. We developed a new a priori technique designed to isolate the subset in a data sample revealing the largest deviation from standard model (SM) expectations and to quantify the significance of this departure. In the four-variable space considered, no particular subset shows a significant discrepancy, and we find that the probability of obtaining a data sample less consistent with the SM than what is observed is 1.0%-4.5%.

Visual search guidance is best after a short delay

OpenAIRE

Schmidt, Joseph; Zelinsky, Gregory J.

2011-01-01

Search displays are typically presented immediately after a target cue, but in the real-world, delays often exist between target designation and search. Experiments 1 and 2 asked how search guidance changes with delay. Targets were cued using a picture or text label, each for 3000ms, followed by a delay up to 9000ms before the search display. Search stimuli were realistic objects, and guidance was quantified using multiple eye movement measures. Text-based cues showed a non-significant trend ...

Document Clustering Approach for Meta Search Engine

Science.gov (United States)

Kumar, Naresh, Dr.

2017-08-01

The size of WWW is growing exponentially with ever change in technology. This results in huge amount of information with long list of URLs. Manually it is not possible to visit each page individually. So, if the page ranking algorithms are used properly then user search space can be restricted up to some pages of searched results. But available literatures show that no single search system can provide qualitative results from all the domains. This paper provides solution to this problem by introducing a new meta search engine that determine the relevancy of query corresponding to web page and cluster the results accordingly. The proposed approach reduces the user efforts, improves the quality of results and performance of the meta search engine.

Tales from the Field: Search Strategies Applied in Web Searching

Directory of Open Access Journals (Sweden)

Soohyung Joo

2010-08-01

Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.

Dark-matter QCD-axion searches.

Science.gov (United States)

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 long-lived heavy charged particles using a ring imaging Cherenkov technique at LHCb

CERN Document Server

Aaij, Roel; Adinolfi, Marco; Affolder, Anthony; Ajaltouni, Ziad; Akar, Simon; Albrecht, Johannes; Alessio, Federico; Alexander, Michael; Ali, Suvayu; Alkhazov, Georgy; Alvarez Cartelle, Paula; Alves Jr, Antonio Augusto; Amato, Sandra; Amerio, Silvia; Amhis, Yasmine; An, Liupan; Anderlini, Lucio; Anderson, Jonathan; Andreotti, Mirco; Andrews, Jason; Appleby, Robert; Aquines Gutierrez, Osvaldo; Archilli, Flavio; d'Argent, Philippe; Artamonov, Alexander; Artuso, Marina; Aslanides, Elie; Auriemma, Giulio; Baalouch, Marouen; Bachmann, Sebastian; Back, John; Badalov, Alexey; Baesso, Clarissa; Baldini, Wander; Barlow, Roger; Barschel, Colin; Barsuk, Sergey; Barter, William; Batozskaya, Varvara; Battista, Vincenzo; Bay, Aurelio; Beaucourt, Leo; Beddow, John; Bedeschi, Franco; Bediaga, Ignacio; Bel, Lennaert; Belyaev, Ivan; Ben-Haim, Eli; Bencivenni, Giovanni; Benson, Sean; Benton, Jack; Berezhnoy, Alexander; Bernet, Roland; Bertolin, Alessandro; Bettler, Marc-Olivier; van Beuzekom, Martinus; Bien, Alexander; Bifani, Simone; Bird, Thomas; Birnkraut, Alex; Bizzeti, Andrea; Blake, Thomas; Blanc, Frédéric; Blouw, Johan; Blusk, Steven; Bocci, Valerio; Bondar, Alexander; Bondar, Nikolay; Bonivento, Walter; Borghi, Silvia; Borgia, Alessandra; Borsato, Martino; Bowcock, Themistocles; Bowen, Espen Eie; Bozzi, Concezio; Brett, David; Britsch, Markward; Britton, Thomas; Brodzicka, Jolanta; Brook, Nicholas; Bursche, Albert; Buytaert, Jan; Cadeddu, Sandro; Calabrese, Roberto; Calvi, Marta; Calvo Gomez, Miriam; Campana, Pierluigi; Campora Perez, Daniel; Capriotti, Lorenzo; Carbone, Angelo; Carboni, Giovanni; Cardinale, Roberta; Cardini, Alessandro; Carniti, Paolo; Carson, Laurence; Carvalho Akiba, Kazuyoshi; Casanova Mohr, Raimon; Casse, Gianluigi; Cassina, Lorenzo; Castillo Garcia, Lucia; Cattaneo, Marco; Cauet, Christophe; Cavallero, Giovanni; Cenci, Riccardo; Charles, Matthew; Charpentier, Philippe; Chefdeville, Maximilien; Chen, Shanzhen; Cheung, Shu-Faye; Chiapolini, Nicola; Chrzaszcz, Marcin; Cid Vidal, Xabier; Ciezarek, Gregory; Clarke, Peter; Clemencic, Marco; Cliff, Harry; Closier, Joel; Coco, Victor; Cogan, Julien; Cogneras, Eric; Cogoni, Violetta; Cojocariu, Lucian; Collazuol, Gianmaria; Collins, Paula; Comerma-Montells, Albert; Contu, Andrea; Cook, Andrew; Coombes, Matthew; Coquereau, Samuel; Corti, Gloria; Corvo, Marco; Counts, Ian; Couturier, Benjamin; Cowan, Greig; Craik, Daniel Charles; Crocombe, Andrew; Cruz Torres, Melissa Maria; Cunliffe, Samuel; Currie, Robert; D'Ambrosio, Carmelo; Dalseno, Jeremy; David, Pieter; Davis, Adam; De Bruyn, Kristof; De Capua, Stefano; De Cian, Michel; De Miranda, Jussara; De Paula, Leandro; De Silva, Weeraddana; De Simone, Patrizia; Dean, Cameron Thomas; Decamp, Daniel; Deckenhoff, Mirko; Del Buono, Luigi; Déléage, Nicolas; Derkach, Denis; Deschamps, Olivier; Dettori, Francesco; Dey, Biplab; Di Canto, Angelo; Di Ruscio, Francesco; Dijkstra, Hans; Donleavy, Stephanie; Dordei, Francesca; Dorigo, Mirco; Dosil Suárez, Alvaro; Dossett, David; Dovbnya, Anatoliy; Dreimanis, Karlis; Dujany, Giulio; Dupertuis, Frederic; Durante, Paolo; Dzhelyadin, Rustem; Dziurda, Agnieszka; Dzyuba, Alexey; Easo, Sajan; Egede, Ulrik; Egorychev, Victor; Eidelman, Semen; Eisenhardt, Stephan; Eitschberger, Ulrich; Ekelhof, Robert; Eklund, Lars; El Rifai, Ibrahim; Elsasser, Christian; Ely, Scott; Esen, Sevda; Evans, Hannah Mary; Evans, Timothy; Falabella, Antonio; Färber, Christian; Farinelli, Chiara; Farley, Nathanael; Farry, Stephen; Fay, Robert; Ferguson, Dianne; Fernandez Albor, Victor; Ferrari, Fabio; Ferreira Rodrigues, Fernando; Ferro-Luzzi, Massimiliano; Filippov, Sergey; Fiore, Marco; Fiorini, Massimiliano; Firlej, Miroslaw; Fitzpatrick, Conor; Fiutowski, Tomasz; Fol, Philip; Fontana, Marianna; Fontanelli, Flavio; Forty, Roger; Francisco, Oscar; Frank, Markus; Frei, Christoph; Frosini, Maddalena; Fu, Jinlin; Furfaro, Emiliano; Gallas Torreira, Abraham; Galli, Domenico; Gallorini, Stefano; Gambetta, Silvia; Gandelman, Miriam; Gandini, Paolo; Gao, Yuanning; García Pardiñas, Julián; Garofoli, Justin; Garra Tico, Jordi; Garrido, Lluis; Gascon, David; Gaspar, Clara; Gauld, Rhorry; Gavardi, Laura; Gazzoni, Giulio; Geraci, Angelo; Gerick, David; Gersabeck, Evelina; Gersabeck, Marco; Gershon, Timothy; Ghez, Philippe; Gianelle, Alessio; Gianì, Sebastiana; Gibson, Valerie; Giubega, Lavinia-Helena; Gligorov, V.V.; Göbel, Carla; Golubkov, Dmitry; Golutvin, Andrey; Gomes, Alvaro; Gotti, Claudio; Grabalosa Gándara, Marc; Graciani Diaz, Ricardo; Granado Cardoso, Luis Alberto; Graugés, Eugeni; Graverini, Elena; Graziani, Giacomo; Grecu, Alexandru; Greening, Edward; Gregson, Sam; Griffith, Peter; Grillo, Lucia; Grünberg, Oliver; Gui, Bin; Gushchin, Evgeny; Guz, Yury; Gys, Thierry; Hadjivasiliou, Christos; Haefeli, Guido; Haen, Christophe; Haines, Susan; Hall, Samuel; Hamilton, Brian; Hampson, Thomas; Han, Xiaoxue; Hansmann-Menzemer, Stephanie; Harnew, Neville; Harnew, Samuel; Harrison, Jonathan; He, Jibo; Head, Timothy; Heijne, Veerle; Hennessy, Karol; Henrard, Pierre; Henry, Louis; Hernando Morata, Jose Angel; van Herwijnen, Eric; Heß, Miriam; Hicheur, Adlène; Hill, Donal; Hoballah, Mostafa; Hombach, Christoph; Hulsbergen, Wouter; Humair, Thibaud; Hussain, Nazim; Hutchcroft, David; Hynds, Daniel; Idzik, Marek; Ilten, Philip; Jacobsson, Richard; Jaeger, Andreas; Jalocha, Pawel; Jans, Eddy; Jawahery, Abolhassan; Jing, Fanfan; John, Malcolm; Johnson, Daniel; Jones, Christopher; Joram, Christian; Jost, Beat; Jurik, Nathan; Kandybei, Sergii; Kanso, Walaa; Karacson, Matthias; Karbach, Moritz; Karodia, Sarah; Kelsey, Matthew; Kenyon, Ian; Kenzie, Matthew; Ketel, Tjeerd; Khanji, Basem; Khurewathanakul, Chitsanu; Klaver, Suzanne; Klimaszewski, Konrad; Kochebina, Olga; Kolpin, Michael; Komarov, Ilya; Koopman, Rose; Koppenburg, Patrick; Kravchuk, Leonid; Kreplin, Katharina; Kreps, Michal; Krocker, Georg; Krokovny, Pavel; Kruse, Florian; Kucewicz, Wojciech; Kucharczyk, Marcin; Kudryavtsev, Vasily; Kurek, Krzysztof; Kvaratskheliya, Tengiz; La Thi, Viet Nga; Lacarrere, Daniel; Lafferty, George; Lai, Adriano; Lambert, Dean; Lambert, Robert W; Lanfranchi, Gaia; Langenbruch, Christoph; Langhans, Benedikt; Latham, Thomas; Lazzeroni, Cristina; Le Gac, Renaud; van Leerdam, Jeroen; Lees, Jean-Pierre; Lefèvre, Regis; Leflat, Alexander; Lefrançois, Jacques; Leroy, Olivier; Lesiak, Tadeusz; Leverington, Blake; Li, Yiming; Likhomanenko, Tatiana; Liles, Myfanwy; Lindner, Rolf; Linn, Christian; Lionetto, Federica; Liu, Bo; Lohn, Stefan; Longstaff, Iain; Lopes, Jose; Lucchesi, Donatella; Luo, Haofei; Lupato, Anna; Luppi, Eleonora; Lupton, Oliver; Machefert, Frederic; Machikhiliyan, Irina V; Maciuc, Florin; Maev, Oleg; Malde, Sneha; Malinin, Alexander; Manca, Giulia; Mancinelli, Giampiero; Manning, Peter Michael; Mapelli, Alessandro; Maratas, Jan; Marchand, Jean François; Marconi, Umberto; Marin Benito, Carla; Marino, Pietro; Märki, Raphael; Marks, Jörg; Martellotti, Giuseppe; Martinelli, Maurizio; Martinez Santos, Diego; Martinez Vidal, Fernando; Martins Tostes, Danielle; Massafferri, André; Matev, Rosen; Mathe, Zoltan; Matteuzzi, Clara; Mauri, Andrea; Maurin, Brice; Mazurov, Alexander; McCann, Michael; McCarthy, James; McNab, Andrew; McNulty, Ronan; McSkelly, Ben; Meadows, Brian; Meier, Frank; Meissner, Marco; Merk, Marcel; Milanes, Diego Alejandro; Minard, Marie-Noelle; Mitzel, Dominik Stefan; Molina Rodriguez, Josue; Monteil, Stephane; Morandin, Mauro; Morawski, Piotr; Mordà, Alessandro; Morello, Michael Joseph; Moron, Jakub; Morris, Adam Benjamin; Mountain, Raymond; Muheim, Franz; Müller, Janine; Müller, Katharina; Müller, Vanessa; Mussini, Manuel; Muster, Bastien; Naik, Paras; Nakada, Tatsuya; Nandakumar, Raja; Nasteva, Irina; Needham, Matthew; Neri, Nicola; Neubert, Sebastian; Neufeld, Niko; Neuner, Max; Nguyen, Anh Duc; Nguyen, Thi-Dung; Nguyen-Mau, Chung; Niess, Valentin; Niet, Ramon; Nikitin, Nikolay; Nikodem, Thomas; Novoselov, Alexey; O'Hanlon, Daniel Patrick; Oblakowska-Mucha, Agnieszka; Obraztsov, Vladimir; Ogilvy, Stephen; Okhrimenko, Oleksandr; Oldeman, Rudolf; Onderwater, Gerco; Osorio Rodrigues, Bruno; Otalora Goicochea, Juan Martin; Otto, Adam; Owen, Patrick; Oyanguren, Maria Aranzazu; Palano, Antimo; Palombo, Fernando; Palutan, Matteo; Panman, Jacob; Papanestis, Antonios; Pappagallo, Marco; Pappalardo, Luciano; Parkes, Christopher; Passaleva, Giovanni; Patel, Girish; Patel, Mitesh; Patrignani, Claudia; Pearce, Alex; Pellegrino, Antonio; Penso, Gianni; Pepe Altarelli, Monica; Perazzini, Stefano; Perret, Pascal; Pescatore, Luca; Petridis, Konstantinos; Petrolini, Alessandro; Picatoste Olloqui, Eduardo; Pietrzyk, Boleslaw; Pilař, Tomas; Pinci, Davide; Pistone, Alessandro; Playfer, Stephen; Plo Casasus, Maximo; Poikela, Tuomas; Polci, Francesco; Poluektov, Anton; Polyakov, Ivan; Polycarpo, Erica; Popov, Alexander; Popov, Dmitry; Popovici, Bogdan; Potterat, Cédric; Price, Eugenia; Price, Joseph David; Prisciandaro, Jessica; Pritchard, Adrian; Prouve, Claire; Pugatch, Valery; Puig Navarro, Albert; Punzi, Giovanni; Qian, Wenbin; Quagliani, Renato; Rachwal, Bartolomiej; Rademacker, Jonas; Rakotomiaramanana, Barinjaka; Rama, Matteo; Rangel, Murilo; Raniuk, Iurii; Rauschmayr, Nathalie; Raven, Gerhard; Redi, Federico; Reichert, Stefanie; Reid, Matthew; dos Reis, Alberto; Ricciardi, Stefania; Richards, Sophie; Rihl, Mariana; Rinnert, Kurt; Rives Molina, Vincente; Robbe, Patrick; Rodrigues, Ana Barbara; Rodrigues, Eduardo; Rodriguez Perez, Pablo; Roiser, Stefan; Romanovsky, Vladimir; Romero Vidal, Antonio; Rotondo, Marcello; Rouvinet, Julien; Ruf, Thomas; Ruiz, Hugo; Ruiz Valls, Pablo; Saborido Silva, Juan Jose; Sagidova, Naylya; Sail, Paul; Saitta, Biagio; Salustino Guimaraes, Valdir; Sanchez Mayordomo, Carlos; Sanmartin Sedes, Brais; Santacesaria, Roberta; Santamarina Rios, Cibran; Santovetti, Emanuele; Sarti, Alessio; Satriano, Celestina; Satta, Alessia; Saunders, Daniel Martin; Savrina, Darya; Schiller, Manuel; Schindler, Heinrich; Schlupp, Maximilian; Schmelling, Michael; Schmelzer, Timon; Schmidt, Burkhard; Schneider, Olivier; Schopper, Andreas; Schune, Marie Helene; Schwemmer, Rainer; Sciascia, Barbara; Sciubba, Adalberto; Semennikov, Alexander; Sepp, Indrek; Serra, Nicola; Serrano, Justine; Sestini, Lorenzo; Seyfert, Paul; Shapkin, Mikhail; Shapoval, Illya; Shcheglov, Yury; Shears, Tara; Shekhtman, Lev; Shevchenko, Vladimir; Shires, Alexander; Silva Coutinho, Rafael; Simi, Gabriele; Sirendi, Marek; Skidmore, Nicola; Skillicorn, Ian; Skwarnicki, Tomasz; Smith, Edmund; Smith, Eluned; Smith, Jackson; Smith, Mark; Snoek, Hella; Sokoloff, Michael; Soler, Paul; Soomro, Fatima; Souza, Daniel; Souza De Paula, Bruno; Spaan, Bernhard; Spradlin, Patrick; Sridharan, Srikanth; Stagni, Federico; Stahl, Marian; Stahl, Sascha; Steinkamp, Olaf; Stenyakin, Oleg; Sterpka, Christopher Francis; Stevenson, Scott; Stoica, Sabin; Stone, Sheldon; Storaci, Barbara; Stracka, Simone; Straticiuc, Mihai; Straumann, Ulrich; Stroili, Roberto; Sun, Liang; Sutcliffe, William; Swientek, Krzysztof; Swientek, Stefan; Syropoulos, Vasileios; Szczekowski, Marek; Szczypka, Paul; Szumlak, Tomasz; T'Jampens, Stephane; Tekampe, Tobias; Teklishyn, Maksym; Tellarini, Giulia; Teubert, Frederic; Thomas, Christopher; Thomas, Eric; van Tilburg, Jeroen; Tisserand, Vincent; Tobin, Mark; Todd, Jacob; Tolk, Siim; Tomassetti, Luca; Tonelli, Diego; Topp-Joergensen, Stig; Torr, Nicholas; Tournefier, Edwige; Tourneur, Stephane; Trabelsi, Karim; Tran, Minh Tâm; Tresch, Marco; Trisovic, Ana; Tsaregorodtsev, Andrei; Tsopelas, Panagiotis; Tuning, Niels; Ubeda Garcia, Mario; Ukleja, Artur; Ustyuzhanin, Andrey; Uwer, Ulrich; Vacca, Claudia; Vagnoni, Vincenzo; Valenti, Giovanni; Vallier, Alexis; Vazquez Gomez, Ricardo; Vazquez Regueiro, Pablo; Vázquez Sierra, Carlos; Vecchi, Stefania; Velthuis, Jaap; Veltri, Michele; Veneziano, Giovanni; Vesterinen, Mika; Viaud, Benoit; Vieira, Daniel; Vieites Diaz, Maria; Vilasis-Cardona, Xavier; Vollhardt, Achim; Volyanskyy, Dmytro; Voong, David; Vorobyev, Alexey; Vorobyev, Vitaly; Voß, Christian; de Vries, Jacco; Waldi, Roland; Wallace, Charlotte; Wallace, Ronan; Walsh, John; Wandernoth, Sebastian; Wang, Jianchun; Ward, David; Watson, Nigel; Websdale, David; Weiden, Andreas; Whitehead, Mark; Wiedner, Dirk; Wilkinson, Guy; Wilkinson, Michael; Williams, Mark Richard James; Williams, Matthew; Williams, Mike; Wilson, Fergus; Wimberley, Jack; Wishahi, Julian; Wislicki, Wojciech; Witek, Mariusz; Wormser, Guy; Wotton, Stephen; Wright, Simon; Wyllie, Kenneth; Xie, Yuehong; Xu, Zhirui; Yang, Zhenwei; Yuan, Xuhao; Yushchenko, Oleg; Zangoli, Maria; Zavertyaev, Mikhail; Zhang, Liming; Zhang, Yanxi; Zhelezov, Alexey; Zhokhov, Anatoly; Zhong, Liang

2015-12-15

A search is performed for heavy long-lived charged particles using 3.0 fb$^{-1}$ of pp collisions collected at $\\sqrt{s}$= 7 and 8 TeV with the LHCb detector. The search is mainly based on the response of the ring imaging Cherenkovdetectors to distinguish the heavy, slow-moving particles from muons. No evidence is found for the production of such long-lived states. The results are expressed as limits on the Drell-Yan production of pairs of long-lived particles, with both particles in the LHCb pseudorapidity acceptance, $1.8 < \\eta < 4.9$. The mass-dependent cross-section upper limits are in the range 2-4 fb (at 95\\% CL) for masses between 124 and 309 GeV/c$^2$.

Tooth fragment reattachment techniques-A systematic review.

Science.gov (United States)

Garcia, Fernanda Cristina P; Poubel, Déborah L N; Almeida, Júlio César F; Toledo, Isabela P; Poi, Wilson R; Guerra, Eliete N S; Rezende, Liliana V M L

2018-03-07

Several strategies have been developed for tooth fragment reattachment following fracture. Although many techniques have been reported, there is no consensus on which one has the best results in terms of the bond strength between the fragment and the dentin over time. The aim of this study was to assess the currently reported tooth fragment reattachment techniques for fractured crowns of anterior teeth. The PubMed, LILACS, Web of Science, Cochrane, and Scopus databases were searched in October 2016, and the search was updated in February 2017. A search of the gray literature was performed in Google Scholar and OpenGrey. Reference lists of eligible studies were cross-checked to identify additional studies; gray literature and ongoing trials were investigated. Two authors assessed studies to determine inclusion and undertook data extraction. Case reports/series of three or more cases, cross-sectional studies, cohort studies, and in vivo clinical trials in all languages were included. Five articles remained after screening. These studies predominantly reported on fragment reattachment with composite resin and resin cement. There was little consistency among the studies in regard to the technique used for tooth fragment reattachment and length of the follow-up period. According to the evidence found in the studies included in this review, simple tooth fragment reattachment was the preferred reattachment technique. An increase in the bond strength between tooth fragment and dentin was observed when an intermediate material was used. Further investigation is needed, using standard follow-up periods and larger samples. © 2018 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Direct observation of TALE protein dynamics reveals a two-state search mechanism.

Science.gov (United States)

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

2015-06-01

Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins for which the fundamental mechanisms governing the search process are not fully understood. Here we use single-molecule techniques to directly observe TALE search dynamics along DNA templates. We find that TALE proteins are capable of rapid diffusion along DNA using a combination of sliding and hopping behaviour, which suggests that the TALE search process is governed in part by facilitated diffusion. We also observe that TALE proteins exhibit two distinct modes of action during the search process-a search state and a recognition state-facilitated by different subdomains in monomeric TALE proteins. Using TALE truncation mutants, we further demonstrate that the N-terminal region of TALEs is required for the initial non-specific binding and subsequent rapid search along DNA, whereas the central repeat domain is required for transitioning into the site-specific recognition state.

Internet Search Engines

OpenAIRE

Fatmaa El Zahraa Mohamed Abdou

2004-01-01

A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

University Students' Online Information Searching Strategies in Different Search Contexts

Science.gov (United States)

Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

2012-01-01

This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

Coherently combining data between detectors for all-sky semi-coherent continuous gravitational wave searches

International Nuclear Information System (INIS)

Goetz, E; Riles, K

2016-01-01

We present a method for coherently combining short data segments from gravitational-wave detectors to improve the sensitivity of semi-coherent searches for continuous gravitational waves. All-sky searches for continuous gravitational waves from unknown sources are computationally limited. The semi-coherent approach reduces the computational cost by dividing the entire observation timespan into short segments to be analyzed coherently, then combined together incoherently. Semi-coherent analyses that attempt to improve sensitivity by coherently combining data from multiple detectors face a computational challenge in accounting for uncertainties in signal parameters. In this article, we lay out a technique to meet this challenge using summed Fourier transform coefficients. Applying this technique to one all-sky search algorithm called TwoSpect, we confirm that the sensitivity of all-sky, semi-coherent searches can be improved by coherently combining the short data segments, e.g., by up to 42% over a single detector for an all-sky search. For misaligned detectors, however, this improvement requires careful attention when marginalizing over unknown polarization parameters. In addition, care must be taken in correcting for differential detector velocity due to the Earth’s rotation for high signal frequencies and widely separated detectors. (paper)

Collage Technique in Art Education and Contribution to the Skill of Students to Build Composition

Directory of Open Access Journals (Sweden)

Evrim ÇAĞLAYAN

2018-01-01

Full Text Available Collage technique has been used since the beginning of the 20th century in art of painting. Among its leading names, Picasso and Braque's technique has made it possible to use different materials besides traditional painting materials. This new technique, which emerged in art, took place in the process of art education with time. The aim of this research is to search the contribution of collage technique to the skill of students to build composition. In this research, in which the qualitative research approach is interiorized, composition of the students that they make by using the collage technique are presented to oppinions of the experts. Analysis of the obtained data showed that collage technique contributes the skill of students to build composition. In the results of research; it can be said that the collage technique developed the skills of students to build composition.

A Novel Self-Adaptive Harmony Search Algorithm

Directory of Open Access Journals (Sweden)

Kaiping Luo

2013-01-01

Full Text Available The harmony search algorithm is a music-inspired optimization technology and has been successfully applied to diverse scientific and engineering problems. However, like other metaheuristic algorithms, it still faces two difficulties: parameter setting and finding the optimal balance between diversity and intensity in searching. This paper proposes a novel, self-adaptive search mechanism for optimization problems with continuous variables. This new variant can automatically configure the evolutionary parameters in accordance with problem characteristics, such as the scale and the boundaries, and dynamically select evolutionary strategies in accordance with its search performance. The new variant simplifies the parameter setting and efficiently solves all types of optimization problems with continuous variables. Statistical test results show that this variant is considerably robust and outperforms the original harmony search (HS, improved harmony search (IHS, and other self-adaptive variants for large-scale optimization problems and constrained problems.

Searching for directly decaying gluinos at the Tevatron

International Nuclear Information System (INIS)

Alwall, Johan; Le, My-Phuong; Lisanti, Mariangela; Wacker, Jay G.

2008-01-01

This Letter describes how to perform searches over the complete kinematically-allowed parameter space for new pair-produced color octet particles that each subsequently decay into two jets plus missing energy at the Tevatron. This Letter shows that current searches can miss otherwise discoverable spectra of particles due to CMSSM-motivated cuts. Optimizing the H T and E/ T cuts expands the sensitivity of these searches

Psychological and social factors affecting Internet searches on suicide in Korea: a big data analysis of Google search trends.

Science.gov (United States)

Song, Tae Min; Song, Juyoung; An, Ji-Young; Hayman, Laura L; Woo, Jong-Min

2014-01-01

The average mortality rate for death by suicide among OECD countries is 12.8 per 100000, and 33.5 for Korea. The present study analyzed big data extracted from Google to identify factors related to searches on suicide in Korea. Google search trends for the search words of suicide, stress, exercise, and drinking were obtained for 2004-2010. Analyzing data by month, the relationship between the actual number of suicides and search words per year was examined using multi-level models. Both suicide rates and Google searches on suicide in Korea increased since 2007. An unconditional slope model indicated stress and suicide-related searches were positively related. A conditional model showed that factors associated with suicide by year directly affected suicide-related searches. The interaction between stress-related searches and the actual number of suicides was significant. A positive relationship between stress- and suicide-related searches further confirmed that stress affects suicide. Taken together and viewed in context of the big data analysis, our results point to the need for a tailored prevention program. Real-time big data can be of use in indicating increases in suicidality when search words such as stress and suicide generate greater numbers of hits on portals and social network sites.

Protein structure determination by exhaustive search of Protein Data Bank derived databases.

Science.gov (United States)

Stokes-Rees, Ian; Sliz, Piotr

2010-12-14

Parallel sequence and structure alignment tools have become ubiquitous and invaluable at all levels in the study of biological systems. We demonstrate the application and utility of this same parallel search paradigm to the process of protein structure determination, benefitting from the large and growing corpus of known structures. Such searches were previously computationally intractable. Through the method of Wide Search Molecular Replacement, developed here, they can be completed in a few hours with the aide of national-scale federated cyberinfrastructure. By dramatically expanding the range of models considered for structure determination, we show that small (less than 12% structural coverage) and low sequence identity (less than 20% identity) template structures can be identified through multidimensional template scoring metrics and used for structure determination. Many new macromolecular complexes can benefit significantly from such a technique due to the lack of known homologous protein folds or sequences. We demonstrate the effectiveness of the method by determining the structure of a full-length p97 homologue from Trichoplusia ni. Example cases with the MHC/T-cell receptor complex and the EmoB protein provide systematic estimates of minimum sequence identity, structure coverage, and structural similarity required for this method to succeed. We describe how this structure-search approach and other novel computationally intensive workflows are made tractable through integration with the US national computational cyberinfrastructure, allowing, for example, rapid processing of the entire Structural Classification of Proteins protein fragment database.

Thermionic vacuum arc (TVA) technique for magnesium thin film deposition

Energy Technology Data Exchange (ETDEWEB)

Balbag, M.Z., E-mail: zbalbag@ogu.edu.t [Eskisehir Osmangazi University, Education Faculty, Primary Education, Meselik Campus, Eskisehir 26480 (Turkey); Pat, S.; Ozkan, M.; Ekem, N. [Eskisehir Osmangazi University, Art and Science Faculty, Physics Department, Eskisehir 26480 (Turkey); Musa, G. [Ovidius University, Physics Department, Constanta (Romania)

2010-08-15

In this study, magnesium thin films were deposited on glass substrate by the Thermionic Vacuum Arc (TVA) technique for the first time. We present a different technique for deposition of high-quality magnesium thin films. By means of this technique, the production of films is achieved by condensing the plasma of anode material generated using Thermionic Vacuum Arc (TVA) under high vacuum conditions onto the surface to be coated. The crystal orientation and morphology of the deposited films were investigated by using XRD, EDX, SEM and AFM. The aim of this study is to search the use of TVA technique to coat magnesium thin films and to determine some of the physical properties of the films generated. Furthermore, this study will contribute to the scientific studies which search the thin films of magnesium or the compounds containing magnesium. In future, this study will be preliminary work to entirely produce magnesium diboride (MgB{sub 2}) superconductor thin film with the TVA technique.

Methods and techniques of nuclear in-core fuel management

International Nuclear Information System (INIS)

Jong, A.J. de.

1992-04-01

Review of methods of nuclear in-core fuel management (the minimal critical mass problem, minimal power peaking) and calculational techniques: reactorphysical calculations (point reactivity models, continuous refueling, empirical methods, depletion perturbation theory, nodal computer programs); optimization techniques (stochastic search, linear programming, heuristic parameter optimization). (orig./HP)

Searching for WISPy cold dark matter with a dish antenna

Energy Technology Data Exchange (ETDEWEB)

Horns, Dieter [Hamburg Univ. (Germany). Inst. fuer Experimentalphysik; Jaeckel, Joerg [Heidelberg Univ. (Germany). Inst. fuer Theoretische Physik; Durham Univ. (United Kingdom). Inst. for Particle Physics Phenomenology; Lindner, Axel; Ringwald, Andreas [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Lobanov, Andrei [Max-Planck-Institut fuer Radioastronomie, Bonn (Germany); Redondo, Javier [Muenchen Univ. (Germany). Arnold Sommerfeld Center; Max-Planck-Institut fuer Physik, Muenchen (Germany)

2012-12-15

The cold dark matter of the Universe may be comprised of very light and very weakly interacting particles, so-called WISPs. Two prominent examples are hidden photons and axion-like particles. In this note we propose a new technique to sensitively search for this type of dark matter with dish antennas. The technique is broadband and allows to explore a whole range of masses in a single measurement.

Visual search for features and conjunctions in development.

Science.gov (United States)

Lobaugh, N J; Cole, S; Rovet, J F

1998-12-01

Visual search performance was examined in three groups of children 7 to 12 years of age and in young adults. Colour and orientation feature searches and a conjunction search were conducted. Reaction time (RT) showed expected improvements in processing speed with age. Comparisons of RT's on target-present and target-absent trials were consistent with parallel search on the two feature conditions and with serial search in the conjunction condition. The RT results indicated searches for feature and conjunctions were treated similarly for children and adults. However, the youngest children missed more targets at the largest array sizes, most strikingly in conjunction search. Based on an analysis of speed/accuracy trade-offs, we suggest that low target-distractor discriminability leads to an undersampling of array elements, and is responsible for the high number of misses in the youngest children.

Collective search by ants in microgravity

Directory of Open Access Journals (Sweden)

Stefanie M. Countryman

2015-03-01

Full Text Available The problem of collective search is a tradeoff between searching thoroughly and covering as much area as possible. This tradeoff depends on the density of searchers. Solutions to the problem of collective search are currently of much interest in robotics and in the study of distributed algorithms, for example to design ways that without central control robots can use local information to perform search and rescue operations. Ant colonies operate without central control. Because they can perceive only local, mostly chemical and tactile cues, they must search collectively to find resources and to monitor the colony's environment. Examining how ants in diverse environments solve the problem of collective search can elucidate how evolution has led to diverse forms of collective behavior. An experiment on the International Space Station in January 2014 examined how ants (Tetramorium caespitum perform collective search in microgravity. In the ISS experiment, the ants explored a small arena in which a barrier was lowered to increase the area and thus lower ant density. In microgravity, relative to ground controls, ants explored the area less thoroughly and took more convoluted paths. It appears that the difficulty of holding on to the surface interfered with the ants’ ability to search collectively. Ants frequently lost contact with the surface, but showed a remarkable ability to regain contact with the surface.

Forward-Looking Search Within Innovation Projects

DEFF Research Database (Denmark)

Jissink, Tymen; Rohrbeck, René; Schweitzer, Fiona

To develop highly-innovative projects, which are fraught with uncertainty and longer development times, one cannot solely rely on initial planning and budgeting to ensure the project’s outcome remains novel. This study posits that to develop innovative projects, project teams need to engage...... in forward-looking search during development to ensure the project’s outcome remains novel and relevant. We refer to forward-looking search as the search and evaluation of information on markets, customers, and technologies in terms of their future impact. Data on 159 unique innovation projects from...... the Danish manufacturing industry shows that forward-looking search significantly impacts innovativeness. The effect follows an inverted-U shape where the greatest positive effect on innovativeness occurs in moderately planned projects and significantly lower effects in low- and highly planned projects...

Optimizing Online Suicide Prevention: A Search Engine-Based Tailored Approach.

Science.gov (United States)

Arendt, Florian; Scherr, Sebastian

2017-11-01

Search engines are increasingly used to seek suicide-related information online, which can serve both harmful and helpful purposes. Google acknowledges this fact and presents a suicide-prevention result for particular search terms. Unfortunately, the result is only presented to a limited number of visitors. Hence, Google is missing the opportunity to provide help to vulnerable people. We propose a two-step approach to a tailored optimization: First, research will identify the risk factors. Second, search engines will reweight algorithms according to the risk factors. In this study, we show that the query share of the search term "poisoning" on Google shows substantial peaks corresponding to peaks in actual suicidal behavior. Accordingly, thresholds for showing the suicide-prevention result should be set to the lowest levels during the spring, on Sundays and Mondays, on New Year's Day, and on Saturdays following Thanksgiving. Search engines can help to save lives globally by utilizing a more tailored approach to suicide prevention.

Search for long-lived heavy charged particles using a ring imaging Cherenkov technique at LHCb.

Science.gov (United States)

Aaij, R; Adeva, B; Adinolfi, M; Affolder, A; Ajaltouni, Z; Akar, S; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amerio, S; Amhis, Y; An, L; Anderlini, L; Anderson, J; Andreotti, M; Andrews, J E; Appleby, R B; Aquines Gutierrez, O; Archilli, F; d'Argent, P; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Bachmann, S; Back, J J; Badalov, A; Baesso, C; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Batozskaya, V; Battista, V; Bay, A; Beaucourt, L; Beddow, J; Bedeschi, F; Bediaga, I; Bel, L J; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bertolin, A; Bettler, M-O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Birnkraut, A; Bizzeti, A; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Borsato, M; Bowcock, T J V; Bowen, E; Bozzi, C; Brett, D; Britsch, M; Britton, T; Brodzicka, J; Brook, N H; Bursche, A; Buytaert, J; Cadeddu, S; Calabrese, R; Calvi, M; Calvo Gomez, M; Campana, P; Campora Perez, D; Capriotti, L; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carniti, P; Carson, L; Carvalho Akiba, K; Casanova Mohr, R; Casse, G; Cassina, L; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cavallero, G; Cenci, R; Charles, M; Charpentier, Ph; Chefdeville, M; Chen, S; Cheung, S F; Chiapolini, N; Chrzaszcz, M; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coco, V; Cogan, J; Cogneras, E; Cogoni, V; Cojocariu, L; Collazuol, G; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Corvo, M; Counts, I; Couturier, B; Cowan, G A; Craik, D C; Crocombe, A; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Dalseno, J; David, P N Y; Davis, A; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Dean, C T; Decamp, D; Deckenhoff, M; Del Buono, L; Déléage, N; Derkach, D; Deschamps, O; Dettori, F; Dey, B; Di Canto, A; Di Ruscio, F; Dijkstra, H; Donleavy, S; Dordei, F; Dorigo, M; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dreimanis, K; Dujany, G; Dupertuis, F; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Ely, S; Esen, S; Evans, H M; Evans, T; Falabella, A; Färber, C; Farinelli, C; Farley, N; Farry, S; Fay, R; Ferguson, D; Fernandez Albor, V; Ferrari, F; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fiorini, M; Firlej, M; Fitzpatrick, C; Fiutowski, T; Fol, P; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Fu, J; Furfaro, E; Gallas Torreira, A; Galli, D; Gallorini, S; Gambetta, S; Gandelman, M; Gandini, P; Gao, Y; García Pardiñas, J; Garofoli, J; Garra Tico, J; Garrido, L; Gascon, D; Gaspar, C; Gauld, R; Gavardi, L; Gazzoni, G; Geraci, A; Gerick, D; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianelle, A; Gianì, S; Gibson, V; Giubega, L; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gotti, C; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graverini, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Griffith, P; Grillo, L; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hamilton, B; Hampson, T; Han, X; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; He, J; Head, T; Heijne, V; Hennessy, K; Henrard, P; Henry, L; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hoballah, M; Hombach, C; Hulsbergen, W; Humair, T; Hussain, N; Hutchcroft, D; Hynds, D; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jalocha, J; Jans, E; Jawahery, A; Jing, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kandybei, S; Kanso, W; Karacson, M; Karbach, T M; Karodia, S; Kelsey, M; Kenyon, I R; Kenzie, M; Ketel, T; Khanji, B; Khurewathanakul, C; Klaver, S; Klimaszewski, K; Kochebina, O; Kolpin, M; Komarov, I; Koopman, R F; Koppenburg, P; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucewicz, W; Kucharczyk, M; Kudryavtsev, V; Kurek, K; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanfranchi, G; Langenbruch, C; Langhans, B; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J P; Lefèvre, R; Leflat, A; Lefrançois, J; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Likhomanenko, T; Liles, M; Lindner, R; Linn, C; Lionetto, F; Liu, B; Lohn, S; Longstaff, I; Lopes, J H; Lucchesi, D; Luo, H; Lupato, A; Luppi, E; Lupton, O; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Malinin, A; Manca, G; Mancinelli, G; Manning, P; Mapelli, A; Maratas, J; Marchand, J F; Marconi, U; Marin Benito, C; Marino, P; Märki, R; Marks, J; Martellotti, G; Martinelli, M; Martinez Santos, D; Martinez Vidal, F; Martins Tostes, D; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Mauri, A; Maurin, B; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; McSkelly, B; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M N; Mitzel, D S; Molina Rodriguez, J; Monteil, S; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Moron, J; Morris, A B; Mountain, R; Muheim, F; Müller, J; Müller, K; Müller, V; Mussini, M; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neri, N; Neubert, S; Neufeld, N; Neuner, M; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; O'Hanlon, D P; Oblakowska-Mucha, A; Obraztsov, V; Ogilvy, S; Okhrimenko, O; Oldeman, R; Onderwater, C J G; Osorio Rodrigues, B; Otalora Goicochea, J M; Otto, A; Owen, P; Oyanguren, A; Palano, A; Palombo, F; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Pappalardo, L L; Parkes, C; Passaleva, G; Patel, G D; Patel, M; Patrignani, C; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perret, P; Pescatore, L; Petridis, K; Petrolini, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Pistone, A; Playfer, S; Plo Casasus, M; Poikela, T; Polci, F; Poluektov, A; Polyakov, I; Polycarpo, E; Popov, A; Popov, D; Popovici, B; Potterat, C; Price, E; Price, J D; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Quagliani, R; Rachwal, B; Rademacker, J H; Rakotomiaramanana, B; Rama, M; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redi, F; Reichert, S; Reid, M M; Dos Reis, A C; Ricciardi, S; Richards, S; Rihl, M; Rinnert, K; Rives Molina, V; Robbe, P; Rodrigues, A B; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rotondo, M; Rouvinet, J; Ruf, T; Ruiz, H; Ruiz Valls, P; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salustino Guimaraes, V; Sanchez Mayordomo, C; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sarti, A; Satriano, C; Satta, A; Saunders, D M; Savrina, D; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmelzer, T; Schmidt, B; Schneider, O; Schopper, A; Schune, M H; Schwemmer, R; Sciascia, B; Sciubba, A; Semennikov, A; Sepp, I; Serra, N; Serrano, J; Sestini, L; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, V; Shires, A; Silva Coutinho, R; Simi, G; Sirendi, M; Skidmore, N; Skillicorn, I; Skwarnicki, T; Smith, E; Smith, E; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; Souza De Paula, B; Spaan, B; Spradlin, P; Sridharan, S; Stagni, F; Stahl, M; Stahl, S; Steinkamp, O; Stenyakin, O; Sterpka, F; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Stroili, R; Sun, L; Sutcliffe, W; Swientek, K; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szumlak, T; T'Jampens, S; Tekampe, T; Teklishyn, M; Tellarini, G; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Todd, J; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Trabelsi, K; Tran, M T; Tresch, M; Trisovic, A; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vacca, C; Vagnoni, V; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vázquez Sierra, C; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vieites Diaz, M; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; de Vries, J A; Waldi, R; Wallace, C; Wallace, R; Walsh, J; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Websdale, D; Weiden, A; Whitehead, M; Wiedner, D; Wilkinson, G; Wilkinson, M; Williams, M; Williams, M P; Williams, M; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wright, S; Wyllie, K; Xie, Y; Xu, Z; Yang, Z; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, L; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L

A search is performed for heavy long-lived charged particles using 3.0 [Formula: see text] of proton-proton collisions collected at [Formula: see text][Formula: see text] 7 and 8  TeV with the LHCb detector. The search is mainly based on the response of the ring imaging Cherenkov detectors to distinguish the heavy, slow-moving particles from muons. No evidence is found for the production of such long-lived states. The results are expressed as limits on the Drell-Yan production of pairs of long-lived particles, with both particles in the LHCb pseudorapidity acceptance, [Formula: see text]. The mass-dependent cross-section upper limits are in the range 2-4 fb (at 95 % CL) for masses between 14 and 309 [Formula: see text].

Dynamics of a macroscopic model characterizing mutualism of search engines and web sites

Science.gov (United States)

Wang, Yuanshi; Wu, Hong

2006-05-01

We present a model to describe the mutualism relationship between search engines and web sites. In the model, search engines and web sites benefit from each other while the search engines are derived products of the web sites and cannot survive independently. Our goal is to show strategies for the search engines to survive in the internet market. From mathematical analysis of the model, we show that mutualism does not always result in survival. We show various conditions under which the search engines would tend to extinction, persist or grow explosively. Then by the conditions, we deduce a series of strategies for the search engines to survive in the internet market. We present conditions under which the initial number of consumers of the search engines has little contribution to their persistence, which is in agreement with the results in previous works. Furthermore, we show novel conditions under which the initial value plays an important role in the persistence of the search engines and deduce new strategies. We also give suggestions for the web sites to cooperate with the search engines in order to form a win-win situation.

Heat Transfer Search Algorithm for Non-convex Economic Dispatch Problems

Science.gov (United States)

Hazra, Abhik; Das, Saborni; Basu, Mousumi

2018-03-01

This paper presents Heat Transfer Search (HTS) algorithm for the non-linear economic dispatch problem. HTS algorithm is based on the law of thermodynamics and heat transfer. The proficiency of the suggested technique has been disclosed on three dissimilar complicated economic dispatch problems with valve point effect; prohibited operating zone; and multiple fuels with valve point effect. Test results acquired from the suggested technique for the economic dispatch problem have been fitted to that acquired from other stated evolutionary techniques. It has been observed that the suggested HTS carry out superior solutions.

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

Science.gov (United States)

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.

Automated defect location and sizing by advanced ultrasonic techniques

International Nuclear Information System (INIS)

Murgatroyd, R.A.

1983-01-01

From this assessment of advanced automated defect location and sizing techniques it is concluded that, 1. Pulse-echo techniques, when used at high sensitivity, are capable of detecting all known defects in the test weldments inspected; 2. Search sensitivity has a marked influence on defect detection at both 1 and 2 MHz, and it is considered that 20% DAC is the highest amplitude threshold level which could be prudently adopted at the search stage; 3. The important through-thickness dimension of deeply buried defects in the height range 5 to 50mm can be sized to an estimated accuracy of +2mm using the Silk technique and that applying a SAFT-type algorithm to the data gives good lateral positioning of defects; 4. The 70 0 longitudinal wave twin-crystal technique has proved to be a highly effective method of detecting underclad cracks. A 70 0 shear wave, pulse-echo technique and a 0 0 longitudinal wave twin crystal method also give good detection results in the near surface region; 5. The Silk technique has been effective in sizing defects in the height range 5 to 35mm in the near-surface region

Spin formalism and applications to new physics searches

Energy Technology Data Exchange (ETDEWEB)

Haber, H.E. [Univ. of California, Santa Cruz, CA (United States)

1994-12-01

An introduction to spin techniques in particle physics is given. Among the topics covered are: helicity formalism and its applications to the decay and scattering of spin-1/2 and spin-1 particles, techniques for evaluating helicity amplitudes (including projection operator methods and the spinor helicity method), and density matrix techniques. The utility of polarization and spin correlations for untangling new physics beyond the Standard Model at future colliders such as the LHC and a high energy e{sup +}e{sup {minus}} linear collider is then considered. A number of detailed examples are explored including the search for low-energy supersymmetry, a non-minimal Higgs boson sector, and new gauge bosons beyond the W{sup {+-}} and Z.

Modified cuckoo search: A new gradient free optimisation algorithm

International Nuclear Information System (INIS)

Walton, S.; Hassan, O.; Morgan, K.; Brown, M.R.

2011-01-01

Highlights: → Modified cuckoo search (MCS) is a new gradient free optimisation algorithm. → MCS shows a high convergence rate, able to outperform other optimisers. → MCS is particularly strong at high dimension objective functions. → MCS performs well when applied to engineering problems. - Abstract: A new robust optimisation algorithm, which can be regarded as a modification of the recently developed cuckoo search, is presented. The modification involves the addition of information exchange between the top eggs, or the best solutions. Standard optimisation benchmarking functions are used to test the effects of these modifications and it is demonstrated that, in most cases, the modified cuckoo search performs as well as, or better than, the standard cuckoo search, a particle swarm optimiser, and a differential evolution strategy. In particular the modified cuckoo search shows a high convergence rate to the true global minimum even at high numbers of dimensions.

Full text and figure display improves bioscience literature search.

Science.gov (United States)

Divoli, Anna; Wooldridge, Michael A; Hearst, Marti A

2010-04-14

When reading bioscience journal articles, many researchers focus attention on the figures and their captions. This observation led to the development of the BioText literature search engine, a freely available Web-based application that allows biologists to search over the contents of Open Access Journals, and see figures from the articles displayed directly in the search results. This article presents a qualitative assessment of this system in the form of a usability study with 20 biologist participants using and commenting on the system. 19 out of 20 participants expressed a desire to use a bioscience literature search engine that displays articles' figures alongside the full text search results. 15 out of 20 participants said they would use a caption search and figure display interface either frequently or sometimes, while 4 said rarely and 1 said undecided. 10 out of 20 participants said they would use a tool for searching the text of tables and their captions either frequently or sometimes, while 7 said they would use it rarely if at all, 2 said they would never use it, and 1 was undecided. This study found evidence, supporting results of an earlier study, that bioscience literature search systems such as PubMed should show figures from articles alongside search results. It also found evidence that full text and captions should be searched along with the article title, metadata, and abstract. Finally, for a subset of users and information needs, allowing for explicit search within captions for figures and tables is a useful function, but it is not entirely clear how to cleanly integrate this within a more general literature search interface. Such a facility supports Open Access publishing efforts, as it requires access to full text of documents and the lifting of restrictions in order to show figures in the search interface.

Full text and figure display improves bioscience literature search.

Directory of Open Access Journals (Sweden)

Anna Divoli

Full Text Available When reading bioscience journal articles, many researchers focus attention on the figures and their captions. This observation led to the development of the BioText literature search engine, a freely available Web-based application that allows biologists to search over the contents of Open Access Journals, and see figures from the articles displayed directly in the search results. This article presents a qualitative assessment of this system in the form of a usability study with 20 biologist participants using and commenting on the system. 19 out of 20 participants expressed a desire to use a bioscience literature search engine that displays articles' figures alongside the full text search results. 15 out of 20 participants said they would use a caption search and figure display interface either frequently or sometimes, while 4 said rarely and 1 said undecided. 10 out of 20 participants said they would use a tool for searching the text of tables and their captions either frequently or sometimes, while 7 said they would use it rarely if at all, 2 said they would never use it, and 1 was undecided. This study found evidence, supporting results of an earlier study, that bioscience literature search systems such as PubMed should show figures from articles alongside search results. It also found evidence that full text and captions should be searched along with the article title, metadata, and abstract. Finally, for a subset of users and information needs, allowing for explicit search within captions for figures and tables is a useful function, but it is not entirely clear how to cleanly integrate this within a more general literature search interface. Such a facility supports Open Access publishing efforts, as it requires access to full text of documents and the lifting of restrictions in order to show figures in the search interface.

Searches for new resonances decaying into bosons with the ATLAS detector

CERN Document Server

Shaw, Savanna Marie; The ATLAS collaboration

2016-01-01

Many extensions to the Standard Model predicts new particles decaying into two bosons (WW, WZ, ZZ , W/Zgamma, W/ZH and HH) making this a smoking gun signature. Searches for such diboson resonances have been performed in final states with different numbers of leptons , photon and jets where new identification techniques to disentangle the decay products in highly boosted configuration are being used. This talk summarizes ATLAS searches for diboson resonances with LHC Run 2 data.

Achieving Sub-Second Search in the CMR

Science.gov (United States)

Gilman, J.; Baynes, K.; Pilone, D.; Mitchell, A. E.; Murphy, K. J.

2014-12-01

The Common Metadata Repository (CMR) is the next generation Earth Science Metadata catalog for NASA's Earth Observing data. It joins together the holdings from the EOS Clearing House (ECHO) and the Global Change Master Directory (GCMD), creating a unified, authoritative source for EOSDIS metadata. The CMR allows ingest in many different formats while providing consistent search behavior and retrieval in any supported format. Performance is a critical component of the CMR, ensuring improved data discovery and client interactivity. The CMR delivers sub-second search performance for any of the common query conditions (including spatial) across hundreds of millions of metadata granules. It also allows the addition of new metadata concepts such as visualizations, parameter metadata, and documentation. The CMR's goals presented many challenges. This talk will describe the CMR architecture, design, and innovations that were made to achieve its goals. This includes: * Architectural features like immutability and backpressure. * Data management techniques such as caching and parallel loading that give big performance gains. * Open Source and COTS tools like Elasticsearch search engine. * Adoption of Clojure, a functional programming language for the Java Virtual Machine. * Development of a custom spatial search plugin for Elasticsearch and why it was necessary. * Introduction of a unified model for metadata that maps every supported metadata format to a consistent domain model.

Expert Search Strategies: The Information Retrieval Practices of Healthcare Information Professionals.

Science.gov (United States)

Russell-Rose, Tony; Chamberlain, Jon

2017-10-02

Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. The aim of this study was to investigate the search behavior of healthcare information professionals, uncovering their needs, goals, and requirements for information retrieval systems. A survey was distributed to healthcare information professionals via professional association email discussion lists. It investigated the search tasks they undertake, their techniques for search strategy formulation, their approaches to evaluating search results, and their preferred functionality for searching library-style databases. The popular literature search system PubMed was then evaluated to determine the extent to which their needs were met. The 107 respondents indicated that their information retrieval process relied on the use of complex, repeatable, and transparent search strategies. On average it took 60 minutes to formulate a search strategy, with a search task taking 4 hours and consisting of 15 strategy lines. Respondents reviewed a median of 175 results per search task, far more than they would ideally like (100). The most desired features of a search system were merging search queries and combining search results. Healthcare information professionals routinely address some of the most challenging information retrieval problems of any profession. However, their needs are not fully supported by current literature search systems and there is demand for improved functionality, in particular regarding the development and management of search strategies. ©Tony Russell-Rose, Jon Chamberlain. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 02.10.2017.

Optimized blind gamma-ray pulsar searches at fixed computing budget

International Nuclear Information System (INIS)

Pletsch, Holger J.; Clark, Colin J.

2014-01-01

The sensitivity of blind gamma-ray pulsar searches in multiple years worth of photon data, as from the Fermi LAT, is primarily limited by the finite computational resources available. Addressing this 'needle in a haystack' problem, here we present methods for optimizing blind searches to achieve the highest sensitivity at fixed computing cost. For both coherent and semicoherent methods, we consider their statistical properties and study their search sensitivity under computational constraints. The results validate a multistage strategy, where the first stage scans the entire parameter space using an efficient semicoherent method and promising candidates are then refined through a fully coherent analysis. We also find that for the first stage of a blind search incoherent harmonic summing of powers is not worthwhile at fixed computing cost for typical gamma-ray pulsars. Further enhancing sensitivity, we present efficiency-improved interpolation techniques for the semicoherent search stage. Via realistic simulations we demonstrate that overall these optimizations can significantly lower the minimum detectable pulsed fraction by almost 50% at the same computational expense.