Construction Example for Algebra System Using Harmony Search Algorithm

Directory of Open Access Journals (Sweden)

FangAn Deng

2015-01-01

Full Text Available The construction example of algebra system is to verify the existence of a complex algebra system, and it is a NP-hard problem. In this paper, to solve this kind of problems, firstly, a mathematical optimization model for construction example of algebra system is established. Secondly, an improved harmony search algorithm based on NGHS algorithm (INGHS is proposed to find as more solutions as possible for the optimization model; in the proposed INGHS algorithm, to achieve the balance between exploration power and exploitation power in the search process, a global best strategy and parameters dynamic adjustment method are present. Finally, nine construction examples of algebra system are used to evaluate the optimization model and performance of INGHS. The experimental results show that the proposed algorithm has strong performance for solving complex construction example problems of algebra system.

Clinician search behaviors may be influenced by search engine design.

Science.gov (United States)

Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

2010-06-30

Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that

Open meta-search with OpenSearch: a case study

OpenAIRE

O'Riordan, Adrian P.

2007-01-01

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

Semantically Enriching the Search System of a Music Digital Library

Science.gov (United States)

de Juan, Paloma; Iglesias, Carlos

Traditional search systems are usually based on keywords, a very simple and convenient mechanism to express a need for information. This is the most popular way of searching the Web, although it is not always an easy task to accurately summarize a natural language query in a few keywords. Working with keywords means losing the context, which is the only thing that can help us deal with ambiguity. This is the biggest problem of keyword-based systems. Semantic Web technologies seem a perfect solution to this problem, since they make it possible to represent the semantics of a given domain. In this chapter, we present three projects, Harmos, Semusici and Cantiga, whose aim is to provide access to a music digital library. We will describe two search systems, a traditional one and a semantic one, developed in the context of these projects and compare them in terms of usability and effectiveness.

SIRW: A web server for the Simple Indexing and Retrieval System that combines sequence motif searches with keyword searches.

Science.gov (United States)

Ramu, Chenna

2003-07-01

SIRW (http://sirw.embl.de/) is a World Wide Web interface to the Simple Indexing and Retrieval System (SIR) that is capable of parsing and indexing various flat file databases. In addition it provides a framework for doing sequence analysis (e.g. motif pattern searches) for selected biological sequences through keyword search. SIRW is an ideal tool for the bioinformatics community for searching as well as analyzing biological sequences of interest.

Search techniques in intelligent classification systems

CERN Document Server

Savchenko, Andrey V

2016-01-01

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

Video Content Search System for Better Students Engagement in the Learning Process

Directory of Open Access Journals (Sweden)

Alanoud Alotaibi

2014-12-01

Full Text Available As a component of the e-learning educational process, content plays an essential role. Increasingly, the video-recorded lectures in e-learning systems are becoming more important to learners. In most cases, a single video-recorded lecture contains more than one topic or sub-topic. Therefore, to enable learners to find the desired topic and reduce learning time, e-learning systems need to provide a search capability for searching within the video content. This can be accomplished by enabling learners to identify the video or portion that contains a keyword they are looking for. This research aims to develop Video Content Search system to facilitate searching in educational videos and its contents. Preliminary results of an experimentation were conducted on a selected university course. All students needed a system to avoid time-wasting problem of watching long videos with no significant benefit. The statistics showed that the number of learners increased during the experiment. Future work will include studying impact of VCS system on students’ performance and satisfaction.

Teaching AI Search Algorithms in a Web-Based Educational System

Science.gov (United States)

Grivokostopoulou, Foteini; Hatzilygeroudis, Ioannis

2013-01-01

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

Evaluation of a prototype search and visualization system for exploring scientific communities.

Science.gov (United States)

Bales, Michael E; Kaufman, David R; Johnson, Stephen B

2009-11-14

Searches of bibliographic databases generate lists of articles but do little to reveal connections between authors, institutions, and grants. As a result, search results cannot be fully leveraged. To address this problem we developed Sciologer, a prototype search and visualization system. Sciologer presents the results of any PubMed query as an interactive network diagram of the above elements. We conducted a cognitive evaluation with six neuroscience and six obesity researchers. Researchers used the system effectively. They used geographic, color, and shape metaphors to describe community structure and made accurate inferences pertaining to a) collaboration among research groups; b) prominence of individual researchers; and c) differentiation of expertise. The tool confirmed certain beliefs, disconfirmed others, and extended their understanding of their own discipline. The majority indicated the system offered information of value beyond a traditional PubMed search and that they would use the tool if available.

Agent-oriented Architecture for Task-based Information Search System

NARCIS (Netherlands)

Aroyo, Lora; de Bra, Paul M.E.; De Bra, P.; Hardman, L.

1999-01-01

The topic of the reported research discusses an agent-oriented architecture of an educational information search system AIMS - a task-based learner support system. It is implemented within the context of 'Courseware Engineering' on-line course at the Faculty of Educational Science and Technology,

Investigating User Search Tactic Patterns and System Support in Using Digital Libraries

Science.gov (United States)

Joo, Soohyung

2013-01-01

This study aims to investigate users' search tactic application and system support in using digital libraries. A user study was conducted with sixty digital library users. The study was designed to answer three research questions: 1) How do users engage in a search process by applying different types of search tactics while conducting different…

Development of intelligent semantic search system for rubber research data in Thailand

Science.gov (United States)

Kaewboonma, Nattapong; Panawong, Jirapong; Pianhanuruk, Ekkawit; Buranarach, Marut

2017-10-01

The rubber production of Thailand increased not only by strong demand from the world market, but was also stimulated strongly through the replanting program of the Thai Government from 1961 onwards. With the continuous growth of rubber research data volume on the Web, the search for information has become a challenging task. Ontologies are used to improve the accuracy of information retrieval from the web by incorporating a degree of semantic analysis during the search. In this context, we propose an intelligent semantic search system for rubber research data in Thailand. The research methods included 1) analyzing domain knowledge, 2) ontologies development, and 3) intelligent semantic search system development to curate research data in trusted digital repositories may be shared among the wider Thailand rubber research community.

The Search Performance Evaluation and Prediction in Exploratory Search

OpenAIRE

LIU, FEI

2016-01-01

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

System identification using Nuclear Norm & Tabu Search optimization

Science.gov (United States)

Ahmed, Asif A.; Schoen, Marco P.; Bosworth, Ken W.

2018-01-01

In recent years, subspace System Identification (SI) algorithms have seen increased research, stemming from advanced minimization methods being applied to the Nuclear Norm (NN) approach in system identification. These minimization algorithms are based on hard computing methodologies. To the authors’ knowledge, as of now, there has been no work reported that utilizes soft computing algorithms to address the minimization problem within the nuclear norm SI framework. A linear, time-invariant, discrete time system is used in this work as the basic model for characterizing a dynamical system to be identified. The main objective is to extract a mathematical model from collected experimental input-output data. Hankel matrices are constructed from experimental data, and the extended observability matrix is employed to define an estimated output of the system. This estimated output and the actual - measured - output are utilized to construct a minimization problem. An embedded rank measure assures minimum state realization outcomes. Current NN-SI algorithms employ hard computing algorithms for minimization. In this work, we propose a simple Tabu Search (TS) algorithm for minimization. TS algorithm based SI is compared with the iterative Alternating Direction Method of Multipliers (ADMM) line search optimization based NN-SI. For comparison, several different benchmark system identification problems are solved by both approaches. Results show improved performance of the proposed SI-TS algorithm compared to the NN-SI ADMM algorithm.

A penalty guided stochastic fractal search approach for system reliability optimization

International Nuclear Information System (INIS)

Mellal, Mohamed Arezki; Zio, Enrico

2016-01-01

Modern industry requires components and systems with high reliability levels. In this paper, we address the system reliability optimization problem. A penalty guided stochastic fractal search approach is developed for solving reliability allocation, redundancy allocation, and reliability–redundancy allocation problems. Numerical results of ten case studies are presented as benchmark problems for highlighting the superiority of the proposed approach compared to others from literature. - Highlights: • System reliability optimization is investigated. • A penalty guided stochastic fractal search approach is developed. • Results of ten case studies are compared with previously published methods. • Performance of the approach is demonstrated.

Searching methods for biometric identification systems: Fundamental limits

NARCIS (Netherlands)

Willems, F.M.J.

2009-01-01

We study two-stage search procedures for biometric identification systems in an information-theoretical setting. Our main conclusion is that clustering based on vector-quantization achieves the optimum trade-off between the number of clusters (cluster rate) and the number of individuals within a

Event Index - a LHCb Event Search System

CERN Document Server

INSPIRE-00392208; Kazeev, Nikita; Redkin, Artem

2015-12-23

LHC experiments generate up to $10^{12}$ events per year. This paper describes Event Index - an event search system. Event Index's primary function is quickly selecting subsets of events from a combination of conditions, such as the estimated decay channel or stripping lines output. Event Index is essentially Apache Lucene optimized for read-only indexes distributed over independent shards on independent nodes.

A high-speed drug interaction search system for ease of use in the clinical environment.

Science.gov (United States)

Takada, Masahiro; Inada, Hiroshi; Nakazawa, Kazuo; Tani, Shoko; Iwata, Michiaki; Sugimoto, Yoshihisa; Nagata, Satoru

2012-12-01

With the advancement of pharmaceutical development, drug interactions have become increasingly complex. As a result, a computer-based drug interaction search system is required to organize the whole of drug interaction data. To overcome problems faced with the existing systems, we developed a drug interaction search system using a hash table, which offers higher processing speeds and easier maintenance operations compared with relational databases (RDB). In order to compare the performance of our system and MySQL RDB in terms of search speed, drug interaction searches were repeated for all 45 possible combinations of two out of a group of 10 drugs for two cases: 5,604 and 56,040 drug interaction data. As the principal result, our system was able to process the search approximately 19 times faster than the system using the MySQL RDB. Our system also has several other merits such as that drug interaction data can be created in comma-separated value (CSV) format, thereby facilitating data maintenance. Although our system uses the well-known method of a hash table, it is expected to resolve problems common to existing systems and to be an effective system that enables the safe management of drugs.

A Practical Route Search System for Amusement Parks Navigation

Directory of Open Access Journals (Sweden)

Takahiro Shibuya

2013-12-01

Full Text Available It is very difficult to find the minimum route to travel in amusement park navigation. A searching system for visitors would be useful. Therefore, we constructed a system to find the route with the minimum total traveling time. Facility visitors can employ this system on a smart phone. The system is composed of Java and a Java Servlet. We conclude that our system is useful and can greatly shorten travel time within a typical amusement park.

A best-first tree-searching approach for ML decoding in MIMO system

KAUST Repository

Shen, Chung-An; Eltawil, Ahmed M.; Mondal, Sudip; Salama, Khaled N.

2012-01-01

In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve

A Personalised Information Support System for Searching Portals and E-Resources

Science.gov (United States)

Sirisha, B. S.; Jeevan, V. K. J.; Raja Kumar, R. V.; Goswami, A.

2009-01-01

Purpose: The purpose of this paper is to describe the development of a personalised information support system to help faculty members to search various portals and e-resources without typing the search terms in different interfaces and to obtain results re-ordered without human intervention. Design/methodology/approach: After a careful survey of…

75 FR 25239 - Integrated Risk Information System (IRIS); Announcement of Availability of Literature Searches...

Science.gov (United States)

2010-05-07

... Information System (IRIS); Announcement of Availability of Literature Searches for IRIS Assessments AGENCY: Environmental Protection Agency. ACTION: Notice; Announcement of availability of literature searches for IRIS... the availability of literature searches for four IRIS assessments and requesting scientific...

A BLE-Based Pedestrian Navigation System for Car Searching in Indoor Parking Garages.

Science.gov (United States)

Wang, Sheng-Shih

2018-05-05

The continuous global increase in the number of cars has led to an increase in parking issues, particularly with respect to the search for available parking spaces and finding cars. In this paper, we propose a navigation system for car owners to find their cars in indoor parking garages. The proposed system comprises a car-searching mobile app and a positioning-assisting subsystem. The app guides car owners to their cars based on a “turn-by-turn” navigation strategy, and has the ability to correct the user’s heading orientation. The subsystem uses beacon technology for indoor positioning, supporting self-guidance of the car-searching mobile app. This study also designed a local coordinate system to support the identification of the locations of parking spaces and beacon devices. We used Android as the platform to implement the proposed car-searching mobile app, and used Bytereal HiBeacon devices to implement the proposed positioning-assisting subsystem. We also deployed the system in a parking lot in our campus for testing. The experimental results verified that the proposed system not only works well, but also provides the car owner with the correct route guidance information.

An improved harmony search algorithm for synchronization of discrete-time chaotic systems

International Nuclear Information System (INIS)

Santos Coelho, Leandro dos; Andrade Bernert, Diego Luis de

2009-01-01

The harmony search (HS) algorithm is a recently developed meta-heuristic algorithm, and has been very successful in a wide variety of optimization problems. HS was conceptualized using an analogy with music improvisation process where music players improvise the pitches of their instruments to obtain better harmony. The HS algorithm does not require initial values and uses a random search instead of a gradient search, so derivative information is unnecessary. Furthermore, the HS algorithm is simple in concept, few in parameters, easy in implementation, imposes fewer mathematical requirements, and does not require initial value settings of the decision variables. In recent years, the investigation of synchronization and control problem for discrete chaotic systems has attracted much attention, and many possible applications. The tuning of a proportional-integral-derivative (PID) controller based on an improved HS (IHS) algorithm for synchronization of two identical discrete chaotic systems subject the different initial conditions is investigated in this paper. Simulation results of the IHS to determine the PID parameters to synchronization of two Henon chaotic systems are compared with other HS approaches including classical HS and global-best HS. Numerical results reveal that the proposed IHS method is a powerful search and controller design optimization tool for synchronization of chaotic systems.

Sequence Coding and Search System Backfit Quality Assurance Program Plan

International Nuclear Information System (INIS)

Lovell, C.J.; Stepina, P.L.

1985-03-01

The Sequence Coding and Search System is a computer-based encoding system for events described in Licensee Event Reports. This data system contains LERs from 1981 to present. Backfit of the data system to include LERs prior to 1981 is required. This report documents the Quality Assurance Program Plan that EG and G Idaho, Inc. will follow while encoding 1980 LERs

75 FR 76982 - Integrated Risk Information System (IRIS); Announcement of Availability of Literature Searches...

Science.gov (United States)

2010-12-10

... Information System (IRIS); Announcement of Availability of Literature Searches for IRIS Assessments AGENCY: Environmental Protection Agency. ACTION: Announcement of availability of literature searches for IRIS... the availability of literature searches for four IRIS assessments, acetaldehyde (CAS No. 75-07-0...

76 FR 13402 - Integrated Risk Information System (IRIS); Announcement of Availability of Literature Searches...

Science.gov (United States)

2011-03-11

... Information System (IRIS); Announcement of Availability of Literature Searches for IRIS Assessments AGENCY: Environmental Protection Agency. ACTION: Announcement of availability of literature searches for IRIS... the availability of literature searches for cobalt (CASRN 7440-48-4) and inorganic cobalt compounds...

77 FR 20817 - Integrated Risk Information System (IRIS); Announcement of Availability of Literature Searches...

Science.gov (United States)

2012-04-06

... System (IRIS); Announcement of Availability of Literature Searches for IRIS Assessments AGENCY: Environmental Protection Agency. ACTION: Announcement of availability of literature searches for IRIS... the availability of literature searches for acetaldehyde (75-07-0) and 1,2,3-trimethlybenzene (526-73...

Algorithms for searching Fast radio bursts and pulsars in tight binary systems.

Science.gov (United States)

Zackay, Barak

2017-01-01

Fast radio bursts (FRB's) are an exciting, recently discovered, astrophysical transients which their origins are unknown.Currently, these bursts are believed to be coming from cosmological distances, allowing us to probe the electron content on cosmological length scales. Even though their precise localization is crucial for the determination of their origin, radio interferometers were not extensively employed in searching for them due to computational limitations.I will briefly present the Fast Dispersion Measure Transform (FDMT) algorithm,that allows to reduce the operation count in blind incoherent dedispersion by 2-3 orders of magnitude.In addition, FDMT enables to probe the unexplored domain of sub-microsecond astrophysical pulses.Pulsars in tight binary systems are among the most important astrophysical objects as they provide us our best tests of general relativity in the strong field regime.I will provide a preview to a novel algorithm that enables the detection of pulsars in short binary systems using observation times longer than an orbital period.Current pulsar search programs limit their searches for integration times shorter than a few percents of the orbital period.Until now, searching for pulsars in binary systems using observation times longer than an orbital period was considered impossible as one has to blindly enumerate all options for the Keplerian parameters, the pulsar rotation period, and the unknown DM.Using the current state of the art pulsar search techniques and all computers on the earth, such an enumeration would take longer than a Hubble time. I will demonstrate that using the new algorithm, it is possible to conduct such an enumeration on a laptop using real data of the double pulsar PSR J0737-3039.Among the other applications of this algorithm are:1) Searching for all pulsars on all sky positions in gamma ray observations of the Fermi LAT satellite.2) Blind searching for continuous gravitational wave sources emitted by pulsars with

PARAMETRIC IDENTIFICATION OF STOCHASTIC SYSTEM BY NON-GRADIENT RANDOM SEARCHING

Directory of Open Access Journals (Sweden)

A. A. Lobaty

2017-01-01

Full Text Available At this moment we know a great variety of identification objects, tasks and methods and its significance is constantly increasing in various fields of science and technology.  The identification problem is dependent on a priori information about identification object, besides that  the existing approaches and methods of identification are determined by the form of mathematical models (deterministic, stochastic, frequency, temporal, spectral etc.. The paper considers a problem for determination of system parameters  (identification object which is assigned by the stochastic mathematical model including random functions of time. It has been shown  that while making optimization of the stochastic systems subject to random actions deterministic methods can be applied only for a limited approximate optimization of the system by taking into account average random effects and fixed structure of the system. The paper proposes an algorithm for identification of  parameters in a mathematical model of  the stochastic system by non-gradient random searching. A specific  feature  of the algorithm is its applicability  practically to mathematic models of any type because the applied algorithm does not depend on linearization and differentiability of functions included in the mathematical model of the system. The proposed algorithm  ensures searching of  an extremum for the specified quality criteria in terms of external uncertainties and limitations while using random searching of parameters for a mathematical model of the system. The paper presents results of the investigations on operational capability of the considered identification method  while using mathematical simulation of hypothetical control system with a priori unknown parameter values of the mathematical model. The presented results of the mathematical simulation obviously demonstrate the operational capability of the proposed identification method.

Global search tool for the Advanced Photon Source Integrated Relational Model of Installed Systems (IRMIS) database

International Nuclear Information System (INIS)

Quock, D.E.R.; Cianciarulo, M.B.

2007-01-01

The Integrated Relational Model of Installed Systems (IRMIS) is a relational database tool that has been implemented at the Advanced Photon Source to maintain an updated account of approximately 600 control system software applications, 400,000 process variables, and 30,000 control system hardware components. To effectively display this large amount of control system information to operators and engineers, IRMIS was initially built with nine Web-based viewers: Applications Organizing Index, IOC, PLC, Component Type, Installed Components, Network, Controls Spares, Process Variables, and Cables. However, since each viewer is designed to provide details from only one major category of the control system, the necessity for a one-stop global search tool for the entire database became apparent. The user requirements for extremely fast database search time and ease of navigation through search results led to the choice of Asynchronous JavaScript and XML (AJAX) technology in the implementation of the IRMIS global search tool. Unique features of the global search tool include a two-tier level of displayed search results, and a database data integrity validation and reporting mechanism.

77 FR 41784 - Integrated Risk Information System (IRIS); Announcement of Availability of Literature Searches...

Science.gov (United States)

2012-07-16

... System (IRIS); Announcement of Availability of Literature Searches for IRIS Assessments AGENCY: Environmental Protection Agency. ACTION: Notice of availability of a literature search for benzo(a)pyrene... availability of a literature search for benzo(a)pyrene (CASRN 50- 32-8). EPA is also requesting scientific...

Evolved finite state controller for hybrid system in reduced search space

DEFF Research Database (Denmark)

Dupuis, Jean-Francois; Fan, Zhun

2009-01-01

This paper presents an evolutionary methodology to automatically generate finite state automata (FSA) controllers to control hybrid systems. The proposed approach reduces the search space using an invariant analysis of the system. FSA controllers for a case study of two-tank system have been...

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.

Certain integrable system on a space associated with a quantum search algorithm

International Nuclear Information System (INIS)

Uwano, Y.; Hino, H.; Ishiwatari, Y.

2007-01-01

On thinking up a Grover-type quantum search algorithm for an ordered tuple of multiqubit states, a gradient system associated with the negative von Neumann entropy is studied on the space of regular relative configurations of multiqubit states (SR 2 CMQ). The SR 2 CMQ emerges, through a geometric procedure, from the space of ordered tuples of multiqubit states for the quantum search. The aim of this paper is to give a brief report on the integrability of the gradient dynamical system together with quantum information geometry of the underlying space, SR 2 CMQ, of that system

A Search for Exoplanets in Short-Period Binary Star Systems

Directory of Open Access Journals (Sweden)

Ronald Kaitchuck

2012-03-01

Full Text Available This paper reports the progress of a search for exoplanets with S-type orbits in short-period binary star systems. The selected targets have stellar orbital periods of just a few days. These systems are eclipsing binaries so that exoplanet transits, if planets exist, will be highly likely. We report the results for seven binary star systems.

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.

Factorial validation and reliability analysis of the brain fag syndrome ...

African Journals Online (AJOL)

Results: Two valid factors emerged with items 1-3 and items 4, 5 & 7 loading on respectively, making the BFSS a twodimensional (multidimensional) scale which measures 2 aspects of brain fag [labeled burning sensation and crawling sensation respectively]. The reliability analysis yielded a Cronbach Alpha coefficient of ...

Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data

Directory of Open Access Journals (Sweden)

Wanrong Huang

2017-01-01

Full Text Available The Internet applications, such as network searching, electronic commerce, and modern medical applications, produce and process massive data. Considerable data parallelism exists in computation processes of data-intensive applications. A traversal algorithm, breadth-first search (BFS, is fundamental in many graph processing applications and metrics when a graph grows in scale. A variety of scientific programming methods have been proposed for accelerating and parallelizing BFS because of the poor temporal and spatial locality caused by inherent irregular memory access patterns. However, new parallel hardware could provide better improvement for scientific methods. To address small-world graph problems, we propose a scalable and novel field-programmable gate array-based heterogeneous multicore system for scientific programming. The core is multithread for streaming processing. And the communication network InfiniBand is adopted for scalability. We design a binary search algorithm to address mapping to unify all processor addresses. Within the limits permitted by the Graph500 test bench after 1D parallel hybrid BFS algorithm testing, our 8-core and 8-thread-per-core system achieved superior performance and efficiency compared with the prior work under the same degree of parallelism. Our system is efficient not as a special acceleration unit but as a processor platform that deals with graph searching applications.

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

The new ENSDF search system NESSY: IBM/PC nuclear spectroscopy database

International Nuclear Information System (INIS)

Boboshin, I.N.; Varlamov, V.V.

1996-01-01

The universal relational nuclear structure and decay database NESSY (New ENSDF Search SYstem) developed for the IBM/PC and compatible PCs, and based on the international file ENSDF (Evaluated Nuclear Structure Data File), is described. The NESSY provides the possibility of high efficiency processing (the search and retrieval of any kind of physical data) of the information from ENSDF. The principles of the database development are described and examples of applications are presented. (orig.)

Web-Based Search and Plot System for Nuclear Reaction Data

International Nuclear Information System (INIS)

Otuka, N.; Nakagawa, T.; Fukahori, T.; Katakura, J.; Aikawa, M.; Suda, T.; Naito, K.; Korennov, S.; Arai, K.; Noto, H.; Ohnishi, A.; Kato, K.

2005-01-01

A web-based search and plot system for nuclear reaction data has been developed, covering experimental data in EXFOR format and evaluated data in ENDF format. The system is implemented for Linux OS, with Perl and MySQL used for CGI scripts and the database manager, respectively. Two prototypes for experimental and evaluated data are presented

Tales from the Field: Search Strategies Applied in Web Searching

Directory of Open Access Journals (Sweden)

Soohyung Joo

2010-08-01

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

Cost reduction improvement for power generation system integrating WECS using harmony search algorithm

Energy Technology Data Exchange (ETDEWEB)

Ngonkham, S. [Khonkaen Univ., Amphur Muang (Thailand). Dept. of Electrical Engineering; Buasri, P. [Khonkaen Univ., Amphur Muang (Thailand). Embed System Research Group

2009-03-11

A harmony search (HS) algorithm was used to optimize economic dispatch (ED) in a wind energy conversion system (WECS) for power system integration. The HS algorithm was based on a stochastic random search method. System costs for the WECS system were estimated in relation to average wind speeds. The HS algorithm was implemented to optimize the ED with a simple programming procedure. The study showed that the initial parameters must be carefully selected to ensure the accuracy of the HS algorithm. The algorithm demonstrated that total costs of the WECS system were higher than costs associated with energy efficiency procedures that reduced the same amount of greenhouse gas (GHG) emissions. 7 refs,. 10 tabs., 16 figs.

Fast exhaustive search for polynomial systems in F2

NARCIS (Netherlands)

Bouillaguet, C.; Chen, H.-C.; Cheng, C.M.; Chou, T.; Niederhagen, R.F.; Shamir, A.; Yang, B.Y.

2010-01-01

Abstract. We analyze how fast we can solve general systems of multivariate equations of various low degrees over F2; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive-search technique, our

Fast exhaustive search for polynomial systems in F2

NARCIS (Netherlands)

Bouillaguet, C.; Chen, H.-C.; Cheng, C.M.; Chou, T.; Niederhagen, R.F.; Shamir, A.; Yang, B.Y.; Mangard, S.; Standaert, F.X.

2010-01-01

Abstract: We analyze how fast we can solve general systems of multivariate equations of various low degrees over $F_2$; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive search technique, our

Power law-based local search in spider monkey optimisation for lower order system modelling

Science.gov (United States)

Sharma, Ajay; Sharma, Harish; Bhargava, Annapurna; Sharma, Nirmala

2017-01-01

The nature-inspired algorithms (NIAs) have shown efficiency to solve many complex real-world optimisation problems. The efficiency of NIAs is measured by their ability to find adequate results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This paper presents a solution for lower order system modelling using spider monkey optimisation (SMO) algorithm to obtain a better approximation for lower order systems and reflects almost original higher order system's characteristics. Further, a local search strategy, namely, power law-based local search is incorporated with SMO. The proposed strategy is named as power law-based local search in SMO (PLSMO). The efficiency, accuracy and reliability of the proposed algorithm is tested over 20 well-known benchmark functions. Then, the PLSMO algorithm is applied to solve the lower order system modelling problem.

EARS: An Online Bibliographic Search and Retrieval System Based on Ordered Explosion.

Science.gov (United States)

Ramesh, R.; Drury, Colin G.

1987-01-01

Provides overview of Ergonomics Abstracts Retrieval System (EARS), an online bibliographic search and retrieval system in the area of human factors engineering. Other online systems are described, the design of EARS based on inverted file organization is explained, and system expansions including a thesaurus are discussed. (Author/LRW)

Visual search for motion-form conjunctions: is form discriminated within the motion system?

Science.gov (United States)

von Mühlenen, A; Müller, H J

2001-06-01

Motion-form conjunction search can be more efficient when the target is moving (a moving 45 degrees tilted line among moving vertical and stationary 45 degrees tilted lines) rather than stationary. This asymmetry may be due to aspects of form being discriminated within a motion system representing only moving items, whereas discrimination of stationary items relies on a static form system (J. Driver & P. McLeod, 1992). Alternatively, it may be due to search exploiting differential motion velocity and direction signals generated by the moving-target and distractor lines. To decide between these alternatives, 4 experiments systematically varied the motion-signal information conveyed by the moving target and distractors while keeping their form difference salient. Moving-target search was found to be facilitated only when differential motion-signal information was available. Thus, there is no need to assume that form is discriminated within the motion system.

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

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.

Search for new ternary Al, Ga or In containing phases using information forecasting system

International Nuclear Information System (INIS)

Kiseleva, N.N.; Burkhanov, G.S.

1989-01-01

Automated system of search for regularities in the formation of crystal phases and forecasting of new compounds with required properties, comprising data base on the properties of ternary inorganic compounds and cybernetic forecasting system, has been developed. General principles of operation of the developed information-forecasting system are considered. Efficiency of the system operation is shown, using as an example the search for new ternary compounds with aluminium, gallium and indium, crystallized in ZrNiAl, TiNiSi, ThCr 2 Si 2 , CaAl 2 Si 2 structural types. Results of the above-mentioned phases forecasting are shown

Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems

Science.gov (United States)

Wang, Shaowei; Ji, Xiaoyong

Optimum multiuser detection (OMD) in direct-sequence code-division multiple access (DS-CDMA) systems is an NP-complete problem. In this paper, we present a genetic local search algorithm, which consists of an evolution strategy framework and a local improvement procedure. The evolution strategy searches the space of feasible, locally optimal solutions only. A fast iterated local search algorithm, which employs the proprietary characteristics of the OMD problem, produces local optima with great efficiency. Computer simulations show the bit error rate (BER) performance of the GLS outperforms other multiuser detectors in all cases discussed. The computation time is polynomial complexity in the number of users.

Revisiting the Rise of Electronic Nicotine Delivery Systems Using Search Query Surveillance.

Science.gov (United States)

Ayers, John W; Althouse, Benjamin M; Allem, Jon-Patrick; Leas, Eric C; Dredze, Mark; Williams, Rebecca S

2016-06-01

Public perceptions of electronic nicotine delivery systems (ENDS) remain poorly understood because surveys are too costly to regularly implement and, when implemented, there are long delays between data collection and dissemination. Search query surveillance has bridged some of these gaps. Herein, ENDS' popularity in the U.S. is reassessed using Google searches. ENDS searches originating in the U.S. from January 2009 through January 2015 were disaggregated by terms focused on e-cigarette (e.g., e-cig) versus vaping (e.g., vapers); their geolocation (e.g., state); the aggregate tobacco control measures corresponding to their geolocation (e.g., clean indoor air laws); and by terms that indicated the searcher's potential interest (e.g., buy e-cigs likely indicates shopping)-all analyzed in 2015. ENDS searches are rapidly increasing in the U.S., with 8,498,000 searches during 2014 alone. Increasingly, searches are shifting from e-cigarette- to vaping-focused terms, especially in coastal states and states where anti-smoking norms are stronger. For example, nationally, e-cigarette searches declined 9% (95% CI=1%, 16%) during 2014 compared with 2013, whereas vaping searches increased 136% (95% CI=97%, 186%), even surpassing e-cigarette searches. Additionally, the percentage of ENDS searches related to shopping (e.g., vape shop) nearly doubled in 2014, whereas searches related to health concerns (e.g., vaping risks) or cessation (e.g., quit smoking with e-cigs) were rare and declined in 2014. ENDS popularity is rapidly growing and evolving. These findings could inform survey questionnaire development for follow-up investigation and immediately guide policy debates about how the public perceives the health risks or cessation benefits of ENDS. Copyright © 2016 American Journal of Preventive Medicine. Published by Elsevier Inc. All rights reserved.

Leveraging search and content exploration by exploiting context in folksonomy systems

Science.gov (United States)

Abel, Fabian; Baldoni, Matteo; Baroglio, Cristina; Henze, Nicola; Kawase, Ricardo; Krause, Daniel; Patti, Viviana

2010-04-01

With the advent of Web 2.0 tagging became a popular feature in social media systems. People tag diverse kinds of content, e.g. products at Amazon, music at Last.fm, images at Flickr, etc. In the last years several researchers analyzed the impact of tags on information retrieval. Most works focused on tags only and ignored context information. In this article we present context-aware approaches for learning semantics and improve personalized information retrieval in tagging systems. We investigate how explorative search, initialized by clicking on tags, can be enhanced with automatically produced context information so that search results better fit to the actual information needs of the users. We introduce the SocialHITS algorithm and present an experiment where we compare different algorithms for ranking users, tags, and resources in a contextualized way. We showcase our approaches in the domain of images and present the TagMe! system that enables users to explore and tag Flickr pictures. In TagMe! we further demonstrate how advanced context information can easily be generated: TagMe! allows users to attach tag assignments to a specific area within an image and to categorize tag assignments. In our corresponding evaluation we show that those additional facets of tag assignments gain valuable semantics, which can be applied to improve existing search and ranking algorithms significantly.

A review of the scientific rationale and methods used in the search for other planetary systems

Science.gov (United States)

Black, D. C.

1985-01-01

Planetary systems appear to be one of the crucial links in the chain leading from simple molecules to living systems, particularly complex (intelligent?) living systems. Although there is currently no observational proof of the existence of any planetary system other than our own, techniques are now being developed which will permit a comprehensive search for other planetary systems. The scientific rationale for and methods used in such a search effort are reviewed here.

Evaluation of the efficiency of computer-aided spectra search systems based on information theory

International Nuclear Information System (INIS)

Schaarschmidt, K.

1979-01-01

Application of information theory allows objective evaluation of the efficiency of computer-aided spectra search systems. For this purpose, a significant number of search processes must be analyzed. The amount of information gained by computer application is considered as the difference between the entropy of the data bank and a conditional entropy depending on the proportion of unsuccessful search processes and ballast. The influence of the following factors can be estimated: volume, structure, and quality of the spectra collection stored, efficiency of the encoding instruction and the comparing algorithm, and subjective errors involved in the encoding of spectra. The relations derived are applied to two published storage and retrieval systems for infared spectra. (Auth.)

Hybrid fuzzy charged system search algorithm based state estimation in distribution networks

Directory of Open Access Journals (Sweden)

Sachidananda Prasad

2017-06-01

Full Text Available This paper proposes a new hybrid charged system search (CSS algorithm based state estimation in radial distribution networks in fuzzy framework. The objective of the optimization problem is to minimize the weighted square of the difference between the measured and the estimated quantity. The proposed method of state estimation considers bus voltage magnitude and phase angle as state variable along with some equality and inequality constraints for state estimation in distribution networks. A rule based fuzzy inference system has been designed to control the parameters of the CSS algorithm to achieve better balance between the exploration and exploitation capability of the algorithm. The efficiency of the proposed fuzzy adaptive charged system search (FACSS algorithm has been tested on standard IEEE 33-bus system and Indian 85-bus practical radial distribution system. The obtained results have been compared with the conventional CSS algorithm, weighted least square (WLS algorithm and particle swarm optimization (PSO for feasibility of the algorithm.

The max–min ant system and tabu search for pressurized water reactor loading pattern design

International Nuclear Information System (INIS)

Lin, Chaung; Chen, Ying-Hsiu

2014-01-01

Highlights: • An automatic loading pattern design tool for a pressurized water reactor is developed. • The design method consists of max–min ant system and tabu search. • The heuristic rules are developed to generate the candidates for tabu search. • The initial solution of tabu search is provided by max–min ant system. • The new algorithm shows very satisfactory results compared to the old one. - Abstract: An automatic loading pattern (LP) design tool for a pressurized water reactor is developed. The design procedure consists of two steps: first, a LP is generated using max–min ant system (MMAS) and then tabu search (TS) is adopted to search the satisfactory LP. The MMAS is previously developed and the TS process is newly-developed. The heuristic rules are implemented to generate the candidate LP in TS process. The heuristic rules are comprised of two kinds of action, i.e., a single swap in the location of two fuel assemblies and rotation of fuel assembly. Since developed TS process is a local search algorithm, it is efficient for the minor change of LP. It means that a proper initial LP should be provided by the first step, i.e., by MMAS. The design requirements such as hot channel factor, the hot zero power moderator temperature coefficient, and cycle length are formulated in the objective function. The results show that the developed tool can obtain the satisfactory LP and dramatically reduce the computation time compared with previous tool using ant system alone

The ship-borne infrared searching and tracking system based on the inertial platform

Science.gov (United States)

Li, Yan; Zhang, Haibo

2011-08-01

As a result of the radar system got interferenced or in the state of half silent ,it can cause the guided precision drop badly In the modern electronic warfare, therefore it can lead to the equipment depended on electronic guidance cannot strike the incoming goals exactly. It will need to rely on optoelectronic devices to make up for its shortcomings, but when interference is in the process of radar leading ,especially the electro-optical equipment is influenced by the roll, pitch and yaw rotation ,it can affect the target appear outside of the field of optoelectronic devices for a long time, so the infrared optoelectronic equipment can not exert the superiority, and also it cannot get across weapon-control system "reverse bring" missile against incoming goals. So the conventional ship-borne infrared system unable to track the target of incoming quickly , the ability of optoelectronic rivalry declines heavily.Here we provide a brand new controlling algorithm for the semi-automatic searching and infrared tracking based on inertial navigation platform. Now it is applying well in our XX infrared optoelectronic searching and tracking system. The algorithm is mainly divided into two steps: The artificial mode turns into auto-searching when the deviation of guide exceeds the current scene under the course of leading for radar.When the threshold value of the image picked-up is satisfied by the contrast of the target in the searching scene, the speed computed by using the CA model Least Square Method feeds back to the speed loop. And then combine the infrared information to accomplish the closed-loop control of the infrared optoelectronic system tracking. The algorithm is verified via experiment. Target capturing distance is 22.3 kilometers on the great lead deviation by using the algorithm. But without using the algorithm the capturing distance declines 12 kilometers. The algorithm advances the ability of infrared optoelectronic rivalry and declines the target capturing

Application of pattern search method to power system security constrained economic dispatch with non-smooth cost function

International Nuclear Information System (INIS)

Al-Othman, A.K.; El-Naggar, K.M.

2008-01-01

Direct search methods are evolutionary algorithms used to solve optimization problems. (DS) methods do not require any information about the gradient of the objective function at hand while searching for an optimum solution. One of such methods is Pattern Search (PS) algorithm. This paper presents a new approach based on a constrained pattern search algorithm to solve a security constrained power system economic dispatch problem (SCED) with non-smooth cost function. Operation of power systems demands a high degree of security to keep the system satisfactorily operating when subjected to disturbances, while and at the same time it is required to pay attention to the economic aspects. Pattern recognition technique is used first to assess dynamic security. Linear classifiers that determine the stability of electric power system are presented and added to other system stability and operational constraints. The problem is formulated as a constrained optimization problem in a way that insures a secure-economic system operation. Pattern search method is then applied to solve the constrained optimization formulation. In particular, the method is tested using three different test systems. Simulation results of the proposed approach are compared with those reported in literature. The outcome is very encouraging and proves that pattern search (PS) is very applicable for solving security constrained power system economic dispatch problem (SCED). In addition, valve-point effect loading and total system losses are considered to further investigate the potential of the PS technique. Based on the results, it can be concluded that the PS has demonstrated ability in handling highly nonlinear discontinuous non-smooth cost function of the SCED. (author)

First Report of Using Portable Unmanned Aircraft Systems (Drones) for Search and Rescue.

Science.gov (United States)

Van Tilburg, Christopher

2017-06-01

Unmanned aircraft systems (UAS), colloquially called drones, are used commonly for military, government, and civilian purposes, including both commercial and consumer applications. During a search and rescue mission in Oregon, a UAS was used to confirm a fatality in a slot canyon; this eliminated the need for a dangerous rappel at night by rescue personnel. A second search mission in Oregon used several UAS to clear terrain. This allowed search of areas that were not accessible or were difficult to clear by ground personnel. UAS with cameras may be useful for searching, observing, and documenting missions. It is possible that UAS might be useful for delivering equipment in difficult areas and in communication. Copyright © 2017. Published by Elsevier Inc.

System network planning expansion using mathematical programming, genetic algorithms and tabu search

International Nuclear Information System (INIS)

Sadegheih, A.; Drake, P.R.

2008-01-01

In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used

Information retrieval from the INIS database. Is the new online search system poorer than the old one?

International Nuclear Information System (INIS)

Adamek, Petr

2011-01-01

A brief overview of the search options for the INIS database is presented, categorized into offline and online systems, and their assets and drawbacks are described. In the Online section, the old system on the BASIS platform and the new system on the Google Search Appliance platform are compared. The capabilities of the new system seem to be more limited than those of the old system. (author)

Algorithms for Academic Search and Recommendation Systems

DEFF Research Database (Denmark)

Amolochitis, Emmanouil

2014-01-01

are part of a developed Movie Recommendation system, the first such system to be commercially deployed in Greece by a major Triple Play services provider. In the third part of the work we present the design of a quantitative association rule mining algorithm. The introduced mining algorithm processes......In this work we present novel algorithms for academic search, recommendation and association rules mining. In the first part of the work we introduce a novel hierarchical heuristic scheme for re-ranking academic publications. The scheme is based on the hierarchical combination of a custom...... implementation of the term frequency heuristic, a time-depreciated citation score and a graph-theoretic computed score that relates the paper’s index terms with each other. On the second part we describe the design of hybrid recommender ensemble (user, item and content based). The newly introduced algorithms...

The Search for Habitable Environments in the Solar System

Science.gov (United States)

McCleese, Daniel

2005-07-01

All space faring nations devote a portion of their resources to exploring thesolar system. NASA has a forty-year history of robotic missions reaching into deep spacefor a better understanding of our origins, the evolution of our planet, and our destiny.For the past decade, NASA has placed considerable emphasis on the search for life beyondEarth. Missions to the rocky terrestrial planets and the moons of the gas giants seekanswers to the question: Are other worlds in the solar system habitable by simpleorganisms? By framing its search objective in this way, NASA motivates investigations ofthe fundamentals of what makes a planet an abode for life, and what ingredients arerequired for the origin and evolution of life. In this lecture, we focus on thestrategies and results of the search thus far. We will discuss recent scientific missionsto Mars, Europa, and Titan.Dr. Dan McCleese is the Chief Scientist for NASA's Mars ExplorationProgram at JPL. In this role he has worked with NASA and the international sciencecommunity to establish the current science strategy for exploring Mars. Dan's personalscience interests are focused on acquiring and interpreting climatological data sets forthe terrestrial planets. Specific research topics include development of the firstclimatology of cloud height for Earth, upper atmospheric cloud and thermal structure ofVenus, and, at present, the modern climate of Mars. He is the Principal Investigator forthe Mars Climate Sounder on the Mars Reconnaissance Orbiter to be launched in 2005. Inthis investigation, measurements of atmospheric water vapor, temperature and condensates,and the energy balance of the polar caps are emphasized. Dr. McCleese was a FulbrightScholar at Oxford University receiving a D.Phil. degree in Atmospheric Physics.

Improvement Of Search Process In Electronic Catalogues

Directory of Open Access Journals (Sweden)

Titas Savickas

2014-05-01

Full Text Available The paper presents investigation on search in electronic catalogues. The chosen problem domain is the search system in the electronic catalogue of Lithuanian Academic Libraries. The catalogue uses ALEPH system with MARC21 bibliographic format. The article presents analysis of problems pertaining to the current search engine and user expectations related to the search system of the electronic catalogue of academic libraries. Subsequent to analysis, the research paper presents the architecture for a semantic search system in the electronic catalogue that uses search process designed to improve search results for users.

A best-first tree-searching approach for ML decoding in MIMO system

KAUST Repository

Shen, Chung-An

2012-07-28

In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve close to ML performance while minimizing the number of visited nodes. A detailed outline of the algorithm is given, including the required storage. The effects of storage size on BER performance and complexity in terms of search space are also studied. Our result demonstrates that with a proper choice of storage size the proposed method visits 40% fewer nodes than a sphere decoding algorithm at signal to noise ratio (SNR) = 20dB and by an order of magnitude at 0 dB SNR.

BIOME: A browser-aware search and order system

Science.gov (United States)

Grubb, Jon W.; Jennings, Sarah V.; Yow, Teresa G.; Daughterty, Patricia F.

1996-01-01

The Oak Ridge National Laboratory (ORNL) Distributed Active Archive Center (DAAC), which is associated with NASA's Earth Observing System Data and Information System (EOSDIS), provides access to a large number of tabular and imagery datasets used in ecological and environmental research. Because of its large and diverse data holdings, the challenge for the ORNL DAAC is to help users find data of interest from the hundreds of thousands of files available at the DAAC without overwhelming them. Therefore, the ORNL DAAC developed the Biogeochemical Information Ordering Management Environment (BIOME), a search and order system for the World Wide Web (WWW). The WWW provides a new vehicle that allows a wide range of users access to the data. This paper describes the specialized attributes incorporated into BIOME that allow researchers easy access to an otherwise bewildering array of data products.

Mountain Search and Rescue with Remotely Piloted Aircraft Systems

Science.gov (United States)

Silvagni, Mario; Tonoli, Andrea; Zenerino, Enrico; Chiaberge, Marcello

2016-04-01

Remotely Piloted Aircraft Systems (RPAS) also known as Unmanned Aerial Systems (UAS) are nowadays becoming more and more popular in several applications. Even though a complete regulation is not yet available all over the world, researches, tests and some real case applications are wide spreading. These technologies can bring many benefits also to the mountain operations especially in emergencies and harsh environmental conditions, such as Search and Rescue (SAR) and avalanche rescue missions. In fact, during last decade, the number of people practicing winter sports in backcountry environment is increased and one of the greatest hazards for recreationists and professionals are avalanches. Often these accidents have severe consequences leading, mostly, to asphyxia-related death, which is confirmed by the hard drop of survival probability after ten minutes from the burying. Therefore, it is essential to minimize the time of burial. Modern avalanche beacon (ARTVA) interface guides the rescuer during the search phase reducing its time. Even if modern avalanche beacons are valid and reliable, the seeking range influences the rescue time. Furthermore, the environment and morphologic conditions of avalanches usually complicates the rescues. The recursive methodology of this kind of searching offers the opportunity to use automatic device like drones (RPAS). These systems allow performing all the required tasks autonomously, with high accuracy and without exposing the rescuers to additional risks due to secondary avalanches. The availability of highly integrated electronics and subsystems specifically meant for the applications, better batteries, miniaturized payload and, in general, affordable prices, has led to the availability of small RPAS with very good performances that can give interesting application opportunities in unconventional environments. The present work is one of the outcome from the experience made by the authors in RPAS fields and in Mechatronics

Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.

Science.gov (United States)

Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S

2013-01-01

The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.

Search for Signatures of Life in the Solar System

Science.gov (United States)

Race, M.; Schwehm, G.; Arnould, J.; Dawson, S.; Devore, E.; Evans, D.; Ferrazzani, M.; Shostak, S.

The search for evidence of extraterrestrial life is an important scientific theme that fascinates the public and encourages interest in space exploration, both within the solar system and beyond. The rapid pace of mass media communication allows the public to share mission results and new discoveries almost simultaneously with the scientific community. The public can read about proposed sample return missions to Mars, listen as scientists debate about in situ exploration of the oceans on Europa, learn about the growing number of extrasolar planets, or use their personal computers to participate in searches for extraterrestrial intelligence (SETI). As the science community continues its multi-pronged efforts to detect evidence of extraterrestrial life, it must be mindful of more than just science and technology. It is important to understand public perceptions, misperceptions, beliefs, concerns and potential complications associated with the search for life beyond our home planet. This panel is designed to provide brief overviews of some important non-scientific areas with the potential to impact future astrobiological exploration. The presentations will be followed by open discussion and audience participation. Invited panelists and their topical areas include: SCIENCE FICTION AND MISPERCEPTIONS: Seth Shostak, Dylan EvansBattling Pseudo-Science, Hollywood and Alien Abductions LEGAL ISSUES: Marcus FerrazzaniLooming Complications for Future Missions and Exploration RISK COMMUNICATION: Sandra DawsonEngaging the Public, Explaining the Risks, and Encouraging Long-Term Interestin Mission Science EDUCATION: Edna DeVoreUsing the Search for Life as a Motivating Theme in Teaching Basic Science andCritical Thinking. ETHICAL ISSUES AND CONCERNS: Jacques ArnouldWhat Will it Mean if We Find "ET"? PANEL MODERATORS: Margaret Race, Gerhard Schwehm

First all-sky search for continuous gravitational waves from unknown sources in binary systems

OpenAIRE

Aasi, J.; Abbott, B.; Abbott, R.; Abbott, T.; Abernathy, M.; Accadia, T.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R.; Affeldt, C.; Agathos, M.; Aggarwal, N.

2014-01-01

We present the first results of an all-sky search for continuous gravitational waves from unknown spinning neutron stars in binary systems using LIGO and Virgo data. Using a specially developed analysis program, the TwoSpect algorithm, the search was carried out on data from the sixth LIGO Science Run and the second and third Virgo Science Runs. The search covers a range of frequencies from 20 Hz to 520 Hz, a range of orbital periods from 2 to ~2,254 h and a frequency- and period-dependent ra...

The accuracy of Internet search engines to predict diagnoses from symptoms can be assessed with a validated scoring system.

Science.gov (United States)

Shenker, Bennett S

2014-02-01

To validate a scoring system that evaluates the ability of Internet search engines to correctly predict diagnoses when symptoms are used as search terms. We developed a five point scoring system to evaluate the diagnostic accuracy of Internet search engines. We identified twenty diagnoses common to a primary care setting to validate the scoring system. One investigator entered the symptoms for each diagnosis into three Internet search engines (Google, Bing, and Ask) and saved the first five webpages from each search. Other investigators reviewed the webpages and assigned a diagnostic accuracy score. They rescored a random sample of webpages two weeks later. To validate the five point scoring system, we calculated convergent validity and test-retest reliability using Kendall's W and Spearman's rho, respectively. We used the Kruskal-Wallis test to look for differences in accuracy scores for the three Internet search engines. A total of 600 webpages were reviewed. Kendall's W for the raters was 0.71 (psearch engines is a valid and reliable instrument. The scoring system may be used in future Internet research. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

An Efficient Method to Search Real-Time Bulk Data for an Information Processing System

International Nuclear Information System (INIS)

Kim, Seong Jin; Kim, Jong Myung; Suh, Yong Suk; Keum, Jong Yong; Park, Heui Youn

2005-01-01

The Man Machine Interface System (MMIS) of System-integrated Modular Advanced ReacTor (SMART) is designed with fully digitalized features. The Information Processing System (IPS) of the MMIS acquires and processes plant data from other systems. In addition, the IPS provides plant operation information to operators in the control room. The IPS is required to process bulky data in a real-time. So, it is necessary to consider a special processing method with regards to flexibility and performance because more than a few thousands of Plant Information converges on the IPS. Among other things, the processing time for searching for data from the bulk data consumes much more than other the processing times. Thus, this paper explores an efficient method for the search and examines its feasibility

Rapid hyperspectral image classification to enable autonomous search systems

Directory of Open Access Journals (Sweden)

Raj Bridgelal

2016-11-01

Full Text Available The emergence of lightweight full-frame hyperspectral cameras is destined to enable autonomous search vehicles in the air, on the ground and in water. Self-contained and long-endurance systems will yield important new applications, for example, in emergency response and the timely identification of environmental hazards. One missing capability is rapid classification of hyperspectral scenes so that search vehicles can immediately take actions to verify potential targets. Onsite verifications minimise false positives and preclude the expense of repeat missions. Verifications will require enhanced image quality, which is achievable by either moving closer to the potential target or by adjusting the optical system. Such a solution, however, is currently impractical for small mobile platforms with finite energy sources. Rapid classifications with current methods demand large computing capacity that will quickly deplete the on-board battery or fuel. To develop the missing capability, the authors propose a low-complexity hyperspectral image classifier that approaches the performance of prevalent classifiers. This research determines that the new method will require at least 19-fold less computing capacity than the prevalent classifier. To assess relative performances, the authors developed a benchmark that compares a statistic of library endmember separability in their respective feature spaces.

In Search of a Smile: SMIL Indexing System for Multimedia Learning

Directory of Open Access Journals (Sweden)

Ivana Bosnić

2007-09-01

Full Text Available In today's world of education, new methods and services are appearing every day. This paper proposes the usage of educational material "mashup", created in SMIL (Synchronized Multimedia Integration Language format. A multi-user Web application for indexing and sharing SMIL presentations is described. Presentations, located on remote servers, are fetched using different protocols, analyzed and indexed using a full-text search method. Each result gives not only "the place" but also "the time" of spoken word or phrase in the course. Afterwards, the lectures can be grouped based on their content, shared and combined together into personalized Search boxes for specific courses. The placement of Search boxes on any course Web page or LMS is done by client-side technologies, which eliminates tweaking of learning systems and usage of server-side programming. An example of usage at the University of Zagreb, Faculty of Electrical Engineering and Computing is described, together with the research results obtained.

The search for organizing principles as a cure against reductionism in systems medicine

DEFF Research Database (Denmark)

Wolkenhauer, Olaf; Green, Sara

2013-01-01

, that originally motivated these projects, appears to have been forgotten in many highly specialized research programmes. We here investigate the prospects for use of an old regulative ideal from systems theory to describe the organization of cellular systems ‘in general’ by identifying key concepts, challenges......Biological complexity has forced scientists to develop highly reductive approaches, with an ever-increasing degree of specialization. As a consequence, research projects have become fragmented, and their results strongly dependent on the experimental context. The general research question...... and strategies to pursue the search for organizing principles. We argue that there is no tension between the complexity of biological systems and the search for organizing principles. On the contrary, it is the complexity of organisms and the current level of techniques and knowledge that urge us to renew...

Comparing image search behaviour in the ARRS GoldMiner search engine and a clinical PACS/RIS.

Science.gov (United States)

De-Arteaga, Maria; Eggel, Ivan; Do, Bao; Rubin, Daniel; Kahn, Charles E; Müller, Henning

2015-08-01

Information search has changed the way we manage knowledge and the ubiquity of information access has made search a frequent activity, whether via Internet search engines or increasingly via mobile devices. Medical information search is in this respect no different and much research has been devoted to analyzing the way in which physicians aim to access information. Medical image search is a much smaller domain but has gained much attention as it has different characteristics than search for text documents. While web search log files have been analysed many times to better understand user behaviour, the log files of hospital internal systems for search in a PACS/RIS (Picture Archival and Communication System, Radiology Information System) have rarely been analysed. Such a comparison between a hospital PACS/RIS search and a web system for searching images of the biomedical literature is the goal of this paper. Objectives are to identify similarities and differences in search behaviour of the two systems, which could then be used to optimize existing systems and build new search engines. Log files of the ARRS GoldMiner medical image search engine (freely accessible on the Internet) containing 222,005 queries, and log files of Stanford's internal PACS/RIS search called radTF containing 18,068 queries were analysed. Each query was preprocessed and all query terms were mapped to the RadLex (Radiology Lexicon) terminology, a comprehensive lexicon of radiology terms created and maintained by the Radiological Society of North America, so the semantic content in the queries and the links between terms could be analysed, and synonyms for the same concept could be detected. RadLex was mainly created for the use in radiology reports, to aid structured reporting and the preparation of educational material (Lanlotz, 2006) [1]. In standard medical vocabularies such as MeSH (Medical Subject Headings) and UMLS (Unified Medical Language System) specific terms of radiology are often

OmniSearch: a semantic search system based on the Ontology for MIcroRNA Target (OMIT) for microRNA-target gene interaction data.

Science.gov (United States)

Huang, Jingshan; Gutierrez, Fernando; Strachan, Harrison J; Dou, Dejing; Huang, Weili; Smith, Barry; Blake, Judith A; Eilbeck, Karen; Natale, Darren A; Lin, Yu; Wu, Bin; Silva, Nisansa de; Wang, Xiaowei; Liu, Zixing; Borchert, Glen M; Tan, Ming; Ruttenberg, Alan

2016-01-01

As a special class of non-coding RNAs (ncRNAs), microRNAs (miRNAs) perform important roles in numerous biological and pathological processes. The realization of miRNA functions depends largely on how miRNAs regulate specific target genes. It is therefore critical to identify, analyze, and cross-reference miRNA-target interactions to better explore and delineate miRNA functions. Semantic technologies can help in this regard. We previously developed a miRNA domain-specific application ontology, Ontology for MIcroRNA Target (OMIT), whose goal was to serve as a foundation for semantic annotation, data integration, and semantic search in the miRNA field. In this paper we describe our continuing effort to develop the OMIT, and demonstrate its use within a semantic search system, OmniSearch, designed to facilitate knowledge capture of miRNA-target interaction data. Important changes in the current version OMIT are summarized as: (1) following a modularized ontology design (with 2559 terms imported from the NCRO ontology); (2) encoding all 1884 human miRNAs (vs. 300 in previous versions); and (3) setting up a GitHub project site along with an issue tracker for more effective community collaboration on the ontology development. The OMIT ontology is free and open to all users, accessible at: http://purl.obolibrary.org/obo/omit.owl. The OmniSearch system is also free and open to all users, accessible at: http://omnisearch.soc.southalabama.edu/index.php/Software.

Ant colony system (ACS with hybrid local search to solve vehicle routing problems

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2016-02-01

Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

The ontology supported intelligent system for experiment search in the scientific Research center

Directory of Open Access Journals (Sweden)

Cvjetković Vladimir

2014-01-01

Full Text Available Ontologies and corresponding knowledge bases can be quite successfully used for many tasks that rely on domain knowledge and semantic structures, which should be available for machine processing and sharing. Using SPARQL queries for retrieval of required elements from ontologies and knowledge bases, can significantly simplify modeling of arbitrary structures of concepts and data, and implementation of required functionalities. This paper describes developed ontology for support of Research Centre for testing of active substances that conducts scientific experiments. According to created ontology corresponding knowledge base was made and populated with real experimental data. Developed ontology and knowledge base are directly used for an intelligent system of experiment search which is based on many criteria from ontology. Proposed system gets the desired search result, which is actually an experiment in the form of a written report. Presented solution and implementation are very flexible and adaptable, and can be used as kind of a template by similar information system dealing with biological or similar complex system.

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.

Knowledge-based personalized search engine for the Web-based Human Musculoskeletal System Resources (HMSR) in biomechanics.

Science.gov (United States)

Dao, Tien Tuan; Hoang, Tuan Nha; Ta, Xuan Hien; Tho, Marie Christine Ho Ba

2013-02-01

Human musculoskeletal system resources of the human body are valuable for the learning and medical purposes. Internet-based information from conventional search engines such as Google or Yahoo cannot response to the need of useful, accurate, reliable and good-quality human musculoskeletal resources related to medical processes, pathological knowledge and practical expertise. In this present work, an advanced knowledge-based personalized search engine was developed. Our search engine was based on a client-server multi-layer multi-agent architecture and the principle of semantic web services to acquire dynamically accurate and reliable HMSR information by a semantic processing and visualization approach. A security-enhanced mechanism was applied to protect the medical information. A multi-agent crawler was implemented to develop a content-based database of HMSR information. A new semantic-based PageRank score with related mathematical formulas were also defined and implemented. As the results, semantic web service descriptions were presented in OWL, WSDL and OWL-S formats. Operational scenarios with related web-based interfaces for personal computers and mobile devices were presented and analyzed. Functional comparison between our knowledge-based search engine, a conventional search engine and a semantic search engine showed the originality and the robustness of our knowledge-based personalized search engine. In fact, our knowledge-based personalized search engine allows different users such as orthopedic patient and experts or healthcare system managers or medical students to access remotely into useful, accurate, reliable and good-quality HMSR information for their learning and medical purposes. Copyright © 2012 Elsevier Inc. All rights reserved.

A solution to energy and environmental problems of electric power system using hybrid harmony search-random search optimization algorithm

Directory of Open Access Journals (Sweden)

Vikram Kumar Kamboj

2016-04-01

Full Text Available In recent years, global warming and carbon dioxide (CO2 emission reduction have become important issues in India, as CO2 emission levels are continuing to rise in accordance with the increased volume of Indian national energy consumption under the pressure of global warming, it is crucial for Indian government to impose the effective policy to promote CO2 emission reduction. Challenge of supplying the nation with high quality and reliable electrical energy at a reasonable cost, converted government policy into deregulation and restructuring environment. This research paper presents aims to presents an effective solution for energy and environmental problems of electric power using an efficient and powerful hybrid optimization algorithm: Hybrid Harmony search-random search algorithm. The proposed algorithm is tested for standard IEEE-14 bus, -30 bus and -56 bus system. The effectiveness of proposed hybrid algorithm is compared with others well known evolutionary, heuristics and meta-heuristics search algorithms. For multi-objective unit commitment, it is found that as there are conflicting relationship between cost and emission, if the performance in cost criterion is improved, performance in the emission is seen to deteriorate.

41. DISCOVERY, SEARCH, AND COMMUNICATION OF TEXTUAL KNOWLEDGE RESOURCES IN DISTRIBUTED SYSTEMS a. Discovering and Utilizing Knowledge Sources for Metasearch Knowledge Systems

Energy Technology Data Exchange (ETDEWEB)

Zamora, Antonio

2008-03-18

Advanced Natural Language Processing Tools for Web Information Retrieval, Content Analysis, and Synthesis. The goal of this SBIR was to implement and evaluate several advanced Natural Language Processing (NLP) tools and techniques to enhance the precision and relevance of search results by analyzing and augmenting search queries and by helping to organize the search output obtained from heterogeneous databases and web pages containing textual information of interest to DOE and the scientific-technical user communities in general. The SBIR investigated 1) the incorporation of spelling checkers in search applications, 2) identification of significant phrases and concepts using a combination of linguistic and statistical techniques, and 3) enhancement of the query interface and search retrieval results through the use of semantic resources, such as thesauri. A search program with a flexible query interface was developed to search reference databases with the objective of enhancing search results from web queries or queries of specialized search systems such as DOE's Information Bridge. The DOE ETDE/INIS Joint Thesaurus was processed to create a searchable database. Term frequencies and term co-occurrences were used to enhance the web information retrieval by providing algorithmically-derived objective criteria to organize relevant documents into clusters containing significant terms. A thesaurus provides an authoritative overview and classification of a field of knowledge. By organizing the results of a search using the thesaurus terminology, the output is more meaningful than when the results are just organized based on the terms that co-occur in the retrieved documents, some of which may not be significant. An attempt was made to take advantage of the hierarchy provided by broader and narrower terms, as well as other field-specific information in the thesauri. The search program uses linguistic morphological routines to find relevant entries regardless of

Surface-Assisted Dynamic Search Processes.

Science.gov (United States)

Shin, Jaeoh; Kolomeisky, Anatoly B

2018-03-01

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

A search engine for the engineering and equipment data management system (EDMS) at CERN

International Nuclear Information System (INIS)

Tsyganov, A; Amerigo, S M; Petit, S; Pettersson, T; Suwalska, A

2008-01-01

CERN, the European Laboratory for Particle Physics, located in Geneva -Switzerland, is currently building the LHC (Large Hadron Collider), a 27 km particle accelerator. The equipment life-cycle management of this project is provided by the Engineering and Equipment Data Management System (EDMS) Service. Using an Oracle database, it supports the management and follow-up of different kinds of documentation through the whole life cycle of the LHC project: design, manufacturing, installation, commissioning data etc... The equipment data collection phase is now slowing down and the project is getting closer to the 'As-Built' phase: the phase of the project consuming and exploring the large volumes of data stored since 1996. Searching through millions of items of information (documents, equipment parts, operations...) multiplied by dozens of points of view (operators, maintainers...) requires an efficient and flexible search engine. This paper describes the process followed by the team to implement the search engine for the LHC As-built project in the EDMS Service. The emphasis is put on the design decision to decouple the search engine from any user interface, potentially enabling other systems to also use it. Projections, algorithms, and the planned implementation are described in this paper. The implementation of the first version started in early 2007

SEARCH: Study of Environmental Arctic Change—A System-scale, Cross-disciplinary Arctic Research Program

Science.gov (United States)

Wiggins, H. V.; Eicken, H.; Fox, S. E.

2012-12-01

SEARCH is an interdisciplinary and interagency program that works with academic and government agency scientists to plan, conduct, and synthesize studies of arctic change. The vision of SEARCH is to provide scientific understanding of arctic environmental change to help society understand and respond to a rapidly changing Arctic. Towards this end, SEARCH: 1. Generates and synthesizes research findings and promotes arctic science and scientific discovery across disciplines and among agencies. 2. Identifies emerging issues in arctic environmental change. 3. Provides information resources to arctic stakeholders, policy-makers, and the public to help them respond to arctic environmental change. 4. Coordinates with national arctic science programs integral to SEARCH goals. 5. Facilitates research activities across local-to-global scales with stakeholder concerns incorporated from the start of the planning process. 6. Represents the U.S. arctic environmental change science community in international and global change research initiatives. Specific current activities include: Arctic Observing Network (AON) - coordinating a system of atmospheric, land- and ocean-based environmental monitoring capabilities that will significantly advance our observations of arctic environmental conditions. Arctic Sea Ice Outlook ¬- an international effort that provides monthly summer reports synthesizing community estimates of the expected sea ice minimum. Sea Ice for Walrus Outlook - a resource for Alaska Native subsistence hunters, coastal communities, and others that provides weekly reports with information on sea ice conditions relevant to walrus in Alaska waters. In April, the SEARCH Science Steering Committee (SSC) released a set of draft 5-year goals and objectives for review by the broader arctic science community. The goals and objectives will direct the SEARCH program in the next five years. The draft SEARCH goals focus on four areas: ice-diminished Arctic Ocean, warming

Extended-Search, Bézier Curve-Based Lane Detection and Reconstruction System for an Intelligent Vehicle

Directory of Open Access Journals (Sweden)

Xiaoyun Huang

2015-09-01

Full Text Available To improve the real-time performance and detection rate of a Lane Detection and Reconstruction (LDR system, an extended-search-based lane detection method and a Bézier curve-based lane reconstruction algorithm are proposed in this paper. The extended-search-based lane detection method is designed to search boundary blocks from the initial position, in an upwards direction and along the lane, with small search areas including continuous search, discontinuous search and bending search in order to detect different lane boundaries. The Bézier curve-based lane reconstruction algorithm is employed to describe a wide range of lane boundary forms with comparatively simple expressions. In addition, two Bézier curves are adopted to reconstruct the lanes' outer boundaries with large curvature variation. The lane detection and reconstruction algorithm — including initial-blocks' determining, extended search, binarization processing and lane boundaries' fitting in different scenarios — is verified in road tests. The results show that this algorithm is robust against different shadows and illumination variations; the average processing time per frame is 13 ms. Significantly, it presents an 88.6% high-detection rate on curved lanes with large or variable curvatures, where the accident rate is higher than that of straight lanes.

IntegromeDB: an integrated system and biological search engine.

Science.gov (United States)

Baitaluk, Michael; Kozhenkov, Sergey; Dubinina, Yulia; Ponomarenko, Julia

2012-01-19

With the growth of biological data in volume and heterogeneity, web search engines become key tools for researchers. However, general-purpose search engines are not specialized for the search of biological data. Here, we present an approach at developing a biological web search engine based on the Semantic Web technologies and demonstrate its implementation for retrieving gene- and protein-centered knowledge. The engine is available at http://www.integromedb.org. The IntegromeDB search engine allows scanning data on gene regulation, gene expression, protein-protein interactions, pathways, metagenomics, mutations, diseases, and other gene- and protein-related data that are automatically retrieved from publicly available databases and web pages using biological ontologies. To perfect the resource design and usability, we welcome and encourage community feedback.

Recent developments in imaging system assessment methodology, FROC analysis and the search model.

Science.gov (United States)

Chakraborty, Dev P

2011-08-21

A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search-model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

Recent developments in imaging system assessment methodology, FROC analysis and the search model

International Nuclear Information System (INIS)

Chakraborty, Dev P.

2011-01-01

A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

A learning heuristic for space mapping and searching self-organizing systems using adaptive mesh refinement

Science.gov (United States)

Phillips, Carolyn L.

2014-09-01

In a complex self-organizing system, small changes in the interactions between the system's components can result in different emergent macrostructures or macrobehavior. In chemical engineering and material science, such spontaneously self-assembling systems, using polymers, nanoscale or colloidal-scale particles, DNA, or other precursors, are an attractive way to create materials that are precisely engineered at a fine scale. Changes to the interactions can often be described by a set of parameters. Different contiguous regions in this parameter space correspond to different ordered states. Since these ordered states are emergent, often experiment, not analysis, is necessary to create a diagram of ordered states over the parameter space. By issuing queries to points in the parameter space (e.g., performing a computational or physical experiment), ordered states can be discovered and mapped. Queries can be costly in terms of resources or time, however. In general, one would like to learn the most information using the fewest queries. Here we introduce a learning heuristic for issuing queries to map and search a two-dimensional parameter space. Using a method inspired by adaptive mesh refinement, the heuristic iteratively issues batches of queries to be executed in parallel based on past information. By adjusting the search criteria, different types of searches (for example, a uniform search, exploring boundaries, sampling all regions equally) can be flexibly implemented. We show that this method will densely search the space, while preferentially targeting certain features. Using numerical examples, including a study simulating the self-assembly of complex crystals, we show how this heuristic can discover new regions and map boundaries more accurately than a uniformly distributed set of queries.

Identification of Fuzzy Inference Systems by Means of a Multiobjective Opposition-Based Space Search Algorithm

Directory of Open Access Journals (Sweden)

Wei Huang

2013-01-01

Full Text Available We introduce a new category of fuzzy inference systems with the aid of a multiobjective opposition-based space search algorithm (MOSSA. The proposed MOSSA is essentially a multiobjective space search algorithm improved by using an opposition-based learning that employs a so-called opposite numbers mechanism to speed up the convergence of the optimization algorithm. In the identification of fuzzy inference system, the MOSSA is exploited to carry out the parametric identification of the fuzzy model as well as to realize its structural identification. Experimental results demonstrate the effectiveness of the proposed fuzzy models.

A computer vision system for rapid search inspired by surface-based attention mechanisms from human perception.

Science.gov (United States)

Mohr, Johannes; Park, Jong-Han; Obermayer, Klaus

2014-12-01

Humans are highly efficient at visual search tasks by focusing selective attention on a small but relevant region of a visual scene. Recent results from biological vision suggest that surfaces of distinct physical objects form the basic units of this attentional process. The aim of this paper is to demonstrate how such surface-based attention mechanisms can speed up a computer vision system for visual search. The system uses fast perceptual grouping of depth cues to represent the visual world at the level of surfaces. This representation is stored in short-term memory and updated over time. A top-down guided attention mechanism sequentially selects one of the surfaces for detailed inspection by a recognition module. We show that the proposed attention framework requires little computational overhead (about 11 ms), but enables the system to operate in real-time and leads to a substantial increase in search efficiency. Copyright © 2014 Elsevier Ltd. All rights reserved.

Combinatorial search from algorithms to systems

CERN Document Server

Hamadi, Youssef

2013-01-01

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

Systematizing Web Search through a Meta-Cognitive, Systems-Based, Information Structuring Model (McSIS)

Science.gov (United States)

Abuhamdieh, Ayman H.; Harder, Joseph T.

2015-01-01

This paper proposes a meta-cognitive, systems-based, information structuring model (McSIS) to systematize online information search behavior based on literature review of information-seeking models. The General Systems Theory's (GST) prepositions serve as its framework. Factors influencing information-seekers, such as the individual learning…

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

Directory of Open Access Journals (Sweden)

Einallah Salehi

2013-01-01

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

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.

A Study of Search Intermediary Working Notes: Implications for IR System Design.

Science.gov (United States)

Spink, Amanda; Goodrum, Abby

1996-01-01

Reports findings from an exploratory study investigating working notes created during encoding and external storage (EES) processes by human search intermediaries (librarians at the University of North Texas) using a Boolean information retrieval (IR) system. Implications for the design of IR interfaces and further research is discussed.…

An Educational System for Learning Search Algorithms and Automatically Assessing Student Performance

Science.gov (United States)

Grivokostopoulou, Foteini; Perikos, Isidoros; Hatzilygeroudis, Ioannis

2017-01-01

In this paper, first we present an educational system that assists students in learning and tutors in teaching search algorithms, an artificial intelligence topic. Learning is achieved through a wide range of learning activities. Algorithm visualizations demonstrate the operational functionality of algorithms according to the principles of active…

The BIOSIS data base: Evaluation of its indexes and the STRATBLDR, CHEMFILE, STAIRS and DIALOG systems for on-line searching

Science.gov (United States)

Nees, M.; Green, H. O.

1977-01-01

An IBM-developed program, STAIRS, was selected for performing a search on the BIOSIS file. The evaluation of the hardware and search systems and the strategies used are discussed. The searches are analyzed by type of end user.

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

Directory of Open Access Journals (Sweden)

pijitra jomsri

2015-11-01

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

A Novel Personalized Web Search Model

Institute of Scientific and Technical Information of China (English)

ZHU Zhengyu; XU Jingqiu; TIAN Yunyan; REN Xiang

2007-01-01

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

Knowledge in Artificial Intelligence Systems: Searching the Strategies for Application

OpenAIRE

Kornienko, Alla A.; Kornienko, Anatoly V.; Fofanov, Oleg B.; Chubik, Maxim P.

2015-01-01

The studies based on auto-epistemic logic are pointed out as an advanced direction for development of artificial intelligence (AI). Artificial intelligence is taken as a system that imitates the solution of complicated problems by human during the course of life. The structure of symbols and operations, by which intellectual solution is performed, as well as searching the strategic reference points for those solutions, which are caused by certain structures of symbols and operations, – are co...

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

Science.gov (United States)

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

2015-11-01

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

Parallel Breadth-First Search on Distributed Memory Systems

Energy Technology Data Exchange (ETDEWEB)

Computational Research Division; Buluc, Aydin; Madduri, Kamesh

2011-04-15

Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

Sequence Coding and Search System for licensee event reports: code listings. Volume 2

International Nuclear Information System (INIS)

Gallaher, R.B.; Guymon, R.H.; Mays, G.T.; Poore, W.P.; Cagle, R.J.; Harrington, K.H.; Johnson, M.P.

1985-04-01

Operating experience data from nuclear power plants are essential for safety and reliability analyses, especially analyses of trends and patterns. The licensee event reports (LERs) that are submitted to the Nuclear Regulatory Commission (NRC) by the nuclear power plant utilities contain much of this data. The NRC's Office for Analysis and Evaluation of Operational Data (AEOD) has developed, under contract with NSIC, a system for codifying the events reported in the LERs. The primary objective of the Sequence Coding and Search System (SCSS) is to reduce the descriptive text of the LERs to coded sequences that are both computer-readable and computer-searchable. This system provides a structured format for detailed coding of component, system, and unit effects as well as personnel errors. The database contains all current LERs submitted by nuclear power plant utilities for events occurring since 1981 and is updated on a continual basis. Volume 2 contains all valid and acceptable codes used for searching and encoding the LER data. This volume contains updated material through amendment 1 to revision 1 of the working version of ORNL/NSIC-223, Vol. 2

Content Based Retrieval Database Management System with Support for Similarity Searching and Query Refinement

National Research Council Canada - National Science Library

Ortega-Binderberger, Michael

2002-01-01

... as a critical area of research. This thesis explores how to enhance database systems with content based search over arbitrary abstract data types in a similarity based framework with query refinement...

Tracking the rise in popularity of electronic nicotine delivery systems (electronic cigarettes) using search query surveillance.

Science.gov (United States)

Ayers, John W; Ribisl, Kurt M; Brownstein, John S

2011-04-01

Public interest in electronic nicotine delivery systems (ENDS) is undocumented. By monitoring search queries, ENDS popularity and correlates of their popularity were assessed in Australia, Canada, the United Kingdom (UK), and the U.S. English-language Google searches conducted from January 2008 through September 2010 were compared to snus, nicotine replacement therapy (NRT), and Chantix® or Champix®. Searches for each week were scaled to the highest weekly search proportion (100), with lower values indicating the relative search proportion compared to the highest-proportion week (e.g., 50=50% of the highest observed proportion). Analyses were performed in 2010. From July 2008 through February 2010, ENDS searches increased in all nations studied except Australia, there an increase occurred more recently. By September 2010, ENDS searches were several-hundred-fold greater than searches for smoking alternatives in the UK and U.S., and were rivaling alternatives in Australia and Canada. Across nations, ENDS searches were highest in the U.S., followed by similar search intensity in Canada and the UK, with Australia having the fewest ENDS searches. Stronger tobacco control, created by clean indoor air laws, cigarette taxes, and anti-smoking populations, were associated with consistently higher levels of ENDS searches. The online popularity of ENDS has surpassed that of snus and NRTs, which have been on the market for far longer, and is quickly outpacing Chantix or Champix. In part, the association between ENDS's popularity and stronger tobacco control suggests ENDS are used to bypass, or quit in response to, smoking restrictions. Search query surveillance is a valuable, real-time, free, and public method to evaluate the diffusion of new health products. This method may be generalized to other behavioral, biological, informational, or psychological outcomes manifested on search engines. Copyright © 2011 American Journal of Preventive Medicine. Published by Elsevier Inc

Undergraduate Students' Information Search Practices

Science.gov (United States)

Nikolopoulou, Kleopatra; Gialamas, Vasilis

2011-01-01

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

A modified harmony search method for environmental/economic load dispatch of real-world power systems

International Nuclear Information System (INIS)

Jeddi, Babak; Vahidinasab, Vahid

2014-01-01

Highlights: • A combined economic and emission load dispatch (CEELD) model is proposed. • The proposed model considers practical constraints of real-world power systems. • A new modified harmony search algorithm proposed to solve non-convex CEELD. • The proposed algorithm is tested by applying it to solve seven test systems. - Abstract: Economic load dispatch (ELD) problem is one of the basic and important optimization problems in a power system. However, considering practical constraints of real-world power systems such as ramp rate limits, prohibited operating zones, valve loading effects, multi-fuel options, spinning reserve and transmission system losses in ELD problem makes it a non-convex optimization problem, which is a challenging one and cannot be solved by traditional methods. Moreover, considering environmental issues, results in combined economic and emission load dispatch (CEELD) problem that is a multiobjective optimization model with two non-commensurable and contradictory objectives. In this paper, a modified harmony search algorithm (MHSA) proposed and applied to solve ELD and CEELD problem considering the abovementioned constraints. In the proposed MHSA, a new improvising method based on wavelet mutation together with a new memory consideration scheme based on the roulette wheel mechanism are proposed which improves the accuracy, convergence speed, and robustness of the classical HSA. Performance of the proposed algorithm is investigated by applying it to solve various test systems having non-convex solution spaces. To Show the effectiveness of the proposed method, obtained results compared with classical harmony search algorithm (HSA) and some of the most recently published papers in the area

Development of a monitoring system for the DQMGUI in ElasticSearch and Kibana

CERN Document Server

Diaz, Adrian

2016-01-01

The Data Quality Monitoring Graphical User Interface (DQMGUI) is the heart of the process of monitoring the quality of data in CMS. The health-status of the DQMGUI and its performances are constantly being monitored and stored in log les, which are subsequently parsed for errors and warnings. This very process allows human operators to act in case of problems. However, the monitoring infrastructure has been migrated to a CERN-hosted ElasticSearch engine in the last year. As a consequence, it is necessary to refactor the old monitoring system, adapting and extending it to be compliant with the new ElasticSearch-based one.

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

Searches for new particles at LEP

International Nuclear Information System (INIS)

Jimack, M.P.

1991-01-01

A review of searches for new particles at LEP is presented, including top b' quark searches; L ± , L 0 searches; searches for SUSY particles, the minimal standard mode Higgs boson; search for the h 0 (A 0 ); search for the H ± ; composite systems. No evidence for new physics has been seen, and mass limits are placed on new quarks and leptons, supersymmetric particles, Higgs particles and composite objects. (R.P.) 27 refs., 14 figs., 7 tabs

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

Directory of Open Access Journals (Sweden)

Suk Ho Jin

2017-06-01

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

Multi-dimensional design window search system using neural networks in reactor core design

International Nuclear Information System (INIS)

Kugo, Teruhiko; Nakagawa, Masayuki

2000-02-01

In the reactor core design, many parametric survey calculations should be carried out to decide an optimal set of basic design parameter values. They consume a large amount of computation time and labor in the conventional way. To support directly design work, we investigate a procedure to search efficiently a design window, which is defined as feasible design parameter ranges satisfying design criteria and requirements, in a multi-dimensional space composed of several basic design parameters. We apply the present method to the neutronics and thermal hydraulics fields and develop the multi-dimensional design window search system using it. The principle of the present method is to construct the multilayer neural network to simulate quickly a response of an analysis code through a training process, and to reduce computation time using the neural network without parametric study using analysis codes. The system works on an engineering workstation (EWS) with efficient man-machine interface for pre- and post-processing. This report describes the principle of the present method, the structure of the system, the guidance of the usages of the system, the guideline for the efficient training of neural networks, the instructions of the input data for analysis calculation and so on. (author)

Tabu search for the redundancy allocation problem of homogenous series-parallel multi-state systems

International Nuclear Information System (INIS)

Ouzineb, Mohamed; Nourelfath, Mustapha; Gendreau, Michel

2008-01-01

This paper develops an efficient tabu search (TS) heuristic to solve the redundancy allocation problem for multi-state series-parallel systems. The system has a range of performance levels from perfect functioning to complete failure. Identical redundant elements are included in order to achieve a desirable level of availability. The elements of the system are characterized by their cost, performance and availability. These elements are chosen from a list of products available in the market. System availability is defined as the ability to satisfy consumer demand, which is represented as a piecewise cumulative load curve. A universal generating function technique is applied to evaluate system availability. The proposed TS heuristic determines the minimal cost system configuration under availability constraints. An originality of our approach is that it proceeds by dividing the search space into a set of disjoint subsets, and then by applying TS to each subset. The design problem, solved in this study, has been previously analyzed using genetic algorithms (GAs). Numerical results for the test problems from previous research are reported, and larger test problems are randomly generated. Comparisons show that the proposed TS out-performs GA solutions, in terms of both the solution quality and the execution time

Automated search for supernovae

Energy Technology Data Exchange (ETDEWEB)

Kare, J.T.

1984-11-15

This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion.

Automated search for supernovae

International Nuclear Information System (INIS)

Kare, J.T.

1984-01-01

This thesis describes the design, development, and testing of a search system for supernovae, based on the use of current computer and detector technology. This search uses a computer-controlled telescope and charge coupled device (CCD) detector to collect images of hundreds of galaxies per night of observation, and a dedicated minicomputer to process these images in real time. The system is now collecting test images of up to several hundred fields per night, with a sensitivity corresponding to a limiting magnitude (visual) of 17. At full speed and sensitivity, the search will examine some 6000 galaxies every three nights, with a limiting magnitude of 18 or fainter, yielding roughly two supernovae per week (assuming one supernova per galaxy per 50 years) at 5 to 50 percent of maximum light. An additional 500 nearby galaxies will be searched every night, to locate about 10 supernovae per year at one or two percent of maximum light, within hours of the initial explosion

An approach involving dynamic group search optimization for allocating resources in OFDM-based cognitive radio system

Directory of Open Access Journals (Sweden)

Sameer Suresh Nanivadekar

2018-03-01

Full Text Available Allocation of channel resources in a cognitive radio system for achieving minimized transmission energy at an increased transmission rate is a challenging research. This paper proposes a resource allocation algorithm based on the meta-heuristic search principle. The proposed algorithm is an improved version of the Group Search Optimizer (GSO, which is a currently developed optimization algorithm that works through imitating the searching behaviour of the animals. The improvement is accomplished through introducing dynamics in the maximum pursuit angle of the GSO members. A cognitive radio system, relying on Orthogonal Frequency Division Multiplexing (OFDM for its operation, is simulated and the experimentations are carried out for sub-channel allocation. The proposed algorithm is experimentally compared with five renowned optimization algorithms, namely, conventional GSO, Particle Swarm Optimization, Genetic Algorithm, Firefly Algorithm and Artificial Bee Colony algorithm. The obtained results assert the competing performance of the proposed algorithm over the other algorithms. Keywords: Cognitive radio, OFDM, Resource, Allocation, Optimization, GSO

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

Improved Harmony Search Algorithm for Truck Scheduling Problem in Multiple-Door Cross-Docking Systems

Directory of Open Access Journals (Sweden)

Zhanzhong Wang

2018-01-01

Full Text Available The key of realizing the cross docking is to design the joint of inbound trucks and outbound trucks, so a proper sequence of trucks will make the cross-docking system much more efficient and need less makespan. A cross-docking system is proposed with multiple receiving and shipping dock doors. The objective is to find the best door assignments and the sequences of trucks in the principle of products distribution to minimize the total makespan of cross docking. To solve the problem that is regarded as a mixed integer linear programming (MILP model, three metaheuristics, namely, harmony search (HS, improved harmony search (IHS, and genetic algorithm (GA, are proposed. Furthermore, the fixed parameters are optimized by Taguchi experiments to improve the accuracy of solutions further. Finally, several numerical examples are put forward to evaluate the performances of proposed algorithms.

Modeling of pheromone communication system of forest Lepidopterous insects. II. Model of female searching by male

Directory of Open Access Journals (Sweden)

A. V. Kovalev

2015-06-01

Full Text Available We propose an agent­based simulation model search. This model allows us to evaluate the effectiveness of different males­females pheromone search strategies for Lepidoptera. In the model, we consider the simplest case of the search, when the pheromone has only one chemical component. It is assumed that the insects are able to detect the pheromone molecules and the sensory cells generate action potentials in contact with the pheromone for some time. Thereafter pheromone molecule is inactivated. This behavior can be regarded as a memory of individual. Proportion of individuals who have reached the source is selected as an integral indicator of the search efficiency. To evaluate the effectiveness, numeric experiments were performed in different conditions: random walk, search algorithm without memory, and algorithm with memory and return mechanism. The resulting effectiveness of source localization by insects for flight in turbulent flows is ~ 70 %, which corresponds to experiments with live specimens in literature. In this case, proposed pheromone search algorithm is quite simple, which makes it biologically correct. Conducted modeling calculations can be the starting point for planning of field observations and pest monitoring systems using pheromone traps.

Multilingual Federated Searching Across Heterogeneous Collections.

Science.gov (United States)

Powell, James; Fox, Edward A.

1998-01-01

Describes a scalable system for searching heterogeneous multilingual collections on the World Wide Web. Details Searchable Database Markup Language (SearchDB-ML) for describing the characteristics of a search engine and its interface, and a protocol for requesting word translations between languages. (Author)

An effective collaborative movie recommender system with cuckoo search

Directory of Open Access Journals (Sweden)

Rahul Katarya

2017-07-01

Full Text Available Recommender systems are information filtering tools that aspire to predict the rating for users and items, predominantly from big data to recommend their likes. Movie recommendation systems provide a mechanism to assist users in classifying users with similar interests. This makes recommender systems essentially a central part of websites and e-commerce applications. This article focuses on the movie recommendation systems whose primary objective is to suggest a recommender system through data clustering and computational intelligence. In this research article, a novel recommender system has been discussed which makes use of k-means clustering by adopting cuckoo search optimization algorithm applied on the Movielens dataset. Our approach has been explained systematically, and the subsequent results have been discussed. It is also compared with existing approaches, and the results have been analyzed and interpreted. Evaluation metrics such as mean absolute error (MAE, standard deviation (SD, root mean square error (RMSE and t-value for the movie recommender system delivers better results as our approach offers lesser value of the mean absolute error, standard deviation, and root mean square error. The experiment results obtained on Movielens dataset stipulate that the proposed approach may provide high performance regarding reliability, efficiency and delivers accurate personalized movie recommendations when compared with existing methods. Our proposed system (K-mean Cuckoo has 0.68 MAE, which is superior to existing work (0.78 MAE [1] and also has improvement of our previous work (0.75 MAE [2].

Multimodal neuroimaging evidence linking memory and attention systems during visual search cued by context.

Science.gov (United States)

Kasper, Ryan W; Grafton, Scott T; Eckstein, Miguel P; Giesbrecht, Barry

2015-03-01

Visual search can be facilitated by the learning of spatial configurations that predict the location of a target among distractors. Neuropsychological and functional magnetic resonance imaging (fMRI) evidence implicates the medial temporal lobe (MTL) memory system in this contextual cueing effect, and electroencephalography (EEG) studies have identified the involvement of visual cortical regions related to attention. This work investigated two questions: (1) how memory and attention systems are related in contextual cueing; and (2) how these systems are involved in both short- and long-term contextual learning. In one session, EEG and fMRI data were acquired simultaneously in a contextual cueing task. In a second session conducted 1 week later, EEG data were recorded in isolation. The fMRI results revealed MTL contextual modulations that were correlated with short- and long-term behavioral context enhancements and attention-related effects measured with EEG. An fMRI-seeded EEG source analysis revealed that the MTL contributed the most variance to the variability in the attention enhancements measured with EEG. These results support the notion that memory and attention systems interact to facilitate search when spatial context is implicitly learned. © 2015 New York Academy of Sciences.

Searching for Solar System Wide Binaries with Pan-STARRS-1

Science.gov (United States)

Holman, Matthew J.; Protopapas, P.; Tholen, D. J.

2007-10-01

Roughly 60% of the observing time of the Pan-STARRS-1 (PS1) telescope will be dedicated to a "3pi steradian" survey with an observing cadence that is designed for the detection of near-Earth asteroids and slow-moving solar system bodies. Over this course of its 3.5 year cience mission, this unprecedented survey will discover nearly every asteroid, Trojan, Centaur, long-period comet, short-period comet, and trans-neptunian object (TNO) brighter than magnitude R=23. This census will be used to address a large number of questions regarding the physical and dynamical properties of the various small body populations of the solar system. Roughly 1-2% of TNOs are wide binaries with companions at separations greater than 1 arcsec and brightness differences less than 2 magnitudes (Kern & Elliot 2006; Noll et al 2007). These can be readily detected by PS1; we will carry out such a search with PS1 data. To do so, we will modify the Pan-STARRS Moving Object Processing System (MOPS) such that it will associate the components of resolved or marginally resolved binaries, link such pairs of detections obtained at different epochs, and the estimate the relative orbit of the binary. We will also determine the efficiency with which such binaries are detected as a function of the binary's relative orbit and the relative magnitudes of the components. Based on an estimated 7000 TNOs that PS1 will discover, we anticipate finding 70-140 wide binaries. The PS1 data, 60 epochs over three years, is naturally suited to determining the orbits of these objects. Our search will accurately determine the binary fraction for a variety of subclasses of TNOs.

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.

Optimization of distribution piping network in district cooling system using genetic algorithm with local search

International Nuclear Information System (INIS)

Chan, Apple L.S.; Hanby, Vic I.; Chow, T.T.

2007-01-01

A district cooling system is a sustainable means of distribution of cooling energy through mass production. A cooling medium like chilled water is generated at a central refrigeration plant and supplied to serve a group of consumer buildings through a piping network. Because of the substantial capital investment involved, an optimal design of the distribution piping configuration is one of the crucial factors for successful implementation of the district cooling scheme. In the present study, genetic algorithm (GA) incorporated with local search techniques was developed to find the optimal/near optimal configuration of the piping network in a hypothetical site. The effect of local search, mutation rate and frequency of local search on the performance of the GA in terms of both solution quality and computation time were investigated and presented in this paper

An Elitist Multiobjective Tabu Search for Optimal Design of Groundwater Remediation Systems.

Science.gov (United States)

Yang, Yun; Wu, Jianfeng; Wang, Jinguo; Zhou, Zhifang

2017-11-01

This study presents a new multiobjective evolutionary algorithm (MOEA), the elitist multiobjective tabu search (EMOTS), and incorporates it with MODFLOW/MT3DMS to develop a groundwater simulation-optimization (SO) framework based on modular design for optimal design of groundwater remediation systems using pump-and-treat (PAT) technique. The most notable improvement of EMOTS over the original multiple objective tabu search (MOTS) lies in the elitist strategy, selection strategy, and neighborhood move rule. The elitist strategy is to maintain all nondominated solutions within later search process for better converging to the true Pareto front. The elitism-based selection operator is modified to choose two most remote solutions from current candidate list as seed solutions to increase the diversity of searching space. Moreover, neighborhood solutions are uniformly generated using the Latin hypercube sampling (LHS) in the bounded neighborhood space around each seed solution. To demonstrate the performance of the EMOTS, we consider a synthetic groundwater remediation example. Problem formulations consist of two objective functions with continuous decision variables of pumping rates while meeting water quality requirements. Especially, sensitivity analysis is evaluated through the synthetic case for determination of optimal combination of the heuristic parameters. Furthermore, the EMOTS is successfully applied to evaluate remediation options at the field site of the Massachusetts Military Reservation (MMR) in Cape Cod, Massachusetts. With both the hypothetical and the large-scale field remediation sites, the EMOTS-based SO framework is demonstrated to outperform the original MOTS in achieving the performance metrics of optimality and diversity of nondominated frontiers with desirable stability and robustness. © 2017, National Ground Water Association.

BOSS: context-enhanced search for biomedical objects

Directory of Open Access Journals (Sweden)

Choi Jaehoon

2012-04-01

Full Text Available Abstract Background There exist many academic search solutions and most of them can be put on either ends of spectrum: general-purpose search and domain-specific "deep" search systems. The general-purpose search systems, such as PubMed, offer flexible query interface, but churn out a list of matching documents that users have to go through the results in order to find the answers to their queries. On the other hand, the "deep" search systems, such as PPI Finder and iHOP, return the precompiled results in a structured way. Their results, however, are often found only within some predefined contexts. In order to alleviate these problems, we introduce a new search engine, BOSS, Biomedical Object Search System. Methods Unlike the conventional search systems, BOSS indexes segments, rather than documents. A segment refers to a Maximal Coherent Semantic Unit (MCSU such as phrase, clause or sentence that is semantically coherent in the given context (e.g., biomedical objects or their relations. For a user query, BOSS finds all matching segments, identifies the objects appearing in those segments, and aggregates the segments for each object. Finally, it returns the ranked list of the objects along with their matching segments. Results The working prototype of BOSS is available at http://boss.korea.ac.kr. The current version of BOSS has indexed abstracts of more than 20 million articles published during last 16 years from 1996 to 2011 across all science disciplines. Conclusion BOSS fills the gap between either ends of the spectrum by allowing users to pose context-free queries and by returning a structured set of results. Furthermore, BOSS exhibits the characteristic of good scalability, just as with conventional document search engines, because it is designed to use a standard document-indexing model with minimal modifications. Considering the features, BOSS notches up the technological level of traditional solutions for search on biomedical information.

How to Implement a New Search System and Make Friends While Doing It!

Science.gov (United States)

Powers, Michelle M.; Contreras, Rhonda

2013-01-01

What could bring more change to an online library than going from a federated to a discovery search system? Not much! This paper will share what was learned about initiating and implementing an important change that ultimately impacts a variety of stakeholders, and the importance of collaboration between library personnel at all levels of an…

Two Search Techniques within a Human Pedigree Database

OpenAIRE

Gersting, J. M.; Conneally, P. M.; Rogers, K.

1982-01-01

This paper presents the basic features of two search techniques from MEGADATS-2 (MEdical Genetics Acquisition and DAta Transfer System), a system for collecting, storing, retrieving and plotting human family pedigrees. The individual search provides a quick method for locating an individual in the pedigree database. This search uses a modified soundex coding and an inverted file structure based on a composite key. The navigational search uses a set of pedigree traversal operations (individual...

CBP Customs Rulings Online Search System (CROSS)

Data.gov (United States)

Department of Homeland Security — CROSS is a searchable database of CBP rulings that can be retrieved based on simple or complex search characteristics using keywords and Boolean operators. CROSS has...

Repeating pulsed magnet system for axion-like particle searches and vacuum birefringence experiments

Energy Technology Data Exchange (ETDEWEB)

Yamazaki, T., E-mail: yamazaki@icepp.s.u-tokyo.ac.jp [International Center for Elementary Particle Physics, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Inada, T.; Namba, T. [International Center for Elementary Particle Physics, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Asai, S. [Department of Physics, Graduate School of Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Kobayashi, T. [International Center for Elementary Particle Physics, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Matsuo, A.; Kindo, K. [The Institute for Solid State Physics, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa-shi, Chiba 277-8581 (Japan); Nojiri, H. [Institute for Materials Research, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai 980-8577 (Japan)

2016-10-11

We have developed a repeating pulsed magnet system which generates magnetic fields of about 10 T in a direction transverse to an incident beam over a length of 0.8 m with a repetition rate of 0.2 Hz. Its repetition rate is by two orders of magnitude higher than usual pulsed magnets. It is composed of four low resistance racetrack coils and a 30 kJ transportable capacitor bank as a power supply. The system aims at axion-like particle searches with a pulsed light source and vacuum birefringence measurements. We report on the details of the system and its performances.

How to improve your PubMed/MEDLINE searches: 3. advanced searching, MeSH and My NCBI.

Science.gov (United States)

Fatehi, Farhad; Gray, Leonard C; Wootton, Richard

2014-03-01

Although the basic PubMed search is often helpful, the results may sometimes be non-specific. For more control over the search process you can use the Advanced Search Builder interface. This allows a targeted search in specific fields, with the convenience of being able to select the intended search field from a list. It also provides a history of your previous searches. The search history is useful to develop a complex search query by combining several previous searches using Boolean operators. For indexing the articles in MEDLINE, the NLM uses a controlled vocabulary system called MeSH. This standardised vocabulary solves the problem of authors, researchers and librarians who may use different terms for the same concept. To be efficient in a PubMed search, you should start by identifying the most appropriate MeSH terms and use them in your search where possible. My NCBI is a personal workspace facility available through PubMed and makes it possible to customise the PubMed interface. It provides various capabilities that can enhance your search performance.

Policy implications for familial searching

OpenAIRE

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

2011-01-01

Abstract In the United States, several states have made policy decisions regarding whether and how to use familial searching of the Combined DNA Index System (CODIS) database in criminal investigations. Familial searching pushes DNA typing beyond merely identifying individuals to detecting genetic relatedness, an application previously reserved for missing persons identifications and custody battles. The intentional search of CODIS for partial matches to an item of evidence offers law enforce...

A Privacy-Preserving Intelligent Medical Diagnosis System Based on Oblivious Keyword Search

Directory of Open Access Journals (Sweden)

Zhaowen Lin

2017-01-01

Full Text Available One of the concerns people have is how to get the diagnosis online without privacy being jeopardized. In this paper, we propose a privacy-preserving intelligent medical diagnosis system (IMDS, which can efficiently solve the problem. In IMDS, users submit their health examination parameters to the server in a protected form; this submitting process is based on Paillier cryptosystem and will not reveal any information about their data. And then the server retrieves the most likely disease (or multiple diseases from the database and returns it to the users. In the above search process, we use the oblivious keyword search (OKS as a basic framework, which makes the server maintain the computational ability but cannot learn any personal information over the data of users. Besides, this paper also provides a preprocessing method for data stored in the server, to make our protocol more efficient.

Search extension transforms Wiki into a relational system: a case for flavonoid metabolite database.

Science.gov (United States)

Arita, Masanori; Suwa, Kazuhiro

2008-09-17

In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'database' often refers to loosely formatted, very large text files. Although such bio-databases may describe conflicts or ambiguities (e.g. a protein pair do and do not interact, or unknown parameters) in a positive sense, the flexibility of the data format sacrifices a systematic query mechanism equivalent to the widely used SQL. To overcome this disadvantage, we propose embeddable string-search commands on a Wiki-based system and designed a half-formatted database. As proof of principle, a database of flavonoid with 6902 molecular structures from over 1687 plant species was implemented on MediaWiki, the background system of Wikipedia. Registered users can describe any information in an arbitrary format. Structured part is subject to text-string searches to realize relational operations. The system was written in PHP language as the extension of MediaWiki. All modifications are open-source and publicly available. This scheme benefits from both the free-formatted Wiki style and the concise and structured relational-database style. MediaWiki supports multi-user environments for document management, and the cost for database maintenance is alleviated.

New Architectures for Presenting Search Results Based on Web Search Engines Users Experience

Science.gov (United States)

Martinez, F. J.; Pastor, J. A.; Rodriguez, J. V.; Lopez, Rosana; Rodriguez, J. V., Jr.

2011-01-01

Introduction: The Internet is a dynamic environment which is continuously being updated. Search engines have been, currently are and in all probability will continue to be the most popular systems in this information cosmos. Method: In this work, special attention has been paid to the series of changes made to search engines up to this point,…

Methodology and search for superconductivity in the La-Si-C system

International Nuclear Information System (INIS)

De la Venta, J; Basaran, Ali C; Schuller, Ivan K; Grant, T; Machado, A J S; Fisk, Z; Suchomel, M R; Weber, R T

2011-01-01

In this paper we describe a methodology for the search for new superconducting materials. This consists of a parallel synthesis of a highly inhomogeneous alloy which covers large areas of the metallurgical phase diagram combined with a fast, microwave-based method which allows non-superconducting portions of the sample to be discarded. Once an inhomogeneous sample containing a minority phase superconductor is identified, we revert to well-known thorough identification methods which include standard physical and structural methods. We show how a systematic structural study helps in avoiding misidentification of new superconducting materials when there are indications from other methods of new discoveries. These ideas are applied to the La-Si-C system which exhibits promising normal state properties which are sometimes correlated with superconductivity. Although this system shows indications for the presence of a new superconducting compound, the careful analysis described here shows that the superconductivity in this system can be attributed to intermediate binary and single phases of the system.

Real-Time Search in Clouds

OpenAIRE

Uddin, Misbah; Skinner, Amy; Stadler, Rolf; Clemm, Alexander

2013-01-01

We developed a novel approach for management of networks/networked systems based on network search [4]. Network search provides a simple, uniform interface, through which human administrators and management applications can obtain network information, configuration or operational, without knowing its schema and location. We believe that the capability of network search will spur the development of new tools for human administrators and enable the rapid development of new classes of network co...

Searching while loaded: Visual working memory does not interfere with hybrid search efficiency but hybrid search uses working memory capacity.

Science.gov (United States)

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

2016-02-01

In "hybrid search" tasks, such as finding items on a grocery list, one must search the scene for targets while also searching the list in memory. How is the representation of a visual item compared with the representations of items in the memory set? Predominant theories would propose a role for visual working memory (VWM) either as the site of the comparison or as a conduit between visual and memory systems. In seven experiments, we loaded VWM in different ways and found little or no effect on hybrid search performance. However, the presence of a hybrid search task did reduce the measured capacity of VWM by a constant amount regardless of the size of the memory or visual sets. These data are broadly consistent with an account in which VWM must dedicate a fixed amount of its capacity to passing visual representations to long-term memory for comparison to the items in the memory set. The data cast doubt on models in which the search template resides in VWM or where memory set item representations are moved from LTM through VWM to earlier areas for comparison to visual items.

SALVEREMO, an automatic system for the search and rescue in the wilderness and mountain areas

Science.gov (United States)

Penna, Roberto; Allasia, Walter; Bianchi, Luca; Licata, Enrico; Duranti, Pierluigi; Molino, Andrea; Bagalini, Enea; Sagliocco, Sergio; Scarafia, Simone; Prinetto, Paolo; Airofarulla, Giuseppe; Carelli, Alberto

2016-04-01

SALVEREMO project aims at designing and prototyping an innovative system for searching and rescuing individuals (especially hikers and mountaineers) who got lost or in peril in wilderness or mountain areas. It makes use of Remotely Piloted Aircraft System (RPAS) equipped with a sensor suite specifically selected according to the requirements identified involving alpine rescuers and government officials. The peculiarity of the proposed solution is the exploitation and integration of the special skill and expertise coming from different competence fields. It will dramatically decrease the searching time in the wilderness and remote areas off the beaten tracks, providing rescuers and operators with a decision support system increasing successful results and reducing rescue missions costs. The system benefits from the adoption of a scaled-down Base Transceiver Station (BTS) embarked in the payload sensor suite of a small RPAS that can be carried in a back pack of rescuers. A Software Defined Radio (SDR) board implementing the BTS protocol stack has been integrated in a complex sensor suite made up of open processing boards and camera devices. Moreover computer vision (CV) algorithms for real time pattern detection and image enhancements have been investigated for assisting the rescuers during the searching operations. An easy-to-use ground station application has been developed for speeding up the overall mission accomplishment. Aknowledgement SALVEREMO project is a research project co-funded by Regione Piemonte according to the call for proposal POR F.E.S.R. 2007/2013, "Linea di attività I.1.3-Innovazione e PMI - Polo della Meccatronica e dei Sistemi Avanzati di Produzione". The authors want to thank "Il Soccorso Alpino Italiano" for the invaluable support for establishing operative requirements.

Optimal Taxation with On-the-Job Search

DEFF Research Database (Denmark)

Bagger, Jesper; Moen, Espen R.; Vejlin, Rune Majlund

We study the optimal taxation of labor income in the presence of search frictions. Heterogeneous workers undertake costly search off- and on-the-job in order to locate more productive jobs that pay higher wages. More productive workers search harder, resulting in equilibrium sorting where low......-type workers are overrepresented in low-wage jobs while high-type workers are overrepresented in high-wage jobs. Absent taxes, worker search effort is efficient, because the social and private gains from search coincide. The optimal tax system balance efficiency and equity concerns at the margin. Equity...... concerns make it desirable to levy low taxes on (or indeed, subsidize) low-wage jobs including unemployment, and levy high taxes on high-wage jobs. Efficiency concerns limit how much taxes an optimal tax system levy on high-paid jobs, as high taxes distort the workers' incentives to search. The model...

A Survey in Indexing and Searching XML Documents.

Science.gov (United States)

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

2002-01-01

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

A SEARCH FOR MULTI-PLANET SYSTEMS USING THE HOBBY-EBERLY TELESCOPE

International Nuclear Information System (INIS)

Wittenmyer, Robert A.; Endl, Michael; Cochran, William D.; Levison, Harold F.; Henry, Gregory W.

2009-01-01

Extrasolar multiple-planet systems provide valuable opportunities for testing theories of planet formation and evolution. The architectures of the known multiple-planet systems demonstrate a fascinating level of diversity, which motivates the search for additional examples of such systems in order to better constrain their formation and dynamical histories. Here we describe a comprehensive investigation of 22 planetary systems in an effort to answer three questions: (1) are there additional planets? (2) where could additional planets reside in stable orbits? and (3) what limits can these observations place on such objects? We find no evidence for additional bodies in any of these systems; indeed, these new data do not support three previously announced planets (HD 20367 b: Udry et al.; HD 74156 d: Bean et al.; and 47 UMa c: Fischer et al.). The dynamical simulations show that nearly all of the 22 systems have large regions in which additional planets could exist in stable orbits. The detection-limit computations indicate that this study is sensitive to close-in Neptune-mass planets for most of the systems targeted. We conclude with a discussion on the implications of these nondetections.

Sequence Coding and Search System for licensee event reports: user's guide. Volume 1, Revision 1

International Nuclear Information System (INIS)

Greene, N.M.; Mays, G.T.; Johnson, M.P.

1985-04-01

Operating experience data from nuclear power plants are essential for safety and reliability analyses, especially analyses of trends and patterns. The licensee event reports (LERs) that are submitted to the Nuclear Regulatory Commission (NRC) by the nuclear power plant utilities contain much of this data. The NRC's Office for Analysis and Evaluation of Operational Data (AEOD) has developed, under contract with NSIC, a system for codifying the events reported in the LERs. The primary objective of the Sequence Coding and Search System (SCSS) is to reduce the descriptive text of the LERs to coded sequences that are both computer-readable and computer-searchable. This system provides a structured format for detailed coding of component, system, and unit effects as well as personnel errors. The database contains all current LERs submitted by nuclear power plant utilities for events occurring since 1981 and is updated on a continual basis. This four volume report documents and describes SCSS in detail. Volume 1 is a User's Guide for searching the SCSS database. This volume contains updated material through February 1985 of the working version of ORNL/NSIC-223, Vol. 1

Using Google Search Appliance (GSA) to search digital library collections: A Case Study of the INIS Collection Search

International Nuclear Information System (INIS)

Savic, Dobrica

2014-01-01

Google Search has established a new standard for information retrieval which did not exist with previous generations of library search facilities. The INIS hosts one of the world’s largest collections of published information on the peaceful uses of nuclear science and technology. It offers on-line access to a unique collection of 3.6 million bibliographic records and 483,000 full texts of non-conventional (grey) literature. This large digital library collection suffered from most of the well-known shortcomings of the classic library catalogue. Searching was complex and complicated, it required training in Boolean logic, full-text searching was not an option, and response time was slow. An opportune moment to improve the system came with the retirement of the previous catalogue software and the adoption of GSA as an organization-wide search engine standard. INIS was quick to realize the potential of using such a well-known application to replace its on-line catalogue. This paper presents the advantages and disadvantages encountered during three years of GSA use. Based on specific INIS-based practice and experience, this paper also offers some guidelines on ways to improve classic collections of millions of bibliographic and full-text documents, while reaping multiple benefits, such as increased use, accessibility, usability, expandability and improving user search and retrieval experiences. (author)

Subject search study. Final report

International Nuclear Information System (INIS)

Todeschini, C.

1995-01-01

The study gathered information on how users search the database of the International Nuclear Information System (INIS), using indicators such as Subject categories, Controlled terms, Subject headings, Free-text words, combinations of the above. Users participated from the Australian, French, Russian and Spanish INIS Centres, that have different national languages. Participants, both intermediaries and end users, replied to a questionnaire and executed search queries. The INIS Secretariat at the IAEA also participated. A protocol of all search strategies used in actual searches in the database was kept. The thought process for Russian and Spanish users is predominantly non-English and also the actual initial search formulation is predominantly non-English among Russian and Spanish users while it tends to be more in English among French users. A total of 1002 searches were executed by the five INIS centres including the IAEA. The search protocols indicate the following search behaviour: 1) free text words represent about 40% of search points on an average query; 2) descriptors used as search keys have the widest range as percentage of search points, from a low of 25% to a high of 48%; 3) search keys consisting of free text that coincides with a descriptor account for about 15% of search points; 4) Subject Categories are not used in many searches; 5) free text words are present as search points in about 80% of all searches; 6) controlled terms (descriptors) are used very extensively and appear in about 90% of all searches; 7) Subject Headings were used in only a few percent of searches. From the results of the study one can conclude that there is a greater reluctance on the part of non-native English speakers in initiating their searches by using free text word searches. Also: Subject Categories are little used in searching the database; both free text terms and controlled terms are the predominant types of search keys used, whereby the controlled terms are used more

Architecture for knowledge-based and federated search of online clinical evidence.

Science.gov (United States)

Coiera, Enrico; Walther, Martin; Nguyen, Ken; Lovell, Nigel H

2005-10-24

It is increasingly difficult for clinicians to keep up-to-date with the rapidly growing biomedical literature. Online evidence retrieval methods are now seen as a core tool to support evidence-based health practice. However, standard search engine technology is not designed to manage the many different types of evidence sources that are available or to handle the very different information needs of various clinical groups, who often work in widely different settings. The objectives of this paper are (1) to describe the design considerations and system architecture of a wrapper-mediator approach to federate search system design, including the use of knowledge-based, meta-search filters, and (2) to analyze the implications of system design choices on performance measurements. A trial was performed to evaluate the technical performance of a federated evidence retrieval system, which provided access to eight distinct online resources, including e-journals, PubMed, and electronic guidelines. The Quick Clinical system architecture utilized a universal query language to reformulate queries internally and utilized meta-search filters to optimize search strategies across resources. We recruited 227 family physicians from across Australia who used the system to retrieve evidence in a routine clinical setting over a 4-week period. The total search time for a query was recorded, along with the duration of individual queries sent to different online resources. Clinicians performed 1662 searches over the trial. The average search duration was 4.9 +/- 3.2 s (N = 1662 searches). Mean search duration to the individual sources was between 0.05 s and 4.55 s. Average system time (ie, system overhead) was 0.12 s. The relatively small system overhead compared to the average time it takes to perform a search for an individual source shows that the system achieves a good trade-off between performance and reliability. Furthermore, despite the additional effort required to incorporate the

HTTP-based Search and Ordering Using ECHO's REST-based and OpenSearch APIs

Science.gov (United States)

Baynes, K.; Newman, D. J.; Pilone, D.

2012-12-01

Metadata is an important entity in the process of cataloging, discovering, and describing Earth science data. NASA's Earth Observing System (EOS) ClearingHOuse (ECHO) acts as the core metadata repository for EOSDIS data centers, providing a centralized mechanism for metadata and data discovery and retrieval. By supporting both the ESIP's Federated Search API and its own search and ordering interfaces, ECHO provides multiple capabilities that facilitate ease of discovery and access to its ever-increasing holdings. Users are able to search and export metadata in a variety of formats including ISO 19115, json, and ECHO10. This presentation aims to inform technically savvy clients interested in automating search and ordering of ECHO's metadata catalog. The audience will be introduced to practical and applicable examples of end-to-end workflows that demonstrate finding, sub-setting and ordering data that is bound by keyword, temporal and spatial constraints. Interaction with the ESIP OpenSearch Interface will be highlighted, as will ECHO's own REST-based API.

A cognitive robotic system based on the Soar cognitive architecture for mobile robot navigation, search, and mapping missions

Science.gov (United States)

Hanford, Scott D.

Most unmanned vehicles used for civilian and military applications are remotely operated or are designed for specific applications. As these vehicles are used to perform more difficult missions or a larger number of missions in remote environments, there will be a great need for these vehicles to behave intelligently and autonomously. Cognitive architectures, computer programs that define mechanisms that are important for modeling and generating domain-independent intelligent behavior, have the potential for generating intelligent and autonomous behavior in unmanned vehicles. The research described in this presentation explored the use of the Soar cognitive architecture for cognitive robotics. The Cognitive Robotic System (CRS) has been developed to integrate software systems for motor control and sensor processing with Soar for unmanned vehicle control. The CRS has been tested using two mobile robot missions: outdoor navigation and search in an indoor environment. The use of the CRS for the outdoor navigation mission demonstrated that a Soar agent could autonomously navigate to a specified location while avoiding obstacles, including cul-de-sacs, with only a minimal amount of knowledge about the environment. While most systems use information from maps or long-range perceptual capabilities to avoid cul-de-sacs, a Soar agent in the CRS was able to recognize when a simple approach to avoiding obstacles was unsuccessful and switch to a different strategy for avoiding complex obstacles. During the indoor search mission, the CRS autonomously and intelligently searches a building for an object of interest and common intersection types. While searching the building, the Soar agent builds a topological map of the environment using information about the intersections the CRS detects. The agent uses this topological model (along with Soar's reasoning, planning, and learning mechanisms) to make intelligent decisions about how to effectively search the building. Once the

Usability evaluation of an experimental text summarization system and three search engines: implications for the reengineering of health care interfaces.

Science.gov (United States)

Kushniruk, Andre W; Kan, Min-Yem; McKeown, Kathleen; Klavans, Judith; Jordan, Desmond; LaFlamme, Mark; Patel, Vimia L

2002-01-01

This paper describes the comparative evaluation of an experimental automated text summarization system, Centrifuser and three conventional search engines - Google, Yahoo and About.com. Centrifuser provides information to patients and families relevant to their questions about specific health conditions. It then produces a multidocument summary of articles retrieved by a standard search engine, tailored to the user's question. Subjects, consisting of friends or family of hospitalized patients, were asked to "think aloud" as they interacted with the four systems. The evaluation involved audio- and video recording of subject interactions with the interfaces in situ at a hospital. Results of the evaluation show that subjects found Centrifuser's summarization capability useful and easy to understand. In comparing Centrifuser to the three search engines, subjects' ratings varied; however, specific interface features were deemed useful across interfaces. We conclude with a discussion of the implications for engineering Web-based retrieval systems.

When and why might a Computer Aided Detection (CAD) system interfere with visual search? An eye-tracking study

Science.gov (United States)

Drew, Trafton; Cunningham, Corbin; Wolfe, Jeremy

2012-01-01

Rational and Objectives Computer Aided Detection (CAD) systems are intended to improve performance. This study investigates how CAD might actually interfere with a visual search task. This is a laboratory study with implications for clinical use of CAD. Methods 47 naïve observers in two studies were asked to search for a target, embedded in 1/f2.4 noise while we monitored their eye-movements. For some observers, a CAD system marked 75% of targets and 10% of distractors while other observers completed the study without CAD. In Experiment 1, the CAD system’s primary function was to tell observers where the target might be. In Experiment 2, CAD provided information about target identity. Results In Experiment 1, there was a significant enhancement of observer sensitivity in the presence of CAD (t(22)=4.74, pCAD system were missed more frequently than equivalent targets in No CAD blocks of the experiment (t(22)=7.02, pCAD, but also no significant cost on sensitivity to unmarked targets (t(22)=0.6, p=n.s.). Finally, in both experiments, CAD produced reliable changes in eye-movements: CAD observers examined a lower total percentage of the search area than the No CAD observers (Ex 1: t(48)=3.05, pCAD signals do not combine with observers’ unaided performance in a straight-forward manner. CAD can engender a sense of certainty that can lead to incomplete search and elevated chances of missing unmarked stimuli. PMID:22958720

Web-based information search and retrieval: effects of strategy use and age on search success.

Science.gov (United States)

Stronge, Aideen J; Rogers, Wendy A; Fisk, Arthur D

2006-01-01

The purpose of this study was to investigate the relationship between strategy use and search success on the World Wide Web (i.e., the Web) for experienced Web users. An additional goal was to extend understanding of how the age of the searcher may influence strategy use. Current investigations of information search and retrieval on the Web have provided an incomplete picture of Web strategy use because participants have not been given the opportunity to demonstrate their knowledge of Web strategies while also searching for information on the Web. Using both behavioral and knowledge-engineering methods, we investigated searching behavior and system knowledge for 16 younger adults (M = 20.88 years of age) and 16 older adults (M = 67.88 years). Older adults were less successful than younger adults in finding correct answers to the search tasks. Knowledge engineering revealed that the age-related effect resulted from ineffective search strategies and amount of Web experience rather than age per se. Our analysis led to the development of a decision-action diagram representing search behavior for both age groups. Older adults had more difficulty than younger adults when searching for information on the Web. However, this difficulty was related to the selection of inefficient search strategies, which may have been attributable to a lack of knowledge about available Web search strategies. Actual or potential applications of this research include training Web users to search more effectively and suggestions to improve the design of search engines.

Intelligent Information Systems for Web Product Search

NARCIS (Netherlands)

D. Vandic (Damir)

2017-01-01

markdownabstractOver the last few years, we have experienced an increase in online shopping. Consequently, there is a need for efficient and effective product search engines. The rapid growth of e-commerce, however, has also introduced some challenges. Studies show that users can get overwhelmed by

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.

mySearch changed my life – a resource discovery journey

OpenAIRE

Crowley, Emma J.

2013-01-01

mySearch: the federated years mySearch: choosing a new platform mySearch: EBSCO Discovery Service (EDS) Implementing a new system Technical challenges Has resource discovery enhanced experiences at BU? Ongoing challenges Implications for library management systems Implications for information literacy Questions

Search along persistent random walks

International Nuclear Information System (INIS)

Friedrich, Benjamin M

2008-01-01

Optimal search strategies and their implementations in biological systems are a subject of active research. Here we study a search problem which is motivated by the hunt of sperm cells for the egg. We ask for the probability for an active swimmer to find a target under the condition that the swimmer starts at a certain distance from the target. We find that success probability is maximal for a certain level of fluctuations characterized by the persistence length of the swimming path of the swimmer. We derive a scaling law for the optimal persistence length as a function of the initial target distance and search time by mapping the search on a polymer physics problem

Anamneses-Based Internet Information Supply: Can a Combination of an Expert System and Meta-Search Engine Help Consumers find the Health Information they Require?

Science.gov (United States)

Honekamp, Wilfried; Ostermann, Herwig

2010-04-09

An increasing number of people search for health information online. During the last 10 years various researchers have determined the requirements for an ideal consumer health information system. The aim of this study was to figure out, whether medical laymen can find a more accurate diagnosis for a given anamnesis via the developed prototype health information system than via ordinary internet search.In a randomized controlled trial, the prototype information system was evaluated by the assessment of two sample cases. Participants had to determine the diagnosis of a patient with a headache via information found searching the web. A patient's history sheet and a computer with internet access were provided to the participants and they were guided through the study by an especially designed study website. The intervention group used the prototype information system; the control group used common search engines and portals. The numbers of correct diagnoses in each group were compared.A total of 140 (60/80) participants took part in two study sections. In the first case, which determined a common diagnosis, both groups did equally well. In the second section, which determined a less common and more complex case, the intervention group did significantly better (P=0.031) due to the tailored information supply.Using medical expert systems in combination with a portal searching meta-search engine represents a feasible strategy to provide reliable patient-tailored information and can ultimately contribute to patient safety with respect to information found via the internet.

Learning Search Algorithms: An Educational View

Directory of Open Access Journals (Sweden)

Ales Janota

2014-12-01

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

The EBI search engine: EBI search as a service—making biological data accessible for all

Science.gov (United States)

Park, Young M.; Squizzato, Silvano; Buso, Nicola; Gur, Tamer

2017-01-01

Abstract We present an update of the EBI Search engine, an easy-to-use fast text search and indexing system with powerful data navigation and retrieval capabilities. 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 that include nucleotide and protein sequences, genes, gene products, proteins, protein domains, protein families, enzymes and macromolecular structures, as well as the life science literature. EBI Search provides a powerful RESTful API that enables its integration into third-party portals, thus providing ‘Search as a Service’ capabilities, which are the main topic of this article. PMID:28472374

An R-peak detection method that uses an SVD filter and a search back system.

Science.gov (United States)

Jung, Woo-Hyuk; Lee, Sang-Goog

2012-12-01

In this paper, we present a method for detecting the R-peak of an ECG signal by using an singular value decomposition (SVD) filter and a search back system. The ECG signal was detected in two phases: the pre-processing phase and the decision phase. The pre-processing phase consisted of the stages for the SVD filter, Butterworth High Pass Filter (HPF), moving average (MA), and squaring, whereas the decision phase consisted of a single stage that detected the R-peak. In the pre-processing phase, the SVD filter removed noise while the Butterworth HPF eliminated baseline wander. The MA removed the remaining noise of the signal that had gone through the SVD filter to make the signal smooth, and squaring played a role in strengthening the signal. In the decision phase, the threshold was used to set the interval before detecting the R-peak. When the latest R-R interval (RRI), suggested by Hamilton et al., was greater than 150% of the previous RRI, the method of detecting the R-peak in such an interval was modified to be 150% or greater than the smallest interval of the two most latest RRIs. When the modified search back system was used, the error rate of the peak detection decreased to 0.29%, compared to 1.34% when the modified search back system was not used. Consequently, the sensitivity was 99.47%, the positive predictivity was 99.47%, and the detection error was 1.05%. Furthermore, the quality of the signal in data with a substantial amount of noise was improved, and thus, the R-peak was detected effectively. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

Analysis of a librarian-mediated literature search service.

Science.gov (United States)

Friesen, Carol; Lê, Mê-Linh; Cooke, Carol; Raynard, Melissa

2015-01-01

Librarian-mediated literature searching is a key service provided at medical libraries. This analysis outlines ten years of data on 19,248 literature searches and describes information on the volume and frequency of search requests, time spent per search, databases used, and professional designations of the patron requestors. Combined with information on best practices for expert searching and evaluations of similar services, these findings were used to form recommendations on the improvement and standardization of a literature search service at a large health library system.

Using a Google Search Appliance (GSA to search digital library collections: a case study of the INIS Collection Search

Directory of Open Access Journals (Sweden)

Dobrica Savic

2014-05-01

The International Nuclear Information System (INIS hosts one of the world’s largest collections of published information on the peaceful uses of nuclear science and technology. It offers online access to a unique collection of 3.6 million bibliographic records and 320,000 full-texts of non-conventional (grey literature. This large digital library collection suffered from most of the well-known shortcomings of the classic library catalogue. Searching was complex and complicated, required some training in using Boolean logic, full-text searching was not an option, and the response time was slow. An opportune moment came with the retirement of the previous catalogue software and with the adoption of Google Search Appliance (GSA as an organization-wide search engine standard. INIS was quick to realize a great potential in using such a well-known application as a replacement for its online catalogue and this paper presents the advantages and disadvantages encountered during three years of GSA use. Based on specific INIS-based practice and experience, this paper also offers some guidelines on ways to improve classic collections of millions of bibliographic and full-text documents, while achieving multiple benefits such as increased use, accessibility, usability, expandability and improving the user search and retrieval experience.

SEDRIO/INCORE, an automatic optimal loading pattern search system for PWR NPP reload core using an expert system

International Nuclear Information System (INIS)

Xian Chunyu; Zhang Zongyao

2003-01-01

The expert knowledge library for Daya Bay and Qinshan phase II NPP has been established based on expert knowledge, and the reload core loading pattern heuristic search is performed. The in-core fuel management code system INCORE that has been used in engineering design is employed for neutron calculation, and loading pattern is evaluated by using of cycle length and core radial power peaking factor. The developed system SEDRIO/INCORE has been applied in cycle 4 for unit 2 of Daya Bay NPP and cycle 4 for Phase II in Qinshan NPP. The application demonstrated that the loading patterns obtained by SEDRIO/INCORE system are much better than reference ones from the view of the radial power peak and the cycle length

A novel field search and rescue system based on SIM card location

Science.gov (United States)

Zhang, Huihui; Guo, Shutao; Cui, Dejing

2017-06-01

Nowadays, the rapid development of outdoor sports and adventure leads to the increase of the frequency of missing accidents. On the other hand, it becomes much more convenient and efficient for the criminals to escape with the help of new technologies. So we have developed a long-distance raids targeted field search and rescue system which utilizes RSSI ranging and Kalman filtering algorithm to realize remote positioning and dynamic supervision management only by a mobile phone with a SIM card, without any additional terminal equipment.

SEARCHING FOR TROJAN ASTEROIDS IN THE HD 209458 SYSTEM: SPACE-BASED MOST PHOTOMETRY AND DYNAMICAL MODELING

International Nuclear Information System (INIS)

Moldovan, Reka; Matthews, Jaymie M.; Gladman, Brett; Bottke, William F.; Vokrouhlicky, David

2010-01-01

We have searched Microvariability and Oscillations of Stars (MOST) satellite photometry obtained in 2004, 2005, and 2007 of the solar-type star HD 209458 for Trojan asteroid swarms dynamically coupled with the system's transiting 'hot Jupiter' HD 209458b. Observations of the presence and nature of asteroids around other stars would provide unique constraints on migration models of exoplanetary systems. Our results set an upper limit on the optical depth of Trojans in the HD 209458 system that can be used to guide current and future searches of similar systems by upcoming missions. Using cross-correlation methods with artificial signals implanted in the data, we find that our detection limit corresponds to a relative Trojan transit depth of 1 x10 -4 , equivalent to ∼1 lunar mass of asteroids, assuming power-law Trojan size distributions similar to Jupiter's Trojans in our solar system. We confirm with dynamical interpretations that some asteroids could have migrated inward with the planet to its current orbit at 0.045 AU, and that the Yarkovsky effect is ineffective at eliminating objects of >1 m in size. However, using numerical models of collisional evolution we find that, due to high relative speeds in this confined Trojan environment, collisions destroy the vast majority of the asteroids in -7 .

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

International Nuclear Information System (INIS)

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

2013-01-01

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

A searching and reporting system for relational databases using a graph-based metadata representation.

Science.gov (United States)

Hewitt, Robin; Gobbi, Alberto; Lee, Man-Ling

2005-01-01

Relational databases are the current standard for storing and retrieving data in the pharmaceutical and biotech industries. However, retrieving data from a relational database requires specialized knowledge of the database schema and of the SQL query language. At Anadys, we have developed an easy-to-use system for searching and reporting data in a relational database to support our drug discovery project teams. This system is fast and flexible and allows users to access all data without having to write SQL queries. This paper presents the hierarchical, graph-based metadata representation and SQL-construction methods that, together, are the basis of this system's capabilities.

Search engines and the production of academic knowledge

NARCIS (Netherlands)

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

Neutron detector suitcase for the Nuclear Emergency Search Team

International Nuclear Information System (INIS)

Dowdy, E.J.; Henry, C.N.; Hastings, R.D.; France, S.W.

1978-02-01

A portable high-efficiency neutron detection system has been constructed for the Nuclear Emergency Search Team. It includes an alarm system based on time interval measurements of the incoming neutron detection pulses. The system is designed for transportation by vehicle in searching for neutron-emitting radioactive materials

Policy implications for familial searching.

Science.gov (United States)

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

2011-11-01

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

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

Science.gov (United States)

Russell-Rose, Tony; Chamberlain, Jon

2017-10-02

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

Optimization of travel salesman problem using the ant colony system and Greedy search

International Nuclear Information System (INIS)

Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.

2008-01-01

In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

Multi-agent search for source localization in a turbulent medium

International Nuclear Information System (INIS)

Hajieghrary, Hadi; Hsieh, M. Ani; Schwartz, Ira B.

2016-01-01

We extend the gradient-less search strategy referred to as “infotaxis” to a distributed multi-agent system. “Infotaxis” is a search strategy that uses sporadic sensor measurements to determine the source location of materials dispersed in a turbulent medium. In this work, we leverage the spatio-temporal sensing capabilities of a mobile sensing agents to optimize the time spent finding and localizing the position of the source using a multi-agent collaborative search strategy. Our results suggest that the proposed multi-agent collaborative search strategy leverages the team's ability to obtain simultaneous measurements at different locations to speed up the search process. We present a multi-agent collaborative “infotaxis” strategy that uses the relative entropy of the system to synthesize a suitable search strategy for the team. The result is a collaborative information theoretic search strategy that results in control actions that maximize the information gained by the team, and improves estimates of the source position. - Highlights: • We extend the gradient-less infotaxis search strategy to a distributed multi-agent system. • Leveraging the spatio-temporal sensing capabilities of a team of mobile sensing agents speeds up the search process. • The resulting information theoretic search strategy maximizes the information gained and improves the estimate of the source position.

Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system

International Nuclear Information System (INIS)

Li, H.Y.; Wu, C.W.; Liu, W.T.; Chen, P.X.; Li, C.Z.

2011-01-01

We propose a method for implementing the Grover search algorithm directly in a database containing any number of items based on multi-level systems. Compared with the searching procedure in the database with qubits encoding, our modified algorithm needs fewer iteration steps to find the marked item and uses the carriers of the information more economically. Furthermore, we illustrate how to realize our idea in cavity QED using Zeeman's level structure of atoms. And the numerical simulation under the influence of the cavity and atom decays shows that the scheme could be achieved efficiently within current state-of-the-art technology. -- Highlights: ► A modified Grover algorithm is proposed for searching in an arbitrary dimensional Hilbert space. ► Our modified algorithm requires fewer iteration steps to find the marked item. ► The proposed method uses the carriers of the information more economically. ► A scheme for a six-item Grover search in cavity QED is proposed. ► Numerical simulation under decays shows that the scheme can be achieved with enough fidelity.

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

Science.gov (United States)

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

2017-09-01

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

The EBI search engine: EBI search as a service-making biological data accessible for all.

Science.gov (United States)

Park, Young M; Squizzato, Silvano; Buso, Nicola; Gur, Tamer; Lopez, Rodrigo

2017-07-03

We present an update of the EBI Search engine, an easy-to-use fast text search and indexing system with powerful data navigation and retrieval capabilities. 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 that include nucleotide and protein sequences, genes, gene products, proteins, protein domains, protein families, enzymes and macromolecular structures, as well as the life science literature. EBI Search provides a powerful RESTful API that enables its integration into third-party portals, thus providing 'Search as a Service' capabilities, which are the main topic of this article. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Full text and figure display improves bioscience literature search.

Science.gov (United States)

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

2010-04-14

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

Full text and figure display improves bioscience literature search.

Directory of Open Access Journals (Sweden)

Anna Divoli

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

Semantic search: finding KTBL's planning data and reusing them in IT systems

Directory of Open Access Journals (Sweden)

Daniel Martini

2014-02-01

Full Text Available The effort to investigate relevant data for planning purposes and preparation of labour and investments in agricultural production as well as reworking and entering them for reuse in calculation tools and farm management information systems are major challenges for decisions based on data. The following paper presents a solution which on the one hand simplifies targeted finding of planning data within KTBL’s data sets using a semantic search engine and on the other hand enables simple reuse and processing of these data by providing them using Linked Open Data principles.

The cryogenic system for the Panda-X dark matter search experiment

International Nuclear Information System (INIS)

Gong, H; Giboni, K L; Ji, X; Tan, A; Zhao, L

2013-01-01

Panda-X is a liquid xenon dual-phase detector for the Dark Matter Search. The first modestly-sized module will soon be installed in the China JinPing Deep Underground Laboratory in Sichuan province, P.R. China. The cryogenic system is designed to handle much larger detectors, even the final version in the ton scale. Special attention has been paid to the reliability, serviceability, and adaptability to the requirements of a growing experiment. The system is cooled by a single Iwatani PC150 Pulse Tube Refrigerator. After subtracting all thermal losses, the remaining cooling power is still 82 W. The fill speed was 0.75 g/s, but could be boosted by LN 2 assisted cooling to 3.3 g/s. For the continuous recirculation and purification through a hot getter, a heat exchanger was employed to reduce the required cooling power. The recirculation speed is limited to 2.9 g/s by the gas pump. At this speed, recirculation only adds 18.5 W to the heat load of the system, corresponding to a 95.2 % efficiency of the heat exchanger.

Optimizing Search and Ranking in Folksonomy Systems by Exploiting Context Information

Science.gov (United States)

Abel, Fabian; Henze, Nicola; Krause, Daniel

Tagging systems enable users to annotate resources with freely chosen keywords. The evolving bunch of tag assignments is called folksonomy and there exist already some approaches that exploit folksonomies to improve resource retrieval. In this paper, we analyze and compare graph-based ranking algorithms: FolkRank and SocialPageRank. We enhance these algorithms by exploiting the context of tags, and evaluate the results on the GroupMe! dataset. In GroupMe!, users can organize and maintain arbitrary Web resources in self-defined groups. When users annotate resources in GroupMe!, this can be interpreted in context of a certain group. The grouping activity itself is easy for users to perform. However, it delivers valuable semantic information about resources and their context. We present GRank that uses the context information to improve and optimize the detection of relevant search results, and compare different strategies for ranking result lists in folksonomy systems.

SearchResultFinder: federated search made easy

NARCIS (Netherlands)

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

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

The Role of Domain and System Knowledge on Text Comprehension and Information Search in Hypermedia

Science.gov (United States)

Waniek, Jacqueline; Schafer, Thomas

2009-01-01

The goal of this study was to examine the role of domain and system knowledge on learner performance in reading and information search in hypermedia. Previous studies have shown that prior knowledge is an important individual factor for effective hypermedia use. However, current research lacks a full understanding of how these two aspects of prior…

Mathematical programming solver based on local search

CERN Document Server

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

2014-01-01

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

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.

Search for extraterrestrial life: recent developments. Proceedings

Energy Technology Data Exchange (ETDEWEB)

Papagiannis, M D [ed.

1985-01-01

Seventy experts from 20 different countries discuss the many interrelated aspects of the search for extraterrestrial life, including the search for other planetary systems where life may originate and evolve, the widespread presence of complex prebiotic molecules in our Solar System and in interstellar space which could be precursors of life, and the universal aspects of the biological evolution on Earth. They also discuss the nearly 50 radio searches that were undertaken in the last 25 years, the technological progress that has occurred in this period, and the plans for the future including the comprehensive SETI search program that NASA is now preparing for the 1990's. Extensive introductions by the Editor to each of the 8 sections, make this volume friendly even to the non-specialist who has a genuine interest for this new field. 549 refs.; 84 figs.; 21 tabs.

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.

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

Eletronic system for search of particles with 1-0.1 ps lifetime

International Nuclear Information System (INIS)

Bobkov, S.G.; Kantserov, V.A.; Pershin, A.S.

1986-01-01

The algorithms for search of short-lived particleswith 1-0.1 ps lifetime in a vertex detector based on drift chambers are considered. Electronics supply of such selecting by means ofthe suggested algorithms is described. The algorithms for useful event selecting in electron detectors are developed by pp-interaction simulation using the Monte-Carlo method. Events of two types are simulated: charm particle generation with theirfurther decay and interactions without charm particle generation. Two-dimensional interaction pattern is cnsidered. Some algorithms for data processing by the selecting systems (trigger systems) are developed. For all algorithms the event is considered to be useful, if more than one vertex is determined. The algorithms are based on geometrical relations for one-vertex events. Systematic deviation from these relations means that the event is multivertex

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

Searching bioremediation patents through Cooperative Patent Classification (CPC).

Science.gov (United States)

Prasad, Rajendra

2016-03-01

Patent classification systems have traditionally evolved independently at each patent jurisdiction to classify patents handled by their examiners to be able to search previous patents while dealing with new patent applications. As patent databases maintained by them went online for free access to public as also for global search of prior art by examiners, the need arose for a common platform and uniform structure of patent databases. The diversity of different classification, however, posed problems of integrating and searching relevant patents across patent jurisdictions. To address this problem of comparability of data from different sources and searching patents, WIPO in the recent past developed what is known as International Patent Classification (IPC) system which most countries readily adopted to code their patents with IPC codes along with their own codes. The Cooperative Patent Classification (CPC) is the latest patent classification system based on IPC/European Classification (ECLA) system, developed by the European Patent Office (EPO) and the United States Patent and Trademark Office (USPTO) which is likely to become a global standard. This paper discusses this new classification system with reference to patents on bioremediation.

Optimal gravitational search algorithm for automatic generation control of interconnected power systems

Directory of Open Access Journals (Sweden)

Rabindra Kumar Sahu

2014-09-01

Full Text Available An attempt is made for the effective application of Gravitational Search Algorithm (GSA to optimize PI/PIDF controller parameters in Automatic Generation Control (AGC of interconnected power systems. Initially, comparison of several conventional objective functions reveals that ITAE yields better system performance. Then, the parameters of GSA technique are properly tuned and the GSA control parameters are proposed. The superiority of the proposed approach is demonstrated by comparing the results of some recently published techniques such as Differential Evolution (DE, Bacteria Foraging Optimization Algorithm (BFOA and Genetic Algorithm (GA. Additionally, sensitivity analysis is carried out that demonstrates the robustness of the optimized controller parameters to wide variations in operating loading condition and time constants of speed governor, turbine, tie-line power. Finally, the proposed approach is extended to a more realistic power system model by considering the physical constraints such as reheat turbine, Generation Rate Constraint (GRC and Governor Dead Band nonlinearity.

ACCOUNTING FOR USERS' INFLATED ASSESSMENTS OF ONLINE CATALOG SEARCH PERFORMANCE AND USEFULNESS: AN EXPERIMENTAL STUDY

Directory of Open Access Journals (Sweden)

Charles R. Hildreth

2001-01-01

Full Text Available User-oriented approaches to information retrieval (IR system performance evaluation assign a major role to user satisfaction with search results and overall system performance. Expressed satisfaction with search results is often used as a measure of utility. Many research studies indicate that users of on-line library catalogs (OPACs and other IR systems often express satisfaction with poor search results. This phenomenon of "false positives," inflated assessments of search results and system performance, has not been adequately explained. Non-performance factors such as interface style and ease of use may have an affect on a searcher's satisfaction with search results. The research described in this report investigates this phenomenon. This paper presents the findings of an experimental study which compared users' search performance and assessments of ease of use, system usefulness, and satisfaction with search results after use of a Web OPAC or its conventional counterpart. The primary questions addressed by this research center on the influence of two experimental factors, OPAC search interface style and search task level of difficulty, on the dependent variables: actual search performance, perceptions of ease of use and system usefulness, and assessments of satisfaction with search results. The study also investigated associations between perceived ease of use, system usefulness, and satisfaction with search results. Lastly, the study looked for associations between the dependent variables and personal characteristics. No association was found between satisfaction with search results and actual search performance. Web OPAC searchers outperformed Text OPAC searchers, but search task level of difficulty is a major determinant of search success. A strong positive correlation was found between perceptions of system ease of use and assessments of search results.

THE QUASIPERIODIC AUTOMATED TRANSIT SEARCH ALGORITHM

International Nuclear Information System (INIS)

Carter, Joshua A.; Agol, Eric

2013-01-01

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

Optimum Design of Gravity Retaining Walls Using Charged System Search Algorithm

Directory of Open Access Journals (Sweden)

S. Talatahari

2012-01-01

Full Text Available This study focuses on the optimum design retaining walls, as one of the familiar types of the retaining walls which may be constructed of stone masonry, unreinforced concrete, or reinforced concrete. The material cost is one of the major factors in the construction of gravity retaining walls therefore, minimizing the weight or volume of these systems can reduce the cost. To obtain an optimal seismic design of such structures, this paper proposes a method based on a novel meta-heuristic algorithm. The algorithm is inspired by the Coulomb's and Gauss’s laws of electrostatics in physics, and it is called charged system search (CSS. In order to evaluate the efficiency of this algorithm, an example is utilized. Comparing the results of the retaining wall designs obtained by the other methods illustrates a good performance of the CSS. In this paper, we used the Mononobe-Okabe method which is one of the pseudostatic approaches to determine the dynamic earth pressure.

The roles of non-retinotopic motions in visual search

Directory of Open Access Journals (Sweden)

Ryohei eNakayama

2016-06-01

Full Text Available In visual search, a moving target among stationary distracters is detected more rapidly and more efficiently than a static target among moving distracters. Here we examined how this search asymmetry depends on motion signals from three distinct coordinate system – retinal, relative, and spatiotopic (head/body-centered. Our search display consisted of a target element, distracters elements, and a fixation point tracked by observers. Each element was composed of a spatial carrier grating windowed by a Gaussian envelope, and the motions of carriers, windows, and fixation were manipulated independently and used in various combinations to decouple the respective effects of motion coordinates systems on visual search asymmetry. We found that retinal motion hardly contributes to reaction times and search slopes but that relative and spatiotopic motions contribute to them substantially. Results highlight the important roles of non-retinotopic motions for guiding observer attention in visual 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.

A Nonmonotone Line Search Filter Algorithm for the System of Nonlinear Equations

Directory of Open Access Journals (Sweden)

Zhong Jin

2012-01-01

Full Text Available We present a new iterative method based on the line search filter method with the nonmonotone strategy to solve the system of nonlinear equations. The equations are divided into two groups; some equations are treated as constraints and the others act as the objective function, and the two groups are just updated at the iterations where it is needed indeed. We employ the nonmonotone idea to the sufficient reduction conditions and filter technique which leads to a flexibility and acceptance behavior comparable to monotone methods. The new algorithm is shown to be globally convergent and numerical experiments demonstrate its effectiveness.

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…

To gauge or not to gauge?

Science.gov (United States)

Maldacena, Juan; Milekhin, Alexey

2018-04-01

The D0 brane, or BFSS, matrix model is a quantum mechanical theory with an interesting gravity dual. We consider a variant of this model where we treat the SU( N) symmetry as a global symmetry, rather than as a gauge symmetry. This variant contains new non-singlet states. We consider the impact of these new states on its gravity dual. We argue that the gravity dual is essentially the same as the one for the original matrix model. The non-singlet states have higher energy at strong coupling and are therefore dynamically suppressed.

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.

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

Science.gov (United States)

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

2018-04-01

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

The New Horizons and Hubble Space Telescope search for rings, dust, and debris in the Pluto-Charon system

Science.gov (United States)

Lauer, Tod R.; Throop, Henry B.; Showalter, Mark R.; Weaver, Harold A.; Stern, S. Alan; Spencer, John R.; Buie, Marc W.; Hamilton, Douglas P.; Porter, Simon B.; Verbiscer, Anne J.; Young, Leslie A.; Olkin, Cathy B.; Ennico, Kimberly; New Horizons Science Team

2018-02-01

We conducted an extensive search for dust or debris rings in the Pluto-Charon system before, during, and after the New Horizons encounter in July 2015. Methodologies included attempting to detect features by back-scattered light during the approach to Pluto (phase angle α ∼ 15°), in situ detection of impacting particles, a search for stellar occultations near the time of closest approach, and by forward-scattered light imaging during departure (α ∼ 165°). An extensive search using the Hubble Space Telescope (HST) prior to the encounter also contributed to the final ring limits. No rings, debris, or dust features were observed, but our new detection limits provide a substantially improved picture of the environment throughout the Pluto-Charon system. Searches for rings in back-scattered light covered the range 35,000-250,000 km from the system barycenter, a zone that starts interior to the orbit of Styx, the innermost minor satellite, and extends out to four times the orbital radius of Hydra, the outermost known satellite. We obtained our firmest limits using data from the New Horizons LORRI camera in the inner half of this region. Our limits on the normal I/F of an unseen ring depends on the radial scale of the rings: 2 ×10-8 (3σ) for 1500 km wide rings, 1 ×10-8 for 6000 km rings, and 7 ×10-9 for 12,000 km rings. Beyond ∼ 100, 000 km from Pluto, HST observations limit normal I/F to ∼ 8 ×10-8 . Searches for dust features from forward-scattered light extended from the surface of Pluto to the Pluto-Charon Hill sphere (rHill = 6.4 ×106 km). No evidence for rings or dust clouds was detected to normal I/F limits of ∼ 8.9 ×10-7 on ∼ 104 km scales. Four stellar occulation observations also probed the space interior to Hydra, but again no dust or debris was detected. The Student Dust Counter detected one particle impact 3.6 × 106 km from Pluto, but this is consistent with the interplanetary space environment established during the cruise of New

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.

PolySearch2: a significantly improved text-mining system for discovering associations between human diseases, genes, drugs, metabolites, toxins and more.

Science.gov (United States)

Liu, Yifeng; Liang, Yongjie; Wishart, David

2015-07-01

PolySearch2 (http://polysearch.ca) is an online text-mining system for identifying relationships between biomedical entities such as human diseases, genes, SNPs, proteins, drugs, metabolites, toxins, metabolic pathways, organs, tissues, subcellular organelles, positive health effects, negative health effects, drug actions, Gene Ontology terms, MeSH terms, ICD-10 medical codes, biological taxonomies and chemical taxonomies. PolySearch2 supports a generalized 'Given X, find all associated Ys' query, where X and Y can be selected from the aforementioned biomedical entities. An example query might be: 'Find all diseases associated with Bisphenol A'. To find its answers, PolySearch2 searches for associations against comprehensive collections of free-text collections, including local versions of MEDLINE abstracts, PubMed Central full-text articles, Wikipedia full-text articles and US Patent application abstracts. PolySearch2 also searches 14 widely used, text-rich biological databases such as UniProt, DrugBank and Human Metabolome Database to improve its accuracy and coverage. PolySearch2 maintains an extensive thesaurus of biological terms and exploits the latest search engine technology to rapidly retrieve relevant articles and databases records. PolySearch2 also generates, ranks and annotates associative candidates and present results with relevancy statistics and highlighted key sentences to facilitate user interpretation. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Search and Recommendation

DEFF Research Database (Denmark)

Bogers, Toine

2014-01-01

In just a little over half a century, the field of information retrieval has experienced spectacular growth and success, with IR applications such as search engines becoming a billion-dollar industry in the past decades. Recommender systems have seen an even more meteoric rise to success with wide...

Search and selection hotel system in Surabaya based on geographic information system (GIS) with fuzzy logic

Science.gov (United States)

Purbandini, Taufik

2016-03-01

Surabaya is a metropolitan city in Indonesia. When the visitor has an interest in Surabaya for several days, then the visitor was looking for lodging that is closest to the interests of making it more efficient and practical. It was not a waste of time for the businessman because of congestion and so we need full information about the hotel as an inn during a stay in Surabaya began name, address of the hotel, the hotel's website, the distance from the hotel to the destination until the display of the map along the route with the help of Google Maps. This system was designed using fuzzy logic which aims to assist the user in making decisions. Design of hotel search and selection system was done through four stages. The first phase was the collection of data and as the factors that influence the decision-making along with the limit values of these factors. Factors that influence covers a distance of the hotel, the price of hotel rooms, and hotel reviews. The second stage was the processing of data and information by creating membership functions. The third stage was the analysis of systems with fuzzy logic. The steps were performed in systems analysis, namely fuzzification, inference using Mamdani, and defuzzification. The last stage was the design and construction of the system. Designing the system using use case diagrams and activity diagram to describe any process that occurs. Development system includes system implementation and evaluation systems. Implementation of mobile with Android-based system so that these applications were user friendly.

Optimizing Vector-Quantization Processor Architecture for Intelligent Query-Search Applications

Science.gov (United States)

Xu, Huaiyu; Mita, Yoshio; Shibata, Tadashi

2002-04-01

The architecture of a very large scale integration (VLSI) vector-quantization processor (VQP) has been optimized to develop a general-purpose intelligent query-search agent. The agent performs a similarity-based search in a large-volume database. Although similarity-based search processing is computationally very expensive, latency-free searches have become possible due to the highly parallel maximum-likelihood search architecture of the VQP chip. Three architectures of the VQP chip have been studied and their performances are compared. In order to give reasonable searching results according to the different policies, the concept of penalty function has been introduced into the VQP. An E-commerce real-estate agency system has been developed using the VQP chip implemented in a field-programmable gate array (FPGA) and the effectiveness of such an agency system has been demonstrated.

Budget constraints and optimization in sponsored search auctions

CERN Document Server

Yang, Yanwu

2013-01-01

The Intelligent Systems Series publishes reference works and handbooks in three core sub-topic areas: Intelligent Automation, Intelligent Transportation Systems, and Intelligent Computing. They include theoretical studies, design methods, and real-world implementations and applications. The series' readership is broad, but focuses on engineering, electronics, and computer science. Budget constraints and optimization in sponsored search auctions takes into account consideration of the entire life cycle of campaigns for researchers and developers working on search systems and ROI maximization

Neural field model of memory-guided search.

Science.gov (United States)

Kilpatrick, Zachary P; Poll, Daniel B

2017-12-01

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

Neural field model of memory-guided search

Science.gov (United States)

Kilpatrick, Zachary P.; Poll, Daniel B.

2017-12-01

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

EXPLORING THE LAST PLANNER SYSTEM IN THE SEARCH FOR EXCELLENCE

DEFF Research Database (Denmark)

Lindhard, Søren Munch

. As an answer to the revealed critiques a new framework for production control was developed. By adopting an open system-theory mindset the surrounding world including motivation and leadership is now considered. The surrounding world is important because it affects both processes and behavior on-site which...... the presents and the quality of the fulfillment. Hence, optimal fulfillment is pursued. A health check of buffered activities is added to handle variation in sound activities and to avoid non-ready activities in entering the Commitment Plans. In the search for improved on-site communication and collaborations...... a Coordination Schedule is implemented at the Commitment Plan level. Finally, the follow-up phase now includes an evaluation of both output quantity and quality to increase management’s insights to the progress of the construction site. All changes have been evaluated by interviewing seven experts. The experts...

The search for life in our Solar System and the implications for science and society.

Science.gov (United States)

McKay, Christopher P

2011-02-13

The search for another type of life in the Solar System addresses the fundamental question of life in the Universe. To determine if life forms we discover represent a second genesis, we must find biological material that would allow us to compare that life to the Earth's phylogenetic tree of life. An organism would be alien if, and only if, it did not link to our tree of life. In our Solar System, the worlds of interest for a search for life are Mars, Europa, Enceladus and, for biochemistry based on a liquid other than water, Titan. If we find evidence for a second genesis of life, we will certainly learn from the comparative study of the biochemistry, organismal biology and ecology of the alien life. The discovery of alien life, if alive or revivable, will pose fundamentally new questions in environmental ethics. We should plan our exploration strategy such that we conduct biologically reversible exploration. In the long term we would do well, ethically and scientifically, to strive to support any alien life discovered as part of an overall commitment to enhancing the richness and diversity of life in the Universe.

Search Patterns

CERN Document Server

Morville, Peter

2010-01-01

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

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.

Mastering Search Analytics Measuring SEO, SEM and Site Search

CERN Document Server

Chaters, Brent

2011-01-01

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

The retrieval efficiency test of descriptors and free vocabulary terms in INIS on-line search

International Nuclear Information System (INIS)

Ebinuma, Yukio; Takahashi, Satoko

1981-01-01

The test was done for 1) search topics with appropriate descriptors, 2) search topics with considerably broader descriptors, 3) search topics with no appropriate descriptors. As to (1) and (2) the retrieval efficiency was the same both on descriptor system and on keyword system (descriptors + free terms), and the search formulas were easily constructed. As to (3) the descriptor system ensured the recall ratio but decreased the precision ratio. On the other hand the keyword system made the construction of search formulas easy and resulted in good retrieval efficiency. The search system which is available both for full match method of descriptors and truncation method of keywords is desirable because each method can be selected according to the searcher's strategy and search topics. Free-term system seems unnecessary. (author)

Deep web search: an overview and roadmap

NARCIS (Netherlands)

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

2011-01-01

We review the state-of-the-art in deep web search and propose a novel classification scheme to better compare deep web search systems. The current binary classification (surfacing versus virtual integration) hides a number of implicit decisions that must be made by a developer. We make these

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.

Search for fractional charge

International Nuclear Information System (INIS)

Turner, R.E.

1984-01-01

A search was made for fractional charges of the form Z plus two-thirds e, where Z is an integer. It was assumed that the charges exist in natural form bound with other fractional charges in neutral molecules. It was further assumed that these neutral molecules are present in air. Two concentration schemes were employed. One sample was derived from the waste gases from a xenon distillation plant. This assumes that high mass, low vapor pressure components of air are concentrated along with the xenon. The second sample involved ionizing air, allowing a brief recombination period, and then collecting residual ions on the surface of titanium discs. Both samples were analyzed at the University of Rochester in a system using a tandem Van de Graff to accelerate particles through an essentially electrostatic beam handling system. The detector system employed both a Time of Flight and an energy-sensitive gas ionization detector. In the most sensitive mode of analysis, a gas absorber was inserted in the beam path to block the intense background. The presence of an absorber limited the search to highly penetrating particles. Effectively, this limited the search to particles with low Z and masses greater than roughly fifty GeV. The final sensitivities attained were on the order of 1 x 10 -20 for the ionized air sample and 1 x 10 -21 for the gas sample. A discussion of the caveats that could reduce the actual level of sensitivity is included

Enhancing Image Retrieval System Using Content Based Search ...

African Journals Online (AJOL)

The output shows more efficiency in retrieval because instead of performing the search on the entire image database, the image category option directs the retrieval engine to the specified category. Also, there is provision to update or modify the different image categories in the image database as need arise. Keywords: ...

The Importance of Prior Probabilities for Entry Page Search

NARCIS (Netherlands)

Kraaij, W.; Westerveld, T.H.W.; Hiemstra, Djoerd

An important class of searches on the world-wide-web has the goal to find an entry page (homepage) of an organisation. Entry page search is quite different from Ad Hoc search. Indeed a plain Ad Hoc system performs disappointingly. We explored three non-content features of web pages: page length,

Search Help

Science.gov (United States)

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

PLC-based search and secure interlock system for the personnel safety in folded tandem ion accelerator

International Nuclear Information System (INIS)

Padmakumar, Sapna; Subramanyum, N.B.V.; Bhatt, Jignesh P.; Ware, Shailaja V.; Kansara, M.J.; Gupta, S.K.; Singh, P.

2006-01-01

Safety of the personnel is one of the key issues addressed in any accelerator project. The FOTIA facility at BARC is capable of operating under standard operation conditions without any radiation hazard. Even then for a safe and reliable operation of FOTIA a PLC (Programmable logic controller) based interlock system has been implemented. This interlocking system is compact, modular, flexible, robust and easy for troubleshooting. These advantages led to the popularity of PLC rather than using a relay-based system. This paper highlights the salient features of the search and secure interlock for the personal safety of FOTIA. (author)

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

International Nuclear Information System (INIS)

Esposito, R.D.

2003-01-01

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

Internet Search Engines

OpenAIRE

Fatmaa El Zahraa Mohamed Abdou

2004-01-01

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

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.

GeoSearcher: Location-Based Ranking of Search Engine Results.

Science.gov (United States)

Watters, Carolyn; Amoudi, Ghada

2003-01-01

Discussion of Web queries with geospatial dimensions focuses on an algorithm that assigns location coordinates dynamically to Web sites based on the URL. Describes a prototype search system that uses the algorithm to re-rank search engine results for queries with a geospatial dimension, thus providing an alternative ranking order for search engine…

Implementation Of Haversine Formula And Best First Search Method In Searching Of Tsunami Evacuation Route

Science.gov (United States)

Anisya; Yoga Swara, Ganda

2017-12-01

Padang is one of the cities prone to earthquake disaster with tsunami due to its position at the meeting of two active plates, this is, a source of potentially powerful earthquake and tsunami. Central government and most offices are located in the red zone (vulnerable areas), it will also affect the evacuation of the population during the earthquake and tsunami disaster. In this study, researchers produced a system of search nearest shelter using best-first-search method. This method uses the heuristic function, the amount of cost taken and the estimated value or travel time, path length and population density. To calculate the length of the path, researchers used method of haversine formula. The value obtained from the calculation process is implemented on a web-based system. Some alternative paths and some of the closest shelters will be displayed in the system.

BIOME: A scientific data archive search-and-order system using browser-aware, dynamic pages

Science.gov (United States)

Jennings, S. V.; Yow, T. G.; Ng, V. W.

1997-01-01

The Oak Ridge National Laboratory's (ORNL) Distributed Active Archive Center (DAAC) is a data archive and distribution center for the National Air and Space Administration's (NASA) Earth Observing System Data and Information System (EOSDIS). Both the Earth Observing System (EOS) and EOSDIS are components of NASA's contribution to the US Global Change Research Program through its Mission to Planet Earth Program. The ORNL DAAC provides access to data used in ecological and environmental research such as global change, global warming, and terrestrial ecology. Because of its large and diverse data holdings, the challenge for the ORNL DAAC is to help users find data of interest from the hundreds of thousands of files available at the DAAC without overwhelming them. Therefore, the ORNL DAAC has developed the Biogeochemical Information Ordering Management Environment (BIOME), a customized search and order system for the World Wide Web (WWW). BIOME is a public system located at http://www-eosdis. ornl.gov/BIOME/biome.html.

University Students' Online Information Searching Strategies in Different Search Contexts

Science.gov (United States)

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

2012-01-01

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

Adaptive Engineering of an Embedded System, Engineered for use by Search and Rescue Canines

Directory of Open Access Journals (Sweden)

Cristina Ribeiro

2011-06-01

Full Text Available In Urban Search and Rescue (US&R operations, canine teams are deployed to find live patients, and save lives. US&R may benefit from increased levels of situational awareness, through information made available through the use of embedded systems attached to the dogs. One of these is the Canine Pose Estimation (CPE system. There are many challenges faced with such embedded systems including the engineering of such devices for use in disaster environments. Durability and wireless connectivity in areas with materials that inhibit wireless communications, the safety of the dog wearing the devices, and form factor must be accommodated. All of these factors must be weighed without compromising the accuracy of the application and the timely delivery of its data. This paper discusses the adaptive engineering process and how each of the unique challenges of emergency response embedded systems can be defined and overcome through effective design methods.

Interactive searching of facial image databases

Science.gov (United States)

Nicholls, Robert A.; Shepherd, John W.; Shepherd, Jean

1995-09-01

A set of psychological facial descriptors has been devised to enable computerized searching of criminal photograph albums. The descriptors have been used to encode image databased of up to twelve thousand images. Using a system called FACES, the databases are searched by translating a witness' verbal description into corresponding facial descriptors. Trials of FACES have shown that this coding scheme is more productive and efficient than searching traditional photograph albums. An alternative method of searching the encoded database using a genetic algorithm is currenly being tested. The genetic search method does not require the witness to verbalize a description of the target but merely to indicate a degree of similarity between the target and a limited selection of images from the database. The major drawback of FACES is that is requires a manual encoding of images. Research is being undertaken to automate the process, however, it will require an algorithm which can predict human descriptive values. Alternatives to human derived coding schemes exist using statistical classifications of images. Since databases encoded using statistical classifiers do not have an obvious direct mapping to human derived descriptors, a search method which does not require the entry of human descriptors is required. A genetic search algorithm is being tested for such a purpose.

High-throughput computational search for strengthening precipitates in alloys

International Nuclear Information System (INIS)

Kirklin, S.; Saal, James E.; Hegde, Vinay I.; Wolverton, C.

2016-01-01

The search for high-strength alloys and precipitation hardened systems has largely been accomplished through Edisonian trial and error experimentation. Here, we present a novel strategy using high-throughput computational approaches to search for promising precipitate/alloy systems. We perform density functional theory (DFT) calculations of an extremely large space of ∼200,000 potential compounds in search of effective strengthening precipitates for a variety of different alloy matrices, e.g., Fe, Al, Mg, Ni, Co, and Ti. Our search strategy involves screening phases that are likely to produce coherent precipitates (based on small lattice mismatch) and are composed of relatively common alloying elements. When combined with the Open Quantum Materials Database (OQMD), we can computationally screen for precipitates that either have a stable two-phase equilibrium with the host matrix, or are likely to precipitate as metastable phases. Our search produces (for the structure types considered) nearly all currently known high-strength precipitates in a variety of fcc, bcc, and hcp matrices, thus giving us confidence in the strategy. In addition, we predict a number of new, currently-unknown precipitate systems that should be explored experimentally as promising high-strength alloy chemistries.

An Improved Global Harmony Search Algorithm for the Identification of Nonlinear Discrete-Time Systems Based on Volterra Filter Modeling

Directory of Open Access Journals (Sweden)

Zongyan Li

2016-01-01

Full Text Available This paper describes an improved global harmony search (IGHS algorithm for identifying the nonlinear discrete-time systems based on second-order Volterra model. The IGHS is an improved version of the novel global harmony search (NGHS algorithm, and it makes two significant improvements on the NGHS. First, the genetic mutation operation is modified by combining normal distribution and Cauchy distribution, which enables the IGHS to fully explore and exploit the solution space. Second, an opposition-based learning (OBL is introduced and modified to improve the quality of harmony vectors. The IGHS algorithm is implemented on two numerical examples, and they are nonlinear discrete-time rational system and the real heat exchanger, respectively. The results of the IGHS are compared with those of the other three methods, and it has been verified to be more effective than the other three methods on solving the above two problems with different input signals and system memory sizes.

INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR

OpenAIRE

Fadhilah Mat Yamin; T. Ramayah

2013-01-01

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

Competing intelligent search agents in global optimization

Energy Technology Data Exchange (ETDEWEB)

Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)

1996-12-31

In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.

Automated real-time search and analysis algorithms for a non-contact 3D profiling system

Science.gov (United States)

Haynes, Mark; Wu, Chih-Hang John; Beck, B. Terry; Peterman, Robert J.

2013-04-01

The purpose of this research is to develop a new means of identifying and extracting geometrical feature statistics from a non-contact precision-measurement 3D profilometer. Autonomous algorithms have been developed to search through large-scale Cartesian point clouds to identify and extract geometrical features. These algorithms are developed with the intent of providing real-time production quality control of cold-rolled steel wires. The steel wires in question are prestressing steel reinforcement wires for concrete members. The geometry of the wire is critical in the performance of the overall concrete structure. For this research a custom 3D non-contact profilometry system has been developed that utilizes laser displacement sensors for submicron resolution surface profiling. Optimizations in the control and sensory system allow for data points to be collected at up to an approximate 400,000 points per second. In order to achieve geometrical feature extraction and tolerancing with this large volume of data, the algorithms employed are optimized for parsing large data quantities. The methods used provide a unique means of maintaining high resolution data of the surface profiles while keeping algorithm running times within practical bounds for industrial application. By a combination of regional sampling, iterative search, spatial filtering, frequency filtering, spatial clustering, and template matching a robust feature identification method has been developed. These algorithms provide an autonomous means of verifying tolerances in geometrical features. The key method of identifying the features is through a combination of downhill simplex and geometrical feature templates. By performing downhill simplex through several procedural programming layers of different search and filtering techniques, very specific geometrical features can be identified within the point cloud and analyzed for proper tolerancing. Being able to perform this quality control in real time

[Advanced online search techniques and dedicated search engines for physicians].

Science.gov (United States)

Nahum, Yoav

2008-02-01

In recent years search engines have become an essential tool in the work of physicians. This article will review advanced search techniques from the world of information specialists, as well as some advanced search engine operators that may help physicians improve their online search capabilities, and maximize the yield of their searches. This article also reviews popular dedicated scientific and biomedical literature search engines.

PubData: search engine for bioinformatics databases worldwide

OpenAIRE

Vand, Kasra; Wahlestedt, Thor; Khomtchouk, Kelly; Sayed, Mohammed; Wahlestedt, Claes; Khomtchouk, Bohdan

2016-01-01

We propose a search engine and file retrieval system for all bioinformatics databases worldwide. PubData searches biomedical data in a user-friendly fashion similar to how PubMed searches biomedical literature. PubData is built on novel network programming, natural language processing, and artificial intelligence algorithms that can patch into the file transfer protocol servers of any user-specified bioinformatics database, query its contents, retrieve files for download, and adapt to the use...

Integrated health care delivery system conducts ad agency search as part of its brand-launching effort.

Science.gov (United States)

Lewicki, G

1999-01-01

PennState Geisinger Health System, Hershey, Pa., conducted an extensive ad agency search after its inception in 1997. The integrated health care delivery system needed to introduce its brand to an audience that was confused by the wide array of available health care options. BVK/McDonald, Milwaukee, the agency selected, has created a branding campaign that revolves around the tag-line "The power of health." PennState Geisinger will tabulate the results of BVK/McDonald's multi-million dollar campaign in 2000; at that time it will know whether its selection committee chose wisely.

Exploring Contextual Models in Chemical Patent Search

Science.gov (United States)

Urbain, Jay; Frieder, Ophir

We explore the development of probabilistic retrieval models for integrating term statistics with entity search using multiple levels of document context to improve the performance of chemical patent search. A distributed indexing model was developed to enable efficient named entity search and aggregation of term statistics at multiple levels of patent structure including individual words, sentences, claims, descriptions, abstracts, and titles. The system can be scaled to an arbitrary number of compute instances in a cloud computing environment to support concurrent indexing and query processing operations on large patent collections.

Flexible digital library search

NARCIS (Netherlands)

Windhouwer, M.; Schmidt, A.; Zwol, van R.; Petkovic, M.; Blok, H.E.; Dahanayake, A.; Gerhardt, W.

2003-01-01

In this chapter the development of a specialised search engine for a digital library is described. The proposed system architecture consists of three levels: the conceptual, the logical and the physical level. The conceptual level schema enables by its exposure of a domain specific schema

Children's Search Engines from an Information Search Process Perspective.

Science.gov (United States)

Broch, Elana

2000-01-01

Describes cognitive and affective characteristics of children and teenagers that may affect their Web searching behavior. Reviews literature on children's searching in online public access catalogs (OPACs) and using digital libraries. Profiles two Web search engines. Discusses some of the difficulties children have searching the Web, in the…

How Users Search the Library from a Single Search Box

Science.gov (United States)

Lown, Cory; Sierra, Tito; Boyer, Josh

2013-01-01

Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…

A dynamical systems approach to the surface search for debris associated with the disappearance of flight MH370

Science.gov (United States)

García-Garrido, V. J.; Mancho, A. M.; Wiggins, S.; Mendoza, C.

2015-11-01

The disappearance of Malaysia Airlines flight MH370 on the morning of 8 March 2014 is one of the great mysteries of our time. Perhaps the most relevant aspect of this mystery is that not a single piece of debris from the aircraft was found during the intensive surface search carried out for roughly 2 months following the crash. Difficulties in the search efforts, due to the uncertainty of the plane's final impact point and the time that had passed since the accident, bring the question on how the debris scattered in an always moving ocean, for which there are multiple data sets that do not uniquely determine its state. Our approach to this problem is based on the use of Lagrangian descriptors (LD), a novel mathematical tool coming from dynamical systems theory that identifies dynamic barriers and coherent structures governing transport. By combining publicly available information supplied by different ocean data sources with these mathematical techniques, we are able to assess the spatio-temporal state of the ocean in the priority search area at the time of impact and the following weeks. Using this information we propose a revised search strategy by showing why one might not have expected to find debris in some large search areas targeted by the Australian Maritime Safety Authority (AMSA), and determining regions where one might have expected impact debris to be located, which were not subjected to any exploration.

Random searching

International Nuclear Information System (INIS)

Shlesinger, Michael F

2009-01-01

There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

Information Diversity in Web Search

Science.gov (United States)

Liu, Jiahui

2009-01-01

The web is a rich and diverse information source with incredible amounts of information about all kinds of subjects in various forms. This information source affords great opportunity to build systems that support users in their work and everyday lives. To help users explore information on the web, web search systems should find information that…

Intelligent systems for urban search and rescue: challenges and lessons learned

Science.gov (United States)

Jacoff, Adam; Messina, Elena; Weiss, Brian A.

2003-09-01

Urban search and rescue (USAR) is one of the most dangerous and time-critical non-wartime activities. Researchers have been developing hardware and software to enable robots to perform some search and rescue functions so as to minimize the exposure of human rescue personnel to danger and maximize the survival of victims. Significant progress has been achieved, but much work remains. USAR demands a blending of numerous specialized technologies. An effective USAR robot must be endowed with key competencies, such as being able to negotiate collapsed structures, find victims and assess their condition, identify potential hazards, generate maps of the structure and victim locations, and communicate with rescue personnel. These competencies bring to bear work in numerous sub-disciplines of intelligent systems (or artificial intelligence) such as sensory processing, world modeling, behavior generation, path planning, and human-robot interaction, in addition to work in communications, mechanism design and advanced sensors. In an attempt to stimulate progress in the field, reference USAR challenges are being developed and propagated worldwide. In order to make efficient use of finite research resources, the robotic USAR community must share a common understanding of what is required, technologically, to attain each competency, and have a rigorous measure of the current level of effectiveness of various technologies. NIST is working with partner organizations to measure the performance of robotic USAR competencies and technologies. In this paper, we describe the reference test arenas for USAR robots, assess the current challenges within the field, and discuss experiences thus far in the testing effort.

Home-Explorer: Ontology-Based Physical Artifact Search and Hidden Object Detection System

Directory of Open Access Journals (Sweden)

Bin Guo

2008-01-01

Full Text Available A new system named Home-Explorer that searches and finds physical artifacts in a smart indoor environment is proposed. The view on which it is based is artifact-centered and uses sensors attached to the everyday artifacts (called smart objects in the real world. This paper makes two main contributions: First, it addresses, the robustness of the embedded sensors, which is seldom discussed in previous smart artifact research. Because sensors may sometimes be broken or fail to work under certain conditions, smart objects become hidden ones. However, current systems provide no mechanism to detect and manage objects when this problem occurs. Second, there is no common context infrastructure for building smart artifact systems, which makes it difficult for separately developed applications to interact with each other and uneasy for them to share and reuse knowledge. Unlike previous systems, Home-Explorer builds on an ontology-based knowledge infrastructure named Sixth-Sense, which makes it easy for the system to interact with other applications or agents also based on this ontology. The hidden object problem is also reflected in our ontology, which enables Home-Explorer to deal with both smart objects and hidden objects. A set of rules for deducing an object's status or location information and for locating hidden objects are described and evaluated.

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

IBRI-CASONTO: Ontology-based semantic search engine

Directory of Open Access Journals (Sweden)

Awny Sayed

2017-11-01

Full Text Available The vast availability of information, that added in a very fast pace, in the data repositories creates a challenge in extracting correct and accurate information. Which has increased the competition among developers in order to gain access to technology that seeks to understand the intent researcher and contextual meaning of terms. While the competition for developing an Arabic Semantic Search systems are still in their infancy, and the reason could be traced back to the complexity of Arabic Language. It has a complex morphological, grammatical and semantic aspects, as it is a highly inflectional and derivational language. In this paper, we try to highlight and present an Ontological Search Engine called IBRI-CASONTO for Colleges of Applied Sciences, Oman. Our proposed engine supports both Arabic and English language. It is also employed two types of search which are a keyword-based search and a semantics-based search. IBRI-CASONTO is based on different technologies such as Resource Description Framework (RDF data and Ontological graph. The experiments represent in two sections, first it shows a comparison among Entity-Search and the Classical-Search inside the IBRI-CASONTO itself, second it compares the Entity-Search of IBRI-CASONTO with currently used search engines, such as Kngine, Wolfram Alpha and the most popular engine nowadays Google, in order to measure their performance and efficiency.

Information-Limited Parallel Processing in Difficult Heterogeneous Covert Visual Search

Science.gov (United States)

Dosher, Barbara Anne; Han, Songmei; Lu, Zhong-Lin

2010-01-01

Difficult visual search is often attributed to time-limited serial attention operations, although neural computations in the early visual system are parallel. Using probabilistic search models (Dosher, Han, & Lu, 2004) and a full time-course analysis of the dynamics of covert visual search, we distinguish unlimited capacity parallel versus serial…

Click your way to the right bottle of wine : Birds of a feather ? A new interactive search system

NARCIS (Netherlands)

Stappers, P.J.; Pasman, G.; De Boo, M.

2000-01-01

Dozens of television programmes to choose from,hundreds of colours in the paint shop, hundreds of different kinds of red wine at wine merchants or supermarkets. Were simply spoilt for choice. Making the right choice will become easier with the interactive search system developed by researchers at

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

`I can't find my keys!' Who hasn't gone through this experience when leaving, in a hurry, to attend to some urgent matter? The keys could be in many different places. Unless one remembers where he or she has left the keys, the only solution is to look around, more or less randomly. Random searches are common because in many cases the locations of the specific targets are not known a priori. Indeed, such problems have been discussed in diverse contexts, attracting the interest of scientists from many fields, for example: the dynamical or stochastic search for a stable minimum in a complex energy landscape, relevant to systems such as glasses, protein (folding), and others; oil recovery from mature reservoirs; proteins searching for their specific target sites on DNA; animal foraging; survival at the edge of extinction due to low availability of energetic resources; automated searches of registers in high-capacity databases, search engine (e.g., `crawlers') that explore the internet; and even pizza delivery in a jammed traffic system of a medium-size town. In this way, the subject is interesting, challenging and has recently become an important scientific area of investigation. Although the applications are diverse, the underlying physical mechanisms are the same which will become clear in this special issue. Moreover, the inherent complexity of the problem, the abundance of ideas and methods found in this growing interdisciplinary field of research is studied in many areas of physics. In particular, the concepts and methods of statistical mechanics are particularly useful to the study of random searches. On one hand, it centres on how to find the global or local maxima of search efficiency functions with incomplete information. This is, of course, related to the long tradition in physics of using different conceptual and mathematical tools, such as variational methods, to extremize relevant quantities, e.g., energy, entropy and action. Such ideas and approaches are

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.

The search for massive black hole binaries with LISA

International Nuclear Information System (INIS)

Cornish, Neil J; Porter, Edward K

2007-01-01

In this work we focus on the search and detection of massive black hole binary (MBHB) systems, including systems at high redshift. As well as expanding on previous works where we used a variant of Markov chain Monte Carlo (MCMC), called Metropolis-Hastings Monte Carlo, with simulated annealing, we introduce a new search method based on frequency annealing which leads to a more rapid and robust detection. We compare the two search methods on systems where we do and do not see the merger of the black holes. In the non-merger case, we also examine the posterior distribution exploration using a 7D MCMC algorithm. We demonstrate that this method is effective in dealing with the high correlations between parameters, has a higher acceptance rate than previously proposed methods and produces posterior distribution functions that are close to the prediction from the Fisher information matrix. Finally, after carrying out searches where there is only one binary in the data stream, we examine the case where two black hole binaries are present in the same data stream. We demonstrate that our search algorithm can accurately recover both binaries, and more importantly showing that we can safely extract the MBHB sources without contaminating the rest of the data stream

Congestion management of deregulated power systems by optimal setting of Interline Power Flow Controller using Gravitational Search algorithm

Directory of Open Access Journals (Sweden)

Akanksha Mishra

2017-05-01

Full Text Available In a deregulated electricity market it may at times become difficult to dispatch all the required power that is scheduled to flow due to congestion in transmission lines. An Interline Power Flow Controller (IPFC can be used to reduce the system loss and power flow in the heavily loaded line, improve stability and loadability of the system. This paper proposes a Disparity Line Utilization Factor for the optimal placement and Gravitational Search algorithm based optimal tuning of IPFC to control the congestion in transmission lines. DLUF ranks the transmission lines in terms of relative line congestion. The IPFC is accordingly placed in the most congested and the least congested line connected to the same bus. Optimal sizing of IPFC is carried using Gravitational Search algorithm. A multi-objective function has been chosen for tuning the parameters of the IPFC. The proposed method is implemented on an IEEE-30 bus test system. Graphical representations have been included in the paper showing reduction in LUF of the transmission lines after the placement of an IPFC. A reduction in active power and reactive power loss of the system by about 6% is observed after an optimally tuned IPFC has been included in the power system. The effectiveness of the proposed tuning method has also been shown in the paper through the reduction in the values of the objective functions.

Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms

Science.gov (United States)

2017-09-01

NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and

Maintaining the momentum of Open Search in Earth Science Data discovery

Science.gov (United States)

Newman, D. J.; Lynnes, C.

2013-12-01

Federated Search for Earth Observation data has been a hallmark of EOSDIS (Earth Observing System Data and Information System) for two decades. Originally, the EOSDIS Version 0 system provided both data-collection-level and granule/file-level search in the mid 1990s with EOSDIS-specific socket protocols and message formats. Since that time, the advent of several standards has helped to simplify EOSDIS federated search, beginning with HTTP as the transfer protocol. Most recently, OpenSearch (www.opensearch.org) was employed for the EOS Clearinghouse (ECHO), based on a set of conventions that had been developed within the Earth Science Information Partners (ESIP) Federation. The ECHO OpenSearch API has evolved to encompass the ESIP RFC and the Open Geospatial Consortium (OGC) Open Search standard. Uptake of the ECHO Open Search API has been significant and has made ECHO accessible to client developers that found the previous ECHO SOAP API and current REST API too complex. Client adoption of the OpenSearch API appears to be largely driven by the simplicity of the OpenSearch convention. This simplicity is thus important to retain as the standard and convention evolve. For example, ECHO metrics indicate that the vast majority of ECHO users favor the following search criteria when using the REST API, - Spatial - bounding box, polygon, line and point - Temporal - start and end time - Keywords - free text Fewer than 10% of searches use additional constraints, particularly those requiring a controlled vocabulary, such as instrument, sensor, etc. This suggests that ongoing standardization efforts around OpenSearch usage for Earth Observation data may be more productive if oriented toward improving support for the Spatial, Temporal and Keyword search aspects. Areas still requiring improvement include support of - Concrete requirements for keyword constraints - Phrasal search for keyword constraints - Temporal constraint relations - Terminological symmetry between search URLs

Evidence-based Medicine Search: a customizable federated search engine.

Science.gov (United States)

Bracke, Paul J; Howse, David K; Keim, Samuel M

2008-04-01

This paper reports on the development of a tool by the Arizona Health Sciences Library (AHSL) for searching clinical evidence that can be customized for different user groups. The AHSL provides services to the University of Arizona's (UA's) health sciences programs and to the University Medical Center. Librarians at AHSL collaborated with UA College of Medicine faculty to create an innovative search engine, Evidence-based Medicine (EBM) Search, that provides users with a simple search interface to EBM resources and presents results organized according to an evidence pyramid. EBM Search was developed with a web-based configuration component that allows the tool to be customized for different specialties. Informal and anecdotal feedback from physicians indicates that EBM Search is a useful tool with potential in teaching evidence-based decision making. While formal evaluation is still being planned, a tool such as EBM Search, which can be configured for specific user populations, may help lower barriers to information resources in an academic health sciences center.

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

Single-Molecule View of Small RNA-Guided Target Search and Recognition.

Science.gov (United States)

Globyte, Viktorija; Kim, Sung Hyun; Joo, Chirlmin

2018-05-20

Most everyday processes in life involve a necessity for an entity to locate its target. On a cellular level, many proteins have to find their target to perform their function. From gene-expression regulation to DNA repair to host defense, numerous nucleic acid-interacting proteins use distinct target search mechanisms. Several proteins achieve that with the help of short RNA strands known as guides. This review focuses on single-molecule advances studying the target search and recognition mechanism of Argonaute and CRISPR (clustered regularly interspaced short palindromic repeats) systems. We discuss different steps involved in search and recognition, from the initial complex prearrangement into the target-search competent state to the final proofreading steps. We focus on target search mechanisms that range from weak interactions, to one- and three-dimensional diffusion, to conformational proofreading. We compare the mechanisms of Argonaute and CRISPR with a well-studied target search system, RecA.

The Search for Another Earth

Indian Academy of Sciences (India)

IAS Admin

for our very existence in the universe. Although the search for ... confirmed planet orbiting around the solar-type star 51 Pegasi. ... for planets outside the solar system, termed as extraso- lar planets or ..... another Indian origin astrophysicist.

A grammar checker based on web searching

Directory of Open Access Journals (Sweden)

Joaquim Moré

2006-05-01

Full Text Available This paper presents an English grammar and style checker for non-native English speakers. The main characteristic of this checker is the use of an Internet search engine. As the number of web pages written in English is immense, the system hypothesises that a piece of text not found on the Web is probably badly written. The system also hypothesises that the Web will provide examples of how the content of the text segment can be expressed in a grammatically correct and idiomatic way. Thus, when the checker warns the user about the odd nature of a text segment, the Internet engine searches for contexts that can help the user decide whether he/she should correct the segment or not. By means of a search engine, the checker also suggests use of other expressions that appear on the Web more often than the expression he/she actually wrote.

Cube search, revisited

Science.gov (United States)

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

2015-01-01

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

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.

Top-k Keyword Search Over Graphs Based On Backward Search

Directory of Open Access Journals (Sweden)

Zeng Jia-Hui

2017-01-01

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

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

NARCIS (Netherlands)

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

2011-01-01

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

Analyzing the Influence of Language Proficiency on Interactive Book Search Behavior

DEFF Research Database (Denmark)

Bogers, Toine; Gäde, Maria; Hall, Mark M.

2016-01-01

English content still dominates in many online domains and information systems, despite native English speakers being a minority of its users. However, we know little about how language proficiency influences search behavior in these systems. In this paper, we describe preliminary results from an...... language constraints, a preliminary analysis of native and non-native English speakers indicate little to no meaningful differences in their search behavior.......English content still dominates in many online domains and information systems, despite native English speakers being a minority of its users. However, we know little about how language proficiency influences search behavior in these systems. In this paper, we describe preliminary results from...... an interactive IR experiment with book search behavior and examine how language skills affect this behavior. A total of 97 users from 21 different countries participated in this experiment, resulting in a rich data set including usage data as well as questionnaire feedback. Although participants reported feeling...

World Wide Web Metaphors for Search Mission Data

Science.gov (United States)

Norris, Jeffrey S.; Wallick, Michael N.; Joswig, Joseph C.; Powell, Mark W.; Torres, Recaredo J.; Mittman, David S.; Abramyan, Lucy; Crockett, Thomas M.; Shams, Khawaja S.; Fox, Jason M.;

I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis

DEFF Research Database (Denmark)

Lauritsen, Thomas; Kolenda, Thomas

2002-01-01

We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....

Market Dominance and Search Quality in the Search Engine Market

NARCIS (Netherlands)

Lianos, I.; Motchenkova, E.I.

2013-01-01

We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises

Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System

Directory of Open Access Journals (Sweden)

Yu Liu

2015-01-01

Full Text Available The Smith-Waterman (SW algorithm has been widely utilized for searching biological sequence databases in bioinformatics. Recently, several works have adopted the graphic card with Graphic Processing Units (GPUs and their associated CUDA model to enhance the performance of SW computations. However, these works mainly focused on the protein database search by using the intertask parallelization technique, and only using the GPU capability to do the SW computations one by one. Hence, in this paper, we will propose an efficient SW alignment method, called CUDA-SWfr, for the protein database search by using the intratask parallelization technique based on a CPU-GPU collaborative system. Before doing the SW computations on GPU, a procedure is applied on CPU by using the frequency distance filtration scheme (FDFS to eliminate the unnecessary alignments. The experimental results indicate that CUDA-SWfr runs 9.6 times and 96 times faster than the CPU-based SW method without and with FDFS, respectively.

Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System.

Science.gov (United States)

Liu, Yu; Hong, Yang; Lin, Chun-Yuan; Hung, Che-Lun

2015-01-01

The Smith-Waterman (SW) algorithm has been widely utilized for searching biological sequence databases in bioinformatics. Recently, several works have adopted the graphic card with Graphic Processing Units (GPUs) and their associated CUDA model to enhance the performance of SW computations. However, these works mainly focused on the protein database search by using the intertask parallelization technique, and only using the GPU capability to do the SW computations one by one. Hence, in this paper, we will propose an efficient SW alignment method, called CUDA-SWfr, for the protein database search by using the intratask parallelization technique based on a CPU-GPU collaborative system. Before doing the SW computations on GPU, a procedure is applied on CPU by using the frequency distance filtration scheme (FDFS) to eliminate the unnecessary alignments. The experimental results indicate that CUDA-SWfr runs 9.6 times and 96 times faster than the CPU-based SW method without and with FDFS, respectively.

Searching for millisecond pulsars: surveys, techniques and prospects

International Nuclear Information System (INIS)

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

2013-01-01

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

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

The search for and analysis of direct samples of early Solar System aqueous fluids.

Science.gov (United States)

Zolensky, Michael E; Bodnar, Robert J; Yurimoto, Hisayoshi; Itoh, Shoichi; Fries, Marc; Steele, Andrew; Chan, Queenie H-S; Tsuchiyama, Akira; Kebukawa, Yoko; Ito, Motoo

2017-05-28

We describe the current state of the search for direct, surviving samples of early, inner Solar System fluids-fluid inclusions in meteorites. Meteoritic aqueous fluid inclusions are not rare, but they are very tiny and their characterization is at the state of the art for most analytical techniques. Meteoritic fluid inclusions offer us a unique opportunity to study early Solar System brines in the laboratory. Inclusion-by-inclusion analyses of the trapped fluids in carefully selected samples will, in the immediate future, provide us detailed information on the evolution of fluids as they interacted with anhydrous solid materials. Thus, real data can replace calculated fluid compositions in thermochemical calculations of the evolution of water and aqueous reactions in comets, asteroids, moons and the terrestrial planets.This article is part of the themed issue 'The origin, history and role of water in the evolution of the inner Solar System'. © 2017 The Author(s).

System modelling and online optimal management of MicroGrid using Mesh Adaptive Direct Search

Energy Technology Data Exchange (ETDEWEB)

Mohamed, Faisal A. [Department of Electrical Engineering, Omar Al-Mukhtar University, P.O. Box 919, El-Bieda (Libya); Koivo, Heikki N. [Department of Automation and Systems Technology, Helsinki University of Technology, P.O. Box 5500, FIN-02015 HUT (Finland)

2010-06-15

This paper presents a generalized formulation to determine the optimal operating strategy and cost optimization scheme for a MicroGrid. Prior to the optimization of the MicroGrid itself, models for the system components are determined using real data. The proposed cost function takes into consideration the costs of the emissions, NO{sub x}, SO{sub 2}, and CO{sub 2}, start-up costs, as well as the operation and maintenance costs. A daily income and outgo from sold or purchased power is also added. The MicroGrid considered in this paper consists of a wind turbine, a micro turbine, a diesel generator, a photovoltaic array, a fuel cell, and a battery storage. In this work, the Mesh Adaptive Direct Search (MADS) algorithm is used to minimize the cost function of the system while constraining it to meet the customer demand and safety of the system. In comparison with previously proposed techniques, a significant reduction is obtained. (author)

Searching for highly entangled multi-qubit states

International Nuclear Information System (INIS)

Brown, Iain D K; Stepney, Susan; Sudbery, Anthony; Braunstein, Samuel L

2005-01-01

We present a simple numerical optimization procedure to search for highly entangled states of 2, 3, 4 and 5 qubits. We develop a computationally tractable entanglement measure based on the negative partial transpose criterion, which can be applied to quantum systems of an arbitrary number of qubits. The search algorithm attempts to optimize this entanglement cost function to find the maximal entanglement in a quantum system. We present highly entangled 4-qubit and 5-qubit states discovered by this search. We show that the 4-qubit state is not quite as entangled, according to two separate measures, as the conjectured maximally entangled Higuchi-Sudbery state. Using this measure, these states are more highly entangled than the 4-qubit and 5-qubit GHZ states. We also present a conjecture about the NPT measure, inspired by some of our numerical results, that the single-qubit reduced states of maximally entangled states are all totally mixed

INTERACTION OF SEARCH CAPABILITIES OF ELECTRONIC AND TRADITIONAL (CARD CATALOGS

Directory of Open Access Journals (Sweden)

Л. В. Головко

2017-10-01

Full Text Available Purpose. Interaction of search capabilities of electronic and traditional (card catalogs. Subject: search capabilities of electronic and traditional (card catalogs and their interaction. Goal: Creating efficient search system for library information services, updating and improving the information retrieval system. To reach this goal, following tasks are set: – to determine the possibility of parallel functioning of electronic and traditional card catalogs, and to reveal the interaction of their search capabilities by conducting a survey via questionnaire titled «Interaction of search capabilities of electronic and traditional (card catalogs»; – to find out which search systems are preferred by users; – to estimate the actual condition of search capabilities of electronic and traditional (card catalogs in the library. Methodology. On various stages of the survey the following methods were used: analysis and synthesis, comparison, generalization, primary sources search; sociological method (survey. These methods allowed determining, processing and ana lyzing the whole complex of available sources, which became an important factor of research objectivity. Finding. Survey results allowed us to analyze the dynamics of changes, new needs of the readers, and to make a decision regarding the quality improvement of information search services. Practical value. Creating a theoretical foundation for implementation of set tasks is the practical value of the acquired findings. Conclusions and results of the research can be used in university students’, postgraduates’ and professors’ information search activities. Certain results of the research are used and implemented in practice of the library of Kryvyi Rih State Pedagogical University, namely at workshops on the basics of information culture (using bibliographic reference unit, information search by key words, authors and titles via electronic catalogue. Guides for users were created. Duty

Large Neighborhood Search

DEFF Research Database (Denmark)

Pisinger, David; Røpke, Stefan

2010-01-01

Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...

Dyniqx: a novel meta-search engine for metadata based cross search

OpenAIRE

Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan

2008-01-01

The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...

Search across Different Media: Numeric Data Sets and Text Files

Directory of Open Access Journals (Sweden)

Michael Buckland

2006-12-01

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

New Searching Capability and OpenURL Linking in the ADS

Science.gov (United States)

Eichhorn, Guenther; Accomazzi, A.; Grant, C. S.; Henneken, E.; Kurtz, M. J.; Thompson, D. M.; Murray, S. S.

2006-12-01

The ADS is the search system of choice for the astronomical community. It also covers a large part of the physics and physics/astronomy education literature. In order to make access to this system as easy as possible, we developed a Google-like interface version of our search form. This one-field search parses the user input and automatically detects author names and year ranges. Firefox users can set up their browser to have this search field installed in the top right corner search field to have even easier access to the ADS search capability. The basic search is available from the ADS Homepage at: http://adsabs.harvard.edu To aid with access to subscription journals the ADS now supports OpenURL linking. If your library supports an OpenURL server, you can specify this server in the ADS preference settings. All links to journal articles will then automatically be directed to the OpenURL with the appropriate link information. We provide a selection of known OpenURL servers to choose from. If your server is not in this list, please send the necessary information to ads@cfa.harvard.edu and we will include it in our list. The ADS is funded by NASA grant NNG06GG68G.

Simplified automatic on-line document searching

International Nuclear Information System (INIS)

Ebinuma, Yukio

1983-01-01

The author proposed searching method for users who need not-comprehensive retrieval. That is to provide flexible number of related documents for the users automatically. A group of technical terms are used as search terms to express an inquiry. Logical sums of the terms in the ascending order of frequency of the usage are prepared sequentially and automatically, and then the search formulas, qsub(m) and qsub(m-1) which meet certain threshold values are selected automatically also. Users justify precision of the search output up to 20 items retrieved by the formula qsub(m). If a user wishes more than 30% of recall ratio, the serach result should be output by qsub(m), and if he wishes less than 30% of it, it should be output by qsub(m-1). The search by this method using one year volume of INIS Database (76,600 items) and five inquiries resulted in 32% of recall ratio and 36% of precision ratio on the average in the case of qsub(m). The connecting time of a terminal was within 15 minutes per an inquiry. It showed more efficiency than that of an inexperienced searcher. The method can be applied to on-line searching system for database in which natural language only or natural language and controlled vocabulary are used. (author)

Considerations for the development of task-based search engines

DEFF Research Database (Denmark)

Petcu, Paula; Dragusin, Radu

2013-01-01

Based on previous experience from working on a task-based search engine, we present a list of suggestions and ideas for an Information Retrieval (IR) framework that could inform the development of next generation professional search systems. The specific task that we start from is the clinicians......' information need in finding rare disease diagnostic hypotheses at the time and place where medical decisions are made. Our experience from the development of a search engine focused on supporting clinicians in completing this task has provided us valuable insights in what aspects should be considered...... by the developers of vertical search engines....

How to Search the Internet Archive Without Indexing It

DEFF Research Database (Denmark)

Kanhabua, Nattiya; Kemkes, Philipp; Nejdl, Wolfgang

2016-01-01

Significant parts of our cultural heritage are produced on the Web in recent years. While the easy accessibility to the current Web is a good baseline, optimal access to the past of the Web faces several challenges. This includes dealing with large-scale web archive collections, as well as lacking...... search results to the WayBack Machine; thus al- lowing keyword search on the Internet Archive without processing and indexing its raw content. Our system complements existing web archive search tools through a user interface, which comes close to the functionalities of modern web search engines (e...

Searching for integrable systems

International Nuclear Information System (INIS)

Cary, J.R.

1984-01-01

Lack of integrability leads to undesirable consequences in a number of physical systems. The lack of integrability of the magnetic field leads to enhanced particle transport in stellarators and tokamaks with tearing-mode turbulence. Limitations of the luminosity of colliding beams may be due to the onset of stochasticity. Enhanced radial transport in mirror machines caused by the lack of integrability and/or the presence of resonances may be a significant problem in future devices. To improve such systems one needs a systematic method for finding integrable systems. Of course, it is easy to find integrable systems if no restrictions are imposed; textbooks are full of such examples. The problem is to find integrable systems given a set of constraints. An example of this type of problem is that of finding integrable vacuum magnetic fields with rotational transform. The solution to this problem is relevant to the magnetic-confinement program

A genetic algorithm-based search for parametric reform alternatives for the Turkish pension system : 2005-2060

OpenAIRE

Alparslan, Mustafa Artun

2005-01-01

Ankara : The Department of Economics, Bilkent Univ., 2005. Thesis (Master's) -- Bilkent University, 2005. Includes bibliographical references leaves 54-55. In this thesis, we search for parametric reform alternatives so as to achieve a balance in the long term accumulated difference between pension expenditures and revenues of the SSI, the largest pension fund in Turkey, from 2005 to 2060. The projected worker-retiree composition of the pension system is allowed to change al...

New technique for system simplification using Cuckoo search and ESA

Indian Academy of Sciences (India)

Afzal Sikander

2017-08-17

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

SPARK: Adapting Keyword Query to Semantic Search

Science.gov (United States)

Zhou, Qi; Wang, Chong; Xiong, Miao; Wang, Haofen; Yu, Yong

Semantic search promises to provide more accurate result than present-day keyword search. However, progress with semantic search has been delayed due to the complexity of its query languages. In this paper, we explore a novel approach of adapting keywords to querying the semantic web: the approach automatically translates keyword queries into formal logic queries so that end users can use familiar keywords to perform semantic search. A prototype system named 'SPARK' has been implemented in light of this approach. Given a keyword query, SPARK outputs a ranked list of SPARQL queries as the translation result. The translation in SPARK consists of three major steps: term mapping, query graph construction and query ranking. Specifically, a probabilistic query ranking model is proposed to select the most likely SPARQL query. In the experiment, SPARK achieved an encouraging translation result.

Term Relevance Feedback and Mediated Database Searching: Implications for Information Retrieval Practice and Systems Design.

Science.gov (United States)

Spink, Amanda

1995-01-01

This study uses the human approach to examine the sources and effectiveness of search terms selected during 40 mediated interactive database searches and focuses on determining the retrieval effectiveness of search terms identified by users and intermediaries from retrieved items during term relevance feedback. (Author/JKP)

Meta Search Engines.

Science.gov (United States)

Garman, Nancy

1999-01-01

Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)

Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm

International Nuclear Information System (INIS)

Liang, Y.-C.; Chen, Y.-C.

2007-01-01

This paper presents a meta-heuristic algorithm, variable neighborhood search (VNS), to the redundancy allocation problem (RAP). The RAP, an NP-hard problem, has attracted the attention of much prior research, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. Authors' previously published work has shown promise for the variable neighborhood descent (VND) method, the simplest version among VNS variations, on RAP. The variable neighborhood search method itself has not been used in reliability design, yet it is a method that fits those combinatorial problems with potential neighborhood structures, as in the case of the RAP. Therefore, authors further extended their work to develop a VNS algorithm for the RAP and tested a set of well-known benchmark problems from the literature. Results on 33 test instances ranging from less to severely constrained conditions show that the variable neighborhood search method improves the performance of VND and provides a competitive solution quality at economically computational expense in comparison with the best-known heuristics including ant colony optimization, genetic algorithm, and tabu search

Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm

Energy Technology Data Exchange (ETDEWEB)

Liang, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: ycliang@saturn.yzu.edu.tw; Chen, Y.-C. [Department of Industrial Engineering and Management, Yuan Ze University, No 135 Yuan-Tung Road, Chung-Li, Taoyuan County, Taiwan 320 (China)]. E-mail: s927523@mail.yzu.edu.tw

2007-03-15

This paper presents a meta-heuristic algorithm, variable neighborhood search (VNS), to the redundancy allocation problem (RAP). The RAP, an NP-hard problem, has attracted the attention of much prior research, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. Authors' previously published work has shown promise for the variable neighborhood descent (VND) method, the simplest version among VNS variations, on RAP. The variable neighborhood search method itself has not been used in reliability design, yet it is a method that fits those combinatorial problems with potential neighborhood structures, as in the case of the RAP. Therefore, authors further extended their work to develop a VNS algorithm for the RAP and tested a set of well-known benchmark problems from the literature. Results on 33 test instances ranging from less to severely constrained conditions show that the variable neighborhood search method improves the performance of VND and provides a competitive solution quality at economically computational expense in comparison with the best-known heuristics including ant colony optimization, genetic algorithm, and tabu search.

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

CALIS—A CALibration Insertion System for the DarkSide-50 dark matter search experiment

Energy Technology Data Exchange (ETDEWEB)

Agnes, P.; Albuquerque, I. F. M.; Alexander, T.; Alton, A. K.; Asner, D. M.; Back, H. O.; Baldin, B.; Biery, K.; Bocci, V.; Bonfini, G.; Bonivento, W.; Bossa, M.; Bottino, B.; Brigatti, A.; Brodsky, J.; Budano, F.; Bussino, S.; Cadeddu, M.; Cadonati, L.; Cadoni, M.; Calaprice, F.; Canci, N.; Candela, A.; Caravati, M.; Cariello, M.; Carlini, M.; Catalanotti, S.; Cavalcante, P.; Chepurnov, A.; Cicalò, C.; Cocco, A. G.; Covone, G.; D' Angelo, D.; D' Incecco, M.; Davini, S.; Cecco, S. De; Deo, M. De; Vincenzi, M. De; Derbin, A.; Devoto, A.; Eusanio, F. Di; Pietro, G. Di; Dionisi, C.; Edkins, E.; Empl, A.; Fan, A.; Fiorillo, G.; Fomenko, K.; Forster, G.; Franco, D.; Gabriele, F.; Galbiati, C.; Giagu, S.; Giganti, C.; Giovanetti, G. K.; Goretti, A. M.; Granato, F.; Grandi, L.; Gromov, M.; Guan, M.; Guardincerri, Y.; Hackett, B. R.; Herner, K.; Hughes, D.; Humble, P.; Hungerford, E. V.; Ianni, Al.; Ianni, An.; James, I.; Johnson, T. N.; Jollet, C.; Keeter, K.; Kendziora, C. L.; Koh, G.; Korablev, D.; Korga, G.; Kubankin, A.; Li, X.; Lissia, M.; Loer, B.; Lombardi, P.; Longo, G.; Ma, Y.; Machado, A. A.; Machulin, I. N.; Mandarano, A.; Mari, S. M.; Maricic, J.; Marini, L.; Martoff, C. J.; Meregaglia, A.; Meyers, P. D.; Milincic, R.; Miller, J. D.; Montanari, D.; Monte, A.; Mount, B. J.; Muratova, V. N.; Musico, P.; Napolitano, J.; Agasson, A. Navrer; Odrowski, S.; Orsini, M.; Ortica, F.; Pagani, L.; Pallavicini, M.; Pantic, E.; Parmeggiano, S.; Pelczar, K.; Pelliccia, N.; Pocar, A.; Pordes, S.; Pugachev, D. A.; Qian, H.; Randle, K.; Ranucci, G.; Razeti, M.; Razeto, A.; Reinhold, B.; Renshaw, A. L.; Rescigno, M.; Riffard, Q.; Romani, A.; Rossi, B.; Rossi, N.; Rountree, D.; Sablone, D.; Saggese, P.; Saldanha, R.; Sands, W.; Savarese, C.; Schlitzer, B.; Segreto, E.; Semenov, D. A.; Shields, E.; Singh, P. N.; Skorokhvatov, M. D.; Smirnov, O.; Sotnikov, A.; Stanford, C.; Suvorov, Y.; Tartaglia, R.; Tatarowicz, J.; Testera, G.; Tonazzo, A.; Trinchese, P.; Unzhakov, E. V.; Verducci, M.; Vishneva, A.; Vogelaar, B.; Wada, M.; Walker, S.; Wang, H.; Wang, Y.; Watson, A. W.; Westerdale, S.; Wilhelmi, J.; Wojcik, M. M.; Xiang, Xi.; Xiao, X.; Xu, J.; Yang, C.; Zec, A.; Zhong, W.; Zhu, C.; Zuzel, G.

2017-12-01

This paper describes the design, fabrication, commissioning and use of a CALibration source Insertion System (CALIS) in the DarkSide-50 direct dark matter search experiment. CALIS deploys radioactive sources into the liquid scintillator veto to characterize the detector response and detection efficiency of the DarkSide-50 Liquid Argon Time Projection Chamber, and the surrounding 30 t organic liquid scintillator neutron veto. It was commissioned in September 2014 and has been used successfully in several gamma and neutron source campaigns since then. A description of the hardware and an excerpt of calibration analysis results are given below.

Evaluation of diffusion-tensor imaging-based global search and tractography for tumor surgery close to the language system.

Directory of Open Access Journals (Sweden)

Mirco Richter

Full Text Available Pre-operative planning and intra-operative guidance in neurosurgery require detailed information about the location of functional areas and their anatomo-functional connectivity. In particular, regarding the language system, post-operative deficits such as aphasia can be avoided. By combining functional magnetic resonance imaging and diffusion tensor imaging, the connectivity between functional areas can be reconstructed by tractography techniques that need to cope with limitations such as limited resolution and low anisotropic diffusion close to functional areas. Tumors pose particular challenges because of edema, displacement effects on brain tissue and infiltration of white matter. Under these conditions, standard fiber tracking methods reconstruct pathways of insufficient quality. Therefore, robust global or probabilistic approaches are required. In this study, two commonly used standard fiber tracking algorithms, streamline propagation and tensor deflection, were compared with a previously published global search, Gibbs tracking and a connection-oriented probabilistic tractography approach. All methods were applied to reconstruct neuronal pathways of the language system of patients undergoing brain tumor surgery, and control subjects. Connections between Broca and Wernicke areas via the arcuate fasciculus (AF and the inferior fronto-occipital fasciculus (IFOF were validated by a clinical expert to ensure anatomical feasibility, and compared using distance- and diffusion-based similarity metrics to evaluate their agreement on pathway locations. For both patients and controls, a strong agreement between all methods was observed regarding the location of the AF. In case of the IFOF however, standard fiber tracking and Gibbs tracking predominantly identified the inferior longitudinal fasciculus that plays a secondary role in semantic language processing. In contrast, global search resolved connections in almost every case via the IFOF which

The MediaMill TRECVID 2010 semantic video search engine

NARCIS (Netherlands)

Snoek, C.G.M.; van de Sande, K.E.A.; de Rooij, O.; Huurnink, B.; Gavves, E.; Odijk, D.; de Rijke, M.; Gevers, T.; Worring, M.; Koelma, D.C.; Smeulders, A.W.M.

2010-01-01

In this paper we describe our TRECVID 2010 video retrieval experiments. The MediaMill team participated in three tasks: semantic indexing, known-item search, and instance search. The starting point for the MediaMill concept detection approach is our top-performing bag-of-words system of TRECVID

Overview of the CLEF 2016 Social Book Search Lab

DEFF Research Database (Denmark)

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

2016-01-01

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

Search of medical literature for indoor carbon monoxide exposure

Energy Technology Data Exchange (ETDEWEB)

Brennan, T.; Ivanovich, M.

1995-12-01

This report documents a literature search on carbon monoxide. The search was limited to the medical and toxicological databases at the National Library of Medicine (MEDLARS). The databases searched were Medline, Toxline and TOXNET. Searches were performed using a variety of strategies. Combinations of the following keywords were used: carbon, monoxide, accidental, residential, occult, diagnosis, misdiagnosis, heating, furnace, and indoor. The literature was searched from 1966 to the present. Over 1000 references were identified and summarized using the following abbreviations: The major findings of the search are: (1) Acute and subacute carbon monoxide exposures result in a large number of symptoms affecting the brain, kidneys, respiratory system, retina, and motor functions. (2) Acute and subacute carbon monoxide (CO) poisonings have been misdiagnosed on many occasions. (3) Very few systematic investigations have been made into the frequency and consequences of carbon monoxide poisonings.

Faceted Search

CERN Document Server

Tunkelang, Daniel

2009-01-01

We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

NATO Advanced Research Institute on Search Theory and Applications

CERN Document Server

Stone, Lawrence

1980-01-01

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

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.

TCSC based automatic generation control of deregulated power system using quasi-oppositional harmony search algorithm

Directory of Open Access Journals (Sweden)

Mahendra Nandi

2017-08-01

Full Text Available In present aspect, automatic generation control (AGC of deregulated power system with thyristor controlled series compensator (TCSC device is investigated. The objective is to discuss bilateral power transaction issue with the TCSC effect. A deregulated two-area power system model having two thermal units in each control area is considered for this act. A quasi-oppositional harmony search (QOHS algorithm is being applied for the constrained optimization problem. Three cases, commonly studied in deregulation, are discussed for the effectiveness of the proposed technique. Further, sensitivity analysis is studied by varying the test system parameters up to ±25% from their rated values. The obtained simulation plots are analytically discussed with the calculation of oscillatory modes, transient details and the studied performance indices. Sugeno fuzzy logic control technique is also investigated to the studied test system. The simulation results show that the proposed QOHS based TCSC controller is quite effective in deregulated environment.

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.

The sequence coding and search system: An approach for constructing and analyzing event sequences at commercial nuclear power plants

International Nuclear Information System (INIS)

Mays, G.T.

1989-04-01

The US Nuclear Regulatory Commission (NRC) has recognized the importance of the collection, assessment, and feedstock of operating experience data from commercial nuclear power plants and has centralized these activities in the Office for Analysis and Evaluation of Operational Data (AEOD). Such data is essential for performing safety and reliability analyses, especially analyses of trends and patterns to identify undesirable changes in plant performance at the earliest opportunity to implement corrective measures to preclude the occurrences of a more serious event. One of NRC's principal tools for collecting and evaluating operating experience data is the Sequence Coding and Search System (SCSS). The SCSS consists of a methodology for structuring event sequences and the requisite computer system to store and search the data. The source information for SCSS is the Licensee Event Report (LER), which is a legally required document. This paper describes the objective SCSS, the information it contains, and the format and approach for constructuring SCSS event sequences. Examples are presented demonstrating the use SCSS to support the analysis of LER data. The SCSS contains over 30,000 LERs describing events from 1980 through the present. Insights gained from working with a complex data system from the initial developmental stage to the point of a mature operating system are highlighted

Search costs and efficiency : Do unemployed workers search enough?

NARCIS (Netherlands)

Gautier, Pieter A.; Moraga González, José; Wolthoff, Ronald P.

Many labor market policies affect the marginal benefits and costs of job search. The impact and desirability of such policies depend on the distribution of search costs. In this paper, we provide an equilibrium framework for identifying the distribution of search costs and we apply it to the Dutch

The Electronics and Data Acquisition System of the DarkSide Dark Matter Search

Energy Technology Data Exchange (ETDEWEB)

Agnes, P.; et al.

2014-12-09

It is generally inferred from astronomical measurements that Dark Matter (DM) comprises approximately 27\\% of the energy-density of the universe. If DM is a subatomic particle, a possible candidate is a Weakly Interacting Massive Particle (WIMP), and the DarkSide-50 (DS) experiment is a direct search for evidence of WIMP-nuclear collisions. DS is located underground at the Laboratori Nazionali del Gran Sasso (LNGS) in Italy, and consists of three active, embedded components; an outer water veto (CTF), a liquid scintillator veto (LSV), and a liquid argon (LAr) time projection chamber (TPC). This paper describes the data acquisition and electronic systems of the DS detectors, designed to detect the residual ionization from such collisions.

VisualRank: applying PageRank to large-scale image search.

Science.gov (United States)

Jing, Yushi; Baluja, Shumeet

2008-11-01

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

Description and search labor for information retrieval

OpenAIRE

Warner, Julian

2007-01-01

Selection power is taken as the fundamental value for information retrieval systems. Selection power is regarded as produced by selection labor, which itself separates historically into description and search labor. As forms of mental labor, description and search labor participate in the conditions for labor and for mental labor. Concepts and distinctions applicable to physical and mental labor are indicated, introducing the necessity of labor for survival, the idea of technology as a human ...

How doctors search

DEFF Research Database (Denmark)

Lykke, Marianne; Price, Susan; Delcambre, Lois

2012-01-01

Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...

Web Search Engines

OpenAIRE

Rajashekar, TB

1998-01-01

The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

Exposure to arousal-inducing sounds facilitates visual search.

Science.gov (United States)

Asutay, Erkin; Västfjäll, Daniel

2017-09-04

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

Optimal Labour Taxation and Search

NARCIS (Netherlands)

Boone, J.; Bovenberg, A.L.

2000-01-01

This paper explores the optimal role of the tax system in alleviating labour-market imperfections, raising revenue, and correcting the income distribution. For this purpose, the standard search model of the labour market is extended by introducing non-linear vacancy costs due to scarce

Balancing Efficiency and Effectiveness for Fusion-Based Search Engines in the "Big Data" Environment

Science.gov (United States)

Li, Jieyu; Huang, Chunlan; Wang, Xiuhong; Wu, Shengli

2016-01-01

Introduction: In the big data age, we have to deal with a tremendous amount of information, which can be collected from various types of sources. For information search systems such as Web search engines or online digital libraries, the collection of documents becomes larger and larger. For some queries, an information search system needs to…

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)

Identifying a "default" visual search mode with operant conditioning.

Science.gov (United States)

Kawahara, Jun-ichiro

2010-09-01

The presence of a singleton in a task-irrelevant domain can impair visual search. This impairment, known as the attentional capture depends on the set of participants. When narrowly searching for a specific feature (the feature search mode), only matching stimuli capture attention. When searching broadly (the singleton detection mode), any oddball captures attention. The present study examined which strategy represents the "default" mode using an operant conditioning approach in which participants were trained, in the absence of explicit instructions, to search for a target in an ambiguous context in which one of two modes was available. The results revealed that participants behaviorally adopted the singleton detection as the default mode but reported using the feature search mode. Conscious strategies did not eliminate capture. These results challenge the view that a conscious set always modulates capture, suggesting that the visual system tends to rely on stimulus salience to deploy attention.

NASA Taxonomies for Searching Problem Reports and FMEAs

Science.gov (United States)

Malin, Jane T.; Throop, David R.

2006-01-01

Many types of hazard and risk analyses are used during the life cycle of complex systems, including Failure Modes and Effects Analysis (FMEA), Hazard Analysis, Fault Tree and Event Tree Analysis, Probabilistic Risk Assessment, Reliability Analysis and analysis of Problem Reporting and Corrective Action (PRACA) databases. The success of these methods depends on the availability of input data and the analysts knowledge. Standard nomenclature can increase the reusability of hazard, risk and problem data. When nomenclature in the source texts is not standard, taxonomies with mapping words (sets of rough synonyms) can be combined with semantic search to identify items and tag them with metadata based on a rich standard nomenclature. Semantic search uses word meanings in the context of parsed phrases to find matches. The NASA taxonomies provide the word meanings. Spacecraft taxonomies and ontologies (generalization hierarchies with attributes and relationships, based on terms meanings) are being developed for types of subsystems, functions, entities, hazards and failures. The ontologies are broad and general, covering hardware, software and human systems. Semantic search of Space Station texts was used to validate and extend the taxonomies. The taxonomies have also been used to extract system connectivity (interaction) models and functions from requirements text. Now the Reconciler semantic search tool and the taxonomies are being applied to improve search in the Space Shuttle PRACA database, to discover recurring patterns of failure. Usual methods of string search and keyword search fall short because the entries are terse and have numerous shortcuts (irregular abbreviations, nonstandard acronyms, cryptic codes) and modifier words cannot be used in sentence context to refine the search. The limited and fixed FMEA categories associated with the entries do not make the fine distinctions needed in the search. The approach assigns PRACA report titles to problem classes in

Stochastic search techniques for post-fault restoration of electrical ...

Indian Academy of Sciences (India)

Three stochastic search techniques have been used to find the optimal sequence of operations required to restore supply in an electrical distribution system on the occurrence of a fault. The three techniques are the genetic algorithm,simulated annealing and the tabu search. The performance of these techniques has been ...

CMSMAP : oil, chemical, search and rescue, and marine emergency response crisis management system

International Nuclear Information System (INIS)

Anderson, E.L.; Howlett, E.; Galagan, C.; Giguere, T.; Wee, F.; Chong, J.

2002-01-01

This paper describes a newly developed Crisis Management System (CMS) which makes it possible to view oil and chemical spills on the seafloor. The CMS is designed to run in a network environment, so that multiple stations can be used cooperatively to respond to a spill incident. It was developed by the Maritime and Port Authority in Singapore and represents a singular integration of a ship's bridge simulator hardware and software. It incorporates numerical models and emergency response software. The CMS is installed in a specifically designed building at the Singapore Polytechnic University, and is integrated with two shipping bridge simulators. One user interface has access to models dealing with oil spills, chemical spills, search and rescues, marine emergencies, and nuclear disasters. The interface is linked to a response management system. The entire system is used to train response personnel to marine emergencies. The histories and costs of planned response activities are described and logged for reference purposes. Estimates of damages associated with spills can be obtained. Alternative response plans can also be determined. Further research in 2002 will focus on developing real time response. 3 refs., 6 figs

Ordered Consumer Search

OpenAIRE

Armstrong, Mark

2016-01-01

The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...

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

OpenAIRE

Wang, J. Z.

2000-01-01

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

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.

Completeness and overlap in open access systems: Search engines, aggregate institutional repositories and physics-related open sources.

Science.gov (United States)

Tsay, Ming-Yueh; Wu, Tai-Luan; Tseng, Ling-Li

2017-01-01

This study examines the completeness and overlap of coverage in physics of six open access scholarly communication systems, including two search engines (Google Scholar and Microsoft Academic), two aggregate institutional repositories (OAIster and OpenDOAR), and two physics-related open sources (arXiv.org and Astrophysics Data System). The 2001-2013 Nobel Laureates in Physics served as the sample. Bibliographic records of their publications were retrieved and downloaded from each system, and a computer program was developed to perform the analytical tasks of sorting, comparison, elimination, aggregation and statistical calculations. Quantitative analyses and cross-referencing were performed to determine the completeness and overlap of the system coverage of the six open access systems. The results may enable scholars to select an appropriate open access system as an efficient scholarly communication channel, and academic institutions may build institutional repositories or independently create citation index systems in the future. Suggestions on indicators and tools for academic assessment are presented based on the comprehensiveness assessment of each system.

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.

New reference trajectory optimization algorithm for a flight management system inspired in beam search

Directory of Open Access Journals (Sweden)

Alejandro MURRIETA-MENDOZA

2017-08-01

Full Text Available With the objective of reducing the flight cost and the amount of polluting emissions released in the atmosphere, a new optimization algorithm considering the climb, cruise and descent phases is presented for the reference vertical flight trajectory. The selection of the reference vertical navigation speeds and altitudes was solved as a discrete combinatory problem by means of a graph-tree passing through nodes using the beam search optimization technique. To achieve a compromise between the execution time and the algorithm’s ability to find the global optimal solution, a heuristic methodology introducing a parameter called “optimism coefficient was used in order to estimate the trajectory’s flight cost at every node. The optimal trajectory cost obtained with the developed algorithm was compared with the cost of the optimal trajectory provided by a commercial flight management system(FMS. The global optimal solution was validated against an exhaustive search algorithm(ESA, other than the proposed algorithm. The developed algorithm takes into account weather effects, step climbs during cruise and air traffic management constraints such as constant altitude segments, constant cruise Mach, and a pre-defined reference lateral navigation route. The aircraft fuel burn was computed using a numerical performance model which was created and validated using flight test experimental data.

Phased searching with NEAT in a time-scaled framework: experiments on a computer-aided detection system for lung nodules.

Science.gov (United States)

Tan, Maxine; Deklerck, Rudi; Cornelis, Jan; Jansen, Bart

2013-11-01

In the field of computer-aided detection (CAD) systems for lung nodules in computed tomography (CT) scans, many image features are presented and many artificial neural network (ANN) classifiers with various structural topologies are analyzed; frequently, the classifier topologies are selected by trial-and-error experiments. To avoid these trial and error approaches, we present a novel classifier that evolves ANNs using genetic algorithms, called "Phased Searching with NEAT in a Time or Generation-Scaled Framework", integrating feature selection with the classification task. We analyzed our method's performance on 360 CT scans from the public Lung Image Database Consortium database. We compare our method's performance with other more-established classifiers, namely regular NEAT, Feature-Deselective NEAT (FD-NEAT), fixed-topology ANNs, and support vector machines (SVMs) using ten-fold cross-validation experiments of all 360 scans. The results show that the proposed "Phased Searching" method performs better and faster than regular NEAT, better than FD-NEAT, and achieves sensitivities at 3 and 4 false positives (FP) per scan that are comparable with the fixed-topology ANN and SVM classifiers, but with fewer input features. It achieves a detection sensitivity of 83.0±9.7% with an average of 4FP/scan, for nodules with a diameter greater than or equal to 3mm. It also evolves networks with shorter evolution times and with lower complexities than regular NEAT (p=0.026 and pNEAT and by our approach shows that our approach searches for good solutions in lower dimensional search spaces, and evolves networks without superfluous structure. We have presented a novel approach that combines feature selection with the evolution of ANN topology and weights. Compared with the original threshold-based Phased Searching method of Green, our method requires fewer parameters and converges to the optimal network complexity required for the classification task at hand. The results of the

Meta-Search Utilizing Evolitionary Recommendation: A Web Search Architecture Proposal

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Keyhanipour, A.; Krömer, P.; Moshiri, B.; Owais, S.; Snášel, V.

2008-01-01

Roč. 33, - (2008), s. 189-200 ISSN 1870-4069 Institutional research plan: CEZ:AV0Z10300504 Keywords : web search * meta-search engine * intelligent re-ranking * ordered weighted averaging * Boolean search queries optimizing Subject RIV: IN - Informatics, Computer Science

Intrinsic position uncertainty impairs overt search performance.

Science.gov (United States)

Semizer, Yelda; Michel, Melchi M

2017-08-01

Uncertainty regarding the position of the search target is a fundamental component of visual search. However, due to perceptual limitations of the human visual system, this uncertainty can arise from intrinsic, as well as extrinsic, sources. The current study sought to characterize the role of intrinsic position uncertainty (IPU) in overt visual search and to determine whether it significantly limits human search performance. After completing a preliminary detection experiment to characterize sensitivity as a function of visual field position, observers completed a search task that required localizing a Gabor target within a field of synthetic luminance noise. The search experiment included two clutter conditions designed to modulate the effect of IPU across search displays of varying set size. In the Cluttered condition, the display was tiled uniformly with feature clutter to maximize the effects of IPU. In the Uncluttered condition, the clutter at irrelevant locations was removed to attenuate the effects of IPU. Finally, we derived an IPU-constrained ideal searcher model, limited by the IPU measured in human observers. Ideal searchers were simulated based on the detection sensitivity and fixation sequences measured for individual human observers. The IPU-constrained ideal searcher predicted performance trends similar to those exhibited by the human observers. In the Uncluttered condition, performance decreased steeply as a function of increasing set size. However, in the Cluttered condition, the effect of IPU dominated and performance was approximately constant as a function of set size. Our findings suggest that IPU substantially limits overt search performance, especially in crowded displays.

Expedite random structure searching using objects from Wyckoff positions

Science.gov (United States)

Wang, Shu-Wei; Hsing, Cheng-Rong; Wei, Ching-Ming

2018-02-01

Random structure searching has been proved to be a powerful approach to search and find the global minimum and the metastable structures. A true random sampling is in principle needed yet it would be highly time-consuming and/or practically impossible to find the global minimum for the complicated systems in their high-dimensional configuration space. Thus the implementations of reasonable constraints, such as adopting system symmetries to reduce the independent dimension in structural space and/or imposing chemical information to reach and relax into low-energy regions, are the most essential issues in the approach. In this paper, we propose the concept of "object" which is either an atom or composed of a set of atoms (such as molecules or carbonates) carrying a symmetry defined by one of the Wyckoff positions of space group and through this process it allows the searching of global minimum for a complicated system to be confined in a greatly reduced structural space and becomes accessible in practice. We examined several representative materials, including Cd3As2 crystal, solid methanol, high-pressure carbonates (FeCO3), and Si(111)-7 × 7 reconstructed surface, to demonstrate the power and the advantages of using "object" concept in random structure searching.

D0-D4 brane tachyon condensation to a BPS state and its excitation spectrum in noncommutative super Yang-Mills theory

International Nuclear Information System (INIS)

Wimmer, Robert

2005-01-01

We investigate the D0-D4-brane system for different B-field backgrounds including the small instanton singularity in noncommutative SYM theory. We discuss the excitation spectrum of the unstable state as well as for the BPS D0-D4 bound state. We compute the tachyon potential which reproduces the complete mass defect. The relevant degrees of freedom are the massless (4,4) strings. Both results are in contrast with existing string field theory calculations. The excitation spectrum of the small instanton is found to be equal to the excitation spectrum of the fluxon solution on R θ 2 x R which we trace back to T-duality. For the effective theory of the (0,0) string excitations we obtain a BFSS matrix model. The number of states in the instanton background changes significantly when the B-field becomes self-dual. This leads us to the proposal of the existence of a phase transition or cross over at self-dual B-field

Making Temporal Search More Central in Spatial Data Infrastructures

Science.gov (United States)

Corti, P.; Lewis, B.

2017-10-01

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

The Effects of Preference for Information on Consumers’ Online Health Information Search Behavior

Science.gov (United States)

2013-01-01

Background Preference for information is a personality trait that affects people’s tendency to seek information in health-related situations. Prior studies have focused primarily on investigating its impact on patient-provider communication and on the implications for designing information interventions that prepare patients for medical procedures. Few studies have examined its impact on general consumers’ interactions with Web-based search engines for health information or the implications for designing more effective health information search systems. Objective This study intends to fill this gap by investigating the impact of preference for information on the search behavior of general consumers seeking health information, their perceptions of search tasks (representing information needs), and user experience with search systems. Methods Forty general consumers who had previously searched for health information online participated in the study in our usability lab. Preference for information was measured using Miller’s Monitor-Blunter Style Scale (MBSS) and the Krantz Health Opinion Survey-Information Scale (KHOS-I). Each participant completed four simulated health information search tasks: two look-up (fact-finding) and two exploratory. Their behaviors while interacting with the search systems were automatically logged and ratings of their perceptions of tasks and user experience with the systems were collected using Likert-scale questionnaires. Results The MBSS showed low reliability with the participants (Monitoring subscale: Cronbach alpha=.53; Blunting subscale: Cronbach alpha=.35). Thus, no further analyses were performed based on the scale. KHOS-I had sufficient reliability (Cronbach alpha=.77). Participants were classified into low- and high-preference groups based on their KHOS-I scores. The high-preference group submitted significantly shorter queries when completing the look-up tasks (P=.02). The high-preference group made a significantly higher

The effects of preference for information on consumers' online health information search behavior.

Science.gov (United States)

Zhang, Yan

2013-11-26

Preference for information is a personality trait that affects people's tendency to seek information in health-related situations. Prior studies have focused primarily on investigating its impact on patient-provider communication and on the implications for designing information interventions that prepare patients for medical procedures. Few studies have examined its impact on general consumers' interactions with Web-based search engines for health information or the implications for designing more effective health information search systems. This study intends to fill this gap by investigating the impact of preference for information on the search behavior of general consumers seeking health information, their perceptions of search tasks (representing information needs), and user experience with search systems. Forty general consumers who had previously searched for health information online participated in the study in our usability lab. Preference for information was measured using Miller's Monitor-Blunter Style Scale (MBSS) and the Krantz Health Opinion Survey-Information Scale (KHOS-I). Each participant completed four simulated health information search tasks: two look-up (fact-finding) and two exploratory. Their behaviors while interacting with the search systems were automatically logged and ratings of their perceptions of tasks and user experience with the systems were collected using Likert-scale questionnaires. The MBSS showed low reliability with the participants (Monitoring subscale: Cronbach alpha=.53; Blunting subscale: Cronbach alpha=.35). Thus, no further analyses were performed based on the scale. KHOS-I had sufficient reliability (Cronbach alpha=.77). Participants were classified into low- and high-preference groups based on their KHOS-I scores. The high-preference group submitted significantly shorter queries when completing the look-up tasks (P=.02). The high-preference group made a significantly higher percentage of parallel movements in query

Search for extraterrestrial intelligence (SETI)

International Nuclear Information System (INIS)

Morrison, P.; Billingham, J.; Wolfe, J.

1977-01-01

Findings are presented of a series of workshops on the existence of extraterrestrial intelligent life and ways in which extraterrestrial intelligence might be detected. The coverage includes the cosmic and cultural evolutions, search strategies, detection of other planetary systems, alternate methods of communication, and radio frequency interference. 17 references

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

Science.gov (United States)

Vighneshvel, T.; Arun, S. P.

2013-01-01

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

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

Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries

Directory of Open Access Journals (Sweden)

Neil eBruce

2011-07-01

Full Text Available In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in the primate brain. This includes a detailed look at the role that stimulus familiarity plays in the determination of search performance. Overall, we demonstrate that all of these asymmetries have a common origin, namely, they are a consequence of the encoding that appears in the visual cortex. The analysis associated with these cases yields insight into the problem of visual search in general and predictions of novel search asymmetries.

evaluating search effectiveness of some selected search engines

African Journals Online (AJOL)

Precision, relative recall and response time were considered for this ... a total of 24 search queries were sampled based on information queries, .... searching process and results, although there are other ... Q3.2 Software prototype model.

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

Science.gov (United States)

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

2016-01-01

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

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.

Quantifying retrieval bias in Web archive search

NARCIS (Netherlands)

Samar, Thaer; Traub, Myriam C.; van Ossenbruggen, Jacco; Hardman, Lynda; de Vries, Arjen P.

2018-01-01

A Web archive usually contains multiple versions of documents crawled from the Web at different points in time. One possible way for users to access a Web archive is through full-text search systems. However, previous studies have shown that these systems can induce a bias, known as the

Optimal Pipe Size Design for Looped Irrigation Water Supply System Using Harmony Search: Saemangeum Project Area

Science.gov (United States)

Lee, Ho Min; Sadollah, Ali

2015-01-01

Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6). The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply. PMID:25874252

Optimal Pipe Size Design for Looped Irrigation Water Supply System Using Harmony Search: Saemangeum Project Area

Directory of Open Access Journals (Sweden)

Do Guen Yoo

2015-01-01

Full Text Available Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6. The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply.

Sequential fault diagnosis for mechatronics system using diagnostic hybrid bond graph and composite harmony search

Directory of Open Access Journals (Sweden)

Ming Yu

2015-12-01

Full Text Available This article proposes a sequential fault diagnosis method to handle asynchronous distinct faults using diagnostic hybrid bond graph and composite harmony search. The faults under consideration include fault mode, abrupt fault, and intermittent fault. The faults can occur in different time instances, which add to the difficulty of decision making for fault diagnosis. This is because the earlier occurred fault can exhibit fault symptom which masks the fault symptom of latter occurred fault. In order to solve this problem, a sequential identification algorithm is developed in which the identification task is reactivated based on two conditions. The first condition is that the latter occurred fault has at least one inconsistent coherence vector element which is consistent in coherence vector of the earlier occurred fault, and the second condition is that the existing fault coherence vector has the ability to hide other faults and the second-level residual exceeds the threshold. A new composite harmony search which is capable of handling continuous variables and binary variables simultaneously is proposed for identification purpose. Experiments on a mobile robot system are conducted to assess the proposed sequential fault diagnosis algorithm.

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

Fault-tolerant search algorithms reliable computation with unreliable information

CERN Document Server

Cicalese, Ferdinando

2013-01-01

Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context of search find application in the most diverse areas of computer science and discrete mathematics. On the other hand, fault-tolerance is a necessary ingredient of computing. Due to their inherent complexity, information systems are naturally prone to errors, which may appear at any level - as imprecisions in the data, bugs in the software, or transient or permanent hardware failures. This book pr

COBRA: a Bayesian approach to pulsar searching

Science.gov (United States)

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

2018-02-01

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

Merged Search Algorithms for Radio Frequency Identification Anticollision

Directory of Open Access Journals (Sweden)

Bih-Yaw Shih

2012-01-01

The arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem with the existence of multiple tags in the interrogation field of a transponder. A splitting algorithm which is called Binary Search Tree (BST is well known for multitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is proposed to capture identification codes correctly for anticollision. Performance of the proposed algorithm is compared with the original BST according to time and power consumed during the arbitration process. The results show that the proposed model can reduce searching time and power consumed to achieve a better performance arbitration.

Search strategies on the Internet: general and specific.

Science.gov (United States)

Bottrill, Krys

2004-06-01

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

XSemantic: An Extension of LCA Based XML Semantic Search

Science.gov (United States)

Supasitthimethee, Umaporn; Shimizu, Toshiyuki; Yoshikawa, Masatoshi; Porkaew, Kriengkrai

One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge of XML structure or learning a new user interface. However, the keyword search is ambiguous. The users may use different terms to search for the same information. Furthermore, it is difficult for a system to decide which node is likely to be chosen as a return node and how much information should be included in the result. To address these challenges, we propose an XML semantic search based on keywords called XSemantic. On the one hand, we give three definitions to complete in terms of semantics. Firstly, the semantic term expansion, our system is robust from the ambiguous keywords by using the domain ontology. Secondly, to return semantic meaningful answers, we automatically infer the return information from the user queries and take advantage of the shortest path to return meaningful connections between keywords. Thirdly, we present the semantic ranking that reflects the degree of similarity as well as the semantic relationship so that the search results with the higher relevance are presented to the users first. On the other hand, in the LCA and the proximity search approaches, we investigated the problem of information included in the search results. Therefore, we introduce the notion of the Lowest Common Element Ancestor (LCEA) and define our simple rule without any requirement on the schema information such as the DTD or XML Schema. The first experiment indicated that XSemantic not only properly infers the return information but also generates compact meaningful results. Additionally, the benefits of our proposed semantics are demonstrated by the second experiment.

Improving e-book access via a library-developed full-text search tool.

Science.gov (United States)

Foust, Jill E; Bergen, Phillip; Maxeiner, Gretchen L; Pawlowski, Peter N

2007-01-01

This paper reports on the development of a tool for searching the contents of licensed full-text electronic book (e-book) collections. The Health Sciences Library System (HSLS) provides services to the University of Pittsburgh's medical programs and large academic health system. The HSLS has developed an innovative tool for federated searching of its e-book collections. Built using the XML-based Vivísimo development environment, the tool enables a user to perform a full-text search of over 2,500 titles from the library's seven most highly used e-book collections. From a single "Google-style" query, results are returned as an integrated set of links pointing directly to relevant sections of the full text. Results are also grouped into categories that enable more precise retrieval without reformulation of the search. A heuristic evaluation demonstrated the usability of the tool and a web server log analysis indicated an acceptable level of usage. Based on its success, there are plans to increase the number of online book collections searched. This library's first foray into federated searching has produced an effective tool for searching across large collections of full-text e-books and has provided a good foundation for the development of other library-based federated searching products.

Computer Algorithms in the Search for Unrelated Stem Cell Donors

Directory of Open Access Journals (Sweden)

David Steiner

2012-01-01

Full Text Available Hematopoietic stem cell transplantation (HSCT is a medical procedure in the field of hematology and oncology, most often performed for patients with certain cancers of the blood or bone marrow. A lot of patients have no suitable HLA-matched donor within their family, so physicians must activate a “donor search process” by interacting with national and international donor registries who will search their databases for adult unrelated donors or cord blood units (CBU. Information and communication technologies play a key role in the donor search process in donor registries both nationally and internationaly. One of the major challenges for donor registry computer systems is the development of a reliable search algorithm. This work discusses the top-down design of such algorithms and current practice. Based on our experience with systems used by several stem cell donor registries, we highlight typical pitfalls in the implementation of an algorithm and underlying data structure.

A Search for Life in the Subsurface At Rio Tinto Spain, An Analog To Searching For Life On Mars.

Science.gov (United States)

Stoker, C. R.

2003-12-01

Most familiar life forms on Earth live in the surface biosphere where liquid water, sunlight, and the essential chemical elements for life are abundant. However, such environments are not found on Mars or anywhere else in the solar system. On Mars, the surface environmental conditions of pressure and temperature prevent formation of liquid water. Furthermore, conditions at the Martian surface are unfavorable to life due to intense ultraviolet radiation and strong oxidizing compounds that destroy organic compounds. However, subsurface liquid water on Mars has been predicted on theoretical grounds. The recent discovery of near surface ground ice by the Mars Odyssey mission, and the abundant evidence for recent Gully features observed by the Mars Global Surveyor mission strengthen the case for subsurface liquid water on Mars. Thus, the strategy for searching for life on Mars points to drilling to the depth of liquid water, bringing samples to the surface and analyzing them with instrumentation to detect in situ organisms and biomarker compounds. The MARTE (Mars Astrobiology Research and Technology Experiment) project is a field experiment focused on searching for a hypothesized subsurface anaerobic chemoautotrophic biosphere in the region of the Rio Tinto, a river in southwestern Spain while also demonstrating technology relevant to searching for a subsurface biosphere on Mars. The Tinto river is located in the Iberian Pyrite belt, one of the largest deposits of sulfide minerals in the world. The surface (river) system is an acidic extreme environment produced and maintained by microbes that metabolize sulfide minerals and produce sulfuric acid as a byproduct. Evidence suggests that the river is a surface manifestation of an underground biochemical reactor. Organisms found in the river are capable of chemoautotrophic metabolism using sulfide and ferric iron mineral substrates, suggesting these organisms could thrive in groundwater which is the source of the Rio Tinto

SP-100 shield design automation process using expert system and heuristic search techniques

International Nuclear Information System (INIS)

Marcille, T.F.; Protsik, R.; Deane, N.A.; Hoover, D.G.

1993-01-01

The SP-100 shield subsystem design process has been modified to utilize the GE Corporate Reserch and Development program, ENGINEOUS (Tong 1990). ENGINEOUS is a software system that automates the use of Computer Aided Engineering (CAE) analysis programs in the engineering design process. The shield subsystem design process incorporates a nuclear subsystems design and performance code, a two-dimensional neutral particle transport code, several input processors and two general purpose neutronic output processors. Coupling these programs within ENGINEOUS provides automatic transition paths between applications, with no source code modifications. ENGINEOUS captures human design knowledge, as well as information about the specific CAE applications and stores this information in knowledge base files. The knowledge base information is used by the ENGINEOUS expert system to drive knowledge directed and knowledge supplemented search modules to find an optimum shield design for a given reactor definition, ensuring that specified constraints are satisfied. Alternate designs, not accommodated in the optimization design rules, can readily be explored through the use of a parametric study capability

Human Detection and Classification of Landing Sites for Search and Rescue Drones

NARCIS (Netherlands)

N. Martins, Felipe; de Groot, Marc; Stokkel, Xeryus; Wiering, Marco

2016-01-01

Search and rescue is often time and labour intensive. We present a system to be used in drones to make search and rescue operations more effective. The system uses a drone downward facing camera to detect people and to evaluate potential sites as being safe or not for the drone to land. Histogram of

Beyond MEDLINE for literature searches.

Science.gov (United States)

Conn, Vicki S; Isaramalai, Sang-arun; Rath, Sabyasachi; Jantarakupt, Peeranuch; Wadhawan, Rohini; Dash, Yashodhara

2003-01-01

To describe strategies for a comprehensive literature search. MEDLINE searches result in limited numbers of studies that are often biased toward statistically significant findings. Diversified search strategies are needed. Empirical evidence about the recall and precision of diverse search strategies is presented. Challenges and strengths of each search strategy are identified. Search strategies vary in recall and precision. Often sensitivity and specificity are inversely related. Valuable search strategies include examination of multiple diverse computerized databases, ancestry searches, citation index searches, examination of research registries, journal hand searching, contact with the "invisible college," examination of abstracts, Internet searches, and contact with sources of synthesized information. Extending searches beyond MEDLINE enables researchers to conduct more systematic comprehensive searches.

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

Needle Custom Search: Recall-oriented search on the Web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon; de Rijke, Maarten; Kenter, Tom; de Vries, A.P.; Zhai, Chen Xiang; de Jong, Franciska M.G.; Radinsky, Kira; Hofmann, Katja

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Needle Custom Search : Recall-oriented search on the web using semantic annotations

NARCIS (Netherlands)

Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.

2014-01-01

Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency

Variability of patient spine education by Internet search engine.

Science.gov (United States)

Ghobrial, George M; Mehdi, Angud; Maltenfort, Mitchell; Sharan, Ashwini D; Harrop, James S

2014-03-01

Patients are increasingly reliant upon the Internet as a primary source of medical information. The educational experience varies by search engine, search term, and changes daily. There are no tools for critical evaluation of spinal surgery websites. To highlight the variability between common search engines for the same search terms. To detect bias, by prevalence of specific kinds of websites for certain spinal disorders. Demonstrate a simple scoring system of spinal disorder website for patient use, to maximize the quality of information exposed to the patient. Ten common search terms were used to query three of the most common search engines. The top fifty results of each query were tabulated. A negative binomial regression was performed to highlight the variation across each search engine. Google was more likely than Bing and Yahoo search engines to return hospital ads (P=0.002) and more likely to return scholarly sites of peer-reviewed lite (P=0.003). Educational web sites, surgical group sites, and online web communities had a significantly higher likelihood of returning on any search, regardless of search engine, or search string (P=0.007). Likewise, professional websites, including hospital run, industry sponsored, legal, and peer-reviewed web pages were less likely to be found on a search overall, regardless of engine and search string (P=0.078). The Internet is a rapidly growing body of medical information which can serve as a useful tool for patient education. High quality information is readily available, provided that the patient uses a consistent, focused metric for evaluating online spine surgery information, as there is a clear variability in the way search engines present information to the patient. Published by Elsevier B.V.

Do two heads search better than one? Effects of student collaboration on web search behavior and search outcomes.

NARCIS (Netherlands)

Lazonder, Adrianus W.

2005-01-01

This study compared Pairs of students with Single students in web search tasks. The underlying hypothesis was that peer-to-peer collaboration encourages students to articulate their thoughts, which in turn has a facilitative effect on the regulation of the search process as well as search outcomes.

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

Science.gov (United States)

Younger, Paula; Boddy, Kate

2009-06-01

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

Combined semantic and similarity search in medical image databases

Science.gov (United States)

Seifert, Sascha; Thoma, Marisa; Stegmaier, Florian; Hammon, Matthias; Kramer, Martin; Huber, Martin; Kriegel, Hans-Peter; Cavallaro, Alexander; Comaniciu, Dorin

2011-03-01

The current diagnostic process at hospitals is mainly based on reviewing and comparing images coming from multiple time points and modalities in order to monitor disease progression over a period of time. However, for ambiguous cases the radiologist deeply relies on reference literature or second opinion. Although there is a vast amount of acquired images stored in PACS systems which could be reused for decision support, these data sets suffer from weak search capabilities. Thus, we present a search methodology which enables the physician to fulfill intelligent search scenarios on medical image databases combining ontology-based semantic and appearance-based similarity search. It enabled the elimination of 12% of the top ten hits which would arise without taking the semantic context into account.

Usability Testing of a Large, Multidisciplinary Library Database: Basic Search and Visual Search

Directory of Open Access Journals (Sweden)

Jody Condit Fagan

2006-09-01

Full Text Available Visual search interfaces have been shown by researchers to assist users with information search and retrieval. Recently, several major library vendors have added visual search interfaces or functions to their products. For public service librarians, perhaps the most critical area of interest is the extent to which visual search interfaces and text-based search interfaces support research. This study presents the results of eight full-scale usability tests of both the EBSCOhost Basic Search and Visual Search in the context of a large liberal arts university.

Completeness and overlap in open access systems: Search engines, aggregate institutional repositories and physics-related open sources.

Directory of Open Access Journals (Sweden)

Ming-Yueh Tsay

Full Text Available This study examines the completeness and overlap of coverage in physics of six open access scholarly communication systems, including two search engines (Google Scholar and Microsoft Academic, two aggregate institutional repositories (OAIster and OpenDOAR, and two physics-related open sources (arXiv.org and Astrophysics Data System. The 2001-2013 Nobel Laureates in Physics served as the sample. Bibliographic records of their publications were retrieved and downloaded from each system, and a computer program was developed to perform the analytical tasks of sorting, comparison, elimination, aggregation and statistical calculations. Quantitative analyses and cross-referencing were performed to determine the completeness and overlap of the system coverage of the six open access systems. The results may enable scholars to select an appropriate open access system as an efficient scholarly communication channel, and academic institutions may build institutional repositories or independently create citation index systems in the future. Suggestions on indicators and tools for academic assessment are presented based on the comprehensiveness assessment of each system.

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

Science.gov (United States)

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

2016-01-01

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

Interest in Anesthesia as Reflected by Keyword Searches using Common Search Engines.

Science.gov (United States)

Liu, Renyu; García, Paul S; Fleisher, Lee A

2012-01-23

Since current general interest in anesthesia is unknown, we analyzed internet keyword searches to gauge general interest in anesthesia in comparison with surgery and pain. The trend of keyword searches from 2004 to 2010 related to anesthesia and anaesthesia was investigated using Google Insights for Search. The trend of number of peer reviewed articles on anesthesia cited on PubMed and Medline from 2004 to 2010 was investigated. The average cost on advertising on anesthesia, surgery and pain was estimated using Google AdWords. Searching results in other common search engines were also analyzed. Correlation between year and relative number of searches was determined with psearch engines may provide different total number of searching results (available posts), the ratios of searching results between some common keywords related to perioperative care are comparable, indicating similar trend. The peer reviewed manuscripts on "anesthesia" and the proportion of papers on "anesthesia and outcome" are trending up. Estimates for spending of advertising dollars are less for anesthesia-related terms when compared to that for pain or surgery due to relative smaller number of searching traffic. General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side effects of anesthesia are the critical areas that anesthesiologists should focus on to address the increasing concerns.

Observed Human Actions, and Not Mechanical Actions, Induce Searching Errors in Infants

Directory of Open Access Journals (Sweden)

Yusuke Moriguchi

2012-01-01

Full Text Available Recent neurophysiological studies have shown that several human brain regions involved in executing actions are activated by merely observing such actions via a human, and not by a mechanical hand. At a behavioral level, observing a human’s movements, but not those of a robot, significantly interferes with ongoing executed movements. However, it is unclear whether the biological tuning in the observation/execution matching system are functional during infancy. The present study examines whether a human’s actions, and not a mechanical action, influence infants’ execution of the same actions due to the observation/execution matching system. Twelve-month-old infants were given a searching task. In the tasks, infants observed an object hidden at location A, after which either a human hand (human condition or a mechanical one (mechanical condition searched the object correctly. Next, the object was hidden at location B and infants were allowed to search the object. We examined whether infants searched the object at location B correctly. The results revealed that infants in the human condition were more likely to search location A than those in the mechanical condition. Moreover, the results suggested that infants’ searching behaviors were affected by their observations of the same actions by a human, but not a mechanical hand. Thus, it may be concluded that the observation/execution matching system may be biologically tuned during infancy.

Durham Zoo: Powering a Search-&-Innovation Engine with Collective Intelligence

Directory of Open Access Journals (Sweden)

Richard Absalom

2015-02-01

Full Text Available Purpose – Durham Zoo (hereinafter – DZ is a project to design and operate a concept search engine for science and technology. In DZ, a concept includes a solution to a problem in a particular context.Design – Concept searching is rendered complex by the fuzzy nature of a concept, the many possible implementations of the same concept, and the many more ways that the many implementations can be expressed in natural language. An additional complexity is the diversity of languages and formats, in which the concepts can be disclosed.Humans understand language, inference, implication and abstraction and, hence, concepts much better than computers, that in turn are much better at storing and processing vast amounts of data.We are 7 billion on the planet and we have the Internet as the backbone for Collective Intelligence. So, our concept search engine uses humans to store concepts via a shorthand that can be stored, processed and searched by computers: so, humans IN and computers OUT.The shorthand is classification: metadata in a structure that can define the content of a disclosure. The classification is designed to be powerful in terms of defining and searching concepts, whilst suited to a crowdsourcing effort. It is simple and intuitive to use. Most importantly, it is adapted to restrict ambiguity, which is the poison of classification, without imposing a restrictive centralised management.In the classification scheme, each entity is shown together in a graphical representation with related entities. The entities are arranged on a sliding scale of similarity. This sliding scale is effectively fuzzy classification.Findings – The authors of the paper have been developing a first classification scheme for the technology of traffic cones, this in preparation for a trial of a working system. The process has enabled the authors to further explore the practicalities of concept classification. The CmapTools knowledge modelling kit to develop the

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

Search for neutral leptons

International Nuclear Information System (INIS)

Perl, M.L.

1984-12-01

At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references

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

Directory of Open Access Journals (Sweden)

Younes Saadi

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

Assessment and Comparison of Search capabilities of Web-based Meta-Search Engines: A Checklist Approach

Directory of Open Access Journals (Sweden)

Alireza Isfandiyari Moghadam

2010-03-01

Full Text Available   The present investigation concerns evaluation, comparison and analysis of search options existing within web-based meta-search engines. 64 meta-search engines were identified. 19 meta-search engines that were free, accessible and compatible with the objectives of the present study were selected. An author’s constructed check list was used for data collection. Findings indicated that all meta-search engines studied used the AND operator, phrase search, number of results displayed setting, previous search query storage and help tutorials. Nevertheless, none of them demonstrated any search options for hypertext searching and displaying the size of the pages searched. 94.7% support features such as truncation, keywords in title and URL search and text summary display. The checklist used in the study could serve as a model for investigating search options in search engines, digital libraries and other internet search tools.

Wolf Search Algorithm for Solving Optimal Reactive Power Dispatch Problem

Directory of Open Access Journals (Sweden)

Kanagasabai Lenin

2015-03-01

Full Text Available This paper presents a new bio-inspired heuristic optimization algorithm called the Wolf Search Algorithm (WSA for solving the multi-objective reactive power dispatch problem. Wolf Search algorithm is a new bio – inspired heuristic algorithm which based on wolf preying behaviour. The way wolves search for food and survive by avoiding their enemies has been imitated to formulate the algorithm for solving the reactive power dispatches. And the speciality  of wolf is  possessing  both individual local searching ability and autonomous flocking movement and this special property has been utilized to formulate the search algorithm .The proposed (WSA algorithm has been tested on standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm .

Categorization and Searching of Color Images Using Mean Shift Algorithm

Directory of Open Access Journals (Sweden)

Prakash PANDEY

2009-07-01

Full Text Available Now a day’s Image Searching is still a challenging problem in content based image retrieval (CBIR system. Most CBIR system operates on all images without pre-sorting the images. The image search result contains many unrelated image. The aim of this research is to propose a new object based indexing system Based on extracting salient region representative from the image, categorizing the image into different types and search images that are similar to given query images.In our approach, the color features are extracted using the mean shift algorithm, a robust clustering technique, Dominant objects are obtained by performing region grouping of segmented thumbnails. The category for an image is generated automatically by analyzing the image for the presence of a dominant object. The images in the database are clustered based on region feature similarity using Euclidian distance. Placing an image into a category can help the user to navigate retrieval results more effectively. Extensive experimental results illustrate excellent performance.

Search optimization of named entities from twitter streams

Science.gov (United States)

Fazeel, K. Mohammed; Hassan Mottur, Simama; Norman, Jasmine; Mangayarkarasi, R.

2017-11-01

With Enormous number of tweets, People often face difficulty to get exact information about those tweets. One of the approach followed for getting information about those tweets via Google. There is not any accuracy tool developed for search optimization and as well as getting information about those tweets. So, this system contains the search optimization and functionalities for getting information about those tweets. Another problem faced here are the tweets that contains grammatical errors, misspellings, non-standard abbreviations, and meaningless capitalization. So, these problems can be eliminated by the use of this tool. Lot of time can be saved and as well as by the use of efficient search optimization each information about those particular tweets can be obtained.

Nuclear expert web search and crawler algorithm

International Nuclear Information System (INIS)

Reis, Thiago; Barroso, Antonio C.O.; Baptista, Benedito Filho D.

2013-01-01

In this paper we present preliminary research on web search and crawling algorithm applied specifically to nuclear-related web information. We designed a web-based nuclear-oriented expert system guided by a web crawler algorithm and a neural network able to search and retrieve nuclear-related hyper textual web information in autonomous and massive fashion. Preliminary experimental results shows a retrieval precision of 80% for web pages related to any nuclear theme and a retrieval precision of 72% for web pages related only to nuclear power theme. (author)

Nuclear expert web search and crawler algorithm

Energy Technology Data Exchange (ETDEWEB)

Reis, Thiago; Barroso, Antonio C.O.; Baptista, Benedito Filho D., E-mail: thiagoreis@usp.br, E-mail: barroso@ipen.br, E-mail: bdbfilho@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

2013-07-01

In this paper we present preliminary research on web search and crawling algorithm applied specifically to nuclear-related web information. We designed a web-based nuclear-oriented expert system guided by a web crawler algorithm and a neural network able to search and retrieve nuclear-related hyper textual web information in autonomous and massive fashion. Preliminary experimental results shows a retrieval precision of 80% for web pages related to any nuclear theme and a retrieval precision of 72% for web pages related only to nuclear power theme. (author)

Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

Science.gov (United States)

Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J

2015-01-01

Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.

Flexible and scalable digital library search

NARCIS (Netherlands)

M.A. Windhouwer (Menzo); A.R. Schmidt; R. van Zwol; M. Petkovic; H.E. Blok

2001-01-01

textabstractIn this report the development of a specialised search engine for a digital library is described. The proposed system architecture consists of three levels: the conceptual, the logical and the physical level. The conceptual level schema enables by its exposure of a domain specific

Improving e-book access via a library-developed full-text search tool*

Science.gov (United States)

Foust, Jill E.; Bergen, Phillip; Maxeiner, Gretchen L.; Pawlowski, Peter N.

2007-01-01

Purpose: This paper reports on the development of a tool for searching the contents of licensed full-text electronic book (e-book) collections. Setting: The Health Sciences Library System (HSLS) provides services to the University of Pittsburgh's medical programs and large academic health system. Brief Description: The HSLS has developed an innovative tool for federated searching of its e-book collections. Built using the XML-based Vivísimo development environment, the tool enables a user to perform a full-text search of over 2,500 titles from the library's seven most highly used e-book collections. From a single “Google-style” query, results are returned as an integrated set of links pointing directly to relevant sections of the full text. Results are also grouped into categories that enable more precise retrieval without reformulation of the search. Results/Evaluation: A heuristic evaluation demonstrated the usability of the tool and a web server log analysis indicated an acceptable level of usage. Based on its success, there are plans to increase the number of online book collections searched. Conclusion: This library's first foray into federated searching has produced an effective tool for searching across large collections of full-text e-books and has provided a good foundation for the development of other library-based federated searching products. PMID:17252065

The Complex Dynamics of Sponsored Search Markets

Science.gov (United States)

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

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

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

OpenAIRE

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

2018-01-01

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

Search features of digital libraries

Directory of Open Access Journals (Sweden)

Alastair G. Smith

2000-01-01

Full Text Available Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc. This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries, for instance by: providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.

The Information Search

Science.gov (United States)

Doraiswamy, Uma

2011-01-01

This paper in the form of story discusses a college student's information search process. In this story we see Kuhlthau's information search process: initiation, selection, exploration, formulation, collection, and presentation. Katie is a student who goes in search of information for her class research paper. Katie's class readings, her interest…

A real-time all-atom structural search engine for proteins.