Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SEARCH”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 811 records · Page 45

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

Advanced Natural Language Processing Tools for Web Information Retrieval, Content Analysis, and Synthesis. The goal of this SBIR was to implement and evaluate several advanced Natural Language Processing (NLP) tools and techniques to enhance the precision and relevance of search results by analyzing and augmenting search queries and by helping to organize the search output obtained from heterogeneous databases and web pages containing textual information of interest to DOE and the scientific-technical user communities in general. The SBIR investigated 1) the incorporation of spelling checkers in search applications, 2) identification of significant phrases and concepts using a combination of linguistic and statistical techniques, and 3) enhancement of the query interface and search retrieval results through the use of semantic resources, such as thesauri. A search program with a flexible query interface was developed to search reference databases with the objective of enhancing search results from web queries or queries of specialized search systems such as DOE's Information Bridge. The DOE ETDE/INIS Joint Thesaurus was processed to create a searchable database. Term frequencies and term co-occurrences were used to enhance the web information retrieval by providing algorithmically-derived objective criteria to organize relevant documents into clusters containing significant terms. A thesaurus provides an authoritative overview and classification of a field of knowledge. By organizing the results of a search using the thesaurus terminology, the output is more meaningful than when the results are just organized based on the terms that co-occur in the retrieved documents, some of which may not be significant. An attempt was made to take advantage of the hierarchy provided by broader and narrower terms, as well as other field-specific information in the thesauri. The search program uses linguistic morphological routines to find relevant entries regardless of whether terms are stored in singular or plural form. Implementation of additional inflectional morphology processes for verbs can enhance retrieval further, but this has to be balanced by the possibility of broadening the results too much. In addition to the DOE energy thesaurus, other sources of specialized organized knowledge such as the Medical Subject Headings (MeSH), the Unified Medical Language System (UMLS), and Wikipedia were investigated. The supporting role of the NLP thesaurus search program was enhanced by incorporating spelling aid and a part-of-speech tagger to cope with misspellings in the queries and to determine the grammatical roles of the query words and identify nouns for special processing. To improve precision, multiple modes of searching were implemented including Boolean operators, and field-specific searches. Programs to convert a thesaurus or reference file into searchable support files can be deployed easily, and the resulting files are immediately searchable to produce relevance-ranked results with builtin spelling aid, morphological processing, and advanced search logic. Demonstration systems were built for several databases, including the DOE energy thesaurus.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Retrieving and Ranking Unannotated Images through Collaboratively Mining Online Search Results

We present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consist of online image and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are utilized to estimate individual reference images relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of our method lies in its capability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, our algorithm infers the relevance of an online search result image to a text query. Once we estimate a query relevance score for each online image search result, we can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of our algorithm, we tested our algorithm both on the standard public image datasets and several modest sized personal photo collections. We also compared the performance of our method with that of two peer methods. The results are very positive, indicating that our algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of our algorithm comes from its collaborative mining over online search results both in the visual and textual domains.

99 GENERAL AND MISCELLANEOUS↗

Search for Lightly Ionizing Particles in SuperCDMS and simulation of neutron backgrounds

The Super Cryogenic Dark Matter Search (SuperCDMS) is a direct-detection dark matter search experiment that primarily aims to search for Weakly Interacting Massive Particles (WIMPs) using state-of-the-art solid-state detection technology. During its operation at the Soudan underground laboratory, germanium detectors were operated with high bias voltage mode known as the CDMS low ionization threshold experiment (CDMSlite) to achieve below-keV thresholds. CDMSlite, for being able to measure small energy depositions in detectors, also provides sensitivity to Lightly Ionizing Particles (LIPs) with very small fractional charges. This thesis will discuss an analysis to search LIPs with the data acquired in CDMSlite mode. An important component for LIPs search is the expected energy-deposition distributions for LIPs falling on the CDMSlite detector. In this thesis, a simulation framework to calculate the energy-deposition distributions is developed. This thesis presents first direct-detection limits on the intensity of cosmogenic LIPs with electric charges smaller than e /(3 × 10 5 ) as well as the strongest limits for charges ≤ e /160, with a minimum intensity of 1.36 × 10 -7 cm -2 s -1 sr -1 at charge e /160.In any rare-event search experiment, understanding background is crucial. Neutrons capable of mimicking dark matter signals are a major background for any dark matter search experiment. A simulation study to estimate the neutron background for an India based dark matter search experiment at Jaduguda Underground Science Laboratory (JUSL) is performed. The experiment at JUSL will be the first phase of a proposed Dark matter search at India-based Neutrino Observatory (DINO). It will be a direct detection experiment with primary aims to search for WIMPs as dark matter candidates. In this thesis, we discuss the methodology of estimating neutron flux at JUSL and report the results. The total neutron flux reaching the laboratory above 1 MeV energy threshold is found to be 5.76(±0.69) × 10 -6 cm -2 s -1 . The impact of neutron background on the sensitivity of the experiment to detect dark matter at JUSL is also discussed. The thesis is organized as follows. Chapter 1 provides a brief introduction to the Lightly Ionizing Particle (LIPs). The analysis to search LIPs in SuperCDMS is briefly outlined in the chapter. This chapter also discusses the importance of neutron background estimates in a dark matter search experiment, more specifically, in the context of a proposed India-based dark matter search experiment at Jaduguda Underground Science Laboratory. In Chapter 2, the SuperCDMS experiment is introduced. In Chapter 3, the framework developed to perform simulations for Lightly Ionizing Particles is presented. In Chapter 4, the LIPs search analysis with the CDMSlite data and the results are discussed. In Chapter 5, the simulation of neutron background and the feasibility of dark-matter search at JUSL is discussed. Finally, conclusions from all the results discussed in this thesis are presented in Chapter 6.

Banik, Samir↗

Search for lightly ionizing particles in superCDMS and simulation of neutron backgrounds

The Super Cryogenic Dark Matter Search (SuperCDMS) is a direct-detection dark matter search experiment that primarily aims to search for Weakly Interacting Massive Particles (WIMPs) using state-of-the-art solid-state detection technology. During its operation at the Soudan underground laboratory, germanium detectors were operated with high bias voltage mode known as the CDMS low ionization threshold experiment (CDMSlite) to achieve below-keV thresholds. CDMSlite, for being able to measure small energy depositions in detectors, also provides sensitivity to Lightly Ionizing Particles (LIPs) with very small fractional charges. This thesis will discuss an analysis to search LIPs with the data acquired in CDMSlite mode. An important component for LIPs search is the expected energy-deposition distributions for LIPs falling on the CDMSlite detector. In this thesis, a simulation framework to calculate the energy-deposition distributions is developed. This thesis presents first direct-detection limits on the intensity of cosmogenic LIPs with electric charges smaller than e/(3 × 105) as well as the strongest limits for charges ≤ e/160, with a minimum intensity of 1.36 × 10-7 cm-2s-1sr-1 at charge e/160.In any rare-event search experiment, understanding background is crucial. Neutrons capable of mimicking dark matter signals are a major background for any dark matter search experiment. A simulationmore » study to estimate the neutron background for an India based dark matter search experiment at Jaduguda Underground Science Laboratory (JUSL) is performed. The experiment at JUSL will be the first phase of a proposed Dark matter search at India-based Neutrino Observatory (DINO). It will be a direct detection experiment with primary aims to search for WIMPs as dark matter candidates. In this thesis, we discuss the methodology of estimating neutron flux at JUSL and report the results. The total neutron flux reaching the laboratory above 1 MeV energy threshold is found to be 5.76(±0.69) × 10-6 cm-2s-1. The impact of neutron background on the sensitivity of the experiment to detect dark matter at JUSL is also discussed. The thesis is organized as follows. Chapter 1 provides a brief introduction to the Lightly Ionizing Particle (LIPs). The analysis to search LIPs in SuperCDMS is briefly outlined in the chapter. This chapter also discusses the importance of neutron background estimates in a dark matter search experiment, more specifically, in the context of a proposed India-based dark matter search experiment at Jaduguda Underground Science Laboratory. In Chapter 2, the SuperCDMS experiment is introduced. In Chapter 3, the framework developed to perform simulations for Lightly Ionizing Particles is presented. In Chapter 4, the LIPs search analysis with the CDMSlite data and the results are discussed. In Chapter 5, the simulation of neutron background and the feasibility of dark-matter search at JUSL is discussed. Finally, conclusions from all the results discussed in this thesis are presented in Chapter 6.« less

Banik, Samir↗

Stride search: A general algorithm for storm detection in high-resolution climate data

This study discusses the problem of identifying extreme climate events such as intense storms within large climate data sets. The basic storm detection algorithm is reviewed, which splits the problem into two parts: a spatial search followed by a temporal correlation problem. Two specific implementations of the spatial search algorithm are compared: the commonly used grid point search algorithm is reviewed, and a new algorithm called Stride Search is introduced. The Stride Search algorithm is defined independently of the spatial discretization associated with a particular data set. Results from the two algorithms are compared for the application of tropical cyclone detection, and shown to produce similar results for the same set of storm identification criteria. Differences between the two algorithms arise for some storms due to their different definition of search regions in physical space. The physical space associated with each Stride Search region is constant, regardless of data resolution or latitude, and Stride Search is therefore capable of searching all regions of the globe in the same manner. Stride Search's ability to search high latitudes is demonstrated for the case of polar low detection. Wall clock time required for Stride Search is shown to be smaller than a grid point search of the same data, and the relative speed up associated with Stride Search increases as resolution increases.

54 ENVIRONMENTAL SCIENCES↗

NASA Taxonomies for Searching Problem Reports and FMEAs

Many types of hazard and risk analyses are used during the life cycle of complex systems, including Failure Modes and Effects Analysis (FMEA), Hazard Analysis, Fault Tree and Event Tree Analysis, Probabilistic Risk Assessment, Reliability Analysis and analysis of Problem Reporting and Corrective Action (PRACA) databases. The success of these methods depends on the availability of input data and the analysts knowledge. Standard nomenclature can increase the reusability of hazard, risk and problem data. When nomenclature in the source texts is not standard, taxonomies with mapping words (sets of rough synonyms) can be combined with semantic search to identify items and tag them with metadata based on a rich standard nomenclature. Semantic search uses word meanings in the context of parsed phrases to find matches. The NASA taxonomies provide the word meanings. Spacecraft taxonomies and ontologies (generalization hierarchies with attributes and relationships, based on terms meanings) are being developed for types of subsystems, functions, entities, hazards and failures. The ontologies are broad and general, covering hardware, software and human systems. Semantic search of Space Station texts was used to validate and extend the taxonomies. The taxonomies have also been used to extract system connectivity (interaction) models and functions from requirements text. Now the Reconciler semantic search tool and the taxonomies are being applied to improve search in the Space Shuttle PRACA database, to discover recurring patterns of failure. Usual methods of string search and keyword search fall short because the entries are terse and have numerous shortcuts (irregular abbreviations, nonstandard acronyms, cryptic codes) and modifier words cannot be used in sentence context to refine the search. The limited and fixed FMEA categories associated with the entries do not make the fine distinctions needed in the search. The approach assigns PRACA report titles to problem classes in the taxonomy. Each ontology class includes mapping words - near-synonyms naming different manifestations of that problem class. The mapping words for Problems, Entities and Functions are converted to a canonical form plus any of a small set of modifier words (e.g. non-uniformity NOT + UNIFORM.) The report titles are parsed as sentences if possible, or treated as a flat sequence of word tokens if parsing fails. When canonical forms in the title match mapping words, the PRACA entry is associated with the corresponding Problem, Entity or Function in the ontology. The user can search for types of failures associated with types of equipment, clustering by type of problem (e.g., all bearings found with problems of being uneven: rough, irregular, gritty ). The results could also be used for tagging PRACA report entries with rich metadata. This approach could also be applied to searching and tagging failure modes, failure effects and mitigations in FMEAs. In the pilot work, parsing 52K+ truncated titles (the test cases that were available), has resulted in identification of both a type of equipment and type of problem in about 75% of the cases. The results are displayed in a manner analogous to Google search results. The effort has also led to the enrichment of the taxonomy, adding some new categories and many new mapping words. Further work would make enhancements that have been identified for improving the clustering and further reducing the false alarm rate. (In searching for recurring problems, good clustering is more important than reducing false alarms). Searching complete PRACA reports should lead to immediate improvement.

Malin, Jane T.↗

Next-Generation Search Engines for Information Retrieval

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 centralized index. The harvested files are indexed against SOLR search API consistently, so that it can render search capabilities such as simple, fielded, spatial and temporal searches across a span of projects ranging from land, atmosphere, and ocean ecology. Mercury also provides data sharing capabilities using Open Archive Initiatives Protocol for Metadata Handling (OAI-PMH). In this paper we will discuss about the best practices for archiving data and metadata, new searching techniques, efficient ways of data retrieval and information display.

99 GENERAL AND MISCELLANEOUS↗

Implementation of Material and Geometry Criticality Search in RMC Code

RMC is a continuous-energy Reactor Monte Carlo neutron and photon transport code being developed by Department of Engineering Physics at Tsinghua University, Beijing. For the use of simulation of reactor control or design of reactor with unknown material and geometry parameters, an accurate and efficient method of eigenvalue search is implemented in RMC code. The eigenvalue search focuses on two types of parameters. One is nuclide atom density, called material search, which includes the fuel density, enrichment or boron concentration. Perturbation theory of Monte Carlo Code, like differential operator method and adjoint-weighted perturbation method has been widely researched in sensitivity and uncertainty study. For material search, the perturbation algorithm needs to coupled with flexible material control block and optimized strategy. The other type of parameter is surface position, called geometry search, which includes fuel rod diameter, pitch and control rod position. MC21 iterated on surface position based on bisection method or regula-falsi method, and directly recalculated k-eff until it converged to target error interval. In this paper, the differential operator method, improved Newton-Raphson method is introduced. Based on these methods, the global material search is implemented. Then based on material search and finite method, global geometry search is implement. Finally, fuel enrichment, boron concentration and control rod position in normal PWR assembly are searched. The results show that RMC can search material and geometry parameters accurately and efficiently. In this paper, global eigenvalue search of material and geometry parameters have been implemented in RMC code. They are based on the differential operator method in Monte Carlo perturbation theory. The differential operator method samples δk/δρ{sub r}, δ{sup 2}k/δρ{sub r}{sup 2} along with k-eff estimator. Therefore it won't take up too much additional computational resource. For homogeneous material search, fission source effect has little effect of accuracy and can be ignored. The results of fuel enrichment and boron concentration searches in assembly show that improved Newton-Raphson method can iterate efficiently until k-eff is in the error interval. Based on material search and finite difference formula, the geometry parameter, like control rod axial position, can iterate until k-eff is in the error interval. However, the tiny perturbed region may not contain enough tracks to simulate. Besides, the large number density's relative change up to -1 may cause underestimation of Δk-eff, and then slope of k-x curve. This will cause non-convergence for Newton- Raphson method. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An MPI + $X$ implementation of contact global search using Kokkos

This paper describes an approach that seeks to parallelize the spatial search associated with computational contact mechanics. In contact mechanics, the purpose of the spatial search is to find “nearest neighbors,” which is the prelude to an imprinting search that resolves the interactions between the external surfaces of contacting bodies. In particular, we are interested in the contact global search portion of the spatial search associated with this operation on domain-decomposition-based meshes. Specifically, we describe an implementation that combines standard domain-decomposition-based MPI-parallel spatial search with thread-level parallelism (MPI-X) available on advanced computer architectures (those with GPU coprocessors). Our goal is to demonstrate the efficacy of the MPI-X paradigm in the overall contact search. Standard MPI-parallel implementations typically use a domain decomposition of the external surfaces of bodies within the domain in an attempt to efficiently distribute computational work. This decomposition may or may not be the same as the volume decomposition associated with the host physics. The parallel contact global search phase is then employed to find and distribute surface entities (nodes and faces) that are needed to compute contact constraints between entities owned by different MPI ranks without further inter-rank communication. Key steps of the contact global search include computing bounding boxes, building surface entity (node and face) search trees and finding and distributing entities required to complete on-rank (local) spatial searches. To enable source-code portability and performance across a variety of different computer architectures, we implemented the algorithm using the Kokkos hardware abstraction library. While we targeted development towards machines with a GPU accelerator per MPI rank, we also report performance results for OpenMP with a conventional multi-core compute node per rank. Results here demonstrate a 47 % decrease in the time spent within the global search algorithm, comparing the reference ACME algorithm with the GPU implementation, on an 18M face problem using four MPI ranks. As a result, while further work remains to maximize performance on the GPU, this result illustrates the potential of the proposed implementation.

97 MATHEMATICS AND COMPUTING↗

Search Enhancements using Natural Language Processing Techniques

NASA Goddard Earth Sciences Data and Information Services Center (GESDISC) is one of the 12 NASA Science Mission Directorate Data Centers. The main goal of GESDISC is to provide earth science data, information, and services to the earth science data community. Consequently, data discovery is at the center of our mission and our search engine is the primary tool for our users to interact, find, and access our data. Existing search approaches are largely focused on hard-matching of keywords in the search query with dataset metadata. Here we propose to expand the search by introducing a complementary natural language processing (NLP) search. At the heart of our proposed NLP search, we trained a joint embedding using scientific text corpus and a curated set of dataset metadata. The embedding learns the association between words in our dataset metadata and those of the scientific text corpus. This enables us to go beyond simple hard-matching of a query and data set metadata and have a notion of “similarity” between the search query and the datasets. We further integrated our NLP search into the Elastic Search (ES) framework leveraging similarity search capabilities offered through the “dense_vector” field type. Our preliminary evaluations show that our proposed NLP search has the potential to be utilized to complement the existing search engine and serve as a base for a dataset recommendation system.

Armin Mehrabian↗

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗

A Search Model for Imperfectly Detected Targets

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.

Ahumada, Albert↗

The Influence of the Number of Tree Searches on Maximum Likelihood Inference in Phylogenomics

Maximum likelihood (ML) phylogenetic inference is widely used in phylogenomics. As heuristic searches most likely find suboptimal trees, it is recommended to conduct multiple (e.g., 10) tree searches in phylogenetic analyses. However, beyond its positive role, how and to what extent multiple tree searches aid ML phylogenetic inference remains poorly explored. Here, we found that a random starting tree was not as effective as the BioNJ and parsimony starting trees in inferring the ML gene tree and that RAxML-NG and PhyML were less sensitive to different starting trees than IQ-TREE. We then examined the effect of the number of tree searches on ML tree inference with IQ-TREE and RAxML-NG, by running 100 tree searches on 19,414 gene alignments from 15 animal, plant, and fungal phylogenomic datasets. We found that the number of tree searches substantially impacted the recovery of the best-of-100 ML gene tree topology among 100 searches for a given ML program. In addition, all of the concatenation-based trees were topologically identical if the number of tree searches was ≥10. Quartet-based ASTRAL trees inferred from 1 to 80 tree searches differed topologically from those inferred from 100 tree searches for 6/15 phylogenomic datasets. Lastly, our simulations showed that gene alignments with lower difficulty scores had a higher chance of finding the best-of-100 gene tree topology and were more likely to yield the correct trees.

59 BASIC BIOLOGICAL SCIENCES↗

TIME-DEPENDENT SEARCHES FOR POINT SOURCES OF NEUTRINOS WITH THE 40-STRING AND 22-STRING CONFIGURATIONS OF ICECUBE

This paper presents four searches for flaring sources of neutrinos using the IceCube neutrino telescope. For the first time, a search is performed over the entire parameter space of energy, direction, and time with sensitivity to neutrino flares lasting between 20 {mu}s and a year duration from astrophysical sources. Searches that integrate over time are less sensitive to flares because they are affected by a larger background of atmospheric neutrinos and muons that can be reduced by the use of additional timing information. Flaring sources considered here, such as active galactic nuclei, soft gamma-ray repeaters, and gamma-ray bursts, are promising candidate neutrino emitters. Two searches are 'untriggered' in the sense that they look for any possible flare in the entire sky and from a predefined catalog of sources from which photon flares have been recorded. The other two searches are triggered by multi-wavelength information on flares from blazars and from a soft gamma-ray repeater. One triggered search uses lightcurves from Fermi-LAT which provides continuous monitoring. A second triggered search uses information where the flux states have been measured only for short periods of time near the flares. The untriggered searches use data taken by 40 strings of IceCube between 2008 April 5 and 2009 May 20. The triggered searches also use data taken by the 22-string configuration of IceCube operating between 2007 May 31 and 2008 April 5. The results from all four searches are compatible with a fluctuation of the background.

79 ASTRONOMY AND ASTROPHYSICS↗

ISE: An Integrated Search Environment. The manual

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.

Chu, Lon-Chan↗

Time-Dependent Searches for Point Sources of Neutrinos with the 40-String and 22-String Configurations of IceCube

This paper presents four searches for flaring sources of neutrinos using the IceCube neutrino telescope. For the first time, a search is performed over the entire parameter space of energy, direction and time with sensitivity to neutrino flares lasting between 20 microseconds and a year duration from astrophysical sources. Searches which integrate over time are less sensitive to flares because they are affected by a larger background of atmospheric neutrinos and muons that can be reduced by the use of additional timing information. Flaring sources considered here, such as active galactic nuclei, soft gamma ray repeaters and gamma-ray bursts, are promising candidate neutrino emitters. Two searches are untriggered in the sense that they look for any possible flare in the entire sky and from a predefined catalog of sources from which photon flares have been recorded. The other two searches are triggered by multi-wavelength information on flares from blazars and from a soft gamma-ray repeater. One triggered search uses lightcurves from Fermi-LAT which provides continuous monitoring. A second triggered search uses information where the flux states have been measured only for short periods of time near the flares. The untriggered searches use data taken by 40 strings of IceCube between Apr 5, 2008 and May 20, 2009. The triggered searches also use data taken by the 22-string configuration of IceCube operating between May 31, 2007 and Apr 5, 2008. The results from all four searches are compatible with a fluctuation of the background.

Stamatikos, M.↗

Time-Dependent Searches for Point Sources of Neutrinos with the 4O-String and 22-String Configurations of IceCube

This paper presents four searches for flaring sources of neutrinos using the IceCube neutrino telescope. For the first time, a search is performed over the entire parameter space of energy, direction, and time with sensitivity to neutrino flares lasting between 20 micro-s and a year duration from astrophysical sources. Searches that integrate over time are less sensitive to flares because they are affected by a larger background of atmospheric neutrinos and muons that can be reduced by the use of additional timing information. Flaring sources considered here, such as active galactic nuclei, soft gamma-ray repeaters, and gamma-ray bursts, are promising candidate neutrino emitters. Two searches are "untriggered" in the sense that they look for any possible flare in the entire sky and from a predefined catalog of sources from which photon flares have been recorded. The other two searches are triggered by multi-wavelength information on flares from blazars and from a soft gamma-ray repeater. One triggered search uses lightcurves from Fermi-LAT which provides continuous monitoring. A second triggered search uses information where the flux states have been measured only for short periods of time near the flares. The untriggered searches use data taken by 40 strings of IceCube between 2008 April 5 and 2009 May 20. The triggered searches also use data taken by the 22-string configuration of IceCube operating between 2007 May 31 and 2008 April 5. The results from all four searches are compatible with a fluctuation of the background.

Abbasi, R.↗

Non-SUSY Searches at the Tevatron

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.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗