Science.gov

Sample records for advanced search search

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

    PubMed

    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. PMID:18357673

  2. Using Advanced Search Operators on Web Search Engines.

    ERIC Educational Resources Information Center

    Jansen, Bernard J.

    Studies show that the majority of Web searchers enter extremely simple queries, so a reasonable system design approach would be to build search engines to compensate for this user characteristic. One hundred representative queries were selected from the transaction log of a major Web search service. These 100 queries were then modified using the…

  3. Satisfaction of search experiments in advanced imaging

    NASA Astrophysics Data System (ADS)

    Berbaum, Kevin S.

    2012-03-01

    The objective of our research is to understand the perception of multiple abnormalities in an imaging examination and to develop strategies for improved diagnostic. We are one of the few laboratories in the world pursuing the goal of reducing detection errors through a better understanding of the underlying perceptual processes involved. Failure to detect an abnormality is the most common class of error in diagnostic imaging and generally is considered the most serious by the medical community. Many of these errors have been attributed to "satisfaction of search," which occurs when a lesion is not reported because discovery of another abnormality has "satisfied" the goal of the search. We have gained some understanding of the mechanisms of satisfaction of search (SOS) traditional radiographic modalities. Currently, there are few interventions to remedy SOS error. For example, patient history that the prompts specific abnormalities, protects the radiologist from missing them even when other abnormalities are present. The knowledge gained from this programmatic research will lead to reduction of observer error.

  4. Searching for Intermediate Mass Black Holes with Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Sadeghian, Laleh; Wade, Leslie

    2016-03-01

    Intermediate Mass Black Holes (IMBHs) are conjectured to occupy the mass space between stellar-mass and super-massive black holes, roughly between 100 and 105 solar masses. The coalescence and merger of IMBH binaries with masses of a few hundred solar masses is an intriguing possible source of gravitational waves for Advanced LIGO and Advanced Virgo. A single detection of an IMBH binary merger would provide the first unambiguous proof of IMBH existence. Searches for these sources have started on data collected by the Advanced LIGO since September 2015. In this talk I will present a search method for these sources in the advanced detector era, based on known signal morphology.

  5. Advanced LIGO and Multi-Messenger Transient Searches

    NASA Astrophysics Data System (ADS)

    Shawhan, Peter S.; LIGO Scientific Collaboration, Virgo Collaboration

    2016-01-01

    The first Advanced LIGO observing run, which began in September 2015, is on track to extend the volume*time reach of the gravitational wave (GW) detector network by an order of magnitude by the end of the year. Searches for transient GW signals from compact binary mergers and other possible sources are a central part of the LIGO-Virgo science program. To enhance those searches and to try to place any detected signals into an astronomical context, we have undertaken an extensive program of partnering with observers to enable prompt transient survey correlations and follow-up observations at all wavelengths, from optical and radio telescopes on the ground to astroparticle detectors to space missions including Fermi and Swift. I will summarize the data collected from the first Advanced LIGO observing run, the transient searches being carried out, and the multi-messenger observing effort.

  6. Advanced Image Search: A Strategy for Creating Presentation Boards

    ERIC Educational Resources Information Center

    Frey, Diane K.; Hines, Jean D.; Swinker, Mary E.

    2008-01-01

    Finding relevant digital images to create presentation boards requires advanced search skills. This article describes a course assignment involving a technique designed to develop students' literacy skills with respect to locating images of desired quality and content from Internet databases. The assignment was applied in a collegiate apparel…

  7. Advanced LIGO low-latency searches

    NASA Astrophysics Data System (ADS)

    Kanner, Jonah; LIGO Scientific Collaboration, The Virgo Collaboration

    2016-06-01

    Advanced LIGO recently made the first detection of gravitational waves from merging binary black holes. The signal was first identified by a low-latency analysis, which identifies gravitational-wave transients within a few minutes of data collection. More generally, Advanced LIGO transients are sought with a suite of automated tools, which collectively identify events, evaluate statistical significance, estimate source position, and attempt to characterize source properties. This low-latency effort is enabling a broad multi-messenger approach to the science of compact object mergers and other transients. This talk will give an overview of the low-latency methodology and recent results.

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

    PubMed

    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. PMID:24614997

  9. Overview of Advanced LIGO searches for unmodeled transients

    NASA Astrophysics Data System (ADS)

    Kanner, Jonah; LIGO Scientific Collaboration; Virgo Collaboration

    2016-03-01

    Sources of gravitational wave transients may include some of the most energetic events in the universe, including mergers of neutron stars and/or black holes, the core-collapse of massive stars, and cosmic string cusps. A network of modern gravitational wave detectors, including Advanced LIGO and Advanced Virgo, might soon be capable of observing these sources. Separating these signals from detector noise requires specialized algorithms, which are run both in low-latency and on archived data. In this talk, we describe the all-time, all-sky search for unmodeled transients during the first observing run of Advanced LIGO.

  10. Accuracy of Binary Black Hole waveforms for Advanced LIGO searches

    NASA Astrophysics Data System (ADS)

    Kumar, Prayush; Barkett, Kevin; Bhagwat, Swetha; Chu, Tony; Fong, Heather; Brown, Duncan; Pfeiffer, Harald; Scheel, Mark; Szilagyi, Bela

    2015-04-01

    Coalescing binaries of compact objects are flagship sources for the first direct detection of gravitational waves with LIGO-Virgo observatories. Matched-filtering based detection searches aimed at binaries of black holes will use aligned spin waveforms as filters, and their efficiency hinges on the accuracy of the underlying waveform models. A number of gravitational waveform models are available in literature, e.g. the Effective-One-Body, Phenomenological, and traditional post-Newtonian ones. While Numerical Relativity (NR) simulations provide for the most accurate modeling of gravitational radiation from compact binaries, their computational cost limits their application in large scale searches. In this talk we assess the accuracy of waveform models in two regions of parameter space, which have only been explored cursorily in the past: the high mass-ratio regime as well as the comparable mass-ratio + high spin regime.s Using the SpEC code, six q = 7 simulations with aligned-spins and lasting 60 orbits, and tens of q ∈ [1,3] simulations with high black hole spins were performed. We use them to study the accuracy and intrinsic parameter biases of different waveform families, and assess their viability for Advanced LIGO searches.

  11. Web Search Engines: Search Syntax and Features.

    ERIC Educational Resources Information Center

    Ojala, Marydee

    2002-01-01

    Presents a chart that explains the search syntax, features, and commands used by the 12 most widely used general Web search engines. Discusses Web standardization, expanded types of content searched, size of databases, and search engines that include both simple and advanced versions. (LRW)

  12. Search Cloud

    MedlinePlus

    ... this page: https://medlineplus.gov/cloud.html Search Cloud To use the sharing features on this page, ... Top 110 zoster vaccine Share the MedlinePlus search cloud with your users by embedding our search cloud ...

  13. Search Cloud

    MedlinePlus

    ... www.nlm.nih.gov/medlineplus/cloud.html Search Cloud To use the sharing features on this page, please enable JavaScript. Share the MedlinePlus search cloud with your users by embedding our search cloud ...

  14. The Saccharomyces Genome Database: Advanced Searching Methods and Data Mining.

    PubMed

    Cherry, J Michael

    2015-12-01

    At the core of the Saccharomyces Genome Database (SGD) are chromosomal features that encode a product. These include protein-coding genes and major noncoding RNA genes, such as tRNA and rRNA genes. The basic entry point into SGD is a gene or open-reading frame name that leads directly to the locus summary information page. A keyword describing function, phenotype, selective condition, or text from abstracts will also provide a door into the SGD. A DNA or protein sequence can be used to identify a gene or a chromosomal region using BLAST. Protein and DNA sequence identifiers, PubMed and NCBI IDs, author names, and function terms are also valid entry points. The information in SGD has been gathered and is maintained by a group of scientific biocurators and software developers who are devoted to providing researchers with up-to-date information from the published literature, connections to all the major research resources, and tools that allow the data to be explored. All the collected information cannot be represented or summarized for every possible question; therefore, it is necessary to be able to search the structured data in the database. This protocol describes the YeastMine tool, which provides an advanced search capability via an interactive tool. The SGD also archives results from microarray expression experiments, and a strategy designed to explore these data using the SPELL (Serial Pattern of Expression Levels Locator) tool is provided. PMID:26631124

  15. Radio Searches for Signatures of Advanced Extraterrestrial Life

    NASA Astrophysics Data System (ADS)

    Siemion, Andrew

    Over the last several decades, observational astronomy has produced a flood of discoveries that suggest that the building blocks and circumstances that gave rise to life on Earth may be the rule rather than the exception. It has now been conclusively shown that planets are common and that some 5-15% of FGKM stars host planets existing in their host star's habitable zone. Further, terrestrial biology has demonstrated that life on our own planet can thrive in extraordinarily extreme environments, dramatically extending our notion of what constitutes habitability. The deeper question, yet unanswered, is whether or not life in any form has ever existed in an environment outside of the Earth. As humans, we are drawn to an even more profound question, that of whether or not extraterrestrial life may have evolved a curiosity about the universe similar to our own and the technology with which to explore it. Radio astronomy has long played a prominent role in searches for extraterrestrial intelligence (SETI), beginning with the first suggestions by Cocconi and Morrison (1959) that narrow-band radio signals near 1420 MHz might be effective tracers of advanced technology and early experiments along these lines by Frank Drake in 1961, continuing through to more recent investigations searching for several types of coherent radio signals indicative of technology at a wider range of frequencies. The motivations for radio searches for extraterrestrial intelligence have been throughly discussed in the literature, but the salient arguments are the following: 1. coherent radio emission is commonly produced by advanced technology (judging by Earth’s technological development), 2. electromagnetic radiation can convey information at the maximum velocity currently known to be possible, 3. radio photons are energetically cheap to produce, 4. certain types of coherent radio emissions are easily distinguished from astrophysical background sources, especially within the so

  16. Discussion of AN Advanced LIGO Low-Latency Search for Compact Binary Gravitational Waves

    NASA Astrophysics Data System (ADS)

    Messick, Cody; LIGO Scientific Collaboration; Virgo Collaboration

    2016-03-01

    Advanced ligo completed its first observing run in january, marking the beginning of a new era in gravitational wave astronomy. Low-latency pipelines searched for gravitational waves from compact binary mergers during the observing run, uploading candidate events to a database within seconds. In my presentation, we will report on the low-latency gstlal-inspiral advanced ligo search.

  17. The search for advanced remote technology in fast reactor reprocessing

    SciTech Connect

    Burch, W.D.; Herndon, J.N.; Stradley, J.G.

    1990-01-01

    Research and development in fast reactor reprocessing has been under way about 20 years in several countries throughout the world. During the past decade in France and the United Kingdom, active development programs have been carried out in breeder reprocessing. Actual fuels from their demonstration reactors have been reprocessed in small-scale facilities. Early US work in breeder reprocessing was carried out at the EBR-II facilities with the early metal fuels, and interest has renewed recently in metal fuels. A major, comprehensive program, focused on oxide fuels, has been carried out in the Consolidated Fuel Reprocessing Program (CFRP) at the Oak Ridge National Laboratory (ORNL) since 1974. Germany and Japan have also carried out development programs in breeder reprocessing, and Japan appears committed to major demonstration of breeder reactors and their fuel cycles. While much of the effort in all of these programs addressed process chemistry and process hardware, a significant element of many of these programs, particularly the CFRP, has been on advancements in facility concepts and remote maintenance features. This paper will focus principally on the search for improved facility concepts and better maintenance systems in the CFRP and, in turn, on how developments at ORNL have influenced the technology elsewhere.

  18. Confidential Searches.

    ERIC Educational Resources Information Center

    Kenney, Linda Chion

    2003-01-01

    Will the stealth superintendent hunt in Cincinnati become tomorrow's standard approach? Search consultants and superintendents offer their views on how far confidentiality should go. Also includes a search firm's process for shielding identities and a confidentiality pledge. (MLF)

  19. Savvy Searching.

    ERIC Educational Resources Information Center

    Jacso, Peter

    2002-01-01

    Explains desktop metasearch engines, which search the databases of several search engines simultaneously. Reviews two particular versions, the Copernic 2001 Pro and the BullsEye Pro 3, comparing costs, subject categories, display capabilities, and layout for presenting results. (LRW)

  20. Suspicionless Searches.

    ERIC Educational Resources Information Center

    Zirkel, Perry A.

    2000-01-01

    In a federal case involving a vice-principal's pat-down search of middle-school students in a cafeteria (for a missing pizza knife), the court upheld the search, saying it was relatively unintrusive and met "TLO's" reasonable-suspicion standards. Principals need reasonable justification for searching a group. (Contains 18 references.) (MLH)

  1. Dewey Searches!

    ERIC Educational Resources Information Center

    School Library Media Activities Monthly, 2000

    2000-01-01

    Describes an activity for young children that helps them conduct subject searches using an automated system that allows customization of access to a library's collection. Explains a timed game that makes use of subject searching and word searching on the topic of dinosaurs. (LRW)

  2. Analytical Searching.

    ERIC Educational Resources Information Center

    Pappas, Marjorie L.

    1995-01-01

    Discusses analytical searching, a process that enables searchers of electronic resources to develop a planned strategy by combining words or phrases with Boolean operators. Defines simple and complex searching, and describes search strategies developed with Boolean logic and truncation. Provides guidelines for teaching students analytical…

  3. Partition search

    SciTech Connect

    Ginsberg, M.L.

    1996-12-31

    We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as {alpha}-{beta} pruning provides over minimax.

  4. Netscape Communicator 4.5. Volume II: Beyond the Basics. Advanced Searches, Multimedia, and Composing a Web Page.

    ERIC Educational Resources Information Center

    Gallo, Gail; Wichowski, Chester P.

    This second of two guides on Netscape Communicator 4.5 contains six lessons on advanced searches, multimedia, and composing a World Wide Web page. Lesson 1 is a review of the Navigator window, toolbars, and menus. Lesson 2 covers AltaVista's advanced search tips, searching for information excluding certain text, and advanced and nested Boolean…

  5. Advanced exact structure searching in large databases of chemical compounds.

    PubMed

    Trepalin, Sergey V; Skorenko, Andrey V; Balakin, Konstantin V; Nasonov, Anatoly F; Lang, Stanley A; Ivashchenko, Andrey A; Savchuk, Nikolay P

    2003-01-01

    Efficient recognition of tautomeric compound forms in large corporate or commercially available compound databases is a difficult and labor intensive task. Our data indicate that up to 0.5% of commercially available compound collections for bioscreening contain tautomers. Though in the large registry databases, such as Beilstein and CAS, the tautomers are found in an automated fashion using high-performance computational technologies, their real-time recognition in the nonregistry corporate databases, as a rule, remains problematic. We have developed an effective algorithm for tautomer searching based on the proprietary chemoinformatics platform. This algorithm reduces the compound to a canonical structure. This feature enables rapid, automated computer searching of most of the known tautomeric transformations that occur in databases of organic compounds. Another useful extension of this methodology is related to the ability to effectively search for different forms of compounds that contain ionic and semipolar bonds. The computations are performed in the Windows environment on a standard personal computer, a very useful feature. The practical application of the proposed methodology is illustrated by several examples of successful recovery of tautomers and different forms of ionic compounds from real commercially available nonregistry databases. PMID:12767143

  6. A geometry-based image search engine for advanced RADARSAT-1/2 GIS applications

    NASA Astrophysics Data System (ADS)

    Kotamraju, Vinay; Rabus, Bernhard; Busler, Jennifer

    2012-06-01

    Space-borne Synthetic Aperture Radar (SAR) sensors, such as RADARSAT-1 and -2, enable a multitude of defense and security applications owing to their unique capabilities of cloud penetration, day/night imaging and multi-polarization imaging. As a result, advanced SAR image time series exploitation techniques such as Interferometric SAR (InSAR) and Radargrammetry are now routinely used in applications such as underground tunnel monitoring, infrastructure monitoring and DEM generation. Imaging geometry, as determined by the satellite orbit and imaged terrain, plays a critical role in the success of such techniques. This paper describes the architecture and the current status of development of a geometry-based search engine that allows the search and visualization of archived and future RADARSAT-1 and -2 images appropriate for a variety of advanced SAR techniques and applications. Key features of the search engine's scalable architecture include (a) Interactive GIS-based visualization of the search results; (b) A client-server architecture for online access that produces up-to-date searches of the archive images and that can, in future, be extended to acquisition planning; (c) A techniquespecific search mode, wherein an expert user explicitly sets search parameters to find appropriate images for advanced SAR techniques such as InSAR and Radargrammetry; (d) A future application-specific search mode, wherein all search parameters implicitly default to preset values according to the application of choice such as tunnel monitoring, DEM generation and deformation mapping; (f) Accurate baseline calculations for InSAR searches, and, optimum beam configuration for Radargrammetric searches; (g) Simulated quick look images and technique-specific sensitivity maps in the future.

  7. Are search committees really searching?

    PubMed

    Hoffmeir, Patricia A

    2003-02-01

    Academic chair searches are admittedly a labor-intensive process, but they are made more difficult and often lead to less-than-optimal outcomes because search committees spend their time "advertising," "looking," but not truly searching for academic chairs. At the onset, certain "realities" must be acknowledged, including (1) understanding that unless your organization is renowned in the specialty for which you are conducting the search, candidates won't be pounding at your door for a job, (2) searches that fail to include an overall assessment of the department in question are likely to miss the mark, (3) chairs must have demonstrated not only clinical expertise but also business savvy, (4) the best candidate is not necessarily someone who is already a department chair, (5) when it comes to chair searches, it's a buyer's market, and (6) the search process is inextricably linked to the success of the search. Key to the process of conducting an academic chair search are the judicious formation of the search committee; committee members' willingness to do their homework, attend all committee meeting, and keep the committee's activities confidential; crafting, not revising, the current job description for the open chair position; interviewing viable candidates rather than all candidates and adhering to a coordinated interviewing process; and evaluating internal and external candidates according to the same parameters. PMID:12584089

  8. The ``Uberbank'': A search for compact binary coalescences in the first Observing run of Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Capano, Collin; LIGO Scientific Collaboration; Virgo Collaboration

    2016-03-01

    Modeled searches for gravitational waves from compact binary coalescence (CBC) use a ``bank'' of template waveforms to search the wide range of parameters that binaries may have. Recent advances in waveform modeling and template placement techniques have opened up the possibility to efficiently search for systems with non-precessing spin, using waveforms that model the inspiral, merger, and ringdown of coalescing binaries. I discuss how these advances were combined to produce the template bank used to search for CBCs in the first observing run of Advanced LIGO. This bank covered the full range of plausible masses and non-precessing spins of binary neutron stars, stellar-mass binary black holes, and binaries consisting of a neutron star and a stellar-mass black hole.

  9. Coherent search for gravitational wave transients in the first advanced LIGO run

    NASA Astrophysics Data System (ADS)

    Klimenko, Sergey; Ligo Scientific Collaboration Collaboration

    2016-03-01

    Recently LIGO detectors have been upgraded, targeting detection of gravitational waves from astrophysical sources. Advanced LIGO performed the first observing run in September, 2015 - January, 2016 at almost three times better strain sensitivity than the initial detectors. We describe a baseline search for generic gravitational wave transients conducted during the first observing run. The search pipeline coherently combines data from all detectors and identifies gravitational wave candidates with a few minutes latency. By using the constrained likelihood method, it reconstructs signal waveform and finds a source location in the sky. We present the status of the search, the performance of the search algorithm, and extensive studies of the background due to environmental and instrumental transient events. Supported by NSF.

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

    SciTech Connect

    Quock, D. E. R.; Cianciarulo, M. B.; APS Engineering Support Division; Purdue Univ.

    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.

  11. The outcomes and correlates of job search objectives: searching to leave or searching for leverage?

    PubMed

    Boswell, Wendy R; Boudreau, John W; Dunford, Benjamin B

    2004-12-01

    The authors investigate a previously overlooked yet important objective for employee job search--seeking leverage against the current employer. They explore the outcomes and correlates of leverage-seeking search and how it may differ from the more traditional objective for engaging in job search--to change jobs. Results show that leverage-seeking and separation-seeking search objectives associate with different outcomes. The authors also find that characteristics of the work situation and individual differences associate with leverage-seeking search and relate differently with the 2 job search objectives. Implications for practice and the advancement of job search research are discussed. PMID:15584843

  12. Effect of Advanced Location Methods on Search and Rescue Duration for General Aviation Aircraft Accidents in the Contiguous United States

    ERIC Educational Resources Information Center

    Wallace, Ryan J.

    2013-01-01

    The purpose of this study was to determine the impact of advanced search and rescue devices and techniques on search duration for general aviation aircraft crashes. The study assessed three categories of emergency locator transmitters, including 121.5 MHz, 406 MHz, and GPS-Assisted 406 MHz devices. The impact of the COSPAS-SARSAT organization…

  13. Probing the Search Series.

    ERIC Educational Resources Information Center

    Owens, Peter

    1983-01-01

    Energy Search, Geography Search, Geology Search, Archeology Search, and Community Search are microcomputer software games, usable in grades five to nine, which provide educational simulations, numbers and situational choices, and calculation of implications of decisions. The series is a pathfinder usable by entire class and requiring only one…

  14. 'Net Search Strategies.

    ERIC Educational Resources Information Center

    Bell, Suzanne S.

    1997-01-01

    Provides strategies for effective Internet searches. Categorizes queries into four types and describes tools: subject lists; indexes/directories; keyword search engines; Usenet newsgroups; and special purpose search tools. Discusses the importance of deciphering information and adjusting to changes. (AEF)

  15. Foraging search: Prototypical intelligence

    NASA Astrophysics Data System (ADS)

    Mobus, George

    2000-05-01

    We think because we eat. Or as Descartes might have said, on a little more reflection, "I need to eat, therefore I think." Animals that forage for a living repeatedly face the problem of searching for a sparsely distributed resource in a vast space. Furthermore, the resource may occur sporadically and episodically under conditions of true uncertainty (nonstationary, complex and non-linear dynamics). I assert that this problem is the canonical problem solved by intelligence. It's solution is the basis for the evolution of more advanced intelligence in which the space of search includes that of concepts (objects and relations) encoded in cortical structures. In humans the conscious experience of searching through concept space we call thinking. The foraging search model is based upon a higher-order autopoeitic system (the forager) employing anticipatory processing to enhance its success at finding food while avoiding becoming food or having accidents in a hostile world. I present a semi-formal description of the general foraging search problem and an approach to its solution. The latter is a brain-like structure employing dynamically adaptive neurons. A physical robot, MAVRIC, embodies some principles of foraging. It learns cues that lead to improvements in finding targets in a dynamic and nonstationary environment. This capability is based on a unique learning mechanism that encodes causal relations in the neural-like processing element. An argument is advanced that searching for resources in the physical world, as per the foraging model, is a prototype for generalized search for conceptual resources as when we think. A problem represents a conceptual disturbance in a homeostatic sense. The finding of a solution restores the homeostatic balance. The establishment of links between conceptual cues and solutions (resources) and the later use of those cues to think through to solutions of quasi-isomorphic problems is, essentially, foraging for ideas. It is a quite

  16. Tabu search based strategies for conformational search.

    PubMed

    Stepanenko, Svetlana; Engels, Bernd

    2009-10-29

    This paper presents an application of the new nonlinear global optimization routine gradient only tabu search (GOTS) to conformational search problems. It is based on the tabu search strategy which tries to determine the global minimum of a function by the steepest descent-modest ascent strategy. The refinement of ranking procedure of the original GOTS method and the exploitation of simulated annealing elements are described, and the modifications of the GOTS algorithm necessary to adopt it to conformation searches are explained. The utility of the GOTS for conformational search problems is tested using various examples. PMID:19769347

  17. Tabu Search Based Strategies for Conformational Search

    NASA Astrophysics Data System (ADS)

    Stepanenko, Svetlana; Engels, Bernd

    2009-09-01

    This paper presents an application of the new nonlinear global optimization routine gradient only tabu search (GOTS) to conformational search problems. It is based on the tabu search strategy which tries to determine the global minimum of a function by the steepest descent-modest ascent strategy. The refinement of ranking procedure of the original GOTS method and the exploitation of simulated annealing elements are described, and the modifications of the GOTS algorithm necessary to adopt it to conformation searches are explained. The utility of the GOTS for conformational search problems is tested using various examples.

  18. Effect of advanced location methods on search and rescue duration for general aviation aircraft accidents in the contiguous United States

    NASA Astrophysics Data System (ADS)

    Wallace, Ryan J.

    The purpose of this study was to determine the impact of advanced search and rescue devices and techniques on search duration for general aviation aircraft crashes. The study assessed three categories of emergency locator transmitters, including 121.5 MHz, 406 MHz, and GPS-Assisted 406 MHz devices. The impact of the COSPAS-SARSAT organization ceasing satellite monitoring for 121.5 MHz ELTs in 2009 was factored into the study. Additionally, the effect of using radar forensic analysis and cellular phone forensic search methods were also assessed. The study's data was derived from an Air Force Rescue Coordination Center database and included 365 historical general aviation search and rescue missions conducted between 2006 and 2011. Highly skewed data was transformed to meet normality requirements for parametric testing. The significance of each ELT model was assessed using a combination of Brown-Forsythe Means Testing or Orthogonal Contrast Testing. ANOVA and Brown-Forsythe Means testing was used to evaluate cellular phone and radar forensic search methods. A Spearman's Rho test was used to determine if the use of multiple search methods produced an additive effect in search efficiency. Aircraft which utilized an Emergency Locator Transmitter resulted in a shorter search duration than those which did not use such devices. Aircraft utilizing GPS-Aided 406 MHz ELTs appeared to require less time to locate than if equipped with other ELT models, however, this assessment requires further study due to limited data. Aircraft equipped with 406 MHz ELTs required slightly less time to locate than aircraft equipped with older 121.5 MHz ELTs. The study found no substantial difference in the search durations for 121.5 MHz ELTs monitored by COSPAS-SARSAT verses those which were not. Significance testing revealed that the use of cellular phone forensic data and radar forensic data both resulted in substantially higher mission search durations. Some possible explanations for this

  19. Internet Power Searching: The Advanced Manual. 2nd Edition. Neal-Schuman NetGuide Series.

    ERIC Educational Resources Information Center

    Bradley, Phil

    This handbook provides information on how Internet search engines and related software and utilities work and how to use them in order to improve search techniques. The book begins with an introduction to the Internet. Part 1 contains the following chapters that cover mining the Internet for information: "An Introduction to Search…

  20. Online Database Searching Workbook.

    ERIC Educational Resources Information Center

    Littlejohn, Alice C.; Parker, Joan M.

    Designed primarily for use by first-time searchers, this workbook provides an overview of online searching. Following a brief introduction which defines online searching, databases, and database producers, five steps in carrying out a successful search are described: (1) identifying the main concepts of the search statement; (2) selecting a…

  1. Search Alternatives and Beyond

    ERIC Educational Resources Information Center

    Bell, Steven J.

    2006-01-01

    Internet search has become a routine computing activity, with regular visits to a search engine--usually Google--the norm for most people. The vast majority of searchers, as recent studies of Internet search behavior reveal, search only in the most basic of ways and fail to avail themselves of options that could easily and effortlessly improve…

  2. Online Search Optimization.

    ERIC Educational Resources Information Center

    Homan, Michael; Worley, Penny

    This course syllabus describes methods for optimizing online searching, using as an example searching on the National Library of Medicine (NLM) online system. Four major activities considered are the online interview, query analysis and search planning, online interaction, and post-search analysis. Within the context of these activities, concepts…

  3. Advances in the development of ultrasonic search units for coarse-grained structures

    SciTech Connect

    Mohr, F.; Bernus, L.V.; Schmid, R.; Malmer, C.

    1994-12-31

    Increasingly stringent inspection requirements at home and abroad are being matched by further advances in the existing range of examination systems and equipment. These requirements are the driving force behind the expansion of inspection programs for austenitic materials. A general description on inspection methods for austenitic steel which would be suitable for inclusion in the pertinent codes and standards has yet to be elaborated. The results of measurements obtained using electromagnetic ultrasonic transducers show considerable promise. With horizontally polarized transverse waves it is possible to detect longitudinal discontinuities through the weld metal, even if the inspection is performed from one side only. Examination for transverse discontinuities is more difficult. For such applications it is necessary to use inspection techniques which have been specially optimized to the particular application. Cast austenitic steel is the most difficult material to examine. The following measures can improve its examinability: (1) selection of lower frequencies to prevent scattering of the ultrasonic beam; (2) use of focusing techniques, e.g. synthetic aperture techniques to improve the signal-to-noise; (3) exact matching of search units to the geometry of the item to be examined. The problems encountered in connection with search units and inspection methods are discussed in the following on the basis of actual practical examples.

  4. Heart research advances using database search engines, Human Protein Atlas and the Sydney Heart Bank.

    PubMed

    Li, Amy; Estigoy, Colleen; Raftery, Mark; Cameron, Darryl; Odeberg, Jacob; Pontén, Fredrik; Lal, Sean; Dos Remedios, Cristobal G

    2013-10-01

    This Methodological Review is intended as a guide for research students who may have just discovered a human "novel" cardiac protein, but it may also help hard-pressed reviewers of journal submissions on a "novel" protein reported in an animal model of human heart failure. Whether you are an expert or not, you may know little or nothing about this particular protein of interest. In this review we provide a strategic guide on how to proceed. We ask: How do you discover what has been published (even in an abstract or research report) about this protein? Everyone knows how to undertake literature searches using PubMed and Medline but these are usually encyclopaedic, often producing long lists of papers, most of which are either irrelevant or only vaguely relevant to your query. Relatively few will be aware of more advanced search engines such as Google Scholar and even fewer will know about Quertle. Next, we provide a strategy for discovering if your "novel" protein is expressed in the normal, healthy human heart, and if it is, we show you how to investigate its subcellular location. This can usually be achieved by visiting the website "Human Protein Atlas" without doing a single experiment. Finally, we provide a pathway to discovering if your protein of interest changes its expression level with heart failure/disease or with ageing. PMID:23856366

  5. Bioinformatics: searching the Net.

    PubMed

    Kastin, S; Wexler, J

    1998-04-01

    During the past 30 years, there has been an explosion in the volume of published medical information. As this volume has increased, so has the need for efficient methods for searching the data. MEDLINE, the primary medical database, is currently limited to abstracts of the medical literature. MEDLINE searches use AND/OR/NOT logical searching for keywords that have been assigned to each article and for textwords included in article abstracts. Recently, the complete text of some scientific journals, including figures and tables, has become accessible electronically. Keyword and textword searches can provide an overwhelming number of results. Search engines that use phrase searching, or searches that limit the number of words between two finds, improve the precision of search engines. The development of the Internet as a vehicle for worldwide communication, and the emergence of the World Wide Web (WWW) as a common vehicle for communication have made instantaneous access to much of the entire body of medical information an exciting possibility. There is more than one way to search the WWW for information. At the present time, two broad strategies have emerged for cataloging the WWW: directories and search engines. These allow more efficient searching of the WWW. Directories catalog WWW information by creating categories and subcategories of information and then publishing pointers to information within the category listings. Directories are analogous to yellow pages of the phone book. Search engines make no attempt to categorize information. They automatically scour the WWW looking for words and then automatically create an index of those words. When a specific search engine is used, its index is searched for a particular word. Usually, search engines are nonspecific and produce voluminous results. Use of AND/OR/NOT and "near" and "adjacent" search refinements greatly improve the results of a search. Search engines that limit their scope to specific sites, and

  6. Next Generation Search Interfaces

    NASA Astrophysics Data System (ADS)

    Roby, W.; Wu, X.; Ly, L.; Goldina, T.

    2015-09-01

    Astronomers are constantly looking for easier ways to access multiple data sets. While much effort is spent on VO, little thought is given to the types of User Interfaces we need to effectively search this sort of data. For instance, an astronomer might need to search Spitzer, WISE, and 2MASS catalogs and images then see the results presented together in one UI. Moving seamlessly between data sets is key to presenting integrated results. Results need to be viewed using first class, web based, integrated FITS viewers, XY Plots, and advanced table display tools. These components should be able to handle very large datasets. To make a powerful Web based UI that can manage and present multiple searches to the user requires taking advantage of many HTML5 features. AJAX is used to start searches and present results. Push notifications (Server Sent Events) monitor background jobs. Canvas is required for advanced result displays. Lesser known CSS3 technologies makes it all flow seamlessly together. At IPAC, we have been developing our Firefly toolkit for several years. We are now using it to solve this multiple data set, multiple queries, and integrated presentation problem to create a powerful research experience. Firefly was created in IRSA, the NASA/IPAC Infrared Science Archive (http://irsa.ipac.caltech.edu). Firefly is the core for applications serving many project archives, including Spitzer, Planck, WISE, PTF, LSST and others. It is also used in IRSA's new Finder Chart and catalog and image displays.

  7. The "Conflicted Dying": The Active Search for Life Extension in Advanced Cancer Through Biomedical Treatment.

    PubMed

    Mohammed, Shan; Peter, Elizabeth; Gastaldo, Denise; Howell, Doris

    2016-03-01

    Using a poststructural perspective, we examine the subjectivities that are produced when advanced cancer patients seek life extension through biomedical treatments. Seven case studies were developed that included 20 interviews with patients, family, nurses, and physicians recruited from a tertiary hospital in Canada, 30 documents, and 5 hours of participant observation. We identify seven types of subjectivity: (a) the Desperate Subject, (b) the Cancer Expert Subject, (c) the Proactive Subject, (d) the Productive Subject, (e) the Mistrusting Subject, (f) the Model Patient Subject, and (g) the Suffering Subject. We characterize the "conflicted dying," a contemporary figure who holds multiple perspectives about seeking curative treatment despite the acknowledgment of death. Using active strategies to gain access to treatment, this figure resists traditional arrangements of power/knowledge established by health care providers. We suggest that the search for life extension is a process of shaping the self to fit certain aesthetical traits associated with surviving cancer. PMID:25711844

  8. A Dark Energy Camera Search for an Optical Counterpart to the First Advanced LIGO Gravitational Wave Event GW150914

    NASA Astrophysics Data System (ADS)

    Soares-Santos, M.; Kessler, R.; Berger, E.; Annis, J.; Brout, D.; Buckley-Geer, E.; Chen, H.; Cowperthwaite, P. S.; Diehl, H. T.; Doctor, Z.; Drlica-Wagner, A.; Farr, B.; Finley, D. A.; Flaugher, B.; Foley, R. J.; Frieman, J.; Gruendl, R. A.; Herner, K.; Holz, D.; Lin, H.; Marriner, J.; Neilsen, E.; Rest, A.; Sako, M.; Scolnic, D.; Sobreira, F.; Walker, A. R.; Wester, W.; Yanny, B.; Abbott, T. M. C.; Abdalla, F. B.; Allam, S.; Armstrong, R.; Banerji, M.; Benoit-Lévy, A.; Bernstein, R. A.; Bertin, E.; Brown, D. A.; Burke, D. L.; Capozzi, D.; Carnero Rosell, A.; Carrasco Kind, M.; Carretero, J.; Castander, F. J.; Cenko, S. B.; Chornock, R.; Crocce, M.; D'Andrea, C. B.; da Costa, L. N.; Desai, S.; Dietrich, J. P.; Drout, M. R.; Eifler, T. F.; Estrada, J.; Evrard, A. E.; Fairhurst, S.; Fernandez, E.; Fischer, J.; Fong, W.; Fosalba, P.; Fox, D. B.; Fryer, C. L.; Garcia-Bellido, J.; Gaztanaga, E.; Gerdes, D. W.; Goldstein, D. A.; Gruen, D.; Gutierrez, G.; Honscheid, K.; James, D. J.; Karliner, I.; Kasen, D.; Kent, S.; Kuropatkin, N.; Kuehn, K.; Lahav, O.; Li, T. S.; Lima, M.; Maia, M. A. G.; Margutti, R.; Martini, P.; Matheson, T.; McMahon, R. G.; Metzger, B. D.; Miller, C. J.; Miquel, R.; Mohr, J. J.; Nichol, R. C.; Nord, B.; Ogando, R.; Peoples, J.; Plazas, A. A.; Quataert, E.; Romer, A. K.; Roodman, A.; Rykoff, E. S.; Sanchez, E.; Scarpine, V.; Schindler, R.; Schubnell, M.; Sevilla-Noarbe, I.; Sheldon, E.; Smith, M.; Smith, N.; Smith, R. C.; Stebbins, A.; Sutton, P. J.; Swanson, M. E. C.; Tarle, G.; Thaler, J.; Thomas, R. C.; Tucker, D. L.; Vikram, V.; Wechsler, R. H.; Weller, J.; DES Collaboration

    2016-06-01

    We report the results of a deep search for an optical counterpart to the gravitational wave (GW) event GW150914, the first trigger from the Advanced LIGO GW detectors. We used the Dark Energy Camera (DECam) to image a 102 deg2 area, corresponding to 38% of the initial trigger high-probability sky region and to 11% of the revised high-probability region. We observed in the i and z bands at 4–5, 7, and 24 days after the trigger. The median 5σ point-source limiting magnitudes of our search images are i = 22.5 and z = 21.8 mag. We processed the images through a difference-imaging pipeline using templates from pre-existing Dark Energy Survey data and publicly available DECam data. Due to missing template observations and other losses, our effective search area subtends 40 deg2, corresponding to a 12% total probability in the initial map and 3% in the final map. In this area, we search for objects that decline significantly between days 4–5 and day 7, and are undetectable by day 24, finding none to typical magnitude limits of i = 21.5, 21.1, 20.1 for object colors (i ‑ z) = 1, 0, ‑1, respectively. Our search demonstrates the feasibility of a dedicated search program with DECam and bodes well for future research in this emerging field.

  9. A dark energy camera search for an optical counterpart to the first advanced LIGO gravitational wave event GW150914

    DOE PAGESBeta

    Soares-Santos, M.

    2016-05-27

    We report the results of a deep search for an optical counterpart to the gravitational wave (GW) event GW150914, the first trigger from the Advanced LIGO GW detectors. We used the Dark Energy Camera (DECam) to image a 102 deg2 area, corresponding to 38% of the initial trigger high-probability sky region and to 11% of the revised high-probability region. We observed in the i and z bands at 4–5, 7, and 24 days after the trigger. The median 5σ point-source limiting magnitudes of our search images are i = 22.5 and z = 21.8 mag. We processed the images throughmore » a difference-imaging pipeline using templates from pre-existing Dark Energy Survey data and publicly available DECam data. Due to missing template observations and other losses, our effective search area subtends 40 deg2, corresponding to a 12% total probability in the initial map and 3% in the final map. In this area, we search for objects that decline significantly between days 4–5 and day 7, and are undetectable by day 24, finding none to typical magnitude limits of i = 21.5, 21.1, 20.1 for object colors (i – z) = 1, 0, –1, respectively. Lastly, our search demonstrates the feasibility of a dedicated search program with DECam and bodes well for future research in this emerging field.« less

  10. Cube search, revisited.

    PubMed

    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

  11. Cube search, revisited

    PubMed Central

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

    2015-01-01

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

  12. Mathematical physics: Search research

    NASA Astrophysics Data System (ADS)

    Shlesinger, Michael F.

    2006-09-01

    How does one best search for non-replenishable targets at unknown positions? An optimized search strategy could be applied to situations as diverse as animal foraging and time-sensitive rescue missions.

  13. Improved limited discrepancy search

    SciTech Connect

    Korf, R.E.

    1996-12-31

    We present an improvement to Harvey and Ginsberg`s limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from the root to the maximum search depth only once. For a complete binary tree of depth d this reduces the asymptotic complexity from O(d+2/2 2{sup d}) to O(2{sup d}). The savings is much less in a partial tree search, or in a heavily pruned tree. The overhead of the improved algorithm on a complete binary tree is only a factor of b/(b - 1) compared to depth-first search. While this constant factor is greater on a heavily pruned tree, this improvement makes limited discrepancy search a viable alternative to depth-first search, whenever the entire tree may not be searched. Finally, we present both positive and negative empirical results on the utility of limited discrepancy search, for the problem of number partitioning.

  14. Inside a Search. Commentary

    ERIC Educational Resources Information Center

    Cooper, Rosie

    2011-01-01

    Lou Marinoff's article, "Inside a Search," discusses the issues college search committees face in the pursuit of qualified faculty members that will be a good fit for their institutions. More often than not, faculty searches are more complex and challenging than the featured article suggests. The economic downturn facing the nation has resulted in…

  15. The Shortcut Search. Governance.

    ERIC Educational Resources Information Center

    Nyland, Larry

    1998-01-01

    Faced with a late-season superintendent search, many districts defer the formal search-and-hire process and entice a senior administrator or former superintendent to serve a one- or two-year stint. One appealing alternative is an abbreviated search. Boards should advertise immediately and efficiently, develop their own criteria, recruit…

  16. Search and Seizure.

    ERIC Educational Resources Information Center

    Murray, Kenneth T.

    This paper examines the practice of search and seizure from a legal perspective. All issues concerning lawful or unlawful search and seizure, whether in a public school or otherwise, are predicated upon the Fourth Amendment to the United States Constitution. The terms "search,""seizure,""probable cause,""reasonable suspicion," and "exclusionary…

  17. Conducting a Web Search.

    ERIC Educational Resources Information Center

    Miller-Whitehead, Marie

    Keyword and text string searches of online library catalogs often provide different results according to library and database used and depending upon how books and journals are indexed. For this reason, online databases such as ERIC often provide tutorials and recommendations for searching their site, such as how to use Boolean search strategies.…

  18. Gravitational waves from Scorpius X-1: A comparison of search methods and prospects for detection with advanced detectors

    NASA Astrophysics Data System (ADS)

    Messenger, C.; Bulten, H. J.; Crowder, S. G.; Dergachev, V.; Galloway, D. K.; Goetz, E.; Jonker, R. J. G.; Lasky, P. D.; Meadors, G. D.; Melatos, A.; Premachandra, S.; Riles, K.; Sammut, L.; Thrane, E. H.; Whelan, J. T.; Zhang, Y.

    2015-07-01

    The low-mass X-ray binary Scorpius X-1 (Sco X-1) is potentially the most luminous source of continuous gravitational-wave radiation for interferometers such as LIGO and Virgo. For low-mass X-ray binaries this radiation would be sustained by active accretion of matter from its binary companion. With the Advanced Detector Era fast approaching, work is underway to develop an array of robust tools for maximizing the science and detection potential of Sco X-1. We describe the plans and progress of a project designed to compare the numerous independent search algorithms currently available. We employ a mock-data challenge in which the search pipelines are tested for their relative proficiencies in parameter estimation, computational efficiency, robustness, and most importantly, search sensitivity. The mock-data challenge data contains an ensemble of 50 Scorpius X-1 (Sco X-1) type signals, simulated within a frequency band of 50-1500 Hz. Simulated detector noise was generated assuming the expected best strain sensitivity of Advanced LIGO [1] and Advanced VIRGO [2] (4 ×10-24 Hz-1 /2 ). A distribution of signal amplitudes was then chosen so as to allow a useful comparison of search methodologies. A factor of 2 in strain separates the quietest detected signal, at 6.8 ×10-26 strain, from the torque-balance limit at a spin frequency of 300 Hz, although this limit could range from 1.2 ×10-25 (25 Hz) to 2.2 ×10-26 (750 Hz) depending on the unknown frequency of Sco X-1. With future improvements to the search algorithms and using advanced detector data, our expectations for probing below the theoretical torque-balance strain limit are optimistic.

  19. Our Sky Now and Then: Searches for Lost Stars and Impossible Effects as Probes of Advanced Extraterrestrial Civilizations

    NASA Astrophysics Data System (ADS)

    Villarroel, Beatriz; Imaz, Inigo; Bergstedt, Josefine

    2016-09-01

    Searches for extraterrestrial intelligence using large survey data often look for possible signatures of astroengineering. We propose searching for physically impossible effects caused by highly advanced technology by carrying out a search for disappearing galaxies and Milky Way stars. We select ∼10 million objects from USNO-B1.0 with low proper motions (μ < 20 mas yr‑1) imaged on the sky in two epochs. We search for objects not found at the expected positions in the Sloan Digital Sky Survey (SDSS) by visually examining images of ∼290,000 USNO-B1.0 objects with no counterpart in the SDSS. We identify some spurious targets in the USNO-B1.0. We find one candidate of interest for follow-up photometry, although it is very uncertain. If the candidate eventually is found, it defines the probability of observing a disappearing-object event in the last decade to less than one in one million in the given samples. Nevertheless, because the complete USNO-B1.0 data set is 100 times larger than any of our samples, we propose an easily accessible citizen science project in search of USNO-B1.0 objects that have disappeared from the SDSS.

  20. University Students' Online Information Searching Strategies in Different Search Contexts

    ERIC Educational Resources Information Center

    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…

  1. VisSearch: A Collaborative Web Searching Environment

    ERIC Educational Resources Information Center

    Lee, Young-Jin

    2005-01-01

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

  2. Searching for inefficiency in visual search.

    PubMed

    Christie, Gregory J; Livingstone, Ashley C; McDonald, John J

    2015-01-01

    The time required to find an object of interest in the visual field often increases as a function of the number of items present. This increase or inefficiency was originally interpreted as evidence for the serial allocation of attention to potential target items, but controversy has ensued for decades. We investigated this issue by recording ERPs from humans searching for a target in displays containing several differently colored items. Search inefficiency was ascribed not to serial search but to the time required to selectively process the target once found. Additionally, less time was required for the target to "pop out" from the rest of the display when the color of the target repeated across trials. These findings indicate that task relevance can cause otherwise inconspicuous items to pop out and highlight the need for direct neurophysiological measures when investigating the causes of search inefficiency. PMID:25203277

  3. Advanced Technologies for Contents Sharing, Exchanging and Searching in E-Learning Systems

    ERIC Educational Resources Information Center

    De Pietro, Orlando; Appratto, Francesco

    2004-01-01

    In this article we explain a semantic analysis model derived from neural networks and pattern classification experiences, based on keyword sets. This model can be used for searching, analyzing, and composing documents in e-learning systems and for permitting inter-platform collaboration and data exchange. In particular, we explain some searching…

  4. Twitter K-H networks in action: Advancing biomedical literature for drug search.

    PubMed

    Hamed, Ahmed Abdeen; Wu, Xindong; Erickson, Robert; Fandy, Tamer

    2015-08-01

    The importance of searching biomedical literature for drug interaction and side-effects is apparent. Current digital libraries (e.g., PubMed) suffer infrequent tagging and metadata annotation updates. Such limitations cause absence of linking literature to new scientific evidence. This demonstrates a great deal of challenges that stand in the way of scientists when searching biomedical repositories. In this paper, we present a network mining approach that provides a bridge for linking and searching drug-related literature. Our contributions here are two fold: (1) an efficient algorithm called HashPairMiner to address the run-time complexity issues demonstrated in its predecessor algorithm: HashnetMiner, and (2) a database of discoveries hosted on the web to facilitate literature search using the results produced by HashPairMiner. Though the K-H network model and the HashPairMiner algorithm are fairly young, their outcome is evidence of the considerable promise they offer to the biomedical science community in general and the drug research community in particular. PMID:26065982

  5. Searching for extraterrestrial civilizations

    NASA Technical Reports Server (NTRS)

    Kuiper, T. B. H.; Morris, M.

    1977-01-01

    Three interrelated assumptions are critically examined in an attempt to outline a productive strategy for a search for extraterrestrial intelligence. Questions concerning the feasibility of interstellar travel are investigated. It is concluded that the probability of interstellar travel is high enough that, given a modest number of advanced civilizations, at least one of them will engage in interstellar voyages and colonize the galaxy. Assuming, however, that technological civilizations are rare the galaxy would be essentially unpopulated. Attention is given to the present lack of contact with extraterrestrial beings and frequencies for interstellar beacons.

  6. The search for extra-terrestrial intelligence.

    PubMed

    Drake, Frank

    2011-02-13

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

  7. Demystifying the Search Button

    PubMed Central

    McKeever, Liam; Nguyen, Van; Peterson, Sarah J.; Gomez-Perez, Sandra

    2015-01-01

    A thorough review of the literature is the basis of all research and evidence-based practice. A gold-standard efficient and exhaustive search strategy is needed to ensure all relevant citations have been captured and that the search performed is reproducible. The PubMed database comprises both the MEDLINE and non-MEDLINE databases. MEDLINE-based search strategies are robust but capture only 89% of the total available citations in PubMed. The remaining 11% include the most recent and possibly relevant citations but are only searchable through less efficient techniques. An effective search strategy must employ both the MEDLINE and the non-MEDLINE portion of PubMed to ensure all studies have been identified. The robust MEDLINE search strategies are used for the MEDLINE portion of the search. Usage of the less robust strategies is then efficiently confined to search only the remaining 11% of PubMed citations that have not been indexed for MEDLINE. The current article offers step-by-step instructions for building such a search exploring methods for the discovery of medical subject heading (MeSH) terms to search MEDLINE, text-based methods for exploring the non-MEDLINE database, information on the limitations of convenience algorithms such as the “related citations feature,” the strengths and pitfalls associated with commonly used filters, the proper usage of Boolean operators to organize a master search strategy, and instructions for automating that search through “MyNCBI” to receive search query updates by email as new citations become available. PMID:26129895

  8. Exotics Searches with Atlas

    NASA Astrophysics Data System (ADS)

    Tykhonov, Andrii

    2015-03-01

    An overview is presented for the non-SUSY searches for New Physics with the ATLAS detector. The results presented use data collected at centerof-mass energies of √ s = 7 TeV and √ s = 8 TeV, for data sets corresponding to a variety of integrated luminosities. Searches using leptons, photons, missing transverse energy, and jets are performed, as well as searches requiring custom jet and track reconstruction, and searches for the so-called lepton jets. No deviations from Standard Model expectations are observed, hence constraints are placed on the phase space of available theoretical models.

  9. How Users Search the Library from a Single Search Box

    ERIC Educational Resources Information Center

    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…

  10. Computerized Literature Searching: An Orientation for the Search Requestor.

    ERIC Educational Resources Information Center

    Fabiano, Emily

    Developed to orient the information seeker to the computerized literature search process, this guide provides background information that will help the user facilitate the search interview and the formation of a search topic, enabling him or her to focus on personal search needs and not on the fundamentals of online searching. Major purposes for…

  11. Job Search, Search Intensity, and Labor Market Transitions

    ERIC Educational Resources Information Center

    Bloemen, Hans G.

    2005-01-01

    Job searches by both the unemployed and employed jobseekers are studied through an empirical structural job search model using a choice variable of search intensity. The resulting influence of search intensity on the labor market transitions is analyzed to give the estimation results of the search and the impact of the benefit level on the search…

  12. SearchLit.

    ERIC Educational Resources Information Center

    Joachim, Robert

    1986-01-01

    Describes file management package offering relatively sophisticated features: conversion of previously downloaded records from commercial database into local file; keyword searching on inverted keyword file; full-text searching on author, title, bibliographic source, abstract; sorting by author, title, bibliographic source, publication year;…

  13. OpenSearch Status

    NASA Technical Reports Server (NTRS)

    Newman, Doug; Silva, Sam; Mitchell, Andrew

    2016-01-01

    We will present an overview of our OpenSearch efforts over the past 6 months. We will discuss our Best Practices and those of CEOS concentrating on the compatibility issues between the two. We will also discuss the state of earth data OpenSearch implementations and their adherence to the standards, extensions and best practices available.

  14. Using Quick Search.

    ERIC Educational Resources Information Center

    Maxfield, Sandy, Ed.; Kabus, Karl, Ed.

    This document is a guide to the use of Quick Search, a library service that provides access to more than 100 databases which contain references to journal articles and other research materials through two commercial systems--BRS After/Dark and DIALOG's Knowledge Index. The guide is divided into five sections: (1) Using Quick Search; (2) The…

  15. Database Searching by Managers.

    ERIC Educational Resources Information Center

    Arnold, Stephen E.

    Managers and executives need the easy and quick access to business and management information that online databases can provide, but many have difficulty articulating their search needs to an intermediary. One possible solution would be to encourage managers and their immediate support staff members to search textual databases directly as they now…

  16. job.search@internet.

    ERIC Educational Resources Information Center

    Allen, Claudia.

    1995-01-01

    Presents job-hunting options and career opportunities available by searching the Internet, as well as tips for consulting others in a field of interest through a listserv or usenet news group. A collection of Internet addresses providing access to information on job search strategies or job availability is provided. (JPS)

  17. Origins of Coordinate Searching.

    ERIC Educational Resources Information Center

    Kilgour, Frederick G.

    1997-01-01

    Reviews the origins of post-coordinate searching and emphasizes that the focal point should be on the searcher, not on the item being indexed. Highlights include the history of the term information retrieval; edge notched punch cards; the "peek-a-boo" system; the Uniterm system; and using computers to search for information. (LRW)

  18. Intermittent search strategies

    NASA Astrophysics Data System (ADS)

    Bénichou, Olivier; Voituriez, Raphael

    2015-10-01

    The following sections are included: * Introduction * Animals looking for food * Model of intermittent search * Minimizing the search time * Should animals really perform Lévy strategies? * How does a protein find its target sequence on DNA? * Active intermittent transport in cells * Optimizing the kinetic rate constant * Robustness of the results * Conclusion * Bibliography

  19. With News Search Engines

    ERIC Educational Resources Information Center

    Gunn, Holly

    2005-01-01

    Although there are many news search engines on the Web, finding the news items one wants can be challenging. Choosing appropriate search terms is one of the biggest challenges. Unless one has seen the article that one is seeking, it is often difficult to select words that were used in the headline or text of the article. The limited archives of…

  20. Online Manuscript Search Service.

    ERIC Educational Resources Information Center

    Bland, Robert N.; Lloyd, James B.

    1983-01-01

    Describes MARC record-based online information retrieval system that provides full search and maintenance capabilities for manuscript records and indexes in the Special Collections Department, Hunter Library, Western Carolina University. Item versus group description of manuscripts, system architecture, searching, and record structure and file…

  1. Searching with probabilities

    SciTech Connect

    Palay, A.J.

    1985-01-01

    This book examines how probability distributions can be used as a knowledge representation technique. It presents a mechanism that can be used to guide a selective search algorithm to solve a variety of tactical chess problems. Topics covered include probabilities and searching the B algorithm and chess probabilities - in practice, examples, results, and future work.

  2. Job Search Information Guide.

    ERIC Educational Resources Information Center

    Alberta Dept. of Education, Edmonton. Special Educational Services Branch.

    This guide was developed to help classroom teachers in Alberta, Canada, assist high school students in preparing for employment. (It was originally designed to accompany Alberta Job Search information presentations.) The guide contains 11 units covering the following topics: introduction, career planning, personal fact sheets, the job search,…

  3. Fixing Dataset Search

    NASA Technical Reports Server (NTRS)

    Lynnes, Chris

    2014-01-01

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

  4. Custom Search Engines: Tools & Tips

    ERIC Educational Resources Information Center

    Notess, Greg R.

    2008-01-01

    Few have the resources to build a Google or Yahoo! from scratch. Yet anyone can build a search engine based on a subset of the large search engines' databases. Use Google Custom Search Engine or Yahoo! Search Builder or any of the other similar programs to create a vertical search engine targeting sites of interest to users. The basic steps to…

  5. Task-Based Information Searching.

    ERIC Educational Resources Information Center

    Vakkari, Pertti

    2003-01-01

    Reviews studies on the relationship between task performance and information searching by end-users, focusing on information searching in electronic environments and information retrieval systems. Topics include task analysis; task characteristics; search goals; modeling information searching; modeling search goals; information seeking behavior;…

  6. Citation Searching: Search Smarter & Find More

    ERIC Educational Resources Information Center

    Hammond, Chelsea C.; Brown, Stephanie Willen

    2008-01-01

    The staff at University of Connecticut are participating in Elsevier's Student Ambassador Program (SAmP) in which graduate students train their peers on "citation searching" research using Scopus and Web of Science, two tremendous citation databases. They are in the fourth semester of these training programs, and they are wildly successful: They…

  7. Needle Federated Search Engine

    2009-12-01

    The Idaho National Laboratory (INL) has combined a number of technologies, tools, and resources to accomplish a new means of federating search results. The resulting product is a search engine called Needle, an open-source-based tool that the INL uses internally for researching across a wide variety of information repositories. Needle has a flexible search interface that allows end users to point at any available data source. A user can select multiple sources such as commercialmore » databases (Web of Science, Engineering Index), external resources (WorldCat, Google Scholar), and internal corporate resources (email, document management system, library collections) in a single interface with one search query. In the future, INL hopes to offer this open-source engine to the public. This session will outline the development processes for making Needle™s search interface and simplifying the federation of internal and external data sources.« less

  8. Needle Federated Search Engine

    SciTech Connect

    2009-12-01

    The Idaho National Laboratory (INL) has combined a number of technologies, tools, and resources to accomplish a new means of federating search results. The resulting product is a search engine called Needle, an open-source-based tool that the INL uses internally for researching across a wide variety of information repositories. Needle has a flexible search interface that allows end users to point at any available data source. A user can select multiple sources such as commercial databases (Web of Science, Engineering Index), external resources (WorldCat, Google Scholar), and internal corporate resources (email, document management system, library collections) in a single interface with one search query. In the future, INL hopes to offer this open-source engine to the public. This session will outline the development processes for making Needle™s search interface and simplifying the federation of internal and external data sources.

  9. Model Specification Searches in Structural Equation Modeling Using Tabu Search.

    ERIC Educational Resources Information Center

    Marcoulides, George A.; Drezner, Zvi; Schumacker, Randall E.

    1998-01-01

    Introduces an alternative structural equation modeling (SEM) specification search approach based on the Tabu search procedure. Using data with known structure, the procedure is illustrated, and its capabilities for specification searches in SEM are demonstrated. (Author/SLD)

  10. Quantum searching application in search based software engineering

    NASA Astrophysics Data System (ADS)

    Wu, Nan; Song, FangMin; Li, Xiangdong

    2013-05-01

    The Search Based Software Engineering (SBSE) is widely used in software engineering for identifying optimal solutions. However, there is no polynomial-time complexity solution used in the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze and compare several quantum search algorithms that could be applied for SBSE: quantum adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and a rapid modified Grover quantum searching method. The Grover's algorithm is thought as the best choice for a large-scaled unstructured data searching and theoretically it can be applicable to any search-space structure and any type of searching problems.

  11. Search Tips: MedlinePlus

    MedlinePlus

    ... of this page: https://medlineplus.gov/searchtips.html Search Tips To use the sharing features on this page, please enable JavaScript. How do I search MedlinePlus? The search box appears at the top ...

  12. Implementation and verification of an advancement to the Galileo system search and rescue service signal simulator

    NASA Astrophysics Data System (ADS)

    Lin, Mo; Wu, Qiongzhi; Liu, Shaobo

    2009-12-01

    Based on the Sino-European cooperation in the Galileo satellite navigation system Search And Rescue(SAR) service, a multi-channel distress beacon signal simulator is presented here. The mathematic model and spectrum analysis of current 406 MHz distress beacons signals is presented which includes Emergency Position Indicating Radio Beacons (EPIRB) for Maritime, Personal Locator Beacons (PLB) for land (road and rail), and Emergency Locator Transmitter (ELT) for aeronautical applications. Based on Software Defined Radio (SDR) and digital IF techniques, the design of a SAR Signal Simulator (SAR-SS) is proposed, which can generate no less than 20 distress signals simultaneously. The Doppler shift and space propagation effect such as ionosphere delay, free space attenuation and etc, are simulated in SAR-SS, which provided a significant test and evaluation capability for SAR/Galileo project. The performance of SAR-SS is more accurate and stabile than the Cospas-Sarsat(C-S) requirement. SAR-SS will be a significant instrument for the Galileo system search and rescue project ground test.

  13. Gradient tabu search.

    PubMed

    Stepanenko, Svetlana; Engels, Bernd

    2007-01-30

    This paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into the tabu list (TL). Trials with various well-known test functions indicate that the GTS is a very promising approach to determine local and global minima of differentiable functions. Possible application areas could be optimization routines for force field parameters or conformational searches for large molecules. PMID:17186482

  14. Correspondence: Searching sequence space

    SciTech Connect

    Youvan, D.C.

    1995-08-01

    This correspondence debates the efficiency and application of genetic algorithms (GAs) to search protein sequence space. The important experimental point is that such sparse searches utilize physically realistic syntheses. In this regard, all GA-based technologies are very similar; they {open_quotes}learn{close_quotes} from their initial sparse search and then generate interesting new proteins within a few iterations. Which GA-based technology is best? That probably depends on the protein and the specific engineering goal. Given the fact that the field of combinatorial chemistry is still in its infancy, it is probably wise to consider all of the proven mutagenesis methods. 19 refs.

  15. The Search for Exomoons

    NASA Astrophysics Data System (ADS)

    Kipping, D. M.

    2011-12-01

    With exoplanet detections becoming routine, astronomers are now vying to characterise these alien worlds. As well as detecting the atmospheres of these exoplanets, part of the characterisation process will undoubtedly involve the search for extrasolar moons. In this work, we explore the motivations for searching for exomoons, review some of the previously proposed detection techniques and finally introduce transit duration variation (TDV) as a proposed search method. We find that these techniques could easily detect Earth-mass exomoons with current instruments and potentially down to Galilean mass moons with future space missions like Kepler.

  16. Improving Search Engine Reliability

    NASA Astrophysics Data System (ADS)

    Pruthi, Jyoti; Kumar, Ela

    2010-11-01

    Search engines on the Internet are used daily to access and find information. While these services are providing an easy way to find information globally, they are also suffering from artificially created false results. This paper describes two techniques that are being used to manipulate the search engines: spam pages (used to achieve higher rankings on the result page) and cloaking (used to feed falsified data into search engines). This paper also describes two proposed methods to fight this kind of misuse, algorithms for both of the formerly mentioned cases of spamdexing.

  17. Investigating the effect of precession on searches for neutron-star-black-hole binaries with Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Harry, Ian W.; Nitz, Alexander H.; Brown, Duncan A.; Lundgren, Andrew P.; Ochsner, Evan; Keppel, Drew

    2014-01-01

    The first direct detection of neutron-star- black-hole binaries will likely be made with gravitational-wave observatories. Advanced LIGO and Advanced Virgo will be able to observe neutron-star- black-hole mergers at a maximum distance of 900 Mpc. To achieve this sensitivity, gravitational-wave searches will rely on using a bank of filter waveforms that accurately model the expected gravitational-wave signal. The emitted signal will depend on the masses of the black hole and the neutron star and also the angular momentum of both components. The angular momentum of the black hole is expected to be comparable to the orbital angular momentum when the system is emitting gravitational waves in Advanced LIGO's and Advanced Virgo's sensitive band. This angular momentum will affect the dynamics of the inspiralling system and alter the phase evolution of the emitted gravitational-wave signal. In addition, if the black hole's angular momentum is not aligned with the orbital angular momentum, it will cause the orbital plane of the system to precess. In this work we demonstrate that if the effect of the black hole's angular momentum is neglected in the waveform models used in gravitational-wave searches, the detection rate of (10+1.4)M⊙ neutron-star- black-hole systems with isotropic spin distributions would be reduced by 33%-37% in comparison to a hypothetical perfect search at a fixed signal-to-noise ratio threshold. The error in this measurement is due to uncertainty in the post-Newtonian approximations that are used to model the gravitational-wave signal of neutron-star- black-hole inspiralling binaries. We describe a new method for creating a bank of filter waveforms where the black hole has nonzero angular momentum that is aligned with the orbital angular momentum. With this bank we find that the detection rate of (10+1.4)M⊙ neutron-star- black-hole systems would be reduced by 26%-33%. Systems that will not be detected are ones where the precession of the orbital

  18. Collaboration during visual search.

    PubMed

    Malcolmson, Kelly A; Reynolds, Michael G; Smilek, Daniel

    2007-08-01

    Two experiments examine how collaboration influences visual search performance. Working with a partner or on their own, participants reported whether a target was present or absent in briefly presented search displays. We compared the search performance of individuals working together (collaborative pairs) with the pooled responses of the individuals working alone (nominal pairs). Collaborative pairs were less likely than nominal pairs to correctly detect a target and they were less likely to make false alarms. Signal detection analyses revealed that collaborative pairs were more sensitive to the presence of the target and had a more conservative response bias than the nominal pairs. This pattern was observed even when the presence of another individual was matched across pairs. The results are discussed in the context of task-sharing, social loafing and current theories of visual search. PMID:17972737

  19. New Martian satellite search

    NASA Technical Reports Server (NTRS)

    1983-01-01

    The approach pictures taken by the Viking 1 and Viking 2 spacecrafts two days before their Mars orbital insertion maneuvers were analyzed in order to search for new satellites within the orbit of Phobos. To accomplish this task, search procedure and analysis strategy were formulated, developed and executed using the substantial image processing capabilities of the Image Processing Laboratory at the Jet Propulsion Laboratory. The development of these new search capabilities should prove to be valuable to NASA in processing of image data obtained from other spacecraft missions. The result of applying the search procedures to the Viking approach pictures was as follows: no new satellites of comparable size (approx. 20 km) and brightness to Phobos or Demios were detected within the orbit of Phobos.

  20. Cost of Computer Searching

    ERIC Educational Resources Information Center

    Chenery, Peter J.

    1973-01-01

    The program described has the primary objective of making Federally generated technology and research information available to public and private agencies. Cost analysis, data banks, and search strategies are explained. (Author/DH)

  1. Effective Search Strategies.

    ERIC Educational Resources Information Center

    Hlava, Marjorie M. K.; Knox, Douglas R.

    1979-01-01

    Discusses problem preparation and specification along with search strategies and techniques employed by an information scientist in assisting users of on-line data bases, and briefly reviews ways to save computer time. (CWM)

  2. Automated search for supernovae

    SciTech Connect

    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.

  3. Web Search Engines.

    ERIC Educational Resources Information Center

    Schwartz, Candy

    1998-01-01

    Looks briefly at the history of World Wide Web search engine development and considers the current state of affairs. Reflects on future directions in terms of personalization, summarization, query expansion, coverage, and metadata. (Author/AEF)

  4. Better searching through science.

    PubMed

    Voss, D

    2001-09-14

    The explosive growth of the World Wide Web has produced frustration for researchers seeking quality content and pinpoint results among the noise and spam. Now, a handful of companies and academic researchers are working on a new breed of search engines to undo this second curse of Babel. These next-generation search tools will let scientists drill deeper into the billion-page Web. PMID:11557874

  5. ArraySearch: A Web-Based Genomic Search Engine.

    PubMed

    Wilson, Tyler J; Ge, Steven X

    2012-01-01

    Recent advances in microarray technologies have resulted in a flood of genomics data. This large body of accumulated data could be used as a knowledge base to help researchers interpret new experimental data. ArraySearch finds statistical correlations between newly observed gene expression profiles and the huge source of well-characterized expression signatures deposited in the public domain. A search query of a list of genes will return experiments on which the genes are significantly up- or downregulated collectively. Searches can also be conducted using gene expression signatures from new experiments. This resource will empower biological researchers with a statistical method to explore expression data from their own research by comparing it with expression signatures from a large public archive. PMID:22474412

  6. GW150914: First results from the search for binary black hole coalescence with Advanced LIGO

    NASA Astrophysics Data System (ADS)

    Abbott, B. P.; Abbott, R.; Abbott, T. D.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allocca, A.; Altin, P. A.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Babak, S.; Bacon, P.; Bader, M. K. M.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bavigadda, V.; Bazzan, M.; Behnke, B.; Bejger, M.; Bell, A. S.; Bell, C. J.; Berger, B. K.; Bergman, J.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Birney, R.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bogan, C.; Bohe, A.; Bohémier, K.; Bojtos, P.; Bond, C.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Calderón Bustillo, J.; Callister, T.; Calloni, E.; Camp, J. B.; Cannon, K. C.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Casanueva Diaz, J.; Casentini, C.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Cerboni Baiardi, L.; Cerretani, G.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, H. Y.; Chen, Y.; Cheng, C.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Clayton, J. H.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Cokelaer, T.; Colla, A.; Collette, C. G.; Cominsky, L.; Constancio, M.; Conte, A.; Conti, L.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J.-P.; Countryman, S. T.; Couvares, P.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Darman, N. S.; Dattilo, V.; Dave, I.; Daveloza, H. P.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; De, S.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; DeRosa, R. T.; De Rosa, R.; DeSalvo, R.; Dhurandhar, S.; Díaz, M. C.; Dietz, A.; Di Fiore, L.; Di Giovanni, M.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Virgilio, A.; Dojcinoski, G.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Engels, W.; Essick, R. C.; Etzel, T.; Evans, M.; Evans, T. M.; Everett, R.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fotopoulos, N.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H. A. G.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S. G.; Garufi, F.; Gatto, A.; Gaur, G.; Gehrels, N.; Gemme, G.; Gendre, B.; Genin, E.; Gennai, A.; George, J.; Gergely, L.; Germain, V.; Ghosh, A.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glaefke, A.; Goetz, E.; Goetz, R.; Goggin, L. M.; Gondan, L.; González, G.; Gonzalez Castro, J. M.; Gopakumar, A.; Gordon, N. A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Graef, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hacker, J. J.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hannam, M. D.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Hofman, D.; Hollitt, S. E.; Holt, K.; Holz, D. E.; Hopkins, P.; Hosken, D. J.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huang, S.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Idrisy, A.; Indik, N.; Ingram, D. R.; Inta, R.; Isa, H. N.; Isac, J.-M.; Isi, M.; Islas, G.; Isogai, T.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jang, H.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Jonker, R. J. G.; Ju, L.; Haris, K.; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kaur, T.; Kawabe, K.; Kawazoe, F.; Kéfélian, F.; Kehl, M. S.; Keitel, D.; Kelley, D. B.; Kells, W.; Keppel, D. G.; Kennedy, R.; Key, J. S.; Khalaidovski, A.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, C.; Kim, J.; Kim, K.; Kim, Nam-Gyu; Kim, Namjun; Kim, Y.-M.; King, E. J.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Kleybolte, L.; Klimenko, S.; Koehlenbeck, S. M.; Kokeyama, K.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kringel, V.; Krishnan, B.; Królak, A.; Krueger, C.; Kuehn, G.; Kumar, P.; Kuo, L.; Kutynia, A.; Lackey, B. D.; Landry, M.; Lange, J.; Lantz, B.; Lasky, P. D.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, K.; Lenon, A.; Leonardi, M.; Leong, J. R.; Leroy, N.; Letendre, N.; Levin, Y.; Levine, B. M.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Lockerbie, N. A.; Logue, J.; Lombardi, A. L.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lück, H.; Lundgren, A. P.; Luo, J.; Lynch, R.; Ma, Y.; MacDonald, T.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magaña-Sandoval, F.; Magee, R. M.; Mageswaran, M.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Mandel, I.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martin, R. M.; Martynov, D. V.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Matichard, F.; Matone, L.; Mavalvala, N.; Mazumder, N.; Mazzolo, G.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McGuire, S. C.; McIntyre, G.; McIver, J.; McKechan, D. J. A.; McManus, D. J.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Melatos, A.; Mendell, G.; Mendoza-Gandara, D.; Mercer, R. A.; Merilh, E.; Merzougui, M.; Meshkov, S.; Messaritaki, E.; Messenger, C.; Messick, C.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, J.; Millhouse, M.; Minenkov, Y.; Ming, J.; Mirshekari, S.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, C. L.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Murphy, D. J.; Murray, P. G.; Mytidis, A.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Necula, V.; Nedkova, K.; Nelemans, G.; Neri, M.; Neunzert, A.; Newton, G.; Nguyen, T. T.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; O'Dell, J.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pan, Y.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Patrick, Z.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perreca, A.; Phelps, M.; Piccinni, O.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poggiani, R.; Popolizio, P.; Post, A.; Powell, J.; Prasad, J.; Predoi, V.; Premachandra, S. S.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Principe, M.; Privitera, S.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Pürrer, M.; Qi, H.; Qin, J.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rakhmanov, M.; Rapagnani, P.; Raymond, V.; Razzano, M.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Ricci, F.; Riles, K.; Robertson, N. A.; Robie, R.; Robinet, F.; Robinson, C.; Rocchi, A.; Rodriguez, A. C.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sanchez, E. J.; Sandberg, V.; Sandeen, B.; Sanders, J. R.; Santamaría, L.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Schilling, R.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schönbeck, A.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Serna, G.; Setyawati, Y.; Sevigny, A.; Shaddock, D. A.; Shah, S.; Shahriar, M. S.; Shaltev, M.; Shao, Z.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sigg, D.; Silva, A. D.; Simakov, D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, J. R.; Smith, N. D.; Smith, R. J. E.; Son, E. J.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stone, R.; Strain, K. A.; Straniero, N.; Stratta, G.; Strauss, N. A.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sutton, P. J.; Swinkels, B. L.; Szczepańczyk, M. J.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tápai, M.; Tarabrin, S. P.; Taracchini, A.; Taylor, R.; Theeg, T.; Thirugnanasambandam, M. P.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Tomlinson, C.; Tonelli, M.; Torres, C. V.; Torrie, C. I.; Töyrä, D.; Travasso, F.; Traylor, G.; Trifirò, D.; Tringali, M. C.; Trozzo, L.; Tse, M.; Turconi, M.; Tuyenbayev, D.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahlbruch, H.; Vajente, G.; Valdes, G.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van Den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Vetrano, F.; Viceré, A.; Vinciguerra, S.; Vine, D. J.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, M.; Wang, X.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Welborn, T.; Wen, L.; Weßels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; White, D. J.; Whiting, B. F.; Wiesner, K.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Wittel, H.; Woan, G.; Worden, J.; Wright, J. L.; Wu, G.; Yablon, J.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, H.; Yvert, M.; ZadroŻny, A.; Zangrando, L.; Zanolin, M.; Zendri, J.-P.; Zevin, M.; Zhang, F.; Zhang, L.; Zhang, M.; Zhang, Y.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zuraw, S. E.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

    2016-06-01

    On September 14, 2015, at 09∶50:45 UTC the two detectors of the Laser Interferometer Gravitational-Wave Observatory (LIGO) simultaneously observed the binary black hole merger GW150914. We report the results of a matched-filter search using relativistic models of compact-object binaries that recovered GW150914 as the most significant event during the coincident observations between the two LIGO detectors from September 12 to October 20, 2015 GW150914 was observed with a matched-filter signal-to-noise ratio of 24 and a false alarm rate estimated to be less than 1 event per 203000 years, equivalent to a significance greater than 5.1 σ .

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

    ERIC Educational Resources Information Center

    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…

  8. Improved Search Techniques

    NASA Technical Reports Server (NTRS)

    Albornoz, Caleb Ronald

    2012-01-01

    Thousands of millions of documents are stored and updated daily in the World Wide Web. Most of the information is not efficiently organized to build knowledge from the stored data. Nowadays, search engines are mainly used by users who rely on their skills to look for the information needed. This paper presents different techniques search engine users can apply in Google Search to improve the relevancy of search results. According to the Pew Research Center, the average person spends eight hours a month searching for the right information. For instance, a company that employs 1000 employees wastes $2.5 million dollars on looking for nonexistent and/or not found information. The cost is very high because decisions are made based on the information that is readily available to use. Whenever the information necessary to formulate an argument is not available or found, poor decisions may be made and mistakes will be more likely to occur. Also, the survey indicates that only 56% of Google users feel confident with their current search skills. Moreover, just 76% of the information that is available on the Internet is accurate.

  9. Search and heuristics

    SciTech Connect

    Pearl, J.

    1983-01-01

    This work is comprised of articles which are representative of current research on search and heuristics. The general theme is the quest for understanding the workings of heuristic knowledge; how it is acquired, stored and used by people, how it can be represented and utilized by machines and what makes one heuristic succeed where others fail. Topics covered include the following: search and reasoning in problem solving; theory formation by heuristic search; the nature of heuristics II: background and examples; Eurisko: a program that learns new heuristics and domain concepts; the nature of heuristics III: program design and results; searching for an optimal path in a tree with random costs; search rearrangement backtracking and polynomial average time; consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics; general branch and bound formulation for understanding and synthesizing and/or tree search procedures; a minimax algorithm better than alpha-beta. yes and no; and pathology on game trees revisited, and an alternative to minimaxing.

  10. Global OpenSearch

    NASA Astrophysics Data System (ADS)

    Newman, D. J.; Mitchell, A. E.

    2015-12-01

    At AGU 2014, NASA EOSDIS demonstrated a case-study of an OpenSearch framework for Earth science data discovery. That framework leverages the IDN and CWIC OpenSearch API implementations to provide seamless discovery of data through the 'two-step' discovery process as outlined by the Federation for Earth Sciences (ESIP) OpenSearch Best Practices. But how would an Earth Scientist leverage this framework and what are the benefits? Using a client that understands the OpenSearch specification and, for further clarity, the various best practices and extensions, a scientist can discovery a plethora of data not normally accessible either by traditional methods (NASA Earth Data Search, Reverb, etc) or direct methods (going to the source of the data) We will demonstrate, via the CWICSmart web client, how an earth scientist can access regional data on a regional phenomena in a uniform and aggregated manner. We will demonstrate how an earth scientist can 'globalize' their discovery. You want to find local data on 'sea surface temperature of the Indian Ocean'? We can help you with that. 'European meteorological data'? Yes. 'Brazilian rainforest satellite imagery'? That too. CWIC allows you to get earth science data in a uniform fashion from a large number of disparate, world-wide agencies. This is what we mean by Global OpenSearch.

  11. [Searching articles and their management].

    PubMed

    Tomizawa, Yasuko

    2010-05-01

    The development of digitalizing technology and the Internet has enabled medical doctors and researchers in medicine to search and read the latest articles at their desk without visiting a library. As a result of the time and effort spent for searching articles can be extremely reduced by learning how to use effective tools in combination, the time for the research activity will certainly be greatly saved. It is promising that the advancement of science database, online journals, evaluating system of the journal impact will be great help for researchers. PMID:20446610

  12. Technology Used in Online Searching.

    ERIC Educational Resources Information Center

    Howden, Norman; Dillard, John

    1991-01-01

    Discusses various types of technology used in online searching based on a survey of special libraries and online search services in the Dallas-Fort Worth area. The use of modem control programs, gateway software packages, CD-ROM, and LANs (local area networks) is examined, and intermediary searching versus end-user searching is considered. (10…

  13. Online Patent Searching: The Realities.

    ERIC Educational Resources Information Center

    Kaback, Stuart M.

    1983-01-01

    Considers patent subject searching capabilities of major online databases, noting patent claims, "deep-indexed" files, test searches, retrieval of related references, multi-database searching, improvements needed in indexing of chemical structures, full text searching, improvements needed in handling numerical data, and augmenting a subject search…

  14. Standardization of Keyword Search Mode

    ERIC Educational Resources Information Center

    Su, Di

    2010-01-01

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

  15. SUSY Searches at the Tevatron

    SciTech Connect

    Zivkovic, L.

    2011-07-01

    In this article results from supersymmetry searches at D0 and CDF are reported. Searches for third generation squarks, searches for gauginos, and searches for models with R-parity violation are described. As no signs of supersymmetry for these models are observed, the most stringent limits to date are presented.

  16. Product Searching with Shopping Bots.

    ERIC Educational Resources Information Center

    Rowley, Jennifer

    2000-01-01

    Using trial searches for three best-selling books, this study examined the search facilities offered by shopping bots, which support consumers with the product search and identification stage in e-shopping. Findings indicate that effectiveness of bots not only depends upon search facilities but also upon product coverage, and other added value…

  17. Planet formation and searches

    NASA Astrophysics Data System (ADS)

    Montgomery, Ryan Michael

    2009-08-01

    This thesis explores the possibilities for discovery of terrestrial-mass planets in the habitable zones of their host stars. Towards this aim, we present the results of three projects and discuss another two preliminary studies of further explorations. In so doing, we explore a fairly comprehensive range of possibilities regarding the formation and detection of terrestrial- mass planets in the habitable zone. We first study the potential for terrestrial planets to form in situ in and around the habitable zones of M-dwarf stars. We proceed to explore the feasibility of searches for these planets using the transit method via Monte- Carlo simulations. We find that M-dwarfs pose an interesting challenge for study: being inherently dim, widely spread on the sky, and photometrically variable. We present results of simulated ground-based transit search campaigns as well as simulated searches from a modest satellite mission. Our second project is a straightforward extension of the previous study: a collaborative effort to search for transit signals around the nearest M-dwarf: Proxima Centauri. We describe our observations as well as the Monte-Carlo analysis used to place constraints on the possible planetary radii and periods. Our third project is a search for transiting extra-solar Jovian planets using the Rossiter-McLaughlin effect. We search through the private Keck radial- velocity datasets for undiscovered Rossiter-McLaughlin signals. We present our results in the form of both strong null-result datasets as well as potential transiting systems. We then briefly analyze these larger Jovian planets for potential to harbor potentially habitable terrestrial satellites. Our final preliminary analysis looks into the potential for the Large Synoptic Survey Telescope to detect transiting Neptune-mass planets orbiting M-dwarfs which could then lead to terrestrial-mass planet detections. The sum of these efforts is a comprehensive investigation into the likelihood and

  18. What Top-Down Task Sets Do for Us: An ERP Study on the Benefits of Advance Preparation in Visual Search

    ERIC Educational Resources Information Center

    Eimer, Martin; Kiss, Monika; Nicholas, Susan

    2011-01-01

    When target-defining features are specified in advance, attentional target selection in visual search is controlled by preparatory top-down task sets. We used ERP measures to study voluntary target selection in the absence of such feature-specific task sets, and to compare it to selection that is guided by advance knowledge about target features.…

  19. An Exploratory Survey of Student Perspectives Regarding Search Engines

    ERIC Educational Resources Information Center

    Alshare, Khaled; Miller, Don; Wenger, James

    2005-01-01

    This study explored college students' perceptions regarding their use of search engines. The main objective was to determine how frequently students used various search engines, whether advanced search features were used, and how many search engines were used. Various factors that might influence student responses were examined. Results showed…

  20. Searching strategies in Dictyostelium

    NASA Astrophysics Data System (ADS)

    Li, Liang; Cox, Edward

    2007-03-01

    Levy walks are known to be the best strategy for optimizing non-destructive search times, while an intermittent two-state searching process optimizes the destructive case. Here we ask about hunting strategy in Dictyostelium amoebae when they cannot know where their food is. We show that correlated random walks with two typical correlation time scales bias their search, improving the search outcome. Further analysis indicates that cell trajectories consist of runs and turns. Strikingly, amoebae remember the last turn, and have a strong turning preference away from the last turn. Autocorrelation analysis of turn sequences indicates that this tendency does not persist beyond the nth+1 turn. Computer simulations reveal that this bias contributes to the longer of the two correlation times. The search rules are essentially the same when cells are continuously stimulated by cAMP, with different persistence times and lengths. Interestingly, new pseudopods form in an orientation opposite to the following turn. One of the correlation timescales is approximately 30 seconds in all cases, thus indicating a short-lived cellular process, while the other is 9 to 15 minutes suggesting a process sensitive to external signals, perhaps pseudopod extensions during turning.

  1. Paleomagnetic database search possible

    NASA Astrophysics Data System (ADS)

    Harbert, William

    I have recently finished an on-line search program which allows remote users to search the “Abase” ASCII version of the World Paleomagnetic Database developed by Lock and McElhinny [1991]. The program is very simple to use and will search the Soviet, non-Soviet, rock unit, and reference databases and create output files that can be downloaded back to a researcher's local system using the ftp command.To use Search, telnet to 130.49.3.1 (earth.eps.pitt.edu) and login as the user “Search.rdquo There is no password, and the user is asked a series of questions, which define the geographic region and ages of interest. The program will also ask for an identifier with which to create the output file names. The program has three modes of operation: text-only, Tektronix graphics, or X11l/R5 graphics; the proper choice depends on the computer hardware that is used by the searcher.

  2. Advances in nowcasting influenza-like illness rates using search query logs

    NASA Astrophysics Data System (ADS)

    Lampos, Vasileios; Miller, Andrew C.; Crossan, Steve; Stefansen, Christian

    2015-08-01

    User-generated content can assist epidemiological surveillance in the early detection and prevalence estimation of infectious diseases, such as influenza. Google Flu Trends embodies the first public platform for transforming search queries to indications about the current state of flu in various places all over the world. However, the original model significantly mispredicted influenza-like illness rates in the US during the 2012-13 flu season. In this work, we build on the previous modeling attempt, proposing substantial improvements. Firstly, we investigate the performance of a widely used linear regularized regression solver, known as the Elastic Net. Then, we expand on this model by incorporating the queries selected by the Elastic Net into a nonlinear regression framework, based on a composite Gaussian Process. Finally, we augment the query-only predictions with an autoregressive model, injecting prior knowledge about the disease. We assess predictive performance using five consecutive flu seasons spanning from 2008 to 2013 and qualitatively explain certain shortcomings of the previous approach. Our results indicate that a nonlinear query modeling approach delivers the lowest cumulative nowcasting error, and also suggest that query information significantly improves autoregressive inferences, obtaining state-of-the-art performance.

  3. Advances in nowcasting influenza-like illness rates using search query logs

    PubMed Central

    Lampos, Vasileios; Miller, Andrew C.; Crossan, Steve; Stefansen, Christian

    2015-01-01

    User-generated content can assist epidemiological surveillance in the early detection and prevalence estimation of infectious diseases, such as influenza. Google Flu Trends embodies the first public platform for transforming search queries to indications about the current state of flu in various places all over the world. However, the original model significantly mispredicted influenza-like illness rates in the US during the 2012–13 flu season. In this work, we build on the previous modeling attempt, proposing substantial improvements. Firstly, we investigate the performance of a widely used linear regularized regression solver, known as the Elastic Net. Then, we expand on this model by incorporating the queries selected by the Elastic Net into a nonlinear regression framework, based on a composite Gaussian Process. Finally, we augment the query-only predictions with an autoregressive model, injecting prior knowledge about the disease. We assess predictive performance using five consecutive flu seasons spanning from 2008 to 2013 and qualitatively explain certain shortcomings of the previous approach. Our results indicate that a nonlinear query modeling approach delivers the lowest cumulative nowcasting error, and also suggest that query information significantly improves autoregressive inferences, obtaining state-of-the-art performance. PMID:26234783

  4. Advances in nowcasting influenza-like illness rates using search query logs.

    PubMed

    Lampos, Vasileios; Miller, Andrew C; Crossan, Steve; Stefansen, Christian

    2015-01-01

    User-generated content can assist epidemiological surveillance in the early detection and prevalence estimation of infectious diseases, such as influenza. Google Flu Trends embodies the first public platform for transforming search queries to indications about the current state of flu in various places all over the world. However, the original model significantly mispredicted influenza-like illness rates in the US during the 2012-13 flu season. In this work, we build on the previous modeling attempt, proposing substantial improvements. Firstly, we investigate the performance of a widely used linear regularized regression solver, known as the Elastic Net. Then, we expand on this model by incorporating the queries selected by the Elastic Net into a nonlinear regression framework, based on a composite Gaussian Process. Finally, we augment the query-only predictions with an autoregressive model, injecting prior knowledge about the disease. We assess predictive performance using five consecutive flu seasons spanning from 2008 to 2013 and qualitatively explain certain shortcomings of the previous approach. Our results indicate that a nonlinear query modeling approach delivers the lowest cumulative nowcasting error, and also suggest that query information significantly improves autoregressive inferences, obtaining state-of-the-art performance. PMID:26234783

  5. Neuron-Miner: An Advanced Tool for Morphological Search and Retrieval in Neuroscientific Image Databases.

    PubMed

    Conjeti, Sailesh; Mesbah, Sepideh; Negahdar, Mohammadreza; Rautenberg, Philipp L; Zhang, Shaoting; Navab, Nassir; Katouzian, Amin

    2016-10-01

    The steadily growing amounts of digital neuroscientific data demands for a reliable, systematic, and computationally effective retrieval algorithm. In this paper, we present Neuron-Miner, which is a tool for fast and accurate reference-based retrieval within neuron image databases. The proposed algorithm is established upon hashing (search and retrieval) technique by employing multiple unsupervised random trees, collectively called as Hashing Forests (HF). The HF are trained to parse the neuromorphological space hierarchically and preserve the inherent neuron neighborhoods while encoding with compact binary codewords. We further introduce the inverse-coding formulation within HF to effectively mitigate pairwise neuron similarity comparisons, thus allowing scalability to massive databases with little additional time overhead. The proposed hashing tool has superior approximation of the true neuromorphological neighborhood with better retrieval and ranking performance in comparison to existing generalized hashing methods. This is exhaustively validated by quantifying the results over 31266 neuron reconstructions from Neuromorpho.org dataset curated from 147 different archives. We envisage that finding and ranking similar neurons through reference-based querying via Neuron Miner would assist neuroscientists in objectively understanding the relationship between neuronal structure and function for applications in comparative anatomy or diagnosis. PMID:27155864

  6. Searching for corrosion intelligence

    SciTech Connect

    Roberge, P.R.

    1999-11-01

    The incredible progress in computing power and availability has created a tremendous wealth of information available at the touch of a few buttons. However, such wealth can easily provoke what is commonly described as `information overload.` The massive number of connections produced by a single search of the Web, for example, can greatly overwhelm users of this new technology. The rapidity of Web searches is due to the synergy between progress made in network connectivity protocols, intelligent search strategies and supporting hardware. This paper will attempt to define the basic elements of machine intelligence in the context of corrosion engineering and examine what has been done or could be done to introduce artificial thinking into daily operations.

  7. Developing a Systematic Patent Search Training Program

    ERIC Educational Resources Information Center

    Zhang, Li

    2009-01-01

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

  8. Searching with iterated maps

    PubMed Central

    Elser, V.; Rankenburg, I.; Thibault, P.

    2007-01-01

    In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku. PMID:17202267

  9. Search for Gluonic Excitations

    SciTech Connect

    Paul Eugenio

    2007-10-01

    Studies of meson spectra via strong decays provide insight regarding QCD at the confinement scale. These studies have led to phenomenological models for QCD such as the constituent quark model. However, QCD allows for a much richer spectrum of meson states which include extra states such as exotics, hybrids, multi-quarks, and glueballs. First discussion of the status of exotic meson searches is given followed by a discussion of plans at Jefferson Lab to double the energy of the machine to 12 GeV, which will allow us to access photoproduction of mesons in search for gluonic excited states.

  10. Search for Gluonic Excitations

    SciTech Connect

    Eugenio, Paul

    2007-10-26

    Studies of meson spectra via strong decays provide insight regarding QCD at the confinement scale. These studies have led to phenomenological models for QCD such as the constituent quark model. However, QCD allows for a much richer spectrum of meson states which include extra states such as exotics, hybrids, multi-quarks, and glueballs. First discussion of the status of exotic meson searches is given followed by a discussion of plans at Jefferson Lab to double the energy of the machine to 12 GeV, which will allow us to access photoproduction of mesons in search for gluonic excited states.

  11. Robust quantum spatial search

    NASA Astrophysics Data System (ADS)

    Tulsi, Avatar

    2016-07-01

    Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size O(1{/}√{ln N}) which is exponentially better than quantum walk algorithms for which tolerable error size is only O(ln N{/}√{N}). Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement experimentally compared to quantum walk algorithms.

  12. Searching for excellence

    NASA Astrophysics Data System (ADS)

    Yager, Robert E.

    Visits to six school districts which were identified by the National Science Teachers Association's Search for Excellence program were made during 1983 by teams of 17 researchers. The reports were analyzed in search for common characteristics that can explain the requirements necessary for excellent science programs. The results indicate that creative ideas, administrative and community involvement, local ownership and pride, and well-developed in-service programs and implementation strategies are vital. Exceptional teachers with boundless energies also seem to exist where exemplary science programs are found.

  13. Search for glueballs

    SciTech Connect

    Toki, W.

    1997-06-01

    In these Summer School lectures, the author reviews the results of recent glueball searches. He begins with a brief review of glueball phenomenology and meson spectroscopy, including a discussion of resonance behavior. The results on the f{sub o}(1500) and f{sub J}(1700) resonances from proton-antiproton experiments and radiative J/{Psi} decays are discussed. Finally, {pi}{pi} and {eta}{pi} studies from D{sub s} decays and exotic meson searches are reviewed. 46 refs., 40 figs.

  14. Robust quantum spatial search

    NASA Astrophysics Data System (ADS)

    Tulsi, Avatar

    2016-04-01

    Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size O(1{/}√{N}) which is exponentially better than quantum walk algorithms for which tolerable error size is only O(ln N{/}√{N}) . Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement experimentally compared to quantum walk algorithms.

  15. Searching for extraterrestrial civilizations.

    PubMed

    Kuiper, T B; Morris, M

    1977-05-01

    We have argued that planning for a search for extraterrestrial intelligence should involve a minimum number of assumptions. In view of the feasibility (at our present level of understanding) of using nuclear fusion to effect interstellar travel at a speed of 0.1c, it appears unwarranted (at this time) to assume that it would not occur for at least some technologically advanced civilizations. One cannot even conclude that humans would not attempt this within the next few centuries. On the contrary, the most likely future situation, given the maintenance of technological growth and the absence of extraterrestrial interference, is that our civilization will explore and colonize our galactic neighborhood. A comparison of the time scales of galactic evolution and interstellar travel leads to the conclusion that the galaxy is either essentially empty with respect to technological civilizations or extensively colonized. In the former instance, a SETI would be unproductive. In the latter, a SETI could be fruitful if a signal has been deliberately directed at the earth or at an alien outpost, probe, or communication relay station in our solar system. In the former case, an existing antenna would probably be sufficient to detect the signal. In the latter case, success would depend on the way in which the communications were coded. Failure to detect a signal could permit any of the following conclusions: (i) the galaxy is devoid of technological civilizations, advanced beyond our own, (ii) such civilizations exist, but cannot (for some reason which is presently beyond our ken) engage in interstellar colonization, or (iii) such civilizations are not attempting overt contact with terrestrial civilizations and their intercommunications, if present, are not coded in a simple way. To plan at this time for a high-cost, large-array SETI based on the last two possibilities appears to be rather premature. PMID:17760037

  16. Proteomic strategies in the search for novel pancreatic cancer biomarkers and drug targets: recent advances and clinical impact.

    PubMed

    Coleman, Orla; Henry, Michael; McVey, Gerard; Clynes, Martin; Moriarty, Michael; Meleady, Paula

    2016-01-01

    Pancreatic ductal adenocarcinoma (PDAC) is one of the deadliest cancers; despite a low incidence rate it is the fourth leading cause of cancer-related death in the world. Improvement of the diagnosis, prognosis and treatment remains the main focus of pancreatic cancer research. Rapid developments in proteomic technologies has improved our understanding of the pancreatic cancer proteome. Here, the authors summarise the recent proteomic strategies undertaken in the search for: novel biomarkers for early diagnosis, pancreatic cancer-specific proteins which may be used for novel targeted therapies and proteins which may be useful for monitoring disease progression post-therapy. Recent advances and findings discussed here provide great promise of having a significant clinical impact and improving the outcome of patients with this malignancy. PMID:26985644

  17. Job Search Workshop Curriculum.

    ERIC Educational Resources Information Center

    Ferraro, Carole

    This bilingual curriculum was developed by job search counselors at a Seattle nonprofit social service agency in conjunction with Washington state's welfare reform initiative, WorkFirst. The workshops were 30-hours long and were given over a 2-week period. The classes were conducted in the students' native language, as well as in English by an…

  18. In Search of Insight.

    ERIC Educational Resources Information Center

    Kaplan, Craig A.; Simon, Herbert A.

    1990-01-01

    Attaining the insight needed to solve the Mutilated Checkerboard problem, which requires discovery of an effective problem representation (EPR), is described. Performance on insight problems can be predicted from the availability of generators and constraints in the search for an EPR. Data for 23 undergraduates were analyzed. (TJH)

  19. Google Search Mastery Basics

    ERIC Educational Resources Information Center

    Hill, Paul; MacArthur, Stacey; Read, Nick

    2014-01-01

    Effective Internet search skills are essential with the continually increasing amount of information available on the Web. Extension personnel are required to find information to answer client questions and to conduct research on programs. Unfortunately, many lack the skills necessary to effectively navigate the Internet and locate needed…

  20. Visual Search and Reading.

    ERIC Educational Resources Information Center

    Calfee, Robert C.; Jameson, Penny

    The effect on reading speed of the number of target items being searched for and the number of target occurrences in the text was examined. The subjects, 24 college undergraduate volunteers, were presented with a list of target words, and then they read a passage for comprehension which contained occurrences of the target words (Experiment1) or…

  1. Evaluation of Online Searches.

    ERIC Educational Resources Information Center

    Blood, Richard W.

    Based on an analysis of online search evaluation forms collected from all types of U.S. libraries, and a pilot test of a draft evaluation form in selected federal research libraries, this report presents the work of the American Library Association's (ALA's) Machine-Assisted Reference Section (MARS) Committee on Measurement and Evaluation. The…

  2. IN SEARCH OF LEADERS.

    ERIC Educational Resources Information Center

    SMITH, G. KERRY, ED.; AND OTHERS

    THE ROLE OF HIGHER EDUCATION IN THE NATION'S SEARCH FOR LEADERS IS EXAMINED IN THIS SERIES OF 52 PAPERS, WHICH DEAL WITH LEADERSHIP BOTH IN AND OUT OF THE EDUCATIONAL INSTITUTION. TOPICS ARE GROUPED IN SEVEN UNITS--(1) THE QUEST FOR MORALITY, (2) ENLARGED RESPONSIBILITY, (3) APPROACHES TO LEADERSHIP, (4) BROADER VISIONS OF LEADERSHIP, (5) STUDENT…

  3. Searches Conducted for Engineers.

    ERIC Educational Resources Information Center

    Lorenz, Patricia

    This paper reports an industrial information specialist's experience in performing online searches for engineers and surveys the databases used. Engineers seeking assistance fall into three categories: (1) those who recognize the value of online retrieval; (2) referrals by colleagues; and (3) those who do not seek help. As more successful searches…

  4. The Job Search.

    ERIC Educational Resources Information Center

    Rolf, Marilyn

    1982-01-01

    Describes a college-level job search teaching unit that is a practical method of preparing appropriate resumes, participating in effective job interviews, and getting and keeping the job. The unit's four phases are explained: securing job leads, writing resumes and letters of application, the interview, and the postinterview. (CT)

  5. Are Metasearches Better Searches?

    ERIC Educational Resources Information Center

    Tomaiuolo, Nicholas

    1999-01-01

    Explores metasearch engine (metasearch engines search several Web indexes and/or directories and/or Usenet and/or specific Web sites) efficiency and problems, focusing on four engines in specific: Dogpile, Cyber411, Internet Sleuth, and Metacrawler. Concludes that because no engine has precisely the same coverage as another, the searcher using a…

  6. Radiation source search toolkit

    NASA Astrophysics Data System (ADS)

    Young, Jason S.

    The newly developed Radiation Source Search Toolkit (RSST) is a toolkit for generating gamma-ray spectroscopy data for use in the testing of source search algorithms. RSST is designed in a modular fashion to allow for ease of use while still maintaining accuracy in developing the output spectra. Users are allowed to define a real-world path for mobile radiation detectors to travel as well as radiation sources for possible detection. RSST can accept measured or simulated radiation spectrum data for generation into a source search simulation. RSST handles traversing the path, computing distance related attenuation, and generating the final output spectra. RSST also has the ability to simulate anisotropic shielding as well as traffic conditions that would impede a ground-based detection platform in a real-world scenario. RSST provides a novel fusion between spectral data and geospatial source search data generation. By utilizing the RSST, researchers can easily generate multiple datasets for testing detection algorithms without the need for actual radiation sources and mobile detector platforms.

  7. Searches at the Tevatron

    SciTech Connect

    W. Orejudos

    2002-10-25

    Results of searches performed by CDF and D0 are presented. Most of the results are based on data taken during the 1994-95 data taking period (Run I), but some preliminary results from the current data taking period (Run II) are included.

  8. Ultrasonic search wheel probe

    DOEpatents

    Mikesell, Charles R.

    1978-01-01

    A device is provided for reducing internal reflections from the tire of an ultrasonic search wheel probe or from within the material being examined. The device includes a liner with an anechoic chamber within which is an ultrasonic transducer. The liner is positioned within the wheel and includes an aperture through which the ultrasonic sound from the transducer is directed.

  9. Smart Systems, Smart Searches.

    ERIC Educational Resources Information Center

    Brunelle, Bette S.

    Almost overnight, the World Wide Web has made the solution of "classic" information retrieval problems a pressing commercial goal. The various information retrieval solutions being offered on the Web are quite familiar to the librarian. The various Web search sites make use of "traditional" inverted indexes, manual indexing, automatic indexing…

  10. Careers Booklet. Project SEARCH.

    ERIC Educational Resources Information Center

    Heart of the Earth Survival School, Minneapolis, MN.

    Developed by the staff of Project SEARCH, this booklet is designed to assist American Indian adults of the Minneapolis-St. Paul area in an exploration of careers. As noted by the introduction, it may also be of interest to Indian high school students, college students, and others who are looking for ideas about the kinds of careers available. The…

  11. SUSY searches at CDF

    SciTech Connect

    Hu, Ping; CDF collaboration

    1993-06-01

    A set of jet events with large amount of Missing E{sub Tau} from the Fermilab CDF experiment was analyses to search for SUSY signature. No significant signals were observed above the Standard Model background. Some effects of some SUSY parameters on the squark and gluino mass limits are presented.

  12. The Search for Narrative

    ERIC Educational Resources Information Center

    Fattal, Laura Felleman

    2004-01-01

    Practical and academic, the interrelationship of the visual and performing arts opens unique frontiers to aesthetic pioneers. Divergent in aim from the historic search for similar tonalities between the Synchronists and Stravinsky or atonal musicians of the 1950s-70s and minimalist painters and sculptors, the present use of the visual arts as a…

  13. Spinning a Web Search.

    ERIC Educational Resources Information Center

    Lager, Mark A.

    This paper focuses on techniques for retrieval used in information sciences and in World Wide Web search engines. The purpose of reference service and information science is to provide useful information in response to a query. The two metrics of recall and precision serve to express information retrieval performance. There are two major…

  14. The Pulsar Search Collaboratory

    ERIC Educational Resources Information Center

    Rosen, R.; Heatherly, S.; McLaughlin, M. A.; Kondratiev, V. I.; Boyles, J. R.; Wilson, M.; Lorimer, D. R.; Lynch, R.; Ransom, S.

    2010-01-01

    The Pulsar Search Collaboratory (PSC) (NSF #0737641) is a joint project between the National Radio Astronomy Observatory and West Virginia University designed to interest high school students in science, technology, engineering, and mathematics related career paths by helping them to conduct authentic scientific research. The 3 year PSC program,…

  15. Chernobyl Bibliographic Search System

    1992-05-11

    The Chernobyl Bibliographic Search System (Chernolit TM) provides bibliographic data in a usable format for research studies relating to the Chernobyl nuclear accident that occurred in the former Ukrainian Republic of the USSR in 1986. Chernolit TM is a portable and easy to use product. The bibliographic data is provided under the control of a graphical user interface so that the user may quickly and easily retrieve pertinent information from the large database. The usermore » may search the database for occurrences of words, names, or phrases; view bibliographic references on screen; and obtain reports of selected references. Reports may be viewed on the screen, printed, or accumulated in a folder that is written to a disk file when the user exits the software. Chernolit TM provides a cost-effective alternative to multiple, independent literature searches. Forty-five hundred references concerning the accident, including abstracts, are distributed with Chernolit TM. The data contained in the database were obtained from electronic literature searches and from requested donations from individuals and organizations. These literature searches interrogated the Energy Science and Technology database (formerly DOE ENERGY) of the DIALOG Information Retrieval Service. Energy Science and Technology, provided by the U.S. DOE, Washington, D.C., is a multi-disciplinary database containing references to the world''s scientific and technical literature on energy. All unclassified information processed at the Office of Scientific and Technical Information (OSTI) of the U.S. DOE is included in the database. In addition, information on many documents has been manually added to Chernolit TM. Most of this information was obtained in response to requests for data sent to people and/or organizations throughout the world.« less

  16. A search for equilibrium states

    NASA Technical Reports Server (NTRS)

    Zeleznik, F. J.

    1982-01-01

    An efficient search algorithm is described for the location of equilibrium states in a search set of states which differ from one another only by the choice of pure phases. The algorithm has three important characteristics: (1) it ignores states which have little prospect for being an improved approximation to the true equilibrium state; (2) it avoids states which lead to singular iteration equations; (3) it furnishes a search history which can provide clues to alternative search paths.

  17. Switching strategies to optimize search

    NASA Astrophysics Data System (ADS)

    Shlesinger, Michael F.

    2016-03-01

    Search strategies are explored when the search time is fixed, success is probabilistic and the estimate for success can diminish with time if there is not a successful result. Under the time constraint the problem is to find the optimal time to switch a search strategy or search location. Several variables are taken into account, including cost, gain, rate of success if a target is present and the probability that a target is present.

  18. Searching for IRES

    PubMed Central

    Baird, Stephen D.; Turcotte, Marcel; Korneluk, Robert G.; Holcik, Martin

    2006-01-01

    The cell has many ways to regulate the production of proteins. One mechanism is through the changes to the machinery of translation initiation. These alterations favor the translation of one subset of mRNAs over another. It was first shown that internal ribosome entry sites (IRESes) within viral RNA genomes allowed the production of viral proteins more efficiently than most of the host proteins. The RNA secondary structure of viral IRESes has sometimes been conserved between viral species even though the primary sequences differ. These structures are important for IRES function, but no similar structure conservation has yet to be shown in cellular IRES. With the advances in mathematical modeling and computational approaches to complex biological problems, is there a way to predict an IRES in a data set of unknown sequences? This review examines what is known about cellular IRES structures, as well as the data sets and tools available to examine this question. We find that the lengths, number of upstream AUGs, and %GC content of 5′-UTRs of the human transcriptome have a similar distribution to those of published IRES-containing UTRs. Although the UTRs containing IRESes are on the average longer, almost half of all 5′-UTRs are long enough to contain an IRES. Examination of the available RNA structure prediction software and RNA motif searching programs indicates that while these programs are useful tools to fine tune the empirically determined RNA secondary structure, the accuracy of de novo secondary structure prediction of large RNA molecules and subsequent identification of new IRES elements by computational approaches, is still not possible. PMID:16957278

  19. Search Engines for Tomorrow's Scholars

    ERIC Educational Resources Information Center

    Fagan, Jody Condit

    2011-01-01

    Today's scholars face an outstanding array of choices when choosing search tools: Google Scholar, discipline-specific abstracts and index databases, library discovery tools, and more recently, Microsoft's re-launch of their academic search tool, now dubbed Microsoft Academic Search. What are these tools' strengths for the emerging needs of…

  20. Wilderness search strategy and tactics.

    PubMed

    Phillips, Ken; Longden, Maura J; Vandergraff, Bil; Smith, William R; Weber, David C; McIntosh, Scott E; Wheeler, Albert R

    2014-06-01

    Reports of overdue persons are common for search and rescue personnel. Search incidents for missing persons are conducted following established industry standard practices, which are continuously refined through experience and the analysis of previous search operations. Throughout this process, elements of uncertainty exist, and the knowledge and experience of the searchers and search managers may influence the outcome significantly. A sound knowledge of current search tactics will help search and rescue medical providers function more effectively during search operations. Initial actions during a search incident include 3 primary tasks that must be accomplished on any search: investigation, containment, and then hasty search efforts. Concurrent with these initial actions are the establishment of the search area and a formal US National Incident Management System incident command system. That is essential for an efficient operation and will lay the groundwork for expanding the operation past the initial operational period. The goal of applying these standard search management practices is to allow searchers to maximize their efforts, reduce some of the inherent uncertainty, and most importantly, place searchers in a position to detect the missing person. PMID:24792134

  1. Teaching about Search and Seizure.

    ERIC Educational Resources Information Center

    Kelly, Cynthia A.

    1978-01-01

    Presents a six-step model to help teachers develop curriculum related to the Fourth Amendment (search and seizure). The model focuses on determining values and attitudes, defining valid and unreasonable search and seizure, recognizing a valid warrant, and using film to teach about search and seizure. Journal available from the American Bar…

  2. MOPITT Search and Subset Tool

    Atmospheric Science Data Center

    2016-07-06

    Description:  Search and subset MOPITT Version 5 & 6 Level 2 data Customization Options Search and subset MOPITT Version 5 and Version 6 Level 2 data Update the ... NetCDF3 and NetCDF4 Details:  MOPITT Search and Subset Tool Acronyms/Abbreviations:  MOPITT ...

  3. CERES Search and Subset Tool

    Atmospheric Science Data Center

    2016-02-18

    Description:  Search and subset CERES Level 2 SSF and FLASHFlux data Customization Options Search and subset by date, time, and geolocation Subset by parameter and ... HDF and NetCDF Details:  CERES Search and Subset Tool Screenshot:  ...

  4. (Meta)Search like Google

    ERIC Educational Resources Information Center

    Rochkind, Jonathan

    2007-01-01

    The ability to search and receive results in more than one database through a single interface--or metasearch--is something many users want. Google Scholar--the search engine of specifically scholarly content--and library metasearch products like Ex Libris's MetaLib, Serials Solution's Central Search, WebFeat, and products based on MuseGlobal used…

  5. Studies of waveform requirements for intermediate mass-ratio coalescence searches with advanced gravitational-wave detectors

    NASA Astrophysics Data System (ADS)

    Smith, R. J. E.; Mandel, I.; Vecchio, A.

    2013-08-01

    The coalescence of a stellar-mass compact object into an intermediate-mass black hole (intermediate mass-ratio coalescence; IMRAC) is an important astrophysical source for ground-based gravitational-wave interferometers in the so-called advanced (or second-generation) configuration. However, the ability to carry out effective matched-filter-based searches for these systems is limited by the lack of reliable waveforms. Here we consider binaries in which the intermediate-mass black hole has a mass in the range 24M⊙-200M⊙ with a stellar-mass companion having masses in the range 1.4M⊙-18.5M⊙. In addition, we constrain the mass ratios, q, of the binaries to be in the range 1/140≤q≤1/10 and we restrict our study to the case of circular binaries with nonspinning components. We investigate the relative contribution to the signal-to-noise ratio (SNR) of the three different phases of the coalescence—inspiral, merger and ringdown—using waveforms computed within the effective one-body formalism matched to numerical relativity. We show that merger and ringdown contribute to a substantial fraction of the total SNR over a large portion of the mass parameter space, although in a limited portion the SNR is dominated by the inspiral phase. We further identify three regions in the IMRAC mass space in which (i) inspiral-only searches could be performed with losses in detection rates L in the range 10%≲L≲27%, (ii) searches based on inspiral-only templates lead to a loss in detection rates in the range 27%≲L≲50%, and (iii) templates that include merger and ringdown are essential to prevent losses in detection rates greater than 50%. In addition we find that using inspiral-only templates as filters can lead to large biases in the estimates of the mass parameters of IMRACs. We investigate the effectiveness with which the inspiral-only portion of the IMRAC waveform space is covered by comparing several existing waveform families in this regime. We find that

  6. Axion dark matter searches

    SciTech Connect

    Stern, Ian P.; Collaboration: ADMX Collaboration; ADMX-HF Collaboration

    2014-06-24

    Nearly all astrophysical and cosmological data point convincingly to a large component of cold dark matter in the Universe. The axion particle, first theorized as a solution to the strong charge-parity problem of quantum chromodynamics, has been established as a prominent CDM candidate. Cosmic observation and particle physics experiments have bracketed the unknown mass of the axion between approximately a μeV and a meV. The Axion Dark Matter eXperiement (ADMX) has successfully completed searches between 1.9 and 3.7 μeV down to the KSVZ photon-coupling limit. ADMX and the Axion Dark Matter eXperiement High-Frequency (ADMX-HF) will search for axions at weaker coupling and/or higher frequencies within the next few years. Status of the experiments, current research and development, and projected mass-coupling exclusion limits are presented.

  7. Axion dark matter searches

    DOE PAGESBeta

    Stern, Ian P.

    2014-01-01

    We report nearly all astrophysical and cosmological data point convincingly to a large component of cold dark matter in the Universe. The axion particle, first theorized as a solution to the strong charge-parity problem of quantum chromodynamics, has been established as a prominent CDM candidate. Cosmic observation and particle physics experiments have bracketed the unknown mass of the axion between approximately a μeV and a meV. The Axion Dark Matter eXperiement (ADMX) has successfully completed searches between 1.9 and 3.7 μeV down to the KSVZ photon-coupling limit. ADMX and the Axion Dark Matter eXperiement High-Frequency (ADMX-HF) will search for axionsmore » at weaker coupling and/or higher frequencies within the next few years. Status of the experiments, current research and development, and projected mass-coupling exclusion limits are presented.« less

  8. Berkeley automated supernova search

    SciTech Connect

    Kare, J.T.; Pennypacker, C.R.; Muller, R.A.; Mast, T.S.; Crawford, F.S.; Burns, M.S.

    1981-01-01

    The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982.

  9. A Prototype Search Toolkit

    NASA Astrophysics Data System (ADS)

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

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

  10. Axion dark matter searches

    SciTech Connect

    Stern, Ian P.

    2014-01-01

    We report nearly all astrophysical and cosmological data point convincingly to a large component of cold dark matter in the Universe. The axion particle, first theorized as a solution to the strong charge-parity problem of quantum chromodynamics, has been established as a prominent CDM candidate. Cosmic observation and particle physics experiments have bracketed the unknown mass of the axion between approximately a μeV and a meV. The Axion Dark Matter eXperiement (ADMX) has successfully completed searches between 1.9 and 3.7 μeV down to the KSVZ photon-coupling limit. ADMX and the Axion Dark Matter eXperiement High-Frequency (ADMX-HF) will search for axions at weaker coupling and/or higher frequencies within the next few years. Status of the experiments, current research and development, and projected mass-coupling exclusion limits are presented.

  11. Biogenicity and Syngeneity of Organic Matter in Ancient Sedimentary Rocks: Recent Advances in the Search for Evidence of Past Life

    SciTech Connect

    Oehler, Dorothy Z.; Cady, Sherry L.

    2014-12-01

    he past decade has seen an explosion of new technologies for assessment of biogenicity and syngeneity of carbonaceous material within sedimentary rocks. Advances have been made in techniques for analysis of in situ organic matter as well as for extracted bulk samples of soluble and insoluble (kerogen) organic fractions. The in situ techniques allow analysis of micrometer-to-sub-micrometer-scale organic residues within their host rocks and include Raman and fluorescence spectroscopy/imagery, confocal laser scanning microscopy, and forms of secondary ion/laser-based mass spectrometry, analytical transmission electron microscopy, and X-ray absorption microscopy/spectroscopy. Analyses can be made for chemical, molecular, and isotopic composition coupled with assessment of spatial relationships to surrounding minerals, veins, and fractures. The bulk analyses include improved methods for minimizing contamination and recognizing syngenetic constituents of soluble organic fractions as well as enhanced spectroscopic and pyrolytic techniques for unlocking syngenetic molecular signatures in kerogen. Together, these technologies provide vital tools for the study of some of the oldest and problematic carbonaceous residues and for advancing our understanding of the earliest stages of biological evolution on Earth and the search for evidence of life beyond Earth. We discuss each of these new technologies, emphasizing their advantages and disadvantages, applications, and likely future directions.

  12. Pentaquark Searches With CLAS

    SciTech Connect

    David J. Tedeschi

    2006-02-01

    The production of a possible, exotic S=1 pentaquarks off protons and neutrons is being investigated in Hall B at Jefferson Lab. Three dedicated experiments have been carried out to search for pentaquark signals using the CLAS detector in conjunction with a photon beam incident on hydrogen and deuterium targets. The status of on-going analyses and preliminary results from a variety of channels are presented.

  13. Search for hybrids

    SciTech Connect

    Amsler, C.; Armstrong, D.S.; Augustin, I.; Baker, C.A.; Barnett, B.M.; Batty, C.J.; Beuchert, K.; Birien, P.; Bistirlich, J.; Bluem, P.

    1994-09-01

    The existence of exotic states that do not fit into the picture of q{bar q}-mesons is still an unanswered question of QCD. Proton-antiproton annhiliation at higher momenta might be a promising source in the search for such states. This report shows the first results obtained using the Crystal Barrel detector system at LEAR (CERN) at an antiproton beam momentum of 1940 MeV/c. 15 refs., 8 figs.

  14. The search for proton decay

    SciTech Connect

    Haines, T.; Kaneyuki, K.; McGrew, C.; Mohapatra, R.; Peterson, E.; Cline, D.B.

    1994-12-31

    The conservation of the quantum number called baryon number, like lepton (or family) number, is an empirical fact even though there are very good reasons to expect otherwise. Experimentalists have been searching for baryon number violating decays of the proton and neutron for decades now without success. Theorists have evolved deep understanding of the relationship between the natural forces in the development of various Grand Unified Theories (GUTs) that nearly universally predict baryon number violating proton decay, or related phenomena like n-{bar n} oscillations. With this in mind, the Proton Decay Working Group reviewed the current experimental and theoretical status of the search for baryon number violation with an eye to the advancement in the next decade.

  15. Computational search of novel superconductors

    NASA Astrophysics Data System (ADS)

    Yin, Zhiping

    The recently discovered 200 K high temperature superconductivity in the hydrogen sulfur material under high pressure was first successfully predicted by first-principles computation in a quantitative fashion, demonstrating the power of computation in the search of new superconductors. With the rapid advancement of theory, algorithm, and computer power, computation will play an increasingly important role. In this talk, I will first summarize the key features of different families of high temperature superconductors, including the iron pnictide and chalcogenide superconductors, the transition metal chloronitrides, and Bi-based superconductors. Then I will show how to use the key features as guidance to design novel candidate materials of high temperature superconductivity by utilizing a combination of different computational methods and tools, including evolutionary structural search method, density functional theory and dynamical mean field theory. A few candidate materials will be given towards the end of the talk for interested experimentalists and theorists to test and explore

  16. Reconsidering Visual Search

    PubMed Central

    2015-01-01

    The visual search paradigm has had an enormous impact in many fields. A theme running through this literature has been the distinction between preattentive and attentive processing, which I refer to as the two-stage assumption. Under this assumption, slopes of set-size and response time are used to determine whether attention is needed for a given task or not. Even though a lot of findings question this two-stage assumption, it still has enormous influence, determining decisions on whether papers are published or research funded. The results described here show that the two-stage assumption leads to very different conclusions about the operation of attention for identical search tasks based only on changes in response (presence/absence versus Go/No-go responses). Slopes are therefore an ambiguous measure of attentional involvement. Overall, the results suggest that the two-stage model cannot explain all findings on visual search, and they highlight how slopes of response time and set-size should only be used with caution. PMID:27551357

  17. MINOS Sterile Neutrino Search

    SciTech Connect

    Koskinen, David Jason

    2009-02-01

    The Main Injector Neutrino Oscillation Search (MINOS) is a long-baseline accelerator neutrino experiment designed to measure properties of neutrino oscillation. Using a high intensity muon neutrino beam, produced by the Neutrinos at Main Injector (NuMI) complex at Fermilab, MINOS makes two measurements of neutrino interactions. The first measurement is made using the Near Detector situated at Fermilab and the second is made using the Far Detector located in the Soudan Underground laboratory in northern Minnesota. The primary goal of MINOS is to verify, and measure the properties of, neutrino oscillation between the two detectors using the v μ→ Vτ transition. A complementary measurement can be made to search for the existence of sterile neutrinos; an oft theorized, but experimentally unvalidated particle. The following thesis will show the results of a sterile neutrino search using MINOS RunI and RunII data totaling ~2.5 x 1020 protons on target. Due to the theoretical nature of sterile neutrinos, complete formalism that covers transition probabilities for the three known active states with the addition of a sterile state is also presented.

  18. Accelerated Profile HMM Searches

    PubMed Central

    Eddy, Sean R.

    2011-01-01

    Profile hidden Markov models (profile HMMs) and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the “multiple segment Viterbi” (MSV) algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call “sparse rescaling”. These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches. PMID:22039361

  19. SmartSearch steganalysis

    NASA Astrophysics Data System (ADS)

    Bloom, Jeffrey A.; Alonso, Rafael

    2003-06-01

    There are two primary challenges to monitoring the Web for steganographic media: finding suspect media and examining those found. The challenge that has received a great deal of attention is the second of these, the steganalysis problem. The other challenge, and one that has received much less attention, is the search problem. How does the steganalyzer get the suspect media in the first place? This paper describes an innovative method and architecture to address this search problem. The typical approaches to searching the web for covert communications are often based on the concept of "crawling" the Web via a smart "spider." Such spiders find new pages by following ever-expanding chains of links from one page to many next pages. Rather than seek pages by chasing links from other pages, we find candidate pages by identifying requests to access pages. To do this we monitor traffic on Internet backbones, identify and log HTTP requests, and use this information to guide our process. Our approach has the advantages that we examine pages to which no links exist, we examine pages as soon as they are requested, and we concentrate resources only on active pages, rather than examining pages that are never viewed.

  20. Classifying glitches and improving data quality of Advanced LIGO gravitational-wave searches

    NASA Astrophysics Data System (ADS)

    Cavaglia, Marco; Powell, Jade; Trifiro, Daniele; Heng, Ik Siong; LIGO Collaboration

    2016-03-01

    Noise of non-astrophysical origin contaminates science data taken by the Advanced Laser Interferometer Gravitational-wave Observatory (aLIGO) and Advanced Virgo gravitational-wave detectors. Characterization of instrumental and environmental noise transients has proven critical in identifying false positives in the first aLIGO observing run O1. In this talk, we present three algorithms designed for the automatic classification of non-astrophysical transients in advanced detectors. Principal Component Analysis for Transients (PCAT) and an adaptation of LALInference Burst (LIB) are based on Principal Component Analysis. The third algorithm is a combination of a glitch finder called Wavelet Detection Filter (WDF) and machine learning techniques for classification. PCAT was used in O1 and earlier engineering runs to identify and characterize observed noise transients in aLIGO data. LIB and WDF are expected to join the quest in the upcoming aLIGO-Advanced Virgo observing run O2. NSF PHY-1404139.

  1. Supersymmetry Searches at the Tevatron

    SciTech Connect

    Hays, C.

    2008-11-23

    Supersymmetry predicts a range of new phenomena with a variety of experimental signatures. Searches for supersymmetry at the Fermilab Tevatron accelerator fall into three broad categories: generic sparticle searches; specialized searches for sparticles with unusual properties; and model-independent searches probing for discrepancies between the data and the standard model. Searches performed by the CDF and DOe experiments with up to 2 fb{sup -1} of {radical}(s) = 1.96 TeV pp-bar data have yet to turn up any evidence for supersymmetry.

  2. Understanding Internet Searching Performance in a Heterogeneous Portal for K-12 Students: Search Success, Search Time, Strategy, and Effort

    ERIC Educational Resources Information Center

    Zhang, Yin; Robins, David; Holmes, Jason; Salaba, Athena

    2009-01-01

    This study sought to better understand search performance using an online portal containing a collection of heterogeneous library resources for K-12 students. Search performance is examined in terms of search success, search time, strategy, and effort. This study revealed unsuccessful searches tended to take longer than successful searches;…

  3. SETI The Search for Extraterrestrial Intelligence.

    ERIC Educational Resources Information Center

    Jones, Barrie W.

    1991-01-01

    Discussed is the search for life on other planets similar to Earth based on the Drake equation. Described are search strategies and microwave searches. The reasons why people are searching are also discussed. (KR)

  4. Search 3.0: Present, Personal, Precise

    NASA Astrophysics Data System (ADS)

    Spivack, Nova

    The next generation of Web search is already beginning to emerge. With it we will see several shifts in the way people search, and the way major search engines provide search functionality to consumers.

  5. Criteria for Comparing Children's Web Search Tools.

    ERIC Educational Resources Information Center

    Kuntz, Jerry

    1999-01-01

    Presents criteria for evaluating and comparing Web search tools designed for children. Highlights include database size; accountability; categorization; search access methods; help files; spell check; URL searching; links to alternative search services; advertising; privacy policy; and layout and design. (LRW)

  6. Job Search Sites on the Web.

    ERIC Educational Resources Information Center

    Raeder, Aggi

    1997-01-01

    Discusses job search resources on the Internet, electronic resumes, and searching tricks. Features an annotated bibliography of Internet sites that provide links to job search sites, search tips, databanks of jobs, professional and "boutique" sites, and government jobs. (PEN)

  7. Policy implications for familial searching

    PubMed Central

    2011-01-01

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

  8. Search engine for handwritten documents

    NASA Astrophysics Data System (ADS)

    Srihari, Sargur N.; Huang, Chen; Srinivasan, Harish

    2005-01-01

    Search aspects of a system for analyzing handwritten documents are described. Documents are indexed using global image features, e.g., stroke width, slant as well as local features that describe the shapes of words and characters. Image indexing is done automatically using page analysis, page segmentation, line separation, word segmentation and recognition of words and characters. Two types of search are permitted: search based on global features of entire document and search using features at local level. For the second type of search, i.e., local, all the words in the document are characterized and indexed by various features and it forms the basis of different search techniques. The paper focuses on local search and describes four tasks: word/phrase spotting, text to image, image to text and plain text. Performance in terms of precision/recall and word ranking is reported on a database of handwriting samples from about 1,000 individuals.

  9. Search engine for handwritten documents

    NASA Astrophysics Data System (ADS)

    Srihari, Sargur N.; Huang, Chen; Srinivasan, Harish

    2004-12-01

    Search aspects of a system for analyzing handwritten documents are described. Documents are indexed using global image features, e.g., stroke width, slant as well as local features that describe the shapes of words and characters. Image indexing is done automatically using page analysis, page segmentation, line separation, word segmentation and recognition of words and characters. Two types of search are permitted: search based on global features of entire document and search using features at local level. For the second type of search, i.e., local, all the words in the document are characterized and indexed by various features and it forms the basis of different search techniques. The paper focuses on local search and describes four tasks: word/phrase spotting, text to image, image to text and plain text. Performance in terms of precision/recall and word ranking is reported on a database of handwriting samples from about 1,000 individuals.

  10. Parallel Processing in Visual Search Asymmetry

    ERIC Educational Resources Information Center

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

    2004-01-01

    The difficulty of visual search may depend on assignment of the same visual elements as targets and distractors-search asymmetry. Easy C-in-O searches and difficult O-in-C searches are often associated with parallel and serial search, respectively. Here, the time course of visual search was measured for both tasks with speed-accuracy methods. The…

  11. 29 CFR 4050.4 - Diligent search.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 29 Labor 9 2011-07-01 2011-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  12. 29 CFR 4050.4 - Diligent search.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 29 Labor 9 2014-07-01 2014-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  13. 29 CFR 4050.4 - Diligent search.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 29 Labor 9 2012-07-01 2012-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  14. 29 CFR 4050.4 - Diligent search.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 29 Labor 9 2013-07-01 2013-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  15. 29 CFR 4050.4 - Diligent search.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Diligent search. 4050.4 Section 4050.4 Labor Regulations... § 4050.4 Diligent search. (a) Search required. A diligent search must be made for each missing... § 4050.6. (b) Diligence. A search is a diligent search only if the search— (1) Begins not more than...

  16. Index Relativity and Patron Search Strategy.

    ERIC Educational Resources Information Center

    Allison, DeeAnn; Childers Scott

    2002-01-01

    Describes a study at the University of Nebraska-Lincoln that compared searches in two different keyword indexes with similar content where search results were dependent on search strategy quality, search engine execution, and content. Results showed search engine execution had an impact on the number of matches and that users ignored search help…

  17. Search for Asteroid Satellites

    NASA Astrophysics Data System (ADS)

    Merline, W. J.; Close, L. M.; Menard, F.; Dumas, C.; Chapman, C. R.; Slater, D. C.

    2001-11-01

    We report on the recent progress of our comprehensive search for satellites of asteroids. In 1998, we began our survey using newly newly developed technologies in adaptive optics to explore the close environs of several hundred main-belt asteroids. Adaptive optics (AO) removes the blurring caused by the Earth's atmosphere and allows diffraction-limited imaging in the near-IR (J-,H-,K'-bands) at the world's largest telescopes. Angular resolutions as high as 0.04 arcsec are possible. We have employed the excellent facilities at the Canada-France-Hawaii Telescope, the W.M. Keck II telescope, and the new Gemini North 8m telescope. Each of these facilities provides unique capabilities and are each complementary to the other. So far we have discovered or recovered a half-dozen small moons or double asteroids by this AO-assisted direct-imaging technique. Our sample now exceeds 300 main-belt targets, and we have expanded the survey to include near-Earth and Trojan asteroids. Other groups are using AO, direct HST imaging, direct ground-based imaging, advanced lightcurve analysis, and radar techniques to further sample these populations, as well as the Kuiper Belt. Our results show that the frequency of binary asteroids (at least to our detection limits) is rather small in the main belt, possibly a few percent. Frequencies among other populations, such as the NEAs, are seen to be much higher. We also find that although there are similarities among the detected systems, there are also significant differences. Thus, it is likely that several different formation mechanisms will be required to explain the observed systems. All of the proposed mechanisms for formation involve collisions of one type or another (physical or gravitational). Study of these systems will provide significant insight to the collisional history and evolution of these asteroid populations. Further, the presence of a companion allows accurate determination of the density of the primary, and thus yields

  18. The Correlates of Taiwan Teachers' Epistemological Beliefs concerning Internet Environments, Online Search Strategies, and Search Outcomes

    ERIC Educational Resources Information Center

    Tsai, Pei-Shan; Tsai, Chin-Chung; Hwang, Gwo-Jen

    2011-01-01

    This study aimed to explore the correlates among teachers' epistemological beliefs concerning Internet environments, their web search strategies and search outcomes. The sample of this study included 105 teachers from 63 grades 1 to 9 schools in Taiwan. The results show that the teachers with more advanced epistemological beliefs concerning…

  19. HMMER web server: interactive sequence similarity searching

    PubMed Central

    Finn, Robert D.; Clements, Jody; Eddy, Sean R.

    2011-01-01

    HMMER is a software suite for protein sequence similarity searches using probabilistic methods. Previously, HMMER has mainly been available only as a computationally intensive UNIX command-line tool, restricting its use. Recent advances in the software, HMMER3, have resulted in a 100-fold speed gain relative to previous versions. It is now feasible to make efficient profile hidden Markov model (profile HMM) searches via the web. A HMMER web server (http://hmmer.janelia.org) has been designed and implemented such that most protein database searches return within a few seconds. Methods are available for searching either a single protein sequence, multiple protein sequence alignment or profile HMM against a target sequence database, and for searching a protein sequence against Pfam. The web server is designed to cater to a range of different user expertise and accepts batch uploading of multiple queries at once. All search methods are also available as RESTful web services, thereby allowing them to be readily integrated as remotely executed tasks in locally scripted workflows. We have focused on minimizing search times and the ability to rapidly display tabular results, regardless of the number of matches found, developing graphical summaries of the search results to provide quick, intuitive appraisement of them. PMID:21593126

  20. Advanced image collection, information extraction, and change detection in support of NN-20 broad area search and analysis

    SciTech Connect

    Petrie, G.M.; Perry, E.M.; Kirkham, R.R.; Slator, D.E.

    1997-09-01

    This report describes the work performed at the Pacific Northwest National Laboratory (PNNL) for the U.S. Department of Energy`s Office of Nonproliferation and National Security, Office of Research and Development (NN-20). The work supports the NN-20 Broad Area Search and Analysis, a program initiated by NN-20 to improve the detection and classification of undeclared weapons facilities. Ongoing PNNL research activities are described in three main components: image collection, information processing, and change analysis. The Multispectral Airborne Imaging System, which was developed to collect georeferenced imagery in the visible through infrared regions of the spectrum, and flown on a light aircraft platform, will supply current land use conditions. The image information extraction software (dynamic clustering and end-member extraction) uses imagery, like the multispectral data collected by the PNNL multispectral system, to efficiently generate landcover information. The advanced change detection uses a priori (benchmark) information, current landcover conditions, and user-supplied rules to rank suspect areas by probable risk of undeclared facilities or proliferation activities. These components, both separately and combined, provide important tools for improving the detection of undeclared facilities.

  1. Pentaquark Searches at Jlab

    SciTech Connect

    Rossi, Patrizia

    2007-01-01

    Since LEPS collaboration reported the first evidence for a S=+1 baryon resonance in early 2003 with a mass of 1.54 GeV, dubbed Θ+, more than ten experiments have confirmed this exotic state, among these two carried out at Jefferson Laboratory. At the same time, there are a number of experiments, mostly at high energies, that report null results. To try to clarify this situation, during the past year, The CLAS Collaboration at Jefferson Laboratory has undertaken a second generation high-statistics experimental program to search for exotics baryons. Here the preliminary results from these experiments are reported.

  2. Pentaquark Searches at CDF

    SciTech Connect

    Gorelov, Igor V.

    2004-08-26

    Experimental results of a search for the {Xi}{sub 3/2}(1860) cascade pentaquark state in data collected with the CDF 2 Detector in Run II at the Tevatron are presented. No evidence for these states in the neutral {Xi}{sup -}{pi}{sup +} and doubly charged {Xi}{sup -}{pi}{sup -} modes has been found. Preliminary upper limits on yields at 1862 MeV/c{sup 2} relative to the well established resonance {Xi}*(1530){sup 0} are presented.

  3. Pentaquark searches at HERMES

    SciTech Connect

    Airapetian, Avetik

    2005-10-06

    An experimental search for exotic baryons was performed with the HERMES experiment at DESY in quasi-real photoproduction. Positive evidence is presented for a {theta}+ at a mass of 1528 {+-} 2.6(stat) {+-} 2.1 (sys) MeV. No evidence for possible {theta}++, {xi}--(1860) and {xi}0(1860) resonances was found, instead, upper limits for their production cross section are given. In addition, photoproduction crosssections for the {lambda}(1520) and {xi}0(1530) resonances are presented, because they have similar decay modes as the {theta}++ and {xi}-- (1860), respectively.

  4. Pentaquark searches at CDF

    SciTech Connect

    Litvintsev, Dmitry O.; Fermilab

    2004-10-01

    Recently there has been revival of interest in exotic baryon spectroscopy triggered by experimental evidence for pentaquarks containing u, d, s and c-quarks. They report results of the searches for pentaquark states in decays to pK{sub S}{sup 0}, {Xi}{sup -} {pi}{sup {+-}} and D*{sup -} p performed at CDF detector using 220 pb{sup -1} sample of p{bar p} interactions at {radical}s of 1.96 TeV. No evidence for narrow resonances were found in either mode.

  5. Search for the decay

    NASA Astrophysics Data System (ADS)

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

    2015-08-01

    A search for decays is performed using 3 .0 fb1- of pp collision data recorded by the LHCb experiment during 2011 and 2012. The f 0(980) meson is reconstructed through its decay to the π + π - final state in the mass window 900 MeV /c 2 < m( π + π -) < 1080 MeV /c 2. No significant signal is observed. The first upper limits on the branching fraction of are set at 90 % (95 %) confidence level. [Figure not available: see fulltext.

  6. Pentaquark Θ+ search at HERMES

    NASA Astrophysics Data System (ADS)

    Akopov, N.; Akopov, Z.; Augustyniak, W.; Avakian, R.; Avetissian, A.; Avetisyan, E.; Belostotski, S.; Blok, H. P.; Borissov, A.; Bowles, J.; Bryzgalov, V.; Burns, J.; Capitani, G. P.; Cisbani, E.; Ciullo, G.; Contalbrigo, M.; Dalpiaz, P. F.; Deconinck, W.; de Leo, R.; de Sanctis, E.; di Nezza, P.; Elbakian, G.; Etzelmüller, E.; Fabbri, R.; Fantoni, A.; Felawka, L.; Frullani, S.; Gabbert, D.; Garay García, J.; Garibaldi, F.; Gavrilov, G.; Giordano, F.; Gliske, S.; Hartig, M.; Hasch, D.; Holler, Y.; Hristova, I.; Imazu, Y.; Ivanilov, A.; Jackson, H. E.; Joosten, S.; Kaiser, R.; Karyan, G.; Keri, T.; Kinney, E.; Kisselev, A.; Kozlov, V.; Kravchenko, P.; Krivokhijine, V. G.; Lagamba, L.; Lapikás, L.; Lehmann, I.; López Ruiz, A.; Lorenzon, W.; Lu, X.; Ma, B.-Q.; Mahon, D.; Manaenkov, S. I.; Mao, Y.; Marianski, B.; Martinez de La Ossa, A.; Marukyan, H.; Miller, C. A.; Miyachi, Y.; Movsisyan, A.; Murray, M.; Nappi, E.; Nass, A.; Negodaev, M.; Nowak, W.-D.; Pappalardo, L. L.; Perez-Benito, R.; Petrosyan, A.; Reimer, P. E.; Reolon, A. R.; Riedl, C.; Rith, K.; Rosner, G.; Rostomyan, A.; Rubin, J.; Ryckbosch, D.; Salomatin, Y.; Schnell, G.; Schüler, K. P.; Seitz, B.; Shibata, T.-A.; Stancari, M.; Steijger, J. J. M.; Taroian, S.; Terkulov, A.; Truty, R.; Trzcinski, A.; Tytgat, M.; van Haarlem, Y.; van Hulse, C.; Veretennikov, D.; Vikhrov, V.; Vilardi, I.; Wang, S.; Yaschenko, S.; Ye, H.; Ye, Z.; Yen, S.; Zihlmann, B.; Zupranski, P.; Hermes Collaboration

    2015-03-01

    The earlier search at HERMES for narrow baryon states excited in quasireal photoproduction, decaying through the channel p KS0→p π+π- , has been extended with improved decay-particle reconstruction, more advanced particle identification, and increased event samples. The structure observed earlier at an invariant mass of 1528 MeV shifts to 1522 MeV and the statistical significance drops to about 2 σ for data taken with a deuterium target. The number of events above background is 6 8-31+98(stat)±13 (sys) . No such structure is observed in the hydrogen data set.

  7. Higgs bosons searches at CDF

    SciTech Connect

    Cuenca Almenar, Cristobal; /UC, Irvine

    2010-01-01

    Advanced analysis techniques together with increasing data samples are bringing the sensitivity of CDF to the Higgs boson very close to the SM predictions. These improvements translate into more stringent exclusions of parameter space in BSM Higgs sectors and of the SM mass range. The CDF Collaboration has a very active program on Higgs searches that comprises most accessible production mechanisms and decay channels in {bar p}p collisions at {radical}s = 1.96 TeV. This contribution will also review the combination of the different channels, data samples and analysis techinques that currently produces one of the most exciting experimental results in our field.

  8. Searching for extraterrestrial intelligence - The ultimate exploration

    NASA Technical Reports Server (NTRS)

    Black, D.; Tarter, J.; Cuzzi, J. N.; Conners, M.; Clark, T. A.

    1977-01-01

    A survey highlighting the central issues of the SETI program (Search for Extraterrestrial Intelligence), including its rationale, scope, search problems, and goals is presented. Electromagnetic radiation is suggested as the most likely means via which knowledge of extraterrestrial intelligence will be obtained, and the variables governing these signals are discussed, including: signal frequency and polarization, state, possible coordinates, and signal duration. The modern history of SETI and NASA's involvement is briefly reviewed, and the search strategies used by the Jet Propulsion Laboratory and the Ames Research Center are discussed and compared. Some of the potential scientific and cultural impacts of the SETI program are mentioned, noting advancements in technological, biological, and chemical research.

  9. Searching and Indexing Genomic Databases via Kernelization

    PubMed Central

    Gagie, Travis; Puglisi, Simon J.

    2015-01-01

    The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes. Several authors have recently suggested searching or indexing only one reference genome and the parts of the other genomes where they differ. In this paper, we survey the 20-year history of this idea and discuss its relation to kernelization in parameterized complexity. PMID:25710001

  10. Application of the mid-IR radio correlation to the Ĝ sample and the search for advanced extraterrestrial civilisations

    NASA Astrophysics Data System (ADS)

    Garrett, M. A.

    2015-09-01

    Wright et al. (2014, ApJ, 792, 26) have embarked on a search for advanced Karadashev Type III civilisations via the compilation of a sample of sources with extreme mid-IR emission and colours. The aim is to furnish a list of candidate galaxies that might harbour an advanced Kardashev Type III civilisation; in this scenario, the mid-IR emission is then primarily associated with waste heat energy by-products. I apply the mid-IR radio correlation to this Glimpsing Heat from Alien Technology (Ĝ) sample, a catalogue of 93 candidate galaxies compiled by Griffith et al. (2015, ApJS, 217, 25). I demonstrate that the mid-IR and radio luminosities are correlated for the sample, determining a k-corrected value of q22 = 1.35 ± 0.42. By comparison, a similar measurement for 124 galaxies drawn from the First Look Survey (FLS) has q22 = 0.87 ± 0.27. The statistically significant difference of the mean value of q22 for these two samples, taken together with their more comparable far-IR properties, suggests that the Ĝ sample shows excessive emission in the mid-IR. The fact that the Ĝ sample largely follows the mid-IR radio correlation strongly suggests that the vast majority of these sources are associated with galaxies in which natural astrophysical processes are dominant. This simple application of the mid-IR radio correlation can substantially reduce the number of false positives in the Ĝ catalogue since galaxies occupied by advanced Kardashev Type III civilisations would be expected to exhibit very high values of q. I identify nine outliers in the sample with q22> 2 of which at least three have properties that are relatively well explained via standard astrophysical interpretations e.g. dust emission associated with nascent star formation and/or nuclear activity from a heavily obscured AGN. The other outliers have not been studied in any great detail, and are deserving of further observation. I also note that the comparison of resolved mid-IR and radio images of galaxies

  11. The G-HAT Search for Advanced Extraterrestrial Civilizations: The Reddest Extended WISE Sources

    NASA Astrophysics Data System (ADS)

    Maldonado, Jessica; Povich, Matthew S.; Wright, Jason; Griffith, Roger; Sigurdsson, Steinn; Mullan, Brendan L.

    2015-01-01

    Freeman Dyson (1960) theorized how to identify possible signatures of advanced extra-terrestrial civilizations by their waste heat, an inevitable byproduct of a civilization using a significant fraction of the luminosity from their host star. If a civilizations could tap the starlight throughout their host galaxy their waste heat would be easily detectable by recent infrared surveys. The Glimpsing Heat from Alien Technologies (G-HAT) pilot project aims to place limits on the existence of extraterrestrial civilizations at pan-galactic scales. We present results from the G-HAT cleaned catalog of 563 extremely red, extended high Galactic latitude (|b| ≥ 10) sources from the WISE All-Sky Catalog. Our catalog includes sources new to the scientific literature along with well-studied objects (e.g. starburst galaxies, AGN, and planetary nebulae) that exemplify extreme WISE colors. Objects of particular interest include a supergiant Be star (48 Librae) surrounded by a resolved, mid-infrared nebula, possibly indicating dust in the stellar wind ejecta, and a curious cluster of seven extremely red WISE sources (associated with IRAS 04287+6444) that have no optical counterparts.

  12. Workers Search for Columbia's Debris

    NASA Technical Reports Server (NTRS)

    2003-01-01

    Members of a US Forest Service search team walk a grid during a Columbia recovery search near the Hemphill, Texas site. The group is accompanied by a space program worker able to identify potential hazards of Shuttle parts. Workers from every NASA Center and numerous federal, state, and local agencies searched for Columbia's debris in the recovery effort. For more information on STS-107, please see GRIN Columbia General Explanation

  13. Spectral library searching in proteomics.

    PubMed

    Griss, Johannes

    2016-03-01

    Spectral library searching has become a mature method to identify tandem mass spectra in proteomics data analysis. This review provides a comprehensive overview of available spectral library search engines and highlights their distinct features. Additionally, resources providing spectral libraries are summarized and tools presented that extend experimental spectral libraries by simulating spectra. Finally, spectrum clustering algorithms are discussed that utilize the same spectrum-to-spectrum matching algorithms as spectral library search engines and allow novel methods to analyse proteomics data. PMID:26616598

  14. Clinician Search Behaviors May Be Influenced by Search Engine Design

    PubMed Central

    Coiera, Enrico; Zrimec, Tatjana; Compton, Paul

    2010-01-01

    Background 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. Objectives 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. Methods 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. Results 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

  15. Distributed search engine architecture based on topic specific searches

    NASA Astrophysics Data System (ADS)

    Abudaqqa, Yousra; Patel, Ahmed

    2015-05-01

    Indisputably, search engines (SEs) abound. The monumental growth of users performing online searches on the Web is a contending issue in the contemporary world nowadays. For example, there are tens of billions of searches performed everyday, which typically offer the users many irrelevant results which are time consuming and costly to the user. Based on the afore-going problem it has become a herculean task for existing Web SEs to provide complete, relevant and up-to-date information response to users' search queries. To overcome this problem, we developed the Distributed Search Engine Architecture (DSEA), which is a new means of smart information query and retrieval of the World Wide Web (WWW). In DSEAs, multiple autonomous search engines, owned by different organizations or individuals, cooperate and act as a single search engine. This paper includes the work reported in this research focusing on development of DSEA, based on topic-specific specialised search engines. In DSEA, the results to specific queries could be provided by any of the participating search engines, for which the user is unaware of. The important design goal of using topic-specific search engines in the research is to build systems that can effectively be used by larger number of users simultaneously. Efficient and effective usage with good response is important, because it involves leveraging the vast amount of searched data from the World Wide Web, by categorising it into condensed focused topic -specific results that meet the user's queries. This design model and the development of the DSEA adopt a Service Directory (SD) to route queries towards topic-specific document hosting SEs. It displays the most acceptable performance which is consistent with the requirements of the users. The evaluation results of the model return a very high priority score which is associated with each frequency of a keyword.

  16. Image Searching on the Excite Web Search Engine.

    ERIC Educational Resources Information Center

    Goodrum, Abby; Spink, Amanda

    2001-01-01

    Examines visual information needs as expressed in users' Web image queries on the Excite search engine. Discusses metadata; content-based image retrieval; user interaction with images; terms per query; term frequency; and implications for the development of models for visual information retrieval and for the design of Web search engines.…

  17. Predicting consumer behavior with Web search

    PubMed Central

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

    2010-01-01

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

  18. Predicting consumer behavior with Web search.

    PubMed

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

    2010-10-12

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

  19. Efficiency of tabu-search-based conformational search algorithms.

    PubMed

    Grebner, Christoph; Becker, Johannes; Stepanenko, Svetlana; Engels, Bernd

    2011-07-30

    Efficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method, and the basin hopping (BH) approach (which are widely used in this field) with a previously suggested tabu-search-based approach called gradient only tabu search (GOTS). The study emphasizes the success of the GOTS procedure and, more importantly, shows that an approach which combines BH and GOTS outperforms the single methods in efficiency and speed. We also show that ring structures built by a hydrogen bond are useful as starting points for conformational search investigations of peptides and organic ligands with biological activities, especially in structures that contain multiple rings. PMID:21541959

  20. Transition between different search patterns in human online search behavior

    NASA Astrophysics Data System (ADS)

    Wang, Xiangwen; Pleimling, Michel

    2015-03-01

    We investigate the human online search behavior by analyzing data sets from different search engines. Based on the comparison of the results from several click-through data-sets collected in different years, we observe a transition of the search pattern from a Lévy-flight-like behavior to a Brownian-motion-type behavior as the search engine algorithms improve. This result is consistent with findings in animal foraging processes. A more detailed analysis shows that the human search patterns are more complex than simple Lévy flights or Brownian motions. Notable differences between the behaviors of different individuals can be observed in many quantities. This work is in part supported by the US National Science Foundation through Grant DMR-1205309.

  1. Rigid substructure search

    PubMed Central

    Shirvanyants, David; Alexandrova, Anastassia N.; Dokholyan, Nikolay V.

    2011-01-01

    Motivation: Identifying the location of binding sites on proteins is of fundamental importance for a wide range of applications, including molecular docking, de novo drug design, structure identification and comparison of functional sites. Here we present Erebus, a web server that searches the entire Protein Data Bank for a given substructure defined by a set of atoms of interest, such as the binding scaffolds for small molecules. The identified substructure contains atoms having the same names, belonging to same amino acids and separated by the same distances (within a given tolerance) as the atoms of the query structure. The accuracy of a match is measured by the root-mean-square deviation or by the normal weight with a given variance. Tests show that our approach can reliably locate rigid binding scaffolds of drugs and metal ions. Availability and Implementation: We provide this service through a web server at http://erebus.dokhlab.org. Contact: dokh@unc.edu PMID:21460026

  2. Music Search and Recommendation

    NASA Astrophysics Data System (ADS)

    Brandenburg, Karlheinz; Dittmar, Christian; Gruhne, Matthias; Abeßer, Jakob; Lukashevich, Hanna; Dunker, Peter; Gärtner, Daniel; Wolter, Kay; Grossmann, Holger

    In the last ten years, our ways to listen to music have drastically changed: In earlier times, we went to record stores or had to use low bit-rate audio coding to get some music and to store it on PCs. Nowadays, millions of songs are within reach via on-line distributors. Some music lovers already got terabytes of music on their hard disc. Users are now no longer desparate to get music, but to select, to find the music they love. A number of technologies has been developed to adress these new requirements. There are techniques to identify music and ways to search for music. Recommendation today is a hot topic as well as organizing music into playlists.

  3. Search-based optimization

    NASA Technical Reports Server (NTRS)

    Wheeler, Ward C.

    2003-01-01

    The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

  4. Search-based optimization.

    PubMed

    Wheeler, Ward C

    2003-08-01

    The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. PMID:14531408

  5. The SARG Planet Search

    NASA Astrophysics Data System (ADS)

    Desidera, S.; Gratton, R.; Endl, M.; Fiorenzano, A. F. Martinez; Barbieri, M.; Claudi, R.; Cosentino, R.; Scuderi, S.; Bonavita, M.

    The search for planets in multiple systems allows to improve our knowledge of planet formation and evolution. On one hand, the frequency of planets in binary systems has a strong effect on the global frequency of planets, as more than half of solar-type stars are in binary or multiple systems (Duquennoy and Mayor 1991). On the other hand, the properties of planets in binaries, and their differences with the properties of the planets orbiting single stars, would shed light on the effects caused by the presence of the companion stars. Indeed, the first analysis of the properties of planets in binaries showed the occurrence of some differences with respect to those orbiting single stars (Zucker and Mazeh 2002; Eggenberger et al. 2004).

  6. Search for Binary Trojans

    NASA Astrophysics Data System (ADS)

    Noll, Keith S.; Grundy, W. M.; Ryan, E. L.; Benecchi, S. D.

    2015-11-01

    We have reexamined 41 Trojan asteroids observed with the Hubble Space Telescope (HST) to search for unresolved binaries. We have identified one candidate binary with a separation of 53 milliarcsec, about the width of the diffraction limited point-spread function (PSF). Sub-resolution-element detection of binaries is possible with HST because of the high signal-to-noise ratio of the observations and the stability of the PSF. Identification and confirmation of binary Trojans is important because a Trojan Tour is one of five possible New Frontiers missions. A binary could constitute a potentially high value target because of the opportunity to study two objects and to test models of the primordial nature of binaries. The potential to derive mass-based physical information from the binary orbit could yield more clues to the origin of Trojans.

  7. The constrainedness of search

    SciTech Connect

    Gent, I.P.; MacIntyre, E.; Prosser, P.

    1996-12-31

    We introduce a parameter that measures the {open_quotes}constrainedness{close_quotes} of an ensemble of combinatorial problems. If problems are over-constrained, they are likely to be insoluble. If problems are under-constrained, they are likely to be soluble. This constrainedness parameter generalizes a number of parameters previously used in different NP-complete problem classes. Phase transitions in different NP classes can thus be directly compared. This parameter can also be used in a heuristic to guide search. The heuristic captures the intuition of making the most constrained choice first, since it is often useful to branch into the least constrained subproblem. Many widely disparate heuristics can be seen as minimizing constrainedness.

  8. Comparing NEO Search Telescopes

    NASA Astrophysics Data System (ADS)

    Myhrvold, Nathan

    2016-04-01

    Multiple terrestrial and space-based telescopes have been proposed for detecting and tracking near-Earth objects (NEOs). Detailed simulations of the search performance of these systems have used complex computer codes that are not widely available, which hinders accurate cross-comparison of the proposals and obscures whether they have consistent assumptions. Moreover, some proposed instruments would survey infrared (IR) bands, whereas others would operate in the visible band, and differences among asteroid thermal and visible-light models used in the simulations further complicate like-to-like comparisons. I use simple physical principles to estimate basic performance metrics for the ground-based Large Synoptic Survey Telescope and three space-based instruments—Sentinel, NEOCam, and a Cubesat constellation. The performance is measured against two different NEO distributions, the Bottke et al. distribution of general NEOs, and the Veres et al. distribution of Earth-impacting NEO. The results of the comparison show simplified relative performance metrics, including the expected number of NEOs visible in the search volumes and the initial detection rates expected for each system. Although these simplified comparisons do not capture all of the details, they give considerable insight into the physical factors limiting performance. Multiple asteroid thermal models are considered, including FRM, NEATM, and a new generalized form of FRM. I describe issues with how IR albedo and emissivity have been estimated in previous studies, which may render them inaccurate. A thermal model for tumbling asteroids is also developed and suggests that tumbling asteroids may be surprisingly difficult for IR telescopes to observe.

  9. New particle searches at CDF

    SciTech Connect

    Maeshima, Kaori; CDF Collaboration

    1996-11-01

    We present recent results of searches for new particles beyond the Standard Model at the Collider Detector at Fermilab (CDF). These include searches for supersymmetric (SUSY) particles, charged Higgs, heavy gauge bosons (Z{prime} and W{prime}), and stable massive charged particles. 19 refs., 12 figs.

  10. MOPITT Search and Subset Tool

    Atmospheric Science Data Center

    2016-06-24

    ... 6 data is now available in both HDF5 and netCDF4 formats Login is no longer required to search and subset, only when placing an order ... 6 data is now available in both HDF5 and netCDF4 formats Login is no longer required to search and subset, only when placing an order ...

  11. Assessing Bias in Search Engines.

    ERIC Educational Resources Information Center

    Mowshowitz, Abbe; Kawaguchi, Akira

    2002-01-01

    Addresses the measurement of bias in search engines on the Web, defining bias as the balance and representation of items in a collection retrieved from a database for a set of queries. Assesses bias by measuring the deviation from the ideal of the distribution produced by a particular search engine. (Author/LRW)

  12. Searching Algorithm Using Bayesian Updates

    ERIC Educational Resources Information Center

    Caudle, Kyle

    2010-01-01

    In late October 1967, the USS Scorpion was lost at sea, somewhere between the Azores and Norfolk Virginia. Dr. Craven of the U.S. Navy's Special Projects Division is credited with using Bayesian Search Theory to locate the submarine. Bayesian Search Theory is a straightforward and interesting application of Bayes' theorem which involves searching…

  13. The Perfectly Organized Search Service.

    ERIC Educational Resources Information Center

    Leach, Sandra Sinsel; Spencer, Mary Ellen

    1993-01-01

    Describes the evolution and operation of the successful Database Search Service (DSS) at the John C. Hodges Library, University of Tennessee, with detailed information about equipment, policies, software, training, and physical layout. Success is attributed to careful administration, standardization of search equipment and interfaces, staff…

  14. XML and Better Web Searching.

    ERIC Educational Resources Information Center

    Jackson, Joe; Gilstrap, Donald L.

    1999-01-01

    Addresses the implications of the new Web metalanguage XML for searching on the World Wide Web and considers the future of XML on the Web. Compared to HTML, XML is more concerned with structure of data than documents, and these data structures should prove conducive to precise, context rich searching. (Author/LRW)

  15. The Perils of Strip Searches.

    ERIC Educational Resources Information Center

    Trotter, Andrew

    1995-01-01

    Every year, a few administrators mishandle school searches and create spectacles similar to the New Castle, Pennsylvania, incident involving six illegally strip-searched students. Principals using "cops-and-robber" techniques to unearth contraband may not realize the potential for infringing on students' constitutional privacy rights. Strip…

  16. Before You Search that Locker.

    ERIC Educational Resources Information Center

    Dowling-Sendor, Benjamin

    1998-01-01

    In DesRoches v Caprio, federal district court ruled in favor of Jim DesRoches who had decided not to consent to a search of his backpack for a pair of allegedly stolen sneakers. Judge Robert G. Doumar decided the need to find the stolen sneakers did not outweigh the students' privacy interest and offered guidelines about school searches for stolen…

  17. The Supreme Court's Search Ruling.

    ERIC Educational Resources Information Center

    Kelly, Margie

    The 1971 police search of a newspaper office led to the United States Supreme Court's "Zurcher v The Stanford Daily" decision that newspaper offices can permissibly be searched if it is believed that they contain materials that relate to an ongoing criminal investigation. This decision has been viewed by the press as an attack on First Amendment…

  18. How a Search Engine Works.

    ERIC Educational Resources Information Center

    Liddy, Elizabeth

    2001-01-01

    Explains how a search engine, or information retrieval system, operates. Four modules are described: the document processor, including term stemming, term weight assignment, and creating an index; the query processor, including parsing and query term weighting; the search and match function; and ranking capability. (LRW)

  19. Semantic Search of Web Services

    ERIC Educational Resources Information Center

    Hao, Ke

    2013-01-01

    This dissertation addresses semantic search of Web services using natural language processing. We first survey various existing approaches, focusing on the fact that the expensive costs of current semantic annotation frameworks result in limited use of semantic search for large scale applications. We then propose a vector space model based service…

  20. Next-Gen Search Engines

    ERIC Educational Resources Information Center

    Gupta, Amardeep

    2005-01-01

    Current search engines--even the constantly surprising Google--seem unable to leap the next big barrier in search: the trillions of bytes of dynamically generated data created by individual web sites around the world, or what some researchers call the "deep web." The challenge now is not information overload, but information overlook.…

  1. Searching Social Work Abstracts: A Review.

    ERIC Educational Resources Information Center

    Mendelsohn, Henry N.

    1986-01-01

    A subject profile using 39 concepts central to the practice of social work was searched in Social Work Abstracts (SWAB), PsycINFO, ERIC, and Social SciSearch. Social work practice concepts and search strategy, search term results, journal titles searched, and source coverage and date of most recently indexed article are noted. (EJS)

  2. Personalized Spiders for Web Search and Analysis.

    ERIC Educational Resources Information Center

    Chau, Michael; Zeng, Daniel; Chen, Hsinchun

    Searching for useful information on the World Wide Web has become increasingly difficult. While Internet search engines have been helping people to search on the Web, low recall rate and outdated indexes have become more and more problematic as the Web grows. In addition, search tools usually present to the user only a list of search results,…

  3. Searching LEXIS and WESTLAW: Part II.

    ERIC Educational Resources Information Center

    Franklin, Carl

    1986-01-01

    This second of a three-part series compares search features (i.e., truncation symbols, boolean operators, proximity operators, phrase searching, save searches) of two databases providing legal information. Search tips concerning charges and effective searching and tables listing functions of commands and proximity operators for both databases are…

  4. Search Models: Who Does the Looking?

    ERIC Educational Resources Information Center

    Duffield, Judith A.

    1996-01-01

    Describes two search models for school libraries. Models include searches defined by the student but conducted by a trained searcher, and student-conducted searches which teach search skills. Decisions about which model (or combination) to use should be based on the available resources and the purposes for conducting the search. (AEF)

  5. Presidential Search: Ensuring a Good Start.

    ERIC Educational Resources Information Center

    Stead, Ronald S.

    1987-01-01

    Important first steps in the search and selection process of presidents and chancellors are outlined by the director of the Association of Governing Boards' Presidential Search Consultation Service. Guidelines for a search, appointment of a search committee, staffing the search, timetable, and the board's charge to the committee are discussed.…

  6. Prevalence effect in haptic search

    PubMed Central

    Ishibashi, Kazuya; Watanabe, Ken; Takaoka, Yutaka; Watanabe, Tetsuya; Kita, Shinichi

    2012-01-01

    In visual search tasks, the ratio of target-present to target-absent trials has important effects on miss rates. In this study, we examined whether the target prevalence effect occurs in a haptic search task by using artificial tactile maps. The results indicated that target prevalence has effects on miss rates, sensitivity, and criterion. Moreover, an increase in miss rates in the low-prevalence condition (10%) was strongly correlated with a decrease in search termination times (target-absent reaction times). These results suggest that the prevalence effect on haptic search is caused by a decrease in the search termination time and a shift in decision criterion and a decrease in sensitivity. PMID:23145300

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

    PubMed Central

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

    2008-01-01

    Purpose: 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. Brief Description: 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. Outcomes/Conclusion: 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. PMID:18379665

  8. The Search for Extraterrestrial Life

    NASA Astrophysics Data System (ADS)

    Peter, Ulmschneider

    Looking at the nature, origin, and evolution of life on Earth is one way of assessing whether extraterrestrial life exists on Earth-like planets elsewhere (see Chaps. 5 and 6). A more direct approach is to search for favorable conditions and traces of life on other celestial bodies, both in the solar system and beyond. Clearly, there is little chance of encountering nonhuman intelligent beings in the solar system. But there could well be primitive life on Mars, particularly as in the early history of the solar system the conditions on Mars were quite similar to those on Earth. In addition, surprisingly favorable conditions for life once existed on the moons of Jupiter. Yet even if extraterrestrial life is not encountered in forthcoming space missions, it would be of utmost importance to recover fossils of past organisms as such traces would greatly contribute to our basic understanding of the formation of life. In addition to the planned missions to Mars and Europa, there are extensive efforts to search for life outside the solar system. Rapid advances in the detection of extrasolar planets, outlined in Chap. 3, are expected to lead to the discovery of Earth-like planets in the near future. But how can we detect life on these distant bodies?

  9. National Foster Care and Adoption Directory Search

    MedlinePlus

    ... Adoption Directory Search National Foster Care & Adoption Directory Search Many concerned individuals have expressed the desire to ... how to become a foster or adoptive parent. Search results for this category include contact information for: ...

  10. MedlinePlus FAQ: Search Cloud

    MedlinePlus

    ... faq/searchcloud.html Question: How does the search cloud work? To use the sharing features on this page, please enable JavaScript. Answer: The search cloud displays the top 100 search terms typed into ...

  11. Web Search Engines: (More) Features and Commands.

    ERIC Educational Resources Information Center

    Hock, Randolph

    2000-01-01

    Provides a summary look at the features provided by nine major World Wide Web search engines. Examines size, Boolean operators, phrase searching capabilities, media searching, format options, and special features. (LRW)

  12. Mississippi State Axion Search

    NASA Astrophysics Data System (ADS)

    Madsen, John

    2014-03-01

    The Mississippi State Axion Search (MASS) is an attempt to improve the limit on the mass coupling parameter of the Axion. The design features a sealed cavity partitioned by a lead wall into which RF power is transmitted. Another antenna on the far end of the cavity serves as the detector. The signal acquired by this antenna is fed through an integrator and a series of pre-amps and lock-ins before reaching the data acquisition system. The data acquisition system, written in the LabView front end DASYLab, operates at 1 kHz in synchronicity with a TTL pulse that resets the integrator. The value recorded by the DAQ is, therefore, the maximum voltage of integration in the millisecond period. The Axion signal would appear in the data as a voltage excess. Several measures have been implemented with more being developed to ensure the validity of detections. Large excesses are cut by an electronics system, and smaller anomalies will be excised in the data analysis. Results will also compared to a complete Monte Carlo simulation currently in development. Prajwal Mohanmurthy*, Dipangkar Dutta, Nicholas Fowler, Mikhail Gaerlan, Kris Madsen, Adam Powers, Amy Ray, David Reed, Robertsen Riehle, Mitra Shabestari, Zachary Windham, Zach Short.

  13. Mississippi State Axion Search

    NASA Astrophysics Data System (ADS)

    Madsen, Kris; Mississippi State Axion Search Collaboration

    2013-10-01

    Ever since the Peccei-Quinn Theory was proposed in 1977 as a possible solution to the strong CP problem, the therein postulated Axion, a weakly interacting boson, has been much sought after. The Mississippi State Axion Search is an attempt to improve the limit in the mass-coupling parameter space by using a variation of the Light Shining Through a Wall (LSW) technique. A vacuum sealed and RF shielded cavity is partitioned by a lead wall. EM waves at a frequency between 420 and 430 MHz are amplified by SR-550 and SR-510 amplifiers, broadcast from an antenna on one side of the lead wall and pass through an intense magnetic field. Theory predicts that in the presence of such a magnetic field, axions can be produced from photons via the Primakoff effect. Any axions generated will pass unimpeded to the other half of the cavity, regenerate into photons, and be detected as an excess in the signal picked up by the antenna on the far side. The Data Acquisition is handled by LABView based software running Measurement Computing drivers for two PCI DAQ cards: the DAS-08 handles the analog signals from the receiving antenna and monitors vital statistics in the cavity, while the DIO-24 provides the 1 kHz timing TTL pulse and allows remote control of the experiment's systems.

  14. Spatial search by quantum walk

    SciTech Connect

    Childs, Andrew M.; Goldstone, Jeffrey

    2004-08-01

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

  15. Medical literature search dot com.

    PubMed

    Jain, Vivek; Raut, Deepak K

    2011-01-01

    The Internet provides a quick access to a plethora of the medical literature, in the form of journals, databases, dictionaries, textbooks, indexes, and e-journals, thereby allowing access to more varied, individualized, and systematic educational opportunities. Web search engine is a tool designed to search for information on the World Wide Web, which may be in the form of web pages, images, information, and other types of files. Search engines for internet-based search of medical literature include Google, Google scholar, Yahoo search engine, etc., and databases include MEDLINE, PubMed, MEDLARS, etc. Commercial web resources (Medscape, MedConnect, MedicineNet) add to the list of resource databases providing some of their content for open access. Several web-libraries (Medical matrix, Emory libraries) have been developed as meta-sites, providing useful links to health resources globally. Availability of specific dermatology-related websites (DermIs, DermNet, and Genamics Jornalseek) is useful addition to the ever growing list of web-based resources. A researcher must keep in mind the strengths and limitations of a particular search engine/database while searching for a particular type of data. Knowledge about types of literature and levels of detail available, user interface, ease of access, reputable content, and period of time covered allow their optimal use and maximal utility in the field of medicine. PMID:21393941

  16. The use of geoscience methods for terrestrial forensic searches

    NASA Astrophysics Data System (ADS)

    Pringle, J. K.; Ruffell, A.; Jervis, J. R.; Donnelly, L.; McKinley, J.; Hansen, J.; Morgan, R.; Pirrie, D.; Harrison, M.

    2012-08-01

    Geoscience methods are increasingly being utilised in criminal, environmental and humanitarian forensic investigations, and the use of such methods is supported by a growing body of experimental and theoretical research. Geoscience search techniques can complement traditional methodologies in the search for buried objects, including clandestine graves, weapons, explosives, drugs, illegal weapons, hazardous waste and vehicles. This paper details recent advances in search and detection methods, with case studies and reviews. Relevant examples are given, together with a generalised workflow for search and suggested detection technique(s) table. Forensic geoscience techniques are continuing to rapidly evolve to assist search investigators to detect hitherto difficult to locate forensic targets.

  17. BioEve Search: A Novel Framework to Facilitate Interactive Literature Search

    PubMed Central

    Ahmed, Syed Toufeeq; Davulcu, Hasan; Tikves, Sukru; Nair, Radhika; Zhao, Zhongming

    2012-01-01

    Background. Recent advances in computational and biological methods in last two decades have remarkably changed the scale of biomedical research and with it began the unprecedented growth in both the production of biomedical data and amount of published literature discussing it. An automated extraction system coupled with a cognitive search and navigation service over these document collections would not only save time and effort, but also pave the way to discover hitherto unknown information implicitly conveyed in the texts. Results. We developed a novel framework (named “BioEve”) that seamlessly integrates Faceted Search (Information Retrieval) with Information Extraction module to provide an interactive search experience for the researchers in life sciences. It enables guided step-by-step search query refinement, by suggesting concepts and entities (like genes, drugs, and diseases) to quickly filter and modify search direction, and thereby facilitating an enriched paradigm where user can discover related concepts and keywords to search while information seeking. Conclusions. The BioEve Search framework makes it easier to enable scalable interactive search over large collection of textual articles and to discover knowledge hidden in thousands of biomedical literature articles with ease. PMID:22693501

  18. Web Search Studies: Multidisciplinary Perspectives on Web Search Engines

    NASA Astrophysics Data System (ADS)

    Zimmer, Michael

    Perhaps the most significant tool of our internet age is the web search engine, providing a powerful interface for accessing the vast amount of information available on the world wide web and beyond. While still in its infancy compared to the knowledge tools that precede it - such as the dictionary or encyclopedia - the impact of web search engines on society and culture has already received considerable attention from a variety of academic disciplines and perspectives. This article aims to organize a meta-discipline of “web search studies,” centered around a nucleus of major research on web search engines from five key perspectives: technical foundations and evaluations; transaction log analyses; user studies; political, ethical, and cultural critiques; and legal and policy analyses.

  19. Government Search Tools: Evaluating Fee and Free Search Alternatives.

    ERIC Educational Resources Information Center

    Gordon-Murnane, Laura

    1999-01-01

    Examines four tools that provide access to federal government information: FedWorld, Usgovsearch.com, Google/Unclesam, and GovBot. Compares search features, size of collection, ease of use, and cost or subscription requirements. (LRW)

  20. Search systems and computer-implemented search methods

    DOEpatents

    Payne, Deborah A.; Burtner, Edwin R.; Bohn, Shawn J.; Hampton, Shawn D.; Gillen, David S.; Henry, Michael J.

    2015-12-22

    Search systems and computer-implemented search methods are described. In one aspect, a search system includes a communications interface configured to access a plurality of data items of a collection, wherein the data items include a plurality of image objects individually comprising image data utilized to generate an image of the respective data item. The search system may include processing circuitry coupled with the communications interface and configured to process the image data of the data items of the collection to identify a plurality of image content facets which are indicative of image content contained within the images and to associate the image objects with the image content facets and a display coupled with the processing circuitry and configured to depict the image objects associated with the image content facets.

  1. New TES Search and Subset Application

    Atmospheric Science Data Center

    2013-08-06

    New TES Search and Subset Application Search & Subset Application Wednesday, September 19, 2012 The Atmospheric Science Data Center (ASDC) at NASA Langley Research Center in collaboration with the ...

  2. A framework for structured quantum search

    NASA Astrophysics Data System (ADS)

    Hogg, Tad

    1998-09-01

    A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating that it is effectively using the problem structure.

  3. Supermassive Black Hole Binaries: The Search Continues

    NASA Astrophysics Data System (ADS)

    Bogdanović, Tamara

    Gravitationally bound supermassive black hole binaries (SBHBs) are thought to be a natural product of galactic mergers and growth of the large scale structure in the universe. They however remain observationally elusive, thus raising a question about characteristic observational signatures associated with these systems. In this conference proceeding I discuss current theoretical understanding and latest advances and prospects in observational searches for SBHBs.

  4. Searching for Fireballs

    NASA Astrophysics Data System (ADS)

    Sullivan, G. M.; Klebe, D. I.

    2004-05-01

    Researchers at the Denver Museum of Nature and Science (DMNS) have developed the All Sky Program (ASP) for the purpose of monitoring fireballs across the state of Colorado. The ASP provides a great opportunity for young students (grades 6-12), introducing them to the scientific process wherein they provide valuable astronomical research. A network of fourteen low-light video cameras with wide-angle imaging capabilities have been mounted atop DMNS and several Colorado middle and high schools rooftops. These cameras are spread across Colorado creating nearly complete sky coverage, and making it possible to record the same event from multiple locations allowing for triangulation. When a fireball caused by an incoming meteorite is detected, the system automatically records the event. Participating student teams have assembled these specialized cameras and now filter the data that is collected nightly. This data is used to conduct an inquiry-based investigation of meteors, fireballs, and other solar system objects. The ASP supplies unique scientific information about the statistics of fireballs and meteors. Coordinate data also enables determination of possible meteorite search area and the recreation of original meteoroid orbits. DMNS researchers will display a replica of the ASP instrument and present data from the ASP including video of actual fireball events recorded by the system. Teachers came together to develop this program and create activities that support the Colorado Content Standards in Science, Math, Reading and Writing. Students from all corners of the state are working together remotely, as well as working with DMNS scientists and resources, including Curator of Geology Jack Murphy and the museums exceptional meteorite collection.

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

    NASA Technical Reports Server (NTRS)

    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.

  6. New Physics Searches at BABAR

    SciTech Connect

    Renga, Francesco

    2008-11-23

    We will present the most recent results from the BABAR Collaboration concerning New Physics searches in rare B and Lepton Flavour Violating (LFV) decays, including b{yields}s transitions, purely leptonic B decays and LFV {tau} decays.

  7. Procurement of Literature Searching Services.

    ERIC Educational Resources Information Center

    Burgess, Jonathan G.; McCann, Anne

    1979-01-01

    A project for the cyclic review of the safety of food additives initiated by the Food and Drug Administration's Bureau of Foods is outlined, and contractual arrangements and procedures for procuring the necessary literature searches are discussed. (CWM)

  8. Properties of heuristic search strategies

    NASA Technical Reports Server (NTRS)

    Vanderbrug, G. J.

    1973-01-01

    A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.

  9. Quark search at the CBA

    SciTech Connect

    Larsen, R.C.; Leipuner, L.B.; Morse, W.M.; Adair, R.K.; Kasha, H.; Schmidt, M.P.

    1983-03-13

    An experiment to search for quarks at the CBA is described. The cross sections for the production of massive quark-antiquark pairs in nucleon-nucleon interactions is estimated, and the experimental design and procedures are described. (WHK)

  10. The Search for Dark Matter

    SciTech Connect

    Orrell, John

    2013-11-20

    More than 25 years ago, PNNL scientists began the first underground measurements searching for dark matter using specialized radiation detector technology. Dark matter is yet to be discovered says Physicist John L. Orrell.

  11. The Search for Dark Matter

    ScienceCinema

    Orrell, John

    2014-07-24

    More than 25 years ago, PNNL scientists began the first underground measurements searching for dark matter using specialized radiation detector technology. Dark matter is yet to be discovered says Physicist John L. Orrell.

  12. ARTS in Search of Talent.

    ERIC Educational Resources Information Center

    Askin, Walter

    1983-01-01

    The Arts Recognition and Talent Search (ARTS) program, which provides young artists with a full range of scholarship opportunities and with cash awards, is described. Student work submitted to ARTS in the past is shown. (RM)

  13. Location-based Web Search

    NASA Astrophysics Data System (ADS)

    Ahlers, Dirk; Boll, Susanne

    In recent years, the relation of Web information to a physical location has gained much attention. However, Web content today often carries only an implicit relation to a location. In this chapter, we present a novel location-based search engine that automatically derives spatial context from unstructured Web resources and allows for location-based search: our focused crawler applies heuristics to crawl and analyze Web pages that have a high probability of carrying a spatial relation to a certain region or place; the location extractor identifies the actual location information from the pages; our indexer assigns a geo-context to the pages and makes them available for a later spatial Web search. We illustrate the usage of our spatial Web search for location-based applications that provide information not only right-in-time but also right-on-the-spot.

  14. Search for supersymmetry at CDF

    SciTech Connect

    Kamon, T., Texas A&M University and FNAL

    1998-08-01

    We summarize results of a search for supersymmetry (SUSY) using a data sample of dileptons in p{anti p} collisions at {radical}s=1.8 TeV. The data represent an integrated luminosity of 107 pb{sup -1} collected by the Collider Detector at Fermilab (CDF) during the 1992-93 and 1994-95 runs. We also briefly provide a prospect of the SUSY search at CDF in the next run of the Tevatron.

  15. Conceptual Models for Search Engines

    NASA Astrophysics Data System (ADS)

    Hendry, D. G.; Efthimiadis, E. N.

    Search engines have entered popular culture. They touch people in diverse private and public settings and thus heighten the importance of such important social matters as information privacy and control, censorship, and equitable access. To fully benefit from search engines and to participate in debate about their merits, people necessarily appeal to their understandings for how they function. In this chapter we examine the conceptual understandings that people have of search engines by performing a content analysis on the sketches that 200 undergraduate and graduate students drew when asked to draw a sketch of how a search engine works. Analysis of the sketches reveals a diverse range of conceptual approaches, metaphors, representations, and misconceptions. On the whole, the conceptual models articulated by these students are simplistic. However, students with higher levels of academic achievement sketched more complete models. This research calls attention to the importance of improving students' technical knowledge of how search engines work so they can be better equipped to develop and advocate policies for how search engines should be embedded in, and restricted from, various private and public information settings.

  16. Multidimensional gene search with Genehopper

    PubMed Central

    Munz, Matthias; Tönnies, Sascha; Balke, Wolf-Tilo; Simon, Eric

    2015-01-01

    The high abundance of genetic information enables researchers to gain new insights from the comparison of human genes according to their similarities. However, existing tools that allow the exploration of such gene-to-gene relationships, apply each similarity independently. To make use of multidimensional scoring, we developed a new search engine named Genehopper. It can handle two query types: (i) the typical use case starts with a term-to-gene search, i.e. an optimized full-text search for an anchor gene of interest. The web-interface can handle one or more terms including gene symbols and identifiers of Ensembl, UniProt, EntrezGene and RefSeq. (ii) When the anchor gene is defined, the user can explore its neighborhood by a gene-to-gene search as the weighted sum of nine normalized gene similarities based on sequence homology, protein domains, mRNA expression profiles, Gene Ontology Annotation, gene symbols and other features. Each weight can be adjusted by the user, allowing flexible customization of the gene search. All implemented similarities have a low pairwise correlation (max r2 = 0.4) implying a low linear dependency, i.e. any change in a single weight has an effect on the ranking. Thus, we treated them as separate dimensions in the search space. Genehopper is freely available at http://genehopper.ifis.cs.tu-bs.de. PMID:25990726

  17. Multidimensional gene search with Genehopper.

    PubMed

    Munz, Matthias; Tönnies, Sascha; Balke, Wolf-Tilo; Simon, Eric

    2015-07-01

    The high abundance of genetic information enables researchers to gain new insights from the comparison of human genes according to their similarities. However, existing tools that allow the exploration of such gene-to-gene relationships, apply each similarity independently. To make use of multidimensional scoring, we developed a new search engine named Genehopper. It can handle two query types: (i) the typical use case starts with a term-to-gene search, i.e. an optimized full-text search for an anchor gene of interest. The web-interface can handle one or more terms including gene symbols and identifiers of Ensembl, UniProt, EntrezGene and RefSeq. (ii) When the anchor gene is defined, the user can explore its neighborhood by a gene-to-gene search as the weighted sum of nine normalized gene similarities based on sequence homology, protein domains, mRNA expression profiles, Gene Ontology Annotation, gene symbols and other features. Each weight can be adjusted by the user, allowing flexible customization of the gene search. All implemented similarities have a low pairwise correlation (max r(2) = 0.4) implying a low linear dependency, i.e. any change in a single weight has an effect on the ranking. Thus, we treated them as separate dimensions in the search space. Genehopper is freely available at http://genehopper.ifis.cs.tu-bs.de. PMID:25990726

  18. Search for solar axions

    NASA Astrophysics Data System (ADS)

    Newman, Seth Aaron

    Peccei and Quinn proposed an elegant solution for restoring CP symmetry to the QCD Lagrangian [37]. This method includes an additional global U(1) symmetry included in the QCD Lagrangian which is spontaneously broken at a high energy scale, fa. Breaking the symmetry generates a Nambu-Goldstone boson called the axion. Although there are various detection mechanisms that search for the axion, this thesis focuses on the the axio-electric effect. The axio-electric is similar to the photo-electric effect in that an axion is absorbed by an atom which subsequently emits an electron. The electron's energy is equivalent to the incoming axion energy minus the binding energy. The higher shell electrons immediately replenish the missing binding energy yielding a single energy peak at the incoming axion's energy. The 14.4 keV M1 transition of 57Fe is one possible axion source. The development of an optimum trigger algorithm has lowered the threshold for analysis in TeO2 bolometers to a few keV making an axion signature accessible to CUORE related R&D experiments such as the Chinese Crystal Validation Runs (CCVR) and Three Towers Test (TTT). These TeO2 crystal detectors have masses 750 and 790 grams, respectively. Each crystal has a stabilization heater and a germanium thermometer attached to its surface by an epoxy glue. The two previous experiments are R&D tests for the upcoming larger experiment, CUORE. CUORE will be made of 988 TeO2 crystals arranged in 19 towers with 13 floors each, each floor with 4 detectors. This thesis examined 87.01 kg·days of Three Towers data for an axion signal. A peak is observed in the region of interest with a statistical significance less than 1sigma over the expected background fluctuations, yielding a total background rate of 0.185 +/- 0.001 (Stat.) +/- 0.006 (Syst.) Counts/kg/day at 95% C.L. This places an experimental limit on the coupling constant fa of f a (S = 0.50) ≥ 1.16 x 106 GeV at 95% C.L. Projecting the TTT result to the CUORE

  19. Searching for Primordial Antimatter

    NASA Astrophysics Data System (ADS)

    2008-10-01

    Scientists are on the hunt for evidence of antimatter - matter's arch nemesis - leftover from the very early Universe. New results using data from NASA's Chandra X-ray Observatory and Compton Gamma Ray Observatory suggest the search may have just become even more difficult. Antimatter is made up of elementary particles, each of which has the same mass as their corresponding matter counterparts --protons, neutrons and electrons -- but the opposite charges and magnetic properties. When matter and antimatter particles collide, they annihilate each other and produce energy according to Einstein's famous equation, E=mc2. According to the Big Bang model, the Universe was awash in particles of both matter and antimatter shortly after the Big Bang. Most of this material annihilated, but because there was slightly more matter than antimatter - less than one part per billion - only matter was left behind, at least in the local Universe. Trace amounts of antimatter are believed to be produced by powerful phenomena such as relativistic jets powered by black holes and pulsars, but no evidence has yet been found for antimatter remaining from the infant Universe. How could any primordial antimatter have survived? Just after the Big Bang there was believed to be an extraordinary period, called inflation, when the Universe expanded exponentially in just a fraction of a second. "If clumps of matter and antimatter existed next to each other before inflation, they may now be separated by more than the scale of the observable Universe, so we would never see them meet," said Gary Steigman of The Ohio State University, who conducted the study. "But, they might be separated on smaller scales, such as those of superclusters or clusters, which is a much more interesting possibility." X-rayChandra X-ray Image In that case, collisions between two galaxy clusters, the largest gravitationally-bound structures in the Universe, might show evidence for antimatter. X-ray emission shows how much hot

  20. Searching for Primordial Antimatter

    NASA Astrophysics Data System (ADS)

    2008-10-01

    Scientists are on the hunt for evidence of antimatter - matter's arch nemesis - leftover from the very early Universe. New results using data from NASA's Chandra X-ray Observatory and Compton Gamma Ray Observatory suggest the search may have just become even more difficult. Antimatter is made up of elementary particles, each of which has the same mass as their corresponding matter counterparts --protons, neutrons and electrons -- but the opposite charges and magnetic properties. When matter and antimatter particles collide, they annihilate each other and produce energy according to Einstein's famous equation, E=mc2. According to the Big Bang model, the Universe was awash in particles of both matter and antimatter shortly after the Big Bang. Most of this material annihilated, but because there was slightly more matter than antimatter - less than one part per billion - only matter was left behind, at least in the local Universe. Trace amounts of antimatter are believed to be produced by powerful phenomena such as relativistic jets powered by black holes and pulsars, but no evidence has yet been found for antimatter remaining from the infant Universe. How could any primordial antimatter have survived? Just after the Big Bang there was believed to be an extraordinary period, called inflation, when the Universe expanded exponentially in just a fraction of a second. "If clumps of matter and antimatter existed next to each other before inflation, they may now be separated by more than the scale of the observable Universe, so we would never see them meet," said Gary Steigman of The Ohio State University, who conducted the study. "But, they might be separated on smaller scales, such as those of superclusters or clusters, which is a much more interesting possibility." X-rayChandra X-ray Image In that case, collisions between two galaxy clusters, the largest gravitationally-bound structures in the Universe, might show evidence for antimatter. X-ray emission shows how much hot

  1. Solar System object image search: A precovery search engine

    NASA Astrophysics Data System (ADS)

    Gwyn, Stephen; Hill, Norman; Kavelaars, JJ

    2015-08-01

    While regular archive searches can find images at a fixed location, they cannot find images of moving targets such as asteroids or comets. The Solar System Object Image Search (SSOIS) at the Canadian Astronomy Data Centre allows users to search for images of moving objects, allowing precoveries. SSOIS accepts as input either a list of observations, an object designation, a set of orbital elements, or a user-generated ephemeris for an object. It then searches for observations of that object over a range of dates. The user is then presented with a list of images containing that object from a variety of archives. Initially created to search the CFHT MegaCam archive, SSOIS has been extended to other telescopes including Gemini, Subaru/SuprimeCam, WISE, HST, the SDSS, AAT, the ING telescopes, the ESO telescopes, and the NOAO telescopes (KPNO/CTIO/WIYN), for a total of 18 million images. The SSOIS tool is located on the web at http://www.cadc-ccda.hia-iha.nrc-cnrc.gc.ca/en/ssois/.

  2. Solar System Object Image Search: A precovery search engine

    NASA Astrophysics Data System (ADS)

    Gwyn, Stephen D. J.; Hill, Norman; Kavelaars, Jj

    2016-01-01

    While regular astronomical image archive searches can find images at a fixed location, they cannot find images of moving targets such as asteroids or comets. The Solar System Object Image Search (SSOIS) at the Canadian Astronomy Data Centre allows users to search for images of moving objects, allowing precoveries. SSOIS accepts as input either an object designation, a list of observations, a set of orbital elements, or a user-generated ephemeris for an object. It then searches for observations of that object over a range of dates. The user is then presented with a list of images containing that object from a variety of archives. Initially created to search the CFHT MegaCam archive, SSOIS has been extended to other telescopes including Gemini, Subaru/SuprimeCam, WISE, HST, the SDSS, AAT, the ING telescopes, the ESO telescopes, and the NOAO telescopes (KPNO/CTIO/WIYN), for a total of 24.5 million images. As the Pan-STARRS and Hyper Suprime-Cam archives become available, they will be incorporated as well. The SSOIS tool is located on the web at http://www.cadc-ccda.hia-iha.nrc-cnrc.gc.ca/en/ssois/.

  3. Solar System object image search: A precovery search engine

    NASA Astrophysics Data System (ADS)

    Gwyn, S.; Hill, N.; Kavelaars, J.

    2014-07-01

    While regular archive searches can find images at a fixed location, they cannot find images of moving targets such as asteroids or comets. The Solar System Object Image Search (SSOIS) at the Canadian Astronomy Data Centre allows users to search for images of moving objects, allowing precoveries. SSOIS accepts as input either a list of observations, an object designation, a set of orbital elements, or a user-generated ephemeris for an object. It then searches for observations of that object over a range of dates. The user is then presented with a list of images containing that object from a variety of archives. Initially created to search the CFHT MegaCam archive, SSOIS has been extended to other telescopes including Gemini, Subaru/SuprimeCam, HST, the SDSS, AAT, the ESO telescopes, and the NOAO telescopes (KPNO/CTIO/WIYN), for a total of 7.6 million images. The SSOIS tool is located on the web at http://www.cadc-ccda.hia-iha.nrc-cnrc.gc.ca/en/ssois/.

  4. [Online tutorial for searching a dental database].

    PubMed

    Liem, S L

    2009-05-01

    With millions of resources available on the Internet, it is still difficult to search for appropriate and relevant information, even with the use of advanced search engines. With no systematic quality control of online resources, it is difficult to determine how reliable information is. The consortium Intute, which administers a databank of high quality information available via the Internet, which is intended to support scientific teaching and research, ensures that all information provided has been evaluated and investigated by its own team of specialists in various disciplines. A part of the website of Intute which is accessible free of charge is the Virtual Training Suite, by means of which one can improve one's competence in Internet searching and where a number of reliable and qualitatively superior sources for daily practice are available. PMID:19507421

  5. Graphical Representations of Electronic Search Patterns.

    ERIC Educational Resources Information Center

    Lin, Xia; And Others

    1991-01-01

    Discussion of search behavior in electronic environments focuses on the development of GRIP (Graphic Representor of Interaction Patterns), a graphing tool based on HyperCard that produces graphic representations of search patterns. Search state spaces are explained, and forms of data available from electronic searches are described. (34…

  6. End User Searching of Medline. Final Report.

    ERIC Educational Resources Information Center

    Wildemuth, Barbara M.; Moore, Margaret E.

    One hundred sixty-one MEDLINE searches conducted by third year medical students were analyzed and evaluated to determine which search behaviors were used, whether those individual moves are effective, and whether there is a relationship between specific search behaviors and the effectiveness of the search strategy as a whole. The typical search…

  7. The Vicissitudes of the Search Process.

    ERIC Educational Resources Information Center

    McLaughlin, Judith Block; Riesman, David

    1985-01-01

    The search process for a college president has become a complicated affairs. The vicissitudes of the search process not only exhaust search committee members but also deplete the pool of good candidates. Selection criteria, confidentiality and disclosure, and Sunshine searches are discussed. (Author/MLW)

  8. Medical literature review: Search or perish

    PubMed Central

    Skaik, Younis

    2013-01-01

    Literature review is a cascading process of searching, reading, analyzing, and summing up of the materials about a specific topic. However, searching the literature is like searching “a needle in a haystack”, and hence has been called “Cinderella”.1 Therefore, skills and effective pathways of searching the literature are needed to achieve high sensitive and specific results. PMID:24353606

  9. Web Search Engines: Features and Commands.

    ERIC Educational Resources Information Center

    Hock, Randolph

    1999-01-01

    Presents a chart comparing Web search engines. Discusses features covered in the chart: size; Boolean Operators and Parentheses; phrase searching; proximity; truncation; title, date and URL fields; links to a URL; language; media searching; name; case sensitivity; searches all common words; directory attached; gives count for answer; gives term…

  10. Antecedents and Consequences of Job Search Behaviors.

    ERIC Educational Resources Information Center

    Steffy, Brian D.; And Others

    1989-01-01

    Evaluated impact of individual difference variables (gender, school performance, Type A behavior) on job search and influence of search on recruitment, interview performance, job offers, and job placement outcomes (search stress and job satisfaction). Results suggest link between job search, interview outcomes, number of job offers, and placement…

  11. Trait Affect and Job Search Outcomes

    ERIC Educational Resources Information Center

    Cote, Stephane; Saks, Alan M.; Zikic, Jelena

    2006-01-01

    The present study examines the role of trait affect in job search. One hundred and twenty-three university students completed measures of positive and negative affectivity, conscientiousness, job search self-efficacy, job search clarity, and job search intensity during their last year of school while on the job market. At the end of the school…

  12. Statistical templates for visual search.

    PubMed

    Ackermann, John F; Landy, Michael S

    2014-01-01

    How do we find a target embedded in a scene? Within the framework of signal detection theory, this task is carried out by comparing each region of the scene with a "template," i.e., an internal representation of the search target. Here we ask what form this representation takes when the search target is a complex image with uncertain orientation. We examine three possible representations. The first is the matched filter. Such a representation cannot account for the ease with which humans can find a complex search target that is rotated relative to the template. A second representation attempts to deal with this by estimating the relative orientation of target and match and rotating the intensity-based template. No intensity-based template, however, can account for the ability to easily locate targets that are defined categorically and not in terms of a specific arrangement of pixels. Thus, we define a third template that represents the target in terms of image statistics rather than pixel intensities. Subjects performed a two-alternative, forced-choice search task in which they had to localize an image that matched a previously viewed target. Target images were texture patches. In one condition, match images were the same image as the target and distractors were a different image of the same textured material. In the second condition, the match image was of the same texture as the target (but different pixels) and the distractor was an image of a different texture. Match and distractor stimuli were randomly rotated relative to the target. We compared human performance to pixel-based, pixel-based with rotation, and statistic-based search models. The statistic-based search model was most successful at matching human performance. We conclude that humans use summary statistics to search for complex visual targets. PMID:24627458

  13. Advances in the Kepler Transit Search Engine and Automated Approaches to Identifying Likely Planet Candidates in Transit Surveys

    NASA Astrophysics Data System (ADS)

    Jenkins, Jon Michael

    2015-08-01

    Twenty years ago, no planets were known outside our own solar system. Since then, the discoveries of ~1500 exoplanets have radically altered our views of planets and planetary systems. This revolution is due in no small part to the Kepler Mission, which has discovered >1000 of these planets and >4000 planet candidates. While Kepler has shown that small rocky planets and planetary systems are quite common, the quest to find Earth’s closest cousins and characterize their atmospheres presses forward with missions such as NASA Explorer Program’s Transiting Exoplanet Survey Satellite (TESS) slated for launch in 2017 and ESA’s PLATO mission scheduled for launch in 2024.These future missions pose daunting data processing challenges in terms of the number of stars, the amount of data, and the difficulties in detecting weak signatures of transiting small planets against a roaring background. These complications include instrument noise and systematic effects as well as the intrinsic stellar variability of the subjects under scrutiny. In this paper we review recent developments in the Kepler transit search pipeline improving both the yield and reliability of detected transit signatures.Many of the phenomena in light curves that represent noise can also trigger transit detection algorithms. The Kepler Mission has expended great effort in suppressing false positives from its planetary candidate catalogs. While over 18,000 transit-like signatures can be identified for a search across 4 years of data, most of these signatures are artifacts, not planets. Vetting all such signatures historically takes several months’ effort by many individuals. We describe the application of machine learning approaches for the automated vetting and production of planet candidate catalogs. These algorithms can improve the efficiency of the human vetting effort as well as quantifying the likelihood that each candidate is truly a planet. This information is crucial for obtaining valid planet

  14. Arctic Data Explorer: A Rich Solr Powered Metadata Search Portal

    NASA Astrophysics Data System (ADS)

    Liu, M.; Truslove, I.; Yarmey, L.; Lopez, L.; Reed, S. A.; Brandt, M.

    2013-12-01

    The Advanced Cooperative Arctic Data and Information Service (ACADIS) manages data and is the gateway for all relevant Arctic physical, life, and social science data for the Arctic Sciences (ARC) research community. Arctic Data Explorer (ADE), developed by the National Snow and Ice Data Center (NSIDC) under the ACADIS umbrella, is a data portal that provides users the ability to search across multiple Arctic data catalogs rapidly and precisely. In order to help the users quickly find the data they are interested in, we provided a simple search interface -- a search box with spatial and temporal options. The core of the interface is a ';google-like' single search box with logic to handle complex queries behind the scenes. ACADIS collects all metadata through the GI-Cat metadata broker service and indexes it in Solr. The single search box is implemented as a text based search utilizing the powerful tools provided by Solr. In this poster, we briefly explain Solr's indexing and searching capabilities. Several examples are presented to illustrate the rich search functionality the simple search box supports. Then we dive into the implementation details such as how phrase query, wildcard query, range query, fuzzy query and special query search term handling was integrated into ADE search. To provide our users the most relevant answers to their queries as quickly as possible, we worked with the Advisory Committee and the expanding Arctic User Community (scientists and data experts) to collect feedback to improve the search results and adjust the relevance/ranking logic to return more precise search results. The poster has specific examples on how we tuned the relevance ranking to achieve higher quality search results. A feature in the plan is to provide data sets recommendations based on user's current search history. Both collaborative filtering and content-based approaches were considered and researched. A feasible solution is proposed based on the content-based approach.

  15. Searching for satellites of Ceres

    NASA Astrophysics Data System (ADS)

    Schmidt, B.; Li, J.; McFadden, L.; Mutchler, M.; McLean, B.; Russell, C.

    2014-07-01

    The existence of satellites, or lack thereof, around Ceres is of great interest to the Dawn mission, which is currently en route to Ceres and will arrive in February 2015. The Dawn spacecraft will orbit Ceres at altitudes of 1180 to 6400 km, well within the satellite stability region. The final opportunity for observations of Ceres with HST prior to Dawn's arrival occurred in April 2014, when Ceres will make a close pass at opposition to Earth. In addition to providing additional targets for exciting physical studies by the Dawn instruments, satellites, if there were any, would substantially affect Dawn's orbit planning in order to accommodate observations and ensure spacecraft safety. For example, detection of satellites would allow this program to derive a more accurate measurement of the mass of Ceres, which is important for the mission planners to determine the orbit of the spacecraft. With the observation planning process already underway, early detection of satellites will provide sufficient time to adapt mission plans to be able to observe any satellites on ingress or during the mapping orbits. The timing is particularly important, since the spacecraft now has use of only two reaction wheels, which is already impacting mission design, and which prevents Dawn from conducting its own deep satellite search as was accomplished prior to arrival at Vesta. Because of this, an HST survey is critical for Dawn operations at Ceres. Since satellite detection could require a change to the mission's nominal orbital strategy and present risk from dust associated with any satellites, it is crucial to put Dawn in the best position to succeed. HST observed Ceres using the High Resolution Channel (HRC) of the Advanced Camera for Surveys (ACS) to study the physical properties of Ceres and carried out surface mapping (Parker et al. 2004, Thomas et al. 2005, Li et al. 2006). Several ''long-V'' (F555W filter) exposures were taken using the full field of view of the ACS-HRC to

  16. A search strategy for SETI - The search for extraterrestrial intelligence

    NASA Technical Reports Server (NTRS)

    Billingham, J.; Wolfe, J.; Edelson, R.; Gulkis, S.; Olsen, E.; Oliver, B.; Tarter, J.; Seeger, C.

    1980-01-01

    A search strategy is proposed for the detection of signals of extraterrestrial intelligent origin. It constitutes an exploration of a well defined volume of search space in the microwave region of the spectrum and envisages the use of a combination of sky survey and targeted star approaches. It is predicated on the use of existing antennas equipped with sophisticated multichannel spectrum analyzers and signal processing systems operating in the digital mode. The entire sky would be surveyed between 1 and 10 GHz with resolution bin widths down to 32 Hz. More than 700 nearby solar type stars and other selected interesting directions would be searched between 1 GHz and 3 GHz with bin widths down to 1 Hz. Particular emphasis would be placed on those solar type stars that are within 20 light years of earth.

  17. Web Searching: A Process-Oriented Experimental Study of Three Interactive Search Paradigms.

    ERIC Educational Resources Information Center

    Dennis, Simon; Bruza, Peter; McArthur, Robert

    2002-01-01

    Compares search effectiveness when using query-based Internet search via the Google search engine, directory-based search via Yahoo, and phrase-based query reformulation-assisted search via the Hyperindex browser by means of a controlled, user-based experimental study of undergraduates at the University of Queensland. Discusses cognitive load,…

  18. Social Search: A Taxonomy of, and a User-Centred Approach to, Social Web Search

    ERIC Educational Resources Information Center

    McDonnell, Michael; Shiri, Ali

    2011-01-01

    Purpose: The purpose of this paper is to introduce the notion of social search as a new concept, drawing upon the patterns of web search behaviour. It aims to: define social search; present a taxonomy of social search; and propose a user-centred social search method. Design/methodology/approach: A mixed method approach was adopted to investigate…

  19. Cover times of random searches

    NASA Astrophysics Data System (ADS)

    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.

  20. Distributed game-tree searching

    SciTech Connect

    Schaeffer, J. )

    1989-02-01

    Conventional parallelizations of the alpha-beta ({alpha}{beta}) algorithm have met with limited success. Implementations suffer primarily from the synchronization and search overheads of parallelization. This paper describes a parallel {alpha}{beta} searching program that achieves high performance through the use of four different types of processes: Controllers, Searchers, Table Managers, and Scouts. Synchronization is reduced by having Controller process reassigning idle processes to help out busy ones. Search overhead is reduced by having two types of parallel table management: global Table Managers and the periodic merging and redistribution of local tables. Experiments show that nine processors can achieve 5.67-fold speedups but beyond that, additional processors provide diminishing returns. Given that additional resources are of little benefit, speculative computing is introduced as a means of extending the effective number of processors that can be utilized. Scout processes speculatively search ahead in the tree looking for interesting features and communicate this information back to the {alpha}{beta} program. In this way, the effective search depth is extended. These ideas have been tested experimentally and empirically as part of the chess program ParaPhoenix.

  1. H particle searches at Brookhaven

    SciTech Connect

    Chrien, R.E.

    1997-09-01

    Following the suggestion by R.L. Jaffe twenty years ago, researchers have been trying to establish the existence of a six-quark object, termed the H dibaryon, predicted by the phenomenological quark bag model. This object quickly became the focus of experimental searches at several locations, including the AGS. This search still continues, with perhaps the most active program being carried out at the 2.0 GeV/c beam line at the BNL-AGS. The research was considerably enhanced by the writing of two notable papers at BNL by Aerts and Dover, which gave quantitative predictions for H-production cross sections in two very different reaction mechanisms. One of these, the formation of cascade atomic deuterium to form the H by fusion, had been first suggested by P.D. Barnes. The 2.0 GeV/c line at the AGS was specifically designed to provide an adequate kaon flux for double strangeness and charge exchange reactions. It has been used for two H searches, E813 and E836, as well as for several {Lambda}{Lambda} searches, E885 and E906. These four experiments are setting significant limits on H-production. The results of these experiments are discussed, and descriptions of related H searches at Brookhaven are given.

  2. New particle searches at CDF

    SciTech Connect

    Nodulman, L.J.

    1995-09-01

    One of the fundamental roles of a general purpose detector exploring, by means of increasing luminosity, higher and higher mass reach, is to search for new particles and exotic phenomena. This is a continuing effort for the CDF collaboration, and will report on several searches using about 20 pb{sup -1} from the 1992/93 run labelled {open_quotes}run 1a{close_quotes} and {approximately}50 of the 90 pb{sup -1} so far from the current {open_quotes}run 1b.{close_quotes} These are mostly preliminary analyses, typically using a total of 70 pb{sup -1}. Our limits on SUSY using missing E{sub T} with jets as well as three leptons are discussed elsewhere; results from the D0 collaboration are similar. I will discuss searches for additional vector bosons Z{prime} and W{prime}, second generation scalar leptoquarks, as well as a broad search for objects decaying into jet pairs, including b-tagged jet pairs. I will also describe two events which do not fit in comfortably with either the standard model or a phenomenologically motivated search.

  3. Limits of search filter development*

    PubMed Central

    Wilczynski, Nancy L.; Lokker, Cynthia; McKibbon, Kathleen Ann; Hobson, Nicholas

    2016-01-01

    Objective The research attempted to develop search filters for biomedical literature databases that improve retrieval of studies of clinical relevance for the nursing and rehabilitation professions. Methods Diagnostic testing framework compared machine-culled and practitioner-nominated search terms with a hand-tagged clinical literature database. Results We were unable to: (1) develop filters for nursing, likely because of the overlapping and expanding scope of practice for nurses in comparison with medical professionals, or (2) develop filters for rehabilitation, because of its broad scope and the profession's multifaceted understanding of “health and ability.” Conclusions We found limitations on search filter development for these health professions: nursing and rehabilitation. PMID:26807051

  4. Evaluation Framework for Search Instruments

    SciTech Connect

    Warren, Glen A.; Smith, Leon E.; Cooper, Matthew W.; Kaye, William R.

    2005-10-23

    A framework for quantitatively evaluating current and proposed gamma-ray search instrument designs has been developed. The framework is designed to generate a large library of “virtual neighborhoods” that can be used to test and evaluate nearly any gamma-ray sensor type. Calculating nuisance-source emissions and combining various sources to create a large number of random virtual scenes places a significant computational burden on the development of the framework. To reduce this burden, a number of radiation transport simplifications have been made which maintain the essential physics ingredients for the quantitative assessment of search instruments while significantly reducing computational times. The various components of the framework, from the simulation and benchmarking of nuisance source emissions to the computational engine for generating the gigabytes of simulated search scenes, are discussed.

  5. SUSY Searches at the Tevatron

    SciTech Connect

    Gris, Philippe; CDF, for the; collaborations, D0

    2011-06-01

    The results of search for Supersymmetry performed at the Tevatron Collider by the CDF and D0 collaborations are summarized in this paper. No significant deviations with respect to the Standard Model expectations were observed and constraints were set on supersymmetric parameters. Supersymmetry (SUSY), a space-time symmetry that predicts for every Standard Model (SM) particle the existence of a superpartner that differs by half a unit of spin, may provide a solution to the hierarchy problem if SUSY particles have masses lower than 1 TeV, strongly motivating the search for such particles at the Fermilab Tevatron Collider. If there is supersymmetry in nature, it must be broken and the theorized breaking mechanisms lead to many models (supergravity, gauge mediated, anomaly mediated, ...) with possibly different phenomenologies. Searches performed by the CDF and D0 experiments aim at probing the extensive SUSY parameter space in terms of mass and final state.

  6. High-speed data search

    NASA Technical Reports Server (NTRS)

    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.

  7. Visual Search of Mooney Faces

    PubMed Central

    Goold, Jessica E.; Meng, Ming

    2016-01-01

    Faces spontaneously capture attention. However, which special attributes of a face underlie this effect is unclear. To address this question, we investigate how gist information, specific visual properties and differing amounts of experience with faces affect the time required to detect a face. Three visual search experiments were conducted investigating the rapidness of human observers to detect Mooney face images. Mooney images are two-toned, ambiguous images. They were used in order to have stimuli that maintain gist information but limit low-level image properties. Results from the experiments show: (1) Although upright Mooney faces were searched inefficiently, they were detected more rapidly than inverted Mooney face targets, demonstrating the important role of gist information in guiding attention toward a face. (2) Several specific Mooney face identities were searched efficiently while others were not, suggesting the involvement of specific visual properties in face detection. (3) By providing participants with unambiguous gray-scale versions of the Mooney face targets prior to the visual search task, the targets were detected significantly more efficiently, suggesting that prior experience with Mooney faces improves the ability to extract gist information for rapid face detection. However, a week of training with Mooney face categorization did not lead to even more efficient visual search of Mooney face targets. In summary, these results reveal that specific local image properties cannot account for how faces capture attention. On the other hand, gist information alone cannot account for how faces capture attention either. Prior experience facilitates the effect of gist on visual search of faces; making faces a special object category for guiding attention. PMID:26903941

  8. The Sweet Spot of a Nonacademic Job Search

    ERIC Educational Resources Information Center

    Lord, Alexandra M.

    2012-01-01

    Because academic culture frowns on Ph.D.'s who consider leaving the ivory tower, most of those who jump ship find themselves at a loss as to where and how to begin a job search. Yet a nonacademic job search is actually quite similar to a standard research project. Both require advance planning, substantial research, collating evidence for an…

  9. On the Use of Librarians Selection Routines in Web Search.

    ERIC Educational Resources Information Center

    Tsinakos, Avgoustos A.; Margaritis, Kostantinos G.

    Information retrieval on the World Wide Web has a major obstacle: although data is abundant, it is unlabeled and randomly indexed. This paper discusses the implementation of a consultative Web search engine that minimizes the expertise level that is required from a user to accomplish an advanced search session. The system takes advantage of the…

  10. Dark matter search with PICASSO

    NASA Astrophysics Data System (ADS)

    Zacek, V.; Archambault, S.; Behnke, E.; Behnke, J.; Das, M.; Davour, A.; Debris, F.; Dhungana, N.; Farine, J.; Gagnebin, S.; Hinnefeld, H.; Jackson, C. M.; Kamaha, A.; Krauss, C.; Lafrenière, M.; Laurin, M.; Lawson, I.; Lévy, C.; Lessard, L.; Levine, I.; Marlisov, D.; Martin, J.-P.; Kumaratunga, S.; MacDonald, R.; Mitra, P.; Nadeau, P.; Noble, A.; Piro, M.-C.; Plante, A.; Podviyaniuk, R.; Pospisil, S.; Seth, S.; Scallon, O.; Starinski, N.; Stekl, I.; Vander Werf, N.; Wichoski, U.; Xie, T.

    2012-07-01

    PICASSO at SNOLAB searches primarily for spin-dependent WIMP interactions on 19F using the superheated droplet technique. This technique is based on the bubble chamber principle, where phase transitions in superheated liquid droplets can be triggered by WIMP induced nuclear recoils. The physics of the detection process allows a highly efficient suppression of backgrounds from cosmic muons, γ- and β-rays. We will discuss qualitatively recent progress in PICASSO and its sensitivity reach for spin-dependent and spin-independent WIMP searches.

  11. Global searches at the Tevatron

    SciTech Connect

    Renkel, Peter; /Southern Methodist U.

    2009-01-01

    We present a review of global searches at the Tevatron with D0 and CDF detectors. The strategy involves splitting the data from the Tevatron into many final states and looking for signs of new physics in the high p{sub T} tails of various distributions using SLEUTH algorithm. CDF also utilizes Bump Hunter to search for narrow resonances in mass distributions. We analyzed 180 D0 final states, 9335 D0 distributions; 399 CDF final states and 19650 CDF distributions. No evidence of new physics is found.

  12. Genetic Algorithms and Local Search

    NASA Technical Reports Server (NTRS)

    Whitley, Darrell

    1996-01-01

    The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

  13. Searching Circuit For A Servoloop

    NASA Technical Reports Server (NTRS)

    Sigman, E. H.

    1988-01-01

    Feedback error voltage forced into range of stability. Circuit connected in series with error-voltage line of feedback loop. When loop operates normally in stable region, searching circuit does not disturb operation, and error-voltage output of loop filter is control voltage. When servo unlocks and error-voltage output of loop filter wanders into unstable range, searching circuit forces control voltage to sweep through stable region repeatedly until lock recovered. Consists of two halves identical except polarities of some parts in each half opposite of corresponding parts in other half.

  14. Space searches with a quantum robot

    SciTech Connect

    Benioff, P.

    2000-02-15

    Quantum robots are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases. A task example is considered in which a quantum robot searches a space region to find the location of a system. The possibility that the search can be more efficient than a classical search is examined by considering use of Grover's Algorithm to process the search results. This is problematic for two reasons. One is the removal of entanglements generated by the (reversible) search process. The other is that (ignoring the entanglement problem), the search process in 2 dimensional space regions is no more efficient than a classical search. However quantum searches of higher dimensional space regions are more efficient than classical searches. Reasons why quantum robots are interesting independent of these results are briefly summarized.

  15. Searches for the standard model Higgs at the Tevatron

    SciTech Connect

    Kilminster, Ben; /Ohio State U.

    2007-05-01

    The CDF and D0 experiments at the Tevatron are currently the only capable of searching for the Standard Model Higgs boson. This article describes their most sensitive searches in the expected Higgs mass range, focusing on advanced methods used to extract the maximal sensitivity from the data. CDF presents newly updated results for H {yields} W{sup +}W{sup -} and Zh {yields} l{sup +}l{sup -}b{bar b}. D0 presents two new searches for WH {yields} lvb{bar b}. These new analyses use the same 1 fb{sup -1} dataset as previous searches, but with improved techniques resulting in markedly improved sensitivity.

  16. Search Pathways: Modeling GeoData Search Behavior to Support Usable Application Development

    NASA Astrophysics Data System (ADS)

    Yarmey, L.; Rosati, A.; Tressel, S.

    2014-12-01

    Recent technical advances have enabled development of new scientific data discovery systems. Metadata brokering, linked data, and other mechanisms allow users to discover scientific data of interes across growing volumes of heterogeneous content. Matching this complex content with existing discovery technologies, people looking for scientific data are presented with an ever-growing array of features to sort, filter, subset, and scan through search returns to help them find what they are looking for. This paper examines the applicability of available technologies in connecting searchers with the data of interest. What metrics can be used to track success given shifting baselines of content and technology? How well do existing technologies map to steps in user search patterns? Taking a user-driven development approach, the team behind the Arctic Data Explorer interdisciplinary data discovery application invested heavily in usability testing and user search behavior analysis. Building on earlier library community search behavior work, models were developed to better define the diverse set of thought processes and steps users took to find data of interest, here called 'search pathways'. This research builds a deeper understanding of the user community that seeks to reuse scientific data. This approach ensures that development decisions are driven by clearly articulated user needs instead of ad hoc technology trends. Initial results from this research will be presented along with lessons learned for other discovery platform development and future directions for informatics research into search pathways.

  17. Exploring Gendered Notions: Gender, Job Hunting and Web Searches

    NASA Astrophysics Data System (ADS)

    Martey, R. M.

    Based on analysis of a series of interviews, this chapter suggests that in looking for jobs online, women confront gendered notions of the Internet as well as gendered notions of the jobs themselves. It argues that the social and cultural contexts of both the search tools and the search tasks should be considered in exploring how Web-based technologies serve women in a job search. For these women, the opportunities and limitations of online job-search tools were intimately related to their personal and social needs, especially needs for part-time work, maternity benefits, and career advancement. Although job-seeking services such as Monster.com were used frequently by most of these women, search services did not completely fulfill all their informational needs, and became an — often frustrating — initial starting point for a job search rather than an end-point.

  18. Interfacial Molecular Searching Using Forager Dynamics

    NASA Astrophysics Data System (ADS)

    Monserud, Jon H.; Schwartz, Daniel K.

    2016-03-01

    Many biological and technological systems employ efficient non-Brownian intermittent search strategies where localized searches alternate with long flights. Coincidentally, molecular species exhibit intermittent behavior at the solid-liquid interface, where periods of slow motion are punctuated by fast flights through the liquid phase. Single-molecule tracking was used here to observe the interfacial search process of DNA for complementary DNA. Measured search times were qualitatively consistent with an intermittent-flight model, and ˜10 times faster than equivalent Brownian searches, suggesting that molecular searches for reactive sites benefit from similar efficiencies as biological organisms.

  19. Preschoolers Search for Hidden Objects

    ERIC Educational Resources Information Center

    Haddad, Jeffrey M.; Chen, Yuping; Keen, Rachel

    2011-01-01

    The issue of whether young children use spatio-temporal information (e.g., movement of objects through time and space) and/or contact-mechanical information (e.g., interaction between objects) to search for a hidden object was investigated. To determine whether one cue can have priority over the other, a dynamic event that put these cues into…

  20. The Academic Job Search Handbook.

    ERIC Educational Resources Information Center

    Heiberger, Mary Morris; Vick, Julia Miller

    This book is designed for new doctorates and junior faculty as a complete guide to the academic job search process. The volume opens with an overview of academic careers and institutional structures with pointers and information on how institutions may view and conduct hiring. It then proceeds step-by-step through the application process beginning…

  1. Job Search Workbook. Tutor Manual.

    ERIC Educational Resources Information Center

    Spence, Mary Catherine

    This manual is intended to assist tutors participating in a program to help nonreaders develop job search skills. The first two sections give an overview of the program and present general guidelines for working with students. Detailed suggestions are provided for working with students in sessions addressing the following questions: Am I ready to…

  2. Educational Talent Search. Annual Report.

    ERIC Educational Resources Information Center

    1968

    The document presents a view of the program, "Educational Talent Search," operating in 20 counties in northwest Mississippi and in Wilcox County, Alabama. A description of the poverty conditions found to exist in these counties serves as a foundation for the remainder of the report. Talent scout training, talent scout efforts, and student field…

  3. Searches for Fractionally Charged Particles

    SciTech Connect

    Perl, Martin L.; Lee, Eric R.; Loomba, Dinesh; /New Mexico U.

    2012-04-12

    Since the initial measurements of the electron charge were made a century ago, experimenters have faced the persistent question of the existence of elementary particles with charges that are fractional multiples of the electron charge. In this review, we discuss the results of recent searches for these fractionally charged particles.

  4. In Search of Serious Play

    ERIC Educational Resources Information Center

    Wallace, David

    2005-01-01

    All teaching artists have taken unexpected detours that lead to miracles. They have all created magical experiences in which people are too engaged to notice the incredible amount they are learning. As a TA, one searches for "serious play"--purposeful fun that stimulates exhilarating work and genuine learning. But how does it happen? How do TAs…

  5. The Search for Heavy Elements

    ScienceCinema

    None

    2010-01-08

    The 1994 documentary "The Search for Heavy Elements" chronicles the expansion of the periodic table through the creation at Berkeley Lab of elements heavier than uranium. The documentary features a mix of rarely-seen archival footage, historical photos, and interviews with scientists who made history, such as Glenn Seaborg and Albert Ghiorso.

  6. Single photon searches at PEP

    SciTech Connect

    Hollebeek, R.

    1985-12-01

    The MAC and ASP searches for events with a single photon and no other observed particles are reviewed. New results on the number of neutrino generations and limits on selection, photino, squark and gluino masses from the ASP experiment are presented.

  7. The Search for Extraterrestrial Intelligence

    NASA Technical Reports Server (NTRS)

    Tucher, A.

    1985-01-01

    The development of NASA's SETI project and strategies for searching radio signals are reviewed. A computer program was written in FORTRAN to set up data from observations taken at Jodrell Bank. These data are to be used with a larger program to find the average radio signal strength at each of the approximately 63,000 channels.

  8. Information Search Services for Educators.

    ERIC Educational Resources Information Center

    Adams, Sharon; And Others

    Based on information provided primarily by two existing state-based information services, this handbook presents a clear, practical look at possible activities, procedures, and requirements of search services for educators. Descriptions of the two services that serve as models--Oklahoma's Sooner Exchange for Educational Knowledge (SEEK) and Texas'…

  9. The Day Search Stood Still

    ERIC Educational Resources Information Center

    Sexton, Will

    2010-01-01

    That little rectangle with a button next to it? (Those things called search boxes but might just as well be called "resource drains.") Imagine it disappearing from a library's webpages. The intricate works behind these design elements make up a major portion of what library staff spends time and money developing, populating, supporting, refining,…

  10. Astronomical searches for nitrogen heterocycles

    NASA Astrophysics Data System (ADS)

    Charnley, Steven B.; Kuan, Yi-Jehng; Huang, Hui-Chun; Botta, Oliver; Butner, Harold M.; Cox, Nick; Despois, Didier; Ehrenfreund, Pascale; Kisiel, Zbigniew; Lee, Ying-Ying; Markwick, Andrew J.; Peeters, Zan; Rodgers, Steven D.

    We have conducted extensive astronomical searches for the N-bearing ring molecules pyridine, quinoline and isoquinoline towards the circumstellar envelopes of carbon-rich stars, and for interstellar pyrimidine in hot molecular cores. Here we report the derived upper limits on the column densities of these molecules, and summarize the current status of these observations.

  11. The Search for Extraterrestrial Intelligence.

    ERIC Educational Resources Information Center

    Jones, Barrie W.

    2003-01-01

    Traces the efforts of Searching for Extraterrestrial Technological Intelligence (SETI) since 1960 when a radio-telescope was used to see if any messages were being sent from the vicinity of two nearby stars. Describes attempts to detect microwave/optical signals and technological modification of the cosmic environment. (Author/KHR)

  12. Reinforcement Learning in Information Searching

    ERIC Educational Resources Information Center

    Cen, Yonghua; Gan, Liren; Bai, Chen

    2013-01-01

    Introduction: The study seeks to answer two questions: How do university students learn to use correct strategies to conduct scholarly information searches without instructions? and, What are the differences in learning mechanisms between users at different cognitive levels? Method: Two groups of users, thirteen first year undergraduate students…

  13. Willow: a uniform search interface.

    PubMed Central

    Ketchell, D S; Freedman, M M; Jordan, W E; Lightfoot, E M; Heyano, S; Libbey, P A

    1996-01-01

    The objective of the Willow Project is to develop a uniform search interface that allows a diverse community of users to retrieve information from heterogeneous network-based information resources. Willow separates the user interface from the database management or information retrieval system. It provides a graphic user interface to a variety of information resources residing on diverse hosts, and using different search engines and idiomatic query languages through networked-based client-server and Transmission Control Protocol/Internet Protocol (TCP/IP) protocols. It is based on a "database driver'' model, which allows new database hosts to be added without altering Willow itself. Willow employs a multimedia extension mechanism to launch external viewers to handle data in almost any form. Drivers are currently available for a local BRS/SEARCH system and the Z39.50 protocol. Students, faculty, clinicians, and researchers at the University of Washington are currently offered 30 local and remote databases via Willow. They conduct more than 250,000 sessions a month in libraries, medical centers and clinics, laboratories, and offices, and from home. The Massachusetts Institute of Technology is implementing Willow as its uniform search interface to Z39.50 hosts. PMID:8750388

  14. Turning Search into Knowledge Management.

    ERIC Educational Resources Information Center

    Kaufman, David

    2002-01-01

    Discussion of knowledge management for electronic data focuses on creating a high quality similarity ranking algorithm. Topics include similarity ranking and unstructured data management; searching, categorization, and summarization of documents; query evaluation; considering sentences in addition to keywords; and vector models. (LRW)

  15. Searching for the Right Answer.

    ERIC Educational Resources Information Center

    Dowling-Sendor, Benjamin

    2003-01-01

    A decision by the 8th U.S. Circuit Court of Appeals in a case from Minnesota illustrates the difficulties schools face in deciding when and how to search a student for possible weapons or drugs. Case shows courts tend to give school officials a measure of flexibility when applying the law. Advises board members and administrators to consult with…

  16. Career Search: A Personal Pursuit.

    ERIC Educational Resources Information Center

    Chapman, Elwood N.

    A sequential 20-step system of career exploration is described in this book. Designed as a basic and complete text for career guidance courses, it may also be used on a do-it-yourself or independent basis. Objectives of the book are to (1) simplify the career search process by providing an effective step-by-step system, (2) individualize the…

  17. Multi-Attribute Sequential Search

    ERIC Educational Resources Information Center

    Bearden, J. Neil; Connolly, Terry

    2007-01-01

    This article describes empirical and theoretical results from two multi-attribute sequential search tasks. In both tasks, the DM sequentially encounters options described by two attributes and must pay to learn the values of the attributes. In the "continuous" version of the task the DM learns the precise numerical value of an attribute when she…

  18. The Search for Heavy Elements

    SciTech Connect

    2008-04-17

    The 1994 documentary "The Search for Heavy Elements" chronicles the expansion of the periodic table through the creation at Berkeley Lab of elements heavier than uranium. The documentary features a mix of rarely-seen archival footage, historical photos, and interviews with scientists who made history, such as Glenn Seaborg and Albert Ghiorso.

  19. Preview Search and Contextual Cuing

    ERIC Educational Resources Information Center

    Hodsoll, John P.; Humphreys, Glyn W.

    2005-01-01

    We investigated the effect of contextual cuing (M. M. Chun & Y. Jiang, 1998) within the preview paradigm (D. G. Watson & G. W. Humphreys, 1997). Contextual cuing was shown with a 10-item letter search but not with more crowded 20-item displays. However, contextual learning did occur in a preview procedure in which 10 preview items were followed by…

  20. Information Diversity in Web Search

    ERIC Educational Resources Information Center

    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…

  1. Talent Search Selects Student Researchers.

    ERIC Educational Resources Information Center

    Science News, 1988

    1988-01-01

    Reviews the results of the 47th Annual Science Talent Search sponsored by the Westinghouse Electric Corporation and the Westinghouse Foundation. Describes some of the projects done by students. Lists the names and schools of the 16- to 18-year-old winners. (CW)

  2. Substructure Search by Set Reduction

    ERIC Educational Resources Information Center

    Figueras, John

    1972-01-01

    The set reduction algorithm is based on set theory and Boolean algebra rather than the graph-theoretic approach. Time trials with a small file of organic chemical structures indicate that the algorithm can be economically used for substructure (or complete structure) sequential searches on a file containing 30,000-50,000 computer-coded structures.…

  3. Online Searching in PBL Tutorials

    ERIC Educational Resources Information Center

    Jin, Jun; Bridges, Susan M.; Botelho, Michael G.; Chan, Lap Ki

    2015-01-01

    This study aims to explore how online searching plays a role during PBL tutorials in two undergraduate health sciences curricula, Medicine and Dentistry. Utilizing Interactional Ethnography (IE) as an organizing framework for data collection and analysis, and drawing on a critical theory of technology as an explanatory lens, enabled a textured…

  4. Darwin on the Web: The Evolution of Search Tools.

    ERIC Educational Resources Information Center

    Vidmar, Dale J.

    1999-01-01

    Discusses various search strategies and tools that can be used for searching on the Internet, including search engines and search directories; Boolean searching; metasearching; relevancy ranking; automatic phrase detection; backlinks; natural-language searching; clustering and cataloging information; image searching; customization and portals;…

  5. Examining Search Functions of EAD Finding Aids Web Sites

    ERIC Educational Resources Information Center

    Zhou, Xiaomu

    2006-01-01

    This article examined the search functions for all individual EAD Web sites listed on the Library of Congress Web site in 2003. In particular, the type of search engine, search modes, options for searching, search results display, search feedback, and other features of the search systems were studied. The data analysis suggests that there have…

  6. Quantum Search in Hilbert Space

    NASA Technical Reports Server (NTRS)

    Zak, Michail

    2003-01-01

    A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

  7. Searching for Insight

    NASA Astrophysics Data System (ADS)

    Lynden-Bell, Donald

    2010-09-01

    Is space-time only brought into being by its energy content? The jury is still out, but other questions that have been with me for much of my life—giant black holes in galactic nuclei, the formation of the Galaxy, the connection between first-order phase transitions and negative specific heats, the cause of the large-scale flow of galaxies relative to the cosmic microwave background—have all received reasonable answers. I have found great fun in understanding the dynamical mechanisms underlying such phenomena as magnetohydrodynamic jets, relativistic disks, and the bars, spirals, and chemical evolution of galaxies. The great challenges for future astronomers will be the exploration of the 96% of the Universe now believed to be neither atomic nor baryonic but perhaps partially leptonic. However, most advances do not come via frontal attack but from “bread-and-butter” investigations in related areas where observation is possible today!

  8. Status and Future of Deep Searches for Compact Binary Mergers

    NASA Astrophysics Data System (ADS)

    Nitz, Alexander` Harvey; LIGO Scientific Collaboration

    2016-06-01

    Deep offline searches for gravitational waves from binary black hole, binary neutron star, and neutron star- black hole mergers were conducted during the first Advanced LIGO observing run, and recently Advanced LIGO announced the first detection of gravitational waves from a binary black hole merger. We discuss the recent results, the methodology of the high latency searches, along with improvements for the upcoming observing runs.

  9. Before You Conduct a Superintendent Search, Search for a Search Consultant.

    ERIC Educational Resources Information Center

    Rickabaugh, James R.; McCarty, Donald J.

    1987-01-01

    When hiring a search consultant to recruit superintendent candidates, school boards must consider more than reputation and reliability. This article discusses several important considerations, including availability, possible conflicts of interest, and techniques used to construct superintendent profiles, advertise the position, and reduce the…

  10. Multiple Database Searching: Techniques and Pitfalls

    ERIC Educational Resources Information Center

    Hawkins, Donald T.

    1978-01-01

    Problems involved in searching multiple data bases are discussed including indexing differences, overlap among data bases, variant spellings, and elimination of duplicate items from search output. Discussion focuses on CA Condensates, Inspec, and Metadex data bases. (J PF)

  11. Interactive Graphical Queries for Bibliographic Search.

    ERIC Educational Resources Information Center

    Brooks, Martin; Campbell, Jennifer

    1999-01-01

    Presents "Islands," an interactive graphical interface for construction, modification, and management of queries during a search session on a bibliographic database. Discusses motivation and bibliographic search semantics and compares the Islands interface to the Dialog interface. (Author/LRW)

  12. Stochastic search with Poisson and deterministic resetting

    NASA Astrophysics Data System (ADS)

    Bhat, Uttam; De Bacco, Caterina; Redner, S.

    2016-08-01

    We investigate a stochastic search process in one, two, and three dimensions in which N diffusing searchers that all start at x 0 seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate r, or deterministically, with a reset time T. In one dimension and for a small number of searchers, the search time and the search cost are minimized at a non-zero optimal reset rate (or time), while for sufficiently large N, resetting always hinders the search. In general, a single searcher leads to the minimum search cost in one, two, and three dimensions. When the resetting is deterministic, several unexpected feature arise for N searchers, including the search time being independent of T for 1/T\\to 0 and the search cost being independent of N over a suitable range of N. Moreover, deterministic resetting typically leads to a lower search cost than in Poisson resetting.

  13. INTERFEROGRAM-BASED INFRARED SEARCH SYSTEM

    EPA Science Inventory

    A computerized search routine for the identification of infrared spectra using interferometric data exclusively is described. Two forms of instrument-dependent information present in raw interferometric data are removed prior to the search process. Interferometric phase error is ...

  14. Search for New Physics at CDF

    SciTech Connect

    Strologas, John; /New Mexico U.

    2009-06-01

    We present the current status of the search for new physics at CDF, using integrated luminosity up to 3.2 fb{sup -1}. We cover searches for supersymmetry, extra dimensions, new heavy bosons, and generic dilepton resonances.

  15. Search Engines: Gateway to a New ``Panopticon''?

    NASA Astrophysics Data System (ADS)

    Kosta, Eleni; Kalloniatis, Christos; Mitrou, Lilian; Kavakli, Evangelia

    Nowadays, Internet users are depending on various search engines in order to be able to find requested information on the Web. Although most users feel that they are and remain anonymous when they place their search queries, reality proves otherwise. The increasing importance of search engines for the location of the desired information on the Internet usually leads to considerable inroads into the privacy of users. The scope of this paper is to study the main privacy issues with regard to search engines, such as the anonymisation of search logs and their retention period, and to examine the applicability of the European data protection legislation to non-EU search engine providers. Ixquick, a privacy-friendly meta search engine will be presented as an alternative to privacy intrusive existing practices of search engines.

  16. SETI - The microwave search problem and the targeted search approach

    NASA Technical Reports Server (NTRS)

    Seeger, C. L.; Wolfe, J. H.

    1985-01-01

    The targeted search component of the NASA SETI program is limited to time sharing in the usual fashion on existing large radio telescopes. Unless the consequences of this restriction are compensated by increased capability in the SETI electronic systems, an undesirable loss in sensitivity must be accepted in order to prevent a more costly and humanly unattractive lengthening of the projected five-year observing program to a duration of some decades.

  17. Searching for John Goodricke

    NASA Astrophysics Data System (ADS)

    French, Linda M.

    2010-01-01

    John Goodricke (1764-1786) is one of the most intriguing and enigmatic figures in the history of astronomy. Deaf from the age of five, his observations of the light variation of Algol brought him acclaim and the Copley Medal of the Royal Society by the age of nineteen. Together with his neighbor, mentor, and distant relative Edward Pigott, he went on to discover and quantify the light variations of other stars, including Delta Cephei. Goodricke's careful accounts of his observations, and their accuracy, remain a model of clear scientific thinking and reporting. Goodricke's career was short, as was his time on Earth: he died before his 22nd birthday. He left few personal notes or letters, and even many basic circumstances of his life have been misunderstood or misinterpreted. I will discuss Goodricke's apparent change of mind regarding the variations of Algol. I will further describe recent research into his family circumstances and into the allegation advanced by Zdenek Kopal in the 1980s that Goodricke was buried apart from his family because they were ashamed of his deafness.

  18. OncoSearch: cancer gene search engine with literature evidence

    PubMed Central

    Lee, Hee-Jin; Dang, Tien Cuong; Lee, Hyunju; Park, Jong C.

    2014-01-01

    In order to identify genes that are involved in oncogenesis and to understand how such genes affect cancers, abnormal gene expressions in cancers are actively studied. For an efficient access to the results of such studies that are reported in biomedical literature, the relevant information is accumulated via text-mining tools and made available through the Web. However, current Web tools are not yet tailored enough to allow queries that specify how a cancer changes along with the change in gene expression level, which is an important piece of information to understand an involved gene's role in cancer progression or regression. OncoSearch is a Web-based engine that searches Medline abstracts for sentences that mention gene expression changes in cancers, with queries that specify (i) whether a gene expression level is up-regulated or down-regulated, (ii) whether a certain type of cancer progresses or regresses along with such gene expression change and (iii) the expected role of the gene in the cancer. OncoSearch is available through http://oncosearch.biopathway.org. PMID:24813447

  19. Extraterrestrial intelligence? The search is on

    NASA Technical Reports Server (NTRS)

    Coulter, Gary R.

    1991-01-01

    NASA's SETI-Microwave Observing Project, beginning on October 12, 1992, will search the closest solar-type stars for radio signals from extraterrestrial civilizations. When completed in the year 2000, the NASA search will have surpassed the search volume of all prior searches by a factor of 10 exp 10. The world's largest radio telescopes will be employed, in conjunction with the NASA Deep Space Network communications antennas. The program will be led by NASA-Ames, with substantial contribution by JPL.

  20. Visual Search for Faces with Emotional Expressions

    ERIC Educational Resources Information Center

    Frischen, Alexandra; Eastwood, John D.; Smilek, Daniel

    2008-01-01

    The goal of this review is to critically examine contradictory findings in the study of visual search for emotionally expressive faces. Several key issues are addressed: Can emotional faces be processed preattentively and guide attention? What properties of these faces influence search efficiency? Is search moderated by the emotional state of the…

  1. Cumulative Intertrial Inhibition in Repeated Visual Search

    ERIC Educational Resources Information Center

    Takeda, Yuji

    2007-01-01

    In the present study the author examined visual search when the items remain visible across trials but the location of the target varies. Reaction times for inefficient search cumulatively increased with increasing numbers of repeated search trials, suggesting that inhibition for distractors carried over successive trials. This intertrial…

  2. Using Search Engines with ESL Students.

    ERIC Educational Resources Information Center

    Kantor, Joan Schneider

    1998-01-01

    Presents a lesson that introduces search engines to high intermediate-level English-as-a-Second-Language students in grades 6-12. Over several days, students learn how to use three search engines (infoseek, AltaVista, and Yahoo!) to search the Internet for information effectively. Students can work together online to create a customized list of…

  3. Search Engines for Tomorrow's Scholars, Part Two

    ERIC Educational Resources Information Center

    Fagan, Jody Condit

    2012-01-01

    This two-part article considers how well some of today's search tools support scholars' work. The first part of the article reviewed Google Scholar and Microsoft Academic Search using a modified version of Carole L. Palmer, Lauren C. Teffeau, and Carrier M. Pirmann's framework (2009). Microsoft Academic Search is a strong contender when…

  4. The Fourth Alternative: Leisure Search and Planning.

    ERIC Educational Resources Information Center

    Liptak, John J.

    1991-01-01

    Identifies three traditional methods of assisting unemployed in job search process (placement or job development, job banks, and teaching people how to find jobs) and suggests leisure search and planning as fourth job search alternative. Sees leisure interests as relatively untapped resources that unemployed might use to find employment or develop…

  5. Online Searching and the University Researchers.

    ERIC Educational Resources Information Center

    Horner, Jan; Thirlwall, David

    1988-01-01

    Describes a survey that compared search behaviors of humanities and social sciences researchers to those of researchers in science and technology. The factors discussed include frequency of use of online databases; personal searches versus intermediaries; and attitudes toward, interest in, knowledge about, and access to online database searching.…

  6. STAIRS Search Strategy: Ideas and Opinions.

    ERIC Educational Resources Information Center

    Quinn, Karen Takle

    1980-01-01

    Concentrates on the practical, everyday aspects of online search strategy, specifically offering ideas and comments on search strategies for STAIRS users. Included are tables listing the logical operators available on the system and the search level (document, paragraph, sentence, word) of each. (Author/JD)

  7. Student Searches & the Law. NSSC Research Paper.

    ERIC Educational Resources Information Center

    Stephens, Ronald D., Ed.

    The increased presence of drugs and weapons in schools has forced school officials to step up searches of students, lockers, and school property. The landmark case of "New Jersey vs. TLO" set standards concerning reasonable suspicion and reasonable searches. School officials must be familiar with recent court opinions on student searches, use good…

  8. The Serial Process in Visual Search

    ERIC Educational Resources Information Center

    Gilden, David L.; Thornton, Thomas L.; Marusich, Laura R.

    2010-01-01

    The conditions for serial search are described. A multiple target search methodology (Thornton & Gilden, 2007) is used to home in on the simplest target/distractor contrast that effectively mandates a serial scheduling of attentional resources. It is found that serial search is required when (a) targets and distractors are mirror twins, and (b)…

  9. Presidential Search: An Overview for Board Members

    ERIC Educational Resources Information Center

    Association of Governing Boards of Universities and Colleges, 2012

    2012-01-01

    The selection of a president is a governing board's most important responsibility, and the search process is the board's best opportunity to help guide its institution into a successful new era. This guide outlines the leadership roles during a search (those of the board, the board chair, the search committee, and others), briefs board…

  10. Library Instruction and Online Database Searching.

    ERIC Educational Resources Information Center

    Mercado, Heidi

    1999-01-01

    Reviews changes in online database searching in academic libraries. Topics include librarians conducting all searches; the advent of end-user searching and the need for user instruction; compact disk technology; online public catalogs; the Internet; full text databases; electronic information literacy; user education and the remote library user;…

  11. The Weaknesses of Full-Text Searching

    ERIC Educational Resources Information Center

    Beall, Jeffrey

    2008-01-01

    This paper provides a theoretical critique of the deficiencies of full-text searching in academic library databases. Because full-text searching relies on matching words in a search query with words in online resources, it is an inefficient method of finding information in a database. This matching fails to retrieve synonyms, and it also retrieves…

  12. Playing the Numbers: Searching for Help

    ERIC Educational Resources Information Center

    Doyle, William R.

    2012-01-01

    Internet search histories reveal much about the collective concerns and interests of the population. Researchers have demonstrated that searches for terms such as "flu symptoms" predict the onset and prevalence of flu in given geographical areas. Can such an analysis be applied fruitfully to data on searches related to higher education issues? One…

  13. Precision and Recall in Title Keyword Searches.

    ERIC Educational Resources Information Center

    McJunkin, Monica Cahill

    This study examines precision and recall for title and keyword searches performed in the "FirstSearch" WorldCat database when keywords are used with and without adjacency of terms specified. A random sample of 68 titles in economics were searched in the OCLC (Online Computer Library Center) Online Union Catalog in order to obtain their Library of…

  14. 7 CFR 1.10 - Search services.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 1 2010-01-01 2010-01-01 false Search services. 1.10 Section 1.10 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.10 Search services. Search services are services of agency personnel—clerical or professional—used in trying to find...

  15. 7 CFR 1.10 - Search services.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 1 2013-01-01 2013-01-01 false Search services. 1.10 Section 1.10 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.10 Search services. Search services are services of agency personnel—clerical or professional—used in trying to find...

  16. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 25 Indians 1 2010-04-01 2010-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  17. 7 CFR 1.10 - Search services.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 1 2012-01-01 2012-01-01 false Search services. 1.10 Section 1.10 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.10 Search services. Search services are services of agency personnel—clerical or professional—used in trying to find...

  18. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 25 Indians 1 2012-04-01 2011-04-01 true Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  19. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 25 Indians 1 2011-04-01 2011-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  20. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 25 Indians 1 2014-04-01 2014-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  1. 7 CFR 1.10 - Search services.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 1 2014-01-01 2014-01-01 false Search services. 1.10 Section 1.10 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.10 Search services. Search services are services of agency personnel—clerical or professional—used in trying to find...

  2. 25 CFR 11.305 - Search warrants.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 25 Indians 1 2013-04-01 2013-04-01 false Search warrants. 11.305 Section 11.305 Indians BUREAU OF... Criminal Procedure § 11.305 Search warrants. (a) Each magistrate of a Court of Indian Offenses shall have the authority to issue a warrant for the search of premises and for the seizure of physical...

  3. 7 CFR 1.10 - Search services.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 1 2011-01-01 2011-01-01 false Search services. 1.10 Section 1.10 Agriculture Office of the Secretary of Agriculture ADMINISTRATIVE REGULATIONS Official Records § 1.10 Search services. Search services are services of agency personnel—clerical or professional—used in trying to find...

  4. Semantic search integration to climate data

    SciTech Connect

    Devarakonda, Ranjeet; Palanisamy, Giri; Pouchard, Line Catherine; Shrestha, Biva

    2014-01-01

    In this paper we present how research projects at Oak Ridge National Laboratory are using Semantic Search capabilities to help scientists perform their research. We will discuss how the Mercury metadata search system, with the help of the semantic search capability, is being used to find, retrieve, and link climate change data. DOI: 10.1109/CTS.2014.6867639

  5. Irrational Expectations in the Job Search Process.

    ERIC Educational Resources Information Center

    Liptak, John J.

    1989-01-01

    Discusses expectations held by client beginning a job search. Describes Ellis's Rational-Emotive Therapy, designed to teach clients to think rationally prior to the job search. Assesses various irrational beliefs surrounding the job search. Concludes that clients can be taught to combat irrational expectations. (Author/BHK)

  6. Job Search: A Review of the Literature.

    ERIC Educational Resources Information Center

    Mangum, Stephen L.

    This review focuses on what the literature can tell about the appropriate content and conduct of a job search training program. The chapters correspond to the four bodies of literature concerning job searches that were reviewed. The chapter on the theoretical literature of the scholarly journals examines the basic model of job search, trade-off…

  7. Searching Chemical Abstracts Online in Undergraduate Chemistry.

    ERIC Educational Resources Information Center

    Krumpolc, Miroslav; And Others

    1987-01-01

    Discusses the advantages of conducting online computer searches of "Chemical Abstracts." Introduces the logical sequences involved in searching an online database. Explains Boolean logic, proximity operators, truncation, searchable fields, and command language, as they relate to the use of online searches in undergraduate chemistry programs. (TW)

  8. Multilingual Federated Searching Across Heterogeneous Collections.

    ERIC Educational Resources Information Center

    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)

  9. Self-Directed Job Search: An Introduction.

    ERIC Educational Resources Information Center

    Employment and Training Administration (DOL), Washington, DC.

    This document provides an introduction to a job search training activity--self-directed job search--which can be implemented by Private Industry Councils (PICs) or Comprehensive Employment and Training Act (CETA) Prime Sponsors. The first section introduces self-directed job search for the economically disadvantaged. The next section describes…

  10. Access to Periodicals: Search Key versus Keyword.

    ERIC Educational Resources Information Center

    Golden, Susan U.; Golden, Gary A.

    1983-01-01

    Retrievability of titles of 152 periodicals were compared in a fixed-length algorithmic search (Library Computer System) and a keyword search (Washington Library Network) to determine which type of search algorithm is more successful with titles of varying lengths. Three references and a list of English language stopwords are appended. (EJS)

  11. Multitasking Information Seeking and Searching Processes.

    ERIC Educational Resources Information Center

    Spink, Amanda; Ozmutlu, H. Cenk; Ozmutlu, Seda

    2002-01-01

    Presents findings from four studies of the prevalence of multitasking information seeking and searching by Web (via the Excite search engine), information retrieval system (mediated online database searching), and academic library users. Highlights include human information coordinating behavior (HICB); and implications for models of information…

  12. Online Search Patterns: NLM CATLINE Database.

    ERIC Educational Resources Information Center

    Tolle, John E.; Hah, Sehchang

    1985-01-01

    Presents analysis of online search patterns within user searching sessions of National Library of Medicine ELHILL system and examines user search patterns on the CATLINE database. Data previously analyzed on MEDLINE database for same period is used to compare the performance parameters of different databases within the same information system.…

  13. How To Do Field Searching in Web Search Engines: A Field Trip.

    ERIC Educational Resources Information Center

    Hock, Ran

    1998-01-01

    Describes the field search capabilities of selected Web search engines (AltaVista, HotBot, Infoseek, Lycos, Yahoo!) and includes a chart outlining what fields (date, title, URL, images, audio, video, links, page depth) are searchable, where to go on the page to search them, the syntax required (if any), and how field search queries are entered.…

  14. Your Job Search Organiser. The Essential Guide for a Successful Job Search.

    ERIC Educational Resources Information Center

    Stevens, Paul

    This publication organizes job searches in Australia by creating a paperwork system and recording essential information. It is organized into two parts: career planning and job search management. Part 1 contains the following sections: job evaluation, goal setting, job search obstacles--personal constraints and job search obstacles; and job search…

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

    ERIC Educational Resources Information Center

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

    2016-01-01

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

  16. Paragraph Qualification: A Search Approach with BRS/Search System Features.

    ERIC Educational Resources Information Center

    Atkinson, Steven D.

    1983-01-01

    Discusses paragraph qualification, a search strategy used to retrieve information from computerized databases. Positive and negative paragraph qualification, after-the-fact qualification, multifile searching, and free text searching are described, using examples from the Bibliographic Retrieval Services (BRS)/Search System. (EJS)

  17. Invisible collinear structures impair search.

    PubMed

    Chow, Hiu Mei; Tseng, Chia-huei

    2015-01-01

    Visual attention and perceptual grouping both help us from being overloaded by the vast amount of information, and attentional search is delayed when a target overlaps with a snake-like collinear distractor (Jingling & Tseng, 2013). We assessed whether awareness of the collinear distractor is required for this modulation. We first identified that visible long (=9 elements), but not short (=3 elements) collinear distractor slowed observers' detection of an overlapping target. Then we masked part of a long distractor (=9 elements) with continuous flashing color patches (=6 elements) so that the combined dichoptic percept to observers' awareness was a short collinear distractor (=3 elements). We found that the invisible collinear parts, like visible ones, can form a continuous contour to impair search, suggesting that conscious awareness is not a pre-requisite for contour integration and its interaction with selective attention. PMID:25460240

  18. Characteristic sounds facilitate visual search.

    PubMed

    Iordanescu, Lucica; Guzman-Martinez, Emmanuel; Grabowecky, Marcia; Suzuki, Satoru

    2008-06-01

    In a natural environment, objects that we look for often make characteristic sounds. A hiding cat may meow, or the keys in the cluttered drawer may jingle when moved. Using a visual search paradigm, we demonstrated that characteristic sounds facilitated visual localization of objects, even when the sounds carried no location information. For example, finding a cat was faster when participants heard a meow sound. In contrast, sounds had no effect when participants searched for names rather than pictures of objects. For example, hearing "meow" did not facilitate localization of the word cat. These results suggest that characteristic sounds cross-modally enhance visual (rather than conceptual) processing of the corresponding objects. Our behavioral demonstration of object-based cross-modal enhancement complements the extensive literature on space-based cross-modal interactions. When looking for your keys next time, you might want to play jingling sounds. PMID:18567253

  19. The Cryogenic Dark Matter Search

    NASA Astrophysics Data System (ADS)

    Sander, Joel

    2004-05-01

    The Cryogenic Dark Matter Search (CDMS) is an experiment to search for Weakly Interacting Massive Particles (WIMPs). The experiment initially was deployed at a shallow underground site, and is currently deployed at a deep underground site at the Soudan Mine in Minnesota. The detectors operate at cryogenic temperature, and are capable of distinguishing nuclear recoils from WIMP interactions from various backgrounds. The detectors are shielded from background by both active and passive elements. We will describe the components of the overall experiment, and focus on the novel data acquisition system that has been develop to control and monitor the experiment via the World Wide Web. Preliminary signals from the operation at Soudan will be discussed.

  20. Collider searches for extra dimensions

    SciTech Connect

    Landsberg, Greg; /Brown U.

    2004-12-01

    Searches for extra spatial dimensions remain among the most popular new directions in our quest for physics beyond the Standard Model. High-energy collider experiments of the current decade should be able to find an ultimate answer to the question of their existence in a variety of models. Until the start of the LHC in a few years, the Tevatron will remain the key player in this quest. In this paper, we review the most recent results from the Tevatron on searches for large, TeV{sup -1}-size, and Randall-Sundrum extra spatial dimensions, which have reached a new level of sensitivity and currently probe the parameter space beyond the existing constraints. While no evidence for the existence of extra dimensions has been found so far, an exciting discovery might be just steps away.

  1. Solar System Searches for Life

    NASA Astrophysics Data System (ADS)

    Chyba, C. F.

    1998-12-01

    Exobiology--the search for extraterrestrial life and the study of conditions relevant to its origins--has been reborn in the past decade. This rebirth has been driven largely by discoveries related to Earth's deep biosphere, and the recognition that there may be several extraterrestrial environments within our own Solar System that could provide plausible environments for subsurface ecologies. Most prominent among these are Mars and Jupiter's moon Europa. In 2003 NASA intends to launch an orbiting spacecraft to Europa, to determine whether a subsurface ocean does in fact exist beneath that world's ice layer. A subsequent lander mission is in the initial planning stages. Lessons learned from the Viking spacecrafts' search for life on Mars over 25 years ago need to be carefully considered. More broadly, the interrelationships between planetary exploration and our understanding of the origin of life are becoming increasingly important.

  2. New phenomena searches at CDF

    SciTech Connect

    Soha, Aron; /UC, Davis

    2006-04-01

    The authors report on recent results from the Collider Detector at Fermilab (CDF) experiment, which is accumulating data from proton-antiproton collisions with {radical}s = 1.96 TeV at Run II of the Fermilab Tevatron. The new phenomena being explored include Higgs, Supersymmetry, and large extra dimensions. They also present the latest results of searches for heavy objects, which would indicate physics beyond the Standard Model.

  3. Job Search Workbook. Student Book.

    ERIC Educational Resources Information Center

    Spence, Mary Catherine

    This manual is intended to assist nonreaders in developing job search skills. It includes materials for use in nine sessions involving the nonreader and a tutor. The following questions are addressed in the individual sessions: Am I ready to look for a job? What kind of job do I want? What do I want and need in a job? Where are the jobs? How do I…

  4. Dynamic searching in the brain.

    PubMed

    Mizraji, Eduardo; Pomi, Andrés; Valle-Lisboa, Juan C

    2009-12-01

    Cognitive functions rely on the extensive use of information stored in the brain, and the searching for the relevant information for solving some problem is a very complex task. Human cognition largely uses biological search engines, and we assume that to study cognitive function we need to understand the way these brain search engines work. The approach we favor is to study multi-modular network models, able to solve particular problems that involve searching for information. The building blocks of these multimodular networks are the context dependent memory models we have been using for almost 20 years. These models work by associating an output to the Kronecker product of an input and a context. Input, context and output are vectors that represent cognitive variables. Our models constitute a natural extension of the traditional linear associator. We show that coding the information in vectors that are processed through association matrices, allows for a direct contact between these memory models and some procedures that are now classical in the Information Retrieval field. One essential feature of context-dependent models is that they are based on the thematic packing of information, whereby each context points to a particular set of related concepts. The thematic packing can be extended to multimodular networks involving input-output contexts, in order to accomplish more complex tasks. Contexts act as passwords that elicit the appropriate memory to deal with a query. We also show toy versions of several 'neuromimetic' devices that solve cognitive tasks as diverse as decision making or word sense disambiguation. The functioning of these multimodular networks can be described as dynamical systems at the level of cognitive variables. PMID:19496023

  5. Search for Dust Around Ceres

    NASA Astrophysics Data System (ADS)

    Li, J.-Y.; Nathues, A.; Mottola, S.; Sykes, M. V.; Polanskey, C. A.; Joy, S.; Mastrodemos, N.; McFadden, L. A.; Skillman, D.; Memarsadeghi, N.; Hoffmann, M.; Schröder, S. E.; Carsenty, U.; Raymond, C. A.; Russell, C. T.

    2015-10-01

    Since the first but ambiguous evidence of water sublimation activity on Ceres was reported more than two decades ago [1] and the negative results in a number of follow up observations [2], water vapor has recently been unambiguously detected by the Herschel Space Observatory observations [3]. The mechanism of water sublimation on Ceres is still unclear, but the most probable mechanisms include cometary-like sublimation and cryovolcanism. Such sublimation activity could entrain dust grains in the outgassing, resulting in either a dust envelope or dust plumes above the surface of Ceres. Given the much higher escape velocity of ~0.5 km/s on the surface of Ceres compared to those on comets (a few m/s), any dust around Ceres might be short-lived, and/or close to the surface of Ceres. The implications of possible dust around Ceres motivated NASA's Dawn mission to perform a high-sensitivity, high-resolution search for dust around Ceres. The Dawn spacecraft, during its first science orbit around Ceres, will have an excellent opportunity to search for dust at a pixel scale of 1.4 km/pixel from the night-side of Ceres looking close to the direction of the Sun. This observing geometry is the most favorable to search for dust around Ceres due to the significant increase of dust brightness and decrease in the surface brightness of Ceres towards high solar phase angle. Here we report the results of this search for dust around Ceres with Dawn's Framing Camera (FC) [4].

  6. Direct search for dark matter

    SciTech Connect

    Yoo, Jonghee; /Fermilab

    2009-12-01

    Dark matter is hypothetical matter which does not interact with electromagnetic radiation. The existence of dark matter is only inferred from gravitational effects of astrophysical observations to explain the missing mass component of the Universe. Weakly Interacting Massive Particles are currently the most popular candidate to explain the missing mass component. I review the current status of experimental searches of dark matter through direct detection using terrestrial detectors.

  7. SM Higgs Searches at CDF

    SciTech Connect

    Alvarez Gonzalez, Barbara; /Oviedo U.

    2010-06-01

    We present the latest CDF searches for the Standard Model Higgs boson with 1.96 TeV center-of-mass energy collisions produced at the Fermilab Tevatron. The data was collected with the CDF II detector at the Tevatron collider and correspond to an integrated luminosity from 2 to 4.8 1/fb. To achieve maximal sensitivity, many channels are analyzed including final states from gluon fusion, vector boson fusion, and associated production with W and Z bosons.

  8. Search for rare B decays

    NASA Astrophysics Data System (ADS)

    Albrecht, H.; Hamacher, T.; Hofmann, R. P.; Kirchhoff, T.; Mankel, R.; Nau, A.; Nowak, S.; Reßing, D.; Schröder, H.; Schulz, H. D.; Walter, M.; Wurth, R.; Hast, C.; Kapitza, H.; Kolanoski, H.; Kosche, A.; Lange, A.; Lindner, A.; Schieber, M.; Siegmund, T.; Spaan, B.; Thurn, H.; Töpfer, D.; Wegener, D.; Eckstein, P.; Frankl, C.; Graf, J.; Schmidtler, M.; Schramm, M.; Schubert, K. R.; Schwierz, R.; Waldi, R.; Reim, K.; Wegener, H.; Eckmann, R.; Kuipers, H.; Mai, O.; Mundt, R.; Oest, T.; Reiner, R.; Schmidt-Parzefall, W.; Stiewe, J.; Werner, S.; Ehret, K.; Hofmann, W.; Hüpper, A.; Knöpfle, K. T.; Spengler, J.; Krieger, P.; Macfarlane, D. B.; Prentice, J. D.; Saull, P. R. B.; Tzamariudaki, K.; van de Water, R. G.; Yoon, T.-S.; Schneider, M.; Weseler, S.; Kernel, G.; Križan, P.; Križnič, E.; Podobnik, T.; Živko, T.; Balagura, V.; Barsuk, S.; Belyaev, I.; Chistov, R.; Danilov, M.; Gershtein, L.; Gershtein, Yu.; Golutyin, A.; Korolko, I.; Kostina, G.; Litvintsev, D.; Pakhlov, P.; Semenov, S.; Snizhko, A.; Tichomirov, I.; Zaitsev, Yu.; Argus Collaboration

    1995-02-01

    Using the ARGUS detector at the e +e - storage ring DORIS II at DESY, we have searched for decays b → sgluon through full reconstruction of a whole event. Two B overlineB decays were found with one of B meson decaying into a final state without charmed particles. We also obtained an upper limit of Br(B + → τ+ντ) of 1.04% at 90% CL.

  9. The search for scalar mesons

    NASA Astrophysics Data System (ADS)

    Pennington, M. R.

    1989-04-01

    The search for I=0 0++ mesons is described. We highlight the crucial role played by the states in the 1 GeV region. An analysis program that with unimpeachable data would produce definitive results on these is outlined and shown with present data to provide prima facie evidence for dynamics beyond that of the quark model. We briefly speculate on the current status of the lowest mass scalar mesons and discuss how experiment can resolve the unanswered issues.

  10. Multivariate Time Series Similarity Searching

    PubMed Central

    Wang, Jimin; Zhu, Yuelong; Li, Shijin; Wan, Dingsheng; Zhang, Pengcheng

    2014-01-01

    Multivariate time series (MTS) datasets are very common in various financial, multimedia, and hydrological fields. In this paper, a dimension-combination method is proposed to search similar sequences for MTS. Firstly, the similarity of single-dimension series is calculated; then the overall similarity of the MTS is obtained by synthesizing each of the single-dimension similarity based on weighted BORDA voting method. The dimension-combination method could use the existing similarity searching method. Several experiments, which used the classification accuracy as a measure, were performed on six datasets from the UCI KDD Archive to validate the method. The results show the advantage of the approach compared to the traditional similarity measures, such as Euclidean distance (ED), cynamic time warping (DTW), point distribution (PD), PCA similarity factor (SPCA), and extended Frobenius norm (Eros), for MTS datasets in some ways. Our experiments also demonstrate that no measure can fit all datasets, and the proposed measure is a choice for similarity searches. PMID:24895665

  11. Multivariate time series similarity searching.

    PubMed

    Wang, Jimin; Zhu, Yuelong; Li, Shijin; Wan, Dingsheng; Zhang, Pengcheng

    2014-01-01

    Multivariate time series (MTS) datasets are very common in various financial, multimedia, and hydrological fields. In this paper, a dimension-combination method is proposed to search similar sequences for MTS. Firstly, the similarity of single-dimension series is calculated; then the overall similarity of the MTS is obtained by synthesizing each of the single-dimension similarity based on weighted BORDA voting method. The dimension-combination method could use the existing similarity searching method. Several experiments, which used the classification accuracy as a measure, were performed on six datasets from the UCI KDD Archive to validate the method. The results show the advantage of the approach compared to the traditional similarity measures, such as Euclidean distance (ED), cynamic time warping (DTW), point distribution (PD), PCA similarity factor (SPCA), and extended Frobenius norm (Eros), for MTS datasets in some ways. Our experiments also demonstrate that no measure can fit all datasets, and the proposed measure is a choice for similarity searches. PMID:24895665

  12. Pattern Search Algorithms for Bound Constrained Minimization

    NASA Technical Reports Server (NTRS)

    Lewis, Robert Michael; Torczon, Virginia

    1996-01-01

    We present a convergence theory for pattern search methods for solving bound constrained nonlinear programs. The analysis relies on the abstract structure of pattern search methods and an understanding of how the pattern interacts with the bound constraints. This analysis makes it possible to develop pattern search methods for bound constrained problems while only slightly restricting the flexibility present in pattern search methods for unconstrained problems. We prove global convergence despite the fact that pattern search methods do not have explicit information concerning the gradient and its projection onto the feasible region and consequently are unable to enforce explicitly a notion of sufficient feasible decrease.

  13. SPELLING CORRECTION IN THE PUBMED SEARCH ENGINE.

    PubMed

    Wilbur, W John; Kim, Won; Xie, Natalie

    2006-11-01

    It is known that users of internet search engines often enter queries with misspellings in one or more search terms. Several web search engines make suggestions for correcting misspelled words, but the methods used are proprietary and unpublished to our knowledge. Here we describe the methodology we have developed to perform spelling correction for the PubMed search engine. Our approach is based on the noisy channel model for spelling correction and makes use of statistics harvested from user logs to estimate the probabilities of different types of edits that lead to misspellings. The unique problems encountered in correcting search engine queries are discussed and our solutions are outlined. PMID:18080004

  14. [Development of domain specific search engines].

    PubMed

    Takai, T; Tokunaga, M; Maeda, K; Kaminuma, T

    2000-01-01

    As cyber space exploding in a pace that nobody has ever imagined, it becomes very important to search cyber space efficiently and effectively. One solution to this problem is search engines. Already a lot of commercial search engines have been put on the market. However these search engines respond with such cumbersome results that domain specific experts can not tolerate. Using a dedicate hardware and a commercial software called OpenText, we have tried to develop several domain specific search engines. These engines are for our institute's Web contents, drugs, chemical safety, endocrine disruptors, and emergent response for chemical hazard. These engines have been on our Web site for testing. PMID:11534132

  15. A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment

    PubMed Central

    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. PMID:25386855

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

    PubMed

    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. PMID:25386855

  17. A Search Model for Imperfectly Detected Targets

    NASA Technical Reports Server (NTRS)

    Ahumada, Albert

    2012-01-01

    Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

  18. NASA Indexing Benchmarks: Evaluating Text Search Engines

    NASA Technical Reports Server (NTRS)

    Esler, Sandra L.; Nelson, Michael L.

    1997-01-01

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

  19. Improving the learning efficiencies of realtime search

    SciTech Connect

    Ishida, Toru; Shimbo, Masashi

    1996-12-31

    The capability of learning is one of the salient features of realtime search algorithms such as LRTA*. The major impediment is, however, the instability of the solution quality during convergence: (1) they try to find all optimal solutions even after obtaining fairly good solutions, and (2) they tend to move towards unexplored areas thus failing to balance exploration and exploitation. We propose and analyze two new realtime search algorithms to stabilize the convergence process. {epsilon}-search (weighted realtime search) allows suboptimal solutions with {epsilon} error to reduce the total amount of learning performed. {delta}-search (realtime search with upper bounds) utilizes the upper bounds of estimated costs, which become available after the problem is solved once. Guided by the upper bounds, {delta}-search can better control the tradeoff between exploration and exploitation.

  20. Real-time earthquake monitoring using a search engine method

    NASA Astrophysics Data System (ADS)

    Zhang, Jie; Zhang, Haijiang; Chen, Enhong; Zheng, Yi; Kuang, Wenhuan; Zhang, Xiong

    2014-12-01

    When an earthquake occurs, seismologists want to use recorded seismograms to infer its location, magnitude and source-focal mechanism as quickly as possible. If such information could be determined immediately, timely evacuations and emergency actions could be undertaken to mitigate earthquake damage. Current advanced methods can report the initial location and magnitude of an earthquake within a few seconds, but estimating the source-focal mechanism may require minutes to hours. Here we present an earthquake search engine, similar to a web search engine, that we developed by applying a computer fast search method to a large seismogram database to find waveforms that best fit the input data. Our method is several thousand times faster than an exact search. For an Mw 5.9 earthquake on 8 March 2012 in Xinjiang, China, the search engine can infer the earthquake’s parameters in <1 s after receiving the long-period surface wave data.

  1. Real-time earthquake monitoring using a search engine method

    PubMed Central

    Zhang, Jie; Zhang, Haijiang; Chen, Enhong; Zheng, Yi; Kuang, Wenhuan; Zhang, Xiong

    2014-01-01

    When an earthquake occurs, seismologists want to use recorded seismograms to infer its location, magnitude and source-focal mechanism as quickly as possible. If such information could be determined immediately, timely evacuations and emergency actions could be undertaken to mitigate earthquake damage. Current advanced methods can report the initial location and magnitude of an earthquake within a few seconds, but estimating the source-focal mechanism may require minutes to hours. Here we present an earthquake search engine, similar to a web search engine, that we developed by applying a computer fast search method to a large seismogram database to find waveforms that best fit the input data. Our method is several thousand times faster than an exact search. For an Mw 5.9 earthquake on 8 March 2012 in Xinjiang, China, the search engine can infer the earthquake’s parameters in <1 s after receiving the long-period surface wave data. PMID:25472861

  2. Real-time earthquake monitoring using a search engine method.

    PubMed

    Zhang, Jie; Zhang, Haijiang; Chen, Enhong; Zheng, Yi; Kuang, Wenhuan; Zhang, Xiong

    2014-01-01

    When an earthquake occurs, seismologists want to use recorded seismograms to infer its location, magnitude and source-focal mechanism as quickly as possible. If such information could be determined immediately, timely evacuations and emergency actions could be undertaken to mitigate earthquake damage. Current advanced methods can report the initial location and magnitude of an earthquake within a few seconds, but estimating the source-focal mechanism may require minutes to hours. Here we present an earthquake search engine, similar to a web search engine, that we developed by applying a computer fast search method to a large seismogram database to find waveforms that best fit the input data. Our method is several thousand times faster than an exact search. For an Mw 5.9 earthquake on 8 March 2012 in Xinjiang, China, the search engine can infer the earthquake's parameters in <1 s after receiving the long-period surface wave data. PMID:25472861

  3. Evaluation of Federated Searching Options for the School Library

    ERIC Educational Resources Information Center

    Abercrombie, Sarah E.

    2008-01-01

    Three hosted federated search tools, Follett One Search, Gale PowerSearch Plus, and WebFeat Express, were configured and implemented in a school library. Databases from five vendors and the OPAC were systematically searched. Federated search results were compared with each other and to the results of the same searches in the database's native…

  4. Searching for Dark-Matter Axions

    NASA Astrophysics Data System (ADS)

    Rosenberg, Leslie

    2016-03-01

    The axion is a hypothetical elementary particle arising in the 1970's from an elegant solution to the Strong CP problem in Quantum Chromo Dynamics. Light QCD axions (masses <10-3 eV/c2) would have extraordinarily feeble interactions with normal matter and radiation, and these axions have the properties of an ideal dark-matter candidate. Axions have been searched for since their inception. However, light axions constituting dark matter are so feebly coupled that it is only recently that detection technology has advanced to where such axions might be detected. Several large searches are in the construction and commissioning phase, with new projects in the development phase. There are also concepts for new detector technologies aimed at improving the sensitivity and axion mass-reach. These searches would have the potential to detect even the more pessimistically-coupled dark-matter axions should they contribute a fraction of the local Milky Way dark-matter halo. This talk discusses the dark-matter axion experimental landscape and the prospects for their discovery. Supported by the U.S. Department of Energy, Office of High Energy Physics.

  5. Fast Edge-Searching and Related Problems

    NASA Astrophysics Data System (ADS)

    Yang, Boting

    Given a graph G = (V,E) in which a fugitive hides on vertices or along edges, graph searching problems are usually to find the minimum number of searchers required to capture the fugitive. In this paper, we consider the problem of finding the minimum number of steps to capture the fugitive. We introduce the fast edge-searching problem in the edge search model, which is the problem of finding the minimum number of steps (called the fast edge-search time) to capture the fugitive. We establish relations between the fast edge-search time and the fast search number. While the family of graphs whose fast search number is at most k is not minor-closed for any positive integer k ≥ 2, we show that the family of graphs whose fast edge-search time is at most k is minor-closed. We establish relations between the fast (edge-)searching and the node searching. These relations allow us to transform the problem of computing node search numbers to the problem of computing fast edge-search time or fast search numbers. Using these relations, we prove that the problem of deciding, given a graph G and an integer k, whether the fast (edge-)search number of G is less than or equal to k is NP-complete; and it remains NP-complete for Eulerian graphs. We also prove that the problem of determining whether the fast (edge-)search number of G is a half of the number of odd vertices in G is NP-complete; and it remains NP-complete for planar graphs with maximum degree 4. We present a linear time approximation algorithm for the fast edge-search time that always delivers solutions of at most (1+|V|-1/|E|+1) times the optimal value. This algorithm also gives us a tight upper bound on the fast search number of the graph. We also show a lower bound on the fast search number using the minimum degree and the number of odd vertices.

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

    NASA Astrophysics Data System (ADS)

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

    2009-10-01

    aircraft, a given web site). Regarding the nature of the searching drive, in certain instances, it can be guided almost entirely by external cues, either by the cognitive (memory) or detective (olfaction, vision, etc) skills of the searcher. However, in many situations the movement is non-oriented, being in essence a stochastic process. Therefore, in such cases (and even when a small deterministic component in the locomotion exists) a random search effectively defines the final rates of encounters. Hence, one reason underlying the richness of the random search problem relates just to the `ignorance' of the locations of the randomly located targets. Contrary to conventional wisdom, the lack of complete information does not necessarily lead to greater complexity. As an illustrative example, let us consider the case of complete information. If the positions of all target sites are known in advance, then the question of what sequential order to visit the sites so to reduce the energy costs of locomotion itself becomes a rather challenging problem: the famous `travelling salesman' optimization query, belonging to the NP-complete class of problems. The ignorance of the target site locations, however, considerably modifies the problem and renders it not amenable to be treated by purely deterministic computational methods. In fact, as expected, the random search problem is not particularly suited to search algorithms that do not use elements of randomness. So, only a statistical approach to the search problem can adequately deal with the element of ignorance. In other words, the incomplete information renders the search under-determined, i.e., it is not possible to find the `best' solution to the problem because all the information is not given. Instead, one must guess and probabilistic or stochastic strategies become unavoidable. Also, the random search problem bears a relation to reaction-diffusion processes, because the search involves a diffusive aspect, movement, as well as a

  7. Non-SUSY Searches at the Tevatron

    SciTech Connect

    Strologas, John; /New Mexico U.

    2011-08-01

    We present recent results from searches for new physics beyond supersymmetry performed at the Tevatron accelerator at Fermilab. The CDF and D0 analyses presented here utilized data of integrated luminosity up to 6 fb{sup -1}. We cover leptonic and bosonic resonances interpreted in the Randall-Sundrum graviton and new-boson models, rare final states, and the search for vector-like quarks. The search for new phenomena beyond the weak-scale supersymmetry is a vital part of the Fermilab program. Both CDF and D0 experiments at the Tevatron collider actively look for signals not expected by the standard model (SM) or minimal supersymmetric models. The searches can be sorted in three categories: (a) searches for generic resonances that can be interpreted in several new-physics models; (b) searches for exotic combinations of final-state objects or abnormal kinematics (not necessarily predicted by current theories); and (c) model-dependent searches that test a particular theory. We present here latest results from all these categories: searches for new dilepton and diboson resonances (interpreted as gravitons and new gauge bosons), searches for anomalous {gamma} + E{sub T} + X production, and searches for vector-like quarks.

  8. ISE: An Integrated Search Environment. The manual

    NASA Technical Reports Server (NTRS)

    Chu, Lon-Chan

    1992-01-01

    Integrated Search Environment (ISE), a software package that implements hierarchical searches with meta-control, is described in this manual. ISE is a collection of problem-independent routines to support solving searches. Mainly, these routines are core routines for solving a search problem and they handle the control of searches and maintain the statistics related to searches. By separating the problem-dependent and problem-independent components in ISE, new search methods based on a combination of existing methods can be developed by coding a single master control program. Further, new applications solved by searches can be developed by coding the problem-dependent parts and reusing the problem-independent parts already developed. Potential users of ISE are designers of new application solvers and new search algorithms, and users of experimental application solvers and search algorithms. The ISE is designed to be user-friendly and information rich. In this manual, the organization of ISE is described and several experiments carried out on ISE are also described.

  9. A search for interstellar pyrimidine

    NASA Astrophysics Data System (ADS)

    Kuan, Yi-Jehng; Yan, Chi-Hung; Charnley, Steven B.; Kisiel, Zbigniew; Ehrenfreund, Pascale; Huang, Hui-Chun

    2003-10-01

    We have searched three hot molecular cores for submillimetre emission from the nucleic acid building block pyrimidine. We obtain upper limits to the total pyrimidine (beam-averaged) column densities towards Sgr B2(N), Orion KL and W51 e1/e2 of 1.7 × 1014, 2.4 × 1014 and 3.4 × 1014 cm-2, respectively. The associated upper limits to the pyrimidine fractional abundances lie in the range (0.3-3) × 10-10. Implications of this result for interstellar organic chemistry, and for the prospects of detecting nitrogen heterocycles in general, are discussed briefly.

  10. Neutral Supersymmetric Higgs Boson Searches

    SciTech Connect

    Robinson, Stephen Luke

    2008-07-01

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

  11. Supersymmetry searches at the Tevatron

    SciTech Connect

    Portell, Xavier; /Barcelona, IFAE

    2006-09-01

    CDF and D0 detectors have already collected 1.3 fb{sup -1} of data delivered by the Tevatron collider at 1.96 TeV center-of-mass energy. We present here the various analyses that are currently testing the possibility of a supersymmetric extension of the Standard Model. No evidence for such processes have been found in luminosities that range from 300 to 800 pb{sup -1} and different limits on the different supersymmetric models are set. Constraints coming from indirect searches are also presented.

  12. Supersymmetry searches at the Tevatron

    SciTech Connect

    A. N. Safonov

    2003-06-10

    For Run II, both CDF and D0 underwent significant improvement of the detectors to enhance their sensitivity to new physics. The detectors are commissioned and are taking data. The Tevatron is operating at a record center of mass energy of 1.96 TeV. Despite earlier difficulties, the luminosity situation is improving and both detectors have accumulated amounts of data comparable or higher than those available in Run I. This is a report on the status and prospects of SUSY searches at CDF and D0 in Run II. Recent SUSY analyses from run I are also reported.

  13. Earthdata Search Usability Study Process

    NASA Technical Reports Server (NTRS)

    Reese, Mark

    2016-01-01

    User experience (UX) design is the process of enhancing user satisfaction by improving various aspects of the user's interaction with an application or website. One aspect of UX design is usability, or the extent to which an application can be used to to accomplish tasks efficiently, effectively, and with satisfaction. NASA's Earthdata Search Client recently underwent a focused usability testing project to measure usability and gain valuable user feedback and insights to increase usability for its end-users. This presentation focuses on the process by which the usability tests were administered and the lessons learned throughout the process.

  14. Publication search and retrieval system

    USGS Publications Warehouse

    Winget, Elizabeth A.

    1981-01-01

    The publication search and retrieval system of the Branch of Atlantic-Gulf of Mexico Geology, U.S. Geological Survey, Woods Hole, Mass., is a procedure for listing and describing branch-sponsored publications. It is designed for maintenance and retrieval by those having limited knowledge of computer languages and programs. Because this branch currently utilizes the Hewlett-Packard HP-1000 computer with RTE-IVB operating system, database entry and maintenance is performed in accordance with the TE-IVB Terminal User’s Reference Manual (Hewlett-Packard Company, 1980) and within the constraints of GRASP (Bowen and Botbol, 1975) and WOLF (Evenden, 1978).

  15. THE SEARCH FOR PSYCHIC TRUTHS.

    PubMed

    Busch, Fred

    2016-04-01

    Emphasizing psychic truths as the major domain of psychoanalysis, the author explores the complexity of defining such psychic truths. It is suggested that thinking of levels of psychic truths is the most useful approach. How to understand trauma and historical truth within this context is examined. The role of the analyst as aiding the search for psychic truths, rather than functioning as psychic "truth teller," is discussed within the context of paradigmatic changes in the psychoanalytic method that form an emerging common ground. PMID:27112742

  16. Academic Colorectal Surgery Job Search

    PubMed Central

    Kalady, Matthew F.

    2014-01-01

    The field of academic colorectal surgery encompasses a vast array of possibilities. Clinical care accompanied by research, teaching, innovation, and/or administration provides the foundation for what is considered an academic career. For those choosing academic colorectal surgery, the process of finding and selecting a first job can provoke much angst. This article describes some strategies to approach the academic colorectal job search and provides insight into deciding a career focus, exploring relevant positions, weighing specific factors, and negotiating your first offer. PMID:25067918

  17. Electronic search and rescue aids

    NASA Technical Reports Server (NTRS)

    Trudell, B. J.

    1980-01-01

    There are two elements to the basic electronic search and rescue problem: a means for immediately alerting potential rescuers and an effective method to guide the rescue forces to the scene of the emergency. An Emergency Locator Transmitter (ELT) used by aircraft or an Emergency Position Indicating Radio Beacon (EPIRB) used by maritime vessels has the capability of providing for both an immediate alert and a homing signal to assist rescue forces in locating the site of the distress. This paper describes the development of ELT/EPIRB systems. Emphasis is placed on the SARSAT project, the COSPAS/SARSAT project, and an experimental 406 MHz ELT/EPIRB system.

  18. CADIAL Search Engine at INEX

    NASA Astrophysics Data System (ADS)

    Mijić, Jure; Moens, Marie-Francine; Dalbelo Bašić, Bojana

    Semi-structured document retrieval is becoming more popular with the increasing quantity of data available in XML format. In this paper, we describe a search engine model that exploits the structure of the document and uses language modelling and smoothing at the document and collection levels for calculating the relevance of each element from all the documents in the collection to a user query. Element priors, CAS query constraint filtering, and the +/- operators are also used in the ranking procedure. We also present the results of our participation in the INEX 2008 Ad Hoc Track.

  19. Academic colorectal surgery job search.

    PubMed

    Kalady, Matthew F

    2014-06-01

    The field of academic colorectal surgery encompasses a vast array of possibilities. Clinical care accompanied by research, teaching, innovation, and/or administration provides the foundation for what is considered an academic career. For those choosing academic colorectal surgery, the process of finding and selecting a first job can provoke much angst. This article describes some strategies to approach the academic colorectal job search and provides insight into deciding a career focus, exploring relevant positions, weighing specific factors, and negotiating your first offer. PMID:25067918

  20. Searching for cost-optimized interstellar beacons.

    PubMed

    Benford, Gregory; Benford, James; Benford, Dominic

    2010-06-01

    What would SETI beacon transmitters be like if built by civilizations that had a variety of motives but cared about cost? In a companion paper, we presented how, for fixed power density in the far field, a cost-optimum interstellar beacon system could be built. Here, we consider how we should search for a beacon if it were produced by a civilization similar to ours. High-power transmitters could be built for a wide variety of motives other than the need for two-way communication; this would include beacons built to be seen over thousands of light-years. Extraterrestrial beacon builders would likely have to contend with economic pressures just as their terrestrial counterparts do. Cost, spectral lines near 1 GHz, and interstellar scintillation favor radiating frequencies substantially above the classic "water hole." Therefore, the transmission strategy for a distant, cost-conscious beacon would be a rapid scan of the galactic plane with the intent to cover the angular space. Such pulses would be infrequent events for the receiver. Such beacons built by distant, advanced, wealthy societies would have very different characteristics from what SETI researchers seek. Future searches should pay special attention to areas along the galactic disk where SETI searches have seen coherent signals that have not recurred on the limited listening time intervals we have used. We will need to wait for recurring events that may arrive in intermittent bursts. Several new SETI search strategies have emerged from these ideas. We propose a new test for beacons that is based on the Life Plane hypotheses. PMID:20624057

  1. Searching for Cost-Optimized Interstellar Beacons

    NASA Astrophysics Data System (ADS)

    Benford, Gregory; Benford, James; Benford, Dominic

    2010-06-01

    What would SETI beacon transmitters be like if built by civilizations that had a variety of motives but cared about cost? In a companion paper, we presented how, for fixed power density in the far field, a cost-optimum interstellar beacon system could be built. Here, we consider how we should search for a beacon if it were produced by a civilization similar to ours. High-power transmitters could be built for a wide variety of motives other than the need for two-way communication; this would include beacons built to be seen over thousands of light-years. Extraterrestrial beacon builders would likely have to contend with economic pressures just as their terrestrial counterparts do. Cost, spectral lines near 1 GHz, and interstellar scintillation favor radiating frequencies substantially above the classic "water hole." Therefore, the transmission strategy for a distant, cost-conscious beacon would be a rapid scan of the galactic plane with the intent to cover the angular space. Such pulses would be infrequent events for the receiver. Such beacons built by distant, advanced, wealthy societies would have very different characteristics from what SETI researchers seek. Future searches should pay special attention to areas along the galactic disk where SETI searches have seen coherent signals that have not recurred on the limited listening time intervals we have used. We will need to wait for recurring events that may arriarrive in intermittent bursts. Several new SETI search strategies have emerged from these ideas. We propose a new test for beacons that is based on the Life Plane hypotheses.

  2. Searching for Cost-Optimized Interstellar Beacons

    NASA Technical Reports Server (NTRS)

    Benford, Gregory; Benford, James; Benford, Dominic

    2010-01-01

    What would SETI beacon transmitters be like if built by civilizations that had a variety of motives but cared about cost? In a companion paper, we presented how, for fixed power density in the far field, a cost-optimum interstellar beacon system could be built. Here, we consider how we should search for a beacon if it were produced by a civilization similar to ours. High-power transmitters could be built for a wide variety of motives other than the need for two-way communication, this would include beacons built to be seen over thousands of light-years. Extraterrestrial beacon builders would likely have to contend with economic pressures just as their terrestrial counterparts do. Cost, spectral lines near 1GHz, and interstellar scintillation favor radiating frequencies substantially above the classic "water hole." Therefore, the transmission strategy for a distant, cost-conscious beacon would be a rapid scan of the galactic plane with the intent to cover the angular space. Such pulses would be infrequent events for the receiver. Such beacons built by distant, advanced, wealthy societies would have very different characteristics from what SETI researchers seek. Future searches should pay special attention to areas along the galactic disk where SETI searches have seen coherent signals that have not recurred on the limited listening time intervals we have used. We will need to wait for recurring events that may arrive in intermittent bursts. Several new SETI search strategies have emerged from these ideas. We propose a new test for beacons that is based on the Life Plane hypotheses.

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

    PubMed Central

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

    2012-01-01

    Background 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. Methods 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 p< 0.05 considered statistically significant. Results Searches for the keyword “anesthesia” or “anaesthesia” diminished since 2004 reflected by Google Insights for Search (p< 0.05). The search for “anesthesia side effects” is trending up over the same time period while the search for “anesthesia and safety” is trending down. The search phrase “before anesthesia” is searched more frequently than “preanesthesia” and the search for “before anesthesia” is trending up. Using “pain” as a keyword is steadily increasing over the years indicated. While different search 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. Conclusions General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side

  4. Are Bibliographic Management Software Search Interfaces Reliable?: A Comparison between Search Results Obtained Using Database Interfaces and the EndNote Online Search Function

    ERIC Educational Resources Information Center

    Fitzgibbons, Megan; Meert, Deborah

    2010-01-01

    The use of bibliographic management software and its internal search interfaces is now pervasive among researchers. This study compares the results between searches conducted in academic databases' search interfaces versus the EndNote search interface. The results show mixed search reliability, depending on the database and type of search…

  5. [The search for medical information on the World Wide Web].

    PubMed

    Cappeliez, O; Ranschaert, E; Peetrons, P; Struyven, J

    1999-12-01

    The internet has experienced tremendous growth over the past few years and has currently many resources in the field of medicine. However, many physicians remain unaware of how to gain access to this powerful tool. This article briefly describes the World Wide Web and its potential applications for physicians. The basics of web search engines and medical directories, as well as the use of advanced search with boolean operators are explained. PMID:10672776

  6. Fully-coherent all-sky search for gravitational-waves from compact binary coalescences

    NASA Astrophysics Data System (ADS)

    Macleod, D.; Harry, I. W.; Fairhurst, S.

    2016-03-01

    We introduce a fully coherent method for searching for gravitational wave signals generated by the merger of black hole and/or neutron star binaries. This extends the coherent analysis previously developed and used for targeted gravitational wave searches to an all-sky, all-time search. We apply the search to one month of data taken during the fifth science run of the LIGO detectors. We demonstrate an increase in sensitivity of 25% over the coincidence search, which is commensurate with expectations. Finally, we discuss prospects for implementing and running a coherent search for gravitational wave signals from binary coalescence in the advanced gravitational wave detector data.

  7. Privacy Preserving Nearest Neighbor Search

    NASA Astrophysics Data System (ADS)

    Shaneck, Mark; Kim, Yongdae; Kumar, Vipin

    Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving certain privacy guarantees. In this chapter we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multiparty computation primitives to compute the nearest neighbors of records in horizontally distributed data. We show how this algorithm can be used in three important data mining algorithms, namely LOF outlier detection, SNN clustering, and kNN classification. We prove the security of these algorithms under the semi-honest adversarial model, and describe methods that can be used to optimize their performance. Keywords: Privacy Preserving Data Mining, Nearest Neighbor Search, Outlier Detection, Clustering, Classification, Secure Multiparty Computation

  8. Dark Photon Search at BABAR

    SciTech Connect

    Greenwood, Ross N; /MIT /SLAC

    2012-09-07

    Presented is the current progress of a search for the signature of a dark photon or new particle using the BaBar data set. We search for the processes e{sup +}e{sup -} {yields} {gamma}{sub ISR}A{prime},A{prime} {yields} e{sup +}e{sup -} and e{sup +}e{sup -} {yields} {gamma}{sub ISR}{gamma}, {gamma} {yields} A{prime},A{prime} {yields} e{sup +}e{sup -}, where {gamma}{sub ISR} is an initial state radiated photon of energy E{sub {gamma}} >= 1 GeV. Twenty-five sets of Monte Carlo, simulating e{sup +}e{sup -} collisions at an energy of 10.58 GeV, were produced with different values of the A{prime} mass ranging from 100 MeV to 9.5 GeV. The mass resolution is calculated based on Monte Carlo simulations. We implement ROOT's Toolkit for Multivariate Analysis (TMVA), a machine learning tool that allows us to evaluate the signal character of events based on many of discriminating variables. TMVA training is conducted with samples of Monte Carlo as signal and a small portion of Run 6 as background. The multivariate analysis produces additional cuts to separate signal and background. The signal efficiency and sensitivity are calculated. The analysis will move forward to fit the background and scan the residuals for the narrow resonance peak of a new particle.

  9. Sterile Neutrino Search with MINOS

    SciTech Connect

    Devan, Alena V.

    2015-08-01

    MINOS, Main Injector Neutrino Oscillation Search, is a long-baseline neutrino oscillation experiment in the NuMI muon neutrino beam at the Fermi National Accelerator Laboratory in Batavia, IL. It consists of two detectors, a near detector positioned 1 km from the source of the beam and a far detector 734 km away in Minnesota. MINOS is primarily designed to observe muon neutrino disappearance resulting from three flavor oscillations. The Standard Model of Particle Physics predicts that neutrinos oscillate between three active flavors as they propagate through space. This means that a muon-type neutrino has a certain probability to later interact as a different type of neutrino. In the standard picture, the neutrino oscillation probabilities depend only on three neutrino flavors and two mass splittings, Δm2. An anomaly was observed by the LSND and MiniBooNE experiments that suggests the existence of a fourth, sterile neutrino flavor that does not interact through any of the known Standard Model interactions. Oscillations into a theoretical sterile flavor may be observed by a deficit in neutral current interactions in the MINOS detectors. A distortion in the charged current energy spectrum might also be visible if oscillations into the sterile flavor are driven by a large mass-squared difference, ms2 ~ 1 eV2. The results of the 2013 sterile neutrino search are presented here.

  10. NEWS: Nuclear emulsion WIMP search

    NASA Astrophysics Data System (ADS)

    Alexandrov, A.; Asada, T.; D'Ambrosio, N.; De Lellis, G.; Di Crescenzo, A.; Di Marco, N.; Furuya, S.; Gentile, V.; Hakamata, K.; Ishikawa, M.; Katsuragawa, T.; Kuwabara, K.; Machii, S.; Naka, T.; Pupilli, F.; Sirignano, C.; Tawara, Y.; Tioukov, V.; Umemoto, A.; Yoshimoto, M.

    2015-01-01

    The most convincing candidate as main constituent of the dark matter in the Universe consists of Weakly Interacting Massive Particles (WIMPs). WIMPs must be electrically neutral and interact with a very low cross-section ( σ<10^{-40} cm2) which makes them detectable in direct searches only through the observation of nuclear recoils induced by the WIMP rare scatterings. In the experiments carried out so far, recoiled nuclei are searched for as a signal over a background produced by Compton electrons and neutron scatterings. Signal found by some experiments have not been confirmed by other techniques. We propose an R&D program for a new experimental method able to observe the track of the scattered nucleus based on new developments in the nuclear emulsion technique. Nuclear emulsions would act both as the WIMP target and as the tracking detector able to reconstruct the direction of the recoiled nucleus. This unique characteristic would provide a new and unambiguous signature of the presence of the dark matter in our galaxy.

  11. Sterile Neutrino Search with MINOS

    NASA Astrophysics Data System (ADS)

    Devan, Alena V.

    MINOS, Main Injector Neutrino Oscillation Search, is a long-baseline neutrino oscillation experiment in the NuMI muon neutrino beam at the Fermi National Accelerator Laboratory in Batavia, IL. It consists of two detectors, a near detector positioned 1 km from the source of the beam and a far detector 734 km away in Minnesota. MINOS is primarily designed to observe muon neutrino disappearance resulting from three flavor oscillations. The Standard Model of Particle Physics predicts that neutrinos oscillate between three active flavors as they propagate through space. This means that a muon type neutrino has a certain probability to later interact as a different type of neutrino. In the standard picture, the neutrino oscillation probabilities depend only on three neutrino flavors and two mass splittings, Amt. An anomaly was observed by the LSND and MiniBooNE experiments that suggests the existence of a fourth, sterile neutrino flavor that does not interact through any of the known Standard Model interactions. Oscillations into a theoretical sterile flavor may be observed by a deficit in neutral current interactions in the MINOS detectors. A distortion in the charged current energy spectrum might also be visible if oscillations into the sterile flavor are driven by a large mass-squared difference, Delta m2s 1 eV2. The results of the 2013 sterile neutrino search are presented here.

  12. Still spending dollars, still searching for sense: advanced practice nursing in an era of regulatory and economic turmoil.

    PubMed

    Safriet, B J

    1998-01-01

    Regulatory and market forces are dramatically affecting the practice prospects for advanced practice nurses (APNs). Examples include the designation of APNs as primary care providers by for-profit capitated systems, the elimination of "geographic" practice boundaries by the advent of telepractice, and the revision of governmental reimbursement provisions for entire categories of APNs. Educational, political, and economic challenges necessitate an increased APN leadership role in national and state policy reform efforts. PMID:9874960

  13. An Improved Forensic Science Information Search.

    PubMed

    Teitelbaum, J

    2015-01-01

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

  14. Search without Boundaries Using Simple APIs

    USGS Publications Warehouse

    Tong, Qi

    2009-01-01

    The U.S. Geological Survey (USGS) Library, where the author serves as the digital services librarian, is increasingly challenged to make it easier for users to find information from many heterogeneous information sources. Information is scattered throughout different software applications (i.e., library catalog, federated search engine, link resolver, and vendor websites), and each specializes in one thing. How could the library integrate the functionalities of one application with another and provide a single point of entry for users to search across? To improve the user experience, the library launched an effort to integrate the federated search engine into the library's intranet website. The result is a simple search box that leverages the federated search engine's built-in application programming interfaces (APIs). In this article, the author describes how this project demonstrated the power of APIs and their potential to be used by other enterprise search portals inside or outside of the library.

  15. New Quality Metrics for Web Search Results

    NASA Astrophysics Data System (ADS)

    Metaxas, Panagiotis Takis; Ivanova, Lilia; Mustafaraj, Eni

    Web search results enjoy an increasing importance in our daily lives. But what can be said about their quality, especially when querying a controversial issue? The traditional information retrieval metrics of precision and recall do not provide much insight in the case of web information retrieval. In this paper we examine new ways of evaluating quality in search results: coverage and independence. We give examples on how these new metrics can be calculated and what their values reveal regarding the two major search engines, Google and Yahoo. We have found evidence of low coverage for commercial and medical controversial queries, and high coverage for a political query that is highly contested. Given the fact that search engines are unwilling to tune their search results manually, except in a few cases that have become the source of bad publicity, low coverage and independence reveal the efforts of dedicated groups to manipulate the search results.

  16. Information searching protocol: a smart protocol for specific content search over the Internet

    NASA Astrophysics Data System (ADS)

    Bhattarakosol, Pattarasinee; Preechaveerakul, Ladda

    2006-10-01

    Currently, information is very important to Internet users. Unfortunately, searching for specific information from the Internet is not easy as wishes. The existing search engine mechanisms cannot be performed using a pathname of URL as a search key. Therefore, users who have a partial pathname of URL cannot use their knowledge to narrow down the search results. Thus, users have to spend a long time searching for the required web site from the result list. This paper proposes a search protocol named Information Searching Protocol (ISP) that supports the multiple search contents for users who know a partial pathname of URL and keywords. Moreover, the architecture of the Global Search Engine System (GSES) that cooperates with the ISP and is responsible for the search mechanism is also proposed. The GSES consists of two separated parts: an Internet Search Protocol agent at the client site, and GSES components at the server site. These components allow users to perform the search using a pathname of URL composing with keywords. The functions of GSES components indicate that the ISP enhances the search mechanism. So, users receive more specific URL and can, shortly, get access to the required site.

  17. The search for signals from extraterrestrial civilizations.

    NASA Technical Reports Server (NTRS)

    Walker, J. C. G.

    1973-01-01

    The probability that a star has a habitable planet with a communicative civilization is investigated. One approach to the search problem is to assume that the other civilization will do most of the work, which implies that the search is limited to 'supercivilizations' able to transmit detectable signals in all directions all the time. The development of an optimal search strategy is discussed together with questions of the probability of success.

  18. Searches for supersymmetry at the Tevatron

    SciTech Connect

    Mary R. M. Bishai

    2001-05-15

    We review current experimental results of searches for Supersymmetry (SUSY) at the Fermilab Tevatron Collider using the Run I data collected during 1992-1996. New results from the CDF detector in the jets + missing E{sub t} and lepton-photon channels are presented. Recent results from model independent searches at D0 using the SLEUTH algorithm are reviewed. We discuss the prospects for supersymmetry searches at Run II of the Tevatron, scheduled to start in March, 2001.

  19. Searching for Gluinos at the Tevatron

    SciTech Connect

    Alwall, Johan; Le, My-Phuong; Lisanti, Mariangela; Wacker, Jay G.; /SLAC /Stanford U., Phys. Dept.

    2008-03-14

    This letter describes how to perform model-independent searches for new pair-produced color octet particles that each subsequently decay into two jets plus missing energy at the Tevatron. Current searches are not sensitive to all regions of parameter space because they employ CMSSM-motivated cuts. Optimizing the H{sub T} and E{sub T} cuts expands the sensitivity of searches for all kinematically allowed decays.

  20. Electronic Biomedical Literature Search for Budding Researcher

    PubMed Central

    Thakre, Subhash B.; Thakre S, Sushama S.; Thakre, Amol D.

    2013-01-01

    Search for specific and well defined literature related to subject of interest is the foremost step in research. When we are familiar with topic or subject then we can frame appropriate research question. Appropriate research question is the basis for study objectives and hypothesis. The Internet provides a quick access to an overabundance of the medical literature, in the form of primary, secondary and tertiary literature. It is accessible through journals, databases, dictionaries, textbooks, indexes, and e-journals, thereby allowing access to more varied, individualised, and systematic educational opportunities. Web search engine is a tool designed to search for information on the World Wide Web, which may be in the form of web pages, images, information, and other types of files. Search engines for internet-based search of medical literature include Google, Google scholar, Scirus, Yahoo search engine, etc., and databases include MEDLINE, PubMed, MEDLARS, etc. Several web-libraries (National library Medicine, Cochrane, Web of Science, Medical matrix, Emory libraries) have been developed as meta-sites, providing useful links to health resources globally. A researcher must keep in mind the strengths and limitations of a particular search engine/database while searching for a particular type of data. Knowledge about types of literature, levels of evidence, and detail about features of search engine as available, user interface, ease of access, reputable content, and period of time covered allow their optimal use and maximal utility in the field of medicine. Literature search is a dynamic and interactive process; there is no one way to conduct a search and there are many variables involved. It is suggested that a systematic search of literature that uses available electronic resource effectively, is more likely to produce quality research. PMID:24179937

  1. Efficient Algorithm for Rectangular Spiral Search

    NASA Technical Reports Server (NTRS)

    Brugarolas, Paul; Breckenridge, William

    2008-01-01

    An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

  2. Exactness of the original Grover search algorithm

    SciTech Connect

    Diao Zijian

    2010-10-15

    It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

  3. A Solr Powered Architecture for Scientific Metadata Search Applications

    NASA Astrophysics Data System (ADS)

    Reed, S. A.; Billingsley, B. W.; Harper, D.; Kovarik, J.; Brandt, M.

    2014-12-01

    Discovering and obtaining resources for scientific research is increasingly difficult but Open Source tools have been implemented to provide inexpensive solutions for scientific metadata search applications. Common practices used in modern web applications can improve the quality of scientific data as well as increase availability to a wider audience while reducing costs of maintenance. Motivated to improve discovery and access of scientific metadata hosted at NSIDC and the need to aggregate many areas of arctic research, the National Snow and Ice Data Center (NSIDC) and Advanced Cooperative Arctic Data and Information Service (ACADIS) contributed to a shared codebase used by the NSIDC Search and Arctic Data Explorer (ADE) portals. We implemented the NSIDC Search and ADE to improve search and discovery of scientific metadata in many areas of cryospheric research. All parts of the applications are available free and open for reuse in other applications and portals. We have applied common techniques that are widely used by search applications around the web and with the goal of providing quick and easy access to scientific metadata. We adopted keyword search auto-suggest which provides a dynamic list of terms and phrases that closely match characters as the user types. Facet queries are another technique we have implemented to filter results based on aspects of the data like the instrument used or temporal duration of the data set. Service APIs provide a layer between the interface and the database and are shared between the NSIDC Search and ACADIS ADE interfaces. We also implemented a shared data store between both portals using Apache Solr (an Open Source search engine platform that stores and indexes XML documents) and leverage many powerful features including geospatial search and faceting. This presentation will discuss the application architecture as well as tools and techniques used to enhance search and discovery of scientific metadata.

  4. Predicting Road Conditions with Internet Search

    PubMed Central

    2016-01-01

    Traffic congestion is an important problem both on an individual and on a societal level and much research has been done to explain and prevent their emergence. There are currently many systems which provide a reasonably good picture of actual road traffic by employing either fixed measurement points on highways or so called “floating car data” i.e. by using velocity and location data from roaming, networked, GPS enabled members of traffic. Some of these systems also offer forecasting of road conditions based on such historical data. To my knowledge there is as yet no system which offers advance notice on road conditions based on a signal which is guaranteed to occur in advance of these conditions and this is the novelty of this paper. Google Search intensity for the German word stau (i.e. traffic jam) peaks 2 hours ahead of the number of traffic jam reports as reported by the ADAC, a well known German automobile club and the largest of its kind in Europe. This is true both in the morning (7 am to 9 am) and in the evening (4 pm to 6 pm). The main result of this paper is then that after controlling for time-of-day and day-of-week effects we can still explain a significant additional portion of the variation of the number of traffic jam reports with Google Trends and we can thus explain well over 80% of the variation of road conditions using Google search activity. A one percent increase in Google stau searches implies a .4 percent increase of traffic jams. Our paper is a proof of concept that aggregate, timely delivered behavioural data can help fine tune modern societies and prompts for more research with better, more disaggregated data in order to also achieve practical solutions. PMID:27571518

  5. Predicting Road Conditions with Internet Search.

    PubMed

    Askitas, Nikolaos

    2016-01-01

    Traffic congestion is an important problem both on an individual and on a societal level and much research has been done to explain and prevent their emergence. There are currently many systems which provide a reasonably good picture of actual road traffic by employing either fixed measurement points on highways or so called "floating car data" i.e. by using velocity and location data from roaming, networked, GPS enabled members of traffic. Some of these systems also offer forecasting of road conditions based on such historical data. To my knowledge there is as yet no system which offers advance notice on road conditions based on a signal which is guaranteed to occur in advance of these conditions and this is the novelty of this paper. Google Search intensity for the German word stau (i.e. traffic jam) peaks 2 hours ahead of the number of traffic jam reports as reported by the ADAC, a well known German automobile club and the largest of its kind in Europe. This is true both in the morning (7 am to 9 am) and in the evening (4 pm to 6 pm). The main result of this paper is then that after controlling for time-of-day and day-of-week effects we can still explain a significant additional portion of the variation of the number of traffic jam reports with Google Trends and we can thus explain well over 80% of the variation of road conditions using Google search activity. A one percent increase in Google stau searches implies a .4 percent increase of traffic jams. Our paper is a proof of concept that aggregate, timely delivered behavioural data can help fine tune modern societies and prompts for more research with better, more disaggregated data in order to also achieve practical solutions. PMID:27571518

  6. Environmental remote sensing using the advanced very high resolution radiometer (AVHRR). (Latest citations from the NTIS database). Published Search

    SciTech Connect

    Not Available

    1993-07-01

    The bibliography contains citations concerning the acquisition, processing, and applications of the Advanced Very High Resolution Radiometer (AVHRR) used on polar satellites operated by the National Oceanic and Atmospheric Administration (NOAA) for the Department of Commerce. AVHRR provides global visible and infrared imagery. The cited reports contain information on calibration, registration, and image processing of AVHRR data. Included are reports on AHVRR use in the study of aerosols, atmospheric circulation, agriculture, forest fires, deforestation, sun glint, sedimentation, cloud classification, sea ice, snowmelts, ocean productivity, sea surface temperatures, and vegetation. (Contains a minimum of 120 citations and includes a subject term index and title list.)

  7. Next-Generation Search Engines for Information Retrieval

    SciTech Connect

    Devarakonda, Ranjeet; Hook, Leslie A; Palanisamy, Giri; Green, James M

    2011-01-01

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

  8. Hough transform search for continuous gravitational waves

    SciTech Connect

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

    2004-10-15

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

  9. Planet X : The Search for an Illusion

    NASA Astrophysics Data System (ADS)

    McGaha, J.

    2006-10-01

    The search for Planet X began soon after the discovery of Uranus in 1781. The scientific search, over the next 200 years, resulted in the discovery of many new "Objects" (Planets and Minor Planets) but not the elusive Planet X. The data now indicate there never was a Planet X to find and the scientific search ended in the early 1990's. In the last 10 years the search has begun anew, not by scientists, interested in adding to our knowledge, but by groups advocating apocalyptic ideas. They have a wide following and are interested in promoting their pseudoscientific beliefs. This talk will discuss this history.

  10. Buddy: fusing multiple search results together

    NASA Astrophysics Data System (ADS)

    Salerno, John J.; Boulware, Doug M.; Myers, John E.; Khattri, Vishal; Corzillus, Dave R.

    2003-03-01

    If you have ever used a popular search engine on the Internet to search for a specific topic you are interested in, you know that most of the results you get back are unrelated, or do not have the information for which you are searching. Usually you end up looking through many Web pages before you find information. Different search engines give you different ranked results, so how do you choose which one to use? Buddy solves these problems for you. With Buddy you can search multiple search engines with many different queries. Using topic trees to create in depth search queries, utilizing the power of many renowned search engines, with the ability to dynamically create and delete them on the fly, Buddy gives you the results you want on the information you are looking for. Using its unique ranking algorithm the results from multiple search engines are correlated and fused together, removing multiple document hits. This paper will discuss the motivation for and the capabilities of Buddy.

  11. Smart internet search engine through 6W

    NASA Astrophysics Data System (ADS)

    Goehler, Stephen; Cader, Masud; Szu, Harold

    2006-04-01

    Current Internet search engine technology is limited in its ability to display necessary relevant information to the user. Yahoo, Google and Microsoft use lookup tables or indexes which limits the ability of users to find their desired information. While these companies have improved their results over the years by enhancing their existing technology and algorithms with specialized heuristics such as PageRank, there is a need for a next generation smart search engine that can effectively interpret the relevance of user searches and provide the actual information requested. This paper explores whether a smarter Internet search engine can effectively fulfill a user's needs through the use of 6W representations.

  12. Local search strategies for equational satisfiability.

    SciTech Connect

    Keefe, K.

    2004-09-21

    The search for models of an algebra is an important and demanding aspect of automated reasoning. Typically, a model is represented in the form of a matrix or a set of matrices. When a model is found that satisfies all the given theorems of an algebra, it is called a solution model. This paper considers algebras that can be represented by using a single operation, by way of the Sheffer stroke. The characteristic of needing only one operation to represent an algebra reduces the problem by requiring a search through all instances of a single matrix. This search is simple when the domain size is small, say 2, but for a larger domain size, say 10, the search space increases dramatically. Clearly, a method other than a brute-force, global search is desirable. Most modern model-finding programs use a global search; instead of checking every possible matrix, however a set of heuristics is used that allows the search space to be dramatically smaller and thus increases the likelihood of reaching a solution. An alternative approach is local search. This paper discusses several local search strategies that were applied to the problem of equational satisfiability.

  13. Pattern Search Methods for Linearly Constrained Minimization

    NASA Technical Reports Server (NTRS)

    Lewis, Robert Michael; Torczon, Virginia

    1998-01-01

    We extend pattern search methods to linearly constrained minimization. We develop a general class of feasible point pattern search algorithms and prove global convergence to a Karush-Kuhn-Tucker point. As in the case of unconstrained minimization, pattern search methods for linearly constrained problems accomplish this without explicit recourse to the gradient or the directional derivative. Key to the analysis of the algorithms is the way in which the local search patterns conform to the geometry of the boundary of the feasible region.

  14. On the Local Convergence of Pattern Search

    NASA Technical Reports Server (NTRS)

    Dolan, Elizabeth D.; Lewis, Robert Michael; Torczon, Virginia; Bushnell, Dennis M. (Technical Monitor)

    2000-01-01

    We examine the local convergence properties of pattern search methods, complementing the previously established global convergence properties for this class of algorithms. We show that the step-length control parameter which appears in the definition of pattern search algorithms provides a reliable asymptotic measure of first-order stationarity. This gives an analytical justification for a traditional stopping criterion for pattern search methods. Using this measure of first-order stationarity, we analyze the behavior of pattern search in the neighborhood of an isolated local minimizer. We show that a recognizable subsequence converges r-linearly to the minimizer.

  15. Search Engine Liability for Copyright Infringement

    NASA Astrophysics Data System (ADS)

    Fitzgerald, B.; O'Brien, D.; Fitzgerald, A.

    The chapter provides a broad overview to the topic of search engine liability for copyright infringement. In doing so, the chapter examines some of the key copyright law principles and their application to search engines. The chapter also provides a discussion of some of the most important cases to be decided within the courts of the United States, Australia, China and Europe regarding the liability of search engines for copyright infringement. Finally, the chapter will conclude with some thoughts for reform, including how copyright law can be amended in order to accommodate and realise the great informative power which search engines have to offer society.

  16. On Building a Search Interface Discovery System

    NASA Astrophysics Data System (ADS)

    Shestakov, Denis

    A huge portion of the Web known as the deep Web is accessible via search interfaces to myriads of databases on the Web. While relatively good approaches for querying the contents of web databases have been recently proposed, one cannot fully utilize them having most search interfaces unlocated. Thus, the automatic recognition of search interfaces to online databases is crucial for any application accessing the deep Web. This paper describes the architecture of the I-Crawler, a system for finding and classifying search interfaces. The I-Crawler is intentionally designed to be used in the deep web characterization surveys and for constructing directories of deep web resources.

  17. Knowledge Enhanced Searching on the Web

    NASA Astrophysics Data System (ADS)

    Jaffri, Afraz

    The move towards a semantic web has been in progress for many years and more recently there have been applications that make use of semantic web technology. One of the features that made the Web so easy to use is the ability to search web pages in a matter of seconds through the use of search engines. Now that the use of OWL and RDF as a knowledge representation format is increasing, the possibility appears to improve the quality of searching by using the semantic web to enhance the 'ordinary' Web. This paper outlines an architecture for using distributed knowledge bases to assist and improve searching on the web.

  18. An intelligent method for geographic Web search

    NASA Astrophysics Data System (ADS)

    Mei, Kun; Yuan, Ying

    2008-10-01

    While the electronically available information in the World-Wide Web is explosively growing and thus increasing, the difficulty to find relevant information is also increasing for search engine user. In this paper we discuss how to constrain web queries geographically. A number of search queries are associated with geographical locations, either explicitly or implicitly. Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance, bringing better targeted search results, and improving search user satisfaction. Our approach focus on both in the way geographic information is extracted from the web and, as far as we can tell, in the way it is integrated into query processing. This paper gives an overview of a spatially aware search engine for semantic querying of web document. It also illustrates algorithms for extracting location from web documents and query requests using the location ontologies to encode and reason about formal semantics of geographic web search. Based on a real-world scenario of tourism guide search, the application of our approach shows that the geographic information retrieval can be efficiently supported.

  19. Searching for SUSY at the Tevatron

    SciTech Connect

    Bortoletto, Daniela; /Purdue U.

    2004-12-01

    An overview of recent experimental searches for SUSY particles is presented. These searches are based on data collected by the CDF and the D0 experiments operating at the Fermilab Tevatron proton-antiproton collider with {radical}s = 1.96 TeV. The review focuses on searches for squarks and gluinos in final states with missing transverse energy and jets. Emphasis will be given to the search for the gluino decaying into a sbottom and b quark with each sbottom decaying into a b quark and a neutralino. This scenario yields events containing 4 b-jets and missing transverse energy.

  20. Markovian Search Games in Heterogeneous Spaces

    SciTech Connect

    Griffin, Christopher H

    2009-01-01

    We consider how to search for a mobile evader in a large heterogeneous region when sensors are used for detection. Sensors are modeled using probability of detection. Due to environmental effects, this probability will not be constant over the entire region. We map this problem to a graph search problem and, even though deterministic graph search is NP-complete, we derive a tractable, optimal, probabilistic search strategy. We do this by defining the problem as a differential game played on a Markov chain. We prove that this strategy is optimal in the sense of Nash. Simulations of an example problem illustrate our approach and verify our claims.

  1. Ratcheting Up The Search for Dark Matter

    SciTech Connect

    McDermott, Samuel Dylan

    2014-01-01

    The last several years have included remarkable advances in two of the primary areas of fundamental particle physics: the search for dark matter and the discovery of the Higgs boson. This dissertation will highlight some contributions made on the forefront of these exciting fields. Although the circumstantial evidence supporting the dark matter hypothesis is now almost undeniably significant, indisputable direct proof is still lacking. As the direct searches for dark matter continue, we can maximize our prospects of discovery by using theoretical techniques complementary to the observational searches to rule out additional, otherwise accessible parameter space. In this dissertation, I report bounds on a wide range of dark matter theories. The models considered here cover the spectrum from the canonical case of self-conjugate dark matter with weak-scale interactions, to electrically charged dark matter, to non-annihilating, non-fermionic dark matter. These bounds are obtained from considerations of astrophysical and cosmological data, including, respectively: diffuse gamma ray photon observations; structure formation considerations, along with an explication of the novel local dark matter structure due to galactic astrophysics; and the existence of old pulsars in dark-matter-rich environments. I also consider the prospects for a model of neutrino dark matter which has been motivated by a wide set of seemingly contradictory experimental results. In addition, I include a study that provides the tools to begin solving the speculative ``inverse'' problem of extracting dark matter properties solely from hypothetical nuclear energy spectra, which we may face if dark matter is discovered with multiple direct detection experiments. In contrast to the null searches for dark matter, we have the example of the recent discovery of the Higgs boson. The Higgs boson is the first fundamental scalar particle ever observed, and precision measurements of the production and decay of

  2. A directed search for extraterrestrial laser signals

    NASA Technical Reports Server (NTRS)

    Betz, A.

    1991-01-01

    The focus of NASA's Search for Extraterrestrial Intelligence (SETI) Program is on microwave frequencies, where receivers have the best sensitivities for the detection of narrowband signals. Such receivers, when coupled to existing radio telescopes, form an optimal system for broad area searches over the sky. For a directed search, however, such as toward specific stars, calculations show that infrared wavelengths can be equally as effective as radio wavelengths for establishing an interstellar communication link. This is true because infrared telescopes have higher directivities (gains) that effectively compensate for the lower sensitivities of infrared receivers. The result is that, for a given level of transmitted power, the signal to noise ratio for communications is equally as good at infrared and radio wavelengths. It should also be noted that the overall sensitivities of both receiver systems are quite close to their respective fundamental limits: background thermal noise for the radio frequency system and quantum noise for the infrared receiver. Consequently, the choice of an optimum communication frequency may well be determined more by the achievable power levels of transmitters rather than the ultimate sensitivities of receivers at any specific frequency. In the infrared, CO2 laser transmitters with power levels greater than 1 MW can already be built on Earth. For a slightly more advanced civilization, a similar but enormously more powerful laser may be possible using a planetary atmosphere rich in CO2. Because of these possibilities and our own ignorance of what is really the optimum search frequency, a search for narrowband signals at infrared frequencies should be a part of a balanced SETI Program. Detection of narrowband infrared signals is best done with a heterodyne receiver functionally identical to a microwave spectral line receiver. We have built such a receiver for the detection of CO2 laser radiation at wavelengths near 10 microns. The

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

    NASA Technical Reports Server (NTRS)

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

    1974-01-01

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

  4. Search times and probability of detection in time-limited search

    NASA Astrophysics Data System (ADS)

    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.

  5. End User Information Searching on the Internet: How Do Users Search and What Do They Search For? (SIG USE)

    ERIC Educational Resources Information Center

    Saracevic, Tefko

    2000-01-01

    Summarizes a presentation that discussed findings and implications of research projects using an Internet search service and Internet-accessible vendor databases, representing the two sides of public database searching: query formulation and resource utilization. Presenters included: Tefko Saracevic, Amanda Spink, Dietmar Wolfram and Hong Xie.…

  6. Comparing Web search engine performance in searching consumer health information: evaluation and recommendations.

    PubMed Central

    Wu, G; Li, J

    1999-01-01

    Identifying and accessing reliable, relevant consumer health information rapidly on the Internet may challenge the health sciences librarian and layperson alike. In this study, seven search engines are compared using representative consumer health topics for their content relevancy, system features, and attributes. The paper discusses evaluation criteria; systematically compares relevant results; analyzes performance in terms of the strengths and weaknesses of the search engines; and illustrates effective search engine selection, search formulation, and strategies. PMID:10550031

  7. A Hubble Space Telescope Advanced Camera for Surveys Search for Brown Dwarf Binaries in the Pleiades Open Cluster

    NASA Astrophysics Data System (ADS)

    Bouy, H.; Moraux, E.; Bouvier, J.; Brandner, W.; Martín, E. L.; Allard, F.; Baraffe, I.; Fernández, M.

    2006-02-01

    We present the results of a high-resolution imaging survey for brown dwarf binaries in the Pleiades open cluster. The observations were carried out with the Advanced Camera for Surveys (Pavlovsky and coworkers) on board the Hubble Space Telescope. Our sample consists of 15 bona fide brown dwarfs. We confirm two binaries and detect their orbital motion, but we did not resolve any new binary candidates in the separation range between 5.4 and 1700 AU and masses in the range 0.035-0.065 Msolar. Together with the results of our previous study (Martín and coworkers), we can derive a visual binary frequency of 13.3+13.7-4.3% for separations greater than 7 AU, masses in the range 0.055-0.065 Msolar, and mass ratios in the range 0.45-0.9

  8. Semantically enabled image similarity search

    NASA Astrophysics Data System (ADS)

    Casterline, May V.; Emerick, Timothy; Sadeghi, Kolia; Gosse, C. A.; Bartlett, Brent; Casey, Jason

    2015-05-01

    Georeferenced data of various modalities are increasingly available for intelligence and commercial use, however effectively exploiting these sources demands a unified data space capable of capturing the unique contribution of each input. This work presents a suite of software tools for representing geospatial vector data and overhead imagery in a shared high-dimension vector or embedding" space that supports fused learning and similarity search across dissimilar modalities. While the approach is suitable for fusing arbitrary input types, including free text, the present work exploits the obvious but computationally difficult relationship between GIS and overhead imagery. GIS is comprised of temporally-smoothed but information-limited content of a GIS, while overhead imagery provides an information-rich but temporally-limited perspective. This processing framework includes some important extensions of concepts in literature but, more critically, presents a means to accomplish them as a unified framework at scale on commodity cloud architectures.

  9. Search for Superconductivity in Micrometeorites

    PubMed Central

    Guénon, S.; Ramírez, J. G.; Basaran, Ali C.; Wampler, J.; Thiemens, M.; Taylor, S.; Schuller, Ivan K.

    2014-01-01

    We have developed a very sensitive, highly selective, non-destructive technique for screening inhomogeneous materials for the presence of superconductivity. This technique, based on phase sensitive detection of microwave absorption is capable of detecting 10−12 cc of a superconductor embedded in a non-superconducting, non-magnetic matrix. For the first time, we apply this technique to the search for superconductivity in extraterrestrial samples. We tested approximately 65 micrometeorites collected from the water well at the Amundsen-Scott South pole station and compared their spectra with those of eight reference materials. None of these micrometeorites contained superconducting compounds, but we saw the Verwey transition of magnetite in our microwave system. This demonstrates that we are able to detect electro-magnetic phase transitions in extraterrestrial materials at cryogenic temperatures. PMID:25476841

  10. Search for B- -> Ds+(*)- Phi

    SciTech Connect

    Aubert, B.; Barate, R.; Boutigny, D.; Couderc, F.; Karyotakis, Y.; Lees, J.P.; Poireau, V.; Tisserand, V.; Zghiche, A.; Grauges, E.; Palano, A.; Pappagallo, M.; Pompili, A.; Chen, J.C.; Qi, N.D.; Rong, G.; Wang, P.; Zhu, Y.S.; Eigen, G.; Ofte, I.; Stugu, B. /Bergen U. /LBL, Berkeley /UC, Berkeley /Birmingham U. /Ruhr U., Bochum /Bristol U. /British Columbia U. /Brunel U. /Novosibirsk, IYF /UC, Irvine /UCLA /UC, Riverside /UC, San Diego /UC, Santa Barbara /UC, Santa Cruz /Caltech /Cincinnati U. /Colorado U. /Colorado State U. /Dortmund U. /Dresden, Tech. U. /Ecole Polytechnique /Edinburgh U. /Ferrara U. /INFN, Ferrara /Frascati /Frascati /Perugia U. /Frascati /Genoa U. /INFN, Genoa /Harvard U. /Heidelberg U. /Imperial Coll., London /Iowa U. /Iowa State U. /Orsay, LAL /LLNL, Livermore /Liverpool U. /Queen Mary, U. of London /Royal Holloway, U. of London /Louisville U. /Manchester U. /Maryland U. /Massachusetts U., Amherst /MIT, LNS /McGill U. /Milan U. /INFN, Milan /Mississippi U. /Montreal U. /Mt. Holyoke Coll. /Naples U. /INFN, Naples /NIKHEF, Amsterdam /Notre Dame U. /Ohio State U. /Oregon U. /Padua U. /INFN, Padua /Paris U., VI-VII /Pennsylvania U. /Perugia U. /INFN, Perugia /Pisa U. /Pisa, Scuola Normale Superiore /INFN, Pisa /Prairie View A-M /Princeton U. /Rome U. /INFN, Rome /Rostock U. /Rutherford /DAPNIA, Saclay /South Carolina U. /SLAC /Stanford U., Phys. Dept. /SUNY, Albany /Tennessee U. /Texas U. /Texas U., Dallas /Turin U. /Turin Polytechnic /INFN, Turin /Trieste U. /INFN, Trieste /Valencia U., IFIC /Vanderbilt U. /Victoria U. /Warwick U. /Wisconsin U., Madison /Yale U.

    2005-07-06

    We report on searches for B{sup -} {yields} D{sub S}{sup -}{phi} and B{sup -} {yields} D*{sub S}{sup -}{phi}. In the context of the Standard Model the branching fractions for these decays are expected to be highly suppressed, since they proceed through annihilation of the b and {bar u} quarks in the B{sup -} meson. Our results are based on 234 million {Upsilon}(42) {yields} B{bar B} decays collected with the BABAR detector at SLAC. We find no evidence for these decays, and we set 90% confidence level upper limits on the branching fractions {Beta}(B{sup -} {yields} D{sub S}{sup -}{phi}) < 1.8 x 10{sup -6}; {Beta}(B{sup -} {yields} D*{sub S}{sup -}{phi}) < 1.1 x 10{sup -5}. These results are consistent with Standard Model expectations.

  11. The search for dark matter

    NASA Astrophysics Data System (ADS)

    Cline, David B.

    2016-03-01

    We discuss the search for dark matter. We first review the data from LUX that excludes the low-mass WIMP region and slightly lowers the XENON100 limits. We provide a brief review of the problems with the claimed low-mass signals. We discuss the current expectations for SUSY-WIMP dark matter and show why very massive detectors like Darwin may be required. We discuss some theoretical predictions from the meeting. There was compelling evidence from events observed in the Galactic Center by Fermi-LAT of WIMP dark matter at the UCLA meeting. We recount the Richard Arnowitt Lectures at UCLA dark matter symposiums and his role in the development of the strategy to detect SUGRA dark matter. In Honor of Richard Arnowitt.

  12. Searching for MACHOs with microlensing

    SciTech Connect

    Alcock, C.

    1996-04-01

    Baryonic matter, in the form of Machos (Massive Compact Halo Objects), might be a significant constituent of the dark matter that dominates the Milky Way. This article describes the experimental searches for Machos that exploit the gravitational microlens magnification of extragalactic stars. These surveys monitor millions of stars, in some cases every night, looking for magnification events. The early results from the surveys have yielded some spectacular events, and pose a significant new puzzle for galactic structure: toward the Large Magellanic Cloud we see fewer events than anticipated for a standard dark halo dominated by Machos, but toward the galactic bulge, the event rate is much higher than anticipated. This is a field of research that is ripe with opportunities for beginning (and senior) scientists.

  13. Gravitational microlensing searches and results

    SciTech Connect

    Alcock, C.

    1997-05-08

    Baryonic matter, in the form of Machos (MAssive Compact Halo Objects), might be a significant constituent of the dark matter that dominates the Milky Way. This article describes how surveys for Machos exploit the gravitational microlens magnification of extragalactic stars. The experimental searches for this effect monitor millions of stars, in some cases every night, looking for magnification events. The early results of these surveys indicate that Machos make up a significant fraction of the dark matter in the Milky Way, and that these objects have stellar masses. Truly substellar objects do not contribute much to the total. Additionally, the relatively high event rate towards the Galactic bulge seems to require that the bulge be elongated, and massive.

  14. Fixpoints and Search in PVS

    NASA Astrophysics Data System (ADS)

    Shankar, Natarajan

    The Knaster-Tarski theorem asserts the existence of least and greatest fixpoints for any monotonic function on a complete lattice. More strongly, it asserts the existence of a complete lattice of such fixpoints. This fundamental theorem has a fairly straightforward proof. We use a mechanically checked proof of the Knaster-Tarski theorem to illustrate several features of the Prototype Verification System (PVS). We specialize the theorem to the power set lattice, and apply the latter to the verification of a general forward search algorithm and a generalization of Dijkstra's shortest path algorithm. We use these examples to argue that the verification of even simple, widely used algorithms can depend on a fair amount of background theory, human insight, and sophisticated mechanical support.

  15. Multi-directional local search

    PubMed Central

    Tricoire, Fabien

    2012-01-01

    This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the multi-objective multi-dimensional knapsack problem, the bi-objective set packing problem and the bi-objective orienteering problem. Experimental results show that our method systematically provides solution sets of comparable quality with state-of-the-art methods applied to benchmark instances of these problems, within reasonable CPU effort. We conclude that the proposed algorithmic framework is a viable option when solving multi-objective optimization problems. PMID:25140071

  16. Hybrid Optimization Parallel Search PACKage

    2009-11-10

    HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework providesmore » a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.« less

  17. Radioastronomical Searches for Instellar Biomolecules

    NASA Technical Reports Server (NTRS)

    Kuan, Y.-J.; Huang, H.-C.; Charnley, S. B.; Markwick, A.; Botta, O.; Ehrenfreund, P.; Kisiel, Z.; Butner, H. M.

    2003-01-01

    Impacts of comets and asteroids could have delivered large amounts of organic matter to the early Earth. to retain a significant interstellar signature; observations of recent bright comets indicate that they have a molecular inventory consistent with their ices being largely unmodified interstellar material. Many simple organic molecules with biochemical significance observed in circumstellar envelopes and in molecular clouds, similar to that from which the Solar System formed, may have acted as the precursors of the more complex organics found in meteorites. Therefore, there is potentially a strong link between interstellar organics and prebiotic chemical evolution. Radioastronomical observations, particularly at millimeter wavelengths, allow us to determine the chemical composition and characteristics of the molecular inventory in interstellar space. Here we report some of our recent results from extensive astronomical searches for astrobiologically-important interstellar organics.

  18. Features in visual search combine linearly

    PubMed Central

    Pramod, R. T.; Arun, S. P.

    2014-01-01

    Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features (intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and co-activation models (based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features—in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search. PMID:24715328

  19. Superintendent Searches: Public or Confidential? Why Confidentiality Contributes to Quality Searches

    ERIC Educational Resources Information Center

    Attea, William J.

    2010-01-01

    When a highly qualified candidate learns the search will be conducted confidentially, a positive response is almost certain, in the author's experience running superintendent searches since 1988. Just as likely, the prospective candidate responds negatively to being told the search process will not be confidential. Confidentiality is the item of…

  20. The Pricing of Information--A Search-Based Approach to Pricing an Online Search Service.

    ERIC Educational Resources Information Center

    Boyle, Harry F.

    1982-01-01

    Describes innovative pricing structure consisting of low connect time fee, print fees, and search fees, offered by Chemical Abstracts Service (CAS) ONLINE--an online searching system used to locate chemical substances. Pricing options considered by CAS, the search-based pricing approach, and users' reactions to pricing structures are noted. (EJS)