Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm

Energy Technology Data Exchange (ETDEWEB)

Chaoshun Li; Jianzhong Zhou [College of Hydroelectric Digitization Engineering, Huazhong University of Science and Technology, Wuhan 430074 (China)

2011-01-15

Parameter identification of hydraulic turbine governing system (HTGS) is crucial in precise modeling of hydropower plant and provides support for the analysis of stability of power system. In this paper, a newly developed optimization algorithm, called gravitational search algorithm (GSA), is introduced and applied in parameter identification of HTGS, and the GSA is improved by combination of the search strategy of particle swarm optimization. Furthermore, a new weighted objective function is proposed in the identification frame. The improved gravitational search algorithm (IGSA), together with genetic algorithm, particle swarm optimization and GSA, is employed in parameter identification experiments and the procedure is validated by comparing experimental and simulated results. Consequently, IGSA is shown to locate more precise parameter values than the compared methods with higher efficiency. (author)

Parameters identification of hydraulic turbine governing system using improved gravitational search algorithm

International Nuclear Information System (INIS)

Li Chaoshun; Zhou Jianzhong

2011-01-01

Parameter identification of hydraulic turbine governing system (HTGS) is crucial in precise modeling of hydropower plant and provides support for the analysis of stability of power system. In this paper, a newly developed optimization algorithm, called gravitational search algorithm (GSA), is introduced and applied in parameter identification of HTGS, and the GSA is improved by combination of the search strategy of particle swarm optimization. Furthermore, a new weighted objective function is proposed in the identification frame. The improved gravitational search algorithm (IGSA), together with genetic algorithm, particle swarm optimization and GSA, is employed in parameter identification experiments and the procedure is validated by comparing experimental and simulated results. Consequently, IGSA is shown to locate more precise parameter values than the compared methods with higher efficiency.

Addressing special structure in the relevance feedback learning problem through aspect-based image search

NARCIS (Netherlands)

M.J. Huiskes (Mark)

2004-01-01

textabstractIn this paper we focus on a number of issues regarding special structure in the relevance feedback learning problem, most notably the effects of image selection based on partial relevance on the clustering behavior of examples. We propose a simple scheme, aspect-based image search, which

State-of-the-Art Review on Relevance of Genetic Algorithm to Internet Web Search

Directory of Open Access Journals (Sweden)

Kehinde Agbele

2012-01-01

Full Text Available People use search engines to find information they desire with the aim that their information needs will be met. Information retrieval (IR is a field that is concerned primarily with the searching and retrieving of information in the documents and also searching the search engine, online databases, and Internet. Genetic algorithms (GAs are robust, efficient, and optimizated methods in a wide area of search problems motivated by Darwin’s principles of natural selection and survival of the fittest. This paper describes information retrieval systems (IRS components. This paper looks at how GAs can be applied in the field of IR and specifically the relevance of genetic algorithms to internet web search. Finally, from the proposals surveyed it turns out that GA is applied to diverse problem fields of internet web search.

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

Energy Technology Data Exchange (ETDEWEB)

Sheng, Zheng, E-mail: 19994035@sina.com [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Wang, Jun; Zhou, Bihua [National Defense Key Laboratory on Lightning Protection and Electromagnetic Camouflage, PLA University of Science and Technology, Nanjing 210007 (China); Zhou, Shudao [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters, Nanjing University of Information Science and Technology, Nanjing 210044 (China)

2014-03-15

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

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

International Nuclear Information System (INIS)

Sheng, Zheng; Wang, Jun; Zhou, Bihua; Zhou, Shudao

2014-01-01

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

A New Fuzzy Harmony Search Algorithm Using Fuzzy Logic for Dynamic Parameter Adaptation

Directory of Open Access Journals (Sweden)

Cinthia Peraza

2016-10-01

Full Text Available In this paper, a new fuzzy harmony search algorithm (FHS for solving optimization problems is presented. FHS is based on a recent method using fuzzy logic for dynamic adaptation of the harmony memory accepting (HMR and pitch adjustment (PArate parameters that improve the convergence rate of traditional harmony search algorithm (HS. The objective of the method is to dynamically adjust the parameters in the range from 0.7 to 1. The impact of using fixed parameters in the harmony search algorithm is discussed and a strategy for efficiently tuning these parameters using fuzzy logic is presented. The FHS algorithm was successfully applied to different benchmarking optimization problems. The results of simulation and comparison studies demonstrate the effectiveness and efficiency of the proposed approach.

Induction Motor Parameter Identification Using a Gravitational Search Algorithm

Directory of Open Access Journals (Sweden)

Omar Avalos

2016-04-01

Full Text Available The efficient use of electrical energy is a topic that has attracted attention for its environmental consequences. On the other hand, induction motors represent the main component in most industries. They consume the highest energy percentages in industrial facilities. This energy consumption depends on the operation conditions of the induction motor imposed by its internal parameters. Since the internal parameters of an induction motor are not directly measurable, an identification process must be conducted to obtain them. In the identification process, the parameter estimation is transformed into a multidimensional optimization problem where the internal parameters of the induction motor are considered as decision variables. Under this approach, the complexity of the optimization problem tends to produce multimodal error surfaces for which their cost functions are significantly difficult to minimize. Several algorithms based on evolutionary computation principles have been successfully applied to identify the optimal parameters of induction motors. However, most of them maintain an important limitation: They frequently obtain sub-optimal solutions as a result of an improper equilibrium between exploitation and exploration in their search strategies. This paper presents an algorithm for the optimal parameter identification of induction motors. To determine the parameters, the proposed method uses a recent evolutionary method called the gravitational search algorithm (GSA. Different from most of the existent evolutionary algorithms, the GSA presents a better performance in multimodal problems, avoiding critical flaws such as the premature convergence to sub-optimal solutions. Numerical simulations have been conducted on several models to show the effectiveness of the proposed scheme.

Possible constraints on SUSY-model parameters from direct dark matter search

International Nuclear Information System (INIS)

Bednyakov, V.A.; Kovalenko, S.G.

1993-01-01

We consider the SUSY-model neutralino as a dominant Dark Matter particle in the galactic halo and investigate some general issues of direct DM searches via elastic neutralino-nucleus scattering. On the basis of conventional assumptions about the nuclear and nucleon structure, without referring to a specific SUSY-model, we prove that it is impossible in principle to extract more than three constrains on fundamental SUSY-model parameters from the direct Dark Matter searches. Three types of Dark Matter detector probing different groups of parameters are recognized. 21 refs., 1 tab

Searching for Clinically Relevant Biomarkers in Geriatric Oncology.

Science.gov (United States)

Katsila, Theodora; Patrinos, George P; Kardamakis, Dimitrios

2018-01-01

Ageing, which is associated with a progressive decline and functional deterioration in multiple organ systems, is highly heterogeneous, both inter- and intraindividually. For this, tailored-made theranostics and optimum patient stratification become fundamental, when decision-making in elderly patients is considered. In particular, when cancer incidence and cancer-related mortality and morbidity are taken into account, elderly patient care is a public health concern. In this review, we focus on oncogeriatrics and highlight current opportunities and challenges with an emphasis on the unmet need of clinically relevant biomarkers in elderly cancer patients. We performed a literature search on PubMed and Scopus databases for articles published in English between 2000 and 2017 coupled to text mining and analysis. Considering the top insights, we derived from our literature analysis that information knowledge needs to turn into knowledge growth in oncogeriatrics towards clinically relevant biomarkers, cost-effective practices, updated educational schemes for health professionals (in particular, geriatricians and oncologists), and awareness of ethical issues. We conclude with an interdisciplinary call to omics, geriatricians, oncologists, informatics, and policy-makers communities that Big Data should be translated into decision-making in the clinic.

Improved gravitational search algorithm for parameter identification of water turbine regulation system

International Nuclear Information System (INIS)

Chen, Zhihuan; Yuan, Xiaohui; Tian, Hao; Ji, Bin

2014-01-01

Highlights: • We propose an improved gravitational search algorithm (IGSA). • IGSA is applied to parameter identification of water turbine regulation system (WTRS). • WTRS is modeled by considering the impact of turbine speed on torque and water flow. • Weighted objective function strategy is applied to parameter identification of WTRS. - Abstract: Parameter identification of water turbine regulation system (WTRS) is crucial in precise modeling hydropower generating unit (HGU) and provides support for the adaptive control and stability analysis of power system. In this paper, an improved gravitational search algorithm (IGSA) is proposed and applied to solve the identification problem for WTRS system under load and no-load running conditions. This newly algorithm which is based on standard gravitational search algorithm (GSA) accelerates convergence speed with combination of the search strategy of particle swarm optimization and elastic-ball method. Chaotic mutation which is devised to stepping out the local optimal with a certain probability is also added into the algorithm to avoid premature. Furthermore, a new kind of model associated to the engineering practices is built and analyzed in the simulation tests. An illustrative example for parameter identification of WTRS is used to verify the feasibility and effectiveness of the proposed IGSA, as compared with standard GSA and particle swarm optimization in terms of parameter identification accuracy and convergence speed. The simulation results show that IGSA performs best for all identification indicators

Comparing the Influence of Title and URL in Information Retrieval Relevance in Search Engines Results between Human Science and Agriculture Science

Directory of Open Access Journals (Sweden)

Parisa Allami

2012-12-01

Full Text Available When the World Wide Web provides suitable methods for producing and publishing information to scientists, the Web has become a mediator to publishing information. This environment has been formed billions of web pages that each of them has a special title, special content, special address and special purpose. Search engines provide a variety of facilities limit search results to raise the possibility of relevance in the retrieval results. One of these facilities is the limitation of the keywords and search terms to the title or URL. It can increase the possibility of results relevance significantly. Search engines claim what are limited to title and URL is most relevant. This research tried to compare the results relevant between results limited in title and URL in agricultural and Humanities areas from their users sights also it notice to Comparison of the presence of keywords in the title and URL between two areas and the relationship between search query numbers and matching keywords in title and their URLs. For this purpose, the number of 30 students in each area whom were in MA process and in doing their thesis was chosen. There was a significant relevant of the results that they limited their information needs to title and URL. There was significantly relevance in URL results in agricultural area, but there was not any significant difference between title and URL results in the humanities. For comparing the number of keywords in title and URL in two areas, 30 keywords in each area were chosen. There was not any significantly difference between the number of keywords in the title and URL of websites in two areas. To show relationship between number of search keyword and the matching of title and URL 45 keywords in each area were chosen. They were divided to three parts (one keyword, two keywords and three keywords. It was determined that if search keyword was less, the amount of matching between title and URL was more and if the matching

Task relevance of emotional information affects anxiety-linked attention bias in visual search.

Science.gov (United States)

Dodd, Helen F; Vogt, Julia; Turkileri, Nilgun; Notebaert, Lies

2017-01-01

Task relevance affects emotional attention in healthy individuals. Here, we investigate whether the association between anxiety and attention bias is affected by the task relevance of emotion during an attention task. Participants completed two visual search tasks. In the emotion-irrelevant task, participants were asked to indicate whether a discrepant face in a crowd of neutral, middle-aged faces was old or young. Irrelevant to the task, target faces displayed angry, happy, or neutral expressions. In the emotion-relevant task, participants were asked to indicate whether a discrepant face in a crowd of middle-aged neutral faces was happy or angry (target faces also varied in age). Trait anxiety was not associated with attention in the emotion-relevant task. However, in the emotion-irrelevant task, trait anxiety was associated with a bias for angry over happy faces. These findings demonstrate that the task relevance of emotional information affects conclusions about the presence of an anxiety-linked attention bias. Copyright © 2016 Elsevier B.V. All rights reserved.

Parameter Identification of the 2-Chlorophenol Oxidation Model Using Improved Differential Search Algorithm

Directory of Open Access Journals (Sweden)

Guang-zhou Chen

2015-01-01

Full Text Available Parameter identification plays a crucial role for simulating and using model. This paper firstly carried out the sensitivity analysis of the 2-chlorophenol oxidation model in supercritical water using the Monte Carlo method. Then, to address the nonlinearity of the model, two improved differential search (DS algorithms were proposed to carry out the parameter identification of the model. One strategy is to adopt the Latin hypercube sampling method to replace the uniform distribution of initial population; the other is to combine DS with simplex method. The results of sensitivity analysis reveal the sensitivity and the degree of difficulty identified for every model parameter. Furthermore, the posteriori probability distribution of parameters and the collaborative relationship between any two parameters can be obtained. To verify the effectiveness of the improved algorithms, the optimization performance of improved DS in kinetic parameter estimation is studied and compared with that of the basic DS algorithm, differential evolution, artificial bee colony optimization, and quantum-behaved particle swarm optimization. And the experimental results demonstrate that the DS with the Latin hypercube sampling method does not present better performance, while the hybrid methods have the advantages of strong global search ability and local search ability and are more effective than the other algorithms.

Using ANFIS for selection of more relevant parameters to predict dew point temperature

International Nuclear Information System (INIS)

Mohammadi, Kasra; Shamshirband, Shahaboddin; Petković, Dalibor; Yee, Por Lip; Mansor, Zulkefli

2016-01-01

Highlights: • ANFIS is used to select the most relevant variables for dew point temperature prediction. • Two cities from the central and south central parts of Iran are selected as case studies. • Influence of 5 parameters on dew point temperature is evaluated. • Appropriate selection of input variables has a notable effect on prediction. • Considering the most relevant combination of 2 parameters would be more suitable. - Abstract: In this research work, for the first time, the adaptive neuro fuzzy inference system (ANFIS) is employed to propose an approach for identifying the most significant parameters for prediction of daily dew point temperature (T_d_e_w). The ANFIS process for variable selection is implemented, which includes a number of ways to recognize the parameters offering favorable predictions. According to the physical factors influencing the dew formation, 8 variables of daily minimum, maximum and average air temperatures (T_m_i_n, T_m_a_x and T_a_v_g), relative humidity (R_h), atmospheric pressure (P), water vapor pressure (V_P), sunshine hour (n) and horizontal global solar radiation (H) are considered to investigate their effects on T_d_e_w. The used data include 7 years daily measured data of two Iranian cities located in the central and south central parts of the country. The results indicate that despite climate difference between the considered case studies, for both stations, V_P is the most influential variable while R_h is the least relevant element. Furthermore, the combination of T_m_i_n and V_P is recognized as the most influential set to predict T_d_e_w. The conducted examinations show that there is a remarkable difference between the errors achieved for most and less relevant input parameters, which highlights the importance of appropriate selection of input parameters. The use of more than two inputs may not be advisable and appropriate; thus, considering the most relevant combination of 2 parameters would be more suitable

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

A Novel adaptative Discrete Cuckoo Search Algorithm for parameter optimization in computer vision

Directory of Open Access Journals (Sweden)

loubna benchikhi

2017-10-01

Full Text Available Computer vision applications require choosing operators and their parameters, in order to provide the best outcomes. Often, the users quarry on expert knowledge and must experiment many combinations to find manually the best one. As performance, time and accuracy are important, it is necessary to automate parameter optimization at least for crucial operators. In this paper, a novel approach based on an adaptive discrete cuckoo search algorithm (ADCS is proposed. It automates the process of algorithms’ setting and provides optimal parameters for vision applications. This work reconsiders a discretization problem to adapt the cuckoo search algorithm and presents the procedure of parameter optimization. Some experiments on real examples and comparisons to other metaheuristic-based approaches: particle swarm optimization (PSO, reinforcement learning (RL and ant colony optimization (ACO show the efficiency of this novel method.

Harmony Search Based Parameter Ensemble Adaptation for Differential Evolution

Directory of Open Access Journals (Sweden)

Rammohan Mallipeddi

2013-01-01

Full Text Available In differential evolution (DE algorithm, depending on the characteristics of the problem at hand and the available computational resources, different strategies combined with a different set of parameters may be effective. In addition, a single, well-tuned combination of strategies and parameters may not guarantee optimal performance because different strategies combined with different parameter settings can be appropriate during different stages of the evolution. Therefore, various adaptive/self-adaptive techniques have been proposed to adapt the DE strategies and parameters during the course of evolution. In this paper, we propose a new parameter adaptation technique for DE based on ensemble approach and harmony search algorithm (HS. In the proposed method, an ensemble of parameters is randomly sampled which form the initial harmony memory. The parameter ensemble evolves during the course of the optimization process by HS algorithm. Each parameter combination in the harmony memory is evaluated by testing them on the DE population. The performance of the proposed adaptation method is evaluated using two recently proposed strategies (DE/current-to-pbest/bin and DE/current-to-gr_best/bin as basic DE frameworks. Numerical results demonstrate the effectiveness of the proposed adaptation technique compared to the state-of-the-art DE based algorithms on a set of challenging test problems (CEC 2005.

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

Safe structural food bolus in elderly: the relevant parameters

OpenAIRE

Vandenberghe-Descamps, Mathilde; Septier, Chantal; Prot, Aurélie; Tournier, Carole; Hennequin, Martine; Vigneau, Evelyne; Feron, Gilles; Labouré, Hélène

2017-01-01

Mastication is essential to prepare food into a bolus ready to be swallowed safely, with no choking risk. Based on food bolus properties, a masticatory normative indicator was developed by Woda et al. (2010) to identify impaired masticatory function within good oral health population. The aim of the present study was to identify relevant parameters of bolus' structure to differentiate safe to unsafe bolus among elderly contrasting by their dental status.93 elderly, 58% with at least 7 posteri...

What is lost when searching only one literature database for articles relevant to injury prevention and safety promotion?

Science.gov (United States)

Lawrence, D W

2008-12-01

To assess what is lost if only one literature database is searched for articles relevant to injury prevention and safety promotion (IPSP) topics. Serial textword (keyword, free-text) searches using multiple synonym terms for five key IPSP topics (bicycle-related brain injuries, ethanol-impaired driving, house fires, road rage, and suicidal behaviors among adolescents) were conducted in four of the bibliographic databases that are most used by IPSP professionals: EMBASE, MEDLINE, PsycINFO, and Web of Science. Through a systematic procedure, an inventory of articles on each topic in each database was conducted to identify the total unduplicated count of all articles on each topic, the number of articles unique to each database, and the articles available if only one database is searched. No single database included all of the relevant articles on any topic, and the database with the broadest coverage differed by topic. A search of only one literature database will return 16.7-81.5% (median 43.4%) of the available articles on any of five key IPSP topics. Each database contributed unique articles to the total bibliography for each topic. A literature search performed in only one database will, on average, lead to a loss of more than half of the available literature on a topic.

PubMed Interact: an Interactive Search Application for MEDLINE/PubMed

Science.gov (United States)

Muin, Michael; Fontelo, Paul; Ackerman, Michael

2006-01-01

Online search and retrieval systems are important resources for medical literature research. Progressive Web 2.0 technologies provide opportunities to improve search strategies and user experience. Using PHP, Document Object Model (DOM) manipulation and Asynchronous JavaScript and XML (Ajax), PubMed Interact allows greater functionality so users can refine search parameters with ease and interact with the search results to retrieve and display relevant information and related articles. PMID:17238658

Proactive Support of Internet Browsing when Searching for Relevant Health Information.

Science.gov (United States)

Rurik, Clas; Zowalla, Richard; Wiesner, Martin; Pfeifer, Daniel

2015-01-01

Many people use the Internet as one of the primary sources of health information. This is due to the high volume and easy access of freely available information regarding diseases, diagnoses and treatments. However, users may find it difficult to retrieve information which is easily understandable and does not require a deep medical background. In this paper, we present a new kind of Web browser add-on, in order to proactively support users when searching for relevant health information. Our add-on not only visualizes the understandability of displayed medical text but also provides further recommendations of Web pages which hold similar content but are potentially easier to comprehend.

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.

Application of all relevant feature selection for failure analysis of parameter-induced simulation crashes in climate models

Science.gov (United States)

Paja, W.; Wrzesień, M.; Niemiec, R.; Rudnicki, W. R.

2015-07-01

The climate models are extremely complex pieces of software. They reflect best knowledge on physical components of the climate, nevertheless, they contain several parameters, which are too weakly constrained by observations, and can potentially lead to a crash of simulation. Recently a study by Lucas et al. (2013) has shown that machine learning methods can be used for predicting which combinations of parameters can lead to crash of simulation, and hence which processes described by these parameters need refined analyses. In the current study we reanalyse the dataset used in this research using different methodology. We confirm the main conclusion of the original study concerning suitability of machine learning for prediction of crashes. We show, that only three of the eight parameters indicated in the original study as relevant for prediction of the crash are indeed strongly relevant, three other are relevant but redundant, and two are not relevant at all. We also show that the variance due to split of data between training and validation sets has large influence both on accuracy of predictions and relative importance of variables, hence only cross-validated approach can deliver robust prediction of performance and relevance of variables.

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

Science.gov (United States)

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

2016-01-01

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

MememxGATE: Unearthing Latent Content Features for Improved Search and Relevancy Ranking Across Scientific Literature

Science.gov (United States)

Wilson, B. D.; McGibbney, L. J.; Mattmann, C. A.; Ramirez, P.; Joyce, M.; Whitehall, K. D.

2015-12-01

Quantifying scientific relevancy is of increasing importance to NASA and the research community. Scientific relevancy may be defined by mapping the impacts of a particular NASA mission, instrument, and/or retrieved variables to disciplines such as climate predictions, natural hazards detection and mitigation processes, education, and scientific discoveries. Related to relevancy, is the ability to expose data with similar attributes. This in turn depends upon the ability for us to extract latent, implicit document features from scientific data and resources and make them explicit, accessible and useable for search activities amongst others. This paper presents MemexGATE; a server side application, command line interface and computing environment for running large scale metadata extraction, general architecture text engineering, document classification and indexing tasks over document resources such as social media streams, scientific literature archives, legal documentation, etc. This work builds on existing experiences using MemexGATE (funded, developed and validated through the DARPA Memex Progrjam PI Mattmann) for extracting and leveraging latent content features from document resources within the Materials Research domain. We extend the software functionality capability to the domain of scientific literature with emphasis on the expansion of gazetteer lists, named entity rules, natural language construct labeling (e.g. synonym, antonym, hyponym, etc.) efforts to enable extraction of latent content features from data hosted by wide variety of scientific literature vendors (AGU Meeting Abstract Database, Springer, Wiley Online, Elsevier, etc.) hosting earth science literature. Such literature makes both implicit and explicit references to NASA datasets and relationships between such concepts stored across EOSDIS DAAC's hence we envisage that a significant part of this effort will also include development and understanding of relevancy signals which can ultimately

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.

Eysenbach, Tuische and Diepgen’s Evaluation of Web Searching for Identifying Unpublished Studies for Systematic Reviews: An Innovative Study Which is Still Relevant Today.

Directory of Open Access Journals (Sweden)

Simon Briscoe

2016-09-01

Full Text Available A Review of: Eysenbach, G., Tuische, J. & Diepgen, T.L. (2001. Evaluation of the usefulness of Internet searches to identify unpublished clinical trials for systematic reviews. Medical Informatics and the Internet in Medicine, 26(3, 203-218. http://dx.doi.org/10.1080/14639230110075459 Objective – To consider whether web searching is a useful method for identifying unpublished studies for inclusion in systematic reviews. Design – Retrospective web searches using the AltaVista search engine were conducted to identify unpublished studies – specifically, clinical trials – for systematic reviews which did not use a web search engine. Setting – The Department of Clinical Social Medicine, University of Heidelberg, Germany. Subjects – n/a Methods – Pilot testing of 11 web search engines was carried out to determine which could handle complex search queries. Pre-specified search requirements included the ability to handle Boolean and proximity operators, and truncation searching. A total of seven Cochrane systematic reviews were randomly selected from the Cochrane Library Issue 2, 1998, and their bibliographic database search strategies were adapted for the web search engine, AltaVista. Each adaptation combined search terms for the intervention, problem, and study type in the systematic review. Hints to planned, ongoing, or unpublished studies retrieved by the search engine, which were not cited in the systematic reviews, were followed up by visiting websites and contacting authors for further details when required. The authors of the systematic reviews were then contacted and asked to comment on the potential relevance of the identified studies. Main Results – Hints to 14 unpublished and potentially relevant studies, corresponding to 4 of the 7 randomly selected Cochrane systematic reviews, were identified. Out of the 14 studies, 2 were considered irrelevant to the corresponding systematic review by the systematic review authors. The

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

Directory of Open Access Journals (Sweden)

Zhihua Zhang

2016-01-01

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

Effect of Mental State on the Rate of Identifying the Relevancy of Documents Retrieved in a Search

Directory of Open Access Journals (Sweden)

Faezeh Farhoudi

2009-07-01

Full Text Available The present study investigates the link between various users’ mental state while searching information systems with the outcome of the resulting documents retrieved. Various factors such as user knowledge, search skills, motivation and aims influence the decisions and evaluation of users regarding documents retrieved. MMPI instrument was used to identify users’ mental states. The sample was drawn from female senior students of librarianship, using systematic random sampling. The findings indicated that anxiety and depression have significant inverse relationship to the rate of relevancy identification of the documents retrieved by the users.

Application of all-relevant feature selection for the failure analysis of parameter-induced simulation crashes in climate models

Science.gov (United States)

Paja, Wiesław; Wrzesien, Mariusz; Niemiec, Rafał; Rudnicki, Witold R.

2016-03-01

Climate models are extremely complex pieces of software. They reflect the best knowledge on the physical components of the climate; nevertheless, they contain several parameters, which are too weakly constrained by observations, and can potentially lead to a simulation crashing. Recently a study by Lucas et al. (2013) has shown that machine learning methods can be used for predicting which combinations of parameters can lead to the simulation crashing and hence which processes described by these parameters need refined analyses. In the current study we reanalyse the data set used in this research using different methodology. We confirm the main conclusion of the original study concerning the suitability of machine learning for the prediction of crashes. We show that only three of the eight parameters indicated in the original study as relevant for prediction of the crash are indeed strongly relevant, three others are relevant but redundant and two are not relevant at all. We also show that the variance due to the split of data between training and validation sets has a large influence both on the accuracy of predictions and on the relative importance of variables; hence only a cross-validated approach can deliver a robust prediction of performance and relevance of variables.

Passage relevance models for genomics search

Directory of Open Access Journals (Sweden)

Frieder Ophir

2009-03-01

Full Text Available Abstract We present a passage relevance model for integrating syntactic and semantic evidence of biomedical concepts and topics using a probabilistic graphical model. Component models of topics, concepts, terms, and document are represented as potential functions within a Markov Random Field. The probability of a passage being relevant to a biologist's information need is represented as the joint distribution across all potential functions. Relevance model feedback of top ranked passages is used to improve distributional estimates of query concepts and topics in context, and a dimensional indexing strategy is used for efficient aggregation of concept and term statistics. By integrating multiple sources of evidence including dependencies between topics, concepts, and terms, we seek to improve genomics literature passage retrieval precision. Using this model, we are able to demonstrate statistically significant improvements in retrieval precision using a large genomics literature corpus.

Repository environmental parameters and models/methodologies relevant to assessing the performance of high-level waste packages in basalt, tuff, and salt

Energy Technology Data Exchange (ETDEWEB)

Claiborne, H.C.; Croff, A.G.; Griess, J.C.; Smith, F.J.

1987-09-01

This document provides specifications for models/methodologies that could be employed in determining postclosure repository environmental parameters relevant to the performance of high-level waste packages for the Basalt Waste Isolation Project (BWIP) at Richland, Washington, the tuff at Yucca Mountain by the Nevada Test Site, and the bedded salt in Deaf Smith County, Texas. Guidance is provided on the identify of the relevant repository environmental parameters; the models/methodologies employed to determine the parameters, and the input data base for the models/methodologies. Supporting studies included are an analysis of potential waste package failure modes leading to identification of the relevant repository environmental parameters, an evaluation of the credible range of the repository environmental parameters, and a summary of the review of existing models/methodologies currently employed in determining repository environmental parameters relevant to waste package performance. 327 refs., 26 figs., 19 tabs.

Repository environmental parameters and models/methodologies relevant to assessing the performance of high-level waste packages in basalt, tuff, and salt

International Nuclear Information System (INIS)

Claiborne, H.C.; Croff, A.G.; Griess, J.C.; Smith, F.J.

1987-09-01

This document provides specifications for models/methodologies that could be employed in determining postclosure repository environmental parameters relevant to the performance of high-level waste packages for the Basalt Waste Isolation Project (BWIP) at Richland, Washington, the tuff at Yucca Mountain by the Nevada Test Site, and the bedded salt in Deaf Smith County, Texas. Guidance is provided on the identify of the relevant repository environmental parameters; the models/methodologies employed to determine the parameters, and the input data base for the models/methodologies. Supporting studies included are an analysis of potential waste package failure modes leading to identification of the relevant repository environmental parameters, an evaluation of the credible range of the repository environmental parameters, and a summary of the review of existing models/methodologies currently employed in determining repository environmental parameters relevant to waste package performance. 327 refs., 26 figs., 19 tabs

Simplified Models for LHC New Physics Searches

International Nuclear Information System (INIS)

Alves, Daniele; Arkani-Hamed, Nima; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R. Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto

2012-01-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first ∼ 50-500 pb -1 of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

Simplified Models for LHC New Physics Searches

Energy Technology Data Exchange (ETDEWEB)

Alves, Daniele; /SLAC; Arkani-Hamed, Nima; /Princeton, Inst. Advanced Study; Arora, Sanjay; /Rutgers U., Piscataway; Bai, Yang; /SLAC; Baumgart, Matthew; /Johns Hopkins U.; Berger, Joshua; /Cornell U., Phys. Dept.; Buckley, Matthew; /Fermilab; Butler, Bart; /SLAC; Chang, Spencer; /Oregon U. /UC, Davis; Cheng, Hsin-Chia; /UC, Davis; Cheung, Clifford; /UC, Berkeley; Chivukula, R.Sekhar; /Michigan State U.; Cho, Won Sang; /Tokyo U.; Cotta, Randy; /SLAC; D' Alfonso, Mariarosaria; /UC, Santa Barbara; El Hedri, Sonia; /SLAC; Essig, Rouven, (ed.); /SLAC; Evans, Jared A.; /UC, Davis; Fitzpatrick, Liam; /Boston U.; Fox, Patrick; /Fermilab; Franceschini, Roberto; /LPHE, Lausanne /Pittsburgh U. /Argonne /Northwestern U. /Rutgers U., Piscataway /Rutgers U., Piscataway /Carleton U. /CERN /UC, Davis /Wisconsin U., Madison /SLAC /SLAC /SLAC /Rutgers U., Piscataway /Syracuse U. /SLAC /SLAC /Boston U. /Rutgers U., Piscataway /Seoul Natl. U. /Tohoku U. /UC, Santa Barbara /Korea Inst. Advanced Study, Seoul /Harvard U., Phys. Dept. /Michigan U. /Wisconsin U., Madison /Princeton U. /UC, Santa Barbara /Wisconsin U., Madison /Michigan U. /UC, Davis /SUNY, Stony Brook /TRIUMF; /more authors..

2012-06-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first {approx} 50-500 pb{sup -1} of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

Searching the ASRS Database Using QUORUM Keyword Search, Phrase Search, Phrase Generation, and Phrase Discovery

Science.gov (United States)

McGreevy, Michael W.; Connors, Mary M. (Technical Monitor)

2001-01-01

To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.

Hands-on parameter search for neural simulations by a MIDI-controller.

Science.gov (United States)

Eichner, Hubert; Borst, Alexander

2011-01-01

Computational neuroscientists frequently encounter the challenge of parameter fitting--exploring a usually high dimensional variable space to find a parameter set that reproduces an experimental data set. One common approach is using automated search algorithms such as gradient descent or genetic algorithms. However, these approaches suffer several shortcomings related to their lack of understanding the underlying question, such as defining a suitable error function or getting stuck in local minima. Another widespread approach is manual parameter fitting using a keyboard or a mouse, evaluating different parameter sets following the users intuition. However, this process is often cumbersome and time-intensive. Here, we present a new method for manual parameter fitting. A MIDI controller provides input to the simulation software, where model parameters are then tuned according to the knob and slider positions on the device. The model is immediately updated on every parameter change, continuously plotting the latest results. Given reasonably short simulation times of less than one second, we find this method to be highly efficient in quickly determining good parameter sets. Our approach bears a close resemblance to tuning the sound of an analog synthesizer, giving the user a very good intuition of the problem at hand, such as immediate feedback if and how results are affected by specific parameter changes. In addition to be used in research, our approach should be an ideal teaching tool, allowing students to interactively explore complex models such as Hodgkin-Huxley or dynamical systems.

Hands-on parameter search for neural simulations by a MIDI-controller.

Directory of Open Access Journals (Sweden)

Hubert Eichner

Full Text Available Computational neuroscientists frequently encounter the challenge of parameter fitting--exploring a usually high dimensional variable space to find a parameter set that reproduces an experimental data set. One common approach is using automated search algorithms such as gradient descent or genetic algorithms. However, these approaches suffer several shortcomings related to their lack of understanding the underlying question, such as defining a suitable error function or getting stuck in local minima. Another widespread approach is manual parameter fitting using a keyboard or a mouse, evaluating different parameter sets following the users intuition. However, this process is often cumbersome and time-intensive. Here, we present a new method for manual parameter fitting. A MIDI controller provides input to the simulation software, where model parameters are then tuned according to the knob and slider positions on the device. The model is immediately updated on every parameter change, continuously plotting the latest results. Given reasonably short simulation times of less than one second, we find this method to be highly efficient in quickly determining good parameter sets. Our approach bears a close resemblance to tuning the sound of an analog synthesizer, giving the user a very good intuition of the problem at hand, such as immediate feedback if and how results are affected by specific parameter changes. In addition to be used in research, our approach should be an ideal teaching tool, allowing students to interactively explore complex models such as Hodgkin-Huxley or dynamical systems.

Parameter Estimation for Traffic Noise Models Using a Harmony Search Algorithm

Directory of Open Access Journals (Sweden)

Deok-Soon An

2013-01-01

Full Text Available A technique has been developed for predicting road traffic noise for environmental assessment, taking into account traffic volume as well as road surface conditions. The ASJ model (ASJ Prediction Model for Road Traffic Noise, 1999, which is based on the sound power level of the noise emitted by the interaction between the road surface and tires, employs regression models for two road surface types: dense-graded asphalt (DGA and permeable asphalt (PA. However, these models are not applicable to other types of road surfaces. Accordingly, this paper introduces a parameter estimation procedure for ASJ-based noise prediction models, utilizing a harmony search (HS algorithm. Traffic noise measurement data for four different vehicle types were used in the algorithm to determine the regression parameters for several road surface types. The parameters of the traffic noise prediction models were evaluated using another measurement set, and good agreement was observed between the predicted and measured sound power levels.

A summary report on the search for current technologies and developers to develop depth profiling/physical parameter end effectors

International Nuclear Information System (INIS)

Nguyen, Q.H.

1994-01-01

This report documents the search strategies and results for available technologies and developers to develop tank waste depth profiling/physical parameter sensors. Sources searched include worldwide research reports, technical papers, journals, private industries, and work at Westinghouse Hanford Company (WHC) at Richland site. Tank waste physical parameters of interest are: abrasiveness, compressive strength, corrosiveness, density, pH, particle size/shape, porosity, radiation, settling velocity, shear strength, shear wave velocity, tensile strength, temperature, viscosity, and viscoelasticity. A list of related articles or sources for each physical parameters is provided

A summary report on the search for current technologies and developers to develop depth profiling/physical parameter end effectors

Energy Technology Data Exchange (ETDEWEB)

Nguyen, Q.H.

1994-09-12

This report documents the search strategies and results for available technologies and developers to develop tank waste depth profiling/physical parameter sensors. Sources searched include worldwide research reports, technical papers, journals, private industries, and work at Westinghouse Hanford Company (WHC) at Richland site. Tank waste physical parameters of interest are: abrasiveness, compressive strength, corrosiveness, density, pH, particle size/shape, porosity, radiation, settling velocity, shear strength, shear wave velocity, tensile strength, temperature, viscosity, and viscoelasticity. A list of related articles or sources for each physical parameters is provided.

Optimization of Nano-Process Deposition Parameters Based on Gravitational Search Algorithm

Directory of Open Access Journals (Sweden)

Norlina Mohd Sabri

2016-06-01

Full Text Available This research is focusing on the radio frequency (RF magnetron sputtering process, a physical vapor deposition technique which is widely used in thin film production. This process requires the optimized combination of deposition parameters in order to obtain the desirable thin film. The conventional method in the optimization of the deposition parameters had been reported to be costly and time consuming due to its trial and error nature. Thus, gravitational search algorithm (GSA technique had been proposed to solve this nano-process parameters optimization problem. In this research, the optimized parameter combination was expected to produce the desirable electrical and optical properties of the thin film. The performance of GSA in this research was compared with that of Particle Swarm Optimization (PSO, Genetic Algorithm (GA, Artificial Immune System (AIS and Ant Colony Optimization (ACO. Based on the overall results, the GSA optimized parameter combination had generated the best electrical and an acceptable optical properties of thin film compared to the others. This computational experiment is expected to overcome the problem of having to conduct repetitive laboratory experiments in obtaining the most optimized parameter combination. Based on this initial experiment, the adaptation of GSA into this problem could offer a more efficient and productive way of depositing quality thin film in the fabrication process.

Evolutionary relevance facilitates visual information processing.

Science.gov (United States)

Jackson, Russell E; Calvillo, Dusti P

2013-11-03

Visual search of the environment is a fundamental human behavior that perceptual load affects powerfully. Previously investigated means for overcoming the inhibitions of high perceptual load, however, generalize poorly to real-world human behavior. We hypothesized that humans would process evolutionarily relevant stimuli more efficiently than evolutionarily novel stimuli, and evolutionary relevance would mitigate the repercussions of high perceptual load during visual search. Animacy is a significant component to evolutionary relevance of visual stimuli because perceiving animate entities is time-sensitive in ways that pose significant evolutionary consequences. Participants completing a visual search task located evolutionarily relevant and animate objects fastest and with the least impact of high perceptual load. Evolutionarily novel and inanimate objects were located slowest and with the highest impact of perceptual load. Evolutionary relevance may importantly affect everyday visual information processing.

Efficient Parameter Searches for Colloidal Materials Design with Digital Alchemy

Science.gov (United States)

Dodd, Paul, M.; Geng, Yina; van Anders, Greg; Glotzer, Sharon C.

Optimal colloidal materials design is challenging, even for high-throughput or genomic approaches, because the design space provided by modern colloid synthesis techniques can easily have dozens of dimensions. In this talk we present the methodology of an inverse approach we term ''digital alchemy'' to perform rapid searches of design-paramenter spaces with up to 188 dimensions that yield thermodynamically optimal colloid parameters for target crystal structures with up to 20 particles in a unit cell. The method relies only on fundamental principles of statistical mechanics and Metropolis Monte Carlo techniques, and yields particle attribute tolerances via analogues of familiar stress-strain relationships.

Searches for SUSY at LHC

International Nuclear Information System (INIS)

Kharchilava, A.

1997-01-01

One of the main motivations of experiments at the LHC is to search for SUSY particles. The talk is based on recent analyses, performed by CMS Collaboration, within the framework of the Supergravity motivated minimal SUSY extension of the Standard Model. The emphasis is put on leptonic channels. The strategies for obtaining experimental signatures for strongly and weakly interacting sparticles productions, as well as examples of determination of SUSY masses and model parameters are discussed. The domain of parameter space where SUSY can be discovered is investigated. Results show, that if SUSY is of relevance at Electro-Weak scale it could hardly escape detection at LHC. (author)

Evolutionary Relevance Facilitates Visual Information Processing

Directory of Open Access Journals (Sweden)

Russell E. Jackson

2013-07-01

Full Text Available Visual search of the environment is a fundamental human behavior that perceptual load affects powerfully. Previously investigated means for overcoming the inhibitions of high perceptual load, however, generalize poorly to real-world human behavior. We hypothesized that humans would process evolutionarily relevant stimuli more efficiently than evolutionarily novel stimuli, and evolutionary relevance would mitigate the repercussions of high perceptual load during visual search. Animacy is a significant component to evolutionary relevance of visual stimuli because perceiving animate entities is time-sensitive in ways that pose significant evolutionary consequences. Participants completing a visual search task located evolutionarily relevant and animate objects fastest and with the least impact of high perceptual load. Evolutionarily novel and inanimate objects were located slowest and with the highest impact of perceptual load. Evolutionary relevance may importantly affect everyday visual information processing.

Bayesian uncertainty analysis for complex systems biology models: emulation, global parameter searches and evaluation of gene functions.

Science.gov (United States)

Vernon, Ian; Liu, Junli; Goldstein, Michael; Rowe, James; Topping, Jen; Lindsey, Keith

2018-01-02

Many mathematical models have now been employed across every area of systems biology. These models increasingly involve large numbers of unknown parameters, have complex structure which can result in substantial evaluation time relative to the needs of the analysis, and need to be compared to observed data of various forms. The correct analysis of such models usually requires a global parameter search, over a high dimensional parameter space, that incorporates and respects the most important sources of uncertainty. This can be an extremely difficult task, but it is essential for any meaningful inference or prediction to be made about any biological system. It hence represents a fundamental challenge for the whole of systems biology. Bayesian statistical methodology for the uncertainty analysis of complex models is introduced, which is designed to address the high dimensional global parameter search problem. Bayesian emulators that mimic the systems biology model but which are extremely fast to evaluate are embeded within an iterative history match: an efficient method to search high dimensional spaces within a more formal statistical setting, while incorporating major sources of uncertainty. The approach is demonstrated via application to a model of hormonal crosstalk in Arabidopsis root development, which has 32 rate parameters, for which we identify the sets of rate parameter values that lead to acceptable matches between model output and observed trend data. The multiple insights into the model's structure that this analysis provides are discussed. The methodology is applied to a second related model, and the biological consequences of the resulting comparison, including the evaluation of gene functions, are described. Bayesian uncertainty analysis for complex models using both emulators and history matching is shown to be a powerful technique that can greatly aid the study of a large class of systems biology models. It both provides insight into model behaviour

The estimation of effective doses using measurement of several relevant physical parameters from radon exposures

International Nuclear Information System (INIS)

Ridzikova, A; Fronka, A.; Maly, B.; Moucka, L.

2003-01-01

In the present investigation, we will be study the dose relevant factors from continual monitoring in real homes into account getting more accurate estimation of 222 Rn the effective dose. The dose relevant parameters include the radon concentration, the equilibrium factor (f), the fraction (fp) of unattached radon decay products and real time occupancy people in home. The result of the measurement are the time courses of radon concentration that are based on estimation effective doses together with assessment of the real time occupancy people indoor. We found out by analysis that year effective dose is lower than effective dose estimated by ICRP recommendation from the integral measurement that included only average radon concentration. Our analysis of estimation effective doses using measurement of several physical parameters was made only in one case and for the better specification is important to measure in different real occupancy houses. (authors)

Predictive Feature Selection for Genetic Policy Search

Science.gov (United States)

2014-05-22

limited manual intervention are becoming increasingly desirable as more complex tasks in dynamic and high- tempo environments are explored. Reinforcement...states in many domains causes features relevant to the reward variations to be overlooked, which hinders the policy search. 3.4 Parameter Selection PFS...the current feature subset. This local minimum may be “deceptive,” meaning that it does not clearly lead to the global optimal policy ( Goldberg and

Data Albums: An Event Driven Search, Aggregation and Curation Tool for Earth Science

Science.gov (United States)

Ramachandran, Rahul; Kulkarni, Ajinkya; Maskey, Manil; Bakare, Rohan; Basyal, Sabin; Li, Xiang; Flynn, Shannon

2014-01-01

Approaches used in Earth science research such as case study analysis and climatology studies involve discovering and gathering diverse data sets and information to support the research goals. To gather relevant data and information for case studies and climatology analysis is both tedious and time consuming. Current Earth science data systems are designed with the assumption that researchers access data primarily by instrument or geophysical parameter. In cases where researchers are interested in studying a significant event, they have to manually assemble a variety of datasets relevant to it by searching the different distributed data systems. This paper presents a specialized search, aggregation and curation tool for Earth science to address these challenges. The search rool automatically creates curated 'Data Albums', aggregated collections of information related to a specific event, containing links to relevant data files [granules] from different instruments, tools and services for visualization and analysis, and information about the event contained in news reports, images or videos to supplement research analysis. Curation in the tool is driven via an ontology based relevancy ranking algorithm to filter out non relevant information and data.

Relevance and Phrase Searching in Summon: looking under the hood

Directory of Open Access Journals (Sweden)

Thomas Hodge

2013-07-01

Full Text Available This article briefly examines the mechanisms behind seemingly counter-intuitive phrase search results in Serials Solutions’ discovery platform Summon. The authors use the platform’s search API to explain why users sometimes encounter greater numbers of results when typically they would expect fewer. The article explores the reasons behind the search results and the implications for library instruction.

A new code for parameter estimation in searches for gravitational waves from known pulsars

International Nuclear Information System (INIS)

Pitkin, M; Gill, C; Macdonald, E; Woan, G; Veitch, J

2012-01-01

We describe the consistency testing of a new code for gravitational wave signal parameter estimation in known pulsar searches. The code uses an implementation of nested sampling to explore the likelihood volume. Using fake signals and simulated noise we compare this to a previous code that calculated the signal parameter posterior distributions on both a grid and using a crude Markov chain Monte Carlo (MCMC) method. We define a new parameterisation of two orientation angles of neutron stars used in the signal model (the initial phase and polarisation angle), which breaks a degeneracy between them and allows more efficient exploration of those parameters. Finally, we briefly describe potential areas for further study and the uses of this code in the future.

Simultaneous determination of aquifer parameters and zone structures with fuzzy c-means clustering and meta-heuristic harmony search algorithm

Science.gov (United States)

Ayvaz, M. Tamer

2007-11-01

This study proposes an inverse solution algorithm through which both the aquifer parameters and the zone structure of these parameters can be determined based on a given set of observations on piezometric heads. In the zone structure identification problem fuzzy c-means ( FCM) clustering method is used. The association of the zone structure with the transmissivity distribution is accomplished through an optimization model. The meta-heuristic harmony search ( HS) algorithm, which is conceptualized using the musical process of searching for a perfect state of harmony, is used as an optimization technique. The optimum parameter zone structure is identified based on three criteria which are the residual error, parameter uncertainty, and structure discrimination. A numerical example given in the literature is solved to demonstrate the performance of the proposed algorithm. Also, a sensitivity analysis is performed to test the performance of the HS algorithm for different sets of solution parameters. Results indicate that the proposed solution algorithm is an effective way in the simultaneous identification of aquifer parameters and their corresponding zone structures.

On the Interpretation of Top Partners Searches

CERN Document Server

Matsedonskyi, Oleksii; Wulzer, Andrea

2014-01-01

Relatively light Top Partners are unmistakable signatures of reasonably Natural Composite Higgs models and as such they are worth searching for at the LHC. Their phenomenology is characterized by a certain amount of model-dependence, which makes the interpretation of Top Partner experimental searches not completely straightforward especially if one is willing to take also single production into account. We describe a model-independent strategy by which the interpretation is provided on the parameter space of a Simplified Model that captures the relevant features of all the explicit constructions. The Simplified Model limits are easy to interpret within explicit models, in a way that requires no recasting and no knowledge of the experimental details of the analyses. We illustrate the method by concrete examples, among which the searches for a charge 5/3 Partner in same-sign dileptons and the searches for a charge 2/3 singlet. In each case we perform a theory recasting of the available 8 TeV Run-1 results and a...

Enabling Searches on Wavelengths in a Hyperspectral Indices Database

Science.gov (United States)

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

2017-10-01

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

Parameter estimation by Differential Search Algorithm from horizontal loop electromagnetic (HLEM) data

Science.gov (United States)

Alkan, Hilal; Balkaya, Çağlayan

2018-02-01

We present an efficient inversion tool for parameter estimation from horizontal loop electromagnetic (HLEM) data using Differential Search Algorithm (DSA) which is a swarm-intelligence-based metaheuristic proposed recently. The depth, dip, and origin of a thin subsurface conductor causing the anomaly are the parameters estimated by the HLEM method commonly known as Slingram. The applicability of the developed scheme was firstly tested on two synthetically generated anomalies with and without noise content. Two control parameters affecting the convergence characteristic to the solution of the algorithm were tuned for the so-called anomalies including one and two conductive bodies, respectively. Tuned control parameters yielded more successful statistical results compared to widely used parameter couples in DSA applications. Two field anomalies measured over a dipping graphitic shale from Northern Australia were then considered, and the algorithm provided the depth estimations being in good agreement with those of previous studies and drilling information. Furthermore, the efficiency and reliability of the results obtained were investigated via probability density function. Considering the results obtained, we can conclude that DSA characterized by the simple algorithmic structure is an efficient and promising metaheuristic for the other relatively low-dimensional geophysical inverse problems. Finally, the researchers after being familiar with the content of developed scheme displaying an easy to use and flexible characteristic can easily modify and expand it for their scientific optimization problems.

Finding Relevant Parameters for the Thin-film Photovoltaic Cells Production Process with the Application of Data Mining Methods.

Science.gov (United States)

Ulaczyk, Jan; Morawiec, Krzysztof; Zabierowski, Paweł; Drobiazg, Tomasz; Barreau, Nicolas

2017-09-01

A data mining approach is proposed as a useful tool for the control parameters analysis of the 3-stage CIGSe photovoltaic cell production process, in order to find variables that are the most relevant for cell electric parameters and efficiency. The analysed data set consists of stage duration times, heater power values as well as temperatures for the element sources and the substrate - there are 14 variables per sample in total. The most relevant variables of the process have been found based on the so-called random forest analysis with the application of the Boruta algorithm. 118 CIGSe samples, prepared at Institut des Matériaux Jean Rouxel, were analysed. The results are close to experimental knowledge on the CIGSe cells production process. They bring new evidence to production parameters of new cells and further research. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Safety analysis methodology with assessment of the impact of the prediction errors of relevant parameters

International Nuclear Information System (INIS)

Galia, A.V.

2011-01-01

The best estimate plus uncertainty approach (BEAU) requires the use of extensive resources and therefore it is usually applied for cases in which the available safety margin obtained with a conservative methodology can be questioned. Outside the BEAU methodology, there is not a clear approach on how to deal with the issue of considering the uncertainties resulting from prediction errors in the safety analyses performed for licensing submissions. However, the regulatory document RD-310 mentions that the analysis method shall account for uncertainties in the analysis data and models. A possible approach is presented, that is simple and reasonable, representing just the author's views, to take into account the impact of prediction errors and other uncertainties when performing safety analysis in line with regulatory requirements. The approach proposes taking into account the prediction error of relevant parameters. Relevant parameters would be those plant parameters that are surveyed and are used to initiate the action of a mitigating system or those that are representative of the most challenging phenomena for the integrity of a fission barrier. Examples of the application of the methodology are presented involving a comparison between the results with the new approach and a best estimate calculation during the blowdown phase for two small breaks in a generic CANDU 6 station. The calculations are performed with the CATHENA computer code. (author)

Outcome quality of in-patient cardiac rehabilitation in elderly patients--identification of relevant parameters.

Science.gov (United States)

Salzwedel, Annett; Nosper, Manfred; Röhrig, Bernd; Linck-Eleftheriadis, Sigrid; Strandt, Gert; Völler, Heinz

2014-02-01

Outcome quality management requires the consecutive registration of defined variables. The aim was to identify relevant parameters in order to objectively assess the in-patient rehabilitation outcome. From February 2009 to June 2010 1253 patients (70.9 ± 7.0 years, 78.1% men) at 12 rehabilitation clinics were enrolled. Items concerning sociodemographic data, the impairment group (surgery, conservative/interventional treatment), cardiovascular risk factors, structural and functional parameters and subjective health were tested in respect of their measurability, sensitivity to change and their propensity to be influenced by rehabilitation. The majority of patients (61.1%) were referred for rehabilitation after cardiac surgery, 38.9% after conservative or interventional treatment for an acute coronary syndrome. Functionally relevant comorbidities were seen in 49.2% (diabetes mellitus, stroke, peripheral artery disease, chronic obstructive lung disease). In three key areas 13 parameters were identified as being sensitive to change and subject to modification by rehabilitation: cardiovascular risk factors (blood pressure, low-density lipoprotein cholesterol, triglycerides), exercise capacity (resting heart rate, maximal exercise capacity, maximal walking distance, heart failure, angina pectoris) and subjective health (IRES-24 (indicators of rehabilitation status): pain, somatic health, psychological well-being and depression as well as anxiety on the Hospital Anxiety and Depression Scale). The outcome of in-patient rehabilitation in elderly patients can be comprehensively assessed by the identification of appropriate key areas, that is, cardiovascular risk factors, exercise capacity and subjective health. This may well serve as a benchmark for internal and external quality management.

Searching and Archiving : Exploring Online Search Behaviors of Researchers

NARCIS (Netherlands)

Vyas, Dhaval; de Groot, S.; van der Veer, Gerrit C.; Dainoff, Marvin J.

2007-01-01

Searching for relevant peer-reviewed material is an integral part of corporate and academic researchers. Researchers collect huge amount of information over the years and sometimes struggle organizing it. Based on a study with 30 academic researchers, we explore, in combination, different searching

Model parameters estimation and sensitivity by genetic algorithms

International Nuclear Information System (INIS)

Marseguerra, Marzio; Zio, Enrico; Podofillini, Luca

2003-01-01

In this paper we illustrate the possibility of extracting qualitative information on the importance of the parameters of a model in the course of a Genetic Algorithms (GAs) optimization procedure for the estimation of such parameters. The Genetic Algorithms' search of the optimal solution is performed according to procedures that resemble those of natural selection and genetics: an initial population of alternative solutions evolves within the search space through the four fundamental operations of parent selection, crossover, replacement, and mutation. During the search, the algorithm examines a large amount of solution points which possibly carries relevant information on the underlying model characteristics. A possible utilization of this information amounts to create and update an archive with the set of best solutions found at each generation and then to analyze the evolution of the statistics of the archive along the successive generations. From this analysis one can retrieve information regarding the speed of convergence and stabilization of the different control (decision) variables of the optimization problem. In this work we analyze the evolution strategy followed by a GA in its search for the optimal solution with the aim of extracting information on the importance of the control (decision) variables of the optimization with respect to the sensitivity of the objective function. The study refers to a GA search for optimal estimates of the effective parameters in a lumped nuclear reactor model of literature. The supporting observation is that, as most optimization procedures do, the GA search evolves towards convergence in such a way to stabilize first the most important parameters of the model and later those which influence little the model outputs. In this sense, besides estimating efficiently the parameters values, the optimization approach also allows us to provide a qualitative ranking of their importance in contributing to the model output. The

Semantic technologies improving the recall and precision of the Mercury metadata search engine

Science.gov (United States)

Pouchard, L. C.; Cook, R. B.; Green, J.; Palanisamy, G.; Noy, N.

2011-12-01

The Mercury federated metadata system [1] was developed at the Oak Ridge National Laboratory Distributed Active Archive Center (ORNL DAAC), a NASA-sponsored effort holding datasets about biogeochemical dynamics, ecological data, and environmental processes. Mercury currently indexes over 100,000 records from several data providers conforming to community standards, e.g. EML, FGDC, FGDC Biological Profile, ISO 19115 and DIF. With the breadth of sciences represented in Mercury, the potential exists to address some key interdisciplinary scientific challenges related to climate change, its environmental and ecological impacts, and mitigation of these impacts. However, this wealth of metadata also hinders pinpointing datasets relevant to a particular inquiry. We implemented a semantic solution after concluding that traditional search approaches cannot improve the accuracy of the search results in this domain because: a) unlike everyday queries, scientific queries seek to return specific datasets with numerous parameters that may or may not be exposed to search (Deep Web queries); b) the relevance of a dataset cannot be judged by its popularity, as each scientific inquiry tends to be unique; and c)each domain science has its own terminology, more or less curated, consensual, and standardized depending on the domain. The same terms may refer to different concepts across domains (homonyms), but different terms mean the same thing (synonyms). Interdisciplinary research is arduous because an expert in a domain must become fluent in the language of another, just to find relevant datasets. Thus, we decided to use scientific ontologies because they can provide a context for a free-text search, in a way that string-based keywords never will. With added context, relevant datasets are more easily discoverable. To enable search and programmatic access to ontology entities in Mercury, we are using an instance of the BioPortal ontology repository. Mercury accesses ontology entities

Modeling MEA with the CPA equation of state: A parameter estimation study adding local search to PSO algorithm

DEFF Research Database (Denmark)

Santos, Letícia Cotia dos; Tavares, Frederico Wanderley; Ahón, Victor Rolando Ruiz

2015-01-01

parameters for MEA. This work proposes adding LLE information systematically in the CPA parameter estimation procedure. At first, the parameter search space is defined by the results from the PSO sensitivity analysis for VLE considering the experimental error for vapor pressures and liquid densities...... (objective function cut off). Then, two possible methodologies are discussed: the first one uses all the possible parameter sets and check them against the LLE and VLE experimental data. The second method explicitly incorporates LLE information into the objective function and uses both PSO and PSO...

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.

High-speed data search

Science.gov (United States)

Driscoll, James N.

1994-01-01

The high-speed data search system developed for KSC incorporates existing and emerging information retrieval technology to help a user intelligently and rapidly locate information found in large textual databases. This technology includes: natural language input; statistical ranking of retrieved information; an artificial intelligence concept called semantics, where 'surface level' knowledge found in text is used to improve the ranking of retrieved information; and relevance feedback, where user judgements about viewed information are used to automatically modify the search for further information. Semantics and relevance feedback are features of the system which are not available commercially. The system further demonstrates focus on paragraphs of information to decide relevance; and it can be used (without modification) to intelligently search all kinds of document collections, such as collections of legal documents medical documents, news stories, patents, and so forth. The purpose of this paper is to demonstrate the usefulness of statistical ranking, our semantic improvement, and relevance feedback.

Searching PubMed during a pandemic.

Directory of Open Access Journals (Sweden)

Ole Norgaard

Full Text Available BACKGROUND: The 2009 influenza A(H1N1 pandemic has generated thousands of articles and news items. However, finding relevant scientific articles in such rapidly developing health crises is a major challenge which, in turn, can affect decision-makers' ability to utilise up-to-date findings and ultimately shape public health interventions. This study set out to show the impact that the inconsistent naming of the pandemic can have on retrieving relevant scientific articles in PubMed/MEDLINE. METHODOLOGY: We first formulated a PubMed search algorithm covering different names of the influenza pandemic and simulated the results that it would have retrieved from weekly searches for relevant new records during the first 10 weeks of the pandemic. To assess the impact of failing to include every term in this search, we then conducted the same searches but omitted in turn "h1n1," "swine," "influenza" and "flu" from the search string, and compared the results to those for the full string. PRINCIPAL FINDINGS: On average, our core search string identified 44.3 potentially relevant new records at the end of each week. Of these, we determined that an average of 27.8 records were relevant. When we excluded one term from the string, the percentage of records missed out of the total number of relevant records averaged 18.7% for omitting "h1n1," 13.6% for "swine," 17.5% for "influenza," and 20.6% for "flu." CONCLUSIONS: Due to inconsistent naming, while searching for scientific material about rapidly evolving situations such as the influenza A(H1N1 pandemic, there is a risk that one will miss relevant articles. To address this problem, the international scientific community should agree on nomenclature and the specific name to be used earlier, and the National Library of Medicine in the US could index potentially relevant materials faster and allow publishers to add alert tags to such materials.

Predicting the performance of fingerprint similarity searching.

Science.gov (United States)

Vogt, Martin; Bajorath, Jürgen

2011-01-01

Fingerprints are bit string representations of molecular structure that typically encode structural fragments, topological features, or pharmacophore patterns. Various fingerprint designs are utilized in virtual screening and their search performance essentially depends on three parameters: the nature of the fingerprint, the active compounds serving as reference molecules, and the composition of the screening database. It is of considerable interest and practical relevance to predict the performance of fingerprint similarity searching. A quantitative assessment of the potential that a fingerprint search might successfully retrieve active compounds, if available in the screening database, would substantially help to select the type of fingerprint most suitable for a given search problem. The method presented herein utilizes concepts from information theory to relate the fingerprint feature distributions of reference compounds to screening libraries. If these feature distributions do not sufficiently differ, active database compounds that are similar to reference molecules cannot be retrieved because they disappear in the "background." By quantifying the difference in feature distribution using the Kullback-Leibler divergence and relating the divergence to compound recovery rates obtained for different benchmark classes, fingerprint search performance can be quantitatively predicted.

Search Advertising

OpenAIRE

Cornière (de), Alexandre

2016-01-01

Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...

Simplified Models for LHC New Physics Searches

CERN Document Server

Alves, Daniele; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Buckley, Matthew; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R.Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Evans, Jared A.; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto; Freitas, Ayres; Gainer, James S.; Gershtein, Yuri; Gray, Richard; Gregoire, Thomas; Gripaios, Ben; Gunion, Jack; Han, Tao; Haas, Andy; Hansson, Per; Hewett, JoAnne; Hits, Dmitry; Hubisz, Jay; Izaguirre, Eder; Kaplan, Jared; Katz, Emanuel; Kilic, Can; Kim, Hyung-Do; Kitano, Ryuichiro; Koay, Sue Ann; Ko, Pyungwon; Krohn, David; Kuflik, Eric; Lewis, Ian; Lisanti, Mariangela; Liu, Tao; Liu, Zhen; Lu, Ran; Luty, Markus; Meade, Patrick; Morrissey, David; Mrenna, Stephen; Nojiri, Mihoko; Okui, Takemichi; Padhi, Sanjay; Papucci, Michele; Park, Michael; Park, Myeonghun; Perelstein, Maxim; Peskin, Michael; Phalen, Daniel; Rehermann, Keith; Rentala, Vikram; Roy, Tuhin; Ruderman, Joshua T.; Sanz, Veronica; Schmaltz, Martin; Schnetzer, Stephen; Schuster, Philip; Schwaller, Pedro; Schwartz, Matthew D.; Schwartzman, Ariel; Shao, Jing; Shelton, Jessie; Shih, David; Shu, Jing; Silverstein, Daniel; Simmons, Elizabeth; Somalwar, Sunil; Spannowsky, Michael; Spethmann, Christian; Strassler, Matthew; Su, Shufang; Tait, Tim; Thomas, Brooks; Thomas, Scott; Toro, Natalia; Volansky, Tomer; Wacker, Jay; Waltenberger, Wolfgang; Yavin, Itay; Yu, Felix; Zhao, Yue; Zurek, Kathryn

2012-01-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the "Topologies for Early LHC Searches" workshop, held at SLAC in September of 2010, the purpose of which was to develop a...

Experience of Developing a Meta-Semantic Search Engine

OpenAIRE

Mukhopadhyay, Debajyoti; Sharma, Manoj; Joshi, Gajanan; Pagare, Trupti; Palwe, Adarsha

2013-01-01

Thinking of todays web search scenario which is mainly keyword based, leads to the need of effective and meaningful search provided by Semantic Web. Existing search engines are vulnerable to provide relevant answers to users query due to their dependency on simple data available in web pages. On other hand, semantic search engines provide efficient and relevant results as the semantic web manages information with well defined meaning using ontology. A Meta-Search engine is a search tool that ...

MUSIC algorithm for location searching of dielectric anomalies from S-parameters using microwave imaging

Science.gov (United States)

Park, Won-Kwang; Kim, Hwa Pyung; Lee, Kwang-Jae; Son, Seong-Ho

2017-11-01

Motivated by the biomedical engineering used in early-stage breast cancer detection, we investigated the use of MUltiple SIgnal Classification (MUSIC) algorithm for location searching of small anomalies using S-parameters. We considered the application of MUSIC to functional imaging where a small number of dipole antennas are used. Our approach is based on the application of Born approximation or physical factorization. We analyzed cases in which the anomaly is respectively small and large in relation to the wavelength, and the structure of the left-singular vectors is linked to the nonzero singular values of a Multi-Static Response (MSR) matrix whose elements are the S-parameters. Using simulations, we demonstrated the strengths and weaknesses of the MUSIC algorithm in detecting both small and extended anomalies.

Support Vector Machines: Relevance Feedback and Information Retrieval.

Science.gov (United States)

Drucker, Harris; Shahrary, Behzad; Gibbon, David C.

2002-01-01

Compares support vector machines (SVMs) to Rocchio, Ide regular and Ide dec-hi algorithms in information retrieval (IR) of text documents using relevancy feedback. If the preliminary search is so poor that one has to search through many documents to find at least one relevant document, then SVM is preferred. Includes nine tables. (Contains 24…

Spectral filtering for CW searches

International Nuclear Information System (INIS)

D'Antonio, S; Frasca, S; Palomba, C

2009-01-01

In the hierarchical all-sky search method for periodic sources developed in the Virgo Collaboration, after the first incoherent step based on the Hough transform we have a number of candidates that must be analyzed using a much longer time baseline periodogram. In this step, we correct the signal power spread due to the Earth rotation, which becomes relevant for observation times greater than ∼1 sidereal day, using a bank of matched filters on the power spectrum. Describing the wave as the combination of a linearly polarized and a circularly polarized component, the spread depends on two parameters: the polarization angle of the linearly polarized wave component and the percentage of linear polarization. Here we discuss in detail the issue of how many filters must be built to properly cover the parameter space and give some implementation details of the procedure.

Professional and Regulatory Search

Science.gov (United States)

Professional and Regulatory search are designed for people who use EPA web resources to do their job. You will be searching collections where information that is not relevant to Environmental and Regulatory professionals.

Constraining supersymmetric models using Higgs physics, precision observables and direct searches

International Nuclear Information System (INIS)

Zeune, Lisa

2014-08-01

We present various complementary possibilities to exploit experimental measurements in order to test and constrain supersymmetric (SUSY) models. Direct searches for SUSY particles have not resulted in any signal so far, and limits on the SUSY parameter space have been set. Measurements of the properties of the observed Higgs boson at ∝126 GeV as well as of the W boson mass (M W ) can provide valuable indirect constraints, supplementing the ones from direct searches. This thesis is divided into three major parts: In the first part we present the currently most precise prediction for M W in the Minimal Supersymmetric Standard Model (MSSM) with complex parameters and in the Next-to-Minimal Supersymmetric Standard Model (NMSSM). The evaluation includes the full one-loop result and all relevant available higher order corrections of Standard Model (SM) and SUSY type. We perform a detailed scan over the MSSM parameter space, taking into account the latest experimental results, including the observation of a Higgs signal. We find that the current measurements for M W and the top quark mass (m t ) slightly favour a non-zero SUSY contribution. The impact of different SUSY sectors on the prediction of M W as well as the size of the higher-order SUSY corrections are analysed both in the MSSM and the NMSSM. We investigate the genuine NMSSM contribution from the extended Higgs and neutralino sectors and highlight differences between the M W predictions in the two SUSY models. In the second part of the thesis we discuss possible interpretations of the observed Higgs signal in SUSY models. The properties of the observed Higgs boson are compatible with the SM so far, but many other interpretations are also possible. Performing scans over the relevant parts of the MSSM and the NMSSM parameter spaces and applying relevant constraints from Higgs searches, flavour physics and electroweak measurements, we find that a Higgs boson at ∝126 GeV, which decays into two photons, can in

Optimal correction and design parameter search by modern methods of rigorous global optimization

International Nuclear Information System (INIS)

Makino, K.; Berz, M.

2011-01-01

Frequently the design of schemes for correction of aberrations or the determination of possible operating ranges for beamlines and cells in synchrotrons exhibit multitudes of possibilities for their correction, usually appearing in disconnected regions of parameter space which cannot be directly qualified by analytical means. In such cases, frequently an abundance of optimization runs are carried out, each of which determines a local minimum depending on the specific chosen initial conditions. Practical solutions are then obtained through an often extended interplay of experienced manual adjustment of certain suitable parameters and local searches by varying other parameters. However, in a formal sense this problem can be viewed as a global optimization problem, i.e. the determination of all solutions within a certain range of parameters that lead to a specific optimum. For example, it may be of interest to find all possible settings of multiple quadrupoles that can achieve imaging; or to find ahead of time all possible settings that achieve a particular tune; or to find all possible manners to adjust nonlinear parameters to achieve correction of high order aberrations. These tasks can easily be phrased in terms of such an optimization problem; but while mathematically this formulation is often straightforward, it has been common belief that it is of limited practical value since the resulting optimization problem cannot usually be solved. However, recent significant advances in modern methods of rigorous global optimization make these methods feasible for optics design for the first time. The key ideas of the method lie in an interplay of rigorous local underestimators of the objective functions, and by using the underestimators to rigorously iteratively eliminate regions that lie above already known upper bounds of the minima, in what is commonly known as a branch-and-bound approach. Recent enhancements of the Differential Algebraic methods used in particle

Building a better search engine for earth science data

Science.gov (United States)

Armstrong, E. M.; Yang, C. P.; Moroni, D. F.; McGibbney, L. J.; Jiang, Y.; Huang, T.; Greguska, F. R., III; Li, Y.; Finch, C. J.

2017-12-01

Free text data searching of earth science datasets has been implemented with varying degrees of success and completeness across the spectrum of the 12 NASA earth sciences data centers. At the JPL Physical Oceanography Distributed Active Archive Center (PO.DAAC) the search engine has been developed around the Solr/Lucene platform. Others have chosen other popular enterprise search platforms like Elasticsearch. Regardless, the default implementations of these search engines leveraging factors such as dataset popularity, term frequency and inverse document term frequency do not fully meet the needs of precise relevancy and ranking of earth science search results. For the PO.DAAC, this shortcoming has been identified for several years by its external User Working Group that has assigned several recommendations to improve the relevancy and discoverability of datasets related to remotely sensed sea surface temperature, ocean wind, waves, salinity, height and gravity that comprise a total count of over 500 public availability datasets. Recently, the PO.DAAC has teamed with an effort led by George Mason University to improve the improve the search and relevancy ranking of oceanographic data via a simple search interface and powerful backend services called MUDROD (Mining and Utilizing Dataset Relevancy from Oceanographic Datasets to Improve Data Discovery) funded by the NASA AIST program. MUDROD has mined and utilized the combination of PO.DAAC earth science dataset metadata, usage metrics, and user feedback and search history to objectively extract relevance for improved data discovery and access. In addition to improved dataset relevance and ranking, the MUDROD search engine also returns recommendations to related datasets and related user queries. This presentation will report on use cases that drove the architecture and development, and the success metrics and improvements on search precision and recall that MUDROD has demonstrated over the existing PO.DAAC search

Inverse modeling approach for evaluation of kinetic parameters of a biofilm reactor using tabu search.

Science.gov (United States)

Kumar, B Shiva; Venkateswarlu, Ch

2014-08-01

The complex nature of biological reactions in biofilm reactors often poses difficulties in analyzing such reactors experimentally. Mathematical models could be very useful for their design and analysis. However, application of biofilm reactor models to practical problems proves somewhat ineffective due to the lack of knowledge of accurate kinetic models and uncertainty in model parameters. In this work, we propose an inverse modeling approach based on tabu search (TS) to estimate the parameters of kinetic and film thickness models. TS is used to estimate these parameters as a consequence of the validation of the mathematical models of the process with the aid of measured data obtained from an experimental fixed-bed anaerobic biofilm reactor involving the treatment of pharmaceutical industry wastewater. The results evaluated for different modeling configurations of varying degrees of complexity illustrate the effectiveness of TS for accurate estimation of kinetic and film thickness model parameters of the biofilm process. The results show that the two-dimensional mathematical model with Edward kinetics (with its optimum parameters as mu(max)rho(s)/Y = 24.57, Ks = 1.352 and Ki = 102.36) and three-parameter film thickness expression (with its estimated parameters as a = 0.289 x 10(-5), b = 1.55 x 10(-4) and c = 15.2 x 10(-6)) better describes the biofilm reactor treating the industry wastewater.

Advancing the Relevance Criteria for Video Search and Visual Summarization

NARCIS (Netherlands)

Rudinac, S.

2013-01-01

To facilitate finding of relevant information in ever-growing multimedia collections, a number of multimedia information retrieval solutions have been proposed over the past years. The essential element of any such solution is the relevance criterion deployed to select or rank the items from a

Open Search Environments: The Free Alternative to Commercial Search Services

Directory of Open Access Journals (Sweden)

Adrian O'Riordan

2014-06-01

Full Text Available Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology looking in particular at the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially proving a fitting choice in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch and SRU. OpenSearch and SRU implement a federated model to enable existing and new search engines and search clients communicate. Applications and instances where Opensearch and SRU can be combined are presented. Other relevant technologies such as OpenURL, Apache Solr, and OAI-PMH are also discussed. The deployment of these freely licensed open standards in digital library applications is now a genuine alternative to commercial or proprietary systems.

Searching the scientific literature: implications for quantitative and qualitative reviews.

Science.gov (United States)

Wu, Yelena P; Aylward, Brandon S; Roberts, Michael C; Evans, Spencer C

2012-08-01

Literature reviews are an essential step in the research process and are included in all empirical and review articles. Electronic databases are commonly used to gather this literature. However, several factors can affect the extent to which relevant articles are retrieved, influencing future research and conclusions drawn. The current project examined articles obtained by comparable search strategies in two electronic archives using an exemplar search to illustrate factors that authors should consider when designing their own search strategies. Specifically, literature searches were conducted in PsycINFO and PubMed targeting review articles on two exemplar disorders (bipolar disorder and attention deficit/hyperactivity disorder) and issues of classification and/or differential diagnosis. Articles were coded for relevance and characteristics of article content. The two search engines yielded significantly different proportions of relevant articles overall and by disorder. Keywords differed across search engines for the relevant articles identified. Based on these results, it is recommended that when gathering literature for review papers, multiple search engines should be used, and search syntax and strategies be tailored to the unique capabilities of particular engines. For meta-analyses and systematic reviews, authors may consider reporting the extent to which different archives or sources yielded relevant articles for their particular review. Copyright © 2012 Elsevier Ltd. All rights reserved.

An improved hybrid of particle swarm optimization and the gravitational search algorithm to produce a kinetic parameter estimation of aspartate biochemical pathways.

Science.gov (United States)

Ismail, Ahmad Muhaimin; Mohamad, Mohd Saberi; Abdul Majid, Hairudin; Abas, Khairul Hamimah; Deris, Safaai; Zaki, Nazar; Mohd Hashim, Siti Zaiton; Ibrahim, Zuwairie; Remli, Muhammad Akmal

2017-12-01

Mathematical modelling is fundamental to understand the dynamic behavior and regulation of the biochemical metabolisms and pathways that are found in biological systems. Pathways are used to describe complex processes that involve many parameters. It is important to have an accurate and complete set of parameters that describe the characteristics of a given model. However, measuring these parameters is typically difficult and even impossible in some cases. Furthermore, the experimental data are often incomplete and also suffer from experimental noise. These shortcomings make it challenging to identify the best-fit parameters that can represent the actual biological processes involved in biological systems. Computational approaches are required to estimate these parameters. The estimation is converted into multimodal optimization problems that require a global optimization algorithm that can avoid local solutions. These local solutions can lead to a bad fit when calibrating with a model. Although the model itself can potentially match a set of experimental data, a high-performance estimation algorithm is required to improve the quality of the solutions. This paper describes an improved hybrid of particle swarm optimization and the gravitational search algorithm (IPSOGSA) to improve the efficiency of a global optimum (the best set of kinetic parameter values) search. The findings suggest that the proposed algorithm is capable of narrowing down the search space by exploiting the feasible solution areas. Hence, the proposed algorithm is able to achieve a near-optimal set of parameters at a fast convergence speed. The proposed algorithm was tested and evaluated based on two aspartate pathways that were obtained from the BioModels Database. The results show that the proposed algorithm outperformed other standard optimization algorithms in terms of accuracy and near-optimal kinetic parameter estimation. Nevertheless, the proposed algorithm is only expected to work well in

Task-relevant information is prioritized in spatiotemporal contextual cueing.

Science.gov (United States)

Higuchi, Yoko; Ueda, Yoshiyuki; Ogawa, Hirokazu; Saiki, Jun

2016-11-01

Implicit learning of visual contexts facilitates search performance-a phenomenon known as contextual cueing; however, little is known about contextual cueing under situations in which multidimensional regularities exist simultaneously. In everyday vision, different information, such as object identity and location, appears simultaneously and interacts with each other. We tested the hypothesis that, in contextual cueing, when multiple regularities are present, the regularities that are most relevant to our behavioral goals would be prioritized. Previous studies of contextual cueing have commonly used the visual search paradigm. However, this paradigm is not suitable for directing participants' attention to a particular regularity. Therefore, we developed a new paradigm, the "spatiotemporal contextual cueing paradigm," and manipulated task-relevant and task-irrelevant regularities. In four experiments, we demonstrated that task-relevant regularities were more responsible for search facilitation than task-irrelevant regularities. This finding suggests our visual behavior is focused on regularities that are relevant to our current goal.

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.

Higgs Boson Searches at Hadron Colliders (1/4)

CERN Multimedia

CERN. Geneva

2010-01-01

In these Academic Training lectures, the phenomenology of Higgs bosons and search strategies at hadron colliders are discussed. After a brief introduction on Higgs bosons in the Standard Model and a discussion of present direct and indirect constraints on its mass the status of the theoretical cross section calculations for Higgs boson production at hadron colliders is reviewed. In the following lectures important experimental issues relevant for Higgs boson searches (trigger, measurements of leptons, jets and missing transverse energy) are presented. This is followed by a detailed discussion of the discovery potential for the Standard Model Higgs boson for both the Tevatron and the LHC experiments. In addition, various scenarios beyond the Standard Model, primarily the MSSM, are considered. Finally, the potential and strategies to measured Higgs boson parameters and the investigation of alternative symmetry breaking scenarios are addressed.

Method for extracting relevant electrical parameters from graphene field-effect transistors using a physical model

International Nuclear Information System (INIS)

Boscá, A.; Pedrós, J.; Martínez, J.; Calle, F.

2015-01-01

Due to its intrinsic high mobility, graphene has proved to be a suitable material for high-speed electronics, where graphene field-effect transistor (GFET) has shown excellent properties. In this work, we present a method for extracting relevant electrical parameters from GFET devices using a simple electrical characterization and a model fitting. With experimental data from the device output characteristics, the method allows to calculate parameters such as the mobility, the contact resistance, and the fixed charge. Differentiated electron and hole mobilities and direct connection with intrinsic material properties are some of the key aspects of this method. Moreover, the method output values can be correlated with several issues during key fabrication steps such as the graphene growth and transfer, the lithographic steps, or the metalization processes, providing a flexible tool for quality control in GFET fabrication, as well as a valuable feedback for improving the material-growth process

Method for extracting relevant electrical parameters from graphene field-effect transistors using a physical model

Energy Technology Data Exchange (ETDEWEB)

Boscá, A., E-mail: alberto.bosca@upm.es [Instituto de Sistemas Optoelectrónicos y Microtecnología, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Dpto. de Ingeniería Electrónica, E.T.S.I. de Telecomunicación, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Pedrós, J. [Instituto de Sistemas Optoelectrónicos y Microtecnología, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Campus de Excelencia Internacional, Campus Moncloa UCM-UPM, Madrid 28040 (Spain); Martínez, J. [Instituto de Sistemas Optoelectrónicos y Microtecnología, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Dpto. de Ciencia de Materiales, E.T.S.I de Caminos, Canales y Puertos, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Calle, F. [Instituto de Sistemas Optoelectrónicos y Microtecnología, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Dpto. de Ingeniería Electrónica, E.T.S.I. de Telecomunicación, Universidad Politécnica de Madrid, Madrid 28040 (Spain); Campus de Excelencia Internacional, Campus Moncloa UCM-UPM, Madrid 28040 (Spain)

2015-01-28

Due to its intrinsic high mobility, graphene has proved to be a suitable material for high-speed electronics, where graphene field-effect transistor (GFET) has shown excellent properties. In this work, we present a method for extracting relevant electrical parameters from GFET devices using a simple electrical characterization and a model fitting. With experimental data from the device output characteristics, the method allows to calculate parameters such as the mobility, the contact resistance, and the fixed charge. Differentiated electron and hole mobilities and direct connection with intrinsic material properties are some of the key aspects of this method. Moreover, the method output values can be correlated with several issues during key fabrication steps such as the graphene growth and transfer, the lithographic steps, or the metalization processes, providing a flexible tool for quality control in GFET fabrication, as well as a valuable feedback for improving the material-growth process.

Impact of PubMed search filters on the retrieval of evidence by physicians.

Science.gov (United States)

Shariff, Salimah Z; Sontrop, Jessica M; Haynes, R Brian; Iansavichus, Arthur V; McKibbon, K Ann; Wilczynski, Nancy L; Weir, Matthew A; Speechley, Mark R; Thind, Amardeep; Garg, Amit X

2012-02-21

Physicians face challenges when searching PubMed for research evidence, and they may miss relevant articles while retrieving too many nonrelevant articles. We investigated whether the use of search filters in PubMed improves searching by physicians. We asked a random sample of Canadian nephrologists to answer unique clinical questions derived from 100 systematic reviews of renal therapy. Physicians provided the search terms that they would type into PubMed to locate articles to answer these questions. We entered the physician-provided search terms into PubMed and applied two types of search filters alone or in combination: a methods-based filter designed to identify high-quality studies about treatment (clinical queries "therapy") and a topic-based filter designed to identify studies with renal content. We evaluated the comprehensiveness (proportion of relevant articles found) and efficiency (ratio of relevant to nonrelevant articles) of the filtered and nonfiltered searches. Primary studies included in the systematic reviews served as the reference standard for relevant articles. The average physician-provided search terms retrieved 46% of the relevant articles, while 6% of the retrieved articles were relevant (corrected) (the ratio of relevant to nonrelevant articles was 1:16). The use of both filters together produced a marked improvement in efficiency, resulting in a ratio of relevant to nonrelevant articles of 1:5 (16 percentage point improvement; 99% confidence interval 9% to 22%; p PubMed search filters improves the efficiency of physician searches. Improved search performance may enhance the transfer of research into practice and improve patient care.

Parameters for calculation of nuclear reactions of relevance to non-energy nuclear applications (Reference Input Parameter Library: Phase III). Summary report of the first research coordination meeting

International Nuclear Information System (INIS)

Capote Noy, R.

2004-08-01

A summary is given of the First Research Coordination Meeting on Parameters for Calculation of Nuclear Reactions of Relevance to Non-Energy Nuclear Applications (Reference Input Parameter Library: Phase III), including a critical review of the RIPL-2 file. The new library should serve as input for theoretical calculations of nuclear reaction data at incident energies up to 200 MeV, as needed for energy and non-energy modern applications of nuclear data. Technical discussions and the resulting work plan of the Coordinated Research Programme are summarized, along with actions and deadlines. Participants' contributions to the RCM are also attached. (author)

Ranking Music Data by Relevance and Importance

DEFF Research Database (Denmark)

Ruxanda, Maria Magdalena; Nanopoulos, Alexandros; Jensen, Christian Søndergaard

2008-01-01

Due to the rapidly increasing availability of audio files on the Web, it is relevant to augment search engines with advanced audio search functionality. In this context, the ranking of the retrieved music is an important issue. This paper proposes a music ranking method capable of flexibly fusing...

Search algorithms, hidden labour and information control

Directory of Open Access Journals (Sweden)

Paško Bilić

2016-06-01

Full Text Available The paper examines some of the processes of the closely knit relationship between Google’s ideologies of neutrality and objectivity and global market dominance. Neutrality construction comprises an important element sustaining the company’s economic position and is reflected in constant updates, estimates and changes to utility and relevance of search results. Providing a purely technical solution to these issues proves to be increasingly difficult without a human hand in steering algorithmic solutions. Search relevance fluctuates and shifts through continuous tinkering and tweaking of the search algorithm. The company also uses third parties to hire human raters for performing quality assessments of algorithmic updates and adaptations in linguistically and culturally diverse global markets. The adaptation process contradicts the technical foundations of the company and calculations based on the initial Page Rank algorithm. Annual market reports, Google’s Search Quality Rating Guidelines, and reports from media specialising in search engine optimisation business are analysed. The Search Quality Rating Guidelines document provides a rare glimpse into the internal architecture of search algorithms and the notions of utility and relevance which are presented and structured as neutral and objective. Intertwined layers of ideology, hidden labour of human raters, advertising revenues, market dominance and control are discussed throughout the paper.

Distributed Deep Web Search

NARCIS (Netherlands)

Tjin-Kam-Jet, Kien

2013-01-01

The World Wide Web contains billions of documents (and counting); hence, it is likely that some document will contain the answer or content you are searching for. While major search engines like Bing and Google often manage to return relevant results to your query, there are plenty of situations in

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.

Delaying information search

Directory of Open Access Journals (Sweden)

Yaniv Shani

2012-11-01

Full Text Available In three studies, we examined factors that may temporarily attenuate information search. People are generally curious and dislike uncertainty, which typically encourages them to look for relevant information. Despite these strong forces that promote information search, people sometimes deliberately delay obtaining valuable information. We find they may do so when they are concerned that the information might interfere with future pleasurable activities. Interestingly, the decision to search or to postpone searching for information is influenced not only by the value and importance of the information itself but also by well-being maintenance goals related to possible detrimental effects that negative knowledge may have on unrelated future plans.

Gravitational Waves: Search Results, Data Analysis and Parameter Estimation. Amaldi 10 Parallel Session C2

Science.gov (United States)

Astone, Pia; Weinstein, Alan; Agathos, Michalis; Bejger, Michal; Christensen, Nelson; Dent, Thomas; Graff, Philip; Klimenko, Sergey; Mazzolo, Giulio; Nishizawa, Atsushi

2015-01-01

The Amaldi 10 Parallel Session C2 on gravitational wave(GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact binary inspiral, merger and ringdown; GW bursts from intermediate mass binary black hole mergers, cosmic string cusps, core-collapse supernovae, and other unmodeled sources; continuous waves from spinning neutron stars; and a stochastic GW background. There was considerable emphasis on Bayesian techniques for estimating the parameters of coalescing compact binary systems from the gravitational waveforms extracted from the data from the advanced detector network. This included methods to distinguish deviations of the signals from what is expected in the context of General Relativity.

Gravitational waves: search results, data analysis and parameter estimation: Amaldi 10 Parallel session C2.

Science.gov (United States)

Astone, Pia; Weinstein, Alan; Agathos, Michalis; Bejger, Michał; Christensen, Nelson; Dent, Thomas; Graff, Philip; Klimenko, Sergey; Mazzolo, Giulio; Nishizawa, Atsushi; Robinet, Florent; Schmidt, Patricia; Smith, Rory; Veitch, John; Wade, Madeline; Aoudia, Sofiane; Bose, Sukanta; Calderon Bustillo, Juan; Canizares, Priscilla; Capano, Colin; Clark, James; Colla, Alberto; Cuoco, Elena; Da Silva Costa, Carlos; Dal Canton, Tito; Evangelista, Edgar; Goetz, Evan; Gupta, Anuradha; Hannam, Mark; Keitel, David; Lackey, Benjamin; Logue, Joshua; Mohapatra, Satyanarayan; Piergiovanni, Francesco; Privitera, Stephen; Prix, Reinhard; Pürrer, Michael; Re, Virginia; Serafinelli, Roberto; Wade, Leslie; Wen, Linqing; Wette, Karl; Whelan, John; Palomba, C; Prodi, G

The Amaldi 10 Parallel Session C2 on gravitational wave (GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact binary inspiral, merger and ringdown; GW bursts from intermediate mass binary black hole mergers, cosmic string cusps, core-collapse supernovae, and other unmodeled sources; continuous waves from spinning neutron stars; and a stochastic GW background. There was considerable emphasis on Bayesian techniques for estimating the parameters of coalescing compact binary systems from the gravitational waveforms extracted from the data from the advanced detector network. This included methods to distinguish deviations of the signals from what is expected in the context of General Relativity.

Instrumentation for the observation of atmospheric parameters, relevant for IACTs, for site-search and correction of the energy spectra

Energy Technology Data Exchange (ETDEWEB)

Fruck, Christian; Hose, Juergen; Engelhardt, Toni; Mirzoyan, Razmik; Schweizer, Thomas; Teshima, Masahiro [Max Plank Institut fuer Physik, Muenchen (Germany)

2010-07-01

The atmospheric conditions have impact on the measured data by imaging atmospheric Cherenkov telescopes (IACT). Cherenkov light from air showers traverses 5-25 km distance in the atmosphere before reaching the telescopes. This light becomes attenuated because of absorption by oxigen and ozone as well as because of the Rayleigh and the Mie scatterings. The latter is the variable component in the atmosphere that depends on the momentary distribution of aerosols, their size and types and distribution heights. We have developed a micro-LIDAR system for parametrising these losses and plan to locate it next to the MAGIC telescopes for simultaneous operation. This shall allow us to improve the energy resolution of the telescopes for the data taken at non-ideal weather conditions. Also, we are working on developing diverse instrumentation for paramerising the atmosphere and for the searching proper sites for the CTA project. In our presentation we plan to report about the above-mentioned activities.

Medical literature searches: a comparison of PubMed and Google Scholar.

Science.gov (United States)

Nourbakhsh, Eva; Nugent, Rebecca; Wang, Helen; Cevik, Cihan; Nugent, Kenneth

2012-09-01

Medical literature searches provide critical information for clinicians. However, the best strategy for identifying relevant high-quality literature is unknown. We compared search results using PubMed and Google Scholar on four clinical questions and analysed these results with respect to article relevance and quality. Abstracts from the first 20 citations for each search were classified into three relevance categories. We used the weighted kappa statistic to analyse reviewer agreement and nonparametric rank tests to compare the number of citations for each article and the corresponding journals' impact factors. Reviewers ranked 67.6% of PubMed articles and 80% of Google Scholar articles as at least possibly relevant (P = 0.116) with high agreement (all kappa P-values PubMed searches and Google Scholar searches often identify different articles. In this study, Google Scholar articles were more likely to be classified as relevant, had higher numbers of citations and were published in higher impact factor journals. The identification of frequently cited articles using Google Scholar for searches probably has value for initial literature searches. © 2012 The authors. Health Information and Libraries Journal © 2012 Health Libraries Group.

Genetic algorithm with small population size for search feasible control parameters for parallel hybrid electric vehicles

Directory of Open Access Journals (Sweden)

Yu-Huei Cheng

2017-11-01

Full Text Available The control strategy is a major unit in hybrid electric vehicles (HEVs. In order to provide suitable control parameters for reducing fuel consumptions and engine emissions while maintaining vehicle performance requirements, the genetic algorithm (GA with small population size is applied to search for feasible control parameters in parallel HEVs. The electric assist control strategy (EACS is used as the fundamental control strategy of parallel HEVs. The dynamic performance requirements stipulated in the Partnership for a New Generation of Vehicles (PNGV is considered to maintain the vehicle performance. The known ADvanced VehIcle SimulatOR (ADVISOR is used to simulate a specific parallel HEV with urban dynamometer driving schedule (UDDS. Five population sets with size 5, 10, 15, 20, and 25 are used in the GA. The experimental results show that the GA with population size of 25 is the best for selecting feasible control parameters in parallel HEVs.

[Systematic literature search in PubMed : A short introduction].

Science.gov (United States)

Blümle, A; Lagrèze, W A; Motschall, E

2018-03-01

In order to identify current (and relevant) evidence for a specific clinical question within the unmanageable amount of information available, solid skills in performing a systematic literature search are essential. An efficient approach is to search a biomedical database containing relevant literature citations of study reports. The best known database is MEDLINE, which is searchable for free via the PubMed interface. In this article, we explain step by step how to perform a systematic literature search via PubMed by means of an example research question in the field of ophthalmology. First, we demonstrate how to translate the clinical problem into a well-framed and searchable research question, how to identify relevant search terms and how to conduct a text word search and a search with keywords in medical subject headings (MeSH) terms. We then show how to limit the number of search results if the search yields too many irrelevant hits and how to increase the number in the case of too few citations. Finally, we summarize all essential principles that guide a literature search via PubMed.

Diversity, intent, and aggregated search

NARCIS (Netherlands)

de Rijke, M.

2014-01-01

Diversity, intent and aggregated search are three core retrieval concepts that receive significant attention. In search result diversification one typically considers the relevance of a document in light of other retrieved documents. The goal is to identify the probable "aspects" of an ambiguous

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

Who should be searching? Differences in personality can affect visual search accuracy

OpenAIRE

Biggs, A. T.; Clark, K.; Mitroff, S. R.

2017-01-01

Visual search is an everyday task conducted in a wide variety of contexts. Some searches are mundane, such as finding a beverage in the refrigerator, and some have life-or-death consequences, such as finding improvised explosives at a security checkpoint or within a combat zone. Prior work has shown numerous influences on search, including “bottom-up” (physical stimulus attributes) and “top-down” factors (task-relevant or goal-driven aspects). Recent work has begun to focus on “observer-speci...

Supporting Book Search

DEFF Research Database (Denmark)

Bogers, Toine; Petras, Vivien

2017-01-01

of information needs. In this paper, we present a large-scale empirical comparison of the effectiveness of book metadata elements for searching complex information needs. Using a test collection of over 2 million book records and over 330 real-world book search requests, we perform a highly controlled and in......-depth analysis of topical metadata, comparing controlled vocabularies with social tags. Tags perform better overall in this setting, but controlled vocabulary terms provide complementary information, which will improve a search. We analyze potential underlying factors that contribute to search performance......, such as the relevance aspect(s) mentioned in a request or the type of book. In addition, we investigate the possible causes of search failure. We conclude that neither tags nor controlled vocabularies are wholly suited to handling the complex information needs in book search, which means that different approaches...

Survival Processing Enhances Visual Search Efficiency.

Science.gov (United States)

Cho, Kit W

2018-05-01

Words rated for their survival relevance are remembered better than when rated using other well-known memory mnemonics. This finding, which is known as the survival advantage effect and has been replicated in many studies, suggests that our memory systems are molded by natural selection pressures. In two experiments, the present study used a visual search task to examine whether there is likewise a survival advantage for our visual systems. Participants rated words for their survival relevance or for their pleasantness before locating that object's picture in a search array with 8 or 16 objects. Although there was no difference in search times among the two rating scenarios when set size was 8, survival processing reduced visual search times when set size was 16. These findings reflect a search efficiency effect and suggest that similar to our memory systems, our visual systems are also tuned toward self-preservation.

Modified harmony search

Science.gov (United States)

Mohamed, Najihah; Lutfi Amri Ramli, Ahmad; Majid, Ahmad Abd; Piah, Abd Rahni Mt

2017-09-01

A metaheuristic algorithm, called Harmony Search is quite highly applied in optimizing parameters in many areas. HS is a derivative-free real parameter optimization algorithm, and draws an inspiration from the musical improvisation process of searching for a perfect state of harmony. Propose in this paper Modified Harmony Search for solving optimization problems, which employs a concept from genetic algorithm method and particle swarm optimization for generating new solution vectors that enhances the performance of HS algorithm. The performances of MHS and HS are investigated on ten benchmark optimization problems in order to make a comparison to reflect the efficiency of the MHS in terms of final accuracy, convergence speed and robustness.

Structure-activity relationships of pyrethroid insecticides. Part 2. The use of molecular dynamics for conformation searching and average parameter calculation

Science.gov (United States)

Hudson, Brian D.; George, Ashley R.; Ford, Martyn G.; Livingstone, David J.

1992-04-01

Molecular dynamics simulations have been performed on a number of conformationally flexible pyrethroid insecticides. The results indicate that molecular dynamics is a suitable tool for conformational searching of small molecules given suitable simulation parameters. The structures derived from the simulations are compared with the static conformation used in a previous study. Various physicochemical parameters have been calculated for a set of conformations selected from the simulations using multivariate analysis. The averaged values of the parameters over the selected set (and the factors derived from them) are compared with the single conformation values used in the previous study.

IMPROVING PERSONALIZED WEB SEARCH USING BOOKSHELF DATA STRUCTURE

Directory of Open Access Journals (Sweden)

S.K. Jayanthi

2012-10-01

Full Text Available Search engines are playing a vital role in retrieving relevant information for the web user. In this research work a user profile based web search is proposed. So the web user from different domain may receive different set of results. The main challenging work is to provide relevant results at the right level of reading difficulty. Estimating user expertise and re-ranking the results are the main aspects of this paper. The retrieved results are arranged in Bookshelf Data Structure for easy access. Better presentation of search results hence increases the usability of web search engines significantly in visual mode.

Searching for the origins of musicality across species.

Science.gov (United States)

Hoeschele, Marisa; Merchant, Hugo; Kikuchi, Yukiko; Hattori, Yuko; ten Cate, Carel

2015-03-19

In the introduction to this theme issue, Honing et al. suggest that the origins of musicality--the capacity that makes it possible for us to perceive, appreciate and produce music--can be pursued productively by searching for components of musicality in other species. Recent studies have highlighted that the behavioural relevance of stimuli to animals and the relation of experimental procedures to their natural behaviour can have a large impact on the type of results that can be obtained for a given species. Through reviewing laboratory findings on animal auditory perception and behaviour, as well as relevant findings on natural behaviour, we provide evidence that both traditional laboratory studies and studies relating to natural behaviour are needed to answer the problem of musicality. Traditional laboratory studies use synthetic stimuli that provide more control than more naturalistic studies, and are in many ways suitable to test the perceptual abilities of animals. However, naturalistic studies are essential to inform us as to what might constitute relevant stimuli and parameters to test with laboratory studies, or why we may or may not expect certain stimulus manipulations to be relevant. These two approaches are both vital in the comparative study of musicality.

Allocation and sequencing in 1-out-of-N heterogeneous cold-standby systems: Multi-objective harmony search with dynamic parameters tuning

International Nuclear Information System (INIS)

Valaei, M.R.; Behnamian, J.

2017-01-01

A redundancy allocation is a famous problem in reliability sciences. A lot of researcher investigated about this problem, but a few of them focus on heterogeneous 1-out-of-N: G cold-standby redundancy in each subsystem. This paper considers a redundancy allocation problem (RAP) and standby element sequencing problem (SESP) for 1-out-of-N: G heterogeneous cold-standby system, simultaneously. Moreover, here, maximizing reliability of cold-standby allocation and minimizing cost of buying and time-independent elements are considered as two conflict objectives. This problem is NP-Hard and consequently, devizing a metaheuristic to solve this problem, especially for large-sized instances, is highly desirable. In this paper, we propose a multi-objective harmony search. Based on Taguchi experimental design, we, also, present a new parameters tuning method to improve the proposed algorithm. - Graphical abstract: Example of solution encoding. - Highlights: • This paper considers a redundancy allocation and standby element sequencing problem. • To solve this problem, a multi-objective harmony search algorithm is proposed. • Dynamic parameters tuning method is applied to improved the algorithm. • With this method, sensitivity of the algorithm to initial parameters is reduced.

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

Science.gov (United States)

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

2013-03-01

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

Search times and probability of detection in time-limited search

Science.gov (United States)

Wilson, David; Devitt, Nicole; Maurer, Tana

2005-05-01

When modeling the search and target acquisition process, probability of detection as a function of time is important to war games and physical entity simulations. Recent US Army RDECOM CERDEC Night Vision and Electronics Sensor Directorate modeling of search and detection has focused on time-limited search. Developing the relationship between detection probability and time of search as a differential equation is explored. One of the parameters in the current formula for probability of detection in time-limited search corresponds to the mean time to detect in time-unlimited search. However, the mean time to detect in time-limited search is shorter than the mean time to detect in time-unlimited search and the relationship between them is a mathematical relationship between these two mean times. This simple relationship is derived.

Inverse analyses of effective diffusion parameters relevant for a two-phase moisture model of cementitious materials

DEFF Research Database (Denmark)

Addassi, Mouadh; Johannesson, Björn; Wadsö, Lars

2018-01-01

Here we present an inverse analyses approach to determining the two-phase moisture transport properties relevant to concrete durability modeling. The purposed moisture transport model was based on a continuum approach with two truly separate equations for the liquid and gas phase being connected...... test, and, (iv) capillary suction test. Mass change over time, as obtained from the drying test, the two different cup test intervals and the capillary suction test, was used to obtain the effective diffusion parameters using the proposed inverse analyses approach. The moisture properties obtained...

Complementarity of the CERN LEP collider, the Fermilab Tevatron, and the CERN LHC in the search for a light MSSM Higgs boson

CERN Document Server

Carena, M S; Wagner, C E M

2000-01-01

We study the discovery potential of the CERN LHC, Fermilab Tevatron and CERN LEP colliders in the search for the neutral CP-even Higgs boson of the MSSM which couples to the weak gauge bosons with a strength close to the standard model one and, hence, plays a relevant role in the mechanism of electroweak symmetry breaking. We place special emphasis on the radiative effects which influence the discovery reach of these colliders. We concentrate on the Vbb channel, with V=Z or W, and on the channels with diphoton final states, which are the dominant ones for the search for a light standard model Higgs boson at LEP or Tevatron and LHC, respectively. By analyzing the parameters of the MSSM for which the searches become difficult at one or more of these three colliders, we demonstrate their complementarity in the search for a light Higgs boson which plays a relevant role in the mechanism of electroweak symmetry breaking. (32 refs).

The prevalence effect in lateral masking and its relevance for visual search.

Science.gov (United States)

Geelen, B P; Wertheim, A H

2015-04-01

In stimulus displays with or without a single target amid 1,644 identical distractors, target prevalence was varied between 20, 50 and 80 %. Maximum gaze deviation was measured to determine the strength of lateral masking in these arrays. The results show that lateral masking was strongest in the 20 % prevalence condition, which differed significantly from both the 50 and 80 % prevalence conditions. No difference was observed between the latter two. This pattern of results corresponds to that found in the literature on the prevalence effect in visual search (stronger lateral masking corresponding to longer search times). The data add to similar findings reported earlier (Wertheim et al. in Exp Brain Res, 170:387-402, 2006), according to which the effects of many well-known factors in visual search correspond to those on lateral masking. These were the effects of set size, disjunctions versus conjunctions, display area, distractor density, the asymmetry effect (Q vs. O's) and viewing distance. The present data, taken together with those earlier findings, may lend credit to a causal hypothesis that lateral masking could be a more important mechanism in visual search than usually assumed.

Statistical Measures Alone Cannot Determine Which Database (BNI, CINAHL, MEDLINE, or EMBASE Is the Most Useful for Searching Undergraduate Nursing Topics. A Review of: Stokes, P., Foster, A., & Urquhart, C. (2009. Beyond relevance and recall: Testing new user-centred measures of database performance. Health Information and Libraries Journal, 26(3, 220-231.

Directory of Open Access Journals (Sweden)

Giovanna Badia

2011-03-01

Full Text Available Objective – The research project sought to determine which of four databases was the most useful for searching undergraduate nursing topics. Design – Comparative database evaluation. Setting – Nursing and midwifery students at Homerton School of Health Studies (now part of Anglia Ruskin University, Cambridge, United Kingdom, in 2005-2006. Subjects – The subjects were four databases: British Nursing Index (BNI, CINAHL, MEDLINE, and EMBASE.Methods – This was a comparative study using title searches to compare BNI (BritishNursing Index, CINAHL, MEDLINE and EMBASE.According to the authors, this is the first study to compare BNI with other databases. BNI is a database produced by British libraries that indexes the nursing and midwifery literature. It covers over 240 British journals, and includes references to articles from health sciences journals that are relevant to nurses and midwives (British Nursing Index, n.d..The researchers performed keyword searches in the title field of the four databases for the dissertation topics of nine nursing and midwifery students enrolled in undergraduate dissertation modules. The list of titles of journals articles on their topics were given to the students and they were asked to judge the relevancy of the citations. The title searches were evaluated in each of the databases using the following criteria: • precision (the number of relevant results obtained in the database for a search topic, divided by the total number of results obtained in the database search;• recall (the number of relevant results obtained in the database for a search topic, divided by the total number of relevant results obtained on that topic from all four database searches;• novelty (the number of relevant results that were unique in the database search, which was calculated as a percentage of the total number of relevant results found in the database;• originality (the number of unique relevant results obtained in the

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.

What Snippets Say About Pages in Federated Web Search

NARCIS (Netherlands)

Demeester, Thomas; Nguyen, Dong-Phuong; Trieschnigg, Rudolf Berend; Develder, Chris; Hiemstra, Djoerd; Hou, Yuexian; Nie, Jian-Yun; Sun, Le; Wang, Bo; Zhang, Peng

2012-01-01

What is the likelihood that a Web page is considered relevant to a query, given the relevance assessment of the corresponding snippet? Using a new federated IR test collection that contains search results from over a hundred search engines on the internet, we are able to investigate such research

Pro SharePoint 2010 Search

CERN Document Server

Noble, J; Bakman-Mikalski, Dan

2011-01-01

Pro SharePoint 2010 Search gives you expert advice on planning, deploying and customizing searches in SharePoint 2010. Drawing on the authors' extensive experience of working with real-world SharePoint deployments, this book teaches everything you'll need to know to create well-designed SharePoint solutions that always keep the end-user's experience in mind. Increase your search efficiency with SharePoint 2010's search functionality: extend the search user interface using third-party tools, and utilize analytics to improve relevancy. This practical hands-on book is a must-have resource for any

Overview of the INEX 2014 Social Book Search Track

DEFF Research Database (Denmark)

Koolen, Marijn; Bogers, Toine; Kazai, Gabriella

2014-01-01

The goal of the INEX 2014 Social Book Search Track is to evaluate approaches for supporting users in searching collections of books based on book metadata and associated user-generated content. The track investigates the complex nature of relevance in book search and the role of traditional...... and user-generated book metadata in retrieval. We extended last year’s investigation into the nature of book suggestions from the LibraryThing forums and how they compare to book relevance judgements. Participants were encouraged to incorporate rich user profiles of both topic creators and other Library......Thing users to explore the relative value of recommendation and retrieval paradigms for book search. We found further support that such suggestions are a valuable alternative to traditional test collections that are based on top-k pooling and editorial relevance judgements....

[Influence of reverse osmosis concentrate on physicochemical parameters of Sini decoction material system and their relevance].

Science.gov (United States)

Jin, Tang-Hui; Zhang, Liu-Hong; Zhu, Hua-Xu; Guo, Li-Wei; Li, Bo; Lu, Ming-Ming

2014-04-01

By studying the process of reverse osmosis system for traditional Chinese medicine materials physicochemical parameters affecting the osmotic pressure of its relevance, new compound system reverse osmosis process design methods were explored. Three concentrations materials for high, middle and low were dubbed with Sini decoction as a model drug, and pretreated by 50 thousand relative molecular weight cut-off ultrafiltration membrane. The viscosity, turbidity, conductivity, salinity, TDS, pH value and osmotic pressure of each sample were determined after the reverse osmosis to study the physical and chemical parameters between their respective correlations with the osmotic pressure, and characterized by HPLC chromatograms showing changes before and after the main chemical composition of samples of reverse osmosis. Conductivity-osmotic pressure, salinity-osmotic pressure of the linear correlation coefficient, TDS-osmotic pressure between the three sets of parameters were 0.963 8, 0.932 7, 0.973 7, respectively. Reverse osmosis concentrate and its characteristic spectrum ultrafiltrate HPLC similarity were up to 0. 968 or more, except the low concentrations. There is a significant correlation between the three physicochemical parameters (conductivity, salinity, TDS) and osmotic pressure of each sample system, and there is also significant linear correlation between salinity, conductivity, TDS. The original chemical composition of Sini decoction material concentrate was completely remained after the process of reverse osmosis.

The Relevant Physical Trace in Criminal Investigation

Directory of Open Access Journals (Sweden)

Durdica Hazard

2016-01-01

Full Text Available A criminal investigation requires the forensic scientist to search and to interpret vestiges of a criminal act that happened in the past. The forensic scientist is one of the many stakeholders who take part in the information quest within the criminal justice system. She reads the investigation scene in search of physical traces that should enable her to tell the story of the offense/crime that allegedly occurred. The challenge for any investigator is to detect and recognize relevant physical traces in order to provide clues for investigation and intelligence purposes, and that will constitute sound and relevant evidence for the court. This article shows how important it is to consider the relevancy of physical traces from the beginning of the investigation and what might influence the evaluation process. The exchange and management of information between the investigation stakeholders are important. Relevancy is a dimension that needs to be understood from the standpoints of law enforcement personnel and forensic scientists with the aim of strengthening investigation and ultimately the overall judicial process.

Adjusting the Parameters of Metal Oxide Gapless Surge Arresters’ Equivalent Circuits Using the Harmony Search Method

Directory of Open Access Journals (Sweden)

Christos A. Christodoulou

2017-12-01

Full Text Available The appropriate circuit modeling of metal oxide gapless surge arresters is critical for insulation coordination studies. Metal oxide arresters present a dynamic behavior for fast front surges; namely, their residual voltage is dependent on the peak value, as well as the duration of the injected impulse current, and should therefore not only be represented by non-linear elements. The aim of the current work is to adjust the parameters of the most frequently used surge arresters’ circuit models by considering the magnitude of the residual voltage, as well as the dissipated energy for given pulses. In this aim, the harmony search method is implemented to adjust parameter values of the arrester equivalent circuit models. This functions by minimizing a defined objective function that compares the simulation outcomes with the manufacturer’s data and the results obtained from previous methodologies.

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

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.

Students are Confident Using Federated Search Tools as much as Single Databases. A Review of: Armstrong, A. (2009. Student perceptions of federated searching vs. single database searching. Reference Services Review, 37(3, 291-303. doi:10.1108/00907320910982785

Directory of Open Access Journals (Sweden)

Deena Yanofsky

2011-09-01

Full Text Available Objective – To measure students’ perceptions of the ease-of-use and efficacy of a federated search tool versus a single multidisciplinary database.Design – An evaluation worksheet, employing a combination of quantitative and qualitative questions.Setting – A required, first-year English composition course taught at the University of Illinois at Chicago (UIC.Subjects – Thirty-one undergraduate students completed and submitted the worksheet.Methods – Students attended two library instruction sessions. The first session introduced participants to basic Boolean searching (using AND only, selecting appropriate keywords and searching for books in the library catalogue. In the second library session, students were handed an evaluation worksheet and, with no introduction to the process of searching article databases, were asked to find relevant articles on a research topic of their own choosing using both a federated search tool and a single multidisciplinary database. The evaluation worksheet was divided into four sections: step-by-step instructions for accessing the single multidisciplinary database and the federated search tool; space to record search strings in both resources; space to record the titles of up to five relevant articles; and a series of quantitative and qualitative questions regarding ease-of-use, relevancy of results, overall preference (if any between the two resources, likeliness of future use and other preferred research tools. Half of the participants received a worksheet with instructions to search the federated search tool before the single database; the order was reversed for the other half of the students. The evaluation worksheet was designed to be completed in one hour.Participant responses to qualitative questions were analyzed, codified and grouped into thematic categories. If a student mentioned more than one factor in responding to a question, their response was recorded in multiple categories.Main Results �

Surgeon Reported Outcome Measure for Spine Trauma an International Expert Survey Identifying Parameters Relevant for The Outcome of Subaxial Cervical Spine Injuries

NARCIS (Netherlands)

Sadiqi, Said; Verlaan, Jorrit Jan; Lehr, A. M.; Dvorak, Marcel F.; Kandziora, Frank; Rajasekaran, S.; Schnake, Klaus J.; Vaccaro, Alexander R.; Oner, F. C.

2016-01-01

STUDY DESIGN.: International web-based survey OBJECTIVE.: To identify clinical and radiological parameters that spine surgeons consider most relevant when evaluating clinical and functional outcomes of subaxial cervical spine trauma patients. SUMMARY OF BACKGROUND DATA.: While an outcome instrument

ROLE AND IMPORTANCE OF SEARCH ENGINE OPTIMIZATION

OpenAIRE

Gurneet Kaur

2017-01-01

Search Engines are an indispensible platform for users all over the globe to search for relevant information online. Search Engine Optimization (SEO) is the exercise of improving the position of a website in search engine rankings, for a chosen set of keywords. SEO is divided into two parts: On-Page and Off-Page SEO. In order to be successful, both the areas require equal attention. This paper aims to explain the functioning of the search engines along with the role and importance of search e...

Exposition concerning small windmills. List of relevant publications

International Nuclear Information System (INIS)

Aurvig, D.

1992-09-01

In connection with the publication of the report entitled ''Exposition Concerning Small Windmills'', it was decided that searching in databases should also be used in relation to the collection of relevant information, and that the results of these searches should be published in the form of a reading list. This is presented here. The subject areas covered are technology, research and development, marketing, developing countries and agricultural areas - all relevant to small windmills. Risoe Library, Roskilde, Denmark (Telephone no. (45) 42371212) will be helpful in acquiring any publication(s) referenced in the reading list. The report number J.No. 51171/92-0019 should also be quoted. (AB)

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.

Search for non-standard SUSY signatures in CMS

International Nuclear Information System (INIS)

Teyssier, Daniel

2008-01-01

New studies of the CMS collaboration are presented on the sensitivity to searches for non-standard signatures of particular SUSY scenarios. These signatures include non-pointing photons as well as pairs of prompt photons as expected GMSB SUSY models, as well as heavy stable charged particles produced in split supersymmetry models, long lived staus from GMSB SUSY and long lived stops in other SUSY scenarios. Detailed detector simulation is used for the study, and all relevant Standard Model background and detector effects that can mimic these special signatures are included. It is shown that with already with less than 100 pb -1 the CMS sensitivity will probe an interesting as yet by data unexplored parameter range of these models.

Using the Characteristics of Documents, Users and Tasks to Predict the Situational Relevance of Health Web Documents

Directory of Open Access Journals (Sweden)

Melinda Oroszlányová

2017-09-01

Full Text Available Relevance is usually estimated by search engines using document content, disregarding the user behind the search and the characteristics of the task. In this work, we look at relevance as framed in a situational context, calling it situational relevance, and analyze whether it is possible to predict it using documents, users and tasks characteristics. Using an existing dataset composed of health web documents, relevance judgments for information needs, user and task characteristics, we build a multivariate prediction model for situational relevance. Our model has an accuracy of 77.17%. Our findings provide insights into features that could improve the estimation of relevance by search engines, helping to conciliate the systemic and situational views of relevance. In a near future we will work on the automatic assessment of document, user and task characteristics.

A study of Consistency in the Selection of Search Terms and Search Concepts: A Case Study in National Taiwan University

Directory of Open Access Journals (Sweden)

Mu-hsuan Huang

2001-12-01

Full Text Available This article analyzes the consistency in the selection of search terms and search contents of college and graduate students in National Taiwan University when they are using PsycLIT CD-ROM database. 31 students conducted pre-assigned searches, doing 59 searches generating 609 search terms. The study finds the consistency in selection of search terms of first level is 22.14% and second level is 35%. These results are similar with others’ researches. About the consistency in search concepts, no matter the overlaps of searched articles or judge relevant articles are lower than other researches. [Article content in Chinese

Searching for Mirrors: Preservice Teachers' Journey toward More Culturally Relevant Pedagogy

Science.gov (United States)

Christ, Tanya; Sharma, Sue Ann

2018-01-01

Culturally relevant text selection and pedagogy support students' motivation, engagement, literacy outcomes, and positive identity formation. Nevertheless, there is limited research on teacher preparation that fosters these outcomes. We explore 17 preservice teachers' challenges and successes with culturally relevant text selection and pedagogy…

Integrating retention soil filters into urban hydrologic models - Relevant processes and important parameters

Science.gov (United States)

Bachmann-Machnik, Anna; Meyer, Daniel; Waldhoff, Axel; Fuchs, Stephan; Dittmer, Ulrich

2018-04-01

Retention Soil Filters (RSFs), a form of vertical flow constructed wetlands specifically designed for combined sewer overflow (CSO) treatment, have proven to be an effective tool to mitigate negative impacts of CSOs on receiving water bodies. Long-term hydrologic simulations are used to predict the emissions from urban drainage systems during planning of stormwater management measures. So far no universally accepted model for RSF simulation exists. When simulating hydraulics and water quality in RSFs, an appropriate level of detail must be chosen for reasonable balancing between model complexity and model handling, considering the model input's level of uncertainty. The most crucial parameters determining the resultant uncertainties of the integrated sewer system and filter bed model were identified by evaluating a virtual drainage system with a Retention Soil Filter for CSO treatment. To determine reasonable parameter ranges for RSF simulations, data of 207 events from six full-scale RSF plants in Germany were analyzed. Data evaluation shows that even though different plants with varying loading and operation modes were examined, a simple model is sufficient to assess relevant suspended solids (SS), chemical oxygen demand (COD) and NH4 emissions from RSFs. Two conceptual RSF models with different degrees of complexity were assessed. These models were developed based on evaluation of data from full scale RSF plants and column experiments. Incorporated model processes are ammonium adsorption in the filter layer and degradation during subsequent dry weather period, filtration of SS and particulate COD (XCOD) to a constant background concentration and removal of solute COD (SCOD) by a constant removal rate during filter passage as well as sedimentation of SS and XCOD in the filter overflow. XCOD, SS and ammonium loads as well as ammonium concentration peaks are discharged primarily via RSF overflow not passing through the filter bed. Uncertainties of the integrated

Antenna concepts for interstellar search systems

International Nuclear Information System (INIS)

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

1977-01-01

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

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

Science.gov (United States)

Hennesy, Cody; Bowman, John

2008-01-01

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

Identifying Relevant Studies in Software Engineering

DEFF Research Database (Denmark)

Zhang, He; Ali Babar, Muhammad; Tell, Paolo

2011-01-01

Context: Systematic literature review (SLR) has become an important research methodology in software engineering since the introduction of evidence-based software engineering (EBSE) in 2004. One critical step in applying this methodology is to design and execute appropriate and effective search....... Objective: The main objective of the research reported in this paper is to improve the search step of undertaking SLRs in software engineering (SE) by devising and evaluating systematic and practical approaches to identifying relevant studies in SE. Method: We have systematically selected and analytically...

On the Convergence of Asynchronous Parallel Pattern Search

International Nuclear Information System (INIS)

Tamara Gilbson Kolda

2002-01-01

In this paper the authors prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. They lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semi-autonomously. By bounding the value of the step-length control parameter after any step that produces decrease along a single search direction, they can prove that all the processes share a common accumulation point and that such a point is a stationary point of the standard nonlinear unconstrained optimization problem

PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

Science.gov (United States)

da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

2009-10-01

very important to solve computationally complex problems (e.g., protein folding), which involve optimizations in very high dimensional energy landscapes. On the other hand, random searches can also be studied from the perspective of diffusion and transport properties which is an important topic in condensed matter and statistical physics. For instance, the features of light scattered in a media, where the scatterers have a power-law distribution of sizes in many aspects, may resemble the patterns generated by a searcher performing Lévy walks. There are many questions related to random searches: how the searcher moves or should move, what are the patterns generated during the locomotion, how do the encounter rates depend on parameters of the search, etc. But perhaps, the most well known issue is how to optimize the search for specific target scenarios. The optimization can be in either continuous or discrete environments, when the information available is limited. The answer to this question determines specific strategies of movement that would maximize some properly defined search efficiency measure. The relevance of the question stems from the fact that the strategy-dynamics represents one of the most important factors that modulate the rate of encounters (e.g., the encounter rate between predator and prey). In the general context, strategy choices can be essential in determining the outcome and thus the success of a given search. For instance, realistic searches—and locomotion in general—require the expenditure of energy. Thus, inefficient search could deplete energy reserves (e.g., fat) and lead to rates of encounters below a minimum acceptable threshold (resulting in extinction of a species, for example). The framework of the random search `game' distinguishes between the two interacting players in a context of pursuit and chance. They are either a `searcher' (e.g., predator, protein, radar, `crawler') or a `target' (e.g., prey, DNA sequence, a missing

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

Search for Supersymmetric Particles in $e^{+}e^{-}$ Collisions at $\\sqrt{s}$ up to 202 GeV and Mass Limit for the Lightest Neutralino

CERN Document Server

Barate, R; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Jézéquel, S; Lees, J P; Martin, F; Merle, E; Minard, M N; Pietrzyk, B; Bravo, S; Casado, M P; Chmeissani, M; Crespo, J M; Fernández, E; Fernández-Bosman, M; Garrido, L; Graugès-Pous, E; López, J; Martínez, M; Merino, G; Miquel, R; Mir, L M; Pacheco, A; Paneque, D; Ruiz, H; Colaleo, A; Creanza, D; De Filippis, N; De Palma, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Nuzzo, S; Ranieri, A; Raso, G; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Tricomi, A; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Abbaneo, D; Azzurri, P; Barklow, Timothy L; Boix, G; Buchmüller, O L; Cattaneo, M; Cerutti, F; Clerbaux, B; Dissertori, G; Drevermann, H; Forty, Roger W; Frank, M; Gianotti, F; Greening, T C; Hansen, J B; Harvey, J; Hutchcroft, D E; Janot, P; Jost, B; Kado, M; Lemaître, V; Maley, P; Mato, P; Minten, Adolf G; Moutoussi, A; Ranjard, F; Rolandi, Luigi; Schlatter, W D; Schmitt, M; Schneider, O; Spagnolo, P; Tejessy, W; Teubert, F; Tournefier, E; Valassi, Andrea; Ward, J J; Wright, A E; Ajaltouni, Ziad J; Badaud, F; Dessagne, S; Falvard, A; Fayolle, D; Gay, P; Henrard, P; Jousset, J; Michel, B; Monteil, S; Montret, J C; Pallin, D; Pascolo, J M; Perret, P; Podlyski, F; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Wäänänen, A; Daskalakis, G; Kyriakis, A; Markou, C; Simopoulou, Errietta; Vayaki, Anna; Blondel, A; Brient, J C; Machefert, F P; Rougé, A; Swynghedauw, M; Tanaka, R; Videau, H L; Focardi, E; Parrini, G; Zachariadou, K; Antonelli, A; Antonelli, M; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Passalacqua, L; Pepé-Altarelli, M; Chalmers, M; Halley, A W; Kennedy, J; Lynch, J G; Negus, P; O'Shea, V; Räven, B; Smith, D; Teixeira-Dias, P; Thompson, A S; Cavanaugh, R J; Dhamotharan, S; Geweniger, C; Hanke, P; Hepp, V; Kluge, E E; Leibenguth, G; Putzer, A; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Davies, G; Dornan, Peter J; Girone, M; Marinelli, N; Nowell, J; Przysiezniak, H; Sedgbeer, J K; Thompson, J C; Thomson, E; White, R; Ghete, V M; Girtler, P; Kneringer, E; Kuhn, D; Rudolph, G; Bouhova-Thacker, E; Bowdery, C K; Clarke, D P; Ellis, G; Finch, A J; Foster, F; Hughes, G; Jones, R W L; Pearson, M R; Robertson, N A; Smizanska, M; Giehl, I; Hölldorfer, F; Jakobs, K; Kleinknecht, K; Kröcker, M; Müller, A S; Nürnberger, H A; Quast, G; Renk, B; Rohne, E; Sander, H G; Schmeling, S; Wachsmuth, H W; Zeitnitz, C; Ziegler, T; Bonissent, A; Carr, J; Coyle, P; Curtil, C; Ealet, A; Fouchez, D; Leroy, O; Kachelhoffer, T; Payre, P; Rousseau, D; Tilquin, A; Aleppo, M; Gilardoni, S S; Ragusa, F; David, A; Dietl, H; Ganis, G; Heister, A; Hüttmann, K; Lütjens, G; Mannert, C; Männer, W; Moser, H G; Schael, S; Settles, Ronald; Stenzel, H; Wolf, G; Boucrot, J; Callot, O; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacholkowska, A; Serin, L; Veillet, J J; Videau, I; De Vivie de Régie, J B; Yuan, C; Zerwas, D; Bagliesi, G; Boccali, T; Calderini, G; Ciulli, V; Foà, L; Giammanco, A; Giassi, A; Ligabue, F; Messineo, A; Palla, Fabrizio; Sanguinetti, G; Sciabà, A; Sguazzoni, G; Tenchini, Roberto; Venturi, A; Verdini, P G; Blair, G A; Coles, J; Cowan, G D; Green, M G; Jones, L T; Medcalf, T; Strong, J A; Clifft, R W; Edgecock, T R; Norton, P R; Tomalin, I R; Bloch-Devaux, B; Boumediene, D E; Colas, P; Fabbro, B; Lançon, E; Lemaire, M C; Locci, E; Pérez, P; Rander, J; Renardy, J F; Rosowsky, A; Seager, P; Trabelsi, A; Tuchming, B; Vallage, B; Konstantinidis, N P; Loomis, C; Litke, A M; Taylor, G; Booth, C N; Cartwright, S L; Combley, F; Hodgson, P N; Lehto, M H; Thompson, L F; Affholderbach, K; Böhrer, A; Brandt, S; Grupen, Claus; Hess, J; Misiejuk, A; Prange, G; Sieler, U; Borean, C; Giannini, G; Gobbo, B; He, H; Pütz, J; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Cranmer, K; Elmer, P; Ferguson, D P S; Gao, Y; González, S; Hayes, O J; Hu, H; Jin, S; Kile, J; McNamara, P A; Nielsen, J; Orejudos, W; Pan, Y B; Saadi, Y; Scott, I J; Von Wimmersperg-Töller, J H; Walsh, J; Wiedenmann, W; Wu, J; Wu Sau Lan; Wu, X; Zobernig, G

2001-01-01

Searches for pair production of squarks, sleptons, charginos and neutralinos are performed with the data collected by the ALEPH detector at LEP at centre-of-mass energies from 188.6 to 201.6 GeV. No evidence for any such signals is observed in a total integrated luminosity of about 410 pb**-1. The negative results of the searches are translated into exclusion domains in the space of the relevant MSSM parameters, which improve significantly on the constraints set previously. Under the assumptions of gaugino and sfermion mass unification, these results allow a 95% C.L. lower limit of 37 GeV/c**2 to be set on the mass of the lightest neutralino for any tan(beta) and sfermion mass. Additional constraints in the MSSM parameter space are derived from the negative results of ALEPH searches for Higgs bosons. The results are also interpreted in the framework of minimal supergravity.

Objective and automated protocols for the evaluation of biomedical search engines using No Title Evaluation protocols.

Science.gov (United States)

Campagne, Fabien

2008-02-29

The evaluation of information retrieval techniques has traditionally relied on human judges to determine which documents are relevant to a query and which are not. This protocol is used in the Text Retrieval Evaluation Conference (TREC), organized annually for the past 15 years, to support the unbiased evaluation of novel information retrieval approaches. The TREC Genomics Track has recently been introduced to measure the performance of information retrieval for biomedical applications. We describe two protocols for evaluating biomedical information retrieval techniques without human relevance judgments. We call these protocols No Title Evaluation (NT Evaluation). The first protocol measures performance for focused searches, where only one relevant document exists for each query. The second protocol measures performance for queries expected to have potentially many relevant documents per query (high-recall searches). Both protocols take advantage of the clear separation of titles and abstracts found in Medline. We compare the performance obtained with these evaluation protocols to results obtained by reusing the relevance judgments produced in the 2004 and 2005 TREC Genomics Track and observe significant correlations between performance rankings generated by our approach and TREC. Spearman's correlation coefficients in the range of 0.79-0.92 are observed comparing bpref measured with NT Evaluation or with TREC evaluations. For comparison, coefficients in the range 0.86-0.94 can be observed when evaluating the same set of methods with data from two independent TREC Genomics Track evaluations. We discuss the advantages of NT Evaluation over the TRels and the data fusion evaluation protocols introduced recently. Our results suggest that the NT Evaluation protocols described here could be used to optimize some search engine parameters before human evaluation. Further research is needed to determine if NT Evaluation or variants of these protocols can fully substitute

Project Lefty: More Bang for the Search Query

Science.gov (United States)

Varnum, Ken

2010-01-01

This article describes the Project Lefty, a search system that, at a minimum, adds a layer on top of traditional federated search tools that will make the wait for results more worthwhile for researchers. At best, Project Lefty improves search queries and relevance rankings for web-scale discovery tools to make the results themselves more relevant…

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.

Retrieving clinical evidence: a comparison of PubMed and Google Scholar for quick clinical searches.

Science.gov (United States)

Shariff, Salimah Z; Bejaimal, Shayna Ad; Sontrop, Jessica M; Iansavichus, Arthur V; Haynes, R Brian; Weir, Matthew A; Garg, Amit X

2013-08-15

Physicians frequently search PubMed for information to guide patient care. More recently, Google Scholar has gained popularity as another freely accessible bibliographic database. To compare the performance of searches in PubMed and Google Scholar. We surveyed nephrologists (kidney specialists) and provided each with a unique clinical question derived from 100 renal therapy systematic reviews. Each physician provided the search terms they would type into a bibliographic database to locate evidence to answer the clinical question. We executed each of these searches in PubMed and Google Scholar and compared results for the first 40 records retrieved (equivalent to 2 default search pages in PubMed). We evaluated the recall (proportion of relevant articles found) and precision (ratio of relevant to nonrelevant articles) of the searches performed in PubMed and Google Scholar. Primary studies included in the systematic reviews served as the reference standard for relevant articles. We further documented whether relevant articles were available as free full-texts. Compared with PubMed, the average search in Google Scholar retrieved twice as many relevant articles (PubMed: 11%; Google Scholar: 22%; PGoogle Scholar: 8%; P=.07). Google Scholar provided significantly greater access to free full-text publications (PubMed: 5%; Google Scholar: 14%; PGoogle Scholar returns twice as many relevant articles as PubMed and provides greater access to free full-text articles.

A SEARCH FOR THE TRANSIT OF HD 168443b: IMPROVED ORBITAL PARAMETERS AND PHOTOMETRY

Energy Technology Data Exchange (ETDEWEB)

Pilyavsky, Genady; Mahadevan, Suvrath; Wright, Jason T.; Wang, Xuesong X. [Department of Astronomy and Astrophysics, Pennsylvania State University, 525 Davey Laboratory, University Park, PA 16802 (United States); Kane, Stephen R.; Ciardi, David R.; Dragomir, Diana; Von Braun, Kaspar [NASA Exoplanet Science Institute, Caltech, MS 100-22, 770 South Wilson Avenue, Pasadena, CA 91125 (United States); Howard, Andrew W. [Department of Astronomy, University of California, Berkeley, CA 94720 (United States); De Pree, Chris; Marlowe, Hannah [Department of Physics and Astronomy, Agnes Scott College, 141 East College Avenue, Decatur, GA 30030 (United States); Fischer, Debra [Department of Astronomy, Yale University, New Haven, CT 06511 (United States); Henry, Gregory W. [Center of Excellence in Information Systems, Tennessee State University, 3500 John A. Merritt Blvd., Box 9501, Nashville, TN 37209 (United States); Jensen, Eric L. N. [Department of Physics and Astronomy, Swarthmore College, Swarthmore, PA 19081 (United States); Laughlin, Gregory [UCO/Lick Observatory, University of California, Santa Cruz, CA 95064 (United States); Rabus, Markus, E-mail: gcp5017@psu.edu, E-mail: suvrath@astro.psu.edu [Departamento de Astonomia y Astrofisica, Pontificia Universidad Catolica de Chile, Casilla 306, Santiago 22 (Chile)

2011-12-20

The discovery of transiting planets around bright stars holds the potential to greatly enhance our understanding of planetary atmospheres. In this work we present the search for transits of HD 168443b, a massive planet orbiting the bright star HD 168443 (V = 6.92) with a period of 58.11 days. The high eccentricity of the planetary orbit (e = 0.53) significantly enhances the a priori transit probability beyond that expected for a circular orbit, making HD 168443 a candidate for our ongoing Transit Ephemeris Refinement and Monitoring Survey. Using additional radial velocities from Keck High Resolution Echelle Spectrometer, we refined the orbital parameters of this multi-planet system and derived a new transit ephemeris for HD 168443b. The reduced uncertainties in the transit window make a photometric transit search practicable. Photometric observations acquired during predicted transit windows were obtained on three nights. Cerro Tololo Inter-American Observatory 1.0 m photometry acquired on 2010 September 7 had the required precision to detect a transit but fell just outside of our final transit window. Nightly photometry from the T8 0.8 m automated photometric telescope at Fairborn Observatory, acquired over a span of 109 nights, demonstrates that HD 168443 is constant on a timescale of weeks. Higher-cadence photometry on 2011 April 28 and June 25 shows no evidence of a transit. We are able to rule out a non-grazing transit of HD 168443b.

A Search for the Transit of HD 168443b: Improved Orbital Parameters and Photometry

Science.gov (United States)

Pilyavsky, Genady; Mahadevan, Suvrath; Kane, Stephen R.; Howard, Andrew W.; Ciardi, David R.; de Pree, Chris; Dragomir, Diana; Fischer, Debra; Henry, Gregory W.; Jensen, Eric L. N.; Laughlin, Gregory; Marlowe, Hannah; Rabus, Markus; von Braun, Kaspar; Wright, Jason T.; Wang, Xuesong X.

2011-12-01

The discovery of transiting planets around bright stars holds the potential to greatly enhance our understanding of planetary atmospheres. In this work we present the search for transits of HD 168443b, a massive planet orbiting the bright star HD 168443 (V = 6.92) with a period of 58.11 days. The high eccentricity of the planetary orbit (e = 0.53) significantly enhances the a priori transit probability beyond that expected for a circular orbit, making HD 168443 a candidate for our ongoing Transit Ephemeris Refinement and Monitoring Survey. Using additional radial velocities from Keck High Resolution Echelle Spectrometer, we refined the orbital parameters of this multi-planet system and derived a new transit ephemeris for HD 168443b. The reduced uncertainties in the transit window make a photometric transit search practicable. Photometric observations acquired during predicted transit windows were obtained on three nights. Cerro Tololo Inter-American Observatory 1.0 m photometry acquired on 2010 September 7 had the required precision to detect a transit but fell just outside of our final transit window. Nightly photometry from the T8 0.8 m automated photometric telescope at Fairborn Observatory, acquired over a span of 109 nights, demonstrates that HD 168443 is constant on a timescale of weeks. Higher-cadence photometry on 2011 April 28 and June 25 shows no evidence of a transit. We are able to rule out a non-grazing transit of HD 168443b.

Evolution of a search: the use of dynamic twitter searches during superstorm sandy.

Science.gov (United States)

Harris Smith, Sara; Bennett, Kelly J; Livinski, Alicia A

2014-09-26

Twitter has emerged as a critical source of free and openly available information during emergency response operations, providing an unmatched level of on-the-ground situational awareness in real-time. Responders and survivors turn to Twitter to share information and resources within communities, conduct rumor control, and provide a "boots on the ground" understanding of the disaster. However, the ability to tune out background "noise" is essential to effectively utilizing Twitter to identify important and useful information during an emergency response. This article highlights a two-prong strategy in which the use of a Twitter list paired with subject specific Boolean searches provided increased situational awareness and early event detection during the United States Department of Health and Human Services (HHS), Office of the Assistant Secretary for Preparedness and Response (ASPR) response to Superstorm Sandy in 2012. To maximize the amount of relevant information that was retrieved, the Twitter list and Boolean searches were dynamic and responsive to real-time developments, evolving health threats, and the informational needs of decision-makers. The use of a Twitter list combined with Boolean searches led to enhanced situational awareness throughout the HHS response. The incorporation of a dynamic search strategy over the course of the HHS Sandy response, allowed for the ability to account for over-tweeted information, changes in event related conversation, and decreases in the return of relevant information.

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

Lost in the supermarket: Quantifying the cost of partitioning memory sets in hybrid search.

Science.gov (United States)

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

2018-01-01

The items on a memorized grocery list are not relevant in every aisle; for example, it is useless to search for the cabbage in the cereal aisle. It might be beneficial if one could mentally partition the list so only the relevant subset was active, so that vegetables would be activated in the produce section. In four experiments, we explored observers' abilities to partition memory searches. For example, if observers held 16 items in memory, but only eight of the items were relevant, would response times resemble a search through eight or 16 items? In Experiments 1a and 1b, observers were not faster for the partition set; however, they suffered relatively small deficits when "lures" (items from the irrelevant subset) were presented, indicating that they were aware of the partition. In Experiment 2 the partitions were based on semantic distinctions, and again, observers were unable to restrict search to the relevant items. In Experiments 3a and 3b, observers attempted to remove items from the list one trial at a time but did not speed up over the course of a block, indicating that they also could not limit their memory searches. Finally, Experiments 4a, 4b, 4c, and 4d showed that observers were able to limit their memory searches when a subset was relevant for a run of trials. Overall, observers appear to be unable or unwilling to partition memory sets from trial to trial, yet they are capable of restricting search to a memory subset that remains relevant for several trials. This pattern is consistent with a cost to switching between currently relevant memory items.

Google Scholar Out-Performs Many Subscription Databases when Keyword Searching. A Review of: Walters, W. H. (2009. Google Scholar search performance: Comparative recall and precision. portal: Libraries and the Academy, 9(1, 5-24.

Directory of Open Access Journals (Sweden)

Giovanna Badia

2010-09-01

Full Text Available Objective – To compare the search performance (i.e., recall and precision of Google Scholar with that of 11 other bibliographic databases when using a keyword search to find references on later-life migration. Design – Comparative database evaluation. Setting – Not stated in the article. It appears from the author’s affiliation that this research took place in an academic institution of higher learning. Subjects – Twelve databases were compared: Google Scholar, Academic Search Elite, AgeLine, ArticleFirst, EconLit, Geobase, Medline, PAIS International, Popline, Social Sciences Abstracts, Social Sciences Citation Index, and SocIndex. Methods – The relevant literature on later-life migration was pre-identified as a set of 155 journal articles published from 1990 to 2000. The author selected these articles from database searches, citation tracking, journal scans, and consultations with social sciences colleagues. Each database was evaluated with regards to its performance in finding references to these 155 papers.Elderly and migration were the keywords used to conduct the searches in each of the 12 databases, since these were the words that were the most frequently used in the titles of the 155 relevant articles. The search was performed in the most basic search interface of each database that allowed limiting results by the needed publication dates (1990-2000. Search results were sorted by relevance when possible (for 9 out of the 12 databases, and by date when the relevance sorting option was not available. Recall and precision statistics were then calculated from the search results. Recall is the number of relevant results obtained in the database for a search topic, divided by all the potential results which can be obtained on that topic (in this case, 155 references. Precision is the number of relevant results obtained in the database for a search topic, divided by the total number of results that were obtained in the database on

Realistic searches on stretched exponential networks

Indian Academy of Sciences (India)

We consider navigation or search schemes on networks which have a degree distribution of the form () ∝ exp(−). In addition, the linking probability is taken to be dependent on social distances and is governed by a parameter . The searches are realistic in the sense that not all search chains can be completed.

Adaptive Large Neighbourhood Search

DEFF Research Database (Denmark)

Røpke, Stefan

Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

PubMed alternatives to search MEDLINE: An environmental scan

Directory of Open Access Journals (Sweden)

Arun Keepanasseril

2014-01-01

Full Text Available The prime objective of this article is to introduce the newer methods to access, search and process MEDLINE citations. It also aims to provide a brief overview of each service′s salient features. A targeted search was conducted in MEDLINE through the OVID gateway. This was followed with a search in Google Scholar as well as Google and Bing. Ninety-two web-based services that can be used to search MEDLINE were identified. The list was shortened to 24 by applying a set of relevancy criteria to select those services more relevant to general medical and dental users. Salient features of the selected services are outlined and a use case based classification of the system has been proposed to help dental practitioners and researchers select the appropriate service for a given purpose.

TaBoo SeArch Algorithm with a Modified Inverse Histogram for Reproducing Biologically Relevant Rare Events of Proteins.

Science.gov (United States)

Harada, Ryuhei; Takano, Yu; Shigeta, Yasuteru

2016-05-10

The TaBoo SeArch (TBSA) algorithm [ Harada et al. J. Comput. Chem. 2015 , 36 , 763 - 772 and Harada et al. Chem. Phys. Lett. 2015 , 630 , 68 - 75 ] was recently proposed as an enhanced conformational sampling method for reproducing biologically relevant rare events of a given protein. In TBSA, an inverse histogram of the original distribution, mapped onto a set of reaction coordinates, is constructed from trajectories obtained by multiple short-time molecular dynamics (MD) simulations. Rarely occurring states of a given protein are statistically selected as new initial states based on the inverse histogram, and resampling is performed by restarting the MD simulations from the new initial states to promote the conformational transition. In this process, the definition of the inverse histogram, which characterizes the rarely occurring states, is crucial for the efficiency of TBSA. In this study, we propose a simple modification of the inverse histogram to further accelerate the convergence of TBSA. As demonstrations of the modified TBSA, we applied it to (a) hydrogen bonding rearrangements of Met-enkephalin, (b) large-amplitude domain motions of Glutamine-Binding Protein, and (c) folding processes of the B domain of Staphylococcus aureus Protein A. All demonstrations numerically proved that the modified TBSA reproduced these biologically relevant rare events with nanosecond-order simulation times, although a set of microsecond-order, canonical MD simulations failed to reproduce the rare events, indicating the high efficiency of the modified TBSA.

Clinically relevant incidental cardiovascular findings in CT examinations

International Nuclear Information System (INIS)

Voigt, P.; Fahnert, J.; Kahn, T.; Surov, A.; Schramm, D.; Bach, A.G.

2017-01-01

Incidental cardiovascular findings are a frequent phenomenon in computed tomography (CT) examinations. As the result of a dedicated PubMed search this article gives a systemic overview of the current literature on the most important incidental cardiovascular findings, their prevalence and clinical relevance. The majority of incidental cardiovascular findings are of only low clinical relevance; however, highly relevant incidental findings, such as aortic aneurysms, thromboses and thromboembolic events can also occasionally be found, especially in oncology patients. The scans from every CT examination should also be investigated for incidental findings as they can be of decisive importance for the further clinical management of patients, depending on their clinical relevance. (orig.) [de

In search of the best match: probing a multi-dimensional cloud microphysical parameter space to better understand what controls cloud thermodynamic phase

Science.gov (United States)

Tan, Ivy; Storelvmo, Trude

2015-04-01

Substantial improvements have been made to the cloud microphysical schemes used in the latest generation of global climate models (GCMs), however, an outstanding weakness of these schemes lies in the arbitrariness of their tuning parameters, which are also notoriously fraught with uncertainties. Despite the growing effort in improving the cloud microphysical schemes in GCMs, most of this effort has neglected to focus on improving the ability of GCMs to accurately simulate the present-day global distribution of thermodynamic phase partitioning in mixed-phase clouds. Liquid droplets and ice crystals not only influence the Earth's radiative budget and hence climate sensitivity via their contrasting optical properties, but also through the effects of their lifetimes in the atmosphere. The current study employs NCAR's CAM5.1, and uses observations of cloud phase obtained by NASA's CALIOP lidar over a 79-month period (November 2007 to June 2014) guide the accurate simulation of the global distribution of mixed-phase clouds in 20∘ latitudinal bands at the -10∘ C, -20∘C and -30∘C isotherms, by adjusting six relevant cloud microphysical tuning parameters in the CAM5.1 via Quasi-Monte Carlo sampling. Among the parameters include those that control the Wegener-Bergeron-Findeisen (WBF) timescale for the conversion of supercooled liquid droplets to ice and snow in mixed-phase clouds, the fraction of ice nuclei that nucleate ice in the atmosphere, ice crystal sedimentation speed, and wet scavenging in stratiform and convective clouds. Using a Generalized Linear Model as a variance-based sensitivity analysis, the relative contributions of each of the six parameters are quantified to gain a better understanding of the importance of their individual and two-way interaction effects on the liquid to ice proportion in mixed-phase clouds. Thus, the methodology implemented in the current study aims to search for the combination of cloud microphysical parameters in a GCM that

Web-Scale Discovery Services Retrieve Relevant Results in Health Sciences Topics Including MEDLINE Content

Directory of Open Access Journals (Sweden)

Elizabeth Margaret Stovold

2017-06-01

Full Text Available A Review of: Hanneke, R., & O’Brien, K. K. (2016. Comparison of three web-scale discovery services for health sciences research. Journal of the Medical Library Association, 104(2, 109-117. http://dx.doi.org/10.3163/1536-5050.104.2.004 Abstract Objective – To compare the results of health sciences search queries in three web-scale discovery (WSD services for relevance, duplicate detection, and retrieval of MEDLINE content. Design – Comparative evaluation and bibliometric study. Setting – Six university libraries in the United States of America. Subjects – Three commercial WSD services: Primo, Summon, and EBSCO Discovery Service (EDS. Methods – The authors collected data at six universities, including their own. They tested each of the three WSDs at two data collection sites. However, since one of the sites was using a legacy version of Summon that was due to be upgraded, data collected for Summon at this site were considered obsolete and excluded from the analysis. The authors generated three questions for each of six major health disciplines, then designed simple keyword searches to mimic typical student search behaviours. They captured the first 20 results from each query run at each test site, to represent the first “page” of results, giving a total of 2,086 total search results. These were independently assessed for relevance to the topic. Authors resolved disagreements by discussion, and calculated a kappa inter-observer score. They retained duplicate records within the results so that the duplicate detection by the WSDs could be compared. They assessed MEDLINE coverage by the WSDs in several ways. Using precise strategies to generate a relevant set of articles, they conducted one search from each of the six disciplines in PubMed so that they could compare retrieval of MEDLINE content. These results were cross-checked against the first 20 results from the corresponding query in the WSDs. To aid investigation of overall

Natural brain-information interfaces: Recommending information by relevance inferred from human brain signals

Science.gov (United States)

Eugster, Manuel J. A.; Ruotsalo, Tuukka; Spapé, Michiel M.; Barral, Oswald; Ravaja, Niklas; Jacucci, Giulio; Kaski, Samuel

2016-01-01

Finding relevant information from large document collections such as the World Wide Web is a common task in our daily lives. Estimation of a user’s interest or search intention is necessary to recommend and retrieve relevant information from these collections. We introduce a brain-information interface used for recommending information by relevance inferred directly from brain signals. In experiments, participants were asked to read Wikipedia documents about a selection of topics while their EEG was recorded. Based on the prediction of word relevance, the individual’s search intent was modeled and successfully used for retrieving new relevant documents from the whole English Wikipedia corpus. The results show that the users’ interests toward digital content can be modeled from the brain signals evoked by reading. The introduced brain-relevance paradigm enables the recommendation of information without any explicit user interaction and may be applied across diverse information-intensive applications. PMID:27929077

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.

Valerian: No Evidence for Clinically Relevant Interactions

Directory of Open Access Journals (Sweden)

Olaf Kelber

2014-01-01

Full Text Available In recent popular publications as well as in widely used information websites directed to cancer patients, valerian is claimed to have a potential of adverse interactions with anticancer drugs. This questions its use as a safe replacement for, for example, benzodiazepines. A review on the interaction potential of preparations from valerian root (Valeriana officinalis L. root was therefore conducted. A data base search and search in a clinical drug interaction data base were conducted. Thereafter, a systematic assessment of publications was performed. Seven in vitro studies on six CYP 450 isoenzymes, on p-glycoprotein, and on two UGT isoenzymes were identified. However, the methodological assessment of these studies did not support their suitability for the prediction of clinically relevant interactions. In addition, clinical studies on various valerian preparations did not reveal any relevant interaction potential concerning CYP 1A2, 2D6, 2E1, and 3A4. Available animal and human pharmacodynamic studies did not verify any interaction potential. The interaction potential of valerian preparations therefore seems to be low and thereby without clinical relevance. We conclude that there is no specific evidence questioning their safety, also in cancer patients.

LHCb Exotica and Higgs searches

CERN Multimedia

Lucchesi, Donatella

2016-01-01

The unique phase space coverage and features of the LHCb detector at the LHC makes it an ideal environment to probe complementary New Physics parameter regions. In particular, recently developed jet tagging algorithms are ideal for searches involving $b$ and $c$ jets. This poster will review different jet-related exotica searches together with the efforts in the search for a Higgs boson decaying to a pair of heavy quarks.

When Searching Hurts : The Role of Information Search in Reactions to Gender Discrimination

NARCIS (Netherlands)

Stroebe, Katherine; Barreto, Manuela; Ellemers, Naomi

Two laboratory studies conducted with Dutch students explored women's motivation to search for evidence of gender discrimination and its effects on psychological well-being. Study 1 (N = 161) considered situational self-relevance of one's personal outcomes (personal failure or success) on women's

A powerful search for EDMS 6

CERN Multimedia

2015-01-01

Since the end of May, EDMS 6 has featured a brand new search solution. You might have already noticed the changes if you have run the search recently. We have integrated EDMS with the central CERN Search service, allowing EDMS to benefit from the central engine for queries and CERN search from EDMS public data, which can now be found directly via the CERN Search portal. The integration is a result of a very successful collaboration between the EDMS and the CERN Search teams.   What’s new in EDMS search The most important advantage of the new search is enabling searches in the files. While in the old search you could query only the document metadata, now the search also scans the content of the files attached to the documents. This allows for more relevant results, as the hit may be found both in the metadata or in the file. The result is displayed in the Documents & Files tab and the small icon indicates whether the object in which the queried terms were found is a file or a docume...

World Wide Web-based system for the calculation of substituent parameters and substituent similarity searches.

Science.gov (United States)

Ertl, P

1998-02-01

Easy to use, interactive, and platform-independent WWW-based tools are ideal for development of chemical applications. By using the newly emerging Web technologies such as Java applets and sophisticated scripting, it is possible to deliver powerful molecular processing capabilities directly to the desk of synthetic organic chemists. In Novartis Crop Protection in Basel, a Web-based molecular modelling system has been in use since 1995. In this article two new modules of this system are presented: a program for interactive calculation of important hydrophobic, electronic, and steric properties of organic substituents, and a module for substituent similarity searches enabling the identification of bioisosteric functional groups. Various possible applications of calculated substituent parameters are also discussed, including automatic design of molecules with the desired properties and creation of targeted virtual combinatorial libraries.

Correlation between mass transfer coefficient kLa and relevant operating parameters in cylindrical disposable shaken bioreactors on a bench-to-pilot scale.

Science.gov (United States)

Klöckner, Wolf; Gacem, Riad; Anderlei, Tibor; Raven, Nicole; Schillberg, Stefan; Lattermann, Clemens; Büchs, Jochen

2013-12-02

Among disposable bioreactor systems, cylindrical orbitally shaken bioreactors show important advantages. They provide a well-defined hydrodynamic flow combined with excellent mixing and oxygen transfer for mammalian and plant cell cultivations. Since there is no known universal correlation between the volumetric mass transfer coefficient for oxygen kLa and relevant operating parameters in such bioreactor systems, the aim of this current study is to experimentally determine a universal kLa correlation. A Respiration Activity Monitoring System (RAMOS) was used to measure kLa values in cylindrical disposable shaken bioreactors and Buckingham's π-Theorem was applied to define a dimensionless equation for kLa. In this way, a scale- and volume-independent kLa correlation was developed and validated in bioreactors with volumes from 2 L to 200 L. The final correlation was used to calculate cultivation parameters at different scales to allow a sufficient oxygen supply of tobacco BY-2 cell suspension cultures. The resulting equation can be universally applied to calculate the mass transfer coefficient for any of seven relevant cultivation parameters such as the reactor diameter, the shaking frequency, the filling volume, the viscosity, the oxygen diffusion coefficient, the gravitational acceleration or the shaking diameter within an accuracy range of +/- 30%. To our knowledge, this is the first kLa correlation that has been defined and validated for the cited bioreactor system on a bench-to-pilot scale.

Electroconvulsive Therapy In Neuropsychiatry : Relevance Of Seizure Parameters

Directory of Open Access Journals (Sweden)

Gangadhar BN

2000-01-01

Full Text Available Electroconvulsive therapy (ECT is used to induce therapeutic seizures in various clinical conditions. It is specifically useful in depression, catatonia, patients with high suicidal risk, and those intolerant to drugs. Its beneficial effects surpass its side effects. Memory impairment is benign and transient. Its mechanism of action is unknown, though numerous neurotransmitters and neuroreceptors have been implicated. The standards of ECT practice are well established but still evolving in some particularly in unilateral ECT. Assessment of threshold by formula method may deliver higher stimulus dose compared with titration method. Cerebral seizure during ECT procedure is necessary. Motor (cuff method and EEG seizure monitoring are mandatory. Recent studies have shown some EEG parameters (amplitude, fractal dimension, symmetry, and post ictal suppression to be associated with therapeutic outcome. Besides seizure monitoring, measuring other physiological parameters such as heart rate (HR and blood pressure (BP may be useful indicators of therapeutic response. Use of ECT in neurological conditions as well as its application in psychiatric illnesses associated with neurological disorders has also been reviewed briefly.

Guidance of visual search by memory and knowledge.

Science.gov (United States)

Hollingworth, Andrew

2012-01-01

To behave intelligently in the world, humans must be able to find objects efficiently within the complex environments they inhabit. A growing proportion of the literature on visual search is devoted to understanding this type of natural search. In the present chapter, I review the literature on visual search through natural scenes, focusing on the role of memory and knowledge in guiding attention to task-relevant objects.

The topography of the environment alters the optimal search strategy for active particles

Science.gov (United States)

Volpe, Giorgio; Volpe, Giovanni

2017-10-01

In environments with scarce resources, adopting the right search strategy can make the difference between succeeding and failing, even between life and death. At different scales, this applies to molecular encounters in the cell cytoplasm, to animals looking for food or mates in natural landscapes, to rescuers during search and rescue operations in disaster zones, and to genetic computer algorithms exploring parameter spaces. When looking for sparse targets in a homogeneous environment, a combination of ballistic and diffusive steps is considered optimal; in particular, more ballistic Lévy flights with exponent α≤1 are generally believed to optimize the search process. However, most search spaces present complex topographies. What is the best search strategy in these more realistic scenarios? Here, we show that the topography of the environment significantly alters the optimal search strategy toward less ballistic and more Brownian strategies. We consider an active particle performing a blind cruise search for nonregenerating sparse targets in a 2D space with steps drawn from a Lévy distribution with the exponent varying from α=1 to α=2 (Brownian). We show that, when boundaries, barriers, and obstacles are present, the optimal search strategy depends on the topography of the environment, with α assuming intermediate values in the whole range under consideration. We interpret these findings using simple scaling arguments and discuss their robustness to varying searcher's size. Our results are relevant for search problems at different length scales from animal and human foraging to microswimmers' taxis to biochemical rates of reaction.

Optimizing literature search in systematic reviews

DEFF Research Database (Denmark)

Aagaard, Thomas; Lund, Hans; Juhl, Carsten Bogh

2016-01-01

BACKGROUND: When conducting systematic reviews, it is essential to perform a comprehensive literature search to identify all published studies relevant to the specific research question. The Cochrane Collaborations Methodological Expectations of Cochrane Intervention Reviews (MECIR) guidelines...... of musculoskeletal disorders. METHODS: Data sources were systematic reviews published by the Cochrane Musculoskeletal Review Group, including at least five RCTs, reporting a search history, searching MEDLINE, EMBASE, CENTRAL, and adding reference- and hand-searching. Additional databases were deemed eligible...... if they indexed RCTs, were in English and used in more than three of the systematic reviews. Relative recall was calculated as the number of studies identified by the literature search divided by the number of eligible studies i.e. included studies in the individual systematic reviews. Finally, cumulative median...

Literature searches on Ayurveda: An update.

Science.gov (United States)

Aggithaya, Madhur G; Narahari, Saravu R

2015-01-01

The journals that publish on Ayurveda are increasingly indexed by popular medical databases in recent years. However, many Eastern journals are not indexed biomedical journal databases such as PubMed. Literature searches for Ayurveda continue to be challenging due to the nonavailability of active, unbiased dedicated databases for Ayurvedic literature. In 2010, authors identified 46 databases that can be used for systematic search of Ayurvedic papers and theses. This update reviewed our previous recommendation and identified current and relevant databases. To update on Ayurveda literature search and strategy to retrieve maximum publications. Author used psoriasis as an example to search previously listed databases and identify new. The population, intervention, control, and outcome table included keywords related to psoriasis and Ayurvedic terminologies for skin diseases. Current citation update status, search results, and search options of previous databases were assessed. Eight search strategies were developed. Hundred and five journals, both biomedical and Ayurveda, which publish on Ayurveda, were identified. Variability in databases was explored to identify bias in journal citation. Five among 46 databases are now relevant - AYUSH research portal, Annotated Bibliography of Indian Medicine, Digital Helpline for Ayurveda Research Articles (DHARA), PubMed, and Directory of Open Access Journals. Search options in these databases are not uniform, and only PubMed allows complex search strategy. "The Researches in Ayurveda" and "Ayurvedic Research Database" (ARD) are important grey resources for hand searching. About 44/105 (41.5%) journals publishing Ayurvedic studies are not indexed in any database. Only 11/105 (10.4%) exclusive Ayurveda journals are indexed in PubMed. AYUSH research portal and DHARA are two major portals after 2010. It is mandatory to search PubMed and four other databases because all five carry citations from different groups of journals. The hand

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Directory of Open Access Journals (Sweden)

Mikhail Strizhov

2016-07-01

Full Text Available Existing Searchable Encryption (SE solutions are able to handle simple Boolean search queries, such as single or multi-keyword queries, but cannot handle substring search queries over encrypted data that also involve identifying the position of the substring within the document. These types of queries are relevant in areas such as searching DNA data. In this paper, we propose a tree-based Substring Position Searchable Symmetric Encryption (SSP-SSE to overcome the existing gap. Our solution efficiently finds occurrences of a given substring over encrypted cloud data. Specifically, our construction uses the position heap tree data structure and achieves asymptotic efficiency comparable to that of an unencrypted position heap tree. Our encryption takes O ( k n time, and the resulting ciphertext is of size O ( k n , where k is a security parameter and n is the size of stored data. The search takes O ( m 2 + o c c time and three rounds of communication, where m is the length of the queried substring and o c c is the number of occurrences of the substring in the document collection. We prove that the proposed scheme is secure against chosen-query attacks that involve an adaptive adversary. Finally, we extend SSP-SSE to the multi-user setting where an arbitrary group of cloud users can submit substring queries to search the encrypted data.

Searching for Sterile Neutrinos with MINOS

Energy Technology Data Exchange (ETDEWEB)

Timmons, Ashley [Manchester U.

2016-01-01

This document presents the latest results for a 3+1 sterile neutrino search using the $10.56 \\times 10^{20}$ protons-on-target data set taken from 2005 - 2012. By searching for oscillations driven by a large mass splitting, MINOS is sensitive to the existence of sterile neutrinos through any energy dependent deviations using a charged current sample, as well as looking at any relative deficit between neutral current events between the far and near detectors. This document will discuss the novel analysis that enabled a search for sterile neutrinos setting a limit in the previously unexplored regions in the parameter space $\\{\\Delta m^{2}_{41}, \\sin^2\\theta_{24}\\}$. The results presented can be compared to the parameter space suggested by LSND and MiniBooNE and complements other previous experimental searches for sterile neutrinos in the electron neutrino appearance channel.

Low-mass dark matter search with CDMSlite

Energy Technology Data Exchange (ETDEWEB)

Agnese, R.; Anderson, A. J.; Aralis, T.; Aramaki, T.; Arnquist, I. J.; Baker, W.; Balakishiyeva, D.; Barker, D.; Basu Thakur, R.; Bauer, D. A.; Binder, T.; Bowles, M. A.; Brink, P. L.; Bunker, R.; Cabrera, B.; Caldwell, D. O.; Calkins, R.; Cartaro, C.; Cerdeño, D. G.; Chang, Y.; Chagani, H.; Chen, Y.; Cooley, J.; Cornell, B.; Cushman, P.; Daal, M.; Di Stefano, P. C. F.; Doughty, T.; Esteban, L.; Fascione, E.; Figueroa-Feliciano, E.; Fritts, M.; Gerbier, G.; Ghaith, M.; Godfrey, G. L.; Golwala, S. R.; Hall, J.; Harris, H. R.; Hong, Z.; Hoppe, E. W.; Hsu, L.; Huber, M. E.; Iyer, V.; Jardin, D.; Jastram, A.; Jena, C.; Kelsey, M. H.; Kennedy, A.; Kubik, A.; Kurinsky, N. A.; Leder, A.; Loer, B.; Lopez Asamar, E.; Lukens, P.; MacDonell, D.; Mahapatra, R.; Mandic, V.; Mast, N.; Miller, E. H.; Mirabolfathi, N.; Moffatt, R. A.; Mohanty, B.; Morales Mendoza, J. D.; Nelson, J.; Orrell, J. L.; Oser, S. M.; Page, K.; Page, W. A.; Partridge, R.; Pepin, M.; Peñalver Martinez, M.; Phipps, A.; Poudel, S.; Pyle, M.; Qiu, H.; Rau, W.; Redl, P.; Reisetter, A.; Reynolds, T.; Roberts, A.; Robinson, A. E.; Rogers, H. E.; Saab, T.; Sadoulet, B.; Sander, J.; Schneck, K.; Schnee, R. W.; Scorza, S.; Senapati, K.; Serfass, B.; Speller, D.; Stein, M.; Street, J.; Tanaka, H. A.; Toback, D.; Underwood, R.; Villano, A. N.; von Krosigk, B.; Welliver, B.; Wilson, J. S.; Wilson, M. J.; Wright, D. H.; Yellin, S.; Yen, J. J.; Young, B. A.; Zhang, X.; Zhao, X.

2018-01-01

The SuperCDMS experiment is designed to directly detect WIMPs (Weakly Interacting Massive Particles) that may constitute the dark matter in our galaxy. During its operation at the Soudan Underground Laboratory, germanium detectors were run in the CDMSlite (Cryogenic Dark Matter Search low ionization threshold experiment) mode to gather data sets with sensitivity specifically for WIMPs with masses ${<}10$ GeV/$c^2$. In this mode, a large detector-bias voltage is applied to amplify the phonon signals produced by drifting charges. This paper presents studies of the experimental noise and its effect on the achievable energy threshold, which is demonstrated to be as low as 56 eV$_{\\text{ee}}$ (electron equivalent energy). The detector biasing configuration is described in detail, with analysis corrections for voltage variations to the level of a few percent. Detailed studies of the electric-field geometry, and the resulting successful development of a fiducial parameter, eliminate poorly measured events, yielding an energy resolution ranging from ${\\sim}$9 eV$_{\\text{ee}}$ at 0 keV to 101 eV$_{\\text{ee}}$ at ${\\sim}$10 keV$_{\\text{ee}}$. New results are derived for astrophysical uncertainties relevant to the WIMP-search limits, specifically examining how they are affected by variations in the most probable WIMP velocity and the galactic escape velocity. These variations become more important for WIMP masses below 10 GeV/$c^2$. Finally, new limits on spin-dependent low-mass WIMP-nucleon interactions are derived, with new parameter space excluded for WIMP masses ${\\lesssim}$3 GeV/$c^2$.

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

Science.gov (United States)

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

2015-04-01

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

Identifying nurse staffing research in Medline: development and testing of empirically derived search strategies with the PubMed interface.

Science.gov (United States)

Simon, Michael; Hausner, Elke; Klaus, Susan F; Dunton, Nancy E

2010-08-23

The identification of health services research in databases such as PubMed/Medline is a cumbersome task. This task becomes even more difficult if the field of interest involves the use of diverse methods and data sources, as is the case with nurse staffing research. This type of research investigates the association between nurse staffing parameters and nursing and patient outcomes. A comprehensively developed search strategy may help identify nurse staffing research in PubMed/Medline. A set of relevant references in PubMed/Medline was identified by means of three systematic reviews. This development set was used to detect candidate free-text and MeSH terms. The frequency of these terms was compared to a random sample from PubMed/Medline in order to identify terms specific to nurse staffing research, which were then used to develop a sensitive, precise and balanced search strategy. To determine their precision, the newly developed search strategies were tested against a) the pool of relevant references extracted from the systematic reviews, b) a reference set identified from an electronic journal screening, and c) a sample from PubMed/Medline. Finally, all newly developed strategies were compared to PubMed's Health Services Research Queries (PubMed's HSR Queries). The sensitivities of the newly developed search strategies were almost 100% in all of the three test sets applied; precision ranged from 6.1% to 32.0%. PubMed's HSR queries were less sensitive (83.3% to 88.2%) than the new search strategies. Only minor differences in precision were found (5.0% to 32.0%). As with other literature on health services research, nurse staffing studies are difficult to identify in PubMed/Medline. Depending on the purpose of the search, researchers can choose between high sensitivity and retrieval of a large number of references or high precision, i.e. and an increased risk of missing relevant references, respectively. More standardized terminology (e.g. by consistent use of the

Measurement of the $\\beta$-asymmetry parameter of $^{67}$Cu in search for tensor type currents in the weak interaction

CERN Document Server

Soti, G.; Breitenfeldt, M.; Finlay, P.; Herzog, P.; Knecht, A.; Köster, U.; Kraev, I.S.; Porobic, T.; Prashanth, P.N.; Towner, I.S.; Tramm, C.; Zákoucký, D.; Severijns, N.

2014-01-01

Precision measurements at low energy search for physics beyond the Standard Model in a way complementary to searches for new particles at colliders. In the weak sector the most general $\\beta$ decay Hamiltonian contains, besides vector and axial-vector terms, also scalar, tensor and pseudoscalar terms. Current limits on the scalar and tensor coupling constants from neutron and nuclear $\\beta$ decay are on the level of several percent. The goal of this paper is extracting new information on tensor coupling constants by measuring the $\\beta$-asymmetry parameter in the pure Gamow-Teller decay of $^{67}$Cu, thereby testing the V-A structure of the weak interaction. An iron sample foil into which the radioactive nuclei were implanted was cooled down to milliKelvin temperatures in a $^3$He-$^4$He dilution refrigerator. An external magnetic field of 0.1 T, in combination with the internal hyperfine magnetic field, oriented the nuclei. The anisotropic $\\beta$ radiation was observed with planar high purity germanium d...

Higgs and SUSY searches at future colliders

Indian Academy of Sciences (India)

... searches at future colliders, particularly comparing and contrasting the capabilities of LHC and next linear collider (NLC), including the aspects of Higgs searches in supersymmetric theories. I will also discuss how the search and study of sparticles other than the Higgs can be used to give information about the parameters ...

Missing Links in Middle School: Developing Use of Disciplinary Relatedness in Evaluating Internet Search Results.

Directory of Open Access Journals (Sweden)

Frank C Keil

Full Text Available In the "digital native" generation, internet search engines are a commonly used source of information. However, adolescents may fail to recognize relevant search results when they are related in discipline to the search topic but lack other cues. Middle school students, high school students, and adults rated simulated search results for relevance to the search topic. The search results were designed to contrast deep discipline-based relationships with lexical similarity to the search topic. Results suggest that the ability to recognize disciplinary relatedness without supporting cues may continue to develop into high school. Despite frequent search engine usage, younger adolescents may require additional support to make the most of the information available to them.

Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search

Directory of Open Access Journals (Sweden)

Jaco Fourie

2013-01-01

Full Text Available Harmony search (HS was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.

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.

A DYNAMIC FEATURE SELECTION METHOD FOR DOCUMENT RANKING WITH RELEVANCE FEEDBACK APPROACH

Directory of Open Access Journals (Sweden)

K. Latha

2010-07-01

Full Text Available Ranking search results is essential for information retrieval and Web search. Search engines need to not only return highly relevant results, but also be fast to satisfy users. As a result, not all available features can be used for ranking, and in fact only a small percentage of these features can be used. Thus, it is crucial to have a feature selection mechanism that can find a subset of features that both meets latency requirements and achieves high relevance. In this paper we describe a 0/1 knapsack procedure for automatically selecting features to use within Generalization model for Document Ranking. We propose an approach for Relevance Feedback using Expectation Maximization method and evaluate the algorithm on the TREC Collection for describing classes of feedback textual information retrieval features. Experimental results, evaluated on standard TREC-9 part of the OHSUMED collections, show that our feature selection algorithm produces models that are either significantly more effective than, or equally effective as, models such as Markov Random Field model, Correlation Co-efficient and Count Difference method

Combined search for the quarks of a sequential fourth generation

CERN Document Server

Chatrchyan, Serguei; Sirunyan, Albert M; Tumasyan, Armen; Adam, Wolfgang; Aguilo, Ernest; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Fabjan, Christian; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hammer, Josef; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Pernicka, Manfred; Rahbaran, Babak; Rohringer, Christine; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Taurok, Anton; Waltenberger, Wolfgang; Walzel, Gerhard; Widl, Edmund; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Bansal, Monika; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Luyckx, Sten; Mucibello, Luca; Ochesanu, Silvia; Roland, Benoit; Rougny, Romain; Selvaggi, Michele; Staykova, Zlatka; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Gonzalez Suarez, Rebeca; Kalogeropoulos, Alexis; Maes, Michael; Olbrechts, Annik; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Clerbaux, Barbara; De Lentdecker, Gilles; Dero, Vincent; Gay, Arnaud; Hreus, Tomas; Léonard, Alexandre; Marage, Pierre Edouard; Mohammadi, Abdollah; Reis, Thomas; Thomas, Laurent; Vander Marcken, Gil; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Adler, Volker; Beernaert, Kelly; Cimmino, Anna; Costantini, Silvia; Garcia, Guillaume; Grunewald, Martin; Klein, Benjamin; Lellouch, Jérémie; Marinov, Andrey; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Verwilligen, Piet; Walsh, Sinead; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Bruno, Giacomo; Castello, Roberto; Ceard, Ludivine; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Lemaitre, Vincent; Liao, Junhui; Militaru, Otilia; Nuttens, Claude; Pagano, Davide; Pin, Arnaud; Piotrzkowski, Krzysztof; Schul, Nicolas; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Alves, Gilvan; Correa Martins Junior, Marcos; De Jesus Damiao, Dilson; Martins, Thiago; Pol, Maria Elena; Henrique Gomes E Souza, Moacyr; Aldá Júnior, Walter Luiz; Carvalho, Wagner; Custódio, Analu; Melo Da Costa, Eliza; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Oguri, Vitor; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Soares Jorge, Luana; Sznajder, Andre; Souza Dos Anjos, Tiago; Bernardes, Cesar Augusto; De Almeida Dias, Flavia; Tomei, Thiago; De Moraes Gregores, Eduardo; Lagana, Caio; Da Cunha Marinho, Franciole; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Genchev, Vladimir; Iaydjiev, Plamen; Piperov, Stefan; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Tcholakov, Vanio; Trayanov, Rumen; Vutova, Mariana; Dimitrov, Anton; Hadjiiska, Roumyana; Kozhuharov, Venelin; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Jiang, Chun-Hua; Liang, Dong; Liang, Song; Meng, Xiangwei; Tao, Junquan; Wang, Jian; Wang, Xianyou; Wang, Zheng; Xiao, Hong; Xu, Ming; Zang, Jingjing; Zhang, Zhen; Asawatangtrakuldee, Chayanit; Ban, Yong; Guo, Shuang; Guo, Yifei; Li, Wenbo; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Teng, Haiyun; Wang, Dayong; Zhang, Linlin; Zhu, Bo; Zou, Wei; Avila, Carlos; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Osorio Oliveros, Andres Felipe; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Plestina, Roko; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Duric, Senka; Kadija, Kreso; Luetic, Jelena; Morovic, Srecko; Attikis, Alexandros; Galanti, Mario; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Elgammal, Sherif; Ellithi Kamel, Ali; Khalil, Shaaban; Mahmoud, Mohammed; Radi, Amr; Kadastik, Mario; Müntel, Mait; Raidal, Martti; Rebane, Liis; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Heikkinen, Mika Aatos; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Ungaro, Donatella; Wendland, Lauri; Banzuzi, Kukka; Karjalainen, Ahti; Korpela, Arja; Tuuva, Tuure; Besancon, Marc; Choudhury, Somnath; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Ferri, Federico; Ganjour, Serguei; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Locci, Elizabeth; Malcles, Julie; Millischer, Laurent; Nayak, Aruna; Rander, John; Rosowsky, André; Shreyber, Irina; Titov, Maksym; Baffioni, Stephanie; Beaudette, Florian; Benhabib, Lamia; Bianchini, Lorenzo; Bluj, Michal; Broutin, Clementine; Busson, Philippe; Charlot, Claude; Daci, Nadir; Dahms, Torsten; Dobrzynski, Ludwik; Granier de Cassagnac, Raphael; Haguenauer, Maurice; Miné, Philippe; Mironov, Camelia; Naranjo, Ivo Nicolas; Nguyen, Matthew; Ochando, Christophe; Paganini, Pascal; Sabes, David; Salerno, Roberto; Sirois, Yves; Veelken, Christian; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Bloch, Daniel; Bodin, David; Brom, Jean-Marie; Cardaci, Marco; Chabert, Eric Christian; Collard, Caroline; Conte, Eric; Drouhin, Frédéric; Ferro, Cristina; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Juillot, Pierre; Le Bihan, Anne-Catherine; Van Hove, Pierre; Fassi, Farida; Mercier, Damien; Beauceron, Stephanie; Beaupere, Nicolas; Bondu, Olivier; Boudoul, Gaelle; Chasserat, Julien; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Ille, Bernard; Kurca, Tibor; Lethuillier, Morgan; Mirabito, Laurent; Perries, Stephane; Sordini, Viola; Tschudi, Yohann; Verdier, Patrice; Viret, Sébastien; Tsamalaidze, Zviad; Anagnostou, Georgios; Beranek, Sarah; Edelhoff, Matthias; Feld, Lutz; Heracleous, Natalie; Hindrichs, Otto; Jussen, Ruediger; Klein, Katja; Merz, Jennifer; Ostapchuk, Andrey; Perieanu, Adrian; Raupach, Frank; Sammet, Jan; Schael, Stefan; Sprenger, Daniel; Weber, Hendrik; Wittmer, Bruno; Zhukov, Valery; Ata, Metin; Caudron, Julien; Dietz-Laursonn, Erik; Duchardt, Deborah; Erdmann, Martin; Fischer, Robert; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Klingebiel, Dennis; Kreuzer, Peter; Magass, Carsten; Merschmeyer, Markus; Meyer, Arnd; Olschewski, Mark; Papacz, Paul; Pieta, Holger; Reithler, Hans; Schmitz, Stefan Antonius; Sonnenschein, Lars; Steggemann, Jan; Teyssier, Daniel; Weber, Martin; Bontenackels, Michael; Cherepanov, Vladimir; Erdogan, Yusuf; Flügge, Günter; Geenen, Heiko; Geisler, Matthias; Haj Ahmad, Wael; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Kuessel, Yvonne; Nowack, Andreas; Perchalla, Lars; Pooth, Oliver; Sauerland, Philip; Stahl, Achim; Aldaya Martin, Maria; Behr, Joerg; Behrenhoff, Wolf; Behrens, Ulf; Bergholz, Matthias; Bethani, Agni; Borras, Kerstin; Burgmeier, Armin; Cakir, Altan; Calligaris, Luigi; Campbell, Alan; Castro, Elena; Costanza, Francesco; Dammann, Dirk; Diez Pardos, Carmen; Eckerlin, Guenter; Eckstein, Doris; Flucke, Gero; Geiser, Achim; Glushkov, Ivan; Gunnellini, Paolo; Habib, Shiraz; Hauk, Johannes; Hellwig, Gregor; Jung, Hannes; Kasemann, Matthias; Katsas, Panagiotis; Kleinwort, Claus; Kluge, Hannelies; Knutsson, Albert; Krämer, Mira; Krücker, Dirk; Kuznetsova, Ekaterina; Lange, Wolfgang; Lohmann, Wolfgang; Lutz, Benjamin; Mankel, Rainer; Marfin, Ihar; Marienfeld, Markus; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mnich, Joachim; Mussgiller, Andreas; Naumann-Emme, Sebastian; Olzem, Jan; Perrey, Hanno; Petrukhin, Alexey; Pitzl, Daniel; Raspereza, Alexei; Ribeiro Cipriano, Pedro M; Riedl, Caroline; Ron, Elias; Rosin, Michele; Salfeld-Nebgen, Jakob; Schmidt, Ringo; Schoerner-Sadenius, Thomas; Sen, Niladri; Spiridonov, Alexander; Stein, Matthias; Walsh, Roberval; Wissing, Christoph; Autermann, Christian; Blobel, Volker; Draeger, Jula; Enderle, Holger; Erfle, Joachim; Gebbert, Ulla; Görner, Martin; Hermanns, Thomas; Höing, Rebekka Sophie; Kaschube, Kolja; Kaussen, Gordon; Kirschenmann, Henning; Klanner, Robert; Lange, Jörn; Mura, Benedikt; Nowak, Friederike; Peiffer, Thomas; Pietsch, Niklas; Rathjens, Denis; Sander, Christian; Schettler, Hannes; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Schröder, Matthias; Schum, Torben; Seidel, Markus; Sola, Valentina; Stadie, Hartmut; Steinbrück, Georg; Thomsen, Jan; Vanelderen, Lukas; Barth, Christian; Berger, Joram; Böser, Christian; Chwalek, Thorsten; De Boer, Wim; Descroix, Alexis; Dierlamm, Alexander; Feindt, Michael; Guthoff, Moritz; Hackstein, Christoph; Hartmann, Frank; Hauth, Thomas; Heinrich, Michael; Held, Hauke; Hoffmann, Karl-Heinz; Honc, Simon; Katkov, Igor; Komaragiri, Jyothsna Rani; Lobelle Pardo, Patricia; Martschei, Daniel; Mueller, Steffen; Müller, Thomas; Niegel, Martin; Nürnberg, Andreas; Oberst, Oliver; Oehler, Andreas; Ott, Jochen; Quast, Gunter; Rabbertz, Klaus; Ratnikov, Fedor; Ratnikova, Natalia; Röcker, Steffen; Scheurer, Armin; Schilling, Frank-Peter; Schott, Gregory; Simonis, Hans-Jürgen; Stober, Fred-Markus Helmut; Troendle, Daniel; Ulrich, Ralf; Wagner-Kuhr, Jeannine; Wayand, Stefan; Weiler, Thomas; Zeise, Manuel; Daskalakis, Georgios; Geralis, Theodoros; Kesisoglou, Stilianos; Kyriakis, Aristotelis; Loukas, Demetrios; Manolakos, Ioannis; Markou, Athanasios; Markou, Christos; Mavrommatis, Charalampos; Ntomari, Eleni; Gouskos, Loukas; Mertzimekis, Theodoros; Panagiotou, Apostolos; Saoulidou, Niki; Evangelou, Ioannis; Foudas, Costas; Kokkas, Panagiotis; Manthos, Nikolaos; Papadopoulos, Ioannis; Patras, Vaios; Bencze, Gyorgy; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Beni, Noemi; Czellar, Sandor; Molnar, Jozsef; Palinkas, Jozsef; Szillasi, Zoltan; Karancsi, János; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Beri, Suman Bala; Bhatnagar, Vipin; Dhingra, Nitish; Gupta, Ruchi; Kaur, Manjit; Mehta, Manuk Zubin; Nishu, Nishu; Saini, Lovedeep Kaur; Sharma, Archana; Singh, Jasbir; Kumar, Ashok; Kumar, Arun; Ahuja, Sudha; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Varun; Shivpuri, Ram Krishen; Banerjee, Sunanda; Bhattacharya, Satyaki; Dutta, Suchandra; Gomber, Bhawna; Jain, Sandhya; Jain, Shilpi; Khurana, Raman; Sarkar, Subir; Sharan, Manoj; Abdulsalam, Abdulla; Choudhury, Rajani Kant; Dutta, Dipanwita; Kailas, Swaminathan; Kumar, Vineet; Mehta, Pourus; Mohanty, Ajit Kumar; Pant, Lalit Mohan; Shukla, Prashant; Aziz, Tariq; Ganguly, Sanmay; Guchait, Monoranjan; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Mohanty, Gagan Bihari; Parida, Bibhuti; Sudhakar, Katta; Wickramage, Nadeesha; Banerjee, Sudeshna; Dugad, Shashikant; Arfaei, Hessamaddin; Bakhshiansohi, Hamed; Etesami, Seyed Mohsen; Fahim, Ali; Hashemi, Majid; Hesari, Hoda; Jafari, Abideh; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Paktinat Mehdiabadi, Saeid; Safarzadeh, Batool; Zeinali, Maryam; Abbrescia, Marcello; Barbone, Lucia; Calabria, Cesare; Chhibra, Simranjit Singh; Colaleo, Anna; Creanza, Donato; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Lusito, Letizia; Maggi, Giorgio; Maggi, Marcello; Marangelli, Bartolomeo; My, Salvatore; Nuzzo, Salvatore; Pacifico, Nicola; Pompili, Alexis; Pugliese, Gabriella; Selvaggi, Giovanna; Silvestris, Lucia; Singh, Gurpreet; Venditti, Rosamaria; Zito, Giuseppe; Abbiendi, Giovanni; Benvenuti, Alberto; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Meneghelli, Marco; Montanari, Alessandro; Navarria, Francesco; Odorici, Fabrizio; Perrotta, Andrea; Primavera, Federica; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Travaglini, Riccardo; Albergo, Sebastiano; Cappello, Gigi; Chiorboli, Massimiliano; Costa, Salvatore; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Frosali, Simone; Gallo, Elisabetta; Gonzi, Sandro; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Tropiano, Antonio; Benussi, Luigi; Bianco, Stefano; Colafranceschi, Stefano; Fabbri, Franco; Piccolo, Davide; Fabbricatore, Pasquale; Musenich, Riccardo; Tosi, Silvano; Benaglia, Andrea; De Guio, Federico; Di Matteo, Leonardo; Fiorendi, Sara; Gennai, Simone; Ghezzi, Alessio; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Martelli, Arabella; Massironi, Andrea; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Ragazzi, Stefano; Redaelli, Nicola; Sala, Silvano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Carrillo Montoya, Camilo Andres; Cavallo, Nicola; De Cosa, Annapaola; Dogangun, Oktay; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lista, Luca; Meola, Sabino; Merola, Mario; Paolucci, Pierluigi; Azzi, Patrizia; Bacchetta, Nicola; Bisello, Dario; Branca, Antonio; Carlin, Roberto; Checchia, Paolo; Dorigo, Tommaso; Dosselli, Umberto; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Kanishchev, Konstantin; Lacaprara, Stefano; Lazzizzera, Ignazio; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Vanini, Sara; Zotto, Pierluigi; Zumerle, Gianni; Gabusi, Michele; Ratti, Sergio P; Riccardi, Cristina; Torre, Paola; Vitulo, Paolo; Biasini, Maurizio; Bilei, Gian Mario; Fanò, Livio; Lariccia, Paolo; Lucaroni, Andrea; Mantovani, Giancarlo; Menichelli, Mauro; Nappi, Aniello; Romeo, Francesco; Saha, Anirban; Santocchia, Attilio; Spiezia, Aniello; Taroni, Silvia; Azzurri, Paolo; Bagliesi, Giuseppe; Boccali, Tommaso; Broccolo, Giuseppe; Castaldi, Rino; D'Agnolo, Raffaele Tito; Dell'Orso, Roberto; Fiori, Francesco; Foà, Lorenzo; Giassi, Alessandro; Kraan, Aafke; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Palla, Fabrizio; Rizzi, Andrea; Serban, Alin Titus; Spagnolo, Paolo; Squillacioti, Paola; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Barone, Luciano; Cavallari, Francesca; Del Re, Daniele; Diemoz, Marcella; Fanelli, Cristiano; Grassi, Marco; Longo, Egidio; Meridiani, Paolo; Micheli, Francesco; Nourbakhsh, Shervin; Organtini, Giovanni; Paramatti, Riccardo; Rahatlou, Shahram; Sigamani, Michael; Soffi, Livia; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Biino, Cristina; Cartiglia, Nicolo; Costa, Marco; De Remigis, Paolo; Demaria, Natale; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Musich, Marco; Obertino, Maria Margherita; Pastrone, Nadia; Pelliccioni, Mario; Potenza, Alberto; Romero, Alessandra; Sacchi, Roberto; Solano, Ada; Staiano, Amedeo; Vilela Pereira, Antonio; Belforte, Stefano; Candelise, Vieri; Cossutti, Fabio; Della Ricca, Giuseppe; Gobbo, Benigno; Marone, Matteo; Montanino, Damiana; Penzo, Aldo; Schizzi, Andrea; Heo, Seong Gu; Kim, Tae Yeon; Nam, Soon-Kwon; Chang, Sunghyun; Kim, Dong Hee; Kim, Gui Nyun; Kong, Dae Jung; Park, Hyangkyu; Ro, Sang-Ryul; Son, Dong-Chul; Son, Taejin; Kim, Jae Yool; Kim, Zero Jaeho; Song, Sanghyeon; Choi, Suyong; Gyun, Dooyeon; Hong, Byung-Sik; Jo, Mihee; Kim, Hyunchul; Kim, Tae Jeong; Lee, Kyong Sei; Moon, Dong Ho; Park, Sung Keun; Choi, Minkyoo; Kim, Ji Hyun; Park, Chawon; Park, Inkyu; Park, Sangnam; Ryu, Geonmo; Cho, Yongjin; Choi, Young-Il; Choi, Young Kyu; Goh, Junghwan; Kim, Min Suk; Kwon, Eunhyang; Lee, Byounghoon; Lee, Jongseok; Lee, Sungeun; Seo, Hyunkwan; Yu, Intae; Bilinskas, Mykolas Jurgis; Grigelionis, Ignas; Janulis, Mindaugas; Juodagalvis, Andrius; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-de La Cruz, Ivan; Lopez-Fernandez, Ricardo; Magaña Villalba, Ricardo; Martínez-Ortega, Jorge; Sánchez-Hernández, Alberto; Villasenor-Cendejas, Luis Manuel; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Salazar Ibarguen, Humberto Antonio; Casimiro Linares, Edgar; Morelos Pineda, Antonio; Reyes-Santos, Marco A; Krofcheck, David; Bell, Alan James; Butler, Philip H; Doesburg, Robert; Reucroft, Steve; Silverwood, Hamish; Ahmad, Muhammad; Ansari, Muhammad Hamid; Asghar, Muhammad Irfan; Hoorani, Hafeez R; Khalid, Shoaib; Khan, Wajid Ali; Khurshid, Taimoor; Qazi, Shamona; Shah, Mehar Ali; Shoaib, Muhammad; Bialkowska, Helena; Boimska, Bozena; Frueboes, Tomasz; Gokieli, Ryszard; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Wrochna, Grzegorz; Zalewski, Piotr; Brona, Grzegorz; Bunkowski, Karol; Cwiok, Mikolaj; Dominik, Wojciech; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Almeida, Nuno; Bargassa, Pedrame; David Tinoco Mendes, Andre; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Seixas, Joao; Varela, Joao; Vischia, Pietro; Belotelov, Ivan; Bunin, Pavel; Gavrilenko, Mikhail; Golutvin, Igor; Kamenev, Alexey; Karjavin, Vladimir; Kozlov, Guennady; Lanev, Alexander; Malakhov, Alexander; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Savina, Maria; Shmatov, Sergey; Smirnov, Vitaly; Volodko, Anton; Zarubin, Anatoli; Evstyukhin, Sergey; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; Vorobyev, Alexey; Vorobyev, Andrey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Kirsanov, Mikhail; Krasnikov, Nikolai; Matveev, Viktor; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Erofeeva, Maria; Gavrilov, Vladimir; Kossov, Mikhail; Lychkovskaya, Natalia; Popov, Vladimir; Safronov, Grigory; Semenov, Sergey; Stolin, Viatcheslav; Vlasov, Evgueni; Zhokin, Alexander; Belyaev, Andrey; Boos, Edouard; Bunichev, Viacheslav; Dubinin, Mikhail; Dudko, Lev; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Markina, Anastasia; Obraztsov, Stepan; Perfilov, Maxim; Petrushanko, Sergey; Popov, Andrey; Sarycheva, Ludmila; Savrin, Viktor; Snigirev, Alexander; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Mesyats, Gennady; Rusakov, Sergey V; Vinogradov, Alexey; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Grishin, Viatcheslav; Kachanov, Vassili; Konstantinov, Dmitri; Korablev, Andrey; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Tourtchanovitch, Leonid; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Djordjevic, Milos; Ekmedzic, Marko; Krpic, Dragomir; Milosevic, Jovan; Aguilar-Benitez, Manuel; Alcaraz Maestre, Juan; Arce, Pedro; Battilana, Carlo; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Domínguez Vázquez, Daniel; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Ferrando, Antonio; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Merino, Gonzalo; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Santaolalla, Javier; Senghi Soares, Mara; Willmott, Carlos; Albajar, Carmen; Codispoti, Giuseppe; de Trocóniz, Jorge F; Brun, Hugues; Cuevas, Javier; Fernandez Menendez, Javier; Folgueras, Santiago; Gonzalez Caballero, Isidro; Lloret Iglesias, Lara; Piedra Gomez, Jonatan; Brochero Cifuentes, Javier Andres; Cabrillo, Iban Jose; Calderon, Alicia; Chuang, Shan-Huei; Duarte Campderros, Jordi; Felcini, Marta; Fernandez, Marcos; Gomez, Gervasio; Gonzalez Sanchez, Javier; Graziano, Alberto; Jorda, Clara; Lopez Virto, Amparo; Marco, Jesus; Marco, Rafael; Martinez Rivero, Celso; Matorras, Francisco; Munoz Sanchez, Francisca Javiela; Rodrigo, Teresa; Rodríguez-Marrero, Ana Yaiza; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Sobron Sanudo, Mar; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Bachtis, Michail; Baillon, Paul; Ball, Austin; Barney, David; Benitez, Jose F; Bernet, Colin; Bianchi, Giovanni; Bloch, Philippe; Bocci, Andrea; Bonato, Alessio; Botta, Cristina; Breuker, Horst; Camporesi, Tiziano; Cerminara, Gianluca; Christiansen, Tim; Coarasa Perez, Jose Antonio; D'Enterria, David; Dabrowski, Anne; De Roeck, Albert; Di Guida, Salvatore; Dobson, Marc; Dupont-Sagorin, Niels; Elliott-Peisert, Anna; Frisch, Benjamin; Funk, Wolfgang; Georgiou, Georgios; Giffels, Manuel; Gigi, Dominique; Gill, Karl; Giordano, Domenico; Giunta, Marina; Glege, Frank; Gomez-Reino Garrido, Robert; Govoni, Pietro; Gowdy, Stephen; Guida, Roberto; Hansen, Magnus; Harris, Philip; Hartl, Christian; Harvey, John; Hegner, Benedikt; Hinzmann, Andreas; Innocente, Vincenzo; Janot, Patrick; Kaadze, Ketino; Karavakis, Edward; Kousouris, Konstantinos; Lecoq, Paul; Lee, Yen-Jie; Lenzi, Piergiulio; Lourenco, Carlos; Magini, Nicolo; Maki, Tuula; Malberti, Martina; Malgeri, Luca; Mannelli, Marcello; Masetti, Lorenzo; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moser, Roland; Mozer, Matthias Ulrich; Mulders, Martijn; Musella, Pasquale; Nesvold, Erik; Orimoto, Toyoko; Orsini, Luciano; Palencia Cortezon, Enrique; Perez, Emmanuelle; Perrozzi, Luca; Petrilli, Achille; Pfeiffer, Andreas; Pierini, Maurizio; Pimiä, Martti; Piparo, Danilo; Polese, Giovanni; Quertenmont, Loic; Racz, Attila; Reece, William; Rodrigues Antunes, Joao; Rolandi, Gigi; Rovelli, Chiara; Rovere, Marco; Sakulin, Hannes; Santanastasio, Francesco; Schäfer, Christoph; Schwick, Christoph; Segoni, Ilaria; Sekmen, Sezen; Sharma, Archana; Siegrist, Patrice; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Spiga, Daniele; Tsirou, Andromachi; Veres, Gabor Istvan; Vlimant, Jean-Roch; Wöhri, Hermine Katharina; Worm, Steven; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Gabathuler, Kurt; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; König, Stefan; Kotlinski, Danek; Langenegger, Urs; Meier, Frank; Renker, Dieter; Rohe, Tilman; Sibille, Jennifer; Bäni, Lukas; Bortignon, Pierluigi; Buchmann, Marco-Andrea; Casal, Bruno; Chanon, Nicolas; Deisher, Amanda; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Dünser, Marc; Eugster, Jürg; Freudenreich, Klaus; Grab, Christoph; Hits, Dmitry; Lecomte, Pierre; Lustermann, Werner; Marini, Andrea Carlo; Martinez Ruiz del Arbol, Pablo; Mohr, Niklas; Moortgat, Filip; Nägeli, Christoph; Nef, Pascal; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pape, Luc; Pauss, Felicitas; Peruzzi, Marco; Ronga, Frederic Jean; Rossini, Marco; Sala, Leonardo; Sanchez, Ann - Karin; Starodumov, Andrei; Stieger, Benjamin; Takahashi, Maiko; Tauscher, Ludwig; Thea, Alessandro; Theofilatos, Konstantinos; Treille, Daniel; Urscheler, Christina; Wallny, Rainer; Weber, Hannsjoerg Artur; Wehrli, Lukas; Amsler, Claude; Chiochia, Vincenzo; De Visscher, Simon; Favaro, Carlotta; Ivova Rikova, Mirena; Millan Mejias, Barbara; Otiougova, Polina; Robmann, Peter; Snoek, Hella; Tupputi, Salvatore; Verzetti, Mauro; Chang, Yuan-Hann; Chen, Kuan-Hsin; Kuo, Chia-Ming; Li, Syue-Wei; Lin, Willis; Liu, Zong-Kai; Lu, Yun-Ju; Mekterovic, Darko; Singh, Anil; Volpe, Roberta; Yu, Shin-Shan; Bartalini, Paolo; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Dietz, Charles; Grundler, Ulysses; Hou, George Wei-Shu; Hsiung, Yee; Kao, Kai-Yi; Lei, Yeong-Jyi; Lu, Rong-Shyang; Majumder, Devdatta; Petrakou, Eleni; Shi, Xin; Shiu, Jing-Ge; Tzeng, Yeng-Ming; Wan, Xia; Wang, Minzu; Adiguzel, Aytul; Bakirci, Mustafa Numan; Cerci, Salim; Dozen, Candan; Dumanoglu, Isa; Eskut, Eda; Girgis, Semiray; Gokbulut, Gul; Gurpinar, Emine; Hos, Ilknur; Kangal, Evrim Ersin; Karaman, Turker; Karapinar, Guler; Kayis Topaksu, Aysel; Onengut, Gulsen; Ozdemir, Kadri; Ozturk, Sertac; Polatoz, Ayse; Sogut, Kenan; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Vergili, Latife Nukhet; Vergili, Mehmet; Akin, Ilina Vasileva; Aliev, Takhmasib; Bilin, Bugra; Bilmis, Selcuk; Deniz, Muhammed; Gamsizkan, Halil; Guler, Ali Murat; Ocalan, Kadir; Ozpineci, Altug; Serin, Meltem; Sever, Ramazan; Surat, Ugur Emrah; Yalvac, Metin; Yildirim, Eda; Zeyrek, Mehmet; Gülmez, Erhan; Isildak, Bora; Kaya, Mithat; Kaya, Ozlem; Ozkorucuklu, Suat; Sonmez, Nasuf; Cankocak, Kerem; Levchuk, Leonid; Bostock, Francis; Brooke, James John; Clement, Emyr; Cussans, David; Flacher, Henning; Frazier, Robert; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Kreczko, Lukasz; Metson, Simon; Newbold, Dave M; Nirunpong, Kachanon; Poll, Anthony; Senkin, Sergey; Smith, Vincent J; Williams, Thomas; Basso, Lorenzo; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Jackson, James; Kennedy, Bruce W; Olaiya, Emmanuel; Petyt, David; Radburn-Smith, Benjamin Charles; Shepherd-Themistocleous, Claire; Tomalin, Ian R; Womersley, William John; Bainbridge, Robert; Ball, Gordon; Beuselinck, Raymond; Buchmuller, Oliver; Colling, David; Cripps, Nicholas; Cutajar, Michael; Dauncey, Paul; Davies, Gavin; Della Negra, Michel; Ferguson, William; Fulcher, Jonathan; Futyan, David; Gilbert, Andrew; Guneratne Bryer, Arlo; Hall, Geoffrey; Hatherell, Zoe; Hays, Jonathan; Iles, Gregory; Jarvis, Martyn; Karapostoli, Georgia; Lyons, Louis; Magnan, Anne-Marie; Marrouche, Jad; Mathias, Bryn; Nandi, Robin; Nash, Jordan; Nikitenko, Alexander; Papageorgiou, Anastasios; Pela, Joao; Pesaresi, Mark; Petridis, Konstantinos; Pioppi, Michele; Raymond, David Mark; Rogerson, Samuel; Rose, Andrew; Ryan, Matthew John; Seez, Christopher; Sharp, Peter; Sparrow, Alex; Stoye, Markus; Tapper, Alexander; Vazquez Acosta, Monica; Virdee, Tejinder; Wakefield, Stuart; Wardle, Nicholas; Whyntie, Tom; Chadwick, Matthew; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leggat, Duncan; Leslie, Dawn; Martin, William; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Hatakeyama, Kenichi; Liu, Hongxuan; Scarborough, Tara; Charaf, Otman; Henderson, Conor; Rumerio, Paolo; Avetisyan, Aram; Bose, Tulika; Fantasia, Cory; Heister, Arno; St John, Jason; Lawson, Philip; Lazic, Dragoslav; Rohlf, James; Sperka, David; Sulak, Lawrence; Alimena, Juliette; Bhattacharya, Saptaparna; Cutts, David; Ferapontov, Alexey; Heintz, Ulrich; Jabeen, Shabnam; Kukartsev, Gennadiy; Laird, Edward; Landsberg, Greg; Luk, Michael; Narain, Meenakshi; Nguyen, Duong; Segala, Michael; Sinthuprasith, Tutanon; Speer, Thomas; Tsang, Ka Vang; Breedon, Richard; Breto, Guillermo; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Dolen, James; Erbacher, Robin; Gardner, Michael; Houtz, Rachel; Ko, Winston; Kopecky, Alexandra; Lander, Richard; Miceli, Tia; Pellett, Dave; Ricci-tam, Francesca; Rutherford, Britney; Searle, Matthew; Smith, John; Squires, Michael; Tripathi, Mani; Vasquez Sierra, Ricardo; Andreev, Valeri; Cline, David; Cousins, Robert; Duris, Joseph; Erhan, Samim; Everaerts, Pieter; Farrell, Chris; Hauser, Jay; Ignatenko, Mikhail; Jarvis, Chad; Plager, Charles; Rakness, Gregory; Schlein, Peter; Traczyk, Piotr; Valuev, Vyacheslav; Weber, Matthias; Babb, John; Clare, Robert; Dinardo, Mauro Emanuele; Ellison, John Anthony; Gary, J William; Giordano, Ferdinando; Hanson, Gail; Jeng, Geng-Yuan; Liu, Hongliang; Long, Owen Rosser; Luthra, Arun; Nguyen, Harold; Paramesvaran, Sudarshan; Sturdy, Jared; Sumowidagdo, Suharyo; Wilken, Rachel; Wimpenny, Stephen; Andrews, Warren; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; Evans, David; Golf, Frank; Holzner, André; Kelley, Ryan; Lebourgeois, Matthew; Letts, James; Macneill, Ian; Mangano, Boris; Padhi, Sanjay; Palmer, Christopher; Petrucciani, Giovanni; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Sudano, Elizabeth; Tadel, Matevz; Tu, Yanjun; Vartak, Adish; Wasserbaech, Steven; Würthwein, Frank; Yagil, Avraham; Yoo, Jaehyeok; Barge, Derek; Bellan, Riccardo; Campagnari, Claudio; D'Alfonso, Mariarosaria; Danielson, Thomas; Flowers, Kristen; Geffert, Paul; Incandela, Joe; Justus, Christopher; Kalavase, Puneeth; Koay, Sue Ann; Kovalskyi, Dmytro; Krutelyov, Vyacheslav; Lowette, Steven; Mccoll, Nickolas; Pavlunin, Viktor; Rebassoo, Finn; Ribnik, Jacob; Richman, Jeffrey; Rossin, Roberto; Stuart, David; To, Wing; West, Christopher; Apresyan, Artur; Bornheim, Adolf; Chen, Yi; Di Marco, Emanuele; Duarte, Javier; Gataullin, Marat; Ma, Yousi; Mott, Alexander; Newman, Harvey B; Rogan, Christopher; Spiropulu, Maria; Timciuc, Vladlen; Veverka, Jan; Wilkinson, Richard; Xie, Si; Yang, Yong; Zhu, Ren-Yuan; Akgun, Bora; Azzolini, Virginia; Calamba, Aristotle; Carroll, Ryan; Ferguson, Thomas; Iiyama, Yutaro; Jang, Dong Wook; Liu, Yueh-Feng; Paulini, Manfred; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Drell, Brian Robert; Edelmaier, Christopher; Ford, William T; Gaz, Alessandro; Heyburn, Bernadette; Luiggi Lopez, Eduardo; Smith, James; Stenson, Kevin; Ulmer, Keith; Wagner, Stephen Robert; Alexander, James; Chatterjee, Avishek; Eggert, Nicholas; Gibbons, Lawrence Kent; Heltsley, Brian; Khukhunaishvili, Aleko; Kreis, Benjamin; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Ryd, Anders; Salvati, Emmanuele; Sun, Werner; Teo, Wee Don; Thom, Julia; Thompson, Joshua; Tucker, Jordan; Vaughan, Jennifer; Weng, Yao; Winstrom, Lucas; Wittich, Peter; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Anderson, Jacob; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bloch, Ingo; Burkett, Kevin; Butler, Joel Nathan; Chetluru, Vasundhara; Cheung, Harry; Chlebana, Frank; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gao, Yanyan; Green, Dan; Gutsche, Oliver; Hanlon, Jim; Harris, Robert M; Hirschauer, James; Hooberman, Benjamin; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Kilminster, Benjamin; Klima, Boaz; Kunori, Shuichi; Kwan, Simon; Leonidopoulos, Christos; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Maruyama, Sho; Mason, David; McBride, Patricia; Mishra, Kalanand; Mrenna, Stephen; Musienko, Yuri; Newman-Holmes, Catherine; O'Dell, Vivian; Prokofyev, Oleg; Sexton-Kennedy, Elizabeth; Sharma, Seema; Spalding, William J; Spiegel, Leonard; Tan, Ping; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vidal, Richard; Whitmore, Juliana; Wu, Weimin; Yang, Fan; Yumiceva, Francisco; Yun, Jae Chul; Acosta, Darin; Avery, Paul; Bourilkov, Dimitri; Chen, Mingshui; Cheng, Tongguang; Das, Souvik; De Gruttola, Michele; Di Giovanni, Gian Piero; Dobur, Didar; Drozdetskiy, Alexey; Field, Richard D; Fisher, Matthew; Fu, Yu; Furic, Ivan-Kresimir; Gartner, Joseph; Hugon, Justin; Kim, Bockjoo; Konigsberg, Jacobo; Korytov, Andrey; Kropivnitskaya, Anna; Kypreos, Theodore; Low, Jia Fu; Matchev, Konstantin; Milenovic, Predrag; Mitselmakher, Guenakh; Muniz, Lana; Remington, Ronald; Rinkevicius, Aurelijus; Sellers, Paul; Skhirtladze, Nikoloz; Snowball, Matthew; Yelton, John; Zakaria, Mohammed; Gaultney, Vanessa; Hewamanage, Samantha; Lebolo, Luis Miguel; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Adams, Todd; Askew, Andrew; Bochenek, Joseph; Chen, Jie; Diamond, Brendan; Gleyzer, Sergei V; Haas, Jeff; Hagopian, Sharon; Hagopian, Vasken; Jenkins, Merrill; Johnson, Kurtis F; Prosper, Harrison; Veeraraghavan, Venkatesh; Weinberg, Marc; Baarmand, Marc M; Dorney, Brian; Hohlmann, Marcus; Kalakhety, Himali; Vodopiyanov, Igor; Adams, Mark Raymond; Anghel, Ioana Maria; Apanasevich, Leonard; Bai, Yuting; Bazterra, Victor Eduardo; Betts, Russell Richard; Bucinskaite, Inga; Callner, Jeremy; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Khalatyan, Samvel; Lacroix, Florent; Malek, Magdalena; O'Brien, Christine; Silkworth, Christopher; Strom, Derek; Varelas, Nikos; Akgun, Ugur; Albayrak, Elif Asli; Bilki, Burak; Clarida, Warren; Duru, Firdevs; Griffiths, Scott; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Newsom, Charles Ray; Norbeck, Edwin; Onel, Yasar; Ozok, Ferhat; Sen, Sercan; Tiras, Emrah; Wetzel, James; Yetkin, Taylan; Yi, Kai; Barnett, Bruce Arnold; Blumenfeld, Barry; Bolognesi, Sara; Fehling, David; Giurgiu, Gavril; Gritsan, Andrei; Guo, Zijin; Hu, Guofan; Maksimovic, Petar; Rappoccio, Salvatore; Swartz, Morris; Whitbeck, Andrew; Baringer, Philip; Bean, Alice; Benelli, Gabriele; Grachov, Oleg; Kenny Iii, Raymond Patrick; Murray, Michael; Noonan, Daniel; Sanders, Stephen; Stringer, Robert; Tinti, Gemma; Wood, Jeffrey Scott; Zhukova, Victoria; Barfuss, Anne-Fleur; Bolton, Tim; Chakaberia, Irakli; Ivanov, Andrew; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Shrestha, Shruti; Svintradze, Irakli; Gronberg, Jeffrey; Lange, David; Wright, Douglas; Baden, Drew; Boutemeur, Madjid; Calvert, Brian; Eno, Sarah Catherine; Gomez, Jaime; Hadley, Nicholas John; Kellogg, Richard G; Kirn, Malina; Kolberg, Ted; Lu, Ying; Marionneau, Matthieu; Mignerey, Alice; Pedro, Kevin; Peterman, Alison; Skuja, Andris; Temple, Jeffrey; Tonjes, Marguerite; Tonwar, Suresh C; Twedt, Elizabeth; Apyan, Aram; Bauer, Gerry; Bendavid, Joshua; Busza, Wit; Butz, Erik; Cali, Ivan Amos; Chan, Matthew; Dutta, Valentina; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Hahn, Kristan Allan; Kim, Yongsun; Klute, Markus; Krajczar, Krisztian; Li, Wei; Luckey, Paul David; Ma, Teng; Nahn, Steve; Paus, Christoph; Ralph, Duncan; Roland, Christof; Roland, Gunther; Rudolph, Matthew; Stephans, George; Stöckli, Fabian; Sumorok, Konstanty; Sung, Kevin; Velicanu, Dragos; Wenger, Edward Allen; Wolf, Roger; Wyslouch, Bolek; Yang, Mingming; Yilmaz, Yetkin; Yoon, Sungho; Zanetti, Marco; Cooper, Seth; Dahmes, Bryan; De Benedetti, Abraham; Franzoni, Giovanni; Gude, Alexander; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Mans, Jeremy; Pastika, Nathaniel; Rusack, Roger; Sasseville, Michael; Singovsky, Alexander; Tambe, Norbert; Turkewitz, Jared; Cremaldi, Lucien Marcus; Kroeger, Rob; Perera, Lalith; Rahmat, Rahmat; Sanders, David A; Avdeeva, Ekaterina; Bloom, Kenneth; Bose, Suvadeep; Butt, Jamila; Claes, Daniel R; Dominguez, Aaron; Eads, Michael; Keller, Jason; Kravchenko, Ilya; Lazo-Flores, Jose; Malbouisson, Helena; Malik, Sudhir; Snow, Gregory R; Baur, Ulrich; Godshalk, Andrew; Iashvili, Ia; Jain, Supriya; Kharchilava, Avto; Kumar, Ashish; Shipkowski, Simon Peter; Smith, Kenneth; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Haley, Joseph; Nash, David; Trocino, Daniele; Wood, Darien; Zhang, Jinzhong; Anastassov, Anton; Kubik, Andrew; Mucia, Nicholas; Odell, Nathaniel; Ofierzynski, Radoslaw Adrian; Pollack, Brian; Pozdnyakov, Andrey; Schmitt, Michael Henry; Stoynev, Stoyan; Velasco, Mayda; Won, Steven; Antonelli, Louis; Berry, Douglas; Brinkerhoff, Andrew; Hildreth, Michael; Jessop, Colin; Karmgard, Daniel John; Kolb, Jeff; Lannon, Kevin; Luo, Wuming; Lynch, Sean; Marinelli, Nancy; Morse, David Michael; Pearson, Tessa; Planer, Michael; Ruchti, Randy; Slaunwhite, Jason; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Bylsma, Ben; Durkin, Lloyd Stanley; Hill, Christopher; Hughes, Richard; Kotov, Khristian; Ling, Ta-Yung; Puigh, Darren; Rodenburg, Marissa; Vuosalo, Carl; Williams, Grayson; Winer, Brian L; Adam, Nadia; Berry, Edmund; Elmer, Peter; Gerbaudo, Davide; Halyo, Valerie; Hebda, Philip; Hegeman, Jeroen; Hunt, Adam; Jindal, Pratima; Lopes Pegna, David; Lujan, Paul; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Piroué, Pierre; Quan, Xiaohang; Raval, Amita; Safdi, Ben; Saka, Halil; Stickland, David; Tully, Christopher; Werner, Jeremy Scott; Zuranski, Andrzej; Acosta, Jhon Gabriel; Brownson, Eric; Huang, Xing Tao; Lopez, Angel; Mendez, Hector; Oliveros, Sandra; Ramirez Vargas, Juan Eduardo; Zatserklyaniy, Andriy; Alagoz, Enver; Barnes, Virgil E; Benedetti, Daniele; Bolla, Gino; Bortoletto, Daniela; De Mattia, Marco; Everett, Adam; Hu, Zhen; Jones, Matthew; Koybasi, Ozhan; Kress, Matthew; Laasanen, Alvin T; Leonardo, Nuno; Maroussov, Vassili; Merkel, Petra; Miller, David Harry; Neumeister, Norbert; Shipsey, Ian; Silvers, David; Svyatkovskiy, Alexey; Vidal Marono, Miguel; Yoo, Hwi Dong; Zablocki, Jakub; Zheng, Yu; Guragain, Samir; Parashar, Neeti; Adair, Antony; Boulahouache, Chaouki; Ecklund, Karl Matthew; Geurts, Frank JM; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Zabel, James; Betchart, Burton; Bodek, Arie; Chung, Yeon Sei; Covarelli, Roberto; de Barbaro, Pawel; Demina, Regina; Eshaq, Yossof; Garcia-Bellido, Aran; Goldenzweig, Pablo; Han, Jiyeon; Harel, Amnon; Miner, Daniel Carl; Vishnevskiy, Dmitry; Zielinski, Marek; Bhatti, Anwar; Ciesielski, Robert; Demortier, Luc; Goulianos, Konstantin; Lungu, Gheorghe; Malik, Sarah; Mesropian, Christina; Arora, Sanjay; Barker, Anthony; Chou, John Paul; Contreras-Campana, Christian; Contreras-Campana, Emmanuel; Duggan, Daniel; Ferencek, Dinko; Gershtein, Yuri; Gray, Richard; Halkiadakis, Eva; Hidas, Dean; Lath, Amitabh; Panwalkar, Shruti; Park, Michael; Patel, Rishi; Rekovic, Vladimir; Robles, Jorge; Rose, Keith; Salur, Sevil; Schnetzer, Steve; Seitz, Claudia; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Cerizza, Giordano; Hollingsworth, Matthew; Spanier, Stefan; Yang, Zong-Chang; York, Andrew; Eusebi, Ricardo; Flanagan, Will; Gilmore, Jason; Kamon, Teruki; Khotilovich, Vadim; Montalvo, Roy; Osipenkov, Ilya; Pakhotin, Yuriy; Perloff, Alexx; Roe, Jeffrey; Safonov, Alexei; Sakuma, Tai; Sengupta, Sinjini; Suarez, Indara; Tatarinov, Aysen; Toback, David; Akchurin, Nural; Damgov, Jordan; Dragoiu, Cosmin; Dudero, Phillip Russell; Jeong, Chiyoung; Kovitanggoon, Kittikul; Lee, Sung Won; Libeiro, Terence; Roh, Youn; Volobouev, Igor; Appelt, Eric; Delannoy, Andrés G; Florez, Carlos; Greene, Senta; Gurrola, Alfredo; Johns, Willard; Johnston, Cody; Kurt, Pelin; Maguire, Charles; Melo, Andrew; Sharma, Monika; Sheldon, Paul; Snook, Benjamin; Tuo, Shengquan; Velkovska, Julia; Arenton, Michael Wayne; Balazs, Michael; Boutle, Sarah; Cox, Bradley; Francis, Brian; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Lin, Chuanzhe; Neu, Christopher; Wood, John; Yohay, Rachel; Gollapinni, Sowjanya; Harr, Robert; Karchin, Paul Edmund; Kottachchi Kankanamge Don, Chamath; Lamichhane, Pramod; Sakharov, Alexandre; Anderson, Michael; Belknap, Donald; Borrello, Laura; Carlsmith, Duncan; Cepeda, Maria; Dasu, Sridhara; Friis, Evan; Gray, Lindsey; Grogg, Kira Suzanne; Grothe, Monika; Hall-Wilton, Richard; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Klukas, Jeffrey; Lanaro, Armando; Lazaridis, Christos; Leonard, Jessica; Loveless, Richard; Mohapatra, Ajit; Ojalvo, Isabel; Palmonari, Francesco; Pierro, Giuseppe Antonio; Ross, Ian; Savin, Alexander; Smith, Wesley H; Swanson, Joshua

2012-01-01

Results are presented from a search for a fourth generation of quarks produced singly or in pairs in a data set corresponding to an integrated luminosity of 5 inverse femtobarns recorded by the CMS experiment at the LHC in 2011. A novel strategy has been developed for a combined search for quarks of the up- and down-type in decay channels with at least one isolated muon or electron. Limits on the mass of the fourth-generation quarks and the relevant CKM matrix elements are derived in the context of a simple extension of the standard model with a sequential fourth generation of fermions. The existence of mass-degenerate fourth-generation quarks with masses below 685 GeV is excluded at 95% confidence level for minimal off-diagonal mixing between the third- and the fourth-generation quarks. With a mass difference of 25 GeV between the quark masses, the obtained limit on the masses of the fourth-generation quarks shifts by about +/- 20 GeV. This result significantly reduces the allowed parameter space for a fourt...

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

Iterative Filtering of Retrieved Information to Increase Relevance

Directory of Open Access Journals (Sweden)

Robert Zeidman

2007-12-01

Full Text Available Efforts have been underway for years to find more effective ways to retrieve information from large knowledge domains. This effort is now being driven particularly by the Internet and the vast amount of information that is available to unsophisticated users. In the early days of the Internet, some effort involved allowing users to enter Boolean equations of search terms into search engines, for example, rather than just a list of keywords. More recently, effort has focused on understanding a user's desires from past search histories in order to narrow searches. Also there has been much effort to improve the ranking of results based on some measure of relevancy. This paper discusses using iterative filtering of retrieved information to focus in on useful information. This work was done for finding source code correlation and the author extends his findings to Internet searching and e-commerce. The paper presents specific information about a particular filtering application and then generalizes it to other forms of information retrieval.

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

A search algorithm to meta-optimize the parameters for an extended Kalman filter to improve classification on hyper-temporal images

CSIR Research Space (South Africa)

Salmon

2012-07-01

Full Text Available stream_source_info Salmon1_2012_ABSTRACT ONLY.pdf.txt stream_content_type text/plain stream_size 1654 Content-Encoding ISO-8859-1 stream_name Salmon1_2012_ABSTRACT ONLY.pdf.txt Content-Type text/plain; charset=ISO-8859...-1 IEEE International Geoscience and Remote Sensing Symposium, Munich, Germany, 22-27 July 2012 A search algorithm to meta-optimize the parameters for an extended Kalman filter to improve classification on hyper-temporal images yzB.P. Salmon, yz...

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.

Bible Translation And Relevance Theory | Deist | Stellenbosch ...

African Journals Online (AJOL)

Stellenbosch Papers in Linguistics Plus. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 22 (1992) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register. Bible Translation And Relevance Theory. F Deist ...

A Novel Relevance Feedback Approach Based on Similarity Measure Modification in an X-Ray Image Retrieval System Based on Fuzzy Representation Using Fuzzy Attributed Relational Graph

Directory of Open Access Journals (Sweden)

Hossien Pourghassem

2011-04-01

Full Text Available Relevance feedback approaches is used to improve the performance of content-based image retrieval systems. In this paper, a novel relevance feedback approach based on similarity measure modification in an X-ray image retrieval system based on fuzzy representation using fuzzy attributed relational graph (FARG is presented. In this approach, optimum weight of each feature in feature vector is calculated using similarity rate between query image and relevant and irrelevant images in user feedback. The calculated weight is used to tune fuzzy graph matching algorithm as a modifier parameter in similarity measure. The standard deviation of the retrieved image features is applied to calculate the optimum weight. The proposed image retrieval system uses a FARG for representation of images, a fuzzy matching graph algorithm as similarity measure and a semantic classifier based on merging scheme for determination of the search space in image database. To evaluate relevance feedback approach in the proposed system, a standard X-ray image database consisting of 10000 images in 57 classes is used. The improvement of the evaluation parameters shows proficiency and efficiency of the proposed system.

HOW DO RADIOLOGISTS USE THE HUMAN SEARCH ENGINE?

Science.gov (United States)

Wolfe, Jeremy M.; Evans, Karla K.; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-01-01

Radiologists perform many ‘visual search tasks’ in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human ‘search engine’ works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? PMID:26656078

How do radiologists use the human search engine?

International Nuclear Information System (INIS)

Wolfe, Jeremy M.; Evans, Karla K.; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-01-01

Radiologists perform many 'visual search tasks' in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human 'search engine' works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? (authors)

The EBI Search engine: providing search and retrieval functionality for biological data from EMBL-EBI.

Science.gov (United States)

Squizzato, Silvano; Park, Young Mi; Buso, Nicola; Gur, Tamer; Cowley, Andrew; Li, Weizhong; Uludag, Mahmut; Pundir, Sangya; Cham, Jennifer A; McWilliam, Hamish; Lopez, Rodrigo

2015-07-01

The European Bioinformatics Institute (EMBL-EBI-https://www.ebi.ac.uk) provides free and unrestricted access to data across all major areas of biology and biomedicine. Searching and extracting knowledge across these domains requires a fast and scalable solution that addresses the requirements of domain experts as well as casual users. We present the EBI Search engine, referred to here as 'EBI Search', an easy-to-use fast text search and indexing system with powerful data navigation and retrieval capabilities. API integration provides access to analytical tools, allowing users to further investigate the results of their search. The interconnectivity that exists between data resources at EMBL-EBI provides easy, quick and precise navigation and a better understanding of the relationship between different data types including sequences, genes, gene products, proteins, protein domains, protein families, enzymes and macromolecular structures, together with relevant life science literature. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Overview of the TREC 2013 federated web search track

OpenAIRE

Demeester, Thomas; Trieschnigg, D; Nguyen, D; Hiemstra, D

2013-01-01

The TREC Federated Web Search track is intended to promote research related to federated search in a realistic web setting, and hereto provides a large data collection gathered from a series of online search engines. This overview paper discusses the results of the first edition of the track, FedWeb 2013. The focus was on basic challenges in federated search: (1) resource selection, and (2) results merging. After an overview of the provided data collection and the relevance judgments for the ...

Sensitivity Analysis and Identification of Parameters to the Van Genuchten Equation

Directory of Open Access Journals (Sweden)

Guangzhou Chen

2016-01-01

Full Text Available Van Genuchten equation is the soil water characteristic curve equation used commonly, and identifying (estimating accurately its parameters plays an important role in the study on the movement of soil water. Selecting the desorption and absorption experimental data of silt loam from a northwest region in China as an instance, Monte-Carlo method was firstly applied to analyze sensitivity of the parameters and uncertainty of model so as to get the key parameters and posteriori parameter distribution to guide subsequent parameter identification. Then, the optimization model of the parameters was set up, and a new type of intelligent algorithm-difference search algorithm was employed to identify them. In order to overcome the fault that the base difference search algorithm needed more iterations and to further enhance the optimization performance, a hybrid algorithm, which coupled the difference search algorithm with simplex method, was employed to identification of the parameters. By comparison with other optimization algorithms, the results show that the difference search algorithm has the following characteristics: good optimization performance, the simple principle, easy implement, short program code, and less control parameters required to run the algorithm. In addition, the proposed hybrid algorithm outperforms the basic difference search algorithm on the comprehensive performance of algorithm.

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.

A step-by-step guide to systematically identify all relevant animal studies

Science.gov (United States)

Leenaars, Marlies; Hooijmans, Carlijn R; van Veggel, Nieky; ter Riet, Gerben; Leeflang, Mariska; Hooft, Lotty; van der Wilt, Gert Jan; Tillema, Alice; Ritskes-Hoitinga, Merel

2012-01-01

Before starting a new animal experiment, thorough analysis of previously performed experiments is essential from a scientific as well as from an ethical point of view. The method that is most suitable to carry out such a thorough analysis of the literature is a systematic review (SR). An essential first step in an SR is to search and find all potentially relevant studies. It is important to include all available evidence in an SR to minimize bias and reduce hampered interpretation of experimental outcomes. Despite the recent development of search filters to find animal studies in PubMed and EMBASE, searching for all available animal studies remains a challenge. Available guidelines from the clinical field cannot be copied directly to the situation within animal research, and although there are plenty of books and courses on searching the literature, there is no compact guide available to search and find relevant animal studies. Therefore, in order to facilitate a structured, thorough and transparent search for animal studies (in both preclinical and fundamental science), an easy-to-use, step-by-step guide was prepared and optimized using feedback from scientists in the field of animal experimentation. The step-by-step guide will assist scientists in performing a comprehensive literature search and, consequently, improve the scientific quality of the resulting review and prevent unnecessary animal use in the future. PMID:22037056

In search of an integrative measure of functioning.

Science.gov (United States)

Madden, Rosamond H; Glozier, Nick; Fortune, Nicola; Dyson, Maree; Gilroy, John; Bundy, Anita; Llewellyn, Gwynnyth; Salvador-Carulla, Luis; Lukersmith, Sue; Mpofu, Elias; Madden, Richard

2015-05-26

International trends towards people-centred, integrative care and support require any measurement of functioning and disability to meet multiple aims. The information requirements of two major Australian programs for disability and rehabilitation are outlined, and the findings of two searches for suitable measures of functioning and disability are analysed. Over 30 current measures of functioning were evaluated in each search. Neither search found a generic measure of functioning suitable for these multibillion dollar programs, relevant to a wide range of people with a variety of health conditions and functioning experiences, and capable of indicating support needs, associated costs, progress and outcomes. This unsuccessful outcome has implications internationally for policy-relevant information for disability, rehabilitation and related programs. The paper outlines the features of an Integrative Measure of Functioning (IMF) based on the concepts of functioning and environmental factors in the International Classification of Functioning, Disability and Health (ICF). An IMF would be applicable across a variety of health conditions, settings and purposes, ranging from individual assessment to public health. An IMF could deliver person-centred, policy-relevant information for a range of programs, promoting harmonised language and measurement and supporting international trends in human services and public health.

Modelling of interplanetary pickup ion fluxes and relevance for LISM parameters

International Nuclear Information System (INIS)

Fahr, H.J.; Rucinski, D.

1989-01-01

It has been known for many years that neutral interstellar atoms enter the solar system from the upwind side and penetrate deep into the inner heliosphere. Helium atoms, in particular, advance towards very small solar distances before they are ionized and then again convected as He - pickup ions outwards with the solar wind. Since these ions were recently detected in space, we concentrate here on calculations of He + production rates and He + fluxes. It is shown that inside 1 a.u., the He - production is essentially determined both by solar e.u.v. photoionization and by electron impact ionization. We calculate He + production rates as a function of space coordinates, taking into account the core-halo structure of the energy distribution of solar wind electrons and their temperature distribution with distance according to relevant solar wind models. For this purpose, a newly developed program to compute He densities was used. In contrast to the production of H + , the He - production rates are found to be higher on the downwind axis than on the upwind axis by a factor of 5. We also determine partial and total He + ion fluxes as a function of solar distance and longitude. It is interesting to note that only the values for total fluxes agree well with the integrated He + fluxes measured by the SULEICA experiment aboard the AMPTE satellite. This indicates that pickup ions under the influence of the intrinsic MHD wave turbulence in the solar wind change their primary seed distribution function by rapid pitch-angle scattering and subsequent adiabatic cooling. To interpret the He + intensity profile along the orbit of the Earth in terms of LISM helium parameters, we point to the need to take into account carefully electron impact ionization in order to prevent misinterpretations. (author)

Computer-Assisted Search Of Large Textual Data Bases

Science.gov (United States)

Driscoll, James R.

1995-01-01

"QA" denotes high-speed computer system for searching diverse collections of documents including (but not limited to) technical reference manuals, legal documents, medical documents, news releases, and patents. Incorporates previously available and emerging information-retrieval technology to help user intelligently and rapidly locate information found in large textual data bases. Technology includes provision for inquiries in natural language; statistical ranking of retrieved information; artificial-intelligence implementation of semantics, in which "surface level" knowledge found in text used to improve ranking of retrieved information; and relevance feedback, in which user's judgements of relevance of some retrieved documents used automatically to modify search for further information.

Flexible patient information search and retrieval framework: pilot implementation

Science.gov (United States)

Erdal, Selnur; Catalyurek, Umit V.; Saltz, Joel; Kamal, Jyoti; Gurcan, Metin N.

2007-03-01

Medical centers collect and store significant amount of valuable data pertaining to patients' visit in the form of medical free-text. In addition, standardized diagnosis codes (International Classification of Diseases, Ninth Revision, Clinical Modification: ICD9-CM) related to those dictated reports are usually available. In this work, we have created a framework where image searches could be initiated through a combination of free-text reports as well as ICD9 codes. This framework enables more comprehensive search on existing large sets of patient data in a systematic way. The free text search is enriched by computer-aided inclusion of additional search terms enhanced by a thesaurus. This combination of enriched search allows users to access to a larger set of relevant results from a patient-centric PACS in a simpler way. Therefore, such framework is of particular use in tasks such as gathering images for desired patient populations, building disease models, and so on. As the motivating application of our framework, we implemented a search engine. This search engine processed two years of patient data from the OSU Medical Center's Information Warehouse and identified lung nodule location information using a combination of UMLS Meta-Thesaurus enhanced text report searches along with ICD9 code searches on patients that have been discharged. Five different queries with various ICD9 codes involving lung cancer were carried out on 172552 cases. Each search was completed under a minute on average per ICD9 code and the inclusion of UMLS thesaurus increased the number of relevant cases by 45% on average.

A concept of volume rendering guided search process to analyze medical data set.

Science.gov (United States)

Zhou, Jianlong; Xiao, Chun; Wang, Zhiyan; Takatsuka, Masahiro

2008-03-01

This paper firstly presents an approach of parallel coordinates based parameter control panel (PCP). The PCP is used to control parameters of focal region-based volume rendering (FRVR) during data analysis. It uses a parallel coordinates style interface. Different rendering parameters represented with nodes on each axis, and renditions based on related parameters are connected using polylines to show dependencies between renditions and parameters. Based on the PCP, a concept of volume rendering guided search process is proposed. The search pipeline is divided into four phases. Different parameters of FRVR are recorded and modulated in the PCP during search phases. The concept shows that volume visualization could play the role of guiding a search process in the rendition space to help users to efficiently find local structures of interest. The usability of the proposed approach is evaluated to show its effectiveness.

Dietary supplementation of tiger nut alters biochemical parameters relevant to erectile function in l-NAME treated rats.

Science.gov (United States)

Olabiyi, Ayodeji A; Carvalho, Fabiano B; Bottari, Nathieli B; Lopes, Thauan F; da Costa, Pauline; Stefanelo, Naiara; Morsch, Vera M; Akindahunsi, Afolabi A; Oboh, Ganiyu; Schetinger, Maria Rosa

2018-07-01

Tiger nut tubers have been reportedly used for the treatment of erectile dysfunction (ED) in folk medicine without scientific basis. Hence, this study evaluated the effect of tiger nut on erectile dysfunction by assessing biochemical parameters relevant to ED in male rats by nitric oxide synthase (NOS) inhibitor, Nω-nitro-l-arginine methyl ester hydrochloride (l-NAME) treatment. Rats were divided into five groups (n = 10) each: Control group; l-NAME plus basal diet; l-NAME plus Sildenafil citrate; diet supplemented processed tiger nut (20%) plus l-NAME;diet supplemented raw tiger nut (20%) plus l-NAME. l-NAME pre-treatment (40 mg/kg/day) lasted for 14 days. Arginase, acetycholinesterase (AChE) and adenosine deaminase (ADA) activities as well as nitric oxide levels (NO) in serum, brain and penile tissue were measured. l-NAME increased the activity of arginase, AChE and ADA and reduced NO levels. However, dietary supplementation with tiger nut caused a reduction on the activities of the above enzymes and up regulated nitric oxide levels when compared to the control group. The effect of tiger nut supplemented diet may be said to prevent alterations of the activities of the enzymes relevant in erectile function. Quercetin was revealed to be the most active component of tiger nut tuber by HPLC finger printing. Copyright © 2018. Published by Elsevier Ltd.

OS2: Oblivious similarity based searching for encrypted data outsourced to an untrusted domain

Science.gov (United States)

Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Ramzan, Naeem

2017-01-01

Public cloud storage services are becoming prevalent and myriad data sharing, archiving and collaborative services have emerged which harness the pay-as-you-go business model of public cloud. To ensure privacy and confidentiality often encrypted data is outsourced to such services, which further complicates the process of accessing relevant data by using search queries. Search over encrypted data schemes solve this problem by exploiting cryptographic primitives and secure indexing to identify outsourced data that satisfy the search criteria. Almost all of these schemes rely on exact matching between the encrypted data and search criteria. A few schemes which extend the notion of exact matching to similarity based search, lack realism as those schemes rely on trusted third parties or due to increase storage and computational complexity. In this paper we propose Oblivious Similarity based Search (OS2) for encrypted data. It enables authorized users to model their own encrypted search queries which are resilient to typographical errors. Unlike conventional methodologies, OS2 ranks the search results by using similarity measure offering a better search experience than exact matching. It utilizes encrypted bloom filter and probabilistic homomorphic encryption to enable authorized users to access relevant data without revealing results of search query evaluation process to the untrusted cloud service provider. Encrypted bloom filter based search enables OS2 to reduce search space to potentially relevant encrypted data avoiding unnecessary computation on public cloud. The efficacy of OS2 is evaluated on Google App Engine for various bloom filter lengths on different cloud configurations. PMID:28692697

Task relevance modulates the cortical representation of feature conjunctions in the target template.

Science.gov (United States)

Reeder, Reshanne R; Hanke, Michael; Pollmann, Stefan

2017-07-03

Little is known about the cortical regions involved in representing task-related content in preparation for visual task performance. Here we used representational similarity analysis (RSA) to investigate the BOLD response pattern similarity between task relevant and task irrelevant feature dimensions during conjunction viewing and target template maintenance prior to visual search. Subjects were cued to search for a spatial frequency (SF) or orientation of a Gabor grating and we measured BOLD signal during cue and delay periods before the onset of a search display. RSA of delay period activity revealed that widespread regions in frontal, posterior parietal, and occipitotemporal cortices showed general representational differences between task relevant and task irrelevant dimensions (e.g., orientation vs. SF). In contrast, RSA of cue period activity revealed sensory-related representational differences between cue images (regardless of task) at the occipital pole and additionally in the frontal pole. Our data show that task and sensory information are represented differently during viewing and during target template maintenance, and that task relevance modulates the representation of visual information across the cortex.

Optimal database combinations for literature searches in systematic reviews : a prospective exploratory study

NARCIS (Netherlands)

Bramer, W. M.; Rethlefsen, Melissa L.; Kleijnen, Jos; Franco, Oscar H.

2017-01-01

Background: Within systematic reviews, when searching for relevant references, it is advisable to use multiple databases. However, searching databases is laborious and time-consuming, as syntax of search strategies are database specific. We aimed to determine the optimal combination of databases

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

Collaborative Search Strategies for Green Innovation

DEFF Research Database (Denmark)

Ørding Olsen, Anders; Sofka, Wolfgang; Grimpe, Christoph

Recent innovation and strategy research emphasizes the importance of firm’s search for external knowledge to improve innovation performance. We focus on such search strategies within the domain of sustainable innovation in which problems are inherently complex and the relevant knowledge is widely...... dispersed. Hence, firms need to collaborate. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from the European Seventh Framework Program...... for Research and Technological Development (FP7), our results indicate that the problem-solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we identify a substantial negative effect...

Search for scalar leptons at LEP with the L3 detector

CERN Document Server

Xia, Lei

2002-01-01

In this thesis, I present a search for scalar leptons in e+e- annihilation using the L3 detector at LEP. Data collected in 1999 and 2000, at center-of-mass energies between 192 GeV and 208 GeV, was used in this analysis. This work covered the scalar lepton searches in both SUGRA and GMSB models. To achieve this analysis, a parametrized selection was developed to handle the different event signatures in SUGRA models. Improvement of the L3 simulation and reconstruction program packages was carried out so that one can simulated the scalar leptons in GMSB models correctly. The simulation of the L3 Time Expansion Chamber (TEC) dE/dx measurement was rewritten to facilitate the analysis for a stable slepton signal, which is relevant in some parts of the parameter space in GMSB models. In this analysis, we didn't abserve any significant indication of scalar lepton production of any type. We achieved the following mass exclusion limits for scalar leptons in SUGRA models, for large dM: M(scalar e) > 97 GeV (expected 97...

Heuristic learning parameter identification for surveillance and diagnostics of nuclear power plants

International Nuclear Information System (INIS)

Machado, E.L.

1983-01-01

A new method of heuristic reinforcement learning was developed for parameter identification purposes. In essence, this new parameter identification technique is based on the idea of breaking a multidimensional search for the minimum of a given functional into a set of unidirectional searches in parameter space. Each search situation is associated with one block in a memory organized into cells, where the information learned about the situations is stored (e.g. the optimal directions in parameter space). Whenever the search falls into an existing memory cell, the system chooses the learned direction. For new search situations, the system creates additional memory cells. This algorithm imitates the following cognitive process: 1) characterize a situation, 2) select an optimal action, 3) evaluate the consequences of the action, and 4) memorize the results for future use. As a result, this algorithm is trainable in the sense that it can learn from previous experience within a specific class of parameter identification problems

Indirect searches for dark matter

Indian Academy of Sciences (India)

The current status of indirect searches for dark matter has been reviewed in a schematic way here. The main relevant experimental results of the recent years have been listed and the excitements and disappointments that their phenomenological interpretations in terms of almost-standard annihilating dark matter have ...

Automatic guidance of attention during real-world visual search.

Science.gov (United States)

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

2015-08-01

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

Automatic guidance of attention during real-world visual search

Science.gov (United States)

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

2015-01-01

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

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.

Posterior α EEG Dynamics Dissociate Current from Future Goals in Working Memory-Guided Visual Search.

Science.gov (United States)

de Vries, Ingmar E J; van Driel, Joram; Olivers, Christian N L

2017-02-08

Current models of visual search assume that search is guided by an active visual working memory representation of what we are currently looking for. This attentional template for currently relevant stimuli can be dissociated from accessory memory representations that are only needed prospectively, for a future task, and that should be prevented from guiding current attention. However, it remains unclear what electrophysiological mechanisms dissociate currently relevant (serving upcoming selection) from prospectively relevant memories (serving future selection). We measured EEG of 20 human subjects while they performed two consecutive visual search tasks. Before the search tasks, a cue instructed observers which item to look for first (current template) and which second (prospective template). During the delay leading up to the first search display, we found clear suppression of α band (8-14 Hz) activity in regions contralateral to remembered items, comprising both local power and interregional phase synchronization within a posterior parietal network. Importantly, these lateralization effects were stronger when the memory item was currently relevant (i.e., for the first search) compared with when it was prospectively relevant (i.e., for the second search), consistent with current templates being prioritized over future templates. In contrast, event-related potential analysis revealed that the contralateral delay activity was similar for all conditions, suggesting no difference in storage. Together, these findings support the idea that posterior α oscillations represent a state of increased processing or excitability in task-relevant cortical regions, and reflect enhanced cortical prioritization of memory representations that serve as a current selection filter. SIGNIFICANCE STATEMENT Our days are filled with looking for relevant objects while ignoring irrelevant visual information. Such visual search activity is thought to be driven by current goals activated in

IMPROVED SEARCH OF PRINCIPAL COMPONENT ANALYSIS DATABASES FOR SPECTRO-POLARIMETRIC INVERSION

International Nuclear Information System (INIS)

Casini, R.; Lites, B. W.; Ramos, A. Asensio; Ariste, A. López

2013-01-01

We describe a simple technique for the acceleration of spectro-polarimetric inversions based on principal component analysis (PCA) of Stokes profiles. This technique involves the indexing of the database models based on the sign of the projections (PCA coefficients) of the first few relevant orders of principal components of the four Stokes parameters. In this way, each model in the database can be attributed a distinctive binary number of 2 4n bits, where n is the number of PCA orders used for the indexing. Each of these binary numbers (indices) identifies a group of ''compatible'' models for the inversion of a given set of observed Stokes profiles sharing the same index. The complete set of the binary numbers so constructed evidently determines a partition of the database. The search of the database for the PCA inversion of spectro-polarimetric data can profit greatly from this indexing. In practical cases it becomes possible to approach the ideal acceleration factor of 2 4n as compared to the systematic search of a non-indexed database for a traditional PCA inversion. This indexing method relies on the existence of a physical meaning in the sign of the PCA coefficients of a model. For this reason, the presence of model ambiguities and of spectro-polarimetric noise in the observations limits in practice the number n of relevant PCA orders that can be used for the indexing

Practical fulltext search in medical records

Directory of Open Access Journals (Sweden)

Vít Volšička

2015-09-01

Full Text Available Performing a search through previously existing documents, including medical reports, is an integral part of acquiring new information and educational processes. Unfortunately, finding relevant information is not always easy, since many documents are saved in free text formats, thereby making it difficult to search through them. A full-text search is a viable solution for searching through documents. The full-text search makes it possible to efficiently search through large numbers of documents and to find those that contain specific search phrases in a short time. All leading database systems currently offer full-text search, but some do not support the complex morphology of the Czech language. Apache Solr provides full support options and some full-text libraries. This programme provides the good support of the Czech language in the basic installation, and a wide range of settings and options for its deployment over any platform. The library had been satisfactorily tested using real data from the hospitals. Solr provided useful, fast, and accurate searches. However, there is still a need to make adjustments in order to receive effective search results, particularly by correcting typographical errors made not only in the text, but also when entering words in the search box and creating a list of frequently used abbreviations and synonyms for more accurate results.

The database search problem: a question of rational decision making.

Science.gov (United States)

Gittelson, S; Biedermann, A; Bozza, S; Taroni, F

2012-10-10

This paper applies probability and decision theory in the graphical interface of an influence diagram to study the formal requirements of rationality which justify the individualization of a person found through a database search. The decision-theoretic part of the analysis studies the parameters that a rational decision maker would use to individualize the selected person. The modeling part (in the form of an influence diagram) clarifies the relationships between this decision and the ingredients that make up the database search problem, i.e., the results of the database search and the different pairs of propositions describing whether an individual is at the source of the crime stain. These analyses evaluate the desirability associated with the decision of 'individualizing' (and 'not individualizing'). They point out that this decision is a function of (i) the probability that the individual in question is, in fact, at the source of the crime stain (i.e., the state of nature), and (ii) the decision maker's preferences among the possible consequences of the decision (i.e., the decision maker's loss function). We discuss the relevance and argumentative implications of these insights with respect to recent comments in specialized literature, which suggest points of view that are opposed to the results of our study. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

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.

A Modified Penalty Parameter Approach for Optimal Estimation of UH with Simultaneous Estimation of Infiltration Parameters

Science.gov (United States)

Bhattacharjya, Rajib Kumar

2018-05-01

The unit hydrograph and the infiltration parameters of a watershed can be obtained from observed rainfall-runoff data by using inverse optimization technique. This is a two-stage optimization problem. In the first stage, the infiltration parameters are obtained and the unit hydrograph ordinates are estimated in the second stage. In order to combine this two-stage method into a single stage one, a modified penalty parameter approach is proposed for converting the constrained optimization problem to an unconstrained one. The proposed approach is designed in such a way that the model initially obtains the infiltration parameters and then searches the optimal unit hydrograph ordinates. The optimization model is solved using Genetic Algorithms. A reduction factor is used in the penalty parameter approach so that the obtained optimal infiltration parameters are not destroyed during subsequent generation of genetic algorithms, required for searching optimal unit hydrograph ordinates. The performance of the proposed methodology is evaluated by using two example problems. The evaluation shows that the model is superior, simple in concept and also has the potential for field application.

Self-control trumps work motivation in predicting job search behavior

NARCIS (Netherlands)

Baay, Pieter E.; de Ridder, Denise T D; Eccles, Jacquelynne S.; van der Lippe, T.; van Aken, Marcel A G

2014-01-01

Current labor market entrants face an increasingly challenging job search process. Effective guidance of job seekers requires identification of relevant job search skills. Self-control (i.e., the ability to control one's thoughts, actions, and response tendencies in view of a long-term goal, such as

Identifying quality improvement intervention publications - A comparison of electronic search strategies

Directory of Open Access Journals (Sweden)

Rubenstein Lisa V

2011-08-01

Full Text Available Abstract Background The evidence base for quality improvement (QI interventions is expanding rapidly. The diversity of the initiatives and the inconsistency in labeling these as QI interventions makes it challenging for researchers, policymakers, and QI practitioners to access the literature systematically and to identify relevant publications. Methods We evaluated search strategies developed for MEDLINE (Ovid and PubMed based on free text words, Medical subject headings (MeSH, QI intervention components, continuous quality improvement (CQI methods, and combinations of the strategies. Three sets of pertinent QI intervention publications were used for validation. Two independent expert reviewers screened publications for relevance. We compared the yield, recall rate, and precision of the search strategies for the identification of QI publications and for a subset of empirical studies on effects of QI interventions. Results The search yields ranged from 2,221 to 216,167 publications. Mean recall rates for reference publications ranged from 5% to 53% for strategies with yields of 50,000 publications or fewer. The 'best case' strategy, a simple text word search with high face validity ('quality' AND 'improv*' AND 'intervention*' identified 44%, 24%, and 62% of influential intervention articles selected by Agency for Healthcare Research and Quality (AHRQ experts, a set of exemplar articles provided by members of the Standards for Quality Improvement Reporting Excellence (SQUIRE group, and a sample from the Cochrane Effective Practice and Organization of Care Group (EPOC register of studies, respectively. We applied the search strategy to a PubMed search for articles published in 10 pertinent journals in a three-year period which retrieved 183 publications. Among these, 67% were deemed relevant to QI by at least one of two independent raters. Forty percent were classified as empirical studies reporting on a QI intervention. Conclusions The presented

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

-Geisser correction applied). Overall, participants were asked to rate learnability, ease of use, and satisfaction. Paired mean comparisons showed that the Web search interface received significantly higher ratings than the traditional search interface for learnability (P=.002, 95% CI [0.6-2.4]), ease of use (Pnatural language search interfaces for variable search supporting in particular: query reformulation; data browsing; faceted search; surrogates; relevance feedback; summarization, analytics, and visual presentation. PMID:26769334

In Search of an Integrative Measure of Functioning

Directory of Open Access Journals (Sweden)

Rosamond H. Madden

2015-05-01

Full Text Available International trends towards people-centred, integrative care and support require any measurement of functioning and disability to meet multiple aims. The information requirements of two major Australian programs for disability and rehabilitation are outlined, and the findings of two searches for suitable measures of functioning and disability are analysed. Over 30 current measures of functioning were evaluated in each search. Neither search found a generic measure of functioning suitable for these multibillion dollar programs, relevant to a wide range of people with a variety of health conditions and functioning experiences, and capable of indicating support needs, associated costs, progress and outcomes. This unsuccessful outcome has implications internationally for policy-relevant information for disability, rehabilitation and related programs. The paper outlines the features of an Integrative Measure of Functioning (IMF based on the concepts of functioning and environmental factors in the International Classification of Functioning, Disability and Health (ICF. An IMF would be applicable across a variety of health conditions, settings and purposes, ranging from individual assessment to public health. An IMF could deliver person-centred, policy-relevant information for a range of programs, promoting harmonised language and measurement and supporting international trends in human services and public health.

Personal health records: retrieving contextual information with Google Custom Search.

Science.gov (United States)

Ahsan, Mahmud; Seldon, H Lee; Sayeed, Shohel

2012-01-01

Ubiquitous personal health records, which can accompany a person everywhere, are a necessary requirement for ubiquitous healthcare. Contextual information related to health events is important for the diagnosis and treatment of disease and for the maintenance of good health, yet it is seldom recorded in a health record. We describe a dual cellphone-and-Web-based personal health record system which can include 'external' contextual information. Much contextual information is available on the Internet and we can use ontologies to help identify relevant sites and information. But a search engine is required to retrieve information from the Web and developing a customized search engine is beyond our scope, so we can use Google Custom Search API Web service to get contextual data. In this paper we describe a framework which combines a health-and-environment 'knowledge base' or ontology with the Google Custom Search API to retrieve relevant contextual information related to entries in a ubiquitous personal health record.

Involuntary top-down control by search-irrelevant features: Visual working memory biases attention in an object-based manner.

Science.gov (United States)

Foerster, Rebecca M; Schneider, Werner X

2018-03-01

Many everyday tasks involve successive visual-search episodes with changing targets. Converging evidence suggests that these targets are retained in visual working memory (VWM) and bias attention from there. It is unknown whether all or only search-relevant features of a VWM template bias attention during search. Bias signals might be configured exclusively to task-relevant features so that only search-relevant features bias attention. Alternatively, VWM might maintain objects in the form of bound features. Then, all template features will bias attention in an object-based manner, so that biasing effects are ranked by feature relevance. Here, we investigated whether search-irrelevant VWM template features bias attention. Participants had to saccade to a target opposite a distractor. A colored cue depicted the target prior to each search trial. The target was predefined only by its identity, while its color was irrelevant. When target and cue matched not only in identity (search-relevant) but also in color (search-irrelevant), saccades went more often and faster directly to the target than without any color match (Experiment 1). When introducing a cue-distractor color match (Experiment 2), direct target saccades were most likely when target and cue matched in the search-irrelevant color and least likely in case of a cue-distractor color match. When cue and target were never colored the same (Experiment 3), cue-colored distractors still captured the eyes more often than different-colored distractors despite color being search-irrelevant. As participants were informed about the misleading color, the result argues against a strategical and voluntary usage of color. Instead, search-irrelevant features biased attention obligatorily arguing for involuntary top-down control by object-based VWM templates. Copyright © 2017 Elsevier B.V. All rights reserved.

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

Relevance as process: judgements in the context of scholarly research

Directory of Open Access Journals (Sweden)

Theresa D. Anderson

2005-01-01

Full Text Available Introduction. This paper discusses how exploring the research process in-depth and over time contributes to a fuller understanding of interactions with various representations of information. Method. A longitudinal ethnographic study explored decisions made by two informants involved in scholarly research. Relevance assessment and information seeking were observed as part of informants' own ongoing research projects. Fieldwork used methods of discovery that allowed informants to shape the exploration of the practices surrounding the evolving understandings of their topics. Analysis. Inductive analysis was carried out on the qualitative data collected over a two-year period of judgements observed on a document-by-document basis. The paper introduces broad categories that point to the variability and richness of the ways that informants used representations of information resources to make relevance judgements. Results. Relevance judgements appear to be drivers of the search and research processes informants moved through during the observations. Focusing on research goals rather than on retrieval tasks brings us to a fuller understanding of the relationship between ultimate research goals and the articulation of those goals in interactions with information systems. Conclusion. Relevance assessment is a process that unfolds in the doing of a search, the making of judgements and the using of texts and representations of information.

HOW DO RADIOLOGISTS USE THE HUMAN SEARCH ENGINE?

Science.gov (United States)

Wolfe, Jeremy M; Evans, Karla K; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-06-01

Radiologists perform many 'visual search tasks' in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human 'search engine' works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Searching for Grey Literature for Systematic Reviews: Challenges and Benefits

Science.gov (United States)

Mahood, Quenby; Van Eerd, Dwayne; Irvin, Emma

2014-01-01

There is ongoing interest in including grey literature in systematic reviews. Including grey literature can broaden the scope to more relevant studies, thereby providing a more complete view of available evidence. Searching for grey literature can be challenging despite greater access through the Internet, search engines and online bibliographic…

Visualization of Pulsar Search Data

Science.gov (United States)

Foster, R. S.; Wolszczan, A.

1993-05-01

The search for periodic signals from rotating neutron stars or pulsars has been a computationally taxing problem to astronomers for more than twenty-five years. Over this time interval, increases in computational capability have allowed ever more sensitive searches, covering a larger parameter space. The volume of input data and the general presence of radio frequency interference typically produce numerous spurious signals. Visualization of the search output and enhanced real-time processing of significant candidate events allow the pulsar searcher to optimally processes and search for new radio pulsars. The pulsar search algorithm and visualization system presented in this paper currently runs on serial RISC based workstations, a traditional vector based super computer, and a massively parallel computer. A description of the serial software algorithm and its modifications for massively parallel computing are describe. The results of four successive searches for millisecond period radio pulsars using the Arecibo telescope at 430 MHz have resulted in the successful detection of new long-period and millisecond period radio pulsars.

[Formula: see text]: Oblivious similarity based searching for encrypted data outsourced to an untrusted domain.

Science.gov (United States)

Pervez, Zeeshan; Ahmad, Mahmood; Khattak, Asad Masood; Ramzan, Naeem; Khan, Wajahat Ali

2017-01-01

Public cloud storage services are becoming prevalent and myriad data sharing, archiving and collaborative services have emerged which harness the pay-as-you-go business model of public cloud. To ensure privacy and confidentiality often encrypted data is outsourced to such services, which further complicates the process of accessing relevant data by using search queries. Search over encrypted data schemes solve this problem by exploiting cryptographic primitives and secure indexing to identify outsourced data that satisfy the search criteria. Almost all of these schemes rely on exact matching between the encrypted data and search criteria. A few schemes which extend the notion of exact matching to similarity based search, lack realism as those schemes rely on trusted third parties or due to increase storage and computational complexity. In this paper we propose Oblivious Similarity based Search ([Formula: see text]) for encrypted data. It enables authorized users to model their own encrypted search queries which are resilient to typographical errors. Unlike conventional methodologies, [Formula: see text] ranks the search results by using similarity measure offering a better search experience than exact matching. It utilizes encrypted bloom filter and probabilistic homomorphic encryption to enable authorized users to access relevant data without revealing results of search query evaluation process to the untrusted cloud service provider. Encrypted bloom filter based search enables [Formula: see text] to reduce search space to potentially relevant encrypted data avoiding unnecessary computation on public cloud. The efficacy of [Formula: see text] is evaluated on Google App Engine for various bloom filter lengths on different cloud configurations.

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

Patient-Centered Tools for Medication Information Search.

Science.gov (United States)

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

2014-05-20

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

Development and Evaluation of Thesauri-Based Bibliographic Biomedical Search Engine

Science.gov (United States)

Alghoson, Abdullah

2017-01-01

Due to the large volume and exponential growth of biomedical documents (e.g., books, journal articles), it has become increasingly challenging for biomedical search engines to retrieve relevant documents based on users' search queries. Part of the challenge is the matching mechanism of free-text indexing that performs matching based on…

Search of AMSB with the DELPHI data

CERN Document Server

Alderweireld, T

2002-01-01

The data collected by the DELPHI experiment up to the highest LEP2 energies were used to put constraints on the Anomaly Mediated SUSY Breaking model with a flavour independent m0 parameter. The experimental searches covered several possible signatures experimentally accessible at LEP, with either the lightest neutralino, the sneutrino or the stau being the LSP. They included the search for nearly mass degenerate chargino and neutralino (always present in AMSB), the search for Standard Model like or invisible Higgs boson, the search for stable staus, and the search for cascade decays resulting in the LSP (neutralino or sneutrino) and a low multiplicity final state containing neutrinos.

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

The potentials of ICT application to increased relevance and ...

African Journals Online (AJOL)

The potentials of ICT application to increased relevance and sustainability of University Library Services in Nigeria. ... in Kenneth Dike library, University of Ibadan and University of Lagos Libraries and library search of recent literature on ICT application and marketing of ICT based services in Nigerian University libraries.

Search for neutrinoless double beta decay beyond GERDA

Energy Technology Data Exchange (ETDEWEB)

Schwingenheuer, Bernhard [MPI Kernphysik, Heidelberg (Germany)

2016-07-01

The search for neutrinoless double beta decay might be the only window to observe lepton number violation and to determine the nature of neutrinos. Is is therefore considered to be of highest relevance. The isotope Ge-76 has historically been most important for this search and the ongoing experiment GERDA has the lowest background of all experiments in the field. The proposed experimental program beyond GERDA (and Majorana) is presented.

A Network-Aware Approach for Searching As-You-Type in Social Media

OpenAIRE

Lagrée , Paul; Cautis , Bogdan; Vahabi , Hossein

2015-01-01

International audience; We present in this paper a novel approach for as-you-type top-k keyword search over social media. We adopt a natural "network-aware" interpretation for information relevance, by which information produced by users who are closer to the seeker is considered more relevant. In practice, this query model poses new challenges for effectiveness and efficiency in online search, even when a complete query is given as input in one keystroke. This is mainly because it requires a...

Visual search in scenes involves selective and non-selective pathways

Science.gov (United States)

Wolfe, Jeremy M; Vo, Melissa L-H; Evans, Karla K; Greene, Michelle R

2010-01-01

How do we find objects in scenes? For decades, visual search models have been built on experiments in which observers search for targets, presented among distractor items, isolated and randomly arranged on blank backgrounds. Are these models relevant to search in continuous scenes? This paper argues that the mechanisms that govern artificial, laboratory search tasks do play a role in visual search in scenes. However, scene-based information is used to guide search in ways that had no place in earlier models. Search in scenes may be best explained by a dual-path model: A “selective” path in which candidate objects must be individually selected for recognition and a “non-selective” path in which information can be extracted from global / statistical information. PMID:21227734

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.

Some relevant parameters for assessing fire hazards of combustible mine materials using laboratory scale experiments.

Science.gov (United States)

Litton, Charles D; Perera, Inoka E; Harteis, Samuel P; Teacoach, Kara A; DeRosa, Maria I; Thomas, Richard A; Smith, Alex C

2018-04-15

When combustible materials ignite and burn, the potential for fire growth and flame spread represents an obvious hazard, but during these processes of ignition and flaming, other life hazards present themselves and should be included to ensure an effective overall analysis of the relevant fire hazards. In particular, the gases and smoke produced both during the smoldering stages of fires leading to ignition and during the advanced flaming stages of a developing fire serve to contaminate the surrounding atmosphere, potentially producing elevated levels of toxicity and high levels of smoke obscuration that render the environment untenable. In underground mines, these hazards may be exacerbated by the existing forced ventilation that can carry the gases and smoke to locations far-removed from the fire location. Clearly, materials that require high temperatures (above 1400 K) and that exhibit low mass loss during thermal decomposition, or that require high heat fluxes or heat transfer rates to ignite represent less of a hazard than materials that decompose at low temperatures or ignite at low levels of heat flux. In order to define and quantify some possible parameters that can be used to assess these hazards, small-scale laboratory experiments were conducted in a number of configurations to measure: 1) the toxic gases and smoke produced both during non-flaming and flaming combustion; 2) mass loss rates as a function of temperature to determine ease of thermal decomposition; and 3) mass loss rates and times to ignition as a function of incident heat flux. This paper describes the experiments that were conducted, their results, and the development of a set of parameters that could possibly be used to assess the overall fire hazard of combustible materials using small scale laboratory experiments.

Superinsulating Polyisocyanate Based Aerogels: A Targeted Search for the Optimum Solvent System.

Science.gov (United States)

Zhu, Zhiyuan; Snellings, Geert M B F; Koebel, Matthias M; Malfait, Wim J

2017-05-31

Polyisocyanate based aerogels combine ultralow thermal conductivities with better mechanical properties than silica aerogel, but these properties critically depend on the nature of the gelation solvent, perhaps more so than on any other parameter. Here, we present a systematic study of the relationship between the polyurethane-polyisocyanurate (PUR-PIR) aerogel microstructure, surface area, thermal conductivity, and density and the gelation solvent's Hansen solubility parameters for an industrially relevant PUR-PIR rigid foam formulation. We first investigated aerogels prepared in acetone-dimethyl sulfoxide (DMSO) blends and observed a minimum in thermal conductivity (λ) and maximum in specific surface area for an acetone:DMSO ratio of 85:15 v/v. We then prepared PUR-PIR aerogels in 32 different solvent blends, divided into three series with δ Dispersion , δ Polarity , and δ H-bonding fixed at 15.94, 11.30, and 7.48 MPa 1/2 , respectively, corresponding to the optimum parameters for the acetone:DMSO series. The aerogel properties display distinct dependencies on the various solubility parameters: aerogels with low thermal conductivity can be synthesized in solvents with a high δ H-bonding parameter (above 7.2) and δ Dispersion around 16.3 MPa 1/2 . In contrast, the δ Polarity parameter is of lesser importance. Our study highlights the importance of the gelation solvent, clarifies the influence of the different solvent properties, and provides a methodology for a targeted search across the solvent chemical space based on the Hansen solubility parameters.

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

Sensitivity and predictive value of 15 PubMed search strategies to answer clinical questions rated against full systematic reviews.

Science.gov (United States)

Agoritsas, Thomas; Merglen, Arnaud; Courvoisier, Delphine S; Combescure, Christophe; Garin, Nicolas; Perrier, Arnaud; Perneger, Thomas V

2012-06-12

Clinicians perform searches in PubMed daily, but retrieving relevant studies is challenging due to the rapid expansion of medical knowledge. Little is known about the performance of search strategies when they are applied to answer specific clinical questions. To compare the performance of 15 PubMed search strategies in retrieving relevant clinical trials on therapeutic interventions. We used Cochrane systematic reviews to identify relevant trials for 30 clinical questions. Search terms were extracted from the abstract using a predefined procedure based on the population, interventions, comparison, outcomes (PICO) framework and combined into queries. We tested 15 search strategies that varied in their query (PIC or PICO), use of PubMed's Clinical Queries therapeutic filters (broad or narrow), search limits, and PubMed links to related articles. We assessed sensitivity (recall) and positive predictive value (precision) of each strategy on the first 2 PubMed pages (40 articles) and on the complete search output. The performance of the search strategies varied widely according to the clinical question. Unfiltered searches and those using the broad filter of Clinical Queries produced large outputs and retrieved few relevant articles within the first 2 pages, resulting in a median sensitivity of only 10%-25%. In contrast, all searches using the narrow filter performed significantly better, with a median sensitivity of about 50% (all P PubMed pages. These results can help clinicians apply effective strategies to answer their questions at the point of care.

Iterative Integration of Visual Insights during Scalable Patent Search and Analysis.

Science.gov (United States)

Koch, S; Bosch, H; Giereth, M; Ertl, T

2011-05-01

Patents are of growing importance in current economic markets. Analyzing patent information has, therefore, become a common task for many interest groups. As a prerequisite for patent analysis, extensive search for relevant patent information is essential. Unfortunately, the complexity of patent material inhibits a straightforward retrieval of all relevant patent documents and leads to iterative, time-consuming approaches in practice. Already the amount of patent data to be analyzed poses challenges with respect to scalability. Further scalability issues arise concerning the diversity of users and the large variety of analysis tasks. With "PatViz", a system for interactive analysis of patent information has been developed addressing scalability at various levels. PatViz provides a visual environment allowing for interactive reintegration of insights into subsequent search iterations, thereby bridging the gap between search and analytic processes. Because of its extensibility, we expect that the approach we have taken can be employed in different problem domains that require high quality of search results regarding their completeness.

Effective Image Database Search via Dimensionality Reduction

DEFF Research Database (Denmark)

Dahl, Anders Bjorholm; Aanæs, Henrik

2008-01-01

Image search using the bag-of-words image representation is investigated further in this paper. This approach has shown promising results for large scale image collections making it relevant for Internet applications. The steps involved in the bag-of-words approach are feature extraction, vocabul......Image search using the bag-of-words image representation is investigated further in this paper. This approach has shown promising results for large scale image collections making it relevant for Internet applications. The steps involved in the bag-of-words approach are feature extraction......, vocabulary building, and searching with a query image. It is important to keep the computational cost low through all steps. In this paper we focus on the efficiency of the technique. To do that we substantially reduce the dimensionality of the features by the use of PCA and addition of color. Building...... of the visual vocabulary is typically done using k-means. We investigate a clustering algorithm based on the leader follower principle (LF-clustering), in which the number of clusters is not fixed. The adaptive nature of LF-clustering is shown to improve the quality of the visual vocabulary using this...

Black hole algorithm for determining model parameter in self-potential data

Science.gov (United States)

Sungkono; Warnana, Dwa Desa

2018-01-01

Analysis of self-potential (SP) data is increasingly popular in geophysical method due to its relevance in many cases. However, the inversion of SP data is often highly nonlinear. Consequently, local search algorithms commonly based on gradient approaches have often failed to find the global optimum solution in nonlinear problems. Black hole algorithm (BHA) was proposed as a solution to such problems. As the name suggests, the algorithm was constructed based on the black hole phenomena. This paper investigates the application of BHA to solve inversions of field and synthetic self-potential (SP) data. The inversion results show that BHA accurately determines model parameters and model uncertainty. This indicates that BHA is highly potential as an innovative approach for SP data inversion.

Research on perturbation based Monte Carlo reactor criticality search

International Nuclear Information System (INIS)

Li Zeguang; Wang Kan; Li Yangliu; Deng Jingkang

2013-01-01

Criticality search is a very important aspect in reactor physics analysis. Due to the advantages of Monte Carlo method and the development of computer technologies, Monte Carlo criticality search is becoming more and more necessary and feasible. Traditional Monte Carlo criticality search method is suffered from large amount of individual criticality runs and uncertainty and fluctuation of Monte Carlo results. A new Monte Carlo criticality search method based on perturbation calculation is put forward in this paper to overcome the disadvantages of traditional method. By using only one criticality run to get initial k_e_f_f and differential coefficients of concerned parameter, the polynomial estimator of k_e_f_f changing function is solved to get the critical value of concerned parameter. The feasibility of this method was tested. The results show that the accuracy and efficiency of perturbation based criticality search method are quite inspiring and the method overcomes the disadvantages of traditional one. (authors)

The relevance of segments reports – measurement methodology

Directory of Open Access Journals (Sweden)

Tomasz Zimnicki

2017-09-01

Full Text Available The segment report is one of the areas of financial statements, and it obliges a company to provide infor-mation about the economic situation in each of its activity areas. The article evaluates the change of segment reporting standards from IAS14R to IFRS8 in the context of feature relevance. It presents the construction of a measure which allows the relevance of segment disclosures to be determined. The created measure was used to study periodical reports published by companies listed on the main market of the Warsaw Stock Exchange from three reporting periods – 2008, 2009 and 2013. Based on the re-search results, it was found that the change of segment reporting standards from IAS14R to IFRS8 in the context of relevance was legitimate.

News trends and web search query of HIV/AIDS in Hong Kong

Science.gov (United States)

Chiu, Alice P. Y.; Lin, Qianying

2017-01-01

Background The HIV epidemic in Hong Kong has worsened in recent years, with major contributions from high-risk subgroup of men who have sex with men (MSM). Internet use is prevalent among the majority of the local population, where they sought health information online. This study examines the impacts of HIV/AIDS and MSM news coverage on web search query in Hong Kong. Methods Relevant news coverage about HIV/AIDS and MSM from January 1st, 2004 to December 31st, 2014 was obtained from the WiseNews databse. News trends were created by computing the number of relevant articles by type, topic, place of origin and sub-populations. We then obtained relevant search volumes from Google and analysed causality between news trends and Google Trends using Granger Causality test and orthogonal impulse function. Results We found that editorial news has an impact on “HIV” Google searches on HIV, with the search term popularity peaking at an average of two weeks after the news are published. Similarly, editorial news has an impact on the frequency of “AIDS” searches two weeks after. MSM-related news trends have a more fluctuating impact on “MSM” Google searches, although the time lag varies anywhere from one week later to ten weeks later. Conclusions This infodemiological study shows that there is a positive impact of news trends on the online search behavior of HIV/AIDS or MSM-related issues for up to ten weeks after. Health promotional professionals could make use of this brief time window to tailor the timing of HIV awareness campaigns and public health interventions to maximise its reach and effectiveness. PMID:28922376

Searches for Randomized Controlled Trials of Drugs in MEDLINE and EMBASE Using Only Generic Drug Names Compared with Searches Applied in Current Practice in Systematic Reviews

Science.gov (United States)

Waffenschmidt, Siw; Guddat, Charlotte

2015-01-01

Background: It is unclear which terms should be included in bibliographic searches for randomized controlled trials (RCTs) of drugs, and identifying relevant drug terms can be extremely laborious. The aim of our analysis was to determine whether a bibliographic search using only the generic drug name produces sufficient results for the generation…

Classification of Automated Search Traffic

Science.gov (United States)

Buehrer, Greg; Stokes, Jack W.; Chellapilla, Kumar; Platt, John C.

As web search providers seek to improve both relevance and response times, they are challenged by the ever-increasing tax of automated search query traffic. Third party systems interact with search engines for a variety of reasons, such as monitoring a web site’s rank, augmenting online games, or possibly to maliciously alter click-through rates. In this paper, we investigate automated traffic (sometimes referred to as bot traffic) in the query stream of a large search engine provider. We define automated traffic as any search query not generated by a human in real time. We first provide examples of different categories of query logs generated by automated means. We then develop many different features that distinguish between queries generated by people searching for information, and those generated by automated processes. We categorize these features into two classes, either an interpretation of the physical model of human interactions, or as behavioral patterns of automated interactions. Using the these detection features, we next classify the query stream using multiple binary classifiers. In addition, a multiclass classifier is then developed to identify subclasses of both normal and automated traffic. An active learning algorithm is used to suggest which user sessions to label to improve the accuracy of the multiclass classifier, while also seeking to discover new classes of automated traffic. Performance analysis are then provided. Finally, the multiclass classifier is used to predict the subclass distribution for the search query stream.

Relevance-aware filtering of tuples sorted by an attribute value via direct optimization of search quality metrics

NARCIS (Netherlands)

Spirin, N.V.; Kuznetsov, M.; Kiseleva, Y.; Spirin, Y.V.; Izhutov, P.A.

2015-01-01

Sorting tuples by an attribute value is a common search scenario and many search engines support such capabilities, e.g. price-based sorting in e-commerce, time-based sorting on a job or social media website. However, sorting purely by the attribute value might lead to poor user experience because

Searches for new particles at TRISTAN

International Nuclear Information System (INIS)

Miyamoto, A.

1990-01-01

Recent TRISTAN results on searches for new particles, such as charged higgs, lepto-quark, colored lepton and abnormal dE/dx particle are presented. As an indirect search, fits by a Z' model to R had , R ll and A ll data below Z 0 are updated including the latest TRISTAN data and parameters of Z' to reproduce slightly high R had and low R ll are studied

Determining frequentist confidence limits using a directed parameter space search

International Nuclear Information System (INIS)

Daniel, Scott F.; Connolly, Andrew J.; Schneider, Jeff

2014-01-01

We consider the problem of inferring constraints on a high-dimensional parameter space with a computationally expensive likelihood function. We propose a machine learning algorithm that maps out the Frequentist confidence limit on parameter space by intelligently targeting likelihood evaluations so as to quickly and accurately characterize the likelihood surface in both low- and high-likelihood regions. We compare our algorithm to Bayesian credible limits derived by the well-tested Markov Chain Monte Carlo (MCMC) algorithm using both multi-modal toy likelihood functions and the seven yr Wilkinson Microwave Anisotropy Probe cosmic microwave background likelihood function. We find that our algorithm correctly identifies the location, general size, and general shape of high-likelihood regions in parameter space while being more robust against multi-modality than MCMC.

Preliminary Comparison of Three Search Engines for Point of Care Access to MEDLINE® Citations

Science.gov (United States)

Hauser, Susan E.; Demner-Fushman, Dina; Ford, Glenn M.; Jacobs, Joshua L.; Thoma, George

2006-01-01

Medical resident physicians used MD on Tap in real time to search for MEDLINE citations relevant to clinical questions using three search engines: Essie, Entrez and Google™, in order of performance. PMID:17238564

Is QCD relevant to nuclear physics

International Nuclear Information System (INIS)

Thomas, A.W.

1985-01-01

A review is given of recent work on baryon structure in a number of QCD-motivated models. After establishing a prima facie case that the quark model should be relevant in a consistent description of the nucleus over a wide range of momentum transfer, the author looks for experimental confirmation. The discussion includes the search for exotic states, for a six quark component of the deuteron, and an up to date report on the interpretation of the EMC effect. (Auth.)

Stop searches in flavourful supersymmetry

CERN Document Server

Crivellin, Andreas; Tunstall, Lewis C.

2016-01-01

Natural realisations of supersymmetry require light stops ${\\tilde t}_1$, making them a prime target of LHC searches for physics beyond the Standard Model. Depending on the kinematic region, the main search channels are ${\\tilde t_1}\\to t \\tilde \\chi^0_1$, ${\\tilde t_1}\\to W b \\tilde \\chi^0_1$ and ${\\tilde t_1}\\to c \\tilde \\chi^0_1$. We first examine the interplay of these decay modes with ${\\tilde c_1}\\to c \\tilde \\chi^0_1$ in a model-independent fashion, revealing the existence of large regions in parameter space which are excluded for any ${\\tilde t_1}\\to c \\tilde \\chi^0_1$ branching ratio. This effect is then illustrated for scenarios with stop-scharm mixing in the right-handed sector, where it has previously been observed that the stop mass limits can be significantly weakened for large mixing. Our analysis shows that once the LHC bounds from ${\\tilde c_1}\\to c \\tilde \\chi^0_1$ searches are taken into account, non-zero stop-scharm mixing leads only to a modest increase in the allowed regions of parameter...

Search engines and the production of academic knowledge

OpenAIRE

van Dijck, J.

2010-01-01

This article argues that search engines in general, and Google Scholar in particular, have become significant co-producers of academic knowledge. Knowledge is not simply conveyed to users, but is co-produced by search engines’ ranking systems and profiling systems, none of which are open to the rules of transparency, relevance and privacy in a manner known from library scholarship in the public domain. Inexperienced users tend to trust proprietary engines as neutral mediators of knowledge and...

Generating crop calendars with Web search data

International Nuclear Information System (INIS)

Van der Velde, Marijn; See, Linda; Fritz, Steffen; Khabarov, Nikolay; Obersteiner, Michael; Verheijen, Frank G A

2012-01-01

This paper demonstrates the potential of using Web search volumes for generating crop specific planting and harvesting dates in the USA integrating climatic, social and technological factors affecting crop calendars. Using Google Insights for Search, clear peaks in volume occur at times of planting and harvest at the national level, which were used to derive corn specific planting and harvesting dates at a weekly resolution. Disaggregated to state level, search volumes for corn planting generally are in agreement with planting dates from a global crop calendar dataset. However, harvest dates were less discriminatory at the state level, indicating that peaks in search volume may be blurred by broader searches on harvest as a time of cultural events. The timing of other agricultural activities such as purchase of seed and response to weed and pest infestation was also investigated. These results highlight the future potential of using Web search data to derive planting dates in countries where the data are sparse or unreliable, once sufficient search volumes are realized, as well as the potential for monitoring in real time the response of farmers to climate change over the coming decades. Other potential applications of search volume data of relevance to agronomy are also discussed. (letter)

Improving Web Page Retrieval using Search Context from Clicked Domain Names

NARCIS (Netherlands)

Li, R.

Search context is a crucial factor that helps to understand a user’s information need in ad-hoc Web page retrieval. A query log of a search engine contains rich information on issued queries and their corresponding clicked Web pages. The clicked data implies its relevance to the query and can be

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…

A compound structure of ELM based on feature selection and parameter optimization using hybrid backtracking search algorithm for wind speed forecasting

International Nuclear Information System (INIS)

Zhang, Chu; Zhou, Jianzhong; Li, Chaoshun; Fu, Wenlong; Peng, Tian

2017-01-01

Highlights: • A novel hybrid approach is proposed for wind speed forecasting. • The variational mode decomposition (VMD) is optimized to decompose the original wind speed series. • The input matrix and parameters of ELM are optimized simultaneously by using a hybrid BSA. • Results show that OVMD-HBSA-ELM achieves better performance in terms of prediction accuracy. - Abstract: Reliable wind speed forecasting is essential for wind power integration in wind power generation system. The purpose of paper is to develop a novel hybrid model for short-term wind speed forecasting and demonstrates its efficiency. In the proposed model, a compound structure of extreme learning machine (ELM) based on feature selection and parameter optimization using hybrid backtracking search algorithm (HBSA) is employed as the predictor. The real-valued BSA (RBSA) is exploited to search for the optimal combination of weights and bias of ELM while the binary-valued BSA (BBSA) is exploited as a feature selection method applying on the candidate inputs predefined by partial autocorrelation function (PACF) values to reconstruct the input-matrix. Due to the volatility and randomness of wind speed signal, an optimized variational mode decomposition (OVMD) is employed to eliminate the redundant noises. The parameters of the proposed OVMD are determined according to the center frequencies of the decomposed modes and the residual evaluation index (REI). The wind speed signal is decomposed into a few modes via OVMD. The aggregation of the forecasting results of these modes constructs the final forecasting result of the proposed model. The proposed hybrid model has been applied on the mean half-hour wind speed observation data from two wind farms in Inner Mongolia, China and 10-min wind speed data from the Sotavento Galicia wind farm are studied as an additional case. Parallel experiments have been designed to compare with the proposed model. Results obtained from this study indicate that the

Data Transformation Functions for Expanded Search Spaces in Geographic Sample Supervised Segment Generation

Directory of Open Access Journals (Sweden)

Christoff Fourie

2014-04-01

Full Text Available Sample supervised image analysis, in particular sample supervised segment generation, shows promise as a methodological avenue applicable within Geographic Object-Based Image Analysis (GEOBIA. Segmentation is acknowledged as a constituent component within typically expansive image analysis processes. A general extension to the basic formulation of an empirical discrepancy measure directed segmentation algorithm parameter tuning approach is proposed. An expanded search landscape is defined, consisting not only of the segmentation algorithm parameters, but also of low-level, parameterized image processing functions. Such higher dimensional search landscapes potentially allow for achieving better segmentation accuracies. The proposed method is tested with a range of low-level image transformation functions and two segmentation algorithms. The general effectiveness of such an approach is demonstrated compared to a variant only optimising segmentation algorithm parameters. Further, it is shown that the resultant search landscapes obtained from combining mid- and low-level image processing parameter domains, in our problem contexts, are sufficiently complex to warrant the use of population based stochastic search methods. Interdependencies of these two parameter domains are also demonstrated, necessitating simultaneous optimization.

Parameters control in GAs for dynamic optimization

Directory of Open Access Journals (Sweden)

Khalid Jebari

2013-02-01

Full Text Available The Control of Genetic Algorithms parameters allows to optimize the search process and improves the performance of the algorithm. Moreover it releases the user to dive into a game process of trial and failure to find the optimal parameters.

BEST: Next-Generation Biomedical Entity Search Tool for Knowledge Discovery from Biomedical Literature.

Directory of Open Access Journals (Sweden)

Sunwon Lee

Full Text Available As the volume of publications rapidly increases, searching for relevant information from the literature becomes more challenging. To complement standard search engines such as PubMed, it is desirable to have an advanced search tool that directly returns relevant biomedical entities such as targets, drugs, and mutations rather than a long list of articles. Some existing tools submit a query to PubMed and process retrieved abstracts to extract information at query time, resulting in a slow response time and limited coverage of only a fraction of the PubMed corpus. Other tools preprocess the PubMed corpus to speed up the response time; however, they are not constantly updated, and thus produce outdated results. Further, most existing tools cannot process sophisticated queries such as searches for mutations that co-occur with query terms in the literature. To address these problems, we introduce BEST, a biomedical entity search tool. BEST returns, as a result, a list of 10 different types of biomedical entities including genes, diseases, drugs, targets, transcription factors, miRNAs, and mutations that are relevant to a user's query. To the best of our knowledge, BEST is the only system that processes free text queries and returns up-to-date results in real time including mutation information in the results. BEST is freely accessible at http://best.korea.ac.kr.

Developing topic-specific search filters for PubMed with click-through data.

Science.gov (United States)

Li, J; Lu, Z

2013-01-01

Search filters have been developed and demonstrated for better information access to the immense and ever-growing body of publications in the biomedical domain. However, to date the number of filters remains quite limited because the current filter development methods require significant human efforts in manual document review and filter term selection. In this regard, we aim to investigate automatic methods for generating search filters. We present an automated method to develop topic-specific filters on the basis of users' search logs in PubMed. Specifically, for a given topic, we first detect its relevant user queries and then include their corresponding clicked articles to serve as the topic-relevant document set accordingly. Next, we statistically identify informative terms that best represent the topic-relevant document set using a background set composed of topic irrelevant articles. Lastly, the selected representative terms are combined with Boolean operators and evaluated on benchmark datasets to derive the final filter with the best performance. We applied our method to develop filters for four clinical topics: nephrology, diabetes, pregnancy, and depression. For the nephrology filter, our method obtained performance comparable to the state of the art (sensitivity of 91.3%, specificity of 98.7%, precision of 94.6%, and accuracy of 97.2%). Similarly, high-performing results (over 90% in all measures) were obtained for the other three search filters. Based on PubMed click-through data, we successfully developed a high-performance method for generating topic-specific search filters that is significantly more efficient than existing manual methods. All data sets (topic-relevant and irrelevant document sets) used in this study and a demonstration system are publicly available at http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/downloads/CQ_filter/

Search for Heavy Higgs Bosons with the ATLAS Detector

CERN Document Server

Schaarschmidt, Jana; The ATLAS collaboration

2018-01-01

ATLAS performed searches for heavy Higgs bosons, whose presence would establish the existance of new physics. Searches for charged and neutral Higgs bosons are carried out using 8 or 13 TeV data for various production modes and in many different final states. The searches all yield null results. Exclusions limits are set on the production cross section and on parameters in various benchmark models.

Search for relevant indications for selenium supplementation in thyroid diseases.

Science.gov (United States)

Wojciechowska-Durczynska, Katarzyna; Lewinski, Andrzej

2017-08-01

Selenium plays a significant role in the thyroid function and its deficiency is considered by some authors to be a cause of thyroid disorders. The potential therapeutic influence of selenium supplementation in thyroid disease was investigated in several studies and some results were encouraging, however results were inconsistent and did not allow conclusion to be drawn. For that reason, we have performed a review study on relevance of selenium supplementation in thyroid disease. Till now, there is no strong evidence that selenium supplementation leads to clinical improvement in the course of autoimmune thyroiditis, nodular goitre or thyroid cancer. On the other hand, there is some evidence that selenium is effective in the treatment of orbitopathy; thus, the European Group on Graves' Orbitopathy (EUGOGO) recommends selenium administration in mild active orbitopathy.

SpEnD: Linked Data SPARQL Endpoints Discovery Using Search Engines

OpenAIRE

Yumusak, Semih; Dogdu, Erdogan; Kodaz, Halife; Kamilaris, Andreas

2016-01-01

In this study, a novel metacrawling method is proposed for discovering and monitoring linked data sources on the Web. We implemented the method in a prototype system, named SPARQL Endpoints Discovery (SpEnD). SpEnD starts with a "search keyword" discovery process for finding relevant keywords for the linked data domain and specifically SPARQL endpoints. Then, these search keywords are utilized to find linked data sources via popular search engines (Google, Bing, Yahoo, Yandex). By using this ...

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.

Search for SUSY in the AMSB scenario with the DELPHI detector

CERN Document Server

Abdallah, J.; Adam, W.; Adzic, P.; Albrecht, T.; Alderweireld, T.; Alemany-Fernandez, R.; Allmendinger, T.; Allport, P.P.; Amaldi, U.; Amapane, N.; Amato, S.; Anashkin, E.; Andreazza, A.; Andringa, S.; Anjos, N.; Antilogus, P.; Apel, W.D.; Arnoud, Y.; Ask, S.; Asman, B.; Augustin, J.E.; Augustinus, A.; Baillon, P.; Ballestrero, A.; Bambade, P.; Barbier, R.; Bardin, D.; Barker, G.; Baroncelli, A.; Battaglia, M.; Baubillier, M.; Becks, K.H.; Begalli, M.; Behrmann, A.; Ben-Haim, E.; Benekos, N.; Benvenuti, A.; Berat, C.; Berggren, M.; Berntzon, L.; Bertrand, D.; Besancon, M.; Besson, N.; Bloch, D.; Blom, M.; Bluj, M.; Bonesini, M.; Boonekamp, M.; Booth, P.S.L.; Borisov, G.; Botner, O.; Bouquet, B.; Bowcock, T.J.V.; Boyko, I.; Bracko, M.; Brenner, R.; Brodet, E.; Bruckman, P.; Brunet, J.M.; Bugge, L.; Buschmann, P.; Calvi, M.; Camporesi, T.; Canale, V.; Carena, F.; Castro, Nuno Filipe; Cavallo, F.; Chapkin, M.; Charpentier, Ph.; Checchia, P.; Chierici, R.; Chliapnikov, P.; Chudoba, J.; Chung, S.U.; Cieslik, K.; Collins, P.; Contri, R.; Cosme, G.; Cossutti, F.; Costa, M.J.; Crennell, D.; Cuevas, J.; D'Hondt, J.; Dalmau, J.; da Silva, T.; Da Silva, W.; Della Ricca, G.; De Angelis, A.; De Boer, W.; De Clercq, C.; De Lotto, B.; De Maria, N.; De Min, A.; de Paula, L.; Di Ciaccio, L.; Di Simone, A.; Doroba, K.; Drees, J.; Dris, M.; Eigen, G.; Ekelof, T.; Ellert, M.; Elsing, M.; Espirito Santo, M.C.; Fanourakis, G.; Fassouliotis, D.; Feindt, M.; Fernandez, J.; Ferrer, A.; Ferro, F.; Flagmeyer, U.; Foeth, H.; Fokitis, E.; Fulda-Quenzer, F.; Fuster, J.; Gandelman, M.; Garcia, C.; Gavillet, Ph.; Gazis, Evangelos; Gokieli, R.; Golob, B.; Gomez-Ceballos, G.; Goncalves, P.; Graziani, E.; Grosdidier, G.; Grzelak, K.; Guy, J.; Haag, C.; Hallgren, A.; Hamacher, K.; Hamilton, K.; Haug, S.; Hauler, F.; Hedberg, V.; Hennecke, M.; Herr, H.; Hoffman, J.; Holmgren, S.O.; Holt, P.J.; Houlden, M.A.; Hultqvist, K.; Jackson, John Neil; Jarlskog, G.; Jarry, P.; Jeans, D.; Johansson, Erik Karl; Johansson, P.D.; Jonsson, P.; Joram, C.; Jungermann, L.; Kapusta, Frederic; Katsanevas, S.; Katsoufis, E.; Kernel, G.; Kersevan, B.P.; Kerzel, U.; Kiiskinen, A.; King, B.T.; Kjaer, N.J.; Kluit, P.; Kokkinias, P.; Kourkoumelis, C.; Kouznetsov, O.; Krumstein, Z.; Kucharczyk, M.; Lamsa, J.; Leder, G.; Ledroit, Fabienne; Leinonen, L.; Leitner, R.; Lemonne, J.; Lepeltier, V.; Lesiak, T.; Liebig, W.; Liko, D.; Lipniacka, A.; Lopes, J.H.; Lopez, J.M.; Loukas, D.; Lutz, P.; Lyons, L.; MacNaughton, J.; Malek, A.; Maltezos, S.; Mandl, F.; Marco, J.; Marco, R.; Marechal, B.; Margoni, M.; Marin, J.C.; Mariotti, C.; Markou, A.; Martinez-Rivero, C.; Masik, J.; Mastroyiannopoulos, N.; Matorras, F.; Matteuzzi, C.; Mazzucato, F.; Mazzucato, M.; McNulty, R.; Meroni, C.; Migliore, E.; Mitaroff, W.; Mjoernmark, U.; Moa, T.; Moch, M.; Monig, Klaus; Monge, R.; Montenegro, J.; Moraes, D.; Moreno, S.; Morettini, P.; Mueller, U.; Muenich, K.; Mulders, M.; Mundim, L.; Murray, W.; Muryn, B.; Myatt, G.; Myklebust, T.; Nassiakou, M.; Navarria, F.; Nawrocki, K.; Nicolaidou, R.; Nikolenko, M.; Oblakowska-Mucha, A.; Obraztsov, V.; Olshevski, A.; Onofre, A.; Orava, R.; Osterberg, K.; Ouraou, A.; Oyanguren, A.; Paganoni, M.; Paiano, S.; Palacios, J.P.; Palka, H.; Papadopoulou, Th.D.; Pape, L.; Parkes, C.; Parodi, F.; Parzefall, U.; Passeri, A.; Passon, O.; Peralta, L.; Perepelitsa, V.; Perrotta, A.; Petrolini, A.; Piedra, J.; Pieri, L.; Pierre, F.; Pimenta, M.; Piotto, E.; Podobnik, T.; Poireau, V.; Pol, M.E.; Polok, G.; Poropat, P.; Pozdniakov, V.; Pukhaeva, N.; Pullia, A.; Rames, J.; Ramler, L.; Read, Alexander L.; Rebecchi, P.; Rehn, J.; Reid, D.; Reinhardt, R.; Renton, P.; Richard, F.; Ridky, J.; Rivero, M.; Rodriguez, D.; Romero, A.; Ronchese, P.; Roudeau, P.; Rovelli, T.; Ruhlmann-Kleider, V.; Ryabtchikov, D.; Sadovsky, A.; Salmi, L.; Salt, J.; Savoy-Navarro, A.; Schwickerath, U.; Segar, A.; Sekulin, R.; Siebel, M.; Sisakian, A.; Smadja, G.; Smirnova, O.; Sokolov, A.; Sopczak, A.; Sosnowski, R.; Spassov, T.; Stanitzki, M.; Stocchi, A.; Strauss, J.; Stugu, B.; Szczekowski, M.; Szeptycka, M.; Szumlak, T.; Tabarelli, T.; Taffard, A.C.; Tegenfeldt, F.; Timmermans, Jan; Tkatchev, L.; Tobin, M.; Todorovova, S.; Tome, B.; Tonazzo, A.; Tortosa, P.; Travnicek, P.; Treille, D.; Tristram, G.; Trochimczuk, M.; Troncon, C.; Turluer, M.L.; Tyapkin, I.A.; Tyapkin, P.; Tzamarias, S.; Uvarov, V.; Valenti, G.; Van Dam, Piet; Van Eldik, J.; Van Lysebetten, A.; van Remortel, N.; Van Vulpen, I.; Vegni, G.; Veloso, F.; Venus, W.; Verdier, P.; Verzi, V.; Vilanova, D.; Vitale, L.; Vrba, V.; Wahlen, H.; Washbrook, A.J.; Weiser, C.; Wicke, D.; Wickens, J.; Wilkinson, G.; Winter, M.; Witek, M.; Yushchenko, O.; Zalewska, A.; Zalewski, P.; Zavrtanik, D.; Zhuravlov, V.; Zimine, N.I.; Zintchenko, A.; Zupan, M.

2004-01-01

The DELPHI experiment at the LEP e+e- collider collected almost 700 pb^-1 at centre-of-mass energies above the Z0 mass pole and up to 208 GeV. Those data were used to search for SUSY in the Anomaly Mediated SUSY Breaking (AMSB) scenario with a flavour independent common sfermion mass parameter. The searches covered several possible signatures experimentally accessible at LEP, with either the neutralino, the sneutrino or the stau being the Lightest Supersymmetric Particle (LSP). They included: the search for nearly mass-degenerate chargino and neutralino, which is a typical feature of AMSB; the search for Standard-Model-like or invisibly decaying Higgs boson; the search for stable staus; the search for cascade decays of SUSY particles resulting in the LSP and a low multiplicity final state containing neutrinos. No evidence of a signal was found, and thus constraints were set in the space of the parameters of the model.

Inventory parameters

CERN Document Server

Sharma, Sanjay

2017-01-01

This book provides a detailed overview of various parameters/factors involved in inventory analysis. It especially focuses on the assessment and modeling of basic inventory parameters, namely demand, procurement cost, cycle time, ordering cost, inventory carrying cost, inventory stock, stock out level, and stock out cost. In the context of economic lot size, it provides equations related to the optimum values. It also discusses why the optimum lot size and optimum total relevant cost are considered to be key decision variables, and uses numerous examples to explain each of these inventory parameters separately. Lastly, it provides detailed information on parameter estimation for different sectors/products. Written in a simple and lucid style, it offers a valuable resource for a broad readership, especially Master of Business Administration (MBA) students.

Neutrinoless double beta decay searches with 76Ge

CERN Multimedia

CERN. Geneva

2017-01-01

The search for neutrinoless double beta decay might be the only window to observe lepton number violation. Its observation would favour the leptogenesis mechanism for the explanation of the baryon asymmetry of the universe and is therefore considered to be of highest relevance. The isotope 76Ge has historically been most important for this search and the ongoing experiment GERDA has the lowest background of all experiments in the field. The talk reviews the motivation, the current status of experiments and future programs.

Registering parameters and granules of wave observations: IMAGE RPI success story

Science.gov (United States)

Galkin, I. A.; Charisi, A.; Fung, S. F.; Benson, R. F.; Reinisch, B. W.

2015-12-01

Modern metadata systems strive to help scientists locate data relevant to their research and then retrieve them quickly. Success of this mission depends on the organization and completeness of metadata. Each relevant data resource has to be registered; each content has to be described; each data file has to be accessible. Ultimately, data discoverability is about the practical ability to describe data content and location. Correspondingly, data registration has a "Parameter" level, at which content is specified by listing available observed properties (parameters), and a "Granule" level, at which download links are given to data records (granules). Until recently, both parameter- and granule-level data registrations were accomplished at NASA Virtual System Observatory easily by listing provided parameters and building Granule documents with URLs to the datafile locations, usually those at NASA CDAWeb data warehouse. With the introduction of the Virtual Wave Observatory (VWO), however, the parameter/granule concept faced a scalability challenge. The wave phenomenon content is rich with descriptors of the wave generation, propagation, interaction with propagation media, and observation processes. Additionally, the wave phenomenon content varies from record to record, reflecting changes in the constituent processes, making it necessary to generate granule documents at sub-minute resolution. We will present the first success story of registering 234,178 records of IMAGE Radio Plasma Imager (RPI) plasmagram data and Level 2 derived data products in ESPAS (near-Earth Space Data Infrastructure for e-Science), using the VWO-inspired wave ontology. The granules are arranged in overlapping display and numerical data collections. Display data include (a) auto-prospected plasmagrams of potential interest, (b) interesting plasmagrams annotated by human analysts or software, and (c) spectacular plasmagrams annotated by analysts as publication-quality examples of the RPI science

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

Role of calibration, validation, and relevance in multi-level uncertainty integration

International Nuclear Information System (INIS)

Li, Chenzhao; Mahadevan, Sankaran

2016-01-01

Calibration of model parameters is an essential step in predicting the response of a complicated system, but the lack of data at the system level makes it impossible to conduct this quantification directly. In such a situation, system model parameters are estimated using tests at lower levels of complexity which share the same model parameters with the system. For such a multi-level problem, this paper proposes a methodology to quantify the uncertainty in the system level prediction by integrating calibration, validation and sensitivity analysis at different levels. The proposed approach considers the validity of the models used for parameter estimation at lower levels, as well as the relevance at the lower level to the prediction at the system level. The model validity is evaluated using a model reliability metric, and models with multivariate output are considered. The relevance is quantified by comparing Sobol indices at the lower level and system level, thus measuring the extent to which a lower level test represents the characteristics of the system so that the calibration results can be reliably used in the system level. Finally the results of calibration, validation and relevance analysis are integrated in a roll-up method to predict the system output. - Highlights: • Relevance analysis to quantify the closeness of two models. • Stochastic model reliability metric to integrate multiple validation experiments. • Extend the model reliability metric to deal with multivariate output. • Roll-up formula to integrate calibration, validation, and relevance.

Top-Down Activation of Spatiotopic Sensory Codes in Perceptual and Working Memory Search.

Science.gov (United States)

Kuo, Bo-Cheng; Nobre, Anna Christina; Scerif, Gaia; Astle, Duncan E

2016-07-01

A critical requirement of an efficient cognitive system is the selection and prioritization of relevant information. This occurs when selecting specific items from our sensory inputs, which then receive preferential status at subsequent levels of processing. Many everyday tasks also require us to select internal representations, such as a relevant item from memory. We show that both of these types of search are underpinned by the spatiotopic activation of sensory codes, using both fMRI and MEG data. When individuals searched for perceived and remembered targets, the MEG data highlighted a sensor level electrophysiological effect that reflects the contralateral organization of the visual system-namely, the N2pc. The fMRI data were used to identify a network of frontoparietal areas common to both types of search, as well as the early visual areas activated by the search display. We then combined fMRI and MEG data to explore the temporal dynamics of functional connections between the frontoparietal network and the early visual areas. Searching for a target item resulted in significantly enhanced phase-phase coupling between the frontoparietal network and the visual areas contralateral to the perceived or remembered location of that target. This enhancement of spatially specific phase-phase coupling occurred before the N2pc effect and was significantly associated with it on a trial-by-trial basis. The combination of these two imaging modalities suggests that perceptual and working memory search are underpinned by the synchronization of a frontoparietal network and the relevant sensory cortices.

Effects of Individual Health Topic Familiarity on Activity Patterns During Health Information Searches

Science.gov (United States)

Moriyama, Koichi; Fukui, Ken–ichi; Numao, Masayuki

2015-01-01

Background Non-medical professionals (consumers) are increasingly using the Internet to support their health information needs. However, the cognitive effort required to perform health information searches is affected by the consumer’s familiarity with health topics. Consumers may have different levels of familiarity with individual health topics. This variation in familiarity may cause misunderstandings because the information presented by search engines may not be understood correctly by the consumers. Objective As a first step toward the improvement of the health information search process, we aimed to examine the effects of health topic familiarity on health information search behaviors by identifying the common search activity patterns exhibited by groups of consumers with different levels of familiarity. Methods Each participant completed a health terminology familiarity questionnaire and health information search tasks. The responses to the familiarity questionnaire were used to grade the familiarity of participants with predefined health topics. The search task data were transcribed into a sequence of search activities using a coding scheme. A computational model was constructed from the sequence data using a Markov chain model to identify the common search patterns in each familiarity group. Results Forty participants were classified into L1 (not familiar), L2 (somewhat familiar), and L3 (familiar) groups based on their questionnaire responses. They had different levels of familiarity with four health topics. The video data obtained from all of the participants were transcribed into 4595 search activities (mean 28.7, SD 23.27 per session). The most frequent search activities and transitions in all the familiarity groups were related to evaluations of the relevancy of selected web pages in the retrieval results. However, the next most frequent transitions differed in each group and a chi-squared test confirmed this finding (Pinformation search patterns

Changes of the more relevant PHTS parameters after the cleaning of the steam generators primary side at Embalse nuclear power plant

International Nuclear Information System (INIS)

Moreno, Carlos A.; Coutsiers, Ernesto; Acevedo, Paul; Pomerantz, Marcelo E.

2003-01-01

During the operation of the plant magnetite deposition occurs at the inner walls of Primary Heat Transport System (PHTS). This deposition is particularly significant at the U-tubes of steam generators. The consequence of this is the deterioration of heat transfer to the Secondary System. In order to minimize this impact, during the annual outage of 2000, the steam generators primary side cleaning by the SIVABLAST technique was carried out. This technique consists in blasting the inner walls with tiny stainless steel balls propelled by air at high pressure. This paper presents the change of the more relevant parameters of PHTS after that cleaning. The parameters analyzed and the main results are the following: 1) Inlet header temperature dropped 4.7 C degrees at full power; 2) Exit quality at the outlet headers decreased from 3,5% to 1,5%; 3) Global PHTS flow in single phase evaluated from: a) In-site instrumentation increased 4,6%; b) Thermalhydraulic code NUCIRC 1.0 increased 3,2%; c) measured flows at the instrumented fuel channels increased 4.4%. (author)

Objective parameters for engine noise quality evaluation; Objektive Parameter zur Bewertung der Motorgeraeuschqualitaet

Energy Technology Data Exchange (ETDEWEB)

Graf, Bernhard; Brandl, Stephan [AVL List GmbH, Graz (Austria); Sontacchi, Alois [Univ. fuer Musik und Darstellende Kunst, Graz (Austria). Inst. fuer Elektronische Musik und Akustik; Girstmair, Josef [Kompetenzzentrum Das Virtuelle Fahrzeug, Graz (Austria). Gruppe Antriebsstrang Dynamik und Akustik

2013-06-01

Due to ongoing downsizing efforts and more stringent emission regulations, relevance of sound quality monitoring during engine and vehicle development is strongly increasing. Therefore AVL developed new sound quality parameters like CKI (Combustion Knocking Index) and HI (Harshness Index). Using these parameters sound quality can be objectively monitored, without subjective evaluations, online throughout the complete development process. (orig.)

A Network-Aware Approach for Searching As-You-Type in Social Media (Extended Version)

OpenAIRE

Lagrée, Paul; Cautis, Bogdan; Vahabi, Hossein

2015-01-01

We present in this paper a novel approach for as-you-type top-$k$ keyword search over social media. We adopt a natural "network-aware" interpretation for information relevance, by which information produced by users who are closer to the seeker is considered more relevant. In practice, this query model poses new challenges for effectiveness and efficiency in online search, even when a complete query is given as input in one keystroke. This is mainly because it requires a joint exploration of ...

An advanced search engine for patent analytics in medicinal chemistry.

Science.gov (United States)

Pasche, Emilie; Gobeill, Julien; Teodoro, Douglas; Gaudinat, Arnaud; Vishnykova, Dina; Lovis, Christian; Ruch, Patrick

2012-01-01

Patent collections contain an important amount of medical-related knowledge, but existing tools were reported to lack of useful functionalities. We present here the development of TWINC, an advanced search engine dedicated to patent retrieval in the domain of health and life sciences. Our tool embeds two search modes: an ad hoc search to retrieve relevant patents given a short query and a related patent search to retrieve similar patents given a patent. Both search modes rely on tuning experiments performed during several patent retrieval competitions. Moreover, TWINC is enhanced with interactive modules, such as chemical query expansion, which is of prior importance to cope with various ways of naming biomedical entities. While the related patent search showed promising performances, the ad-hoc search resulted in fairly contrasted results. Nonetheless, TWINC performed well during the Chemathlon task of the PatOlympics competition and experts appreciated its usability.

MuZeeker - Adapting a music search engine for mobile phones

DEFF Research Database (Denmark)

Larsen, Jakob Eg; Halling, Søren Christian; Sigurdsson, Magnus Kristinn

2010-01-01

We describe MuZeeker, a search engine with domain knowledge based on Wikipedia. MuZeeker enables the user to refine a search in multiple steps by means of category selection. In the present version we focus on multimedia search related to music and we present two prototype search applications (web......-based and mobile) and discuss the issues involved in adapting the search engine for mobile phones. A category based filtering approach enables the user to refine a search through relevance feedback by category selection instead of typing additional text, which is hypothesized to be an advantage in the mobile Mu......Zeeker application. We report from two usability experiments using the think aloud protocol, in which N=20 participants performed tasks using MuZeeker and a customized Google search engine. In both experiments web-based and mobile user interfaces were used. The experiment shows that participants are capable...

Memory and visual search in naturalistic 2D and 3D environments.

Science.gov (United States)

Li, Chia-Ling; Aivar, M Pilar; Kit, Dmitry M; Tong, Matthew H; Hayhoe, Mary M

2016-06-01

The role of memory in guiding attention allocation in daily behaviors is not well understood. In experiments with two-dimensional (2D) images, there is mixed evidence about the importance of memory. Because the stimulus context in laboratory experiments and daily behaviors differs extensively, we investigated the role of memory in visual search, in both two-dimensional (2D) and three-dimensional (3D) environments. A 3D immersive virtual apartment composed of two rooms was created, and a parallel 2D visual search experiment composed of snapshots from the 3D environment was developed. Eye movements were tracked in both experiments. Repeated searches for geometric objects were performed to assess the role of spatial memory. Subsequently, subjects searched for realistic context objects to test for incidental learning. Our results show that subjects learned the room-target associations in 3D but less so in 2D. Gaze was increasingly restricted to relevant regions of the room with experience in both settings. Search for local contextual objects, however, was not facilitated by early experience. Incidental fixations to context objects do not necessarily benefit search performance. Together, these results demonstrate that memory for global aspects of the environment guides search by restricting allocation of attention to likely regions, whereas task relevance determines what is learned from the active search experience. Behaviors in 2D and 3D environments are comparable, although there is greater use of memory in 3D.

What Major Search Engines Like Google, Yahoo and Bing Need to Know about Teachers in the UK?

Science.gov (United States)

Seyedarabi, Faezeh

2014-01-01

This article briefly outlines the current major search engines' approach to teachers' web searching. The aim of this article is to make Web searching easier for teachers when searching for relevant online teaching materials, in general, and UK teacher practitioners at primary, secondary and post-compulsory levels, in particular. Therefore, major…

Optimizing the search for transiting planets in long time series

Science.gov (United States)

Ofir, Aviv

2014-01-01

Context. Transit surveys, both ground- and space-based, have already accumulated a large number of light curves that span several years. Aims: The search for transiting planets in these long time series is computationally intensive. We wish to optimize the search for both detection and computational efficiencies. Methods: We assume that the searched systems can be described well by Keplerian orbits. We then propagate the effects of different system parameters to the detection parameters. Results: We show that the frequency information content of the light curve is primarily determined by the duty cycle of the transit signal, and thus the optimal frequency sampling is found to be cubic and not linear. Further optimization is achieved by considering duty-cycle dependent binning of the phased light curve. By using the (standard) BLS, one is either fairly insensitive to long-period planets or less sensitive to short-period planets and computationally slower by a significant factor of ~330 (for a 3 yr long dataset). We also show how the physical system parameters, such as the host star's size and mass, directly affect transit detection. This understanding can then be used to optimize the search for every star individually. Conclusions: By considering Keplerian dynamics explicitly rather than implicitly one can optimally search the BLS parameter space. The presented Optimal BLS enhances the detectability of both very short and very long period planets, while allowing such searches to be done with much reduced resources and time. The Matlab/Octave source code for Optimal BLS is made available. The MATLAB code is only available at the CDS via anonymous ftp to http://cdsarc.u-strasbg.fr (ftp://130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/561/A138

Sequence heterogeneity accelerates protein search for targets on DNA

International Nuclear Information System (INIS)

Shvets, Alexey A.; Kolomeisky, Anatoly B.

2015-01-01

The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome

Sequence heterogeneity accelerates protein search for targets on DNA

Energy Technology Data Exchange (ETDEWEB)

Shvets, Alexey A.; Kolomeisky, Anatoly B., E-mail: tolya@rice.edu [Department of Chemistry and Center for Theoretical Biological Physics, Rice University, Houston, Texas 77005 (United States)

2015-12-28

The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome.

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

MDTS: automatic complex materials design using Monte Carlo tree search

Science.gov (United States)

Dieb, Thaer M.; Ju, Shenghong; Yoshizoe, Kazuki; Hou, Zhufeng; Shiomi, Junichiro; Tsuda, Koji

2017-12-01

Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters appropriately, MDTS has no tuning parameters and works autonomously in various problems. In comparison to a Bayesian optimization package, our algorithm showed competitive search efficiency and superior scalability. We succeeded in designing large Silicon-Germanium (Si-Ge) alloy structures that Bayesian optimization could not deal with due to excessive computational cost. MDTS is available at https://github.com/tsudalab/MDTS.

Advanced language modeling approaches, case study: Expert search

NARCIS (Netherlands)

Hiemstra, Djoerd

2008-01-01

This tutorial gives a clear and detailed overview of advanced language modeling approaches and tools, including the use of document priors, translation models, relevance models, parsimonious models and expectation maximization training. Expert search will be used as a case study to explain the

Program for searching for semiempirical parameters by the MNDO method

International Nuclear Information System (INIS)

Bliznyuk, A.A.; Voityuk, A.A.

1987-01-01

The authors describe an program for optimizing atomic models constructed using the MNDO method which varies not only the parameters but also the scope for simple changes in the calculation scheme. The target function determines properties such as formation enthalpies, dipole moments, ionization potentials, and geometrical parameters. Software used to minimize the target function is based on the simplex method on the Nelder-Mead algorithm and on the Fletcher variable-metric method. The program is written in FORTRAN IV and implemented on the ES computer

Searching for religion and mental health studies required health, social science, and grey literature databases.

Science.gov (United States)

Wright, Judy M; Cottrell, David J; Mir, Ghazala

2014-07-01

To determine the optimal databases to search for studies of faith-sensitive interventions for treating depression. We examined 23 health, social science, religious, and grey literature databases searched for an evidence synthesis. Databases were prioritized by yield of (1) search results, (2) potentially relevant references identified during screening, (3) included references contained in the synthesis, and (4) included references that were available in the database. We assessed the impact of databases beyond MEDLINE, EMBASE, and PsycINFO by their ability to supply studies identifying new themes and issues. We identified pragmatic workload factors that influence database selection. PsycINFO was the best performing database within all priority lists. ArabPsyNet, CINAHL, Dissertations and Theses, EMBASE, Global Health, Health Management Information Consortium, MEDLINE, PsycINFO, and Sociological Abstracts were essential for our searches to retrieve the included references. Citation tracking activities and the personal library of one of the research teams made significant contributions of unique, relevant references. Religion studies databases (Am Theo Lib Assoc, FRANCIS) did not provide unique, relevant references. Literature searches for reviews and evidence syntheses of religion and health studies should include social science, grey literature, non-Western databases, personal libraries, and citation tracking activities. Copyright © 2014 Elsevier Inc. All rights reserved.

New Physics searches in Heavy Flavor with ATLAS

CERN Document Server

Dearnaley, W; The ATLAS collaboration

2013-01-01

Precision determinations of the flavor sector allow the search for indirect new physics signatures. At the forefront of these studies are the determinations of interference of new physics with known Df=1 and Df=2 processes. The ATLAS collaboration explores this area with competitive results measuring the CP violating phase phi_s from Bs->J/Psi phi decays and investigating rare B decays with dileptons in the final state. The latest ATLAS results relevant for new physics searches in the heavy flavor sector will be discussed.

Searching for galactic white-dwarf binaries in mock LISA data using an F-statistic template bank

International Nuclear Information System (INIS)

Whelan, John T; Prix, Reinhard; Khurana, Deepak

2010-01-01

We describe an F-statistic search for continuous gravitational waves from galactic white-dwarf binaries in simulated LISA data. Our search method employs a hierarchical template-grid-based exploration of the parameter space. In the first stage, candidate sources are identified in searches using different simulated laser signal combinations (known as TDI variables). Since each source generates a primary maximum near its true 'Doppler parameters' (intrinsic frequency and sky position) as well as numerous secondary maxima of the F-statistic in Doppler parameter space, a search for multiple sources needs to distinguish between true signals and secondary maxima associated with other 'louder' signals. Our method does this by applying a coincidence test to reject candidates which are not found at nearby parameter space positions in searches using each of the three TDI variables. For signals surviving the coincidence test, we perform a fully coherent search over a refined parameter grid to provide an accurate parameter estimation for the final candidates. Suitably tuned, the pipeline is able to extract 1989 true signals with only 5 false alarms. The use of the rigid adiabatic approximation allows recovery of signal parameters with errors comparable to statistical expectations, although there is still some systematic excess with respect to statistical errors expected from Gaussian noise. An experimental iterative pipeline with seven rounds of signal subtraction and reanalysis of the residuals allows us to increase the number of signals recovered to a total of 3419 with 29 false alarms.

Searching for galactic white-dwarf binaries in mock LISA data using an F-statistic template bank

Energy Technology Data Exchange (ETDEWEB)

Whelan, John T [Center for Computational Relativity and Gravitation, School of Mathematical Sciences, Rochester Institute of Technology, 85 Lomb Memorial Drive, Rochester, NY 14623 (United States); Prix, Reinhard [Max-Planck-Institut fuer Gravitationsphysik (Albert-Einstein-Institut), D-30167 Hannover (Germany); Khurana, Deepak, E-mail: john.whelan@astro.rit.ed, E-mail: reinhard.prix@aei.mpg.d [Indian Institute of Technology, Kharagpur, West Bengal 721302 (India)

2010-03-07

We describe an F-statistic search for continuous gravitational waves from galactic white-dwarf binaries in simulated LISA data. Our search method employs a hierarchical template-grid-based exploration of the parameter space. In the first stage, candidate sources are identified in searches using different simulated laser signal combinations (known as TDI variables). Since each source generates a primary maximum near its true 'Doppler parameters' (intrinsic frequency and sky position) as well as numerous secondary maxima of the F-statistic in Doppler parameter space, a search for multiple sources needs to distinguish between true signals and secondary maxima associated with other 'louder' signals. Our method does this by applying a coincidence test to reject candidates which are not found at nearby parameter space positions in searches using each of the three TDI variables. For signals surviving the coincidence test, we perform a fully coherent search over a refined parameter grid to provide an accurate parameter estimation for the final candidates. Suitably tuned, the pipeline is able to extract 1989 true signals with only 5 false alarms. The use of the rigid adiabatic approximation allows recovery of signal parameters with errors comparable to statistical expectations, although there is still some systematic excess with respect to statistical errors expected from Gaussian noise. An experimental iterative pipeline with seven rounds of signal subtraction and reanalysis of the residuals allows us to increase the number of signals recovered to a total of 3419 with 29 false alarms.

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

Using PubMed search strings for efficient retrieval of manual therapy research literature.

Science.gov (United States)

Pillastrini, Paolo; Vanti, Carla; Curti, Stefania; Mattioli, Stefano; Ferrari, Silvano; Violante, Francesco Saverio; Guccione, Andrew

2015-02-01

The aim of this study was to construct PubMed search strings that could efficiently retrieve studies on manual therapy (MT), especially for time-constrained clinicians. Our experts chose 11 Medical Subject Heading terms describing MT along with 84 additional potential terms. For each term that was able to retrieve more than 100 abstracts, we systematically extracted a sample of abstracts from which we estimated the proportion of studies potentially relevant to MT. We then constructed 2 search strings: 1 narrow (threshold of pertinent articles ≥40%) and 1 expanded (including all terms for which a proportion had been calculated). We tested these search strings against articles on 2 conditions relevant to MT (thoracic and temporomandibular pain). We calculated the number of abstracts needed to read (NNR) to identify 1 potentially pertinent article in the context of these conditions. Finally, we evaluated the efficiency of the proposed PubMed search strings to identify relevant articles included in a systematic review on spinal manipulative therapy for chronic low back pain. Fifty-five search terms were able to extract more than 100 citations. The NNR to find 1 potentially pertinent article using the narrow string was 1.2 for thoracic pain and 1.3 for temporomandibular pain, and the NNR for the expanded string was 1.9 and 1.6, respectively. The narrow search strategy retrieved all the randomized controlled trials included in the systematic review selected for comparison. The proposed PubMed search strings may help health care professionals locate potentially pertinent articles and review a large number of MT studies efficiently to better implement evidence-based practice. Copyright © 2015 National University of Health Sciences. Published by Elsevier Inc. All rights reserved.

Publish or perish: remaining academically relevant and visible in the ...

African Journals Online (AJOL)

To improve the visibility of scholars' works and make them relevant on the academic scene, electronic publishing will be advisable. This provides the potential to readers to search and locate the ar ticles at minimum time within one journal or across multiple journals. This includes publishing articles in journals that are ...

Challenges for MSSM Higgs searches at hadron colliders

Energy Technology Data Exchange (ETDEWEB)

Carena, Marcela S.; /Fermilab; Menon, A.; /Argonne /Chicago U., EFI; Wagner, C.E.M.; /Argonne /Chicago U., EFI /KICP, Chicago /Chicago U.

2007-04-01

In this article we analyze the impact of B-physics and Higgs physics at LEP on standard and non-standard Higgs bosons searches at the Tevatron and the LHC, within the framework of minimal flavor violating supersymmetric models. The B-physics constraints we consider come from the experimental measurements of the rare B-decays b {yields} s{gamma} and B{sub u} {yields} {tau}{nu} and the experimental limit on the B{sub s} {yields} {mu}{sup +}{mu}{sup -} branching ratio. We show that these constraints are severe for large values of the trilinear soft breaking parameter A{sub t}, rendering the non-standard Higgs searches at hadron colliders less promising. On the contrary these bounds are relaxed for small values of A{sub t} and large values of the Higgsino mass parameter {mu}, enhancing the prospects for the direct detection of non-standard Higgs bosons at both colliders. We also consider the available ATLAS and CMS projected sensitivities in the standard model Higgs search channels, and we discuss the LHC's ability in probing the whole MSSM parameter space. In addition we also consider the expected Tevatron collider sensitivities in the standard model Higgs h {yields} b{bar b} channel to show that it may be able to find 3 {sigma} evidence in the B-physics allowed regions for small or moderate values of the stop mixing parameter.

A search for optimal parameters of resonance circuits ensuring damping of electroelastic structure vibrations based on the solution of natural vibration problem

Science.gov (United States)

Oshmarin, D.; Sevodina, N.; Iurlov, M.; Iurlova, N.

2017-06-01

In this paper, with the aim of providing passive control of structure vibrations a new approach has been proposed for selecting optimal parameters of external electric shunt circuits connected to piezoelectric elements located on the surface of the structure. The approach is based on the mathematical formulation of the natural vibration problem. The results of solution of this problem are the complex eigenfrequencies, the real part of which represents the vibration frequency and the imaginary part corresponds to the damping ratio, characterizing the rate of damping. A criterion of search for optimal parameters of the external passive shunt circuits, which can provide the system with desired dissipative properties, has been derived based on the analysis of responses of the real and imaginary parts of different complex eigenfrequencies to changes in the values of the parameters of the electric circuit. The efficiency of this approach has been verified in the context of natural vibration problem of rigidly clamped plate and semi-cylindrical shell, which is solved for series-connected and parallel -connected external resonance (consisting of resistive and inductive elements) R-L circuits. It has been shown that at lower (more energy-intensive) frequencies, a series-connected external circuit has the advantage of providing lower values of the circuit parameters, which renders it more attractive in terms of practical applications.

How to Select the most Relevant Roughness Parameters of a Surface: Methodology Research Strategy

Science.gov (United States)

Bobrovskij, I. N.

2018-01-01

In this paper, the foundations for new methodology creation which provides solving problem of surfaces structure new standards parameters huge amount conflicted with necessary actual floors quantity of surfaces structure parameters which is related to measurement complexity decreasing are considered. At the moment, there is no single assessment of the importance of a parameters. The approval of presented methodology for aerospace cluster components surfaces allows to create necessary foundation, to develop scientific estimation of surfaces texture parameters, to obtain material for investigators of chosen technological procedure. The methods necessary for further work, the creation of a fundamental reserve and development as a scientific direction for assessing the significance of microgeometry parameters are selected.

Search for new physics in events with a leptonically decaying Z boson and a large transverse momentum imbalance in proton-proton collisions at √{s} = 13 {TeV}

Science.gov (United States)

Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Ambrogi, F.; Asilar, E.; Bergauer, T.; Brandstetter, J.; Brondolin, E.; Dragicevic, M.; Erö, J.; Del Valle, A. Escalante; Flechl, M.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Grossmann, J.; Hrubec, J.; Jeitler, M.; König, A.; Krammer, N.; Krätschmer, I.; Liko, D.; Madlener, T.; Mikulec, I.; Pree, E.; Rad, N.; Rohringer, H.; Schieck, J.; Schöfbeck, R.; Spanring, M.; Spitzbart, D.; Waltenberger, W.; Wittmann, J.; Wulz, C.-E.; Zarucki, M.; Chekhovsky, V.; Mossolov, V.; Gonzalez, J. Suarez; De Wolf, E. A.; Di Croce, D.; Janssen, X.; Lauwers, J.; Van De Klundert, M.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Abu Zeid, S.; Blekman, F.; D'Hondt, J.; De Bruyn, I.; De Clercq, J.; Deroover, K.; Flouris, G.; Lontkovskyi, D.; Lowette, S.; Marchesini, I.; Moortgat, S.; Moreels, L.; Python, Q.; Skovpen, K.; Tavernier, S.; Van Doninck, W.; Van Mulders, P.; Van Parijs, I.; Beghin, D.; Bilin, B.; Brun, H.; Clerbaux, B.; De Lentdecker, G.; Delannoy, H.; Dorney, B.; Fasanella, G.; Favart, L.; Goldouzian, R.; Grebenyuk, A.; Kalsi, A. K.; Lenzi, T.; Luetic, J.; Maerschalk, T.; Marinov, A.; Seva, T.; Starling, E.; Vander Velde, C.; Vanlaer, P.; Vannerom, D.; Yonamine, R.; Zenoni, F.; Cornelis, T.; Dobur, D.; Fagot, A.; Gul, M.; Khvastunov, I.; Poyraz, D.; Roskas, C.; Salva, S.; Tytgat, M.; Verbeke, W.; Zaganidis, N.; Bakhshiansohi, H.; Bondu, O.; Brochet, S.; Bruno, G.; Caputo, C.; Caudron, A.; David, P.; De Visscher, S.; Delaere, C.; Delcourt, M.; Francois, B.; Giammanco, A.; Komm, M.; Krintiras, G.; Lemaitre, V.; Magitteri, A.; Mertens, A.; Musich, M.; Piotrzkowski, K.; Quertenmont, L.; Saggio, A.; Vidal Marono, M.; Wertz, S.; Zobec, J.; Aldá Júnior, W. L.; Alves, F. L.; Alves, G. A.; Brito, L.; Martins Junior, M. Correa; Hensel, C.; Moraes, A.; Pol, M. E.; Rebello Teles, P.; Chagas, E. Belchior Batista Das; Carvalho, W.; Chinellato, J.; Coelho, E.; Da Costa, E. M.; Da Silveira, G. G.; De Jesus Damiao, D.; De Souza, S. Fonseca; Guativa, L. M. Huertas; Malbouisson, H.; De Almeida, M. Melo; Herrera, C. Mora; Mundim, L.; Nogima, H.; Rosas, L. J. Sanchez; Santoro, A.; Sznajder, A.; Thiel, M.; Manganote, E. J. Tonelli; De Araujo, F. Torres Da Silva; Pereira, A. Vilela; Ahuja, S.; Bernardes, C. A.; Tomei, T. R. Fernandez Perez; Gregores, E. M.; Mercadante, P. G.; Novaes, S. F.; Padula, Sandra S.; Abad, D. Romero; Vargas, J. C. Ruiz; Aleksandrov, A.; Hadjiiska, R.; Iaydjiev, P.; Misheva, M.; Rodozov, M.; Shopova, S.; Sultanov, G.; Dimitrov, A.; Litov, L.; Pavlov, B.; Petkov, P.; Fang, W.; Gao, X.; Yuan, L.; Ahmad, M.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Chen, M.; Chen, Y.; Jiang, C. H.; Leggat, D.; Liao, H.; Liu, Z.; Romeo, F.; Shaheen, S. M.; Spiezia, A.; Tao, J.; Wang, C.; Wang, Z.; Yazgan, E.; Zhang, H.; Zhang, S.; Zhao, J.; Ban, Y.; Chen, G.; Li, J.; Li, Q.; Liu, S.; Mao, Y.; Qian, S. J.; Wang, D.; Xu, Z.; Zhang, F.; Wang, Y.; Avila, C.; Cabrera, A.; Sierra, L. F. Chaparro; Florez, C.; Hernández, C. F. González; Alvarez, J. D. Ruiz; Delgado, M. A. Segura; Courbon, B.; Godinovic, N.; Lelas, D.; Puljak, I.; Cipriano, P. M. Ribeiro; Sculac, T.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Ferencek, D.; Kadija, K.; Mesic, B.; Starodumov, A.; Susa, T.; Ather, M. W.; Attikis, A.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Rykaczewski, H.; Finger, M.; Finger, M.; Jarrin, E. Carrera; Assran, Y.; Elgammal, S.; Mahrous, A.; Dewanjee, R. K.; Kadastik, M.; Perrini, L.; Raidal, M.; Tiko, A.; Veelken, C.; Eerola, P.; Kirschenmann, H.; Pekkanen, J.; Voutilainen, M.; Havukainen, J.; Heikkilä, J. K.; Järvinen, T.; Karimäki, V.; Kinnunen, R.; Lampén, T.; Lassila-Perini, K.; Laurila, S.; Lehti, S.; Lindén, T.; Luukka, P.; Siikonen, H.; Tuominen, E.; Tuominiemi, J.; Tuuva, T.; Besancon, M.; Couderc, F.; Dejardin, M.; Denegri, D.; Faure, J. L.; Ferri, F.; Ganjour, S.; Ghosh, S.; Gras, P.; de Monchenault, G. Hamel; Jarry, P.; Kucher, I.; Leloup, C.; Locci, E.; Machet, M.; Malcles, J.; Negro, G.; Rander, J.; Rosowsky, A.; Sahin, M. Ö.; Titov, M.; Abdulsalam, A.; Amendola, C.; Antropov, I.; Baffioni, S.; Beaudette, F.; Busson, P.; Cadamuro, L.; Charlot, C.; de Cassagnac, R. Granier; Jo, M.; Lisniak, S.; Lobanov, A.; Blanco, J. Martin; Nguyen, M.; Ochando, C.; Ortona, G.; Paganini, P.; Pigard, P.; Salerno, R.; Sauvan, J. B.; Sirois, Y.; Leiton, A. G. Stahl; Strebler, T.; Yilmaz, Y.; Zabi, A.; Zghiche, A.; Agram, J.-L.; Andrea, J.; Bloch, D.; Brom, J.-M.; Buttignol, M.; Chabert, E. C.; Chanon, N.; Collard, C.; Conte, E.; Coubez, X.; Fontaine, J.-C.; Gelé, D.; Goerlach, U.; Jansová, M.; Bihan, A.-C. Le; Tonon, N.; Van Hove, P.; Gadrat, S.; Beauceron, S.; Bernet, C.; Boudoul, G.; Chierici, R.; Contardo, D.; Depasse, P.; El Mamouni, H.; Fay, J.; Finco, L.; Gascon, S.; Gouzevitch, M.; Grenier, G.; Ille, B.; Lagarde, F.; Laktineh, I. B.; Lethuillier, M.; Mirabito, L.; Pequegnot, A. L.; Perries, S.; Popov, A.; Sordini, V.; Vander Donckt, M.; Viret, S.; Khvedelidze, A.; Lomidze, D.; Autermann, C.; Feld, L.; Kiesel, M. K.; Klein, K.; Lipinski, M.; Preuten, M.; Schomakers, C.; Schulz, J.; Teroerde, M.; Zhukov, V.; Albert, A.; Dietz-Laursonn, E.; Duchardt, D.; Endres, M.; Erdmann, M.; Erdweg, S.; Esch, T.; Fischer, R.; Güth, A.; Hamer, M.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Knutzen, S.; Merschmeyer, M.; Meyer, A.; Millet, P.; Mukherjee, S.; Pook, T.; Radziej, M.; Reithler, H.; Rieger, M.; Scheuch, F.; Teyssier, D.; Thüer, S.; Flügge, G.; Kargoll, B.; Kress, T.; Künsken, A.; Müller, T.; Nehrkorn, A.; Nowack, A.; Pistone, C.; Pooth, O.; Stahl, A.; Martin, M. Aldaya; Arndt, T.; Asawatangtrakuldee, C.; Beernaert, K.; Behnke, O.; Behrens, U.; Martínez, A. Bermúdez; Bin Anuar, A. A.; Borras, K.; Botta, V.; Campbell, A.; Connor, P.; Contreras-Campana, C.; Costanza, F.; Pardos, C. Diez; Eckerlin, G.; Eckstein, D.; Eichhorn, T.; Eren, E.; Gallo, E.; Garcia, J. Garay; Geiser, A.; Luyando, J. M. Grados; Grohsjean, A.; Gunnellini, P.; Guthoff, M.; Harb, A.; Hauk, J.; Hempel, M.; Jung, H.; Kasem, A.; Kasemann, M.; Keaveney, J.; Kleinwort, C.; Korol, I.; Krücker, D.; Lange, W.; Lelek, A.; Lenz, T.; Leonard, J.; Lipka, K.; Lohmann, W.; Mankel, R.; Melzer-Pellmann, I.-A.; Meyer, A. B.; Mittag, G.; Mnich, J.; Mussgiller, A.; Ntomari, E.; Pitzl, D.; Raspereza, A.; Savitskyi, M.; Saxena, P.; Shevchenko, R.; Stefaniuk, N.; Van Onsem, G. P.; Walsh, R.; Wen, Y.; Wichmann, K.; Wissing, C.; Zenaiev, O.; Aggleton, R.; Bein, S.; Blobel, V.; Vignali, M. Centis; Dreyer, T.; Garutti, E.; Gonzalez, D.; Haller, J.; Hinzmann, A.; Hoffmann, M.; Karavdina, A.; Klanner, R.; Kogler, R.; Kovalchuk, N.; Kurz, S.; Lapsien, T.; Marconi, D.; Meyer, M.; Niedziela, M.; Nowatschin, D.; Pantaleo, F.; Peiffer, T.; Perieanu, A.; Scharf, C.; Schleper, P.; Schmidt, A.; Schumann, S.; Schwandt, J.; Sonneveld, J.; Stadie, H.; Steinbrück, G.; Stober, F. M.; Stöver, M.; Tholen, H.; Troendle, D.; Usai, E.; Vanhoefer, A.; Vormwald, B.; Akbiyik, M.; Barth, C.; Baselga, M.; Baur, S.; Butz, E.; Caspart, R.; Chwalek, T.; Colombo, F.; De Boer, W.; Dierlamm, A.; Faltermann, N.; Freund, B.; Friese, R.; Giffels, M.; Harrendorf, M. A.; Hartmann, F.; Heindl, S. M.; Husemann, U.; Kassel, F.; Kudella, S.; Mildner, H.; Mozer, M. U.; Müller, Th.; Plagge, M.; Quast, G.; Rabbertz, K.; Schröder, M.; Shvetsov, I.; Sieber, G.; Simonis, H. J.; Ulrich, R.; Wayand, S.; Weber, M.; Weiler, T.; Williamson, S.; Wöhrmann, C.; Wolf, R.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Kyriakis, A.; Loukas, D.; Topsis-Giotis, I.; Karathanasis, G.; Kesisoglou, S.; Panagiotou, A.; Saoulidou, N.; Kousouris, K.; Evangelou, I.; Foudas, C.; Gianneios, P.; Katsoulis, P.; Kokkas, P.; Mallios, S.; Manthos, N.; Papadopoulos, I.; Paradas, E.; Strologas, J.; Triantis, F. A.; Tsitsonis, D.; Csanad, M.; Filipovic, N.; Pasztor, G.; Surányi, O.; Veres, G. I.; Bencze, G.; Hajdu, C.; Horvath, D.; Hunyadi, Á.; Sikler, F.; Veszpremi, V.; Beni, N.; Czellar, S.; Karancsi, J.; Makovec, A.; Molnar, J.; Szillasi, Z.; Bartók, M.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Choudhury, S.; Komaragiri, J. R.; Bahinipati, S.; Bhowmik, S.; Mal, P.; Mandal, K.; Nayak, A.; Sahoo, D. K.; Sahoo, N.; Swain, S. K.; Bansal, S.; Beri, S. B.; Bhatnagar, V.; Chawla, R.; Dhingra, N.; Kaur, A.; Kaur, M.; Kaur, S.; Kumar, R.; Kumari, P.; Mehta, A.; Singh, J. B.; Walia, G.; Kumar, Ashok; Shah, Aashaq; Bhardwaj, A.; Chauhan, S.; Choudhary, B. C.; Garg, R. B.; Keshri, S.; Kumar, A.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, R.; Bhardwaj, R.; Bhattacharya, R.; Bhattacharya, S.; Bhawandeep, U.; Dey, S.; Dutt, S.; Dutta, S.; Ghosh, S.; Majumdar, N.; Modak, A.; Mondal, K.; Mukhopadhyay, S.; Nandan, S.; Purohit, A.; Roy, A.; Roy Chowdhury, S.; Sarkar, S.; Sharan, M.; Thakur, S.; Behera, P. K.; Chudasama, R.; Dutta, D.; Jha, V.; Kumar, V.; Mohanty, A. K.; Netrakanti, P. K.; Pant, L. M.; Shukla, P.; Topkar, A.; Aziz, T.; Dugad, S.; Mahakud, B.; Mitra, S.; Mohanty, G. B.; Sur, N.; Sutar, B.; Banerjee, S.; Bhattacharya, S.; Chatterjee, S.; Das, P.; Guchait, M.; Jain, Sa.; Kumar, S.; Maity, M.; Majumder, G.; Mazumdar, K.; Sarkar, T.; Wickramage, N.; Chauhan, S.; Dube, S.; Hegde, V.; Kapoor, A.; Kothekar, K.; Pandey, S.; Rane, A.; Sharma, S.; Chenarani, S.; Tadavani, E. Eskandari; Etesami, S. M.; Khakzad, M.; Najafabadi, M. Mohammadi; Naseri, M.; Mehdiabadi, S. Paktinat; Hosseinabadi, F. Rezaei; Safarzadeh, B.; Zeinali, M.; Felcini, M.; Grunewald, M.; Abbrescia, M.; Calabria, C.; Colaleo, A.; Creanza, D.; Cristella, L.; De Filippis, N.; De Palma, M.; Errico, F.; Fiore, L.; Iaselli, G.; Lezki, S.; Maggi, G.; Maggi, M.; Miniello, G.; My, S.; Nuzzo, S.; Pompili, A.; Pugliese, G.; Radogna, R.; Ranieri, A.; Selvaggi, G.; Sharma, A.; Silvestris, L.; Venditti, R.; Verwilligen, P.; Abbiendi, G.; Battilana, C.; Bonacorsi, D.; Borgonovi, L.; Braibant-Giacomelli, S.; Campanini, R.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Chhibra, S. S.; Codispoti, G.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Grandi, C.; Guiducci, L.; Marcellini, S.; Masetti, G.; Montanari, A.; Navarria, F. L.; Perrotta, A.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Albergo, S.; Costa, S.; Di Mattia, A.; Giordano, F.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Chatterjee, K.; Ciulli, V.; Civinini, C.; D'Alessandro, R.; Focardi, E.; Lenzi, P.; Meschini, M.; Paoletti, S.; Russo, L.; Sguazzoni, G.; Strom, D.; Viliani, L.; Benussi, L.; Bianco, S.; Fabbri, F.; Piccolo, D.; Primavera, F.; Calvelli, V.; Ferro, F.; Ravera, F.; Robutti, E.; Tosi, S.; Benaglia, A.; Beschi, A.; Brianza, L.; Brivio, F.; Ciriolo, V.; Dinardo, M. E.; Fiorendi, S.; Gennai, S.; Ghezzi, A.; Govoni, P.; Malberti, M.; Malvezzi, S.; Manzoni, R. A.; Menasce, D.; Moroni, L.; Paganoni, M.; Pauwels, K.; Pedrini, D.; Pigazzini, S.; Ragazzi, S.; de Fatis, T. Tabarelli; Buontempo, S.; Cavallo, N.; Di Guida, S.; Fabozzi, F.; Fienga, F.; Iorio, A. O. M.; Khan, W. A.; Lista, L.; Meola, S.; Paolucci, P.; Sciacca, C.; Thyssen, F.; Azzi, P.; Bacchetta, N.; Benato, L.; Bisello, D.; Boletti, A.; De Oliveira, A. Carvalho Antunes; Checchia, P.; Dall'Osso, M.; De Castro Manzano, P.; Dorigo, T.; Dosselli, U.; Gasparini, F.; Gasparini, U.; Gozzelino, A.; Lacaprara, S.; Lujan, P.; Margoni, M.; Meneguzzo, A. T.; Pozzobon, N.; Ronchese, P.; Rossin, R.; Simonetto, F.; Torassa, E.; Zanetti, M.; Zotto, P.; Zumerle, G.; Braghieri, A.; Magnani, A.; Montagna, P.; Ratti, S. P.; Re, V.; Ressegotti, M.; Riccardi, C.; Salvini, P.; Vai, I.; Vitulo, P.; Solestizi, L. Alunni; Biasini, M.; Bilei, G. M.; Cecchi, C.; Ciangottini, D.; Fanò, L.; Leonardi, R.; Manoni, E.; Mantovani, G.; Mariani, V.; Menichelli, M.; Rossi, A.; Santocchia, A.; Spiga, D.; Androsov, K.; Azzurri, P.; Bagliesi, G.; Boccali, T.; Borrello, L.; Castaldi, R.; Ciocci, M. A.; Dell'Orso, R.; Fedi, G.; Giannini, L.; Giassi, A.; Grippo, M. T.; Ligabue, F.; Lomtadze, T.; Manca, E.; Mandorli, G.; Messineo, A.; Palla, F.; Rizzi, A.; Savoy-Navarro, A.; Spagnolo, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; Cipriani, M.; Daci, N.; Del Re, D.; Di Marco, E.; Diemoz, M.; Gelli, S.; Longo, E.; Margaroli, F.; Marzocchi, B.; Meridiani, P.; Organtini, G.; Paramatti, R.; Preiato, F.; Rahatlou, S.; Rovelli, C.; Santanastasio, F.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Bartosik, N.; Bellan, R.; Biino, C.; Cartiglia, N.; Cenna, F.; Costa, M.; Covarelli, R.; Degano, A.; Demaria, N.; Kiani, B.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Monteil, E.; Monteno, M.; Obertino, M. M.; Pacher, L.; Pastrone, N.; Pelliccioni, M.; Angioni, G. L. Pinna; Romero, A.; Ruspa, M.; Sacchi, R.; Shchelina, K.; Sola, V.; Solano, A.; Staiano, A.; Traczyk, P.; Belforte, S.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Zanetti, A.; Kim, D. H.; Kim, G. N.; Kim, M. S.; Lee, J.; Lee, S.; Lee, S. W.; Moon, C. S.; Oh, Y. D.; Sekmen, S.; Son, D. C.; Yang, Y. C.; Lee, A.; Kim, H.; Moon, D. H.; Oh, G.; Cifuentes, J. A. Brochero; Goh, J.; Kim, T. J.; Cho, S.; Choi, S.; Go, Y.; Gyun, D.; Ha, S.; Hong, B.; Jo, Y.; Kim, Y.; Lee, K.; Lee, K. S.; Lee, S.; Lim, J.; Park, S. K.; Roh, Y.; Almond, J.; Kim, J.; Kim, J. S.; Lee, H.; Lee, K.; Nam, K.; Oh, S. B.; Radburn-Smith, B. C.; Seo, S. h.; Yang, U. K.; Yoo, H. D.; Yu, G. B.; Kim, H.; Kim, J. H.; Lee, J. S. H.; Park, I. C.; Choi, Y.; Hwang, C.; Lee, J.; Yu, I.; Dudenas, V.; Juodagalvis, A.; Vaitkus, J.; Ahmed, I.; Ibrahim, Z. A.; Ali, M. A. B. Md; Idris, F. Mohamad; Abdullah, W. A. T. Wan; Yusli, M. N.; Zolkapli, Z.; Reyes-Almanza, R.; Ramirez-Sanchez, G.; Duran-Osuna, M. C.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-De La Cruz, I.; Rabadan-Trejo, R. I.; Lopez-Fernandez, R.; Guisao, J. Mejia; Sanchez-Hernandez, A.; Moreno, S. Carrillo; Barrera, C. Oropeza; Valencia, F. Vazquez; Eysermans, J.; Pedraza, I.; Ibarguen, H. A. Salazar; Estrada, C. Uribe; Pineda, A. Morelos; Krofcheck, D.; Butler, P. H.; Ahmad, A.; Ahmad, M.; Hassan, Q.; Hoorani, H. R.; Saddique, A.; Shah, M. A.; Shoaib, M.; Waqas, M.; Bialkowska, H.; Bluj, M.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Szleper, M.; Zalewski, P.; Bunkowski, K.; Byszuk, A.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Olszewski, M.; Pyskir, A.; Walczak, M.; Bargassa, P.; Da Cruz E. Silva, C. Beirão; Di Francesco, A.; Faccioli, P.; Galinhas, B.; Gallinaro, M.; Hollar, J.; Leonardo, N.; Iglesias, L. Lloret; Nemallapudi, M. V.; Seixas, J.; Strong, G.; Toldaiev, O.; Vadruccio, D.; Varela, J.; Afanasiev, S.; Golunov, A.; Golutvin, I.; Gorbounov, N.; Kamenev, A.; Karjavin, V.; Lanev, A.; Malakhov, A.; Matveev, V.; Palichik, V.; Perelygin, V.; Savina, M.; Shmatov, S.; Shulha, S.; Skatchkov, N.; Smirnov, V.; Voytishin, N.; Zarubin, A.; Ivanov, Y.; Kim, V.; Kuznetsova, E.; Levchenko, P.; Murzin, V.; Oreshkin, V.; Smirnov, I.; Sosnov, D.; Sulimov, V.; Uvarov, L.; Vavilov, S.; Vorobyev, A.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Karneyeu, A.; Kirsanov, M.; Krasnikov, N.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Gavrilov, V.; Lychkovskaya, N.; Popov, V.; Pozdnyakov, I.; Safronov, G.; Spiridonov, A.; Stepennov, A.; Toms, M.; Vlasov, E.; Zhokin, A.; Aushev, T.; Bylinkin, A.; Chadeeva, M.; Parygin, P.; Philippov, D.; Polikarpov, S.; Popova, E.; Rusinov, V.; Zhemchugov, E.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Terkulov, A.; Baskakov, A.; Belyaev, A.; Boos, E.; Dubinin, M.; Dudko, L.; Ershov, A.; Gribushin, A.; Klyukhin, V.; Kodolova, O.; Lokhtin, I.; Miagkov, I.; Obraztsov, S.; Petrushanko, S.; Savrin, V.; Snigirev, A.; Blinov, V.; Skovpen, Y.; Shtol, D.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Elumakhov, D.; Godizov, A.; Kachanov, V.; Kalinin, A.; Konstantinov, D.; Mandrik, P.; Petrov, V.; Ryutin, R.; Sobol, A.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Cirkovic, P.; Devetak, D.; Dordevic, M.; Milosevic, J.; Rekovic, V.; Maestre, J. Alcaraz; Bachiller, I.; Barrio Luna, M.; Cerrada, M.; Colino, N.; De La Cruz, B.; Peris, A. Delgado; Bedoya, C. Fernandez; Ramos, J. P. Fernández; Flix, J.; Fouz, M. C.; Lopez, O. Gonzalez; Lopez, S. Goy; Hernandez, J. M.; Josa, M. I.; Moran, D.; Yzquierdo, A. Pérez-Calero; Pelayo, J. Puerta; Olmeda, A. Quintario; Redondo, I.; Romero, L.; Soares, M. S.; Fernández, A. Álvarez; Albajar, C.; de Trocóniz, J. F.; Missiroli, M.; Cuevas, J.; Erice, C.; Menendez, J. Fernandez; Caballero, I. Gonzalez; Fernández, J. R. González; Cortezon, E. Palencia; Cruz, S. Sanchez; Vischia, P.; Garcia, J. M. Vizan; Cabrillo, I. J.; Calderon, A.; Quero, B. Chazin; Curras, E.; Campderros, J. Duarte; Fernandez, M.; Garcia-Ferrero, J.; Gomez, G.; Lopez Virto, A.; Marco, J.; Rivero, C. Martinez; del Arbol, P. Martinez Ruiz; Matorras, F.; Gomez, J. Piedra; Rodrigo, T.; Ruiz-Jimeno, A.; Scodellaro, L.; Trevisani, N.; Vila, I.; Cortabitarte, R. Vilar; Abbaneo, D.; Akgun, B.; Auffray, E.; Baillon, P.; Ball, A. H.; Barney, D.; Bendavid, J.; Bianco, M.; Bloch, P.; Bocci, A.; Botta, C.; Camporesi, T.; Castello, R.; Cepeda, M.; Cerminara, G.; Chapon, E.; Chen, Y.; d'Enterria, D.; Dabrowski, A.; Daponte, V.; David, A.; De Gruttola, M.; De Roeck, A.; Deelen, N.; Dobson, M.; du Pree, T.; Dünser, M.; Dupont, N.; Elliott-Peisert, A.; Everaerts, P.; Fallavollita, F.; Franzoni, G.; Fulcher, J.; Funk, W.; Gigi, D.; Gilbert, A.; Gill, K.; Glege, F.; Gulhan, D.; Harris, P.; Hegeman, J.; Innocente, V.; Jafari, A.; Janot, P.; Karacheban, O.; Kieseler, J.; Knünz, V.; Kornmayer, A.; Kortelainen, M. J.; Krammer, M.; Lange, C.; Lecoq, P.; Lourenço, C.; Lucchini, M. T.; Malgeri, L.; Mannelli, M.; Martelli, A.; Meijers, F.; Merlin, J. A.; Mersi, S.; Meschi, E.; Milenovic, P.; Moortgat, F.; Mulders, M.; Neugebauer, H.; Ngadiuba, J.; Orfanelli, S.; Orsini, L.; Pape, L.; Perez, E.; Peruzzi, M.; Petrilli, A.; Petrucciani, G.; Pfeiffer, A.; Pierini, M.; Rabady, D.; Racz, A.; Reis, T.; Rolandi, G.; Rovere, M.; Sakulin, H.; Schäfer, C.; Schwick, C.; Seidel, M.; Selvaggi, M.; Sharma, A.; Silva, P.; Sphicas, P.; Stakia, A.; Steggemann, J.; Stoye, M.; Tosi, M.; Treille, D.; Triossi, A.; Tsirou, A.; Veckalns, V.; Verweij, M.; Zeuner, W. D.; Bertl, W.; Caminada, L.; Deiters, K.; Erdmann, W.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; Kotlinski, D.; Langenegger, U.; Rohe, T.; Wiederkehr, S. A.; Backhaus, M.; Bäni, L.; Berger, P.; Bianchini, L.; Casal, B.; Dissertori, G.; Dittmar, M.; Donegà, M.; Dorfer, C.; Grab, C.; Heidegger, C.; Hits, D.; Hoss, J.; Kasieczka, G.; Klijnsma, T.; Lustermann, W.; Mangano, B.; Marionneau, M.; Meinhard, M. T.; Meister, D.; Micheli, F.; Musella, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pata, J.; Pauss, F.; Perrin, G.; Perrozzi, L.; Quittnat, M.; Reichmann, M.; Sanz Becerra, D. A.; Schönenberger, M.; Shchutska, L.; Tavolaro, V. R.; Theofilatos, K.; Olsson, M. L. Vesterbacka; Wallny, R.; Zhu, D. H.; Aarrestad, T. K.; Amsler, C.; Canelli, M. F.; De Cosa, A.; Del Burgo, R.; Donato, S.; Galloni, C.; Hreus, T.; Kilminster, B.; Pinna, D.; Rauco, G.; Robmann, P.; Salerno, D.; Schweiger, K.; Seitz, C.; Takahashi, Y.; Zucchetta, A.; Candelise, V.; Chang, Y. H.; Cheng, K. y.; Doan, T. H.; Jain, Sh.; Khurana, R.; Kuo, C. M.; Lin, W.; Pozdnyakov, A.; Yu, S. S.; Kumar, Arun; Chang, P.; Chao, Y.; Chen, K. F.; Chen, P. H.; Fiori, F.; Hou, W.-S.; Hsiung, Y.; Liu, Y. F.; Lu, R.-S.; Paganis, E.; Psallidas, A.; Steen, A.; Tsai, J. f.; Asavapibhop, B.; Kovitanggoon, K.; Singh, G.; Srimanobhas, N.; Bat, A.; Boran, F.; Cerci, S.; Damarseckin, S.; Demiroglu, Z. S.; Dozen, C.; Dumanoglu, I.; Girgis, S.; Gokbulut, G.; Guler, Y.; Hos, I.; Kangal, E. E.; Kara, O.; Topaksu, A. Kayis; Kiminsu, U.; Oglakci, M.; Onengut, G.; Ozdemir, K.; Cerci, D. Sunar; Tali, B.; Tok, U. G.; Turkcapar, S.; Zorbakir, I. S.; Zorbilmez, C.; Karapinar, G.; Ocalan, K.; Yalvac, M.; Zeyrek, M.; Gülmez, E.; Kaya, M.; Kaya, O.; Tekten, S.; Yetkin, E. A.; Agaras, M. N.; Atay, S.; Cakir, A.; Cankocak, K.; Köseoglu, I.; Grynyov, B.; Levchuk, L.; Ball, F.; Beck, L.; Brooke, J. J.; Burns, D.; Clement, E.; Cussans, D.; Davignon, O.; Flacher, H.; Goldstein, J.; Heath, G. P.; Heath, H. F.; Kreczko, L.; Newbold, D. M.; Paramesvaran, S.; Sakuma, T.; Seif El Nasr-storey, S.; Smith, D.; Smith, V. J.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Calligaris, L.; Cieri, D.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Linacre, J.; Olaiya, E.; Petyt, D.; Shepherd-Themistocleous, C. H.; Thea, A.; Tomalin, I. R.; Williams, T.; Auzinger, G.; Bainbridge, R.; Borg, J.; Breeze, S.; Buchmuller, O.; Bundock, A.; Casasso, S.; Citron, M.; Colling, D.; Corpe, L.; Dauncey, P.; Davies, G.; De Wit, A.; Della Negra, M.; Di Maria, R.; Elwood, A.; Haddad, Y.; Hall, G.; Iles, G.; James, T.; Lane, R.; Laner, C.; Lyons, L.; Magnan, A.-M.; Malik, S.; Mastrolorenzo, L.; Matsushita, T.; Nash, J.; Nikitenko, A.; Palladino, V.; Pesaresi, M.; Raymond, D. M.; Richards, A.; Rose, A.; Scott, E.; Seez, C.; Shtipliyski, A.; Summers, S.; Tapper, A.; Uchida, K.; Acosta, M. Vazquez; Virdee, T.; Wardle, N.; Winterbottom, D.; Wright, J.; Zenz, S. C.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Reid, I. D.; Teodorescu, L.; Zahid, S.; Borzou, A.; Call, K.; Dittmann, J.; Hatakeyama, K.; Liu, H.; Pastika, N.; Smith, C.; Bartek, R.; Dominguez, A.; Buccilli, A.; Cooper, S. I.; Henderson, C.; Rumerio, P.; West, C.; Arcaro, D.; Avetisyan, A.; Bose, T.; Gastler, D.; Rankin, D.; Richardson, C.; Rohlf, J.; Sulak, L.; Zou, D.; Benelli, G.; Cutts, D.; Garabedian, A.; Hadley, M.; Hakala, J.; Heintz, U.; Hogan, J. M.; Kwok, K. H. M.; Laird, E.; Landsberg, G.; Lee, J.; Mao, Z.; Narain, M.; Pazzini, J.; Piperov, S.; Sagir, S.; Syarif, R.; Yu, D.; Band, R.; Brainerd, C.; Breedon, R.; Burns, D.; De La Barca Sanchez, M. Calderon; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Erbacher, R.; Flores, C.; Funk, G.; Ko, W.; Lander, R.; Mclean, C.; Mulhearn, M.; Pellett, D.; Pilot, J.; Shalhout, S.; Shi, M.; Smith, J.; Stolp, D.; Tos, K.; Tripathi, M.; Wang, Z.; Bachtis, M.; Bravo, C.; Cousins, R.; Dasgupta, A.; Florent, A.; Hauser, J.; Ignatenko, M.; Mccoll, N.; Regnard, S.; Saltzberg, D.; Schnaible, C.; Valuev, V.; Bouvier, E.; Burt, K.; Clare, R.; Ellison, J.; Gary, J. W.; Shirazi, S. M. A. Ghiasi; Hanson, G.; Heilman, J.; Karapostoli, G.; Kennedy, E.; Lacroix, F.; Long, O. R.; Negrete, M. Olmedo; Paneva, M. I.; Si, W.; Wang, L.; Wei, H.; Wimpenny, S.; Yates, B. R.; Branson, J. G.; Cittolin, S.; Derdzinski, M.; Gerosa, R.; Gilbert, D.; Hashemi, B.; Holzner, A.; Klein, D.; Kole, G.; Krutelyov, V.; Letts, J.; Masciovecchio, M.; Olivito, D.; Padhi, S.; Pieri, M.; Sani, M.; Sharma, V.; Tadel, M.; Vartak, A.; Wasserbaech, S.; Wood, J.; Würthwein, F.; Yagil, A.; Della Porta, G. Zevi; Amin, N.; Bhandari, R.; Bradmiller-Feld, J.; Campagnari, C.; Dishaw, A.; Dutta, V.; Franco Sevilla, M.; Gouskos, L.; Heller, R.; Incandela, J.; Ovcharova, A.; Qu, H.; Richman, J.; Stuart, D.; Suarez, I.; Yoo, J.; Anderson, D.; Bornheim, A.; Lawhorn, J. M.; Newman, H. B.; Nguyen, T. Q.; Pena, C.; Spiropulu, M.; Vlimant, J. R.; Xie, S.; Zhang, Z.; Zhu, R. Y.; Andrews, M. B.; Ferguson, T.; Mudholkar, T.; Paulini, M.; Russ, J.; Sun, M.; Vogel, H.; Vorobiev, I.; Weinberg, M.; Cumalat, J. P.; Ford, W. T.; Jensen, F.; Johnson, A.; Krohn, M.; Leontsinis, S.; Mulholland, T.; Stenson, K.; Wagner, S. R.; Alexander, J.; Chaves, J.; Chu, J.; Dittmer, S.; Mcdermott, K.; Mirman, N.; Patterson, J. R.; Quach, D.; Rinkevicius, A.; Ryd, A.; Skinnari, L.; Soffi, L.; Tan, S. M.; Tao, Z.; Thom, J.; Tucker, J.; Wittich, P.; Zientek, M.; Abdullin, S.; Albrow, M.; Alyari, M.; Apollinari, G.; Apresyan, A.; Apyan, A.; Banerjee, S.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Bolla, G.; Burkett, K.; Butler, J. N.; Canepa, A.; Cerati, G. B.; Cheung, H. W. K.; Chlebana, F.; Cremonesi, M.; Duarte, J.; Elvira, V. D.; Freeman, J.; Gecse, Z.; Gottschalk, E.; Gray, L.; Green, D.; Grünendahl, S.; Gutsche, O.; Harris, R. M.; Hasegawa, S.; Hirschauer, J.; Hu, Z.; Jayatilaka, B.; Jindariani, S.; Johnson, M.; Joshi, U.; Klima, B.; Kreis, B.; Lammel, S.; Lincoln, D.; Lipton, R.; Liu, M.; Liu, T.; De Sá, R. Lopes; Lykken, J.; Maeshima, K.; Magini, N.; Marraffino, J. M.; Mason, D.; McBride, P.; Merkel, P.; Mrenna, S.; Nahn, S.; O'Dell, V.; Pedro, K.; Prokofyev, O.; Rakness, G.; Ristori, L.; Schneider, B.; Sexton-Kennedy, E.; Soha, A.; Spalding, W. J.; Spiegel, L.; Stoynev, S.; Strait, J.; Strobbe, N.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vernieri, C.; Verzocchi, M.; Vidal, R.; Wang, M.; Weber, H. A.; Whitbeck, A.; Acosta, D.; Avery, P.; Bortignon, P.; Bourilkov, D.; Brinkerhoff, A.; Carnes, A.; Carver, M.; Curry, D.; Field, R. D.; Furic, I. K.; Gleyzer, S. V.; Joshi, B. M.; Konigsberg, J.; Korytov, A.; Kotov, K.; Ma, P.; Matchev, K.; Mei, H.; Mitselmakher, G.; Shi, K.; Sperka, D.; Terentyev, N.; Thomas, L.; Wang, J.; Wang, S.; Yelton, J.; Joshi, Y. R.; Linn, S.; Markowitz, P.; Rodriguez, J. L.; Ackert, A.; Adams, T.; Askew, A.; Hagopian, S.; Hagopian, V.; Johnson, K. F.; Kolberg, T.; Martinez, G.; Perry, T.; Prosper, H.; Saha, A.; Santra, A.; Sharma, V.; Yohay, R.; Baarmand, M. M.; Bhopatkar, V.; Colafranceschi, S.; Hohlmann, M.; Noonan, D.; Roy, T.; Yumiceva, F.; Adams, M. R.; Apanasevich, L.; Berry, D.; Betts, R. R.; Cavanaugh, R.; Chen, X.; Evdokimov, O.; Gerber, C. E.; Hangal, D. A.; Hofman, D. J.; Jung, K.; Kamin, J.; Gonzalez, I. D. Sandoval; Tonjes, M. B.; Trauger, H.; Varelas, N.; Wang, H.; Wu, Z.; Zhang, J.; Bilki, B.; Clarida, W.; Dilsiz, K.; Durgut, S.; Gandrajula, R. P.; Haytmyradov, M.; Khristenko, V.; Merlo, J.-P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Ogul, H.; Onel, Y.; Ozok, F.; Penzo, A.; Snyder, C.; Tiras, E.; Wetzel, J.; Yi, K.; Blumenfeld, B.; Cocoros, A.; Eminizer, N.; Fehling, D.; Feng, L.; Gritsan, A. V.; Maksimovic, P.; Roskes, J.; Sarica, U.; Swartz, M.; Xiao, M.; You, C.; Al-bataineh, A.; Baringer, P.; Bean, A.; Boren, S.; Bowen, J.; Castle, J.; Khalil, S.; Kropivnitskaya, A.; Majumder, D.; Mcbrayer, W.; Murray, M.; Rogan, C.; Royon, C.; Sanders, S.; Schmitz, E.; Tapia Takaki, J. D.; Wang, Q.; Ivanov, A.; Kaadze, K.; Maravin, Y.; Mohammadi, A.; Saini, L. K.; Skhirtladze, N.; Rebassoo, F.; Wright, D.; Anelli, C.; Baden, A.; Baron, O.; Belloni, A.; Eno, S. C.; Feng, Y.; Ferraioli, C.; Hadley, N. J.; Jabeen, S.; Jeng, G. Y.; Kellogg, R. G.; Kunkle, J.; Mignerey, A. C.; Ricci-Tam, F.; Shin, Y. H.; Skuja, A.; Tonwar, S. C.; Abercrombie, D.; Allen, B.; Azzolini, V.; Barbieri, R.; Baty, A.; Bi, R.; Brandt, S.; Busza, W.; Cali, I. A.; D'Alfonso, M.; Demiragli, Z.; Ceballos, G. Gomez; Goncharov, M.; Hsu, D.; Hu, M.; Iiyama, Y.; Innocenti, G. M.; Klute, M.; Kovalskyi, D.; Lee, Y.-J.; Levin, A.; Luckey, P. D.; Maier, B.; Marini, A. C.; Mcginn, C.; Mironov, C.; Narayanan, S.; Niu, X.; Paus, C.; Roland, C.; Roland, G.; Salfeld-Nebgen, J.; Stephans, G. S. F.; Tatar, K.; Velicanu, D.; Wang, J.; Wang, T. W.; Wyslouch, B.; Benvenuti, A. C.; Chatterjee, R. M.; Evans, A.; Hansen, P.; Hiltbrand, J.; Kalafut, S.; Kubota, Y.; Lesko, Z.; Mans, J.; Nourbakhsh, S.; Ruckstuhl, N.; Rusack, R.; Turkewitz, J.; Wadud, M. A.; Acosta, J. G.; Oliveros, S.; Avdeeva, E.; Bloom, K.; Claes, D. R.; Fangmeier, C.; Golf, F.; Suarez, R. Gonzalez; Kamalieddin, R.; Kravchenko, I.; Monroy, J.; Siado, J. E.; Snow, G. R.; Stieger, B.; Dolen, J.; Godshalk, A.; Harrington, C.; Iashvili, I.; Nguyen, D.; Parker, A.; Rappoccio, S.; Roozbahani, B.; Alverson, G.; Barberis, E.; Freer, C.; Hortiangtham, A.; Massironi, A.; Morse, D. M.; Orimoto, T.; De Lima, R. Teixeira; Trocino, D.; Wamorkar, T.; Wang, B.; Wisecarver, A.; Wood, D.; Bhattacharya, S.; Charaf, O.; Hahn, K. A.; Mucia, N.; Odell, N.; Schmitt, M. H.; Sung, K.; Trovato, M.; Velasco, M.; Bucci, R.; Dev, N.; Hildreth, M.; Anampa, K. Hurtado; Jessop, C.; Karmgard, D. J.; Kellams, N.; Lannon, K.; Li, W.; Loukas, N.; Marinelli, N.; Meng, F.; Mueller, C.; Musienko, Y.; Planer, M.; Reinsvold, A.; Ruchti, R.; Siddireddy, P.; Smith, G.; Taroni, S.; Wayne, M.; Wightman, A.; Wolf, M.; Woodard, A.; Alimena, J.; Antonelli, L.; Bylsma, B.; Durkin, L. S.; Flowers, S.; Francis, B.; Hart, A.; Hill, C.; Ji, W.; Liu, B.; Luo, W.; Winer, B. L.; Wulsin, H. W.; Cooperstein, S.; Driga, O.; Elmer, P.; Hardenbrook, J.; Hebda, P.; Higginbotham, S.; Kalogeropoulos, A.; Lange, D.; Luo, J.; Marlow, D.; Mei, K.; Ojalvo, I.; Olsen, J.; Palmer, C.; Piroué, P.; Stickland, D.; Tully, C.; Malik, S.; Norberg, S.; Barker, A.; Barnes, V. E.; Das, S.; Folgueras, S.; Gutay, L.; Jha, M. K.; Jones, M.; Jung, A. W.; Khatiwada, A.; Miller, D. H.; Neumeister, N.; Peng, C. C.; Qiu, H.; Schulte, J. F.; Sun, J.; Wang, F.; Xiao, R.; Xie, W.; Cheng, T.; Parashar, N.; Stupak, J.; Chen, Z.; Ecklund, K. M.; Freed, S.; Geurts, F. J. M.; Guilbaud, M.; Kilpatrick, M.; Li, W.; Michlin, B.; Padley, B. P.; Roberts, J.; Rorie, J.; Shi, W.; Tu, Z.; Zabel, J.; Zhang, A.; Bodek, A.; de Barbaro, P.; Demina, R.; Duh, Y. t.; Ferbel, T.; Galanti, M.; Garcia-Bellido, A.; Han, J.; Hindrichs, O.; Khukhunaishvili, A.; Lo, K. H.; Tan, P.; Verzetti, M.; Ciesielski, R.; Goulianos, K.; Mesropian, C.; Agapitos, A.; Chou, J. P.; Gershtein, Y.; Espinosa, T. A. Gómez; Halkiadakis, E.; Heindl, M.; Hughes, E.; Kaplan, S.; Elayavalli, R. Kunnawalkam; Kyriacou, S.; Lath, A.; Montalvo, R.; Nash, K.; Osherson, M.; Saka, H.; Salur, S.; Schnetzer, S.; Sheffield, D.; Somalwar, S.; Stone, R.; Thomas, S.; Thomassen, P.; Walker, M.; Delannoy, A. G.; Heideman, J.; Riley, G.; Rose, K.; Spanier, S.; Thapa, K.; Bouhali, O.; Hernandez, A. Castaneda; Celik, A.; Dalchenko, M.; De Mattia, M.; Delgado, A.; Dildick, S.; Eusebi, R.; Gilmore, J.; Huang, T.; Kamon, T.; Mueller, R.; Pakhotin, Y.; Patel, R.; Perloff, A.; Perniè, L.; Rathjens, D.; Safonov, A.; Tatarinov, A.; Ulmer, K. A.; Akchurin, N.; Damgov, J.; De Guio, F.; Dudero, P. R.; Faulkner, J.; Gurpinar, E.; Kunori, S.; Lamichhane, K.; Lee, S. W.; Libeiro, T.; Mengke, T.; Muthumuni, S.; Peltola, T.; Undleeb, S.; Volobouev, I.; Wang, Z.; Greene, S.; Gurrola, A.; Janjam, R.; Johns, W.; Maguire, C.; Melo, A.; Ni, H.; Padeken, K.; Sheldon, P.; Tuo, S.; Velkovska, J.; Xu, Q.; Arenton, M. W.; Barria, P.; Cox, B.; Hirosky, R.; Joyce, M.; Ledovskoy, A.; Li, H.; Neu, C.; Sinthuprasith, T.; Wang, Y.; Wolfe, E.; Xia, F.; Harr, R.; Karchin, P. E.; Poudyal, N.; Sturdy, J.; Thapa, P.; Zaleski, S.; Brodski, M.; Buchanan, J.; Caillol, C.; Dasu, S.; Dodd, L.; Duric, S.; Gomber, B.; Grothe, M.; Herndon, M.; Hervé, A.; Hussain, U.; Klabbers, P.; Lanaro, A.; Levine, A.; Long, K.; Loveless, R.; Ruggles, T.; Savin, A.; Smith, N.; Smith, W. H.; Taylor, D.; Woods, N.

2018-04-01

A search for new physics in events with a Z boson produced in association with large missing transverse momentum at the LHC is presented. The search is based on the 2016 data sample of proton-proton collisions recorded with the CMS experiment at √{s} = 13 {TeV} , corresponding to an integrated luminosity of 35.9 {fb}^{-1}. The results of this search are interpreted in terms of a simplified model of dark matter production via spin-0 or spin-1 mediators, a scenario with a standard-model-like Higgs boson produced in association with the Z boson and decaying invisibly, a model of unparticle production, and a model with large extra spatial dimensions. No significant deviations from the background expectations are found, and limits are set on relevant model parameters, significantly extending the results previously achieved in this channel.

A Full-Text-Based Search Engine for Finding Highly Matched Documents Across Multiple Categories

Science.gov (United States)

Nguyen, Hung D.; Steele, Gynelle C.

2016-01-01

This report demonstrates the full-text-based search engine that works on any Web-based mobile application. The engine has the capability to search databases across multiple categories based on a user's queries and identify the most relevant or similar. The search results presented here were found using an Android (Google Co.) mobile device; however, it is also compatible with other mobile phones.

Flavour Independent $h^{0}A^{0}$ Search and Two Higgs Doublet Model Interpretation of Neutral Higgs Boson Searches at LEP

CERN Document Server

Abbiendi, G.; Akesson, P.F.; Alexander, G.; Allison, John; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Asai, S.; Axen, D.; Bailey, I.; Barberio, E.; Barillari, T.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, Kenneth Watson; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Boeriu, O.; Bock, P.; Boutemeur, M.; Braibant, S.; Brown, Robert M.; Burckhart, H.J.; Campana, S.; Capiluppi, P.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, D.G.; Ciocca, C.; Csilling, A.; Cuffiani, M.; Dado, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Etzion, E.; Fabbri, F.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Gagnon, P.; Gary, John William; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, Marina; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harel, A.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, Kara Dion; Horvath, D.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jovanovic, P.; Junk, T.R.; Kanzaki, J.; Karlen, D.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kramer, T.; Krieger, P.; von Krogh, J.; Kuhl, T.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Lellouch, D.; Lettso, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, A.; Ludwig, J.; Mader, W.; Marcellini, S.; Martin, A.J.; Masetti, G.; Mashimo, T.; Mattig, Peter; McKenna, J.; McPherson, R.A.; Meijers, F.; Menges, W.; Merritt, F.S.; Mes, H.; Meyer, Niels T.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Nanjo, H.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oh, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Roney, J.M.; Rossi, A.M.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schorner-Sadenius, T.; Schroder, Matthias; Schumacher, M.; Seuster, R.; Shears, T.G.; Shen, B.C.; Sherwood, P.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spano, F.; Stahl, A.; Strom, David M.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vollmer, C.F.; Vannerem, P.; Vertesi, R.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wilson, G.W.; Wilson, J.A.; Wolf, G.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, Lidija

2005-01-01

Upper limits on the cross-section of the pair-production process e+e- -> h0A0 assuming 100% decays into hadrons, are derived from a new search for the h0A0 -> hadrons topology, independent of the hadronic flavour of the decay products. Searches for the neutral Higgs bosons h0 and A0, are used to obtain constraints on the Type II Two Higgs Doublet Model (2HDM(11)) with no CP violation in the Higgs sector and no additional non Standard Model particles besides the five Higgs bosons. The analysis combines LEP1 and LEP2 data collected with the OPAL detctor up to the highest available centre-of-mass energies. The searches are sensitive to the h0, A0 -> qq, gg,tau+tau- and h0 -> A0A0 decay modes of the Higgs bosons. The 2HDM(II) parameter space is explored in a detailed scan. Large regions of the 2HDM(II) parameter space are excluded at the 95% CL in the (mh, mA), (mh, tanb) and (mA, tanb) planes, using both direct neutral Higgs boson searches and indirect limits derived from Standard Model high precision measuremen...

New generation of the multimedia search engines

Science.gov (United States)

Mijes Cruz, Mario Humberto; Soto Aldaco, Andrea; Maldonado Cano, Luis Alejandro; López Rodríguez, Mario; Rodríguez Vázqueza, Manuel Antonio; Amaya Reyes, Laura Mariel; Cano Martínez, Elizabeth; Pérez Rosas, Osvaldo Gerardo; Rodríguez Espejo, Luis; Flores Secundino, Jesús Abimelek; Rivera Martínez, José Luis; García Vázquez, Mireya Saraí; Zamudio Fuentes, Luis Miguel; Sánchez Valenzuela, Juan Carlos; Montoya Obeso, Abraham; Ramírez Acosta, Alejandro Álvaro

2016-09-01

Current search engines are based upon search methods that involve the combination of words (text-based search); which has been efficient until now. However, the Internet's growing demand indicates that there's more diversity on it with each passing day. Text-based searches are becoming limited, as most of the information on the Internet can be found in different types of content denominated multimedia content (images, audio files, video files). Indeed, what needs to be improved in current search engines is: search content, and precision; as well as an accurate display of expected search results by the user. Any search can be more precise if it uses more text parameters, but it doesn't help improve the content or speed of the search itself. One solution is to improve them through the characterization of the content for the search in multimedia files. In this article, an analysis of the new generation multimedia search engines is presented, focusing the needs according to new technologies. Multimedia content has become a central part of the flow of information in our daily life. This reflects the necessity of having multimedia search engines, as well as knowing the real tasks that it must comply. Through this analysis, it is shown that there are not many search engines that can perform content searches. The area of research of multimedia search engines of new generation is a multidisciplinary area that's in constant growth, generating tools that satisfy the different needs of new generation systems.

Evidence-based librarianship: searching for the needed EBL evidence.

Science.gov (United States)

Eldredge, J D

2000-01-01

This paper discusses the challenges of finding evidence needed to implement Evidence-Based Librarianship (EBL). Focusing first on database coverage for three health sciences librarianship journals, the article examines the information contents of different databases. Strategies are needed to search for relevant evidence in the library literature via these databases, and the problems associated with searching the grey literature of librarianship. Database coverage, plausible search strategies, and the grey literature of library science all pose challenges to finding the needed research evidence for practicing EBL. Health sciences librarians need to ensure that systems are designed that can track and provide access to needed research evidence to support Evidence-Based Librarianship (EBL).

Consumer search and pricing behavior in Internet markets

NARCIS (Netherlands)

Janssen, Maarten C W; Moraga-González, José Luis; Wildenbeest, Matthijs R.

2007-01-01

Throughout economic history, changes in technology have had a substantial impact on consumers' search and transportation costs and, consequently, on the size of the relevant market. One example is the progressive decline in transportation costs that historically has taken place through the use of

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…

Effectiveness of random search in SVM hyper-parameter tuning

NARCIS (Netherlands)

Gomes Mantovani, R.; Rossi, A.L.D.; Vanschoren, J.; Bischl, B.; de Carvalho, A.C.P.L.F.

2015-01-01

Classification is one of the most common machine learning tasks. SVMs have been frequently applied to this task. In general, the values chosen for the hyper-parameters of SVMs affect the performance of their induced predictive models. Several studies use optimization techniques to find a set of

Students' Evaluation Strategies in a Web Research Task: Are They Sensitive to Relevance and Reliability?

Science.gov (United States)

Rodicio, Héctor García

2015-01-01

When searching and using resources on the Web, students have to evaluate Web pages in terms of relevance and reliability. This evaluation can be done in a more or less systematic way, by either considering deep or superficial cues of relevance and reliability. The goal of this study was to examine how systematic students are when evaluating Web…

Effect of nonlinear void reactivity on bifurcation characteristics of a lumped-parameter model of a BWR: A study relevant to RBMK

Energy Technology Data Exchange (ETDEWEB)

Verma, Dinkar, E-mail: dinkar@iitk.ac.in [Nuclear Engineering and Technology Program, Indian Institute of Technology Kanpur, Kanpur 208 016 (India); Kalra, Manjeet Singh, E-mail: drmanjeet.singh@dituniversity.edu.in [DIT University, Dehradun 248 009 (India); Wahi, Pankaj, E-mail: wahi@iitk.ac.in [Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016 (India)

2017-04-15

Highlights: • A simplified model with nonlinear void reactivity feedback is studied. • Method of multiple scales for nonlinear analysis and oscillation characteristics. • Second order void reactivity dominates in determining system dynamics. • Opposing signs of linear and quadratic void reactivity enhances global safety. - Abstract: In the present work, the effect of nonlinear void reactivity on the dynamics of a simplified lumped-parameter model for a boiling water reactor (BWR) is investigated. A mathematical model of five differential equations comprising of neutronics and thermal-hydraulics encompassing the nonlinearities associated with both the reactivity feedbacks and the heat transfer process has been used. To this end, we have considered parameters relevant to RBMK for which the void reactivity is known to be nonlinear. A nonlinear analysis of the model exploiting the method of multiple time scales (MMTS) predicts the occurrence of the two types of Hopf bifurcation, namely subcritical and supercritical, leading to the evolution of limit cycles for a range of parameters. Numerical simulations have been performed to verify the analytical results obtained by MMTS. The study shows that the nonlinear reactivity has a significant influence on the system dynamics. A parametric study with varying nominal reactor power and operating conditions in coolant channel has also been performed which shows the effect of change in concerned parameter on the boundary between regions of sub- and super-critical Hopf bifurcations in the space constituted by the two coefficients of reactivities viz. the void and the Doppler coefficient of reactivities. In particular, we find that introduction of a negative quadratic term in the void reactivity feedback significantly increases the supercritical region and dominates in determining the system dynamics.

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)

OPUS - Outer Planets Unified Search with Enhanced Surface Geometry Parameters - Not Just for Rings

Science.gov (United States)

Gordon, Mitchell; Showalter, Mark Robert; Ballard, Lisa; Tiscareno, Matthew S.; Heather, Neil

2016-10-01

In recent years, with the massive influx of data into the PDS from a wide array of missions and instruments, finding the precise data you need has been an ongoing challenge. For remote sensing data obtained from Jupiter to Pluto, that challenge is being addressed by the Outer Planets Unified Search, more commonly known as OPUS.OPUS is a powerful search tool available at the PDS Ring-Moon Systems Node (RMS) - formerly the PDS Rings Node. While OPUS was originally designed with ring data in mind, its capabilities have been extended to include all of the targets within an instrument's field of view. OPUS provides preview images of search results, and produces a zip file for easy download of selected products, including a table of user specified metadata. For Cassini ISS and Voyager ISS we have generated and include calibrated versions of every image.Currently OPUS supports data returned by Cassini ISS, UVIS, VIMS, and CIRS (Saturn data through June 2010), New Horizons Jupiter LORRI, Galileo SSI, Voyager ISS and IRIS, and Hubble (ACS, WFC3 and WFPC2).At the RMS Node, we have developed and incorporated into OPUS detailed geometric metadata, based on the most recent SPICE kernels, for all of the bodies in the Cassini Saturn observations. This extensive set of geometric metadata is unique to the RMS Node and enables search constraints such as latitudes and longitudes (Saturn, Titan, and icy satellites), viewing and illumination geometry (phase, incidence and emission angles), and distances and resolution.Our near term plans include adding the full set of Cassini CIRS Saturn data (with enhanced geometry), New Horizons MVIC Jupiter encounter images, New Horizons LORRI and MVIC Pluto data, HST STIS observations, and Cassini and Voyager ring occultations. We also plan to develop enhanced geometric metadata for the New Horizons LORRI and MVIC instruments for both the Jupiter and the Pluto encounters.OPUS: http://pds-rings.seti.org/search/

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.

DECISION USEFULNESS: TRADE-OFF ANTARA RELIABILITY DAN RELEVANCE

OpenAIRE

AGUS INDRA TENAYA

2007-01-01

The purpose of this article is to search for trade-off solution betweenreliability and relevance. Approach that can be used to have more reliable andrelevant financial statement is decision usefulness. This approach suggests thatfinancial statement must be useful to become a base of investors’ decision making.The change function of financial statement from just a tool of responsibility tobecome a tool of decision making has caused historical cost-based financialstatement could not be used to ...

Using internet search engines and library catalogs to locate toxicology information.

Science.gov (United States)

Wukovitz, L D

2001-01-12

The increasing importance of the Internet demands that toxicologists become aquainted with its resources. To find information, researchers must be able to effectively use Internet search engines, directories, subject-oriented websites, and library catalogs. The article will explain these resources, explore their benefits and weaknesses, and identify skills that help the researcher to improve search results and critically evaluate sources for their relevancy, validity, accuracy, and timeliness.

Electroweak SUSY production searches at ATLAS and CMS

CERN Document Server

Flowerdew, M; The ATLAS collaboration

2014-01-01

The discovery of weak-scale supersymmetric (SUSY) particles is one of the primary goals of the Large Hadron Collider experiments. Depending on the mechanism of SUSY breaking, it could be that strongly interacting squarks and gluinos are too massive to produce at the LHC. In this case, the primary SUSY production mode is of charginos, neutralinos and sleptons, mediated by electroweak interactions. However, the experimental signatures for discovery vary widely, depending on the mass hierarchy, SUSY particle mixing parameters and conservation/violation of R-parity, necessitating a large and complex suite of experimental search strategies. These strategies include searching for events with multiple charged leptons, photons, reconstructed higgs bosons or new long-lived particles. In this presentation, the latest ATLAS and CMS search results in these channels are presented, based mainly on $20~$fb$^{-1}$ of $pp$ collisions at $\\sqrt{s} = 8~$TeV collected in 2012. The resulting constraints on the parameter spaces of...

EW SUSY production searches at ATLAS and CMS

CERN Document Server

Flowerdew, MJ; The ATLAS collaboration

2014-01-01

The discovery of weak-scale supersymmetric (SUSY) particles is one of the primary goals of the Large Hadron Collider experiments. Depending on the mechanism of SUSY breaking, it could be that strongly interacting squarks and gluinos are too massive to produce at the LHC. In this case, the primary SUSY production mode is of charginos, neutralinos and sleptons, mediated by electroweak interactions. However, the experimental signatures for discovery vary widely, depending on the mass hierarchy, SUSY particle mixing parameters and conservation/violation of R-parity, necessitating a large and complex suite of experimental search strategies. These strategies include searching for events with multiple charged leptons, photons, reconstructed higgs bosons or new long-lived particles. In this presentation, the latest ATLAS and CMS search results in these channels are presented, based mainly on 20 fb$^{-1}$ of pp collisions at $\\sqrt{s} = 8$ TeV collected in 2012. The resulting constraints on the parameter spaces of var...

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.

Search for radions at LEP2

International Nuclear Information System (INIS)

Abbiendi, G.; Ainsley, C.; Akesson, P.F.

2005-01-01

A new scalar resonance, called the radion, with couplings to fermions and bosons similar to those of the Higgs boson, is predicted in the framework of Randall-Sundrum models, proposed solutions to the hierarchy problem with one extra dimension. An important distinction between the radion and the Higgs boson is that the radion would couple directly to gluon pairs, and in particular its decay products would include a significant fraction of gluon jets. The radion has the same quantum numbers as the Standard Model (SM) Higgs boson, and therefore they can mix, with the resulting mass eigenstates having properties different from those of the SM Higgs boson. Existing searches for the Higgs bosons are sensitive to the possible production and decay of radions and Higgs bosons in these models. For the first time, searches for the SM Higgs boson and flavour-independent and decay-mode independent searches for a neutral Higgs boson are used in combination to explore the parameter space of the Randall-Sundrum model. In the dataset recorded by the OPAL experiment at LEP, no evidence for radion or Higgs particle production was observed in any of those searches at centre-of-mass energies up to 209 GeV. The results are used to set limits on the radion and Higgs boson masses. For all parameters of the Randall-Sundrum model, the data exclude masses below 58 GeV for the mass eigenstate which becomes the Higgs boson in the no-mixing limit

Automatic Planning of External Search Engine Optimization

Directory of Open Access Journals (Sweden)

Vita Jasevičiūtė

2015-07-01

Full Text Available This paper describes an investigation of the external search engine optimization (SEO action planning tool, dedicated to automatically extract a small set of most important keywords for each month during whole year period. The keywords in the set are extracted accordingly to external measured parameters, such as average number of searches during the year and for every month individually. Additionally the position of the optimized web site for each keyword is taken into account. The generated optimization plan is similar to the optimization plans prepared manually by the SEO professionals and can be successfully used as a support tool for web site search engine optimization.

Recent results on the search for continuous sources with LIGO and GEO 600

International Nuclear Information System (INIS)

Sintes, Alicia M

2006-01-01

An overview of the searches for continuous gravitational wave signals in LIGO and GEO 600 performed on different recent science runs and results are presented. This includes both searching for gravitational waves from known pulsars as well as blind searches over a wide parameter space

arXiv Search for new physics in events with a leptonically decaying Z boson and a large transverse momentum imbalance in proton-proton collisions at $\\sqrt{s} $ = 13 TeV

CERN Document Server

Sirunyan, Albert M; CMS Collaboration; Adam, Wolfgang; Ambrogi, Federico; Asilar, Ece; Bergauer, Thomas; Brandstetter, Johannes; Brondolin, Erica; Dragicevic, Marko; Erö, Janos; Escalante Del Valle, Alberto; Flechl, Martin; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Grossmann, Johannes; Hrubec, Josef; Jeitler, Manfred; König, Axel; Krammer, Natascha; Krätschmer, Ilse; Liko, Dietrich; Madlener, Thomas; Mikulec, Ivan; Pree, Elias; Rad, Navid; Rohringer, Herbert; Schieck, Jochen; Schöfbeck, Robert; Spanring, Markus; Spitzbart, Daniel; Waltenberger, Wolfgang; Wittmann, Johannes; Wulz, Claudia-Elisabeth; Zarucki, Mateusz; Chekhovsky, Vladimir; Mossolov, Vladimir; Suarez Gonzalez, Juan; De Wolf, Eddi A; Di Croce, Davide; Janssen, Xavier; Lauwers, Jasper; Van De Klundert, Merijn; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Abu Zeid, Shimaa; Blekman, Freya; D'Hondt, Jorgen; De Bruyn, Isabelle; De Clercq, Jarne; Deroover, Kevin; Flouris, Giannis; Lontkovskyi, Denys; Lowette, Steven; Marchesini, Ivan; Moortgat, Seth; Moreels, Lieselotte; Python, Quentin; Skovpen, Kirill; Tavernier, Stefaan; Van Doninck, Walter; Van Mulders, Petra; Van Parijs, Isis; Beghin, Diego; Bilin, Bugra; Brun, Hugues; Clerbaux, Barbara; De Lentdecker, Gilles; Delannoy, Hugo; Dorney, Brian; Fasanella, Giuseppe; Favart, Laurent; Goldouzian, Reza; Grebenyuk, Anastasia; Kalsi, Amandeep Kaur; Lenzi, Thomas; Luetic, Jelena; Maerschalk, Thierry; Marinov, Andrey; Seva, Tomislav; Starling, Elizabeth; Vander Velde, Catherine; Vanlaer, Pascal; Vannerom, David; Yonamine, Ryo; Zenoni, Florian; Cornelis, Tom; Dobur, Didar; Fagot, Alexis; Gul, Muhammad; Khvastunov, Illia; Poyraz, Deniz; Roskas, Christos; Salva Diblen, Sinem; Tytgat, Michael; Verbeke, Willem; Zaganidis, Nicolas; Bakhshiansohi, Hamed; Bondu, Olivier; Brochet, Sébastien; Bruno, Giacomo; Caputo, Claudio; Caudron, Adrien; David, Pieter; De Visscher, Simon; Delaere, Christophe; Delcourt, Martin; Francois, Brieuc; Giammanco, Andrea; Komm, Matthias; Krintiras, Georgios; Lemaitre, Vincent; Magitteri, Alessio; Mertens, Alexandre; Musich, Marco; Piotrzkowski, Krzysztof; Quertenmont, Loic; Saggio, Alessia; Vidal Marono, Miguel; Wertz, Sébastien; Zobec, Joze; 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; Coelho, Eduardo; Melo Da Costa, Eliza; Da Silveira, Gustavo Gil; De Jesus Damiao, Dilson; Fonseca De Souza, Sandro; Huertas Guativa, Lina Milena; Malbouisson, Helena; Melo De Almeida, Miqueias; Mora Herrera, Clemencia; Mundim, Luiz; Nogima, Helio; Sanchez Rosas, Luis Junior; Santoro, Alberto; Sznajder, Andre; Thiel, Mauricio; Tonelli Manganote, Edmilson José; Torres Da Silva De Araujo, Felipe; Vilela Pereira, Antonio; Ahuja, Sudha; Bernardes, Cesar Augusto; Tomei, Thiago; De Moraes Gregores, Eduardo; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Romero Abad, David; Ruiz Vargas, José Cupertino; Aleksandrov, Aleksandar; Hadjiiska, Roumyana; Iaydjiev, Plamen; Misheva, Milena; Rodozov, Mircho; Shopova, Mariana; Sultanov, Georgi; Dimitrov, Anton; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Fang, Wenxing; Gao, Xuyang; Yuan, Li; Ahmad, Muhammad; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Chen, Mingshui; Chen, Ye; Jiang, Chun-Hua; Leggat, Duncan; Liao, Hongbo; Liu, Zhenan; Romeo, Francesco; Shaheen, Sarmad Masood; Spiezia, Aniello; Tao, Junquan; Wang, Chunjie; Wang, Zheng; Yazgan, Efe; Zhang, Huaqiao; Zhang, Sijing; Zhao, Jingzhou; Ban, Yong; Chen, Geng; Li, Jing; Li, Qiang; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Wang, Dayong; Xu, Zijun; Zhang, Fengwangdong; Wang, Yi; Avila, Carlos; Cabrera, Andrés; Chaparro Sierra, Luisa Fernanda; Florez, Carlos; González Hernández, Carlos Felipe; Ruiz Alvarez, José David; Segura Delgado, Manuel Alejandro; Courbon, Benoit; Godinovic, Nikola; Lelas, Damir; Puljak, Ivica; Ribeiro Cipriano, Pedro M; Sculac, Toni; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Ferencek, Dinko; Kadija, Kreso; Mesic, Benjamin; Starodumov, Andrei; Susa, Tatjana; Ather, Mohsan Waseem; Attikis, Alexandros; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Rykaczewski, Hans; Finger, Miroslav; Finger Jr, Michael; Carrera Jarrin, Edgar; Assran, Yasser; Elgammal, Sherif; Mahrous, Ayman; Dewanjee, Ram Krishna; Kadastik, Mario; Perrini, Lucia; Raidal, Martti; Tiko, Andres; Veelken, Christian; Eerola, Paula; Kirschenmann, Henning; Pekkanen, Juska; Voutilainen, Mikko; Havukainen, Joona; Heikkilä, Jaana Kristiina; Jarvinen, Terhi; Karimäki, Veikko; Kinnunen, Ritva; Lampén, Tapio; Lassila-Perini, Kati; Laurila, Santeri; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Siikonen, Hannu; Tuominen, Eija; Tuominiemi, Jorma; Tuuva, Tuure; Besancon, Marc; Couderc, Fabrice; Dejardin, Marc; Denegri, Daniel; Faure, Jean-Louis; Ferri, Federico; Ganjour, Serguei; Ghosh, Saranya; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Kucher, Inna; Leloup, Clément; Locci, Elizabeth; Machet, Martina; Malcles, Julie; Negro, Giulia; Rander, John; Rosowsky, André; Sahin, Mehmet Özgür; Titov, Maksym; Abdulsalam, Abdulla; Amendola, Chiara; Antropov, Iurii; Baffioni, Stephanie; Beaudette, Florian; Busson, Philippe; Cadamuro, Luca; Charlot, Claude; Granier de Cassagnac, Raphael; Jo, Mihee; Lisniak, Stanislav; Lobanov, Artur; Martin Blanco, Javier; Nguyen, Matthew; Ochando, Christophe; Ortona, Giacomo; Paganini, Pascal; Pigard, Philipp; Salerno, Roberto; Sauvan, Jean-Baptiste; Sirois, Yves; Stahl Leiton, Andre Govinda; Strebler, Thomas; Yilmaz, Yetkin; Zabi, Alexandre; Zghiche, Amina; Agram, Jean-Laurent; Andrea, Jeremy; 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; Jansová, Markéta; Le Bihan, Anne-Catherine; Tonon, Nicolas; Van Hove, Pierre; Gadrat, Sébastien; Beauceron, Stephanie; Bernet, Colin; Boudoul, Gaelle; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Fay, Jean; Finco, Linda; 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; Sordini, Viola; Vander Donckt, Muriel; Viret, Sébastien; Khvedelidze, Arsen; Lomidze, David; Autermann, Christian; Feld, Lutz; Kiesel, Maximilian Knut; Klein, Katja; Lipinski, Martin; Preuten, Marius; Schomakers, Christian; Schulz, Johannes; Teroerde, Marius; Zhukov, Valery; Albert, Andreas; 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; Pook, Tobias; Radziej, Markus; Reithler, Hans; Rieger, Marcel; Scheuch, Florian; Teyssier, Daniel; Thüer, Sebastian; Flügge, Günter; Kargoll, Bastian; Kress, Thomas; Künsken, Andreas; 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; Bermúdez Martínez, Armando; Bin Anuar, Afiq Aizuddin; Borras, Kerstin; Botta, Valeria; Campbell, Alan; Connor, Patrick; Contreras-Campana, Christian; Costanza, Francesco; Diez Pardos, Carmen; Eckerlin, Guenter; Eckstein, Doris; Eichhorn, Thomas; Eren, Engin; Gallo, Elisabetta; Garay Garcia, Jasone; Geiser, Achim; Grados Luyando, Juan Manuel; Grohsjean, Alexander; Gunnellini, Paolo; Guthoff, Moritz; Harb, Ali; Hauk, Johannes; Hempel, Maria; Jung, Hannes; Mohamed, Ashraf; Kasemann, Matthias; Keaveney, James; Kleinwort, Claus; Korol, Ievgen; Krücker, Dirk; Lange, Wolfgang; Lelek, Aleksandra; Lenz, Teresa; Leonard, Jessica; Lipka, Katerina; Lohmann, Wolfgang; Mankel, Rainer; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mittag, Gregor; Mnich, Joachim; Mussgiller, Andreas; Ntomari, Eleni; Pitzl, Daniel; Raspereza, Alexei; Savitskyi, Mykola; Saxena, Pooja; Shevchenko, Rostyslav; Stefaniuk, Nazar; Van Onsem, Gerrit Patrick; Walsh, Roberval; Wen, Yiwen; Wichmann, Katarzyna; Wissing, Christoph; Zenaiev, Oleksandr; Aggleton, Robin; Bein, Samuel; Blobel, Volker; Centis Vignali, Matteo; Dreyer, Torben; Garutti, Erika; Gonzalez, Daniel; Haller, Johannes; Hinzmann, Andreas; Hoffmann, Malte; Karavdina, Anastasia; Klanner, Robert; Kogler, Roman; Kovalchuk, Nataliia; Kurz, Simon; Lapsien, Tobias; Marconi, Daniele; Meyer, Mareike; Niedziela, Marek; Nowatschin, Dominik; Pantaleo, Felice; Peiffer, Thomas; Perieanu, Adrian; Scharf, Christian; Schleper, Peter; Schmidt, Alexander; Schumann, Svenja; Schwandt, Joern; Sonneveld, Jory; Stadie, Hartmut; Steinbrück, Georg; Stober, Fred-Markus Helmut; Stöver, Marc; Tholen, Heiner; Troendle, Daniel; Usai, Emanuele; Vanhoefer, Annika; Vormwald, Benedikt; Akbiyik, Melike; Barth, Christian; Baselga, Marta; Baur, Sebastian; Butz, Erik; Caspart, René; Chwalek, Thorsten; Colombo, Fabio; De Boer, Wim; Dierlamm, Alexander; Faltermann, Nils; Freund, Benedikt; Friese, Raphael; Giffels, Manuel; Harrendorf, Marco Alexander; Hartmann, Frank; Heindl, Stefan Michael; Husemann, Ulrich; Kassel, Florian; Kudella, Simon; Mildner, Hannes; Mozer, Matthias Ulrich; Müller, Thomas; Plagge, Michael; Quast, Gunter; Rabbertz, Klaus; 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; Kyriakis, Aristotelis; Loukas, Demetrios; Topsis-Giotis, Iasonas; Karathanasis, George; Kesisoglou, Stilianos; Panagiotou, Apostolos; Saoulidou, Niki; Kousouris, Konstantinos; Evangelou, Ioannis; Foudas, Costas; Gianneios, Paraskevas; Katsoulis, Panagiotis; Kokkas, Panagiotis; Mallios, Stavros; Manthos, Nikolaos; Papadopoulos, Ioannis; Paradas, Evangelos; Strologas, John; Triantis, Frixos A; Tsitsonis, Dimitrios; Csanad, Mate; Filipovic, Nicolas; Pasztor, Gabriella; Surányi, Olivér; Veres, Gabor Istvan; Bencze, Gyorgy; Hajdu, Csaba; Horvath, Dezso; Hunyadi, Ádám; Sikler, Ferenc; Veszpremi, Viktor; Beni, Noemi; Czellar, Sandor; Karancsi, János; Makovec, Alajos; Molnar, Jozsef; Szillasi, Zoltan; Bartók, Márton; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Choudhury, Somnath; Komaragiri, Jyothsna Rani; Bahinipati, Seema; Bhowmik, Sandeep; Mal, Prolay; Mandal, Koushik; Nayak, Aruna; Sahoo, Deepak Kumar; Sahoo, Niladribihari; Swain, Sanjay Kumar; Bansal, Sunil; Beri, Suman Bala; Bhatnagar, Vipin; Chawla, Ridhi; Dhingra, Nitish; Kaur, Anterpreet; Kaur, Manjit; Kaur, Sandeep; Kumar, Ramandeep; Kumari, Priyanka; Mehta, Ankita; Singh, Jasbir; Walia, Genius; Kumar, Ashok; Shah, Aashaq; Bhardwaj, Ashutosh; Chauhan, Sushil; Choudhary, Brajesh C; Garg, Rocky Bala; Keshri, Sumit; Kumar, Ajay; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Ramkrishna; Bhardwaj, Rishika; Bhattacharya, Rajarshi; Bhattacharya, Satyaki; Bhawandeep, Bhawandeep; Dey, Sourav; Dutt, Suneel; Dutta, Suchandra; Ghosh, Shamik; Majumdar, Nayana; Modak, Atanu; Mondal, Kuntal; Mukhopadhyay, Supratik; Nandan, Saswati; Purohit, Arnab; Roy, Ashim; 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; Mahakud, Bibhuprasad; Mitra, Soureek; Mohanty, Gagan Bihari; Sur, Nairit; Sutar, Bajrang; Banerjee, Sudeshna; Bhattacharya, Soham; Chatterjee, Suman; Das, Pallabi; 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; Colaleo, Anna; Creanza, Donato; Cristella, Leonardo; De Filippis, Nicola; De Palma, Mauro; Errico, Filippo; Fiore, Luigi; Iaselli, Giuseppe; Lezki, Samet; 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; Borgonovi, Lisa; Braibant-Giacomelli, Sylvie; 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; Chatterjee, Kalyanmoy; 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; Ravera, Fabio; Robutti, Enrico; Tosi, Silvano; Benaglia, Andrea; Beschi, Andrea; 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; Pauwels, Kristof; Pedrini, Daniele; Pigazzini, Simone; Ragazzi, Stefano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Cavallo, Nicola; Di Guida, Salvatore; Fabozzi, Francesco; Fienga, Francesco; Iorio, Alberto Orso Maria; Khan, Wajid Ali; Lista, Luca; Meola, Sabino; Paolucci, Pierluigi; Sciacca, Crisostomo; Thyssen, Filip; Azzi, Patrizia; Bacchetta, Nicola; Benato, Lisa; Bisello, Dario; Boletti, Alessio; 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; Lujan, Paul; Margoni, Martino; Meneguzzo, Anna Teresa; Pozzobon, Nicola; Ronchese, Paolo; Rossin, Roberto; Simonetto, Franco; Torassa, Ezio; Zanetti, Marco; Zotto, Pierluigi; Zumerle, Gianni; Braghieri, Alessandro; Magnani, Alice; Montagna, Paolo; Ratti, Sergio P; Re, Valerio; Ressegotti, Martina; Riccardi, Cristina; Salvini, Paola; Vai, Ilaria; Vitulo, Paolo; Alunni Solestizi, Luisa; Biasini, Maurizio; Bilei, Gian Mario; Cecchi, Claudia; Ciangottini, Diego; Fanò, Livio; Leonardi, Roberto; Manoni, Elisa; Mantovani, Giancarlo; Mariani, Valentina; Menichelli, Mauro; Rossi, Alessandro; Santocchia, Attilio; Spiga, Daniele; Androsov, Konstantin; Azzurri, Paolo; Bagliesi, Giuseppe; Boccali, Tommaso; Borrello, Laura; Castaldi, Rino; Ciocci, Maria Agnese; Dell'Orso, Roberto; Fedi, Giacomo; Giannini, Leonardo; Giassi, Alessandro; Grippo, Maria Teresa; Ligabue, Franco; Lomtadze, Teimuraz; Manca, Elisabetta; Mandorli, Giulio; 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; Daci, Nadir; Del Re, Daniele; Di Marco, Emanuele; 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; 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; 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, Jeongeun; Lee, Sangeun; Lee, Seh Wook; Moon, Chang-Seong; Oh, Young Do; Sekmen, Sezen; Son, Dong-Chul; Yang, Yu Chul; Lee, Ari; Kim, Hyunchul; Moon, Dong Ho; Oh, Geonhee; Brochero Cifuentes, Javier Andres; Goh, Junghwan; 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; Kim, Jae Sung; Lee, Haneol; Lee, Kyeongpil; Nam, Kyungwook; Oh, Sung Bin; Radburn-Smith, Benjamin Charles; Seo, Seon-hee; Yang, Unki; Yoo, Hwi Dong; Yu, Geum Bong; Kim, Hyunyong; Kim, Ji Hyun; Lee, Jason Sang Hun; Park, Inkyu; Choi, Young-Il; 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; Reyes-Almanza, Rogelio; Ramirez-Sanchez, Gabriel; Duran-Osuna, Cecilia; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-De La Cruz, Ivan; Rabadán-Trejo, Raúl Iraq; Lopez-Fernandez, Ricardo; Mejia Guisao, Jhovanny; Sánchez Hernández, Alberto; Carrillo Moreno, Salvador; Oropeza Barrera, Cristina; Vazquez Valencia, Fabiola; Eysermans, Jan; 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; Saddique, Asif; Shah, Mehar Ali; Shoaib, Muhammad; Waqas, Muhammad; Bialkowska, Helena; Bluj, Michal; Boimska, Bozena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Szleper, Michal; Zalewski, Piotr; Bunkowski, Karol; Byszuk, Adrian; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Olszewski, Michal; Pyskir, Andrzej; Walczak, Marek; Bargassa, Pedrame; Beirão Da Cruz E Silva, Cristóvão; Di Francesco, Agostino; Faccioli, Pietro; Galinhas, Bruno; Gallinaro, Michele; Hollar, Jonathan; Leonardo, Nuno; Lloret Iglesias, Lara; Nemallapudi, Mythra Varun; Seixas, Joao; Strong, Giles; Toldaiev, Oleksii; Vadruccio, Daniele; Varela, Joao; Afanasiev, Serguei; Golunov, Alexander; Golutvin, Igor; Gorbounov, Nikolai; 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; Ivanov, Yury; Kim, Victor; Kuznetsova, Ekaterina; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sosnov, Dmitry; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; 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; Stepennov, Anton; Toms, Maria; Vlasov, Evgueni; Zhokin, Alexander; Aushev, Tagir; Bylinkin, Alexander; Chadeeva, Marina; Parygin, Pavel; Philippov, Dmitry; Polikarpov, Sergey; Popova, Elena; Rusinov, Vladimir; Zhemchugov, Evgenii; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; 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; Blinov, Vladimir; Skovpen, Yuri; Shtol, Dmitry; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Elumakhov, Dmitry; Godizov, Anton; Kachanov, Vassili; Kalinin, Alexey; Konstantinov, Dmitri; Mandrik, Petr; 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; Bachiller, Irene; Barrio Luna, Mar; Cerrada, Marcos; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Flix, Jose; Fouz, Maria Cruz; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Moran, Dermot; Pérez-Calero Yzquierdo, Antonio María; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Senghi Soares, Mara; Álvarez Fernández, Adrian; Albajar, Carmen; de Trocóniz, Jorge F; Missiroli, Marino; Cuevas, Javier; Erice, Carlos; Fernandez Menendez, Javier; Gonzalez Caballero, Isidro; González Fernández, Juan Rodrigo; Palencia Cortezon, Enrique; Sanchez Cruz, Sergio; Vischia, Pietro; Vizan Garcia, Jesus Manuel; Cabrillo, Iban Jose; Calderon, Alicia; Chazin Quero, Barbara; Curras, Esteban; Duarte Campderros, Jordi; Fernandez, Marcos; Garcia-Ferrero, Juan; Gomez, Gervasio; Lopez Virto, Amparo; Marco, Jesus; Martinez Rivero, Celso; Martinez Ruiz del Arbol, Pablo; Matorras, Francisco; Piedra Gomez, Jonatan; Rodrigo, Teresa; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Trevisani, Nicolò; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Akgun, Bora; Auffray, Etiennette; Baillon, Paul; Ball, Austin; Barney, David; Bendavid, Joshua; Bianco, Michele; Bloch, Philippe; Bocci, Andrea; Botta, Cristina; Camporesi, Tiziano; Castello, Roberto; Cepeda, Maria; Cerminara, Gianluca; Chapon, Emilien; Chen, Yi; D'Enterria, David; Dabrowski, Anne; Daponte, Vincenzo; David Tinoco Mendes, Andre; De Gruttola, Michele; De Roeck, Albert; Deelen, Nikkie; Dobson, Marc; Du Pree, Tristan; Dünser, Marc; Dupont, Niels; Elliott-Peisert, Anna; Everaerts, Pieter; Fallavollita, Francesco; Franzoni, Giovanni; Fulcher, Jonathan; Funk, Wolfgang; Gigi, Dominique; Gilbert, Andrew; Gill, Karl; Glege, Frank; Gulhan, Doga; Harris, Philip; Hegeman, Jeroen; Innocente, Vincenzo; Jafari, Abideh; Janot, Patrick; Karacheban, Olena; Kieseler, Jan; Knünz, Valentin; Kornmayer, Andreas; Kortelainen, Matti J; 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; Mulders, Martijn; Neugebauer, Hannes; Ngadiuba, Jennifer; Orfanelli, Styliani; Orsini, Luciano; Pape, Luc; Perez, Emmanuel; Peruzzi, Marco; Petrilli, Achille; Petrucciani, Giovanni; Pfeiffer, Andreas; Pierini, Maurizio; Rabady, Dinyar; Racz, Attila; Reis, Thomas; Rolandi, Gigi; Rovere, Marco; Sakulin, Hannes; Schäfer, Christoph; Schwick, Christoph; Seidel, Markus; Selvaggi, Michele; Sharma, Archana; Silva, Pedro; Sphicas, Paraskevas; Stakia, Anna; Steggemann, Jan; Stoye, Markus; Tosi, Mia; Treille, Daniel; Triossi, Andrea; Tsirou, Andromachi; Veckalns, Viesturs; Verweij, Marta; Zeuner, Wolfram Dietrich; Bertl, Willi; Caminada, Lea; Deiters, Konrad; Erdmann, Wolfram; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; Kotlinski, Danek; Langenegger, Urs; Rohe, Tilman; Wiederkehr, Stephan Albert; Backhaus, Malte; Bäni, Lukas; Berger, Pirmin; Bianchini, Lorenzo; Casal, Bruno; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Dorfer, Christian; Grab, Christoph; Heidegger, Constantin; Hits, Dmitry; Hoss, Jan; Kasieczka, Gregor; Klijnsma, Thomas; Lustermann, Werner; Mangano, Boris; Marionneau, Matthieu; 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; Reichmann, Michael; Sanz Becerra, Diego Alejandro; Schönenberger, Myriam; Shchutska, Lesya; Tavolaro, Vittorio Raoul; Theofilatos, Konstantinos; Vesterbacka Olsson, Minna Leonora; Wallny, Rainer; Zhu, De Hua; Aarrestad, Thea Klaeboe; Amsler, Claude; Canelli, Maria Florencia; De Cosa, Annapaola; Del Burgo, Riccardo; Donato, Silvio; Galloni, Camilla; Hreus, Tomas; Kilminster, Benjamin; Pinna, Deborah; Rauco, Giorgia; Robmann, Peter; Salerno, Daniel; Schweiger, Korbinian; Seitz, Claudia; Takahashi, Yuta; Zucchetta, Alberto; Candelise, Vieri; Chang, Yu-Hsiang; Cheng, Kai-yu; Doan, Thi Hien; Jain, Shilpi; Khurana, Raman; Kuo, Chia-Ming; Lin, Willis; Pozdnyakov, Andrey; Yu, Shin-Shan; Kumar, Arun; Chang, Paoti; Chao, Yuan; Chen, Kai-Feng; Chen, Po-Hsun; Fiori, Francesco; Hou, George Wei-Shu; Hsiung, Yee; Liu, Yueh-Feng; Lu, Rong-Shyang; Paganis, Efstathios; Psallidas, Andreas; Steen, Arnaud; Tsai, Jui-fa; Asavapibhop, Burin; Kovitanggoon, Kittikul; Singh, Gurpreet; Srimanobhas, Norraphat; Bat, Ayse; Boran, Fatma; 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; Tok, Ufuk Guney; Turkcapar, Semra; Zorbakir, Ibrahim Soner; Zorbilmez, Caglar; Karapinar, Guler; Ocalan, Kadir; Yalvac, Metin; Zeyrek, Mehmet; Gülmez, Erhan; Kaya, Mithat; Kaya, Ozlem; Tekten, Sevgi; Yetkin, Elif Asli; Nazlim Agaras, Merve; Atay, Serhat; Cakir, Altan; Cankocak, Kerem; Köseoglu, Ilknur; Grynyov, Boris; Levchuk, Leonid; Ball, Fionn; Beck, Lana; Brooke, James John; Burns, Douglas; Clement, Emyr; Cussans, David; Davignon, Olivier; Flacher, Henning; Goldstein, Joel; Heath, Greg P; Heath, Helen F; Kreczko, Lukasz; Newbold, Dave M; Paramesvaran, Sudarshan; 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; Linacre, Jacob; Olaiya, Emmanuel; Petyt, David; Shepherd-Themistocleous, Claire; Thea, Alessandro; Tomalin, Ian R; Williams, Thomas; Auzinger, Georg; Bainbridge, Robert; Borg, Johan; Breeze, Shane; Buchmuller, Oliver; Bundock, Aaron; Casasso, Stefano; Citron, Matthew; Colling, David; Corpe, Louie; Dauncey, Paul; Davies, Gavin; De Wit, Adinda; Della Negra, Michel; Di Maria, Riccardo; Elwood, Adam; Haddad, Yacine; Hall, Geoffrey; Iles, Gregory; James, Thomas; Lane, Rebecca; Laner, Christian; Lyons, Louis; Magnan, Anne-Marie; Malik, Sarah; Mastrolorenzo, Luca; Matsushita, Takashi; Nash, Jordan; Nikitenko, Alexander; Palladino, Vito; Pesaresi, Mark; Raymond, David Mark; Richards, Alexander; Rose, Andrew; Scott, Edward; Seez, Christopher; Shtipliyski, Antoni; Summers, Sioni; Tapper, Alexander; Uchida, Kirika; Vazquez Acosta, Monica; Virdee, Tejinder; Wardle, Nicholas; Winterbottom, Daniel; Wright, Jack; Zenz, Seth Conrad; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Reid, Ivan; Teodorescu, Liliana; Zahid, Sema; Borzou, Ahmad; Call, Kenneth; Dittmann, Jay; Hatakeyama, Kenichi; Liu, Hongxuan; Pastika, Nathaniel; Smith, Caleb; 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; Hadley, Mary; Hakala, John; Heintz, Ulrich; Hogan, Julie Managan; Kwok, Ka Hei Martin; Laird, Edward; Landsberg, Greg; Lee, Jangbae; Mao, Zaixing; Narain, Meenakshi; Pazzini, Jacopo; Piperov, Stefan; Sagir, Sinan; Syarif, Rizki; Yu, David; Band, Reyer; Brainerd, Christopher; Breedon, Richard; Burns, Dustin; Calderon De La Barca Sanchez, Manuel; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Erbacher, Robin; Flores, Chad; Funk, Garrett; Ko, Winston; Lander, Richard; Mclean, Christine; Mulhearn, Michael; Pellett, Dave; Pilot, Justin; Shalhout, Shalhout; Shi, Mengyao; Smith, John; Stolp, Dustin; Tos, Kyle; Tripathi, Mani; Wang, Zhangqier; Bachtis, Michail; Bravo, Cameron; Cousins, Robert; Dasgupta, Abhigyan; Florent, Alice; Hauser, Jay; Ignatenko, Mikhail; Mccoll, Nickolas; Regnard, Simon; Saltzberg, David; Schnaible, Christian; Valuev, Vyacheslav; Bouvier, Elvire; Burt, Kira; Clare, Robert; Ellison, John Anthony; Gary, J William; Ghiasi Shirazi, Seyyed Mohammad Amin; Hanson, Gail; Heilman, Jesse; Karapostoli, Georgia; Kennedy, Elizabeth; Lacroix, Florent; Long, Owen Rosser; Olmedo Negrete, Manuel; Paneva, Mirena Ivova; Si, Weinan; Wang, Long; Wei, Hua; Wimpenny, Stephen; Yates, Brent; Branson, James G; Cittolin, Sergio; Derdzinski, Mark; Gerosa, Raffaele; Gilbert, Dylan; Hashemi, Bobak; Holzner, André; Klein, Daniel; Kole, Gouranga; Krutelyov, Vyacheslav; Letts, James; Masciovecchio, Mario; Olivito, Dominick; Padhi, Sanjay; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Tadel, Matevz; Vartak, Adish; Wasserbaech, Steven; 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; Gouskos, Loukas; Heller, Ryan; Incandela, Joe; Ovcharova, Ana; Qu, Huilin; Richman, Jeffrey; Stuart, David; Suarez, Indara; Yoo, Jaehyeok; Anderson, Dustin; Bornheim, Adolf; Lawhorn, Jay Mathew; Newman, Harvey B; Nguyen, Thong; Pena, Cristian; Spiropulu, Maria; Vlimant, Jean-Roch; Xie, Si; Zhang, Zhicai; Zhu, Ren-Yuan; Andrews, Michael Benjamin; Ferguson, Thomas; Mudholkar, Tanmay; 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; Patterson, Juliet Ritchie; Quach, Dan; Rinkevicius, Aurelijus; Ryd, Anders; Skinnari, Louise; Soffi, Livia; Tan, Shao Min; Tao, Zhengcheng; Thom, Julia; Tucker, Jordan; Wittich, Peter; Zientek, Margaret; Abdullin, Salavat; Albrow, Michael; Alyari, Maral; Apollinari, Giorgio; Apresyan, Artur; Apyan, Aram; Banerjee, Sunanda; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bolla, Gino; Burkett, Kevin; Butler, Joel Nathan; Canepa, Anadi; Cerati, Giuseppe Benedetto; Cheung, Harry; Chlebana, Frank; Cremonesi, Matteo; Duarte, Javier; Elvira, Victor Daniel; Freeman, Jim; Gecse, Zoltan; Gottschalk, Erik; Gray, Lindsey; Green, Dan; Grünendahl, Stefan; Gutsche, Oliver; Harris, Robert M; Hasegawa, Satoshi; Hirschauer, James; Hu, Zhen; Jayatilaka, Bodhitha; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kreis, Benjamin; Lammel, Stephan; Lincoln, Don; Lipton, Ron; Liu, Miaoyuan; Liu, Tiehui; Lopes De Sá, Rafael; Lykken, Joseph; Maeshima, Kaori; Magini, Nicolo; Marraffino, John Michael; Mason, David; McBride, Patricia; Merkel, Petra; Mrenna, Stephen; Nahn, Steve; O'Dell, Vivian; Pedro, Kevin; Prokofyev, Oleg; Rakness, Gregory; Ristori, Luciano; Schneider, Basil; 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; Acosta, Darin; Avery, Paul; Bortignon, Pierluigi; Bourilkov, Dimitri; Brinkerhoff, Andrew; Carnes, Andrew; Carver, Matthew; Curry, David; Field, Richard D; Furic, Ivan-Kresimir; Gleyzer, Sergei V; Joshi, Bhargav Madhusudan; Konigsberg, Jacobo; Korytov, Andrey; Kotov, Khristian; Ma, Peisen; Matchev, Konstantin; Mei, Hualin; Mitselmakher, Guenakh; Shi, Kun; Sperka, David; Terentyev, Nikolay; Thomas, Laurent; Wang, Jian; Wang, Sean-Jiun; Yelton, John; Joshi, Yagya Raj; Linn, Stephan; Markowitz, Pete; Rodriguez, Jorge Luis; Ackert, Andrew; Adams, Todd; Askew, Andrew; Hagopian, Sharon; Hagopian, Vasken; Johnson, Kurtis F; Kolberg, Ted; Martinez, German; Perry, Thomas; Prosper, Harrison; Saha, Anirban; Santra, Arka; Sharma, Varun; 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; Cavanaugh, Richard; Chen, Xuan; Evdokimov, Olga; Gerber, Cecilia Elena; Hangal, Dhanush Anil; Hofman, David Jonathan; Jung, Kurt; Kamin, Jason; Sandoval Gonzalez, Irving Daniel; Tonjes, Marguerite; Trauger, Hallie; Varelas, Nikos; Wang, Hui; Wu, Zhenbin; 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; Khalil, Sadia; Kropivnitskaya, Anna; Majumder, Devdatta; Mcbrayer, William; Murray, Michael; Rogan, Christopher; Royon, Christophe; Sanders, Stephen; Schmitz, Erich; Tapia Takaki, Daniel; Wang, Quan; Ivanov, Andrew; Kaadze, Ketino; Maravin, Yurii; Mohammadi, Abdollah; Saini, Lovedeep Kaur; Skhirtladze, Nikoloz; Rebassoo, Finn; Wright, Douglas; Anelli, Christopher; Baden, Drew; Baron, Owen; Belloni, Alberto; Eno, Sarah Catherine; Feng, Yongbin; Ferraioli, Charles; Hadley, Nicholas John; Jabeen, Shabnam; Jeng, Geng-Yuan; Kellogg, Richard G; Kunkle, Joshua; Mignerey, Alice; Ricci-Tam, Francesca; Shin, Young Ho; Skuja, Andris; Tonwar, Suresh C; Abercrombie, Daniel; Allen, Brandon; Azzolini, Virginia; Barbieri, Richard; Baty, Austin; Bi, Ran; Brandt, Stephanie; Busza, Wit; Cali, Ivan Amos; D'Alfonso, Mariarosaria; Demiragli, Zeynep; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Hsu, Dylan; Hu, Miao; Iiyama, Yutaro; Innocenti, Gian Michele; Klute, Markus; Kovalskyi, Dmytro; 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; Hiltbrand, Joshua; Kalafut, Sean; Kubota, Yuichi; Lesko, Zachary; Mans, Jeremy; Nourbakhsh, Shervin; Ruckstuhl, Nicole; Rusack, Roger; Turkewitz, Jared; Wadud, Mohammad Abrar; Acosta, John Gabriel; Oliveros, Sandra; Avdeeva, Ekaterina; Bloom, Kenneth; Claes, Daniel R; Fangmeier, Caleb; Golf, Frank; Gonzalez Suarez, Rebeca; Kamalieddin, Rami; Kravchenko, Ilya; Monroy, Jose; Siado, Joaquin Emilo; Snow, Gregory R; Stieger, Benjamin; Dolen, James; Godshalk, Andrew; Harrington, Charles; Iashvili, Ia; Nguyen, Duong; Parker, Ashley; Rappoccio, Salvatore; Roozbahani, Bahareh; Alverson, George; Barberis, Emanuela; Freer, Chad; Hortiangtham, Apichart; Massironi, Andrea; Morse, David Michael; Orimoto, Toyoko; Teixeira De Lima, Rafael; Trocino, Daniele; Wamorkar, Tanvi; Wang, Bingran; Wisecarver, Andrew; Wood, Darien; Bhattacharya, Saptaparna; Charaf, Otman; Hahn, Kristan Allan; Mucia, Nicholas; Odell, Nathaniel; Schmitt, Michael Henry; Sung, Kevin; Trovato, Marco; Velasco, Mayda; Bucci, Rachael; Dev, Nabarun; Hildreth, Michael; Hurtado Anampa, Kenyi; Jessop, Colin; Karmgard, Daniel John; Kellams, Nathan; Lannon, Kevin; Li, Wenzhao; Loukas, Nikitas; Marinelli, Nancy; Meng, Fanbo; Mueller, Charles; Musienko, Yuri; Planer, Michael; Reinsvold, Allison; Ruchti, Randy; Siddireddy, Prasanna; Smith, Geoffrey; Taroni, Silvia; Wayne, Mitchell; Wightman, Andrew; Wolf, Matthias; Woodard, Anna; Alimena, Juliette; Antonelli, Louis; Bylsma, Ben; Durkin, Lloyd Stanley; Flowers, Sean; Francis, Brian; Hart, Andrew; Hill, Christopher; Ji, Weifeng; Liu, Bingxuan; Luo, Wuming; Winer, Brian L; Wulsin, Howard Wells; Cooperstein, Stephane; Driga, Olga; Elmer, Peter; Hardenbrook, Joshua; Hebda, Philip; Higginbotham, Samuel; Kalogeropoulos, Alexis; Lange, David; Luo, Jingyu; Marlow, Daniel; Mei, Kelvin; Ojalvo, Isabel; Olsen, James; Palmer, Christopher; Piroué, Pierre; Stickland, David; Tully, Christopher; Malik, Sudhir; Norberg, Scarlet; Barker, Anthony; Barnes, Virgil E; Das, Souvik; Folgueras, Santiago; Gutay, Laszlo; Jha, Manoj; Jones, Matthew; Jung, Andreas Werner; Khatiwada, Ajeeta; Miller, David Harry; Neumeister, Norbert; Peng, Cheng-Chieh; Qiu, Hao; Schulte, Jan-Frederik; Sun, Jian; Wang, Fuqiang; Xiao, Rui; Xie, Wei; Cheng, Tongguang; Parashar, Neeti; Stupak, John; Chen, Zhenyu; Ecklund, Karl Matthew; Freed, Sarah; Geurts, Frank JM; Guilbaud, Maxime; Kilpatrick, Matthew; Li, Wei; Michlin, Benjamin; Padley, Brian Paul; Roberts, Jay; Rorie, Jamal; Shi, Wei; Tu, Zhoudunming; Zabel, James; Zhang, Aobo; 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; Ciesielski, Robert; Goulianos, Konstantin; Mesropian, Christina; 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; Montalvo, Roy; 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; 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; Kamon, Teruki; Mueller, Ryan; Pakhotin, Yuriy; Patel, Rishi; Perloff, Alexx; Perniè, Luca; Rathjens, Denis; Safonov, Alexei; Tatarinov, Aysen; Ulmer, Keith; Akchurin, Nural; Damgov, Jordan; De Guio, Federico; Dudero, Phillip Russell; Faulkner, James; Gurpinar, Emine; Kunori, Shuichi; Lamichhane, Kamal; Lee, Sung Won; Libeiro, Terence; Mengke, Tielige; Muthumuni, Samila; Peltola, Timo; Undleeb, Sonaina; Volobouev, Igor; Wang, Zhixing; Greene, Senta; Gurrola, Alfredo; Janjam, Ravi; Johns, Willard; Maguire, Charles; Melo, Andrew; Ni, Hong; Padeken, Klaas; Sheldon, Paul; Tuo, Shengquan; Velkovska, Julia; Xu, Qiao; Arenton, Michael Wayne; Barria, Patrizia; Cox, Bradley; Hirosky, Robert; Joyce, Matthew; Ledovskoy, Alexander; Li, Hengne; Neu, Christopher; Sinthuprasith, Tutanon; Wang, Yanchu; Wolfe, Evan; Xia, Fan; Harr, Robert; Karchin, Paul Edmund; Poudyal, Nabin; Sturdy, Jared; Thapa, Prakash; Zaleski, Shawn; Brodski, Michael; Buchanan, James; Caillol, Cécile; Dasu, Sridhara; Dodd, Laura; Duric, Senka; Gomber, Bhawna; Grothe, Monika; Herndon, Matthew; Hervé, Alain; Hussain, Usama; Klabbers, Pamela; Lanaro, Armando; Levine, Aaron; Long, Kenneth; Loveless, Richard; Ruggles, Tyler; Savin, Alexander; Smith, Nicholas; Smith, Wesley H; Taylor, Devin; Woods, Nathaniel

2018-04-11

A search for new physics in events with a Z boson produced in association with large missing transverse momentum at the LHC is presented. The search is based on the 2016 data sample of proton-proton collisions recorded with the CMS experiment at $\\sqrt{s} = $ 13 TeV, corresponding to an integrated luminosity of 35.9 fb$^{-1}$. The results of this search are interpreted in terms of a simplified model of dark matter production via spin-0 or spin-1 mediators, a scenario with a standard-model-like Higgs boson produced in association with the Z boson and decaying invisibly, a model of unparticle production, and a model with large extra spatial dimensions. No significant deviations from the background expectations are found, and limits are set on relevant model parameters, significantly extending the results previously achieved in this channel.

Citation searching: a systematic review case study of multiple risk behaviour interventions.

Science.gov (United States)

Wright, Kath; Golder, Su; Rodriguez-Lopez, Rocio

2014-06-03

The value of citation searches as part of the systematic review process is currently unknown. While the major guides to conducting systematic reviews state that citation searching should be carried out in addition to searching bibliographic databases there are still few studies in the literature that support this view. Rather than using a predefined search strategy to retrieve studies, citation searching uses known relevant papers to identify further papers. We describe a case study about the effectiveness of using the citation sources Google Scholar, Scopus, Web of Science and OVIDSP MEDLINE to identify records for inclusion in a systematic review.We used the 40 included studies identified by traditional database searches from one systematic review of interventions for multiple risk behaviours. We searched for each of the included studies in the four citation sources to retrieve the details of all papers that have cited these studies.We carried out two analyses; the first was to examine the overlap between the four citation sources to identify which citation tool was the most useful; the second was to investigate whether the citation searches identified any relevant records in addition to those retrieved by the original database searches. The highest number of citations was retrieved from Google Scholar (1680), followed by Scopus (1173), then Web of Science (1095) and lastly OVIDSP (213). To retrieve all the records identified by the citation tracking searching all four resources was required. Google Scholar identified the highest number of unique citations.The citation tracking identified 9 studies that met the review's inclusion criteria. Eight of these had already been identified by the traditional databases searches and identified in the screening process while the ninth was not available in any of the databases when the original searches were carried out. It would, however, have been identified by two of the database search strategies if searches had been

Developing a Test Collection for the Evaluation of Integrated Search

DEFF Research Database (Denmark)

Lykke, Marianne; Larsen, Birger; Lund, Haakon

2010-01-01

he poster discusses the characteristics needed in an information retrieval (IR) test collection to facilitate the evaluation of integrated search, i.e. search across a range of different sources but with one search box and one ranked result list, and describes and analyses a new test collection c...... assessments. The test collection may be used for systems- as well as user-oriented evaluation.......he poster discusses the characteristics needed in an information retrieval (IR) test collection to facilitate the evaluation of integrated search, i.e. search across a range of different sources but with one search box and one ranked result list, and describes and analyses a new test collection...... constructed for this purpose. The test collection consists of approx. 18,000 monographic records, 160,000 papers and journal articles in PDF and 275,000 abstracts with a varied set of metadata and vocabularies from the physics domain, 65 topics based on real work tasks and corresponding graded relevance...

Posterior α EEG Dynamics Dissociate Current from Future Goals in Working Memory-Guided Visual Search

NARCIS (Netherlands)

de Vries, I.E.J.; van Driel, J.; Olivers, C.N.L.

2017-01-01

Current models of visual search assume that search is guided by an active visual working memory representation of what we are currently looking for. This attentional template for currently relevant stimuli can be dissociated from accessory memory representations that are only needed prospectively,

Short-Term Wind Speed Forecasting Using the Data Processing Approach and the Support Vector Machine Model Optimized by the Improved Cuckoo Search Parameter Estimation Algorithm

Directory of Open Access Journals (Sweden)

Chen Wang

2016-01-01

Full Text Available Power systems could be at risk when the power-grid collapse accident occurs. As a clean and renewable resource, wind energy plays an increasingly vital role in reducing air pollution and wind power generation becomes an important way to produce electrical power. Therefore, accurate wind power and wind speed forecasting are in need. In this research, a novel short-term wind speed forecasting portfolio has been proposed using the following three procedures: (I data preprocessing: apart from the regular normalization preprocessing, the data are preprocessed through empirical model decomposition (EMD, which reduces the effect of noise on the wind speed data; (II artificially intelligent parameter optimization introduction: the unknown parameters in the support vector machine (SVM model are optimized by the cuckoo search (CS algorithm; (III parameter optimization approach modification: an improved parameter optimization approach, called the SDCS model, based on the CS algorithm and the steepest descent (SD method is proposed. The comparison results show that the simple and effective portfolio EMD-SDCS-SVM produces promising predictions and has better performance than the individual forecasting components, with very small root mean squared errors and mean absolute percentage errors.

Sampling criteria in multicollection searching.

Science.gov (United States)

Gilio, A.; Scozzafava, R.; Marchetti, P. G.

In the first stage of the document retrieval process, no information concerning relevance of a particular document is available. On the other hand, computer implementation requires that the analysis be made only for a sample of retrieved documents. This paper addresses the significance and suitability of two different sampling criteria for a multicollection online search facility. The inevitability of resorting to a logarithmic criterion in order to achieve a "spread of representativeness" from the multicollection is demonstrated.

A Secured Cognitive Agent based Multi-strategic Intelligent Search System

Directory of Open Access Journals (Sweden)

Neha Gulati

2018-04-01

Full Text Available Search Engine (SE is the most preferred information retrieval tool ubiquitously used. In spite of vast scale involvement of users in SE’s, their limited capabilities to understand the user/searcher context and emotions places high cognitive, perceptual and learning load on the user to maintain the search momentum. In this regard, the present work discusses a Cognitive Agent (CA based approach to support the user in Web-based search process. The work suggests a framework called Secured Cognitive Agent based Multi-strategic Intelligent Search System (CAbMsISS to assist the user in search process. It helps to reduce the contextual and emotional mismatch between the SE’s and user. After implementation of the proposed framework, performance analysis shows that CAbMsISS framework improves Query Retrieval Time (QRT and effectiveness for retrieving relevant results as compared to Present Search Engine (PSE. Supplementary to this, it also provides search suggestions when user accesses a resource previously tagged with negative emotions. Overall, the goal of the system is to enhance the search experience for keeping the user motivated. The framework provides suggestions through the search log that tracks the queries searched, resources accessed and emotions experienced during the search. The implemented framework also considers user security. Keywords: BDI model, Cognitive Agent, Emotion, Information retrieval, Intelligent search, Search Engine

Optimal Search Strategy of Robotic Assembly Based on Neural Vibration Learning

Directory of Open Access Journals (Sweden)

Lejla Banjanovic-Mehmedovic

2011-01-01

Full Text Available This paper presents implementation of optimal search strategy (OSS in verification of assembly process based on neural vibration learning. The application problem is the complex robot assembly of miniature parts in the example of mating the gears of one multistage planetary speed reducer. Assembly of tube over the planetary gears was noticed as the most difficult problem of overall assembly. The favourable influence of vibration and rotation movement on compensation of tolerance was also observed. With the proposed neural-network-based learning algorithm, it is possible to find extended scope of vibration state parameter. Using optimal search strategy based on minimal distance path between vibration parameter stage sets (amplitude and frequencies of robots gripe vibration and recovery parameter algorithm, we can improve the robot assembly behaviour, that is, allow the fastest possible way of mating. We have verified by using simulation programs that search strategy is suitable for the situation of unexpected events due to uncertainties.

Methodological developments in searching for studies for systematic reviews: past, present and future?

Science.gov (United States)

Lefebvre, Carol; Glanville, Julie; Wieland, L Susan; Coles, Bernadette; Weightman, Alison L

2013-09-25

The Cochrane Collaboration was established in 1993, following the opening of the UK Cochrane Centre in 1992, at a time when searching for studies for inclusion in systematic reviews was not well-developed. Review authors largely conducted their own searches or depended on medical librarians, who often possessed limited awareness and experience of systematic reviews. Guidance on the conduct and reporting of searches was limited. When work began to identify reports of randomized controlled trials (RCTs) for inclusion in Cochrane Reviews in 1992, there were only approximately 20,000 reports indexed as RCTs in MEDLINE and none indexed as RCTs in Embase. No search filters had been developed with the aim of identifying all RCTs in MEDLINE or other major databases. This presented The Cochrane Collaboration with a considerable challenge in identifying relevant studies.Over time, the number of studies indexed as RCTs in the major databases has grown considerably and the Cochrane Central Register of Controlled Trials (CENTRAL) has become the best single source of published controlled trials, with approximately 700,000 records, including records identified by the Collaboration from Embase and MEDLINE. Search filters for various study types, including systematic reviews and the Cochrane Highly Sensitive Search Strategies for RCTs, have been developed. There have been considerable advances in the evidence base for methodological aspects of information retrieval. The Cochrane Handbook for Systematic Reviews of Interventions now provides detailed guidance on the conduct and reporting of searches. Initiatives across The Cochrane Collaboration to improve the quality inter alia of information retrieval include: the recently introduced Methodological Expectations for Cochrane Intervention Reviews (MECIR) programme, which stipulates 'mandatory' and 'highly desirable' standards for various aspects of review conduct and reporting including searching, the development of Standard Training

The Response Surface Methodology speeds up the search for optimal parameters in the photoinactivation of E. coli by Photodynamic Therapy.

Science.gov (United States)

Amaral, Larissa S; Azevedo, Eduardo B; Perussi, Janice R

2018-02-27

Antimicrobial Photodynamic Inactivation (a-PDI) is based on the oxidative destruction of biological molecules by reactive oxygen species generated by the photo-excitation of a photosensitive molecule. When the a-PDT is performed along with the use of mathematical models, the optimal conditions for maximum inactivation are easily found. Experimental designs allow a multivariate analysis of the experimental parameters. This is usually made using a univariate approach, which demands a large number of experiments, being time and money consuming. This paper presents the use of the response surface methodology for improving the search for the best conditions to reduce E. coli survival levels by a-PDT using methylene blue (MB) and toluidine blue (TB) as photosensitizers and white light. The goal was achieved by analyzing the effects and interactions of the three main parameters involved in the process: incubation time (IT), photosensitizer concentration (C PS ), and light dose (LD). The optimization procedure began with a full 2 3 factorial design, followed by a central composite one, in which the optimal conditions were estimated. For MB, C PS was the most important parameter followed by LD and IT whereas, for TB, the main parameter was LD followed by C PS and IT. Using the estimated optimal conditions for inactivation, MB was able to inactivate 99.999999% CFU mL -1 of E. coli with IT of 28 min, LD of 31 J cm -2 , and C PS of 32 μmol L -1 , while TB required 18 min, 39 J cm -2 , and 37 μmol L -1 . The feasibility of using the response surface methodology with a-PDT was demonstrated, enabling enhanced photoinactivation efficiency and fast results with a minimal number of experiments. Copyright © 2018. Published by Elsevier B.V.

Searches for Higgs bosons and supersymmetry at LEP

CERN Document Server

van Vulpen, I B

2004-01-01

This note presents an overview of the main results from searches for Higgs bosons and supersymmetry at LEP. Most of the results presented here are combined results from the four LEP experiments (ALEPH, DELPHI, L3 and OPAL). No signal is observed and the (negative) search results are interpreted in a wide class of models allowing parameter space to be excluded. All limits are set at 95% CL.

Systematic Reviews Published in Emergency Medicine Journals Do Not Routinely Search Clinical Trials Registries: A Cross-Sectional Analysis.

Science.gov (United States)

Keil, Lukas G; Platts-Mills, Timothy F; Jones, Christopher W

2015-10-01

Publication bias compromises the validity of systematic reviews. This problem can be addressed in part through searching clinical trials registries to identify unpublished studies. This study aims to determine how often systematic reviews published in emergency medicine journals include clinical trials registry searches. We identified all systematic reviews published in the 6 highest-impact emergency medicine journals between January 1 and December 31, 2013. Systematic reviews that assessed the effects of an intervention were further examined to determine whether the authors described searching a clinical trials registry and whether this search identified relevant unpublished studies. Of 191 articles identified through PubMed search, 80 were confirmed to be systematic reviews. Our sample consisted of 41 systematic reviews that assessed a specific intervention. Eight of these 41 (20%) searched a clinical trials registry. For 4 of these 8 reviews, the registry search identified at least 1 relevant unpublished study. Systematic reviews published in emergency medicine journals do not routinely include searches of clinical trials registries. By helping authors identify unpublished trial data, the addition of registry searches may improve the validity of systematic reviews. Copyright © 2014 American College of Emergency Physicians. Published by Elsevier Inc. All rights reserved.

An Improved Crow Search Algorithm Applied to Energy Problems

Directory of Open Access Journals (Sweden)

Primitivo Díaz

2018-03-01

Full Text Available The efficient use of energy in electrical systems has become a relevant topic due to its environmental impact. Parameter identification in induction motors and capacitor allocation in distribution networks are two representative problems that have strong implications in the massive use of energy. From an optimization perspective, both problems are considered extremely complex due to their non-linearity, discontinuity, and high multi-modality. These characteristics make difficult to solve them by using standard optimization techniques. On the other hand, metaheuristic methods have been widely used as alternative optimization algorithms to solve complex engineering problems. The Crow Search Algorithm (CSA is a recent metaheuristic method based on the intelligent group behavior of crows. Although CSA presents interesting characteristics, its search strategy presents great difficulties when it faces high multi-modal formulations. In this paper, an improved version of the CSA method is presented to solve complex optimization problems of energy. In the new algorithm, two features of the original CSA are modified: (I the awareness probability (AP and (II the random perturbation. With such adaptations, the new approach preserves solution diversity and improves the convergence to difficult high multi-modal optima. In order to evaluate its performance, the proposed algorithm has been tested in a set of four optimization problems which involve induction motors and distribution networks. The results demonstrate the high performance of the proposed method when it is compared with other popular approaches.

Exploiting Semantic Search Methodologies to Analyse Fast Nuclear Reactor Nuclear Related Information

International Nuclear Information System (INIS)

Costantini, L.

2016-01-01

Full text: This paper describes an experiment to evaluate the outcomes of using the semantic search engine together with the entity extraction approach and the visualisation tools in large set of nuclear data related to fast nuclear reactors (FNR) documents originated from INIS database and the IAEA web publication. The INIS database has been used because is the larger collection of nuclear related data and a sub-set of it can be utilised to verify the efficiency and the effectiveness of this approach. In a nutshell, the goal of the study was to: 1) find and monitor documents dealing with FNR; 2) building knowledge base (KB) according to the FNR nuclear components and populate the KB with relevant documents; 3) communicate the conclusion of the analysis by utilising visualisation tools. The semantic search engine used in the case study has the capability to perform what is called evidential reasoning: accruing, weighing and evaluating the evidence to determinate a mathematical score for each article that measures its relevance to the subject of interest. This approach provides a means to differentiate between articles that closely meet the search criteria versus those less relevant articles. Tovek software platform was chosen for this case study. (author

Making Statistical Data More Easily Accessible on the Web Results of the StatSearch Case Study

CERN Document Server

Rajman, M; Boynton, I M; Fridlund, B; Fyhrlund, A; Sundgren, B; Lundquist, P; Thelander, H; Wänerskär, M

2005-01-01

In this paper we present the results of the StatSearch case study that aimed at providing an enhanced access to statistical data available on the Web. In the scope of this case study we developed a prototype of an information access tool combining a query-based search engine with semi-automated navigation techniques exploiting the hierarchical structuring of the available data. This tool enables a better control of the information retrieval, improving the quality and ease of the access to statistical information. The central part of the presented StatSearch tool consists in the design of an algorithm for automated navigation through a tree-like hierarchical document structure. The algorithm relies on the computation of query related relevance score distributions over the available database to identify the most relevant clusters in the data structure. These most relevant clusters are then proposed to the user for navigation, or, alternatively, are the support for the automated navigation process. Several appro...

Search for dark-matter particles

International Nuclear Information System (INIS)

Cowsik, R.

1991-01-01

Experiments performed over the last two years have been very successful in drastically reducing the number of viable elementary particles that could possibly constitute the dark matter that dominates the large-scale gravitational dynamics of astronomical systems. The candidates that survive are the light neutrinos, the axion, and a supersymmetric particle with carefully chosen parameters called the neutralino. Baryonic dark matter, which might contribute not insignificantly over small scales, is perhaps present in the form of brown dwarfs, and a search for these is under way. In this article, the astrophysical studies which bear on the density and the phase-space structure of the dark-matter particles are reviewed and the implications of the various direct and indirect searches for these particles are discussed and, finally, alternative suggestions for the candidates and directions for further searches are pointed out. (author). 35 refs., 29 figs

Supersymmetry searches at the LHC and their interpretations

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00389502

One of the primary goals of the CERN Large Hadron Collider is to search for new physics. Many such searches have been carried out, in particular searches for supersymmetry, yet no new physics beyond the Standard Model has been found. With a large number of free parameters introduced by frameworks such as supersymmetry, it can be difficult to interpret the null results of searches. The first analysis presented in this thesis attempts to tackle this difficulty head-on, and gives a summary of the constraints from the Run-1 ATLAS searches. A combination of 22 searches were used, with integrated luminosities of up to 20.3 inverse femtobarns of 7 and 8 TeV data. The results are interpreted in the context of the 19-dimensional phenomenological MSSM, and are presented in terms of the masses of supersymmetric particles. Constraints from dark matter, heavy flavour and precision electroweak measurements were incorporated, and results are also interpreted in terms of these observables. Properties of models missed by the ...

Application of fast orthogonal search to linear and nonlinear stochastic systems

DEFF Research Database (Denmark)

Chon, K H; Korenberg, M J; Holstein-Rathlou, N H

1997-01-01

Standard deterministic autoregressive moving average (ARMA) models consider prediction errors to be unexplainable noise sources. The accuracy of the estimated ARMA model parameters depends on producing minimum prediction errors. In this study, an accurate algorithm is developed for estimating...... linear and nonlinear stochastic ARMA model parameters by using a method known as fast orthogonal search, with an extended model containing prediction errors as part of the model estimation process. The extended algorithm uses fast orthogonal search in a two-step procedure in which deterministic terms...

Towards Context-Aware Search and Analysis on Social Media Data

DEFF Research Database (Denmark)

Derczynski, Leon; Yang, Bin; Jensen, Christian S.

2013-01-01

Social media has changed the way we communicate. Social media data capture our social interactions and utterances in machine readable format. Searching and analysing massive and frequently updated social media data brings significant and diverse rewards across many different application domains......, from politics and business to social science and epidemiology. A notable proportion of social media data comes with explicit or implicit spatial annotations, and almost all social media data has temporal metadata. We view social media data as a constant stream of data points, each containing text...... with spatial and temporal contexts. We identify challenges relevant to each context, which we intend to subject to context aware querying and analysis, specifically including longitudinal analyses on social media archives, spatial keyword search, local intent search, and spatio-temporal intent search. Finally...

Improving the GIS-DRP Approach by Means of DelineatingRunoff Characteristics with New Discharge Relevant Parameters

Directory of Open Access Journals (Sweden)

Marco Hümann

2013-01-01

Full Text Available At present it is common to use geographic information system (GIS applications to assess runoff generation. One of these GIS-based tools to generate maps of dominant runoff processes is the so called GIS-DRP approach. The tool, which has been developed mainly based on agricultural areas, uses commonly available input data like a digital elevation model (DEM, geological information as well as land use information. The aim of this study is to test, validate and improve this GIS-DRP method for forested and silviculture areas. Hence, soil-hydrologic investigations and several mapping techniques of dominant runoff processes were conducted on 25 test-plots in four forested catchments in Rhineland-Palatinate (Germany and the Grand Duchy of Luxembourg. By comparing the results of the mapping techniques and those of the test plots, weak points in the original GIS-DRP method were detected. Subsequently, it was possible to enhance the GIS-DRP approach by incorporating new discharge relevant parameters like topsoil sealing, extreme weather events and semipermeability of the substratum. Moreover, the improved GIS-DRP approach can be widely used in different landscapes and for different fields of application. The adapted method can now support foresters and decision makers in forestry planning, answer questions concerning the landscape water balance and peripheral water retention or provide extra information for sustainable forest planning in times of a changing climate.

Search Engine For Ebook Portal

Directory of Open Access Journals (Sweden)

Prashant Kanade

2017-05-01

Full Text Available The purpose of this paper is to establish the textual analytics involved in developing a search engine for an ebook portal. We have extracted our dataset from Project Gutenberg using a robot harvester. Textual Analytics is used for efficient search retrieval. The entire dataset is represented using Vector Space Model where each document is a vector in the vector space. Further for computational purposes we represent our dataset in the form of a Term Frequency- Inverse Document Frequency tf-idf matrix. The first step involves obtaining the most coherent sequence of words of the search query entered. The entered query is processed using Front End algorithms this includes-Spell Checker Text Segmentation and Language Modeling. Back End processing includes Similarity Modeling Clustering Indexing and Retrieval. The relationship between documents and words is established using cosine similarity measured between the documents and words in Vector Space. Clustering performed is used to suggest books that are similar to the search query entered by the user. Lastly the Lucene Based Elasticsearch engine is used for indexing on the documents. This allows faster retrieval of data. Elasticsearch returns a dictionary and creates a tf-idf matrix. The processed query is compared with the dictionary obtained and tf-idf matrix is used to calculate the score for each match to give most relevant result.

Searching Trajectories by Regions of Interest

KAUST Repository

Shang, Shuo

2017-03-22

With the increasing availability of moving-object tracking data, trajectory search is increasingly important. We propose and investigate a novel query type named trajectory search by regions of interest (TSR query). Given an argument set of trajectories, a TSR query takes a set of regions of interest as a parameter and returns the trajectory in the argument set with the highest spatial-density correlation to the query regions. This type of query is useful in many popular applications such as trip planning and recommendation, and location based services in general. TSR query processing faces three challenges: how to model the spatial-density correlation between query regions and data trajectories, how to effectively prune the search space, and how to effectively schedule multiple so-called query sources. To tackle these challenges, a series of new metrics are defined to model spatial-density correlations. An efficient trajectory search algorithm is developed that exploits upper and lower bounds to prune the search space and that adopts a query-source selection strategy, as well as integrates a heuristic search strategy based on priority ranking to schedule multiple query sources. The performance of TSR query processing is studied in extensive experiments based on real and synthetic spatial data.

Searching Trajectories by Regions of Interest

KAUST Repository

Shang, Shuo; chen, Lisi; Jensen, Christian S.; Wen, Ji-Rong; Kalnis, Panos

2017-01-01

With the increasing availability of moving-object tracking data, trajectory search is increasingly important. We propose and investigate a novel query type named trajectory search by regions of interest (TSR query). Given an argument set of trajectories, a TSR query takes a set of regions of interest as a parameter and returns the trajectory in the argument set with the highest spatial-density correlation to the query regions. This type of query is useful in many popular applications such as trip planning and recommendation, and location based services in general. TSR query processing faces three challenges: how to model the spatial-density correlation between query regions and data trajectories, how to effectively prune the search space, and how to effectively schedule multiple so-called query sources. To tackle these challenges, a series of new metrics are defined to model spatial-density correlations. An efficient trajectory search algorithm is developed that exploits upper and lower bounds to prune the search space and that adopts a query-source selection strategy, as well as integrates a heuristic search strategy based on priority ranking to schedule multiple query sources. The performance of TSR query processing is studied in extensive experiments based on real and synthetic spatial data.

The Role of Search Speed in the Contextual Cueing of Children's Attention.

Science.gov (United States)

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2014-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information.

Use of Statistical Estimators as Virtual Observatory Search ParametersEnabling Access to Solar and Planetary Resources through the Virtual Observatory

Science.gov (United States)

Merka, J.; Dolan, C. F.

2015-12-01

Finding and retrieving space physics data is often a complicated taskeven for publicly available data sets: Thousands of relativelysmall and many large data sets are stored in various formats and, inthe better case, accompanied by at least some documentation. VirtualHeliospheric and Magnetospheric Observatories (VHO and VMO) help researches by creating a single point of uniformdiscovery, access, and use of heliospheric (VHO) and magnetospheric(VMO) data.The VMO and VHO functionality relies on metadata expressed using theSPASE data model. This data model is developed by the SPASE WorkingGroup which is currently the only international group supporting globaldata management for Solar and Space Physics. The two Virtual Observatories(VxOs) have initiated and lead a development of a SPASE-related standardnamed SPASE Query Language for provided a standard way of submittingqueries and receiving results.The VMO and VHO use SPASE and SPASEQL for searches based on various criteria such as, for example, spatial location, time of observation, measurement type, parameter values, etc. The parameter values are represented by their statisticalestimators calculated typically over 10-minute intervals: mean, median, standard deviation, minimum, and maximum. The use of statistical estimatorsenables science driven data queries that simplify and shorten the effort tofind where and/or how often the sought phenomenon is observed, as we will present.

Measurement of the mixing parameters of neutral charm mesons and search for indirect $CP$ violation with $D^0 \\to K^0_S \\pi^+ \\pi^-$ decays at LHCb

CERN Document Server

AUTHOR|(CDS)2082358; Gersabeck, Marco

The hadronic decay $D^0 \\to K^0_S \\pi^+ \\pi^-$ provides direct access to the measurement of the mixing parameters of the neutral charm meson system and allows to test for indirect $CP$ violation. Mixing is a time-dependent phenomenon for which the time evolution of the transition amplitude of a $D^0 \\, (\\bar{D}^0)$ decay to the final state $K^0_S\\pi^+\\pi^-$ has to be considered. The parameters driving those time-dependent oscillations are $x \\equiv (m_1-m_2)/\\Gamma$ and $y \\equiv (\\Gamma_1-\\Gamma_2)/(2\\Gamma)$. The $CP$ violation parameters $|q/p|$ and $\\phi=\\arg(q,p)$ describe the superposition of the flavour eigenstates $D^0$ and $\\bar{D}^0$ and of the physical eigenstates $D_1$ and $D_2$, $|D_{1,2}\\rangle = p |{D^0}\\rangle \\pm q |{\\bar{D}^0}\\rangle$. By measuring the time- and phase-space dependent distribution of $D^0 \\to K^0_S \\pi^+ \\pi^-$ decays, the mixing parameters can be extracted and a search for indirect $CP$ violation can be performed. This thesis reports a measurement of the mixing parameters a...

Parameter extraction using global particle swarm optimization approach and the influence of polymer processing temperature on the solar cell parameters

Science.gov (United States)

Kumar, S.; Singh, A.; Dhar, A.

2017-08-01

The accurate estimation of the photovoltaic parameters is fundamental to gain an insight of the physical processes occurring inside a photovoltaic device and thereby to optimize its design, fabrication processes, and quality. A simulative approach of accurately determining the device parameters is crucial for cell array and module simulation when applied in practical on-field applications. In this work, we have developed a global particle swarm optimization (GPSO) approach to estimate the different solar cell parameters viz., ideality factor (η), short circuit current (Isc), open circuit voltage (Voc), shunt resistant (Rsh), and series resistance (Rs) with wide a search range of over ±100 % for each model parameter. After validating the accurateness and global search power of the proposed approach with synthetic and noisy data, we applied the technique to the extract the PV parameters of ZnO/PCDTBT based hybrid solar cells (HSCs) prepared under different annealing conditions. Further, we examine the variation of extracted model parameters to unveil the physical processes occurring when different annealing temperatures are employed during the device fabrication and establish the role of improved charge transport in polymer films from independent FET measurements. The evolution of surface morphology, optical absorption, and chemical compositional behaviour of PCDTBT co-polymer films as a function of processing temperature has also been captured in the study and correlated with the findings from the PV parameters extracted using GPSO approach.

mirPub: a database for searching microRNA publications.

Science.gov (United States)

Vergoulis, Thanasis; Kanellos, Ilias; Kostoulas, Nikos; Georgakilas, Georgios; Sellis, Timos; Hatzigeorgiou, Artemis; Dalamagas, Theodore

2015-05-01

Identifying, amongst millions of publications available in MEDLINE, those that are relevant to specific microRNAs (miRNAs) of interest based on keyword search faces major obstacles. References to miRNA names in the literature often deviate from standard nomenclature for various reasons, since even the official nomenclature evolves. For instance, a single miRNA name may identify two completely different molecules or two different names may refer to the same molecule. mirPub is a database with a powerful and intuitive interface, which facilitates searching for miRNA literature, addressing the aforementioned issues. To provide effective search services, mirPub applies text mining techniques on MEDLINE, integrates data from several curated databases and exploits data from its user community following a crowdsourcing approach. Other key features include an interactive visualization service that illustrates intuitively the evolution of miRNA data, tag clouds summarizing the relevance of publications to particular diseases, cell types or tissues and access to TarBase 6.0 data to oversee genes related to miRNA publications. mirPub is freely available at http://www.microrna.gr/mirpub/. vergoulis@imis.athena-innovation.gr or dalamag@imis.athena-innovation.gr Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.

The use of a genetic algorithm-based search strategy in geostatistics: application to a set of anisotropic piezometric head data

Science.gov (United States)

Abedini, M. J.; Nasseri, M.; Burn, D. H.

2012-04-01

In any geostatistical study, an important consideration is the choice of an appropriate, repeatable, and objective search strategy that controls the nearby samples to be included in the location-specific estimation procedure. Almost all geostatistical software available in the market puts the onus on the user to supply search strategy parameters in a heuristic manner. These parameters are solely controlled by geographical coordinates that are defined for the entire area under study, and the user has no guidance as to how to choose these parameters. The main thesis of the current study is that the selection of search strategy parameters has to be driven by data—both the spatial coordinates and the sample values—and cannot be chosen beforehand. For this purpose, a genetic-algorithm-based ordinary kriging with moving neighborhood technique is proposed. The search capability of a genetic algorithm is exploited to search the feature space for appropriate, either local or global, search strategy parameters. Radius of circle/sphere and/or radii of standard or rotated ellipse/ellipsoid are considered as the decision variables to be optimized by GA. The superiority of GA-based ordinary kriging is demonstrated through application to the Wolfcamp Aquifer piezometric head data. Assessment of numerical results showed that definition of search strategy parameters based on both geographical coordinates and sample values improves cross-validation statistics when compared with that based on geographical coordinates alone. In the case of a variable search neighborhood for each estimation point, optimization of local search strategy parameters for an elliptical support domain—the orientation of which is dictated by anisotropic axes—via GA was able to capture the dynamics of piezometric head in west Texas/New Mexico in an efficient way.

An information search model for online social Networks - MOBIRSE

Directory of Open Access Journals (Sweden)

Miguel Angel Niño Zambrano

2015-09-01

Full Text Available Online Social Networks (OSNs have been gaining great importance among Internet users in recent years.  These are sites where it is possible to meet people, publish, and share content in a way that is both easy and free of charge. As a result, the volume of information contained in these websites has grown exponentially, and web search has consequently become an important tool for users to easily find information relevant to their social networking objectives. Making use of ontologies and user profiles can make these searches more effective. This article presents a model for Information Retrieval in OSNs (MOBIRSE based on user profile and ontologies which aims to improve the relevance of retrieved information on these websites. The social network Facebook was chosen for a case study and as the instance for the proposed model. The model was validated using measures such as At-k Precision and Kappa statistics, to assess its efficiency.

The evolution of sex roles in mate searching.

Science.gov (United States)

Fromhage, Lutz; Jennions, Michael; Kokko, Hanna

2016-03-01

Searching for mates is a critical stage in the life cycle of most internally, and many externally, fertilizing species. Males usually invest more in this costly activity than females, but the reasons for this are poorly understood. Previous models have shown that female-biased parental investment, including anisogamy, does not by itself select for male-biased mate searching, so it requires additional explanations. Here, we correct and expand upon earlier models, and present two novel hypotheses that might explain the evolution of male-biased mate searching. The "carry-over hypothesis" states that females benefit less from searching if the associated costs affect other stages of the life cycle, rather than arising only while searching. It is relevant to the evolution of morphological traits that improve searching efficiency but are also expressed in other contexts. The "mating window hypothesis" states that females benefit less from searching if their life cycle includes intervals during which the exact timing of mating does not matter for the appropriate timing of reproduction (e.g., due to sperm storage or delayed embryo implantation). Such intervals are more likely to exist for females given the general pattern of greater female parental investment. Our models shed new light on classic arguments about sex role evolution. © 2016 The Author(s). Evolution © 2016 The Society for the Study of Evolution.

Applying Cuckoo Search for analysis of LFSR based cryptosystem

Directory of Open Access Journals (Sweden)

Maiya Din

2016-09-01

Full Text Available Cryptographic techniques are employed for minimizing security hazards to sensitive information. To make the systems more robust, cyphers or crypts being used need to be analysed for which cryptanalysts require ways to automate the process, so that cryptographic systems can be tested more efficiently. Evolutionary algorithms provide one such resort as these are capable of searching global optimal solution very quickly. Cuckoo Search (CS Algorithm has been used effectively in cryptanalysis of conventional systems like Vigenere and Transposition cyphers. Linear Feedback Shift Register (LFSR is a crypto primitive used extensively in design of cryptosystems. In this paper, we analyse LFSR based cryptosystem using Cuckoo Search to find correct initial states of used LFSR. Primitive polynomials of degree 11, 13, 17 and 19 are considered to analyse text crypts of length 200, 300 and 400 characters. Optimal solutions were obtained for the following CS parameters: Levy distribution parameter (β = 1.5 and Alien eggs discovering probability (pa = 0.25.

There’s an App for That? Highlighting the Difficulty in Finding Clinically Relevant Smartphone Applications

Directory of Open Access Journals (Sweden)

Warren Wiechmann, MD, MBA

2016-03-01

Full Text Available Introduction: The use of personal mobile devices in the medical field has grown quickly, and a large proportion of physicians use their mobile devices as an immediate resource for clinical decisionmaking, prescription information and other medical information. The iTunes App Store (Apple, Inc. contains approximately 20,000 apps in its “Medical” category, providing a robust repository of resources for clinicians; however, this represents only 2% of the entire App Store. The App Store does not have strict criteria for identifying content specific to practicing physicians, making the identification of clinically relevant content difficult. The objective of this study is to quantify the characteristics of existing medical applications in the iTunes App Store that could be used by emergency physicians, residents, or medical students. Methods: We found applications related to emergency medicine (EM by searching the iTunes App Store for 21 terms representing core content areas of EM, such as “emergency medicine,” “critical care,” “orthopedics,” and “procedures.” Two physicians independently reviewed descriptions of these applications in the App Store and categorized each as the following: Clinically Relevant, Book/ Published Source, Non-English, Study Tools, or Not Relevant. A third physician reviewer resolved disagreements about categorization. Descriptive statistics were calculated. Results: We found a total of 7,699 apps from the 21 search terms, of which 17.8% were clinical, 9.6% were based on a book or published source, 1.6% were non-English, 0.7% were clinically relevant patient education resources, and 4.8% were study tools. Most significantly, 64.9% were considered not relevant to medical professionals. Clinically relevant apps make up approximately 6.9% of the App Store’s “Medical” Category and 0.1% of the overall App Store. Conclusion: Clinically relevant apps represent only a small percentage (6.9% of the total App

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

The temporal-relevance temporal-uncertainty model of prospective duration judgment.

Science.gov (United States)

Zakay, Dan

2015-12-15

A model aimed at explaining prospective duration judgments in real life settings (as well as in the laboratory) is presented. The model is based on the assumption that situational meaning is continuously being extracted by humans' perceptual and cognitive information processing systems. Time is one of the important dimensions of situational meaning. Based on the situational meaning, a value for Temporal Relevance is set. Temporal Relevance reflects the importance of temporal aspects for enabling adaptive behavior in a specific moment in time. When Temporal Relevance is above a certain threshold a prospective duration judgment process is evoked automatically. In addition, a search for relevant temporal information is taking place and its outcomes determine the level of Temporal Uncertainty which reflects the degree of knowledge one has regarding temporal aspects of the task to be performed. The levels of Temporal Relevance and Temporal Uncertainty determine the amount of attentional resources allocated for timing by the executive system. The merit of the model is in connecting timing processes with the ongoing general information processing stream. The model rests on findings in various domains which indicate that cognitive-relevance and self-relevance are powerful determinants of resource allocation policy. The feasibility of the model is demonstrated by analyzing various temporal phenomena. Suggestions for further empirical validation of the model are presented. Copyright © 2015 Elsevier Inc. All rights reserved.

Task-relevant perceptual features can define categories in visual memory too.

Science.gov (United States)

Antonelli, Karla B; Williams, Carrick C

2017-11-01

Although Konkle, Brady, Alvarez, and Oliva (2010, Journal of Experimental Psychology: General, 139(3), 558) claim that visual long-term memory (VLTM) is organized on underlying conceptual, not perceptual, information, visual memory results from visual search tasks are not well explained by this theory. We hypothesized that when viewing an object, any task-relevant visual information is critical to the organizational structure of VLTM. In two experiments, we examined the organization of VLTM by measuring the amount of retroactive interference created by objects possessing different combinations of task-relevant features. Based on task instructions, only the conceptual category was task relevant or both the conceptual category and a perceptual object feature were task relevant. Findings indicated that when made task relevant, perceptual object feature information, along with conceptual category information, could affect memory organization for objects in VLTM. However, when perceptual object feature information was task irrelevant, it did not contribute to memory organization; instead, memory defaulted to being organized around conceptual category information. These findings support the theory that a task-defined organizational structure is created in VLTM based on the relevance of particular object features and information.

Optimal search filters for renal information in EMBASE.

Science.gov (United States)

Iansavichus, Arthur V; Haynes, R Brian; Shariff, Salimah Z; Weir, Matthew; Wilczynski, Nancy L; McKibbon, Ann; Rehman, Faisal; Garg, Amit X

2010-07-01

EMBASE is a popular database used to retrieve biomedical information. Our objective was to develop and test search filters to help clinicians and researchers efficiently retrieve articles with renal information in EMBASE. We used a diagnostic test assessment framework because filters operate similarly to screening tests. We divided a sample of 5,302 articles from 39 journals into development and validation sets of articles. Information retrieval properties were assessed by treating each search filter as a "diagnostic test" or screening procedure for the detection of relevant articles. We tested the performance of 1,936,799 search filters made of unique renal terms and their combinations. REFERENCE STANDARD & OUTCOME: The reference standard was manual review of each article. We calculated the sensitivity and specificity of each filter to identify articles with renal information. The best renal filters consisted of multiple search terms, such as "renal replacement therapy," "renal," "kidney disease," and "proteinuria," and the truncated terms "kidney," "dialy," "neph," "glomerul," and "hemodial." These filters achieved peak sensitivities of 98.7% (95% CI, 97.9-99.6) and specificities of 98.5% (95% CI, 98.0-99.0). The retrieval performance of these filters remained excellent in the validation set of independent articles. The retrieval performance of any search will vary depending on the quality of all search concepts used, not just renal terms. We empirically developed and validated high-performance renal search filters for EMBASE. These filters can be programmed into the search engine or used on their own to improve the efficiency of searching.

Medical student appraisal: searching on smartphones.

Science.gov (United States)

Khalifian, S; Markman, T; Sampognaro, P; Mitchell, S; Weeks, S; Dattilo, J

2013-01-01

The rapidly growing industry for mobile medical applications provides numerous smartphone resources designed for healthcare professionals. However, not all applications are equally useful in addressing the questions of early medical trainees. Three popular, free, mobile healthcare applications were evaluated along with a Google(TM) web search on both Apple(TM) and Android(TM) devices. Six medical students at a large academic hospital evaluated each application for a one-week period while on various clinical rotations. Google(TM) was the most frequently used search method and presented multimedia resources but was inefficient for obtaining clinical management information. Epocrates(TM) Pill ID feature was praised for its clinical utility. Medscape(TM) had the highest satisfaction of search and excelled through interactive educational features. Micromedex(TM) offered both FDA and off-label dosing for drugs. Google(TM) was the preferred search method for questions related to basic disease processes and multimedia resources, but was inadequate for clinical management. Caution should also be exercised when using Google(TM) in front of patients. Medscape(TM) was the most appealing application due to a broad scope of content and educational features relevant to medical trainees. Students should also be cognizant of how mobile technology may be perceived by their evaluators to avoid false impressions.

Features of the search profiles in the INIS-RS service

International Nuclear Information System (INIS)

Komatsubara, Yasutoshi

1982-01-01

Report is presented on the INIS-RS service being performed for nuclear people in Japan from 1979. Brief information on the INIS database and the retrieval system is stated in the first place. Analyses are made on the 322 items to reveal the composition and characteristics of the search profiles processed at the JAERI. Results are shown on the executing ratios of preliminaly search and of ranking retrieval with weighted descriptors. Each number of search terms and of logical operators used in each query is described with correlation of the number between terms and AND(*) operators. Descriptions are also given on the relevance ratio of the retrieval and number of the documents retrieved. (author)

High-performance information search filters for CKD content in PubMed, Ovid MEDLINE, and EMBASE.

Science.gov (United States)

Iansavichus, Arthur V; Hildebrand, Ainslie M; Haynes, R Brian; Wilczynski, Nancy L; Levin, Adeera; Hemmelgarn, Brenda R; Tu, Karen; Nesrallah, Gihad E; Nash, Danielle M; Garg, Amit X

2015-01-01

Finding relevant articles in large bibliographic databases such as PubMed, Ovid MEDLINE, and EMBASE to inform care and future research is challenging. Articles relevant to chronic kidney disease (CKD) are particularly difficult to find because they are often published under different terminology and are found across a wide range of journal types. We used computer automation within a diagnostic test assessment framework to develop and validate information search filters to identify CKD articles in large bibliographic databases. 22,992 full-text articles in PubMed, Ovid MEDLINE, or EMBASE. 1,374,148 unique search filters. We established the reference standard of article relevance to CKD by manual review of all full-text articles using prespecified criteria to determine whether each article contained CKD content or not. We then assessed filter performance by calculating sensitivity, specificity, and positive predictive value for the retrieval of CKD articles. Filters with high sensitivity and specificity for the identification of CKD articles in the development phase (two-thirds of the sample) were then retested in the validation phase (remaining one-third of the sample). We developed and validated high-performance CKD search filters for each bibliographic database. Filters optimized for sensitivity reached at least 99% sensitivity, and filters optimized for specificity reached at least 97% specificity. The filters were complex; for example, one PubMed filter included more than 89 terms used in combination, including "chronic kidney disease," "renal insufficiency," and "renal fibrosis." In proof-of-concept searches, physicians found more articles relevant to the topic of CKD with the use of these filters. As knowledge of the pathogenesis of CKD grows and definitions change, these filters will need to be updated to incorporate new terminology used to index relevant articles. PubMed, Ovid MEDLINE, and EMBASE can be filtered reliably for articles relevant to CKD. These

Model Optimization Identification Method Based on Closed-loop Operation Data and Process Characteristics Parameters

Directory of Open Access Journals (Sweden)

Zhiqiang GENG

2014-01-01

Full Text Available Output noise is strongly related to input in closed-loop control system, which makes model identification of closed-loop difficult, even unidentified in practice. The forward channel model is chosen to isolate disturbance from the output noise to input, and identified by optimization the dynamic characteristics of the process based on closed-loop operation data. The characteristics parameters of the process, such as dead time and time constant, are calculated and estimated based on the PI/PID controller parameters and closed-loop process input/output data. And those characteristics parameters are adopted to define the search space of the optimization identification algorithm. PSO-SQP optimization algorithm is applied to integrate the global search ability of PSO with the local search ability of SQP to identify the model parameters of forward channel. The validity of proposed method has been verified by the simulation. The practicability is checked with the PI/PID controller parameter turning based on identified forward channel model.

Characterising dark matter searches at colliders and direct detection experiments: Vector mediators

International Nuclear Information System (INIS)

Buchmueller, Oliver; Dolan, Matthew J.; Malik, Sarah A.; McCabe, Christopher

2015-01-01

We introduce a Minimal Simplified Dark Matter (MSDM) framework to quantitatively characterise dark matter (DM) searches at the LHC. We study two MSDM models where the DM is a Dirac fermion which interacts with a vector and axial-vector mediator. The models are characterised by four parameters: m DM , M med, g DM and g q , the DM and mediator masses, and the mediator couplings to DM and quarks respectively. The MSDM models accurately capture the full event kinematics, and the dependence on all masses and couplings can be systematically studied. The interpretation of mono-jet searches in this framework can be used to establish an equal-footing comparison with direct detection experiments. For theories with a vector mediator, LHC mono-jet searches possess better sensitivity than direct detection searches for light DM masses (≲5 GeV). For axial-vector mediators, LHC and direct detection searches generally probe orthogonal directions in the parameter space. We explore the projected limits of these searches from the ultimate reach of the LHC and multi-ton xenon direct detection experiments, and find that the complementarity of the searches remains. In conclusion, we provide a comparison of limits in the MSDM and effective field theory (EFT) frameworks to highlight the deficiencies of the EFT framework, particularly when exploring the complementarity of mono-jet and direct detection searches

Online health information search: what struggles and empowers the users? Results of an online survey.

Science.gov (United States)

Pletneva, Natalia; Vargas, Alejandro; Kalogianni, Konstantina; Boyer, Célia

2012-01-01

The most popular mean of searching for online health content is a general search engine for all domains of interest. Being general implies on one hand that the search engine is not tailored to the needs which are particular to the medical and on another hand that health domain and health-specific queries may not always return adequate and adapted results. The aim of our study was to identify difficulties and preferences in online health information search encountered by members of the general public. The survey in four languages was online from the 9th of March until the 27th of April, 2011. 385 answers were collected, representing mostly the opinions of highly educated users, mostly from France and Spain. The most important characteristics of a search engine are relevance and trustworthiness of results. The results currently retrieved do not fulfil these requirements. The ideal representation of the information will be a categorization of the results into different groups. Medical dictionaries/thesauruses, suggested relevant topics, image searches and spelling corrections are regarded as helpful tools. There is a need to work towards better customized solutions which provide users with the trustworthy information of high quality specific to his/her case in a user-friendly environment which would eventually lead to making appropriate health decisions.

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.

Ligandbook: an online repository for small and drug-like molecule force field parameters.

Science.gov (United States)

Domanski, Jan; Beckstein, Oliver; Iorga, Bogdan I

2017-06-01

Ligandbook is a public database and archive for force field parameters of small and drug-like molecules. It is a repository for parameter sets that are part of published work but are not easily available to the community otherwise. Parameter sets can be downloaded and immediately used in molecular dynamics simulations. The sets of parameters are versioned with full histories and carry unique identifiers to facilitate reproducible research. Text-based search on rich metadata and chemical substructure search allow precise identification of desired compounds or functional groups. Ligandbook enables the rapid set up of reproducible molecular dynamics simulations of ligands and protein-ligand complexes. Ligandbook is available online at https://ligandbook.org and supports all modern browsers. Parameters can be searched and downloaded without registration, including access through a programmatic RESTful API. Deposition of files requires free user registration. Ligandbook is implemented in the PHP Symfony2 framework with TCL scripts using the CACTVS toolkit. oliver.beckstein@asu.edu or bogdan.iorga@cnrs.fr ; contact@ligandbook.org . Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.

The internet and intelligent machines: search engines, agents and robots

International Nuclear Information System (INIS)

Achenbach, S.; Alfke, H.

2000-01-01

The internet plays an important role in a growing number of medical applications. Finding relevant information is not always easy as the amount of available information on the Web is rising quickly. Even the best Search Engines can only collect links to a fraction of all existing Web pages. In addition, many of these indexed documents have been changed or deleted. The vast majority of information on the Web is not searchable with conventional methods. New search strategies, technologies and standards are combined in Intelligent Search Agents (ISA) an Robots, which can retrieve desired information in a specific approach. Conclusion: The article describes differences between ISAs and conventional Search Engines and how communication between Agents improves their ability to find information. Examples of existing ISAs are given and the possible influences on the current and future work in radiology is discussed. (orig.) [de

Prospects for early SUSY searches at Lhc

International Nuclear Information System (INIS)

Borjanovic, I.

2009-01-01

Search for the physics beyond the Standard Model is one of the most relevant goals of the CMS and Atlas experiments at the Large Hadron Collider at CERN. Prospects for early R-parity conserving supersymmetry discovery and mass measurements with the CMS and Atlas detector for the first fb -1 of data are presented. All the presented studies are based on realistic Monte Carlo simulations.

Impact of Glaucoma and Dry Eye on Text-Based Searching

Science.gov (United States)

Sun, Michelle J.; Rubin, Gary S.; Akpek, Esen K.; Ramulu, Pradeep Y.

2017-01-01

Purpose We determine if visual field loss from glaucoma and/or measures of dry eye severity are associated with difficulty searching, as judged by slower search times on a text-based search task. Methods Glaucoma patients with bilateral visual field (VF) loss, patients with clinically significant dry eye, and normally-sighted controls were enrolled from the Wilmer Eye Institute clinics. Subjects searched three Yellow Pages excerpts for a specific phone number, and search time was recorded. Results A total of 50 glaucoma subjects, 40 dry eye subjects, and 45 controls completed study procedures. On average, glaucoma patients exhibited 57% longer search times compared to controls (95% confidence interval [CI], 26%–96%, P Dry eye subjects demonstrated similar search times compared to controls, though worse Ocular Surface Disease Index (OSDI) vision-related subscores were associated with longer search times (P dry eye (P > 0.08 for Schirmer's testing without anesthesia, corneal fluorescein staining, and tear film breakup time). Conclusions Text-based visual search is slower for glaucoma patients with greater levels of VF loss and dry eye patients with greater self-reported visual difficulty, and these difficulties may contribute to decreased quality of life in these groups. Translational Relevance Visual search is impaired in glaucoma and dry eye groups compared to controls, highlighting the need for compensatory strategies and tools to assist individuals in overcoming their deficiencies. PMID:28670502

GGRNA: an ultrafast, transcript-oriented search engine for genes and transcripts.

Science.gov (United States)

Naito, Yuki; Bono, Hidemasa

2012-07-01

GGRNA (http://GGRNA.dbcls.jp/) is a Google-like, ultrafast search engine for genes and transcripts. The web server accepts arbitrary words and phrases, such as gene names, IDs, gene descriptions, annotations of gene and even nucleotide/amino acid sequences through one simple search box, and quickly returns relevant RefSeq transcripts. A typical search takes just a few seconds, which dramatically enhances the usability of routine searching. In particular, GGRNA can search sequences as short as 10 nt or 4 amino acids, which cannot be handled easily by popular sequence analysis tools. Nucleotide sequences can be searched allowing up to three mismatches, or the query sequences may contain degenerate nucleotide codes (e.g. N, R, Y, S). Furthermore, Gene Ontology annotations, Enzyme Commission numbers and probe sequences of catalog microarrays are also incorporated into GGRNA, which may help users to conduct searches by various types of keywords. GGRNA web server will provide a simple and powerful interface for finding genes and transcripts for a wide range of users. All services at GGRNA are provided free of charge to all users.

What Can Pictures Tell Us About Web Pages? Improving Document Search Using Images.

Science.gov (United States)

Rodriguez-Vaamonde, Sergio; Torresani, Lorenzo; Fitzgibbon, Andrew W

2015-06-01

Traditional Web search engines do not use the images in the HTML pages to find relevant documents for a given query. Instead, they typically operate by computing a measure of agreement between the keywords provided by the user and only the text portion of each page. In this paper we study whether the content of the pictures appearing in a Web page can be used to enrich the semantic description of an HTML document and consequently boost the performance of a keyword-based search engine. We present a Web-scalable system that exploits a pure text-based search engine to find an initial set of candidate documents for a given query. Then, the candidate set is reranked using visual information extracted from the images contained in the pages. The resulting system retains the computational efficiency of traditional text-based search engines with only a small additional storage cost needed to encode the visual information. We test our approach on one of the TREC Million Query Track benchmarks where we show that the exploitation of visual content yields improvement in accuracies for two distinct text-based search engines, including the system with the best reported performance on this benchmark. We further validate our approach by collecting document relevance judgements on our search results using Amazon Mechanical Turk. The results of this experiment confirm the improvement in accuracy produced by our image-based reranker over a pure text-based system.

Searching for gravitational waves from neutron stars

Science.gov (United States)

Idrisy, Ashikuzzaman

In this dissertation we discuss gravitational waves (GWs) and their neutron star (NS) sources. We begin with a general discussion of the motivation for searching for GWs and the indirect experimental evidence of their existence. Then we discuss the various mechanisms through which NS can emit GWs, paying special attention the r-mode oscillations. Finally we end with discussion of GW detection. In Chapter 2 we describe research into the frequencies of r-mode oscillations. Knowing these frequencies can be useful for guiding and interpreting gravitational wave and electromagnetic observations. The frequencies of slowly rotating, barotropic, and non-magnetic Newtonian stars are well known, but subject to various corrections. After making simple estimates of the relative strengths of these corrections we conclude that relativistic corrections are the most important. For this reason we extend the formalism of K. H. Lockitch, J. L. Friedman, and N. Andersson [Phys. Rev. D 68, 124010 (2003)], who consider relativistic polytropes, to the case of realistic equations of state. This formulation results in perturbation equations which are solved using a spectral method. We find that for realistic equations of state the r-mode frequency ranges from 1.39--1.57 times the spin frequency of the star when the relativistic compactness parameter (M/R) is varied over the astrophysically motivated interval 0.110--0.310. Following a successful r-mode detection our results can help constrain the high density equation of state. In Chapter 3 we present a technical introduction to the data analysis tools used in GW searches. Starting from the plane-wave solutions derived in Chapter 1 we develop the F-statistic used in the matched filtering technique. This technique relies on coherently integrating the GW detector's data stream with a theoretically modeled wave signal. The statistic is used to test the null hypothesis that the data contains no signal. In this chapter we also discuss how to

Evaluating a Federated Medical Search Engine

Science.gov (United States)

Belden, J.; Williams, J.; Richardson, B.; Schuster, K.

2014-01-01

Summary Background Federated medical search engines are health information systems that provide a single access point to different types of information. Their efficiency as clinical decision support tools has been demonstrated through numerous evaluations. Despite their rigor, very few of these studies report holistic evaluations of medical search engines and even fewer base their evaluations on existing evaluation frameworks. Objectives To evaluate a federated medical search engine, MedSocket, for its potential net benefits in an established clinical setting. Methods This study applied the Human, Organization, and Technology (HOT-fit) evaluation framework in order to evaluate MedSocket. The hierarchical structure of the HOT-factors allowed for identification of a combination of efficiency metrics. Human fit was evaluated through user satisfaction and patterns of system use; technology fit was evaluated through the measurements of time-on-task and the accuracy of the found answers; and organization fit was evaluated from the perspective of system fit to the existing organizational structure. Results Evaluations produced mixed results and suggested several opportunities for system improvement. On average, participants were satisfied with MedSocket searches and confident in the accuracy of retrieved answers. However, MedSocket did not meet participants’ expectations in terms of download speed, access to information, and relevance of the search results. These mixed results made it necessary to conclude that in the case of MedSocket, technology fit had a significant influence on the human and organization fit. Hence, improving technological capabilities of the system is critical before its net benefits can become noticeable. Conclusions The HOT-fit evaluation framework was instrumental in tailoring the methodology for conducting a comprehensive evaluation of the search engine. Such multidimensional evaluation of the search engine resulted in recommendations for

SPOTting Model Parameters Using a Ready-Made Python Package.

Directory of Open Access Journals (Sweden)

Tobias Houska

Full Text Available The choice for specific parameter estimation methods is often more dependent on its availability than its performance. We developed SPOTPY (Statistical Parameter Optimization Tool, an open source python package containing a comprehensive set of methods typically used to calibrate, analyze and optimize parameters for a wide range of ecological models. SPOTPY currently contains eight widely used algorithms, 11 objective functions, and can sample from eight parameter distributions. SPOTPY has a model-independent structure and can be run in parallel from the workstation to large computation clusters using the Message Passing Interface (MPI. We tested SPOTPY in five different case studies to parameterize the Rosenbrock, Griewank and Ackley functions, a one-dimensional physically based soil moisture routine, where we searched for parameters of the van Genuchten-Mualem function and a calibration of a biogeochemistry model with different objective functions. The case studies reveal that the implemented SPOTPY methods can be used for any model with just a minimal amount of code for maximal power of parameter optimization. They further show the benefit of having one package at hand that includes number of well performing parameter search methods, since not every case study can be solved sufficiently with every algorithm or every objective function.

Time relevance, citation of reporting guidelines, and breadth of literature search in systematic reviews in orthodontics

NARCIS (Netherlands)

Livas, Christos; Pandis, Nikolaos; Ren, Yijin

Introduction: As the importance of systematic review (SR) conclusions relies upon the scientific rigor of methods and the currency of evidence, we aimed to investigate the currency of orthodontic SRs using as proxy the time from the initial search to publication. Additionally, SR information

A method of searching LDAP directories using XQuery

International Nuclear Information System (INIS)

Hesselroth, Ted

2011-01-01

A method by which an LDAP directory can be searched using XQuery is described. The strategy behind the tool consists of four steps. First the XQuery script is examined and relevant XPath expressions are extracted, determined to be sufficient to define all information needed to perform the query. Then the XPath expressions are converted into their equivalent LDAP search filters by use of the published LDAP schema of the service, and search requests are made to the LDAP host. The search results are then merged and converted to an XML document that conforms to the hierarchy of the LDAP schema. Finally, the XQuery script is executed on the working XML document by conventional means. Examples are given of application of the tool in the Open Science Grid, which for discovery purposes operates an LDAP server that contains Glue schema-based information on site configuration and authorization policies. The XQuery scripts compactly replace hundreds of lines of custom python code that relied on the unix ldapsearch utility. Installation of the tool is available through the Virtual Data Toolkit.

The Role of Search Speed in the Contextual Cueing of Children’s Attention

Science.gov (United States)

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2013-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information. PMID:24505167

[On the seasonality of dermatoses: a retrospective analysis of search engine query data depending on the season].

Science.gov (United States)

Köhler, M J; Springer, S; Kaatz, M

2014-09-01

The volume of search engine queries about disease-relevant items reflects public interest and correlates with disease prevalence as proven by the example of flu (influenza). Other influences include media attention or holidays. The present work investigates if the seasonality of prevalence or symptom severity of dermatoses correlates with search engine query data. The relative weekly volume of dermatological relevant search terms was assessed by the online tool Google Trends for the years 2009-2013. For each item, the degree of seasonality was calculated via frequency analysis and a geometric approach. Many dermatoses show a marked seasonality, reflected by search engine query volumes. Unexpected seasonal variations of these queries suggest a previously unknown variability of the respective disease prevalence. Furthermore, using the example of allergic rhinitis, a close correlation of search engine query data with actual pollen count can be demonstrated. In many cases, search engine query data are appropriate to estimate seasonal variability in prevalence of common dermatoses. This finding may be useful for real-time analysis and formation of hypotheses concerning pathogenetic or symptom aggravating mechanisms and may thus contribute to improvement of diagnostics and prevention of skin diseases.

Accurate expectancies diminish perceptual distraction during visual search

Science.gov (United States)

Sy, Jocelyn L.; Guerin, Scott A.; Stegman, Anna; Giesbrecht, Barry

2014-01-01

The load theory of visual attention proposes that efficient selective perceptual processing of task-relevant information during search is determined automatically by the perceptual demands of the display. If the perceptual demands required to process task-relevant information are not enough to consume all available capacity, then the remaining capacity automatically and exhaustively “spills-over” to task-irrelevant information. The spill-over of perceptual processing capacity increases the likelihood that task-irrelevant information will impair performance. In two visual search experiments, we tested the automaticity of the allocation of perceptual processing resources by measuring the extent to which the processing of task-irrelevant distracting stimuli was modulated by both perceptual load and top-down expectations using behavior, functional magnetic resonance imaging, and electrophysiology. Expectations were generated using a trial-by-trial cue that provided information about the likely load of the upcoming visual search task. When the cues were valid, behavioral interference was eliminated and the influence of load on frontoparietal and visual cortical responses was attenuated relative to when the cues were invalid. In conditions in which task-irrelevant information interfered with performance and modulated visual activity, individual differences in mean blood oxygenation level dependent responses measured from the left intraparietal sulcus were negatively correlated with individual differences in the severity of distraction. These results are consistent with the interpretation that a top-down biasing mechanism interacts with perceptual load to support filtering of task-irrelevant information. PMID:24904374

Accurate expectancies diminish perceptual distraction during visual search

Directory of Open Access Journals (Sweden)

Jocelyn L Sy

2014-05-01

Full Text Available The load theory of visual attention proposes that efficient selective perceptual processing of task-relevant information during search is determined automatically by the perceptual demands of the display. If the perceptual demands required to process task-relevant information are not enough to consume all available capacity, then the remaining capacity automatically and exhaustively spills-over to task-irrelevant information. The spill-over of perceptual processing capacity increases the likelihood that task-irrelevant information will impair performance. In two visual search experiments, we tested the automaticity of the allocation of perceptual processing resources by measuring the extent to which the processing of task-irrelevant distracting stimuli was modulated by both perceptual load and top-down expectations using behavior, fMRI, and electrophysiology. Expectations were generated by a trial-by-trial cue that provided information about the likely load of the upcoming visual search task. When the cues were valid, behavioral interference was eliminated and the influence of load on frontoparietal and visual cortical responses was attenuated relative to when the cues were invalid. In conditions in which task-irrelevant information interfered with performance and modulated visual activity, individual differences in mean BOLD responses measured from the left intraparietal sulcus were negatively correlated with individual differences in the severity of distraction. These results are consistent with the interpretation that a top-down biasing mechanism interacts with perceptual load to support filtering of task-irrelevant information.

Parameter estimation methods for gene circuit modeling from time-series mRNA data: a comparative study

KAUST Repository

Fan, M.

2015-03-29

Parameter estimation is a challenging computational problemin the reverse engineering of biological systems. Because advances in biotechnology have facilitated wide availability of time-series gene expression data, systematic parameter esti- mation of gene circuitmodels fromsuch time-series mRNA data has become an importantmethod for quantitatively dissecting the regulation of gene expression. By focusing on themodeling of gene circuits, we examine here the perform- ance of three types of state-of-the-art parameter estimation methods: population-basedmethods, onlinemethods and model-decomposition-basedmethods. Our results show that certain population-basedmethods are able to generate high- quality parameter solutions. The performance of thesemethods, however, is heavily dependent on the size of the param- eter search space, and their computational requirements substantially increase as the size of the search space increases. In comparison, onlinemethods andmodel decomposition-basedmethods are computationally faster alternatives and are less dependent on the size of the search space. Among other things, our results show that a hybrid approach that augments computationally fastmethods with local search as a subsequent refinement procedure can substantially increase the qual- ity of their parameter estimates to the level on par with the best solution obtained fromthe population-basedmethods whilemaintaining high computational speed. These suggest that such hybridmethods can be a promising alternative to themore commonly used population-basedmethods for parameter estimation of gene circuit models when limited prior knowledge about the underlying regulatorymechanismsmakes the size of the parameter search space vastly large. © The Author 2015. Published by Oxford University Press.

Parameter estimation methods for gene circuit modeling from time-series mRNA data: a comparative study.

Science.gov (United States)

Fan, Ming; Kuwahara, Hiroyuki; Wang, Xiaolei; Wang, Suojin; Gao, Xin

2015-11-01

Parameter estimation is a challenging computational problem in the reverse engineering of biological systems. Because advances in biotechnology have facilitated wide availability of time-series gene expression data, systematic parameter estimation of gene circuit models from such time-series mRNA data has become an important method for quantitatively dissecting the regulation of gene expression. By focusing on the modeling of gene circuits, we examine here the performance of three types of state-of-the-art parameter estimation methods: population-based methods, online methods and model-decomposition-based methods. Our results show that certain population-based methods are able to generate high-quality parameter solutions. The performance of these methods, however, is heavily dependent on the size of the parameter search space, and their computational requirements substantially increase as the size of the search space increases. In comparison, online methods and model decomposition-based methods are computationally faster alternatives and are less dependent on the size of the search space. Among other things, our results show that a hybrid approach that augments computationally fast methods with local search as a subsequent refinement procedure can substantially increase the quality of their parameter estimates to the level on par with the best solution obtained from the population-based methods while maintaining high computational speed. These suggest that such hybrid methods can be a promising alternative to the more commonly used population-based methods for parameter estimation of gene circuit models when limited prior knowledge about the underlying regulatory mechanisms makes the size of the parameter search space vastly large. © The Author 2015. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Measurement of the β-asymmetry parameter of Cu67 in search for tensor-type currents in the weak interaction

Science.gov (United States)

Soti, G.; Wauters, F.; Breitenfeldt, M.; Finlay, P.; Herzog, P.; Knecht, A.; Köster, U.; Kraev, I. S.; Porobic, T.; Prashanth, P. N.; Towner, I. S.; Tramm, C.; Zákoucký, D.; Severijns, N.

2014-09-01

Background: Precision measurements at low energy search for physics beyond the standard model in a way complementary to searches for new particles at colliders. In the weak sector the most general β-decay Hamiltonian contains, besides vector and axial-vector terms, also scalar, tensor, and pseudoscalar terms. Current limits on the scalar and tensor coupling constants from neutron and nuclear β decay are on the level of several percent. Purpose: Extracting new information on tensor coupling constants by measuring the β-asymmetry parameter in the pure Gamow-Teller decay of Cu67, thereby testing the V-A structure of the weak interaction. Method: An iron sample foil into which the radioactive nuclei were implanted was cooled down to mK temperatures in a 3He-4He dilution refrigerator. An external magnetic field of 0.1 T, in combination with the internal hyperfine magnetic field, oriented the nuclei. The anisotropic β radiation was observed with planar high-purity germanium detectors operating at a temperature of about 10 K. An on-line measurement of the β asymmetry of Cu68 was performed as well for normalization purposes. Systematic effects were investigated using geant4 simulations. Results: The experimental value, Ã=0.587(14), is in agreement with the standard model value of 0.5991(2) and is interpreted in terms of physics beyond the standard model. The limits obtained on possible tensor-type charged currents in the weak interaction Hamiltonian are -0.045<(CT+CT')/CA<0.159 (90% C.L.). Conclusions: The obtained limits are comparable to limits from other correlation measurements in nuclear β decay and contribute to further constraining tensor coupling constants.

Optimization of Network Topology in Computer-Aided Detection Schemes Using Phased Searching with NEAT in a Time-Scaled Framework.

Science.gov (United States)

Tan, Maxine; Pu, Jiantao; Zheng, Bin

2014-01-01

In the field of computer-aided mammographic mass detection, many different features and classifiers have been tested. Frequently, the relevant features and optimal topology for the artificial neural network (ANN)-based approaches at the classification stage are unknown, and thus determined by trial-and-error experiments. In this study, we analyzed a classifier that evolves ANNs using genetic algorithms (GAs), which combines feature selection with the learning task. The classifier named "Phased Searching with NEAT in a Time-Scaled Framework" was analyzed using a dataset with 800 malignant and 800 normal tissue regions in a 10-fold cross-validation framework. The classification performance measured by the area under a receiver operating characteristic (ROC) curve was 0.856 ± 0.029. The result was also compared with four other well-established classifiers that include fixed-topology ANNs, support vector machines (SVMs), linear discriminant analysis (LDA), and bagged decision trees. The results show that Phased Searching outperformed the LDA and bagged decision tree classifiers, and was only significantly outperformed by SVM. Furthermore, the Phased Searching method required fewer features and discarded superfluous structure or topology, thus incurring a lower feature computational and training and validation time requirement. Analyses performed on the network complexities evolved by Phased Searching indicate that it can evolve optimal network topologies based on its complexification and simplification parameter selection process. From the results, the study also concluded that the three classifiers - SVM, fixed-topology ANN, and Phased Searching with NeuroEvolution of Augmenting Topologies (NEAT) in a Time-Scaled Framework - are performing comparably well in our mammographic mass detection scheme.

Qualitative Parameters of Practice during University Studies

Science.gov (United States)

Stasiunaitiene, Egle; Norkute, Odeta

2011-01-01

In this article, relevance of practice during university studies is highlighted, as well as the main stages of its organisation, qualitative parameters, as well as criteria and indicators that validate them are defined. Discussion on the idea that taking into consideration qualitative parameters of organising practice as a component of studies…

Grid-search Moment Tensor Estimation: Implementation and CTBT-related Application

Science.gov (United States)

Stachnik, J. C.; Baker, B. I.; Rozhkov, M.; Friberg, P. A.; Leifer, J. M.

2017-12-01

This abstract presents a review work related to moment tensor estimation for Expert Technical Analysis at the Comprehensive Test Ban Treaty Organization. In this context of event characterization, estimation of key source parameters provide important insights into the nature of failure in the earth. For example, if the recovered source parameters are indicative of a shallow source with large isotropic component then one conclusion is that it is a human-triggered explosive event. However, an important follow-up question in this application is - does an alternative hypothesis like a deeper source with a large double couple component explain the data approximately as well as the best solution? Here we address the issue of both finding a most likely source and assessing its uncertainty. Using the uniform moment tensor discretization of Tape and Tape (2015) we exhaustively interrogate and tabulate the source eigenvalue distribution (i.e., the source characterization), tensor orientation, magnitude, and source depth. The benefit of the grid-search is that we can quantitatively assess the extent to which model parameters are resolved. This provides a valuable opportunity during the assessment phase to focus interpretation on source parameters that are well-resolved. Another benefit of the grid-search is that it proves to be a flexible framework where different pieces of information can be easily incorporated. To this end, this work is particularly interested in fitting teleseismic body waves and regional surface waves as well as incorporating teleseismic first motions when available. Being that the moment tensor search methodology is well-established we primarily focus on the implementation and application. We present a highly scalable strategy for systematically inspecting the entire model parameter space. We then focus on application to regional and teleseismic data recorded during a handful of natural and anthropogenic events, report on the grid-search optimum, and

A multiple relevance feedback strategy with positive and negative models.

Directory of Open Access Journals (Sweden)

Yunlong Ma

Full Text Available A commonly used strategy to improve search accuracy is through feedback techniques. Most existing work on feedback relies on positive information, and has been extensively studied in information retrieval. However, when a query topic is difficult and the results from the first-pass retrieval are very poor, it is impossible to extract enough useful terms from a few positive documents. Therefore, the positive feedback strategy is incapable to improve retrieval in this situation. Contrarily, there is a relatively large number of negative documents in the top of the result list, and it has been confirmed that negative feedback strategy is an important and useful way for adapting this scenario by several recent studies. In this paper, we consider a scenario when the search results are so poor that there are at most three relevant documents in the top twenty documents. Then, we conduct a novel study of multiple strategies for relevance feedback using both positive and negative examples from the first-pass retrieval to improve retrieval accuracy for such difficult queries. Experimental results on these TREC collections show that the proposed language model based multiple model feedback method which is generally more effective than both the baseline method and the methods using only positive or negative model.

Why relevance theory is relevant for lexicography

DEFF Research Database (Denmark)

Bothma, Theo; Tarp, Sven

2014-01-01

This article starts by providing a brief summary of relevance theory in information science in relation to the function theory of lexicography, explaining the different types of relevance, viz. objective system relevance and the subjective types of relevance, i.e. topical, cognitive, situational...... that is very important for lexicography as well as for information science, viz. functional relevance. Since all lexicographic work is ultimately aimed at satisfying users’ information needs, the article then discusses why the lexicographer should take note of all these types of relevance when planning a new...... dictionary project, identifying new tasks and responsibilities of the modern lexicographer. The article furthermore discusses how relevance theory impacts on teaching dictionary culture and reference skills. By integrating insights from lexicography and information science, the article contributes to new...

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

Energy Technology Data Exchange (ETDEWEB)

2016-11-04

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.

A Fuzzy Gravitational Search Algorithm to Design Optimal IIR Filters

Directory of Open Access Journals (Sweden)

Danilo Pelusi

2018-03-01

Full Text Available The goodness of Infinite Impulse Response (IIR digital filters design depends on pass band ripple, stop band ripple and transition band values. The main problem is defining a suitable error fitness function that depends on these parameters. This fitness function can be optimized by search algorithms such as evolutionary algorithms. This paper proposes an intelligent algorithm for the design of optimal 8th order IIR filters. The main contribution is the design of Fuzzy Inference Systems able to tune key parameters of a revisited version of the Gravitational Search Algorithm (GSA. In this way, a Fuzzy Gravitational Search Algorithm (FGSA is designed. The optimization performances of FGSA are compared with those of Differential Evolution (DE and GSA. The results show that FGSA is the algorithm that gives the best compromise between goodness, robustness and convergence rate for the design of 8th order IIR filters. Moreover, FGSA assures a good stability of the designed filters.

Search for neutral MSSM Higgs bosons at LEP

CERN Document Server

Schael, S.; Bruneliere, R.; De Bonis, I.; Decamp, D.; Goy, C.; Jezequel, S.; Lees, J.P.; Martin, F.; Merle, E.; Minard, M.N.; Pietrzyk, B.; Trocme, B.; Bravo, S.; Casado, M.P.; Chmeissani, M.; Crespo, J.M.; Fernandez, E.; Fernandez-Bosman, M.; Garrido, L.; Martinez, M.; Pacheco, A.; Ruiz, H.; Colaleo, A.; Creanza, D.; De Filippis, N.; de Palma, M.; Iaselli, G.; Maggi, G.; Maggi, M.; Nuzzo, S.; Ranieri, A.; Raso, G.; Ruggieri, F.; Selvaggi, G.; Silvestris, L.; Tempesta, P.; Tricomi, A.; Zito, G.; Huang, X.; Lin, J.; Ouyang, Q.; Wang, T.; Xie, Y.; Xu, R.; Xue, S.; Zhang, J.; Zhang, L.; Zhao, W.; Abbaneo, D.; Barklow, T.; Buchmuller, O.; Cattaneo, M.; Clerbaux, B.; Drevermann, H.; Forty, R.W.; Frank, M.; Gianotti, F.; Hansen, J.B.; Harvey, J.; Hutchcroft, D.E.; Janot, P.; Jost, B.; Kado, M.; Mato, P.; Moutoussi, A.; Ranjard, F.; Rolandi, L.; Schlatter, D.; Teubert, F.; Valassi, A.; Videau, I.; Badaud, F.; Dessagne, S.; Falvard, A.; Fayolle, D.; Gay, P.; Jousset, J.; Michel, B.; Monteil, S.; Pallin, D.; Pascolo, J.M.; Perret, P.; Hansen, J.D.; Hansen, J.R.; Hansen, P.H.; Kraan, A.C.; Nilsson, B.S.; Kyriakis, A.; Markou, C.; Simopoulou, E.; Vayaki, A.; Zachariadou, K.; Blondel, A.; Brient, J.C.; Machefert, F.; Rouge, A.; Videau, H.; Ciulli, V.; Focardi, E.; Parrini, G.; Antonelli, A.; Antonelli, M.; Bencivenni, G.; Bossi, F.; Capon, G.; Cerutti, F.; Chiarella, V.; Mannocchi, G.; Laurelli, P.; Mannocchi, G.; Murtas, G.P.; Passalacqua, L.; Kennedy, J.; Lynch, J.G.; Negus, P.; O'Shea, V.; Thompson, A.S.; Wasserbaech, S.; Cavanaugh, R.; Dhamotharan, S.; Geweniger, C.; Hanke, P.; Hepp, V.; Kluge, E.E.; Putzer, A.; Stenzel, H.; Tittel, K.; Wunsch, M.; Beuselinck, R.; Cameron, W.; Davies, G.; Dornan, P.J.; Girone, M.; Marinelli, N.; Nowell, J.; Rutherford, S.A.; Sedgbeer, J.K.; Thompson, J.C.; White, R.; Ghete, V.M.; Girtler, P.; Kneringer, E.; Kuhn, D.; Rudolph, G.; Bouhova-Thacker, E.; Bowdery, C.K.; Clarke, D.P.; Ellis, G.; Finch, A.J.; Foster, F.; Hughes, G.; Jones, R.W.L.; Pearson, M.R.; Robertson, N.A.; Smizanska, M.; van der Aa, O.; Delaere, C.; Leibenguth, G.; Lemaitre, V.; Blumenschein, U.; Holldorfer, F.; Jakobs, K.; Kayser, F.; Muller, A.S.; Renk, B.; Sander, H.G.; Schmeling, S.; Wachsmuth, H.; Zeitnitz, C.; Ziegler, T.; Bonissent, A.; Coyle, P.; Curtil, C.; Ealet, A.; Fouchez, D.; Payre, P.; Tilquin, A.; Ragusa, F.; David, A.; Dietl, H.; Ganis, G.; Huttmann, K.; Lutjens, G.; Manner, W.; Moser, H.G.; Settles, R.; Villegas, M.; Wolf, G.; Boucrot, J.; Callot, O.; Davier, M.; Duflot, L.; Grivaz, J.F.; Heusse, P.; Jacholkowska, A.; Serin, L.; Veillet, J.J.; Azzurri, P.; Bagliesi, G.; Boccali, T.; Foa, L.; Giammanco, A.; Giassi, A.; Ligabue, F.; Messineo, A.; Palla, F.; Sanguinetti, G.; Sciaba, A.; Sguazzoni, G.; Spagnolo, P.; Tenchini, R.; Venturi, A.; Verdini, P.G.; Awunor, O.; Blair, G.A.; Cowan, G.; Garcia-Bellido, A.; Green, M.G.; Medcalf, T.; Misiejuk, A.; Strong, J.A.; Teixeira-Dias, P.; Clifft, R.W.; Edgecock, T.R.; Norton, P.R.; Tomalin, I.R.; Ward, J.J.; Bloch-Devaux, B.; Boumediene, D.; Colas, P.; Fabbro, B.; Lancon, E.; Lemaire, M.C.; Locci, E.; Perez, P.; Rander, J.; Tuchming, B.; Vallage, B.; Litke, A.M.; Taylor, G.; Booth, C.N.; Cartwright, S.; Combley, F.; Hodgson, P.N.; Lehto, M.; Thompson, L.F.; Bohrer, A.; Brandt, S.; Grupen, C.; Hess, J.; Ngac, A.; Prange, G.; Borean, C.; Giannini, G.; He, H.; Putz, J.; Rothberg, J.; Armstrong, S.R.; Berkelman, K.; Cranmer, K.; Ferguson, D.P.S.; Gao, Y.; Gonzalez, S.; Hayes, O.J.; Hu, H.; Jin, S.; Kile, J.; McNamara, P.A.; Nielsen, J.; Pan, Y.B.; von Wimmersperg-Toeller, J.H.; Wiedenmann, W.; Wu, J.; Wu, S.L.; Wu, X.; Zobernig, G.; Dissertori, G.; Abdallah, J.; Abreu, P.; Adam, W.; Adzic, P.; Albrecht, T.; Alderweireld, T.; Alemany-Fernandez, R.; Allmendinger, T.; Allport, P.P.; Amaldi, U.; Amapane, N.; Amato, S.; Anashkin, E.; Andreazza, A.; Andringa, S.; Anjos, N.; Antilogus, P.; Apel, W.D.; Arnoud, Y.; Ask, S.; Asman, B.; Augustin, J.E.; Augustinus, A.; Baillon, P.; Ballestrero, A.; Bambade, P.; Barbier, R.; Bardin, D.; Barker, G.J.; Baroncelli, A.; Battaglia, M.; Baubillier, M.; Becks, K.H.; Begalli, M.; Behrmann, A.; Ben-Haim, E.; Benekos, N.; Benvenuti, A.; Berat, C.; Berggren, M.; Berntzon, L.; Bertrand, D.; Besancon, M.; Besson, N.; Bloch, D.; Blom, M.; Bluj, M.; Bonesini, M.; Boonekamp, M.; Booth, P.S.L.; Borisov, G.; Botner, O.; Bouquet, B.; Bowcock, T.J.V.; Boyko, I.; Bracko, M.; Brenner, R.; Brodet, E.; Bruckman, P.; Brunet, J.M.; Buschbeck, B.; Buschmann, P.; Calvi, M.; Camporesi, T.; Canale, V.; Carena, F.; Castro, N.; Cavallo, F.; Chapkin, M.; Charpentier, P.; Checchia, P.; Chierici, R.; Chliapnikov, P.; Chudoba, J.; Chung, S.U.; Cieslik, K.; Collins, P.; Contri, R.; Cosme, G.; Cossutti, F.; Costa, M.J.; Crennell, D.; Cuevas, J.; D'Hondt, J.; Dalmau, J.; da Silva, T.; Da Silva, W.; Della Ricca, G.; De Angelis, A.; De Boer, W.; De Clercq, C.; De Lotto, B.; De Maria, N.; De Min, A.; de Paula, L.; Di Ciaccio, L.; Di Simone, A.; Doroba, K.; Drees, J.; Eigen, G.; Ekelof, T.; Ellert, M.; Elsing, M.; Espirito Santo, M.C.; Fanourakis, G.; Fassouliotis, D.; Feindt, M.; Fernandez, J.; Ferrer, A.; Ferro, F.; Flagmeyer, U.; Foeth, H.; Fokitis, E.; Fulda-Quenzer, F.; Fuster, J.; Gandelman, M.; Garcia, C.; Gavillet, P.; Gazis, E.; Gokieli, R.; Golob, B.; Gomez-Ceballos, G.; Goncalves, P.; Graziani, E.; Grosdidier, G.; Grzelak, K.; Guy, J.; Haag, C.; Hallgren, A.; Hamacher, K.; Hamilton, K.; Haug, S.; Hauler, F.; Hedberg, V.; Hennecke, M.; Herr, H.; Hoffman, J.; Holmgren, S.O.; Holt, P.J.; Houlden, M.A.; Hultqvist, K.; Jackson, J.N.; Jarlskog, G.; Jarry, P.; Jeans, D.; Johansson, E.K.; Johansson, P.D.; Jonsson, P.; Joram, C.; Jungermann, L.; Kapusta, F.; Katsanevas, S.; Katsoufis, E.; Kernel, G.; Kersevan, B.P.; Kerzel, U.; King, B.T.; Kjaer, N.J.; Kluit, P.; Kokkinias, P.; Kourkoumelis, C.; Kouznetsov, O.; Krumstein, Z.; Kucharczyk, M.; Lamsa, J.; Leder, G.; Ledroit, F.; Leinonen, L.; Leitner, R.; Lemonne, J.; Lepeltier, V.; Lesiak, T.; Liebig, W.; Liko, D.; Lipniacka, A.; Lopes, J.H.; Lopez, J.M.; Loukas, D.; Lutz, P.; Lyons, L.; MacNaughton, J.; Malek, A.; Maltezos, S.; Mandl, F.; Marco, J.; Marco, R.; Marechal, B.; Margoni, M.; Marin, J.C.; Mariotti, C.; Markou, A.; Martinez-Rivero, C.; Masik, J.; Mastroyiannopoulos, N.; Matorras, F.; Matteuzzi, C.; Mazzucato, F.; Mazzucato, M.; Mc Nulty, R.; Meroni, C.; Migliore, E.; Mitaroff, W.; Mjoernmark, U.; Moa, T.; Moch, M.; Monig, Klaus; Monge, R.; Montenegro, J.; Moraes, D.; Moreno, S.; Morettini, P.; Mueller, U.; Muenich, K.; Mulders, M.; Mundim, L.; Murray, W.; Muryn, B.; Myatt, G.; Myklebust, T.; Nassiakou, M.; Navarria, F.; Nawrocki, K.; Nicolaidou, R.; Nikolenko, M.; Oblakowska-Mucha, A.; Obraztsov, V.; Olshevski, A.; Onofre, A.; Orava, R.; Osterberg, K.; Ouraou, A.; Oyanguren, A.; Paganoni, M.; Paiano, S.; Palacios, J.P.; Palka, H.; Papadopoulou, T.D.; Pape, L.; Parkes, C.; Parodi, F.; Parzefall, U.; Passeri, A.; Passon, O.; Peralta, L.; Perepelitsa, V.; Perrotta, A.; Petrolini, A.; Piedra, J.; Pieri, L.; Pierre, F.; Pimenta, M.; Piotto, E.; Podobnik, T.; Poireau, V.; Pol, M.E.; Polok, G.; Pozdniakov, V.; Pukhaeva, N.; Pullia, A.; Rames, J.; Read, A.; Rebecchi, P.; Rehn, J.; Reid, D.; Reinhardt, R.; Renton, P.; Richard, F.; Ridky, J.; Rivero, M.; Rodriguez, D.; Romero, A.; Ronchese, P.; Roudeau, P.; Rovelli, T.; Ruhlmann-Kleider, V.; Ryabtchikov, D.; Sadovsky, A.; Salmi, L.; Salt, J.; Sander, C.; Savoy-Navarro, A.; Schwickerath, U.; Segar, A.; Sekulin, R.; Siebel, M.; Sisakian, A.; Smadja, G.; Smirnova, O.; Sokolov, A.; Sopczak, A.; Sosnowski, R.; Spassov, T.; Stanitzki, M.; Stocchi, A.; Strauss, J.; Stugu, B.; Szczekowski, M.; Szeptycka, M.; Szumlak, T.; Tabarelli, T.; Taffard, A.C.; Tegenfeldt, F.; Timmermans, J.; Tkatchev, L.; Tobin, M.; Todorovova, S.; Tome, B.; Tonazzo, A.; Tortosa, P.; Travnicek, P.; Treille, D.; Tristram, G.; Trochimczuk, M.; Troncon, C.; Turluer, M.L.; Tyapkin, I.A.; Tyapkin, P.; Tzamarias, S.; Uvarov, V.; Valenti, G.; Van Dam, P.; Van Eldik, J.; van Remortel, N.; Van Vulpen, I.; Vegni, G.; Veloso, F.; Venus, W.; Verdier, P.; Verzi, V.; Vilanova, D.; Vitale, L.; Vrba, V.; Wahlen, H.; Washbrook, A.J.; Weiser, C.; Wicke, D.; Wickens, J.; Wilkinson, G.; Winter, M.; Witek, M.; Yushchenko, O.; Zalewska, A.; Zalewski, P.; Zavrtanik, D.; Zhuravlov, V.; Zimine, N.I.; Zintchenko, A.; Achard, P.; Zupan, M.; Adriani, O.; Aguilar-Benitez, M.; Alcaraz, J.; Alemanni, G.; Allaby, J.; Aloisio, A.; Alviggi, M.G.; Anderhub, H.; Andreev, V.P.; Anselmo, F.; Arefiev, A.; Azemoon, T.; Aziz, T.; Bagnaia, P.; Bajo, A.; Baksay, G.; Baksay, L.; Baldew, S.V.; Banerjee, S.; Banerjee, Sw.; Barczyk, A.; Barillere, R.; Bartalini, P.; Basile, M.; Batalova, N.; Battiston, R.; Bay, A.; Becattini, F.; Becker, U.; Behner, F.; Bellucci, L.; Berbeco, R.; Berdugo, J.; Berges, P.; Bertucci, B.; Betev, B.L.; Biasini, M.; Biglietti, M.; Biland, A.; Blaising, J.J.; Blyth, S.C.; Bobbink, G.J.; Bohm, A.; Boldizsar, L.; Borgia, B.; Bottai, S.; Bourilkov, D.; Bourquin, M.; Braccini, S.; Branson, J.G.; Brochu, F.; Burger, J.D.; Burger, W.J.; Cai, X.D.; Capell, M.; Cara Romeo, G.; Carlino, G.; Cartacci, A.; Casaus, J.; Cavallari, F.; Cavallo, N.; Cecchi, C.; Cerrada, M.; Chamizo, M.; Chang, Y.H.; Chemarin, M.; Chen, A.; Chen, G.; Chen, G.M.; Chen, H.F.; Chen, H.S.; Chiefari, G.; Cifarelli, L.; Cindolo, F.; Clare, I.; Clare, R.; Coignet, G.; Colino, N.; Costantini, S.; de la Cruz, B.; Cucciarelli, S.; de Asmundis, R.; Deglon, P.; Debreczeni, J.; Degre, A.; Dehmelt, K.; Deiters, K.; della Volpe, D.; Delmeire, E.; Denes, P.; DeNotaristefani, F.; De Salvo, A.; Diemoz, M.; Dierckxsens, M.; Dionisi, C.; Dittmar, M.; Doria, A.; Dova, M.T.; Duchesneau, D.; Duda, M.; Echenard, B.; Eline, A.; El Hage, A.; El Mamouni, H.; Engler, A.; Eppling, F.J.; Extermann, P.; Falagan, M.A.; Falciano, S.; Favara, A.; Fay, J.; Fedin, O.; Felcini, M.; Ferguson, T.; Fesefeldt, H.; Fiandrini, E.; Field, J.H.; Filthaut, F.; Fisher, P.H.; Fisher, W.; Forconi, G.; Freudenreich, K.; Furetta, C.; Galaktionov, Yu.; Ganguli, S.N.; Garcia-Abia, P.; Gataullin, M.; Gentile, S.; Giagu, S.; Gong, Z.F.; Grenier, G.; Grimm, O.; Gruenewald, M.W.; Guida, M.; Gupta, V.K.; Gurtu, A.; Gutay, L.J.; Haas, D.; Hatzifotiadou, D.; Hebbeker, T.; Herve, A.; Hirschfelder, J.; Hofer, H.; Hohlmann, M.; Holzner, G.; Hou, S.R.; Hu, J.; Jin, B.N.; Jindal, P.; Jones, L.W.; de Jong, P.; Josa-Mutuberra, I.; Kaur, M.; Kienzle-Focacci, M.N.; Kim, J.K.; Kirkby, J.; Kittel, W.; Klimentov, A.; Konig, A.C.; Kopal, M.; Koutsenko, V.; Kraber, M.; Kraemer, R.W.; Kruger, A.; Kunin, A.; Ladron de Guevara, P.; Laktineh, I.; Landi, G.; Lebeau, M.; Lebedev, A.; Lebrun, P.; Lecomte, P.; Lecoq, P.; Le Coultre, P.; Le Goff, J.M.; Leiste, R.; Levtchenko, M.; Levtchenko, P.; Li, C.; Likhoded, S.; Lin, C.H.; Lin, W.T.; Linde, F.L.; Lista, L.; Liu, Z.A.; Lohmann, W.; Longo, E.; Lu, Y.S.; Luci, C.; Luminari, L.; Lustermann, W.; Ma, W.G.; Malgeri, L.; Malinin, A.; Mana, C.; Mans, J.; Martin, J.P.; Marzano, F.; Mazumdar, K.; McNeil, R.R.; Mele, S.; Merola, L.; Meschini, M.; Metzger, W.J.; Mihul, A.; Milcent, H.; Mirabelli, G.; Mnich, J.; Mohanty, G.B.; Muanza, G.S.; Muijs, A.J.M.; Musicar, B.; Musy, M.; Nagy, S.; Natale, S.; Napolitano, M.; Nessi-Tedaldi, F.; Newman, H.; Nisati, A.; Novak, T.; Nowak, H.; Ofierzynski, R.; Organtini, G.; Pal, I.; Palomares, C.; Paolucci, P.; Paramatti, R.; Passaleva, G.; Patricelli, S.; Paul, T.; Pauluzzi, M.; Paus, C.; Pauss, F.; Pedace, M.; Pensotti, S.; Perret-Gallix, D.; Piccolo, D.; Pierella, F.; Pieri, M.; Pioppi, M.; Piroue, P.A.; Pistolesi, E.; Plyaskin, V.; Pohl, M.; Pojidaev, V.; Pothier, J.; Prokofiev, D.; Rahal-Callot, G.; Rahaman, M.A.; Raics, P.; Raja, N.; Ramelli, R.; Rancoita, P.G.; Ranieri, R.; Raspereza, A.; Razis, P.; Rembeczki, S.; Ren, D.; Rescigno, M.; Reucroft, S.; Riemann, S.; Riles, Keith; Roe, B.P.; Romero, L.; Rosca, A.; Rosemann, C.; Rosenbleck, C.; Rosier-Lees, S.; Roth, S.; Rubio, J.A.; Ruggiero, G.; Rykaczewski, H.; Sakharov, A.; Saremi, S.; Sarkar, S.; Salicio, J.; Sanchez, E.; Schafer, C.; Schegelsky, V.; Schopper, H.; Schotanus, D.J.; Sciacca, C.; Servoli, L.; Shevchenko, S.; Shivarov, N.; Shoutko, V.; Shumilov, E.; Shvorob, A.; Son, D.; Souga, C.; Spillantini, P.; Steuer, M.; Stickland, D.P.; Stoyanov, B.; Straessner, A.; Sudhakar, K.; Sultanov, G.; Sun, L.Z.; Sushkov, S.; Suter, H.; Swain, J.D.; Szillasi, Z.; Tang, X.W.; Tarjan, P.; Tauscher, L.; Taylor, L.; Tellili, B.; Teyssier, D.; Timmermans, C.; Ting, S.C.C.; Ting, S.M.; Tonwar, S.C.; Toth, J.; Tully, C.; Tung, K.L.; Ulbricht, J.; Valente, E.; Van de Walle, R.T.; Vasquez, R.; Vesztergombi, G.; Vetlitsky, I.; Viertel, G.; Vivargent, M.; Vlachos, S.; Vodopianov, I.; Vogel, H.; Vogt, H.; Vorobiev, I.; Vorobyov, A.A.; Wadhwa, M.; Wang, Q.; Wang, X.L.; Wang, Z.M.; Weber, M.; Wynhoff, S.; Xia, L.; Xu, Z.Z.; Yamamoto, J.; Yang, B.Z.; Yang, C.G.; Yang, H.J.; Yang, M.; Yeh, S.C.; Zalite, An.; Zalite, Yu.; Zhang, Z.P.; Zhao, J.; Zhu, G.Y.; Zhu, R.Y.; Zhuang, H.L.; Zichichi, A.; Zimmermann, B.; Zoller, M.; Abbiendi, G.; Ainsley, C.; Akesson, P.F.; Alexander, G.; Allison, J.; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Asai, S.; Axen, D.; Azuelos, G.; Bailey, I.; Barberio, E.; Barillari, T.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, K.W.; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Boeriu, O.; Bock, P.; Boutemeur, M.; Braibant, S.; Brigliadori, L.; Brown, R.M.; Buesser, K.; Burckhart, H.J.; Campana, S.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, D.G.; Ciocca, C.; Csilling, A.; Cuffiani, M.; Dado, S.; de Jong, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Etzion, E.; Fabbri, F.; Feld, L.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Gagnon, P.; Gary, J.W.; Gascon-Shotkin, S.M.; Gaycken, G.; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, M.; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harel, A.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, K.; Horvath, D.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jost, U.; Jovanovic, P.; Junk, T.R.; Kanaya, N.; Kanzaki, J.; Karlen, D.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kramer, T.; Krieger, P.; von Krogh, J.; Kruger, K.; Kuhl, T.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Layter, J.G.; Lellouch, D.; Letts, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, A.; Ludwig, J.; Mader, W.; Marcellini, S.; Martin, A.J.; Masetti, G.; Mashimo, T.; Mattig, P.; McKenna, J.; McPherson, R.A.; Meijers, F.; Menges, W.; Merritt, F.S.; Mes, H.; Meyer, N.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Moed, S.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Nanjo, H.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oh, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Pilcher, J.E.; Pinfold, J.; Plane, D.E.; Poli, B.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Roney, J.M.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schorner-Sadenius, T.; Schroder, M.; Schumacher, M.; Scott, W.G.; Seuster, R.; Shears, T.G.; Shen, B.C.; Sherwood, P.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spano, F.; Stahl, A.; Strom, D.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vollmer, C.F.; Vannerem, P.; Vertesi, R.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wilson, G.W.; Wilson, J.A.; Wolf, G.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, L.; Heinemeyer, S.; Pilaftsis, A.; Weiglein, G.

2006-01-01

The four LEP collaborations, ALEPH, DELPHI, L3 and OPAL, have searched for the neutral Higgs bosons which are predicted by the Minimal Supersymmetric Standard Model (MSSM). The data of the four collaborations are statistically combined and examined for their consistency with the background hypothesis and with a possible Higgs boson signal. The combined LEP data show no significant excess of events which would indicate the production of Higgs bosons. The search results are used to set upper bounds on the cross-sections of various Higgs-like event topologies. The results are interpreted within the MSSM in a number of ``benchmark" models, including CP-conserving and CP-violating scenarios. These interpretations lead in all cases to large exclusions in the MSSM parameter space. Absolute limits are set on the parameter tanb and, in some scenarios, on the masses of neutral Higgs bosons.

Efficient search by optimized intermittent random walks

International Nuclear Information System (INIS)

Oshanin, Gleb; Lindenberg, Katja; Wio, Horacio S; Burlatsky, Sergei

2009-01-01

We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability α or go off lattice with probability 1 - α to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering α and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P N that the target remains undetected up to the maximal search time N. We show that even in this simple model, a number of very efficient search strategies can lead to a decrease of P N by orders of magnitude upon appropriate choices of α and L. We demonstrate that, in general, such optimal intermittent strategies are much more efficient than Brownian searches and are as efficient as search algorithms based on random walks with heavy-tailed Cauchy jump-length distributions. In addition, such intermittent strategies appear to be more advantageous than Levy-based ones in that they lead to more thorough exploration of visited regions in space and thus lend themselves to parallelization of the search processes.

Contingent attentional capture across multiple feature dimensions in a temporal search task.

Science.gov (United States)

Ito, Motohiro; Kawahara, Jun I