An Analysis of the Impact of Federated Search Products on Library Instruction Using the ACRL Standards

ERIC Educational Resources Information Center

Cox, Christopher

2006-01-01

Federated search products are becoming more and more prevalent in academic libraries. What are the implications of this phenomenon for instruction librarians? An analysis of federated search products using the "Information Literacy Competency Standards for Higher Education" and a thorough review of the literature offer insight concerning whether…

Adjacency and Proximity Searching in the Science Citation Index and Google

DTIC Science & Technology

2005-01-01

major database search engines , including commercial S&T database search engines (e.g., Science Citation Index (SCI), Engineering Compendex (EC...PubMed, OVID), Federal agency award database search engines (e.g., NSF, NIH, DOE, EPA, as accessed in Federal R&D Project Summaries), Web search Engines (e.g...searching. Some database search engines allow strict constrained co- occurrence searching as a user option (e.g., OVID, EC), while others do not (e.g., SCI

DTIC: Your Key to DoD Scientific & Technical Information

DTIC Science & Technology

2009-06-01

DTIC Online Unclassified on SIPRNET • DTIC Online Access Controlled Near Completion http://www.dtic.mil/dtic/ DTIC MultiSearch: Enhanced Federated ... Search MultiSearch – searches more than 400 DoD, federal, commercial & international S&T sources from 50 countries DTIC Online Unclassified on

Federated Space-Time Query for Earth Science Data Using OpenSearch Conventions

NASA Astrophysics Data System (ADS)

Lynnes, C.; Beaumont, B.; Duerr, R. E.; Hua, H.

2009-12-01

The past decade has seen a burgeoning of remote sensing and Earth science data providers, as evidenced in the growth of the Earth Science Information Partner (ESIP) federation. At the same time, the need to combine diverse data sets to enable understanding of the Earth as a system has also grown. While the expansion of data providers is in general a boon to such studies, the diversity presents a challenge to finding useful data for a given study. Locating all the data files with aerosol information for a particular volcanic eruption, for example, may involve learning and using several different search tools to execute the requisite space-time queries. To address this issue, the ESIP federation is developing a federated space-time query framework, based on the OpenSearch convention (www.opensearch.org), with Geo and Time extensions. In this framework, data providers publish OpenSearch Description Documents that describe in a machine-readable form how to execute queries against the provider. The novelty of OpenSearch is that the space-time query interface becomes both machine callable and easy enough to integrate into the web browser's search box. This flexibility, together with a simple REST (HTTP-get) interface, should allow a variety of data providers to participate in the federated search framework, from large institutional data centers to individual scientists. The simple interface enables trivial querying of multiple data sources and participation in recursive-like federated searches--all using the same common OpenSearch interface. This simplicity also makes the construction of clients easy, as does existing OpenSearch client libraries in a variety of languages. Moreover, a number of clients and aggregation services already exist and OpenSearch is already supported by a number of web browsers such as Firefox and Internet Explorer.

Drexel at TREC 2014 Federated Web Search Track

DTIC Science & Technology

2014-11-01

of its input RS results. 1. INTRODUCTION Federated Web Search is the task of searching multiple search engines simultaneously and combining their...or distributed properly[5]. The goal of RS is then, for a given query, to select only the most promising search engines from all those available. Most...result pages of 149 search engines . 4000 queries are used in building the sample set. As a part of the Vertical Selection task, search engines are

Looking for a New Sport That Pays Well? Consider the Game of Federal Job Search.

ERIC Educational Resources Information Center

Troutman, Kathryn Kraemer

This paper compares searching for a Federal Job to taking up a new sport. Becoming good at a sport takes lessons and coaching, study of the rules, practice, investment in equipment and special clothes, time to play, scheduling, and ongoing interest with friend who enjoy the same sport. An Expert Player/Jobseeker in the Federal Job Search System…

Strategic Plan 2011 to 2016

DTIC Science & Technology

2011-02-01

search capability for Air Force Research Information Management System (AFRIMS) data as a part of federated search under DTIC Online Access...provide vetted requests to dataset owners. • Develop a federated search capability for databases containing limited distribution material. • Deploy

77 FR 36583 - NRC Form 5, Occupational Dose Record for a Monitoring Period

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-19

... methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2012... following methods: Federal Rulemaking Web Site: Go to http://www.regulations.gov and search for Docket ID... begin the search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search...

The Future of Federated Search, or What Will the World Look like in 10 Years

ERIC Educational Resources Information Center

Turner, Rich

2009-01-01

In this article, the author contends that in 10 years, federated search--or search of any kind for that matter--won't exist. He elaborates that the "function" of search will exist--but not in a context with which anyone is familiar today. So if "search" doesn't exist in 2018, how will people find the information that they need across vast volumes…

The Department of Defense Net-Centric Data Strategy: Implementation Requires a Joint Community of Interest (COI) Working Group and Joint COI Oversight Council

DTIC Science & Technology

2007-05-17

metadata formats, metadata repositories, enterprise portals and federated search engines that make data visible, available, and usable to users...and provides the metadata formats, metadata repositories, enterprise portals and federated search engines that make data visible, available, and...develop an enterprise- wide data sharing plan, establishment of mission area governance processes for CIOs, DISA development of federated search specifications

78 FR 5838 - NRC Enforcement Policy

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-28

... submit comments by any of the following methods: Federal Rulemaking Web site: Go to http://www... of the following methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search... the search, select ``ADAMS Public Documents'' and then select ``Begin Web-based ADAMS Search.'' For...

Human Interface to Netcentricity

DTIC Science & Technology

2006-06-01

experiencing. This is a radically different approach than using a federated search engine to bring back all relevant documents. The search engine...not be any closer to answering their question. More importantly, if they only have access to a 22 federated search , the program does not have the

Google vs. the Library (Part II): Student Search Patterns and Behaviors When Using Google and a Federated Search Tool

ERIC Educational Resources Information Center

Georgas, Helen

2014-01-01

This study examines the information-seeking behavior of undergraduate students within a research context. Student searches were recorded while the participants used Google and a library (federated) search tool to find sources (one book, two articles, and one other source of their choosing) for a selected topic. The undergraduates in this study…

Integrating Multilevel Command and Control into a Service Oriented Architecture to Provide Cross Domain Capability

DTIC Science & Technology

2006-06-01

Horizontal Fusion, the JCDX team developed two web services, a Classification Policy Decision Service (cPDS), and a Federated Search Provider (FSP...The cPDS web service primarily provides other systems with methods for handling labeled data such as label comparison. The federated search provider...level domains. To provide defense-in-depth, cPDS and the Federated Search Provider are implemented on a separate server known as the JCDX Web

SHIFT: Shared Information Framework and Technology Concept

DTIC Science & Technology

2009-02-01

easy to get an overview of all those tasks what is happening around each mission. Federated Search allows actors to search multiple data sources...is sent to every individual database in the portal or federated search list. 4.7. SHIFT and the world around it The idea in SHIFT is to enable

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.

Implementing the Army NetCentric Data Strategy in a ServiceOriented Environment

DTIC Science & Technology

2009-04-23

D a t a D i s c o v e r y Data Retrieval Data Subscription Data Discovery D a t a A c c e s s Artifact Discovery Federated Search Data Search Data...define common interfaces to search and  retrieve data across the enterprise.  • Patterns • Search • Status • Receive – Services • Federated   Search • Artifact

Federal Public Health Actions - PHE

Science.gov Websites

and reload this page. Skip over global navigation links U.S. Department of Health and Human Services Health Emergency - Leading a Nation Prepared Search Search PHE Home > PHE Newsroom > Federal Public Health Actions Federal Public Health Actions Main Content April 20, 2018: Renewal of Determination that a

A Search for the Right Answer.

ERIC Educational Resources Information Center

Dowling-Sendor, Benjamin

2002-01-01

A federal case from Georgia about strip-searches of fifth-grade students for a missing $26 was appealed to the 11th Circuit Court. The 11th Circuit affirmed the district court that the strip searches were unconstitutional but that certain federal law rules shielded the school employees, a police officer, the school district, and the county from…

Distributed Multi-interface Catalogue for Geospatial Data

NASA Astrophysics Data System (ADS)

Nativi, S.; Bigagli, L.; Mazzetti, P.; Mattia, U.; Boldrini, E.

2007-12-01

Several geosciences communities (e.g. atmospheric science, oceanography, hydrology) have developed tailored data and metadata models and service protocol specifications for enabling online data discovery, inventory, evaluation, access and download. These specifications are conceived either profiling geospatial information standards or extending the well-accepted geosciences data models and protocols in order to capture more semantics. These artifacts have generated a set of related catalog -and inventory services- characterizing different communities, initiatives and projects. In fact, these geospatial data catalogs are discovery and access systems that use metadata as the target for query on geospatial information. The indexed and searchable metadata provide a disciplined vocabulary against which intelligent geospatial search can be performed within or among communities. There exists a clear need to conceive and achieve solutions to implement interoperability among geosciences communities, in the context of the more general geospatial information interoperability framework. Such solutions should provide search and access capabilities across catalogs, inventory lists and their registered resources. Thus, the development of catalog clearinghouse solutions is a near-term challenge in support of fully functional and useful infrastructures for spatial data (e.g. INSPIRE, GMES, NSDI, GEOSS). This implies the implementation of components for query distribution and virtual resource aggregation. These solutions must implement distributed discovery functionalities in an heterogeneous environment, requiring metadata profiles harmonization as well as protocol adaptation and mediation. We present a catalog clearinghouse solution for the interoperability of several well-known cataloguing systems (e.g. OGC CSW, THREDDS catalog and data services). The solution implements consistent resource discovery and evaluation over a dynamic federation of several well-known cataloguing and inventory systems. Prominent features include: 1)Support to distributed queries over a hierarchical data model, supporting incremental queries (i.e. query over collections, to be subsequently refined) and opaque/translucent chaining; 2)Support to several client protocols, through a compound front-end interface module. This allows to accommodate a (growing) number of cataloguing standards, or profiles thereof, including the OGC CSW interface, ebRIM Application Profile (for Core ISO Metadata and other data models), and the ISO Application Profile. The presented catalog clearinghouse supports both the opaque and translucent pattern for service chaining. In fact, the clearinghouse catalog may be configured either to completely hide the underlying federated services or to provide clients with services information. In both cases, the clearinghouse solution presents a higher level interface (i.e. OGC CSW) which harmonizes multiple lower level services (e.g. OGC CSW, WMS and WCS, THREDDS, etc.), and handles all control and interaction with them. In the translucent case, client has the option to directly access the lower level services (e.g. to improve performances). In the GEOSS context, the solution has been experimented both as a stand-alone user application and as a service framework. The first scenario allows a user to download a multi-platform client software and query a federation of cataloguing systems, that he can customize at will. The second scenario support server-side deployment and can be flexibly adapted to several use-cases, such as intranet proxy, catalog broker, etc.

Implementing the Army NetCentric Data Strategy in a ServiceOriented Environment

DTIC Science & Technology

2009-04-23

a Data Subscriptionc c e s s Federated Search Data Search D a t a A b s t r a c t i o n Adapter Configuration Adapter Data Service D a t a S e r...across t e enterpr se.  • Patterns • Search • Status • Receive – Services • Federated   Search • Artifact Discovery • Data Discovery 17 Data Discovery

OpenSearch (ECHO-ESIP) & REST API for Earth Science Data Access

NASA Astrophysics Data System (ADS)

Mitchell, A.; Cechini, M.; Pilone, D.

2010-12-01

This presentation will provide a brief technical overview of OpenSearch, the Earth Science Information Partners (ESIP) Federated Search framework, and the REST architecture; discuss NASA’s Earth Observing System (EOS) ClearingHOuse’s (ECHO) implementation lessons learned; and demonstrate the simplified usage of these technologies. SOAP, as a framework for web service communication has numerous advantages for Enterprise applications and Java/C# type programming languages. As a technical solution, SOAP has been a reliable framework on top of which many applications have been successfully developed and deployed. However, as interest grows for quick development cycles and more intriguing “mashups,” the SOAP API loses its appeal. Lightweight and simple are the vogue characteristics that are sought after. Enter the REST API architecture and OpenSearch format. Both of these items provide a new path for application development addressing some of the issues unresolved by SOAP. ECHO has made available all of its discovery, order submission, and data management services through a publicly accessible SOAP API. This interface is utilized by a variety of ECHO client and data partners to provide valuable capabilities to end users. As ECHO interacted with current and potential partners looking to develop Earth Science tools utilizing ECHO, it became apparent that the development overhead required to interact with the SOAP API was a growing barrier to entry. ECHO acknowledged the technical issues that were being uncovered by its partner community and chose to provide two new interfaces for interacting with the ECHO metadata catalog. The first interface is built upon the OpenSearch format and ESIP Federated Search framework. Leveraging these two items, a client (ECHO-ESIP) was developed with a focus on simplified searching and results presentation. The second interface is built upon the Representational State Transfer (REST) architecture. Leveraging the REST architecture, a new API has been made available that will provide access to the entire SOAP API suite of services. The results of these development activities has not only positioned to engage in the thriving world of mashup applications, but also provided an excellent real-world case study of how to successfully leverage these emerging technologies.

Distributed Multisearch and Resource Selection for the TREC Million Query Track

DTIC Science & Technology

2008-11-01

performance  of  distributed  information  retrieval  applications  such  as  metasearch  [1],  federated   search   [2],  and  collection  sampling  [3...years,  the  ARSC  system  performance  is  below  the  TREC  median,  due  in  part  to  the  additional difficulty involved in a  federated   search   and...effective metasearch engines. ACM  Computing Surveys, 2002. 34(1): p. 48‐49.  2.  Si, L.,  Federated   Search  of Text Search Engines  in Uncooperative

Environmental Mission Impact Assessment

DTIC Science & Technology

2008-01-01

System Agency’s (DISA) Federated Search service. The mission impacts can be generated for a general rectangular area, or generated for routes, route...that respond to queries (format- ted according to DISA’s Federated Search specifi- FIGURE 2 EVIS service-oriented architecture design, illustrating the

9th Annual Systems Engineering Conference: Volume 4 Thursday

DTIC Science & Technology

2006-10-26

Connectivity, Speed, Volume • Enterprise application integration • Workflow integration or multi-media • Federated search capability • Link analysis and...categorization, federated search & automated discovery of information — Collaborative tools to quickly share relevant information Built on commercial

Federating Metadata Catalogs

NASA Astrophysics Data System (ADS)

Baru, C.; Lin, K.

2009-04-01

The Geosciences Network project (www.geongrid.org) has been developing cyberinfrastructure for data sharing in the Earth Science community based on a service-oriented architecture. The project defines a standard "software stack", which includes a standardized set of software modules and corresponding service interfaces. The system employs Grid certificates for distributed user authentication. The GEON Portal provides online access to these services via a set of portlets. This service-oriented approach has enabled the GEON network to easily expand to new sites and deploy the same infrastructure in new projects. To facilitate interoperation with other distributed geoinformatics environments, service standards are being defined and implemented for catalog services and federated search across distributed catalogs. The need arises because there may be multiple metadata catalogs in a distributed system, for example, for each institution, agency, geographic region, and/or country. Ideally, a geoinformatics user should be able to search across all such catalogs by making a single search request. In this paper, we describe our implementation for such a search capability across federated metadata catalogs in the GEON service-oriented architecture. The GEON catalog can be searched using spatial, temporal, and other metadata-based search criteria. The search can be invoked as a Web service and, thus, can be imbedded in any software application. The need for federated catalogs in GEON arises because, (i) GEON collaborators at the University of Hyderabad, India have deployed their own catalog, as part of the iGEON-India effort, to register information about local resources for broader access across the network, (ii) GEON collaborators in the GEO Grid (Global Earth Observations Grid) project at AIST, Japan have implemented a catalog for their ASTER data products, and (iii) we have recently deployed a search service to access all data products from the EarthScope project in the US (http://es-portal.geongrid.org), which are distributed across data archives at IRIS in Seattle, Washington, UNAVCO in Boulder, Colorado, and at the ICDP archives in GFZ, Potsdam, Germany. This service implements a "virtual" catalog--the actual/"physical" catalogs and data are stored at each of the remote locations. A federated search across all these catalogs would enable GEON users to discover data across all of these environments with a single search request. Our objective is to implement this search service via the OGC Catalog Services for the Web (CS-W) standard by providing appropriate CSW "wrappers" for each metadata catalog, as necessary. This paper will discuss technical issues in designing and deploying such a multi-catalog search service in GEON and describe an initial prototype of the federated search capability.

Data, Metadata - Who Cares?

NASA Astrophysics Data System (ADS)

Baumann, Peter

2013-04-01

There is a traditional saying that metadata are understandable, semantic-rich, and searchable. Data, on the other hand, are big, with no accessible semantics, and just downloadable. Not only has this led to an imbalance of search support form a user perspective, but also underneath to a deep technology divide often using relational databases for metadata and bespoke archive solutions for data. Our vision is that this barrier will be overcome, and data and metadata become searchable likewise, leveraging the potential of semantic technologies in combination with scalability technologies. Ultimately, in this vision ad-hoc processing and filtering will not distinguish any longer, forming a uniformly accessible data universe. In the European EarthServer initiative, we work towards this vision by federating database-style raster query languages with metadata search and geo broker technology. We present our approach taken, how it can leverage OGC standards, the benefits envisaged, and first results.

Federated or cached searches: Providing expected performance from multiple invasive species databases

NASA Astrophysics Data System (ADS)

Graham, Jim; Jarnevich, Catherine S.; Simpson, Annie; Newman, Gregory J.; Stohlgren, Thomas J.

2011-06-01

Invasive species are a universal global problem, but the information to identify them, manage them, and prevent invasions is stored around the globe in a variety of formats. The Global Invasive Species Information Network is a consortium of organizations working toward providing seamless access to these disparate databases via the Internet. A distributed network of databases can be created using the Internet and a standard web service protocol. There are two options to provide this integration. First, federated searches are being proposed to allow users to search "deep" web documents such as databases for invasive species. A second method is to create a cache of data from the databases for searching. We compare these two methods, and show that federated searches will not provide the performance and flexibility required from users and a central cache of the datum are required to improve performance.

Federated or cached searches: providing expected performance from multiple invasive species databases

USGS Publications Warehouse

Graham, Jim; Jarnevich, Catherine S.; Simpson, Annie; Newman, Gregory J.; Stohlgren, Thomas J.

2011-01-01

Invasive species are a universal global problem, but the information to identify them, manage them, and prevent invasions is stored around the globe in a variety of formats. The Global Invasive Species Information Network is a consortium of organizations working toward providing seamless access to these disparate databases via the Internet. A distributed network of databases can be created using the Internet and a standard web service protocol. There are two options to provide this integration. First, federated searches are being proposed to allow users to search “deep” web documents such as databases for invasive species. A second method is to create a cache of data from the databases for searching. We compare these two methods, and show that federated searches will not provide the performance and flexibility required from users and a central cache of the datum are required to improve performance.

2005 8th Annual Systems Engineering Conference. Volume 1, Tuesday

DTIC Science & Technology

2005-10-27

Services NCES Discovery Services Federated Search Denotes interface Service NCCP Oktoberfest 2004 101 Task: Global Strike Mission Planning NCCP Oktoberfest...Enterprise Service Management Security Services NCES Discovery Services Federated Search Service Test, cert and accreditation needs to be focused on small

Maintaining the momentum of Open Search in Earth Science Data discovery

NASA Astrophysics Data System (ADS)

Newman, D. J.; Lynnes, C.

2013-12-01

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

Ontological Approach to Military Knowledge Modeling and Management

DTIC Science & Technology

2004-03-01

federated search mechanism has to reformulate user queries (expressed using the ontology) in the query languages of the different sources (e.g. SQL...ontologies as a common terminology – Unified query to perform federated search • Query processing – Ontology mapping to sources reformulate queries

The federal response plan and disaster medical assistance teams in domestic disasters.

PubMed

Roth, P B; Gaffney, J K

1996-05-01

Through a variety of processes over the last 30 years, an organized federal plan has emerged for the response to domestic disasters. This plan incorporates several aspects of medical response into two areas: (1) health and medical and (2) urban search and rescue. This article discusses the development of the federal response plan with emphasis specifically on medicine. Highlighted are disaster medical assistance teams, urban search and rescue task forces, and roles and responsibilities of emergency physicians and other emergency health professionals in a federal disaster response.

GeneLab Analysis Working Group Kick-Off Meeting

NASA Technical Reports Server (NTRS)

Costes, Sylvain V.

2018-01-01

Goals to achieve for GeneLab AWG - GL vision - Review of GeneLab AWG charter Timeline and milestones for 2018 Logistics - Monthly Meeting - Workshop - Internship - ASGSR Introduction of team leads and goals of each group Introduction of all members Q/A Three-tier Client Strategy to Democratize Data Physiological changes, pathway enrichment, differential expression, normalization, processing metadata, reproducibility, Data federation/integration with heterogeneous bioinformatics external databases The GLDS currently serves over 100 omics investigations to the biomedical community via open access. In order to expand the scope of metadata record searches via the GLDS, we designed a metadata warehouse that collects and updates metadata records from external systems housing similar data. To demonstrate the capabilities of federated search and retrieval of these data, we imported metadata records from three open-access data systems into the GLDS metadata warehouse: NCBI's Gene Expression Omnibus (GEO), EBI's PRoteomics IDEntifications (PRIDE) repository, and the Metagenomics Analysis server (MG-RAST). Each of these systems defines metadata for omics data sets differently. One solution to bridge such differences is to employ a common object model (COM) to which each systems' representation of metadata can be mapped. Warehoused metadata records are then transformed at ETL to this single, common representation. Queries generated via the GLDS are then executed against the warehouse, and matching records are shown in the COM representation (Fig. 1). While this approach is relatively straightforward to implement, the volume of the data in the omics domain presents challenges in dealing with latency and currency of records. Furthermore, the lack of a coordinated has been federated data search for and retrieval of these kinds of data across other open-access systems, so that users are able to conduct biological meta-investigations using data from a variety of sources. Such meta-investigations are key to corroborating findings from many kinds of assays and translating them into systems biology knowledge and, eventually, therapeutics.

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

PubMed

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

2007-01-01

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

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

PubMed Central

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

2007-01-01

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

Expected performance of m-solution backtracking

NASA Technical Reports Server (NTRS)

Nicol, D. M.

1986-01-01

This paper derives upper bounds on the expected number of search tree nodes visited during an m-solution backtracking search, a search which terminates after some preselected number m problem solutions are found. The search behavior is assumed to have a general probabilistic structure. The results are stated in terms of node expansion and contraction. A visited search tree node is said to be expanding if the mean number of its children visited by the search exceeds 1 and is contracting otherwise. It is shown that if every node expands, or if every node contracts, then the number of search tree nodes visited by a search has an upper bound which is linear in the depth of the tree, in the mean number of children a node has, and in the number of solutions sought. Also derived are bounds linear in the depth of the tree in some situations where an upper portion of the tree contracts (expands), while the lower portion expands (contracts). While previous analyses of 1-solution backtracking have concluded that the expected performance is always linear in the tree depth, the model allows superlinear expected performance.

Participation, power, and the role of community psychology in environmental disputes: a tale of two nuclear cities.

PubMed

Culley, Marci R; Angelique, Holly

2011-06-01

This paper examines public participation and the role of community psychology in an emerging environmental dispute relevant to global climate change (GCC)-whether nuclear power represents a "green" solution. From a dialectical position, we explore the nuclear debate as it is linked to GCC, and more specifically, how participation in related federally-mandated processes may be shaped by power. We present qualitative data from public meetings in two nuclear communities and analyze these data through a lens of social power and environmental justice, including an examination of nukespeak and telepolitical appeals to highlight the complexity of the issues, how the appearance of successful participation may be deceptive, and how consensus may be manipulated. We argue that CP should consider GCC to be one of the most significant social problems of our time and make every effort to be involved in the search for truly "green" solutions.

Active Solution Space and Search on Job-shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Watanabe, Masato; Ida, Kenichi; Gen, Mitsuo

In this paper we propose a new searching method of Genetic Algorithm for Job-shop scheduling problem (JSP). The coding method that represent job number in order to decide a priority to arrange a job to Gannt Chart (called the ordinal representation with a priority) in JSP, an active schedule is created by using left shift. We define an active solution at first. It is solution which can create an active schedule without using left shift, and set of its defined an active solution space. Next, we propose an algorithm named Genetic Algorithm with active solution space search (GA-asol) which can create an active solution while solution is evaluated, in order to search the active solution space effectively. We applied it for some benchmark problems to compare with other method. The experimental results show good performance.

GeoSearch: A lightweight broking middleware for geospatial resources discovery

NASA Astrophysics Data System (ADS)

Gui, Z.; Yang, C.; Liu, K.; Xia, J.

2012-12-01

With petabytes of geodata, thousands of geospatial web services available over the Internet, it is critical to support geoscience research and applications by finding the best-fit geospatial resources from the massive and heterogeneous resources. Past decades' developments witnessed the operation of many service components to facilitate geospatial resource management and discovery. However, efficient and accurate geospatial resource discovery is still a big challenge due to the following reasons: 1)The entry barriers (also called "learning curves") hinder the usability of discovery services to end users. Different portals and catalogues always adopt various access protocols, metadata formats and GUI styles to organize, present and publish metadata. It is hard for end users to learn all these technical details and differences. 2)The cost for federating heterogeneous services is high. To provide sufficient resources and facilitate data discovery, many registries adopt periodic harvesting mechanism to retrieve metadata from other federated catalogues. These time-consuming processes lead to network and storage burdens, data redundancy, and also the overhead of maintaining data consistency. 3)The heterogeneous semantics issues in data discovery. Since the keyword matching is still the primary search method in many operational discovery services, the search accuracy (precision and recall) is hard to guarantee. Semantic technologies (such as semantic reasoning and similarity evaluation) offer a solution to solve these issues. However, integrating semantic technologies with existing service is challenging due to the expandability limitations on the service frameworks and metadata templates. 4)The capabilities to help users make final selection are inadequate. Most of the existing search portals lack intuitive and diverse information visualization methods and functions (sort, filter) to present, explore and analyze search results. Furthermore, the presentation of the value-added additional information (such as, service quality and user feedback), which conveys important decision supporting information, is missing. To address these issues, we prototyped a distributed search engine, GeoSearch, based on brokering middleware framework to search, integrate and visualize heterogeneous geospatial resources. Specifically, 1) A lightweight discover broker is developed to conduct distributed search. The broker retrieves metadata records for geospatial resources and additional information from dispersed services (portals and catalogues) and other systems on the fly. 2) A quality monitoring and evaluation broker (i.e., QoS Checker) is developed and integrated to provide quality information for geospatial web services. 3) The semantic assisted search and relevance evaluation functions are implemented by loosely interoperating with ESIP Testbed component. 4) Sophisticated information and data visualization functionalities and tools are assembled to improve user experience and assist resource selection.

RUC at TREC 2014: Select Resources Using Topic Models

DTIC Science & Technology

2014-11-01

federated search techniques in a realistic Web setting with a large number of online Web search services. This year the track contains three tasks...Selection. In CIKM 2009, pages 1277-1286. [10] M. Baillie, M. Carmen, and F. Crestani. A Multiple- Collection Latent Topic Model for Federated ... Search . Information Retrieval (2011) 14:390-412. [11] A. Bellogin, G. G. Gebremeskel, J. He, A. Said, T. Samar, A. P. de Vries. CWI and TU Delft at TREC

United States Air Force (USAF) Semantic Interoperability Capabilities Based Assessment and Technology Roadmap

DTIC Science & Technology

2007-03-01

features Federated Search (providing services to find and aggregate information across GIG enterprise data sources); Enterprise Catalog (providing...Content Discovery Federated Search Portlet Users Guide v0.4.3 M16 25-Apr-05 NCES Mediation Core Enterprise Services SDK v0.5.0 M17 25-Apr-05 NCES

Automating Command Post and Battle Staff Operations at the USAF 45th Space Wing

DTIC Science & Technology

2006-10-01

services that can be registered in UDDI directories. It will also be possible to locate relevant data by using Wave’s federated search capabilities...Data is made accessible through federated search and web services provided by Wave. Data is made understandable because it is presented in the

Breeding novel solutions in the brain: a model of Darwinian neurodynamics.

PubMed

Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs

2016-01-01

Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.

Ceos Wgiss Common Framework for Wgiss Connected Data Assets

NASA Astrophysics Data System (ADS)

Enloe, Y.; Mitchell, A. E.; Albani, M.; Yapur, M.

2016-12-01

The Committee on Earth Observation Satellites (CEOS), established in 1984 to coordinate civil space-borne observations of the Earth, has been building through its Working Group on Information Systems and Services (WGISS), a common data framework to identify and connect data assets at member agencies. Some of these data assets are federated systems such as the CEOS WGISS Integrated Catalog (CWIC), the European Space Agency's FedEO (Federated Earth Observations Missions Access) system, and the International Directory Network (IDN) which is an international effort developed by NASA to assist researchers in locating information on available data sets. A system level team provides coordination and oversight to make this loosely coupled federated system function and evolve. WGISS has identified 2 search standards, the Open Geospatial Consortium (OGC) Catalog Services for the Web (CSW) and the CEOS OpenSearch Best Practices (which references the OGC OpenSearch Geo and Time Extensions and OGC OpenSearch Extension for Earth Observation) as well as an interoperable metadata standard (ISO 19115) for use within the WGISS Connected Assets. Data partners must register their data collections in the IDN using the Global Change Master Directory (GCMD) Keywords. Data partners need to support one of the 2 search standards and be able to map their internal metadata to the ISO 19115 metadata elements. All searchable data must have a data access path. Clients can offer search and access to all or a subset of the satellite data available through the WGISS Connected Data Assets. Clients can offer support for a 2-step search: (1) Discovery through collection search using platform, instrument, science keywords, etc. at the IDN and (2) Search granule metadata at data partners through CWIC or FedEO. There are more than a dozen international agencies that offer their data through the WGISS Federation or working on developing their connections. This list includes European Space Agency, NASA, NOAA, USGS, National Institute for Space Research (Brazil), Canadian Center for Mapping and Earth Observations (CCMEO), the Academy for Opto-Electronics (China), the Indian Space Research Organization (ISRO), EUMETSAT, Russian Federal Space Agency (ROSCOSMOS) and several agencies within Australia.

PISA: Federated Search in P2P Networks with Uncooperative Peers

NASA Astrophysics Data System (ADS)

Ren, Zujie; Shou, Lidan; Chen, Gang; Chen, Chun; Bei, Yijun

Recently, federated search in P2P networks has received much attention. Most of the previous work assumed a cooperative environment where each peer can actively participate in information publishing and distributed document indexing. However, little work has addressed the problem of incorporating uncooperative peers, which do not publish their own corpus statistics, into a network. This paper presents a P2P-based federated search framework called PISA which incorporates uncooperative peers as well as the normal ones. In order to address the indexing needs for uncooperative peers, we propose a novel heuristic query-based sampling approach which can obtain high-quality resource descriptions from uncooperative peers at relatively low communication cost. We also propose an effective method called RISE to merge the results returned by uncooperative peers. Our experimental results indicate that PISA can provide quality search results, while utilizing the uncooperative peers at a low cost.

Information Technology and the Evolution of the Library

DTIC Science & Technology

2009-03-01

Resource Commons/ Repository/ Federated Search ILS (GLADIS/Pathfinder - Millenium)/ Catalog/ Circulation/ Acquisitions/ Digital Object Content...content management services to help centralize and distribute digi- tal content from across the institution, software to allow for seamless federated ... search - ing across multiple databases, and imaging software to allow for daily reimaging of ter- minals to reduce security concerns that otherwise

Developing the Interstate Identification Index/Federal Bureau of Investigation (III/FBI) system for providing timely criminal and civil identification and criminal history information to the nation's law enforcement agencies

NASA Astrophysics Data System (ADS)

Copeland, Patricia L.; Shugars, James

1997-02-01

The Federal Bureau of Investigation (FBI) is currently developing a new system to provide timely criminal and civil identities and criminal history information to the nation's local, state, and federal users. The Integrated Automated Fingerprint Identification System (IAFIS), an upgrade to the existing Identification Division Automated Services (IDAS) System, is scheduled for implementation in 1999 at the new FBI facility in Clarksburg, West Virginia. IAFIS will offer new capabilities for electronic transmittal of fingerprint cards to the FBI, an improved fingerprint matching algorithm, and electronic maintenance of fingerprints and photo images. The Interstate Identification Index (III/FBI) System is one of three segments comprising the umbrella IAFIS System. III/FBI provides repository, maintenance, and dissemination capabilities for the 40 million subject national criminal history database. III/FBI will perform over 1 million name searches each day. Demanding performance, reliability/maintainability/availability, and flexibility/expandability requirements make III/FBI an architectural challenge to the system developers. This paper will discuss these driving requirements and present the technical solutions in terms of leading edge hardware and software.

Enabling Interoperability - Supporting a Diversity of Search Paradigms Using Shared Ontologies and Federated Registries

NASA Astrophysics Data System (ADS)

Hughes, J. S.; Crichton, D. J.; Hardman, S. H.; Mattman, C. A.; Ramirez, P. M.

2009-12-01

Experience suggests that no single search paradigm will meet all of a community’s search requirements. Traditional forms based search is still considered critical by a significant percentage of most science communities. However text base and facet based search are improving the community’s perception that search can be easy and that the data is available and can be located. Finally semantic search promises ways to find data that were not conceived when the metadata was first captured and organized. This situation suggests that successful science information systems must be able to deploy new search applications quickly, efficiently, and often for ad-hoc purposes. Federated registries allow data to be packaged or associated with their metadata and managed as simple registry objects. Standard reference models for federated registries now exist that ensure registry objects are uniquely identified at registration and that versioning, classification, and cataloging are addressed automatically. Distributed but locally governed, federated registries also provide notification of registry events and federated query, linking, and replication of registry objects. Key principles for shared ontology development in the space sciences are that the ontology remains independent of its implementation and be extensible, flexible and scalable. The dichotomy between digital things and physical/conceptual things in the domain need to be unified under a standard model, such as the Open Archive Information System (OAIS) Information Object. Finally the fact must be accepted that ontology development is a difficult task that requires time, patience and experts in both the science domain and information modeling. The Planetary Data System (PDS) has adopted this architecture for it next generation information system, PDS 2010. The authors will report on progress, briefly describe key elements, and illustrate how the new system will be phased into operations to handle both legacy and new science data. In particular the shared ontology is being used to drive system implementation through the generation of standards documents and software configuration files. The resulting information system will help meet the expectations of modern scientists by providing more of the information interconnectedness, correlative science, and system interoperability that they desire. Fig.1 - Data Driven Architecture

A Wandering Mind Does Not Stray Far from Home: The Value of Metacognition in Distant Search

PubMed Central

Kudesia, Ravi S.; Baer, Markus; Elfenbein, Hillary Anger

2015-01-01

When faced with a problem, how do individuals search for potential solutions? In this article, we explore the cognitive processes that lead to local search (i.e., identifying options closest to existing solutions) and distant search (i.e., identifying options of a qualitatively different nature than existing solutions). We suggest that mind wandering is likely to lead to local search because it operates by spreading activation from initial ideas to closely associated ideas. This reduces the likelihood of accessing a qualitatively different solution. However, instead of getting lost in thought, individuals can also step back and monitor their thoughts from a detached perspective. Such mindful metacognition, we suggest, is likely to lead to distant search because it redistributes activation away from initial ideas to other, less strongly associated, ideas. This hypothesis was confirmed across two studies. Thus, getting lost in thoughts is helpful when one is on the right track and needs only a local search whereas stepping back from thoughts is helpful when one needs distant search to produce a change in perspective. PMID:25974164

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

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)

75 FR 59718 - US Search, Inc. And US Search, LLC; Analysis of Proposed Consent Order to Aid Public Comment

Federal Register 2010, 2011, 2012, 2013, 2014

2010-09-28

... FEDERAL TRADE COMMISSION [File No. 102 3131] US Search, Inc. And US Search, LLC; Analysis of... written comments electronically or in paper form. Comments should refer to``US Search, Inc., File No. 101... this Notice appears at ( http://www.regulations.gov/search/index.jsp ), you may also file an electronic...

The FY2011 Federal Budget

DTIC Science & Technology

2010-03-09

the largest source of federal revenues, followed by social insurance (payroll) taxes. Federal individual and corporate income tax revenues typically...unemployment, while federal revenues have fallen as individuals’ incomes drop and corporate profits sink. Federal Response to Economic and Financial...reporting burden for the collection of information is estimated to average 1 hour per response , including the time for reviewing instructions, searching

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

NASA Astrophysics Data System (ADS)

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

2003-06-01

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

Engineering the Way to Becoming a Federal Engineer.

ERIC Educational Resources Information Center

Morgans, Carl J.

1991-01-01

Federal engineer tells engineering students how to become federal engineers and discusses the potential rewards and disadvantages of a civil service career. Notes that federal jobs are available for engineering graduates who are knowledgeable in the search process and who are persistent in seeking out such jobs. (NB)

Introduction to the Unified Agenda of Federal Regulatory and Deregulatory Actions

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-26

... Regulatory Agencies Federal Communications Commission 21903 Federal Reserve System 21949 Federal Trade... Register twice each year since 1983 and has been available online since 1995. To further the objective of...://reginfo.gov . The online Unified Agenda offers flexible search tools and will soon offer access to the...

The Defense Messaging System (DMS) in the Navy Regional Enterprise Messaging System (NREMS) Environment: Evidence that Size Does Matter in DoD Business Process Engineering

DTIC Science & Technology

2007-06-01

data repository that will create a metadata card for each message for use by the federated search catalog as a reference. c. Joint DMS Core Product...yet. Once resolved, NREMS can move forward afloat. The AMHS in concert with NCES will be updated with the federated search capability. AMHS

What We've Learned From Doing Usability Testing on OpenURL Resolvers and Federated Search Engines

ERIC Educational Resources Information Center

Cervone, Frank

2005-01-01

OpenURL resolvers and federated search engines are important new services in the library field. For some librarians, these services may seem "old hat" by now, but for the majority these services are still in the early stages of implementation or planning. In many cases, these two services are offered as a seamlessly integrated whole.…

Many Libraries Have Gone to Federated Searching to Win Users Back from Google. Is It Working?

ERIC Educational Resources Information Center

King, Douglas

2008-01-01

In the last issue, this journal asked a question on many librarians' minds, and it was pleased with the depth and variety of responses. As suggested by this journal editorial board member Oliver Pesch, readers were asked, "Many libraries have gone to federated searching to win users back from Google. Is it working?" Respondents approached the…

A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

NASA Astrophysics Data System (ADS)

Chen, Xianshun; Feng, Liang; Ong, Yew Soon

2012-07-01

In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

77 FR 43817 - Notice of Submission for OMB Review; Office of Postsecondary Education; Talent Search (TS) Annual...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-26

...; Talent Search (TS) Annual Performance Report SUMMARY: The Talent Search program provides Federal... Records Management Services, Office of Management, publishes this notice containing proposed information... records. Title of Collection: Talent Search (TS) Annual Performance Report. OMB Control Number: Pending...

Graph drawing using tabu search coupled with path relinking.

PubMed

Dib, Fadi K; Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

Graph drawing using tabu search coupled with path relinking

PubMed Central

Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. PMID:29746576

A Search Relevance Algorithm for Weather Effects Products

DTIC Science & Technology

2006-12-29

accessed) are often search engines [4] [5]. This suggests that people are navigating the internet by searching and not through the traditional...geographic location. Unlike traditional search engines a Federated Search Engine does not scour all the data available and return matches. Instead...gold standard in search engines . However, its ranking system is based, largely, on a measure of interconnectedness. A page that is referenced more

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Mount-Campbell, C. A.; Gonsalvez, D. J.; Martin, C. H.; Levis, C. A.; Wang, C. W.

1986-01-01

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, we design an experiment and solve the same problem under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, we present results of practical, rather than statistical, significance. Our implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than our implementation of a gradient search procedure does with our objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Mount-Campbell, C. A.; Gonsalvez, D. J.; Martin, C. H.; Levis, C. A.

1986-01-01

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, an experiment is designed and the same problem is solved under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, results of practical, rather than statistical, significance are presented. Implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than implementation of a gradient search procedure does with the objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

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

PubMed

Zaki, Nazar; Tennakoon, Chandana

2017-10-02

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

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

PubMed

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

2005-10-24

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

ACHP | News | Native Hawaiian Federal Interagency Working Group Created

Science.gov Websites

Search skip specific nav links Home arrow News arrow Job Opening at the ACHP in Federal Property Management The ACHP is now recruiting for the position of Assistant Director for Federal Property Management preservation issues across the country. The Assistant Director for Federal Property Management has direct line

75 FR 79449 - Introduction to The Regulatory Plan and the Unified Agenda of Federal Regulatory and Deregulatory...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-20

... Agencies Federal Communications Commission 79877 Federal Deposit Insurance Corporation 79921 Federal... Register twice each year since 1983 and has been available online since 1995. To further the objective of... available to the public at http://reginfo.gov. The online Unified Agenda offers flexible search tools and...

78 FR 64929 - National Advisory Committee on Institutional Quality and Integrity (NACIQI)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-30

... process for institutions of higher education under Title IV, of the HEA, together with recommendations for... Federal Register and the Code of Federal Regulations is available via the Federal Digital System at: www... of the Department published in the Federal Register by using the article search feature at: www...

An efficient and practical approach to obtain a better optimum solution for structural optimization

NASA Astrophysics Data System (ADS)

Chen, Ting-Yu; Huang, Jyun-Hao

2013-08-01

For many structural optimization problems, it is hard or even impossible to find the global optimum solution owing to unaffordable computational cost. An alternative and practical way of thinking is thus proposed in this research to obtain an optimum design which may not be global but is better than most local optimum solutions that can be found by gradient-based search methods. The way to reach this goal is to find a smaller search space for gradient-based search methods. It is found in this research that data mining can accomplish this goal easily. The activities of classification, association and clustering in data mining are employed to reduce the original design space. For unconstrained optimization problems, the data mining activities are used to find a smaller search region which contains the global or better local solutions. For constrained optimization problems, it is used to find the feasible region or the feasible region with better objective values. Numerical examples show that the optimum solutions found in the reduced design space by sequential quadratic programming (SQP) are indeed much better than those found by SQP in the original design space. The optimum solutions found in a reduced space by SQP sometimes are even better than the solution found using a hybrid global search method with approximate structural analyses.

75 FR 71441 - Universal Health Services, Inc. and Psychiatric Solutions, Inc.; Analysis of Agreement Containing...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-23

... FEDERAL TRADE COMMISSION [File No. 101 0142] Universal Health Services, Inc. and Psychiatric Solutions, Inc.; Analysis of Agreement Containing Consent Orders To Aid Public Comment AGENCY: Federal Trade... Health Services, Inc. (collectively, ``UHS'') and Psychiatric Solutions, Inc. (``PSI''). The purpose of...

GeoNetwork powered GI-cat: a geoportal hybrid solution

NASA Astrophysics Data System (ADS)

Baldini, Alessio; Boldrini, Enrico; Santoro, Mattia; Mazzetti, Paolo

2010-05-01

To the aim of setting up a Spatial Data Infrastructures (SDI) the creation of a system for the metadata management and discovery plays a fundamental role. An effective solution is the use of a geoportal (e.g. FAO/ESA geoportal), that has the important benefit of being accessible from a web browser. With this work we present a solution based integrating two of the available frameworks: GeoNetwork and GI-cat. GeoNetwork is an opensource software designed to improve accessibility of a wide variety of data together with the associated ancillary information (metadata), at different scale and from multidisciplinary sources; data are organized and documented in a standard and consistent way. GeoNetwork implements both the Portal and Catalog components of a Spatial Data Infrastructure (SDI) defined in the OGC Reference Architecture. It provides tools for managing and publishing metadata on spatial data and related services. GeoNetwork allows harvesting of various types of web data sources e.g. OGC Web Services (e.g. CSW, WCS, WMS). GI-cat is a distributed catalog based on a service-oriented framework of modular components and can be customized and tailored to support different deployment scenarios. It can federate a multiplicity of catalogs services, as well as inventory and access services in order to discover and access heterogeneous ESS resources. The federated resources are exposed by GI-cat through several standard catalog interfaces (e.g. OGC CSW AP ISO, OpenSearch, etc.) and by the GI-cat extended interface. Specific components implement mediation services for interfacing heterogeneous service providers, each of which exposes a specific standard specification; such components are called Accessors. These mediating components solve providers data modelmultiplicity by mapping them onto the GI-cat internal data model which implements the ISO 19115 Core profile. Accessors also implement the query protocol mapping; first they translate the query requests expressed according to the interface protocols exposed by GI-cat into the multiple query dialects spoken by the resource service providers. Currently, a number of well-accepted catalog and inventory services are supported, including several OGC Web Services, THREDDS Data Server, SeaDataNet Common Data Index, GBIF and OpenSearch engines. A GeoNetwork powered GI-cat has been developed in order to exploit the best of the two frameworks. The new system uses a modified version of GeoNetwork web interface in order to add the capability of querying also the specified GI-cat catalog and not only the GeoNetwork internal database. The resulting system consists in a geoportal in which GI-cat plays the role of the search engine. This new system allows to distribute the query on the different types of data sources linked to a GI-cat. The metadata results of the query are then visualized by the Geonetwork web interface. This configuration was experimented in the framework of GIIDA, a project of the Italian National Research Council (CNR) focused on data accessibility and interoperability. A second advantage of this solution is achieved setting up a GeoNetwork catalog amongst the accessors of the GI-cat instance. Such a configuration will allow in turn GI-cat to run the query against the internal GeoNetwork database. This allows to have both the harvesting and the metadata editor functionalities provided by GeoNetwork and the distributed search functionality of GI-cat available in a consistent way through the same web interface.

Legacy data center integration into distributed data federations: The World Data Center for Climate (WDCC) experience

NASA Astrophysics Data System (ADS)

Kindermann, Stephan; Berger, Katharina; Toussaint, Frank

2014-05-01

The integration of well-established legacy data centers into newly developed data federation infrastructures is a key requirement to enhance climate data access based on widely agreed interfaces. We present the approach taken to integrate the ICSU World Data Center for Climate (WDCC) located in Hamburg, Germany into the European ENES climate data Federation which is part of the international ESGF data federation. The ENES / ESGF data federation hosts petabytes of climate model data and provides scalable data search and access services across the worldwide distributed data centers. Parts of the data provided by the ENES / ESGF data federation is also long term archived and curated at the WDCC data archive, allowing e.g. for DOI based data citation. An integration of the WDCC into the ENES / ESGF federation allows end users to search and access WDCC data using consistent interfaces worldwide. We will summarize the integration approach we have taken for WDCC legacy system and ESGF infrastructure integration. On the technical side we describe the provisioning of ESGF consistent metadata and data interfaces as well as the security infrastructure adoption. On the non-technical side we describe our experiences in integrating a long-term archival center with costly quality assurance procedures with an integrated distributed data federation putting emphasis on providing early and consistent data search and access services to scientists. The experiences were gained in the process of curating ESGF hosted CMIP5 data at the WDCC. Approximately one petabyte of CMIP5 data which was used for the IPCC climate report is being replicated and archived at the WDCC.

An adaptive random search for short term generation scheduling with network constraints.

PubMed

Marmolejo, J A; Velasco, Jonás; Selley, Héctor J

2017-01-01

This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

78 FR 69710 - Luminant Generation Company, LLC

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-20

... methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2008... . To begin the search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems with ADAMS, please contact the NRC's Public [[Page 69711

Project Lefty: More Bang for the Search Query

ERIC Educational Resources Information Center

Varnum, Ken

2010-01-01

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

Many States but Only One Country: The Federative Structure of the Federal Republic of Germany. Sonderdienst SO 2-86(e).

ERIC Educational Resources Information Center

Reuter, Konrad

Federalism is conducive to two important elements of the political process: competition and the search for compromise. This is a reason for the prosperity and political stability of the Federal Republic of Germany. Many citizens can involve themselves in the political life of the nation, whether at the federal or state level. With its area of…

ACHP | News | ACHP Issue Spotlight: Transmission Lines in the West

Science.gov Websites

Search skip specific nav links Home arrow News arrow ACHP Approves Policy Statement Regarding Federal Relationships with Tribal Historic Preservation Officers ACHP Approves Policy Statement Regarding Federal approved the ACHP Policy Statement Regarding Federal Relationships with Tribal Historic Preservation

Scheduling with genetic algorithms

NASA Technical Reports Server (NTRS)

Fennel, Theron R.; Underbrink, A. J., Jr.; Williams, George P. W., Jr.

1994-01-01

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

NASA Astrophysics Data System (ADS)

Nguyen, Viet-Phuong; Prins, Christian; Prodhon, Caroline

This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.

A Longitudinal Study of the Talent Search Program

ERIC Educational Resources Information Center

Brewer, Ernest W.; Landers, Jama McMahan

2005-01-01

This longitudinal study examined the impact of participation in the federally funded Talent Search program at The University of Tennessee, Knoxville. The Talent Search program provides career exploration and counseling services to low-income students with the potential to be first-generation college graduates. Postsecondary education enrollment…

An Annotated and Federated Digital Library of Marine Animal Sounds

DTIC Science & Technology

2005-01-01

of the annotations and the relevant segment delimitation points and linkages to other relevant metadata fields; e) search engines that support the...annotators to add information to the same recording, and search engines that permit either all-annotator or specific-annotator searches. To our knowledge

78 FR 68100 - Luminant Generation Company, LLC

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-13

... following methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID.../adams.html . To begin the search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems with ADAMS, please contact the NRC's Public Document Room (PDR) reference...

34 CFR 674.44 - Address searches.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 34 Education 3 2011-07-01 2011-07-01 false Address searches. 674.44 Section 674.44 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL PERKINS LOAN PROGRAM Due Diligence § 674.44 Address searches. (a) If mail...

34 CFR 674.44 - Address searches.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false Address searches. 674.44 Section 674.44 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION FEDERAL PERKINS LOAN PROGRAM Due Diligence § 674.44 Address searches. (a) If mail...

Hybridization of decomposition and local search for multiobjective optimization.

PubMed

Ke, Liangjun; Zhang, Qingfu; Battiti, Roberto

2014-10-01

Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD). It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MOMAD evolves three populations: 1) population P(L) for recording the current solution to each subproblem; 2) population P(P) for storing starting solutions for Pareto local search; and 3) an external population P(E) for maintaining all the nondominated solutions found so far during the search. A problem-specific single objective heuristic can be applied to these subproblems to initialize the three populations. At each generation, a Pareto local search method is first applied to search a neighborhood of each solution in P(P) to update P(L) and P(E). Then a single objective local search is applied to each perturbed solution in P(L) for improving P(L) and P(E), and reinitializing P(P). The procedure is repeated until a stopping condition is met. MOMAD provides a generic hybrid multiobjective algorithmic framework in which problem specific knowledge, well developed single objective local search and heuristics and Pareto local search methods can be hybridized. It is a population based iterative method and thus an anytime algorithm. Extensive experiments have been conducted in this paper to study MOMAD and compare it with some other state-of-the-art algorithms on the multiobjective traveling salesman problem and the multiobjective knapsack problem. The experimental results show that our proposed algorithm outperforms or performs similarly to the best so far heuristics on these two problems.

Self-adaptive multi-objective harmony search for optimal design of water distribution networks

NASA Astrophysics Data System (ADS)

Choi, Young Hwan; Lee, Ho Min; Yoo, Do Guen; Kim, Joong Hoon

2017-11-01

In multi-objective optimization computing, it is important to assign suitable parameters to each optimization problem to obtain better solutions. In this study, a self-adaptive multi-objective harmony search (SaMOHS) algorithm is developed to apply the parameter-setting-free technique, which is an example of a self-adaptive methodology. The SaMOHS algorithm attempts to remove some of the inconvenience from parameter setting and selects the most adaptive parameters during the iterative solution search process. To verify the proposed algorithm, an optimal least cost water distribution network design problem is applied to three different target networks. The results are compared with other well-known algorithms such as multi-objective harmony search and the non-dominated sorting genetic algorithm-II. The efficiency of the proposed algorithm is quantified by suitable performance indices. The results indicate that SaMOHS can be efficiently applied to the search for Pareto-optimal solutions in a multi-objective solution space.

Providing Enterprise Information Services for Multinational Interoperability - The EIM Approach

DTIC Science & Technology

2005-06-01

Federated Search • Document Processing and Archiving • Workflow processing References 1. Perspective on Multinational Information Sharing, Cheryl...layer, with a primary focus on the Application Layers. App Layer Focus Areas Enterprise Content Mgt, Workflow, Business Processes, Federated ... Search Integration Layer – EAI Components Nation 1 Nation 2 Nation 3 … Nation N Silo 1 Silo 2 Silo 3 S ilo N Silo 1 Silo 1 Silo 2 Silo 2 Silo 3 Silo 3 S

Internet Search Patterns of Human Immunodeficiency Virus and the Digital Divide in the Russian Federation: Infoveillance Study

PubMed Central

Quinn, Casey; Hercz, Daniel; Gillespie, James A

2013-01-01

Background Human immunodeficiency virus (HIV) is a serious health problem in the Russian Federation. However, the true scale of HIV in Russia has long been the subject of considerable debate. Using digital surveillance to monitor diseases has become increasingly popular in high income countries. But Internet users may not be representative of overall populations, and the characteristics of the Internet-using population cannot be directly ascertained from search pattern data. This exploratory infoveillance study examined if Internet search patterns can be used for disease surveillance in a large middle-income country with a dispersed population. Objective This study had two main objectives: (1) to validate Internet search patterns against national HIV prevalence data, and (2) to investigate the relationship between search patterns and the determinants of Internet access. Methods We first assessed whether online surveillance is a valid and reliable method for monitoring HIV in the Russian Federation. Yandex and Google both provided tools to study search patterns in the Russian Federation. We evaluated the relationship between both Yandex and Google aggregated search patterns and HIV prevalence in 2011 at national and regional tiers. Second, we analyzed the determinants of Internet access to determine the extent to which they explained regional variations in searches for the Russian terms for “HIV” and “AIDS”. We sought to extend understanding of the characteristics of Internet searching populations by data matching the determinants of Internet access (age, education, income, broadband access price, and urbanization ratios) and searches for the term “HIV” using principal component analysis (PCA). Results We found generally strong correlations between HIV prevalence and searches for the terms “HIV” and “AIDS”. National correlations for Yandex searches for “HIV” were very strongly correlated with HIV prevalence (Spearman rank-order coefficient [rs]=.881, P≤.001) and strongly correlated for “AIDS” (rs=.714, P≤.001). The strength of correlations varied across Russian regions. National correlations in Google for the term “HIV” (rs=.672, P=.004) and “AIDS” (rs=.584, P≤.001) were weaker than for Yandex. Second, we examined the relationship between the determinants of Internet access and search patterns for the term “HIV” across Russia using PCA. At the national level, we found Principal Component 1 loadings, including age (-0.56), HIV search (-0.533), and education (-0.479) contributed 32% of the variance. Principal Component 2 contributed 22% of national variance (income, -0.652 and broadband price, -0.460). Conclusions This study contributes to the methodological literature on search patterns in public health. Based on our preliminary research, we suggest that PCA may be used to evaluate the relationship between the determinants of Internet access and searches for health problems beyond high-income countries. We believe it is in middle-income countries that search methods can make the greatest contribution to public health. PMID:24220250

28 CFR 60.1 - Purpose.

Code of Federal Regulations, 2013 CFR

2013-07-01

... Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS TO REQUEST THE ISSUANCE OF A SEARCH WARRANT § 60.1 Purpose. This regulation authorizes certain categories of federal law... “upon the request of a federal law enforcement officer,” and defines that term in Rule 41(h) as “any...

28 CFR 60.1 - Purpose.

Code of Federal Regulations, 2012 CFR

2012-07-01

... Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS TO REQUEST THE ISSUANCE OF A SEARCH WARRANT § 60.1 Purpose. This regulation authorizes certain categories of federal law... “upon the request of a federal law enforcement officer,” and defines that term in Rule 41(h) as “any...

28 CFR 60.1 - Purpose.

Code of Federal Regulations, 2011 CFR

2011-07-01

... Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS TO REQUEST THE ISSUANCE OF A SEARCH WARRANT § 60.1 Purpose. This regulation authorizes certain categories of federal law... “upon the request of a federal law enforcement officer,” and defines that term in Rule 41(h) as “any...

28 CFR 60.1 - Purpose.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS TO REQUEST THE ISSUANCE OF A SEARCH WARRANT § 60.1 Purpose. This regulation authorizes certain categories of federal law... “upon the request of a federal law enforcement officer,” and defines that term in Rule 41(h) as “any...

28 CFR 60.1 - Purpose.

Code of Federal Regulations, 2014 CFR

2014-07-01

... Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS TO REQUEST THE ISSUANCE OF A SEARCH WARRANT § 60.1 Purpose. This regulation authorizes certain categories of federal law... “upon the request of a federal law enforcement officer,” and defines that term in Rule 41(h) as “any...

ACHP | News | Native Hawaiian Federal Interagency Working Group Created

Science.gov Websites

Search skip specific nav links Home arrow News arrow Native Hawaiian Federal Interagency Working Group Created Native Hawaiian Federal Interagency Working Group Created Improving consultations on unique issues involving Native Hawaiian organizations is the purpose of a new interagency working group established by the

75 FR 72777 - Defense Federal Acquisition Regulation Supplement; Patents, Data, and Copyrights (DFARS Case 2010...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-26

... RIN 0750-AG62 Defense Federal Acquisition Regulation Supplement; Patents, Data, and Copyrights (DFARS... Defense Federal Acquisition Regulation Supplement (DFARS) to update text on patents, data, and copyrights... selecting ``Search.'' Select the link ``Submit a Comment'' that corresponds with ``DFARS Case 2010-D001...

44 CFR 208.11 - Federal status of System Members.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 44 Emergency Management and Assistance 1 2014-10-01 2014-10-01 false Federal status of System..., DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM General § 208.11 Federal status of System Members. The Assistant Administrator will appoint all Activated System...

44 CFR 208.11 - Federal status of System Members.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 44 Emergency Management and Assistance 1 2011-10-01 2011-10-01 false Federal status of System..., DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM General § 208.11 Federal status of System Members. The Assistant Administrator will appoint all Activated System...

44 CFR 208.11 - Federal status of System Members.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 44 Emergency Management and Assistance 1 2012-10-01 2011-10-01 true Federal status of System..., DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM General § 208.11 Federal status of System Members. The Assistant Administrator will appoint all Activated System...

44 CFR 208.11 - Federal status of System Members.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Federal status of System..., DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM General § 208.11 Federal status of System Members. The Assistant Administrator will appoint all Activated System...

44 CFR 208.11 - Federal status of System Members.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 44 Emergency Management and Assistance 1 2013-10-01 2013-10-01 false Federal status of System..., DEPARTMENT OF HOMELAND SECURITY DISASTER ASSISTANCE NATIONAL URBAN SEARCH AND RESCUE RESPONSE SYSTEM General § 208.11 Federal status of System Members. The Assistant Administrator will appoint all Activated System...

Query Transformations for Result Merging

DTIC Science & Technology

2014-11-01

tors, term dependence, query expansion 1. INTRODUCTION Federated search deals with the problem of aggregating results from multiple search engines . The...invidual search engines are (i) typically focused on a particular domain or a particular corpus, (ii) employ diverse retrieval models, and (iii...determine which search engines are appropri- ate for addressing the information need (resource selection), and (ii) merging the results returned by

Evaluating a federated medical search engine: tailoring the methodology and reporting the evaluation outcomes.

PubMed

Saparova, D; Belden, J; Williams, J; Richardson, B; Schuster, K

2014-01-01

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

Evaluating a Federated Medical Search Engine

PubMed Central

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

2014-01-01

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

32 CFR 504.2 - Procedures.

Code of Federal Regulations, 2013 CFR

2013-07-01

... administrative summons or subpoena for access to financial records. (d) Search warrant. (1) A law enforcement office may obtain financial records by using a search warrant obtained under Rule 41 of the Federal Rules of Criminal Procedure in appropriate cases. (2) No later than 90 days after the search warrant is...

47 CFR 0.467 - Search and review fees.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 1 2013-10-01 2013-10-01 false Search and review fees. 0.467 Section 0.467 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION General Information Public Information and Inspection of Records § 0.467 Search and review fees. (a)(1) Subject to the provisions of this...

47 CFR 0.467 - Search and review fees.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 1 2012-10-01 2012-10-01 false Search and review fees. 0.467 Section 0.467 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION General Information Public Information and Inspection of Records § 0.467 Search and review fees. (a)(1) Subject to the provisions of this...

47 CFR 0.467 - Search and review fees.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 1 2014-10-01 2014-10-01 false Search and review fees. 0.467 Section 0.467 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMISSION ORGANIZATION General Information Public Information and Inspection of Records § 0.467 Search and review fees. (a)(1) Subject to the provisions of this...

77 FR 26321 - Virginia Electric and Power Company

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-03

... NUCLEAR REGULATORY COMMISSION [Docket Nos. 50-338 and 50-339; NRC-2012-0051; License Nos. NPF-4...: Federal Rulemaking Web Site: Go to http://www.regulations.gov and search for Docket ID NRC-2012-0051... search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems...

75 FR 3642 - Special Evaluation Assistance for Rural Communities and Households Program

Federal Register 2010, 2011, 2012, 2013, 2014

2010-01-22

... the Special Evaluation Assistance for Rural Communities and Households (SEARCH) Program as authorized.... 1926 (a)(2)). The amendment added the new SEARCH grant program under which the Secretary is authorized... following methods: Federal eRulemaking Portal: Go to http://www.regulations.gov and in the ``Search...

Exploration versus exploitation in space, mind, and society

PubMed Central

Hills, Thomas T.; Todd, Peter M.; Lazer, David; Redish, A. David; Couzin, Iain D.

2015-01-01

Search is a ubiquitous property of life. Although diverse domains have worked on search problems largely in isolation, recent trends across disciplines indicate that the formal properties of these problems share similar structures and, often, similar solutions. Moreover, internal search (e.g., memory search) shows similar characteristics to external search (e.g., spatial foraging), including shared neural mechanisms consistent with a common evolutionary origin across species. Search problems and their solutions also scale from individuals to societies, underlying and constraining problem solving, memory, information search, and scientific and cultural innovation. In summary, search represents a core feature of cognition, with a vast influence on its evolution and processes across contexts and requiring input from multiple domains to understand its implications and scope. PMID:25487706

Architecture for Knowledge-Based and Federated Search of Online Clinical Evidence

PubMed Central

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

2005-01-01

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

Fundamental resource-allocating model in colleges and universities based on Immune Clone Algorithms

NASA Astrophysics Data System (ADS)

Ye, Mengdie

2017-05-01

In this thesis we will seek the combination of antibodies and antigens converted from the optimal course arrangement and make an analogy with Immune Clone Algorithms. According to the character of the Algorithms, we apply clone, clone gene and clone selection to arrange courses. Clone operator can combine evolutionary search and random search, global search and local search. By cloning and clone mutating candidate solutions, we can find the global optimal solution quickly.

Alternative Fuels Data Center

Science.gov Websites

Data Center on AddThis.com... More in this section... Search Federal State Local Examples Summary fuels and advanced vehicles. Choose one or more jurisdictions to start your search. Select additional

Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach.

PubMed

Cakar, Tarik; Koker, Rasit

2015-01-01

A particle swarm optimization algorithm (PSO) has been used to solve the single machine total weighted tardiness problem (SMTWT) with unequal release date. To find the best solutions three different solution approaches have been used. To prepare subhybrid solution system, genetic algorithms (GA) and simulated annealing (SA) have been used. In the subhybrid system (GA and SA), GA obtains a solution in any stage, that solution is taken by SA and used as an initial solution. When SA finds better solution than this solution, it stops working and gives this solution to GA again. After GA finishes working the obtained solution is given to PSO. PSO searches for better solution than this solution. Later it again sends the obtained solution to GA. Three different solution systems worked together. Neurohybrid system uses PSO as the main optimizer and SA and GA have been used as local search tools. For each stage, local optimizers are used to perform exploitation to the best particle. In addition to local search tools, neurodominance rule (NDR) has been used to improve performance of last solution of hybrid-PSO system. NDR checked sequential jobs according to total weighted tardiness factor. All system is named as neurohybrid-PSO solution system.

ACHP | ACHP Native American Program: Guidance for Federal Agencies

Science.gov Websites

Working with Section 106 Federal, State, & Tribal Programs Training & Education Publications Search skip specific nav links Home arrow Working with Section 106 arrow ACHP Native American Program

(FEDSTATS)

EPA Science Inventory

Federal Statistics (FedStats) offers the full range of official statistical information available to the public from the Federal Government. It uses the Internet's powerful linking and searching capabilities to track economic and population trends, education, health care costs, a...

MyMolDB: a micromolecular database solution with open source and free components.

PubMed

Xia, Bing; Tai, Zheng-Fu; Gu, Yu-Cheng; Li, Bang-Jing; Ding, Li-Sheng; Zhou, Yan

2011-10-01

To manage chemical structures in small laboratories is one of the important daily tasks. Few solutions are available on the internet, and most of them are closed source applications. The open-source applications typically have limited capability and basic cheminformatics functionalities. In this article, we describe an open-source solution to manage chemicals in research groups based on open source and free components. It has a user-friendly interface with the functions of chemical handling and intensive searching. MyMolDB is a micromolecular database solution that supports exact, substructure, similarity, and combined searching. This solution is mainly implemented using scripting language Python with a web-based interface for compound management and searching. Almost all the searches are in essence done with pure SQL on the database by using the high performance of the database engine. Thus, impressive searching speed has been archived in large data sets for no external Central Processing Unit (CPU) consuming languages were involved in the key procedure of the searching. MyMolDB is an open-source software and can be modified and/or redistributed under GNU General Public License version 3 published by the Free Software Foundation (Free Software Foundation Inc. The GNU General Public License, Version 3, 2007. Available at: http://www.gnu.org/licenses/gpl.html). The software itself can be found at http://code.google.com/p/mymoldb/. Copyright © 2011 Wiley Periodicals, Inc.

Modified reactive tabu search for the symmetric traveling salesman problems

NASA Astrophysics Data System (ADS)

Lim, Yai-Fung; Hong, Pei-Yee; Ramli, Razamin; Khalid, Ruzelan

2013-09-01

Reactive tabu search (RTS) is an improved method of tabu search (TS) and it dynamically adjusts tabu list size based on how the search is performed. RTS can avoid disadvantage of TS which is in the parameter tuning in tabu list size. In this paper, we proposed a modified RTS approach for solving symmetric traveling salesman problems (TSP). The tabu list size of the proposed algorithm depends on the number of iterations when the solutions do not override the aspiration level to achieve a good balance between diversification and intensification. The proposed algorithm was tested on seven chosen benchmarked problems of symmetric TSP. The performance of the proposed algorithm is compared with that of the TS by using empirical testing, benchmark solution and simple probabilistic analysis in order to validate the quality of solution. The computational results and comparisons show that the proposed algorithm provides a better quality solution than that of the TS.

Applications of remote sensing data to the Alaskan environment

NASA Technical Reports Server (NTRS)

Belon, A. E.; Iller, J. M.

1973-01-01

The ERTS program provides a means to overcome the formidable logistic and economic costs of preparing environmental surveys of the vast and relatively unexplored regions of Alaska. There is an excellent potential in satellite remote sensing to benefit Federal, state, local, and private agencies, by providing a new synoptic data base which is necessary for the preparation of the needed surveys and the search for solutions to environmental management problems. One approach in coupling satellite data to Alaskan problems is a major program initiated by the University of Alaska and funded by NASA's Goddard Space Flight Center. This included 12 projects whose aims were to study the feasibility of applying ERTS data to the disciplines of ecology, agriculture, hydrology, wildlife management, oceanography, geology, glaciology, volcanology, and archaeology.

Data management integration for biomedical core facilities

NASA Astrophysics Data System (ADS)

Zhang, Guo-Qiang; Szymanski, Jacek; Wilson, David

2007-03-01

We present the design, development, and pilot-deployment experiences of MIMI, a web-based, Multi-modality Multi-Resource Information Integration environment for biomedical core facilities. This is an easily customizable, web-based software tool that integrates scientific and administrative support for a biomedical core facility involving a common set of entities: researchers; projects; equipments and devices; support staff; services; samples and materials; experimental workflow; large and complex data. With this software, one can: register users; manage projects; schedule resources; bill services; perform site-wide search; archive, back-up, and share data. With its customizable, expandable, and scalable characteristics, MIMI not only provides a cost-effective solution to the overarching data management problem of biomedical core facilities unavailable in the market place, but also lays a foundation for data federation to facilitate and support discovery-driven research.

12 CFR 1202.2 - What do the terms in this part mean?

Code of Federal Regulations, 2010 CFR

2010-01-01

... employee performing the work, the cost of any computer searches, and the cost of operating duplication... Federal Home Loan Mortgage Corporation (“Freddie Mac”), the Federal National Mortgage Association (“Fannie Mae”), any Federal Home Loan Bank and/or any affiliate thereof that is subject to the regulatory...

ACHP | News | ACHP Issue Spotlight: Transmission Lines in the West

Science.gov Websites

Search skip specific nav links Home arrow News arrow New Applicant Guidance for Unified Federal Review for Disaster Recovery New Applicant Guidance for Unified Federal Review for Disaster Recovery The ACHP announce the release of the Unified Federal Environmental and Historic Preservation Review Guide for

Alternative Fuels Data Center: Federal and State Laws and Incentives

Science.gov Websites

in this section... Search Federal State Local Examples Summary Tables Federal and State Laws and Legislation Find Local Laws and Incentives Find examples of laws and incentives from local governments. For ) Requirements by Year More Laws & Incentives Data | All Maps & Data Case Studies Deploying Clean Buses

ACHP | Heritage Tourism and the Federal Government: Summit II Proceedings

Science.gov Websites

Search skip specific nav links Home arrow Publications arrow Intro: Heritage Tourism and the Federal Government: Summit II—Report of Proceedings Heritage Tourism and the Federal Government: Summit II—Report Heritage tourism promotes the preservation of communities' historic resources, educates tourists and local

ACHP | Heritage Tourism and the Federal Government: Northern New Mexico

Science.gov Websites

Publications Search skip specific nav links Home arrow Publications arrow Intro: Heritage Tourism and the Federal Government: Northern New Mexico Perspectives Heritage Tourism and the Federal Government: Northern information Heritage tourism offers a triple benefit to communities—it promotes the preservation of their

77 FR 33786 - NRC Enforcement Policy Revision

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-07

... methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2011... search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems... either 2.3.2.a. or b. must be met for the disposition of a violation as an NCV.'' The following new...

NDBC Tropical Atmosphere Ocean (TAO)

Science.gov Websites

to go to the NWS homepage Left navigation bar Home News Organization Search NDBC web site search TAO Tour FAQ NDBC Home Contact Us USA.gov is the U.S. government's official web portal to all federal , state and local government web resources and services. Recent Data Observations Search TAO DART Tropical

78 FR 7818 - Duane Arnold Energy Center; Application for Amendment to Facility Operating License

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-04

... methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2013... search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems... INFORMATION CONTACT: Karl D. Feintuch, Project Manager, Office of Nuclear Reactor Regulation, U.S. Nuclear...

77 FR 67837 - Callaway Plant, Unit 1; Application for Amendment to Facility Operating License

Federal Register 2010, 2011, 2012, 2013, 2014

2012-11-14

... methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2012... search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems... INFORMATION CONTACT: Carl F. Lyon, Project Manager, Office of Nuclear Reactor Regulation, U.S. Nuclear...

IC Treatment: Antihistamines

MedlinePlus

... Us Magazine Store Donor Resources My Profile Login Social Media Twitter YouTube Facebook Pinterest Community ShareThis Google Search ... Federal Campaign ICA Resources for Donors Corporate Contributions Social Media Twitter YouTube Facebook Pinterest Community ShareThis Google Search ...

Pregnancy and IC

MedlinePlus

... Us Magazine Store Donor Resources My Profile Login Social Media Twitter YouTube Facebook Pinterest Community ShareThis Google Search ... Federal Campaign ICA Resources for Donors Corporate Contributions Social Media Twitter YouTube Facebook Pinterest Community ShareThis Google Search ...

Genetic algorithms as global random search methods

NASA Technical Reports Server (NTRS)

Peck, Charles C.; Dhawan, Atam P.

1995-01-01

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Genetic algorithms as global random search methods

NASA Technical Reports Server (NTRS)

Peck, Charles C.; Dhawan, Atam P.

1995-01-01

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Insight and search in Katona's five-square problem.

PubMed

Ollinger, Michael; Jones, Gary; Knoblich, Günther

2014-01-01

Insights are often productive outcomes of human thinking. We provide a cognitive model that explains insight problem solving by the interplay of problem space search and representational change, whereby the problem space is constrained or relaxed based on the problem representation. By introducing different experimental conditions that either constrained the initial search space or helped solvers to initiate a representational change, we investigated the interplay of problem space search and representational change in Katona's five-square problem. Testing 168 participants, we demonstrated that independent hints relating to the initial search space and to representational change had little effect on solution rates. However, providing both hints caused a significant increase in solution rates. Our results show the interplay between problem space search and representational change in insight problem solving: The initial problem space can be so large that people fail to encounter impasse, but even when representational change is achieved the resulting problem space can still provide a major obstacle to finding the solution.

An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

PubMed Central

Feng, Yanhong; Jia, Ke; He, Yichao

2014-01-01

Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space. Subsequently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions. PMID:24527026

Escalated convergent artificial bee colony

NASA Astrophysics Data System (ADS)

Jadon, Shimpi Singh; Bansal, Jagdish Chand; Tiwari, Ritu

2016-03-01

Artificial bee colony (ABC) optimisation algorithm is a recent, fast and easy-to-implement population-based meta heuristic for optimisation. ABC has been proved a rival algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. The solution search equation of ABC is influenced by a random quantity which helps its search process in exploration at the cost of exploitation. In order to find a fast convergent behaviour of ABC while exploitation capability is maintained, in this paper basic ABC is modified in two ways. First, to improve exploitation capability, two local search strategies, namely classical unidimensional local search and levy flight random walk-based local search are incorporated with ABC. Furthermore, a new solution search strategy, namely stochastic diffusion scout search is proposed and incorporated into the scout bee phase to provide more chance to abandon solution to improve itself. Efficiency of the proposed algorithm is tested on 20 benchmark test functions of different complexities and characteristics. Results are very promising and they prove it to be a competitive algorithm in the field of swarm intelligence-based algorithms.

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…

Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis.

PubMed

Lee, Junghye; Sun, Jimeng; Wang, Fei; Wang, Shuang; Jun, Chi-Hyuck; Jiang, Xiaoqian

2018-04-13

There is an urgent need for the development of global analytic frameworks that can perform analyses in a privacy-preserving federated environment across multiple institutions without privacy leakage. A few studies on the topic of federated medical analysis have been conducted recently with the focus on several algorithms. However, none of them have solved similar patient matching, which is useful for applications such as cohort construction for cross-institution observational studies, disease surveillance, and clinical trials recruitment. The aim of this study was to present a privacy-preserving platform in a federated setting for patient similarity learning across institutions. Without sharing patient-level information, our model can find similar patients from one hospital to another. We proposed a federated patient hashing framework and developed a novel algorithm to learn context-specific hash codes to represent patients across institutions. The similarities between patients can be efficiently computed using the resulting hash codes of corresponding patients. To avoid security attack from reverse engineering on the model, we applied homomorphic encryption to patient similarity search in a federated setting. We used sequential medical events extracted from the Multiparameter Intelligent Monitoring in Intensive Care-III database to evaluate the proposed algorithm in predicting the incidence of five diseases independently. Our algorithm achieved averaged area under the curves of 0.9154 and 0.8012 with balanced and imbalanced data, respectively, in κ-nearest neighbor with κ=3. We also confirmed privacy preservation in similarity search by using homomorphic encryption. The proposed algorithm can help search similar patients across institutions effectively to support federated data analysis in a privacy-preserving manner. ©Junghye Lee, Jimeng Sun, Fei Wang, Shuang Wang, Chi-Hyuck Jun, Xiaoqian Jiang. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 13.04.2018.

Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis

PubMed Central

Sun, Jimeng; Wang, Fei; Wang, Shuang; Jun, Chi-Hyuck; Jiang, Xiaoqian

2018-01-01

Background There is an urgent need for the development of global analytic frameworks that can perform analyses in a privacy-preserving federated environment across multiple institutions without privacy leakage. A few studies on the topic of federated medical analysis have been conducted recently with the focus on several algorithms. However, none of them have solved similar patient matching, which is useful for applications such as cohort construction for cross-institution observational studies, disease surveillance, and clinical trials recruitment. Objective The aim of this study was to present a privacy-preserving platform in a federated setting for patient similarity learning across institutions. Without sharing patient-level information, our model can find similar patients from one hospital to another. Methods We proposed a federated patient hashing framework and developed a novel algorithm to learn context-specific hash codes to represent patients across institutions. The similarities between patients can be efficiently computed using the resulting hash codes of corresponding patients. To avoid security attack from reverse engineering on the model, we applied homomorphic encryption to patient similarity search in a federated setting. Results We used sequential medical events extracted from the Multiparameter Intelligent Monitoring in Intensive Care-III database to evaluate the proposed algorithm in predicting the incidence of five diseases independently. Our algorithm achieved averaged area under the curves of 0.9154 and 0.8012 with balanced and imbalanced data, respectively, in κ-nearest neighbor with κ=3. We also confirmed privacy preservation in similarity search by using homomorphic encryption. Conclusions The proposed algorithm can help search similar patients across institutions effectively to support federated data analysis in a privacy-preserving manner. PMID:29653917

Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2004-09-01

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread success of tabu search, researchers have a poor understanding of many key theoretical aspects of this algorithm, including models of the high-level run-time dynamics and identification of those search space features that influence problem difficulty. We consider these questions in the context of the job-shop scheduling problem (JSP), a domain where tabu search algorithms have been shown to be remarkably effective. Previously, we demonstrated that the mean distance between random local optima and the nearestmore » optimal solution is highly correlated with problem difficulty for a well-known tabu search algorithm for the JSP introduced by Taillard. In this paper, we discuss various shortcomings of this measure and develop a new model of problem difficulty that corrects these deficiencies. We show that Taillard's algorithm can be modeled with high fidelity as a simple variant of a straightforward random walk. The random walk model accounts for nearly all of the variability in the cost required to locate both optimal and sub-optimal solutions to random JSPs, and provides an explanation for differences in the difficulty of random versus structured JSPs. Finally, we discuss and empirically substantiate two novel predictions regarding tabu search algorithm behavior. First, the method for constructing the initial solution is highly unlikely to impact the performance of tabu search. Second, tabu tenure should be selected to be as small as possible while simultaneously avoiding search stagnation; values larger than necessary lead to significant degradations in performance.« less

25 CFR 700.163 - Expenses in searching for replacement location-nonresidential moves.

Code of Federal Regulations, 2010 CFR

2010-04-01

..., including— (a) Transportation computed at prevailing federal per diem and mileage allowance schedules; meals and lodging away from home; (b) Time spent searching, based on reasonable earnings; (c) Fees paid to a...

25 CFR 700.163 - Expenses in searching for replacement location-nonresidential moves.

Code of Federal Regulations, 2011 CFR

2011-04-01

..., including— (a) Transportation computed at prevailing federal per diem and mileage allowance schedules; meals and lodging away from home; (b) Time spent searching, based on reasonable earnings; (c) Fees paid to a...

Impacts and Viability of Open Source Software on Earth Science Metadata Clearing House and Service Registry Applications

NASA Astrophysics Data System (ADS)

Pilone, D.; Cechini, M. F.; Mitchell, A.

2011-12-01

Earth Science applications typically deal with large amounts of data and high throughput rates, if not also high transaction rates. While Open Source is frequently used for smaller scientific applications, large scale, highly available systems frequently fall back to "enterprise" class solutions like Oracle RAC or commercial grade JEE Application Servers. NASA's Earth Observing System Data and Information System (EOSDIS) provides end-to-end capabilities for managing NASA's Earth science data from multiple sources - satellites, aircraft, field measurements, and various other programs. A core capability of EOSDIS, the Earth Observing System (EOS) Clearinghouse (ECHO), is a highly available search and order clearinghouse of over 100 million pieces of science data that has evolved from its early R&D days to a fully operational system. Over the course of this maturity ECHO has largely transitioned from commercial frameworks, databases, and operating systems to Open Source solutions...and in some cases, back. In this talk we discuss the progression of our technological solutions and our lessons learned in the areas of: ? High performance, large scale searching solutions ? GeoSpatial search capabilities and dealing with multiple coordinate systems ? Search and storage of variable format source (science) data ? Highly available deployment solutions ? Scalable (elastic) solutions to visual searching and image handling Throughout the evolution of the ECHO system we have had to evaluate solutions with respect to performance, cost, developer productivity, reliability, and maintainability in the context of supporting global science users. Open Source solutions have played a significant role in our architecture and development but several critical commercial components remain (or have been reinserted) to meet our operational demands.

Optimisation in radiotherapy. III: Stochastic optimisation algorithms and conclusions.

PubMed

Ebert, M

1997-12-01

This is the final article in a three part examination of optimisation in radiotherapy. Previous articles have established the bases and form of the radiotherapy optimisation problem, and examined certain types of optimisation algorithm, namely, those which perform some form of ordered search of the solution space (mathematical programming), and those which attempt to find the closest feasible solution to the inverse planning problem (deterministic inversion). The current paper examines algorithms which search the space of possible irradiation strategies by stochastic methods. The resulting iterative search methods move about the solution space by sampling random variates, which gradually become more constricted as the algorithm converges upon the optimal solution. This paper also discusses the implementation of optimisation in radiotherapy practice.

76 FR 22926 - Notice of Availability of Draft Environmental Assessment and Finding of No Significant Impact for...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-25

... the following methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for... writing or in electronic form will be posted on the NRC Web site and on the Federal rulemaking Web site... electronically under ADAMS Accession Number ML110870992. Federal Rulemaking Web site: Public comments and...

77 FR 50541 - STP Nuclear Operating Company, South Texas Project, Units 1 and 2; Application for Amendment to...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-21

... any of the following methods: Federal Rulemaking Web Site: Go to http://www.regulations.gov and search.../reading-rm/adams.html . To begin the search, select ``ADAMS Public Documents'' and then select ``Begin Web- based ADAMS Search.'' For problems with ADAMS, please contact the NRC's Public Document Room (PDR...

The Validity of Warrantless Searches under the Occupational Safety and Health Act of 1970

ERIC Educational Resources Information Center

Shanks, Michael D.

1975-01-01

One of the most controversial federal acts providing for random administrative searches is the Occupational Safety and Health Act of 1970 (OSHA). The author reviews the search and seizure law and concludes that abandonment of Fourth Amendment rights should not be predicated on the mere convenience of even a justifiable regulatory scheme. (JT)

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…

Determination of Slope Safety Factor with Analytical Solution and Searching Critical Slip Surface with Genetic-Traversal Random Method

PubMed Central

2014-01-01

In the current practice, to determine the safety factor of a slope with two-dimensional circular potential failure surface, one of the searching methods for the critical slip surface is Genetic Algorithm (GA), while the method to calculate the slope safety factor is Fellenius' slices method. However GA needs to be validated with more numeric tests, while Fellenius' slices method is just an approximate method like finite element method. This paper proposed a new method to determine the minimum slope safety factor which is the determination of slope safety factor with analytical solution and searching critical slip surface with Genetic-Traversal Random Method. The analytical solution is more accurate than Fellenius' slices method. The Genetic-Traversal Random Method uses random pick to utilize mutation. A computer automatic search program is developed for the Genetic-Traversal Random Method. After comparison with other methods like slope/w software, results indicate that the Genetic-Traversal Random Search Method can give very low safety factor which is about half of the other methods. However the obtained minimum safety factor with Genetic-Traversal Random Search Method is very close to the lower bound solutions of slope safety factor given by the Ansys software. PMID:24782679

78 FR 5445 - Federal Acquisition Regulation; Submission for OMB Review; Drug-Free Workplace (FAR 52.223-6)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-25

....regulations.gov . Submit comments via the Federal eRulemaking portal by searching the OMB control number... knowledge of the information collection, the estimated total burden is as follows: Respondents: 598...

Federal Highway Administration 100-year coating study.

DOT National Transportation Integrated Search

2012-11-01

The Federal Highway Administration 100-Year Coating Study was initiated in August 2009 to search for durable : coating systems at a reasonable cost. The objective of the study was to identify and evaluate coating materials that can : provide 100 year...

Rapid identification of anonymous subjects in large criminal databases: problems and solutions in IAFIS III/FBI subject searches

NASA Astrophysics Data System (ADS)

Kutzleb, C. D.

1997-02-01

The high incidence of recidivism (repeat offenders) in the criminal population makes the use of the IAFIS III/FBI criminal database an important tool in law enforcement. The problems and solutions employed by IAFIS III/FBI criminal subject searches are discussed for the following topics: (1) subject search selectivity and reliability; (2) the difficulty and limitations of identifying subjects whose anonymity may be a prime objective; (3) database size, search workload, and search response time; (4) techniques and advantages of normalizing the variability in an individual's name and identifying features into identifiable and discrete categories; and (5) the use of database demographics to estimate the likelihood of a match between a search subject and database subjects.

7 CFR 1774.8 - Other Federal Statutes.

Code of Federal Regulations, 2011 CFR

2011-01-01

... AGRICULTURE (CONTINUED) SPECIAL EVALUATION ASSISTANCE FOR RURAL COMMUNITIES AND HOUSEHOLDS PROGRAM (SEARCH..., section 504—Rehabilitation Act of 1973, and 7 CFR part 15B (USDA implementation of statute), prohibiting discrimination based upon physical or mental handicap in Federally assisted programs. ...

76 FR 59623 - Defense Federal Acquisition Regulation Supplement; Only One Offer (DFARS Case 2011-D013)

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-27

... : http://www.regulations.gov . Submit comments via the Federal eRulemaking portal by inserting ``DFARS Case 2011-D013'' under the heading ``Enter keyword or ID'' and selecting ``Search.'' Select the link...

Federal Student Aid and the Goal of Equal Opportunity: The Record and the Future.

ERIC Educational Resources Information Center

Gladieux, Lawrence E.

The history of federal student financial aid legislation, 1965-1985, is traced, and problems faced in the mid-1980s, and possible future directions are considered. The Higher Education Act of 1965 was the first explicit federal commitment to equalizing college opportunities for needy students through grants and programs such as Talent Search. Some…

Walking the Filament of Feasibility: Global Optimization of Highly-Constrained, Multi-Modal Interplanetary Trajectories Using a Novel Stochastic Search Technique

NASA Technical Reports Server (NTRS)

Englander, Arnold C.; Englander, Jacob A.

2017-01-01

Interplanetary trajectory optimization problems are highly complex and are characterized by a large number of decision variables and equality and inequality constraints as well as many locally optimal solutions. Stochastic global search techniques, coupled with a large-scale NLP solver, have been shown to solve such problems but are inadequately robust when the problem constraints become very complex. In this work, we present a novel search algorithm that takes advantage of the fact that equality constraints effectively collapse the solution space to lower dimensionality. This new approach walks the filament'' of feasibility to efficiently find the global optimal solution.

Efficient and Accurate Optimal Linear Phase FIR Filter Design Using Opposition-Based Harmony Search Algorithm

PubMed Central

Saha, S. K.; Dutta, R.; Choudhury, R.; Kar, R.; Mandal, D.; Ghoshal, S. P.

2013-01-01

In this paper, opposition-based harmony search has been applied for the optimal design of linear phase FIR filters. RGA, PSO, and DE have also been adopted for the sake of comparison. The original harmony search algorithm is chosen as the parent one, and opposition-based approach is applied. During the initialization, randomly generated population of solutions is chosen, opposite solutions are also considered, and the fitter one is selected as a priori guess. In harmony memory, each such solution passes through memory consideration rule, pitch adjustment rule, and then opposition-based reinitialization generation jumping, which gives the optimum result corresponding to the least error fitness in multidimensional search space of FIR filter design. Incorporation of different control parameters in the basic HS algorithm results in the balancing of exploration and exploitation of search space. Low pass, high pass, band pass, and band stop FIR filters are designed with the proposed OHS and other aforementioned algorithms individually for comparative optimization performance. A comparison of simulation results reveals the optimization efficacy of the OHS over the other optimization techniques for the solution of the multimodal, nondifferentiable, nonlinear, and constrained FIR filter design problems. PMID:23844390

Efficient and accurate optimal linear phase FIR filter design using opposition-based harmony search algorithm.

PubMed

Saha, S K; Dutta, R; Choudhury, R; Kar, R; Mandal, D; Ghoshal, S P

2013-01-01

In this paper, opposition-based harmony search has been applied for the optimal design of linear phase FIR filters. RGA, PSO, and DE have also been adopted for the sake of comparison. The original harmony search algorithm is chosen as the parent one, and opposition-based approach is applied. During the initialization, randomly generated population of solutions is chosen, opposite solutions are also considered, and the fitter one is selected as a priori guess. In harmony memory, each such solution passes through memory consideration rule, pitch adjustment rule, and then opposition-based reinitialization generation jumping, which gives the optimum result corresponding to the least error fitness in multidimensional search space of FIR filter design. Incorporation of different control parameters in the basic HS algorithm results in the balancing of exploration and exploitation of search space. Low pass, high pass, band pass, and band stop FIR filters are designed with the proposed OHS and other aforementioned algorithms individually for comparative optimization performance. A comparison of simulation results reveals the optimization efficacy of the OHS over the other optimization techniques for the solution of the multimodal, nondifferentiable, nonlinear, and constrained FIR filter design problems.

A new effective operator for the hybrid algorithm for solving global optimisation problems

NASA Astrophysics Data System (ADS)

Duc, Le Anh; Li, Kenli; Nguyen, Tien Trong; Yen, Vu Minh; Truong, Tung Khac

2018-04-01

Hybrid algorithms have been recently used to solve complex single-objective optimisation problems. The ultimate goal is to find an optimised global solution by using these algorithms. Based on the existing algorithms (HP_CRO, PSO, RCCRO), this study proposes a new hybrid algorithm called MPC (Mean-PSO-CRO), which utilises a new Mean-Search Operator. By employing this new operator, the proposed algorithm improves the search ability on areas of the solution space that the other operators of previous algorithms do not explore. Specifically, the Mean-Search Operator helps find the better solutions in comparison with other algorithms. Moreover, the authors have proposed two parameters for balancing local and global search and between various types of local search, as well. In addition, three versions of this operator, which use different constraints, are introduced. The experimental results on 23 benchmark functions, which are used in previous works, show that our framework can find better optimal or close-to-optimal solutions with faster convergence speed for most of the benchmark functions, especially the high-dimensional functions. Thus, the proposed algorithm is more effective in solving single-objective optimisation problems than the other existing algorithms.

Economic development: poverty solution for the rural South

DOE Office of Scientific and Technical Information (OSTI.GOV)

Briggs, V.M. Jr.; Rungeling, B.

1980-10-01

The 1970 census showed the South to have 41.3% of the US rural population and 44% of the poor with only 31% of the population. Economic development in the rural South has been limited by a lack of financial and physical capital and by a tradition of discriminatory and conservative institutional practices that restrict development. An experimental Federal program of low-interest loans recognized these problems in the Area Redevelopment Act (ARA) of 1961, later replaced by the Public Works and Economic Development Act of 1965 and the Rural Development Act of 1972. Each of these assumed an infrastructure for jobmore » creation and failed to provide for human resource development. The search for an acceptable policy alternative to this approach may find an answer in community and development corporations (CDCs), which transcend political boundaries and allow local people to own and control the businesses they organize or attract, but which are bound by the local financial capability. The authors feel that, until policies recognize the need to have a national balance of urban and rural life, Federal intervention should be confined to a supportive role. 23 references. (DCK)« less

Artificial bee colony algorithm with dynamic multi-population

NASA Astrophysics Data System (ADS)

Zhang, Ming; Ji, Zhicheng; Wang, Yan

2017-07-01

To improve the convergence rate and make a balance between the global search and local turning abilities, this paper proposes a decentralized form of artificial bee colony (ABC) algorithm with dynamic multi-populations by means of fuzzy C-means (FCM) clustering. Each subpopulation periodically enlarges with the same size during the search process, and the overlapping individuals among different subareas work for delivering information acting as exploring the search space with diffusion of solutions. Moreover, a Gaussian-based search equation with redefined local attractor is proposed to further accelerate the diffusion of the best solution and guide the search towards potential areas. Experimental results on a set of benchmarks demonstrate the competitive performance of our proposed approach.

NASA's GeneLab Phase II: Federated Search and Data Discovery

NASA Technical Reports Server (NTRS)

Berrios, Daniel C.; Costes, Sylvain V.; Tran, Peter B.

2017-01-01

GeneLab is currently being developed by NASA to accelerate 'open science' biomedical research in support of the human exploration of space and the improvement of life on earth. Phase I of the four-phase GeneLab Data Systems (GLDS) project emphasized capabilities for submission, curation, search, and retrieval of genomics, transcriptomics and proteomics ('omics') data from biomedical research of space environments. The focus of development of the GLDS for Phase II has been federated data search for and retrieval of these kinds of data across other open-access systems, so that users are able to conduct biological meta-investigations using data from a variety of sources. Such meta-investigations are key to corroborating findings from many kinds of assays and translating them into systems biology knowledge and, eventually, therapeutics.

NASAs GeneLab Phase II: Federated Search and Data Discovery

NASA Technical Reports Server (NTRS)

Berrios, Daniel C.; Costes, Sylvain; Tran, Peter

2017-01-01

GeneLab is currently being developed by NASA to accelerate open science biomedical research in support of the human exploration of space and the improvement of life on earth. Phase I of the four-phase GeneLab Data Systems (GLDS) project emphasized capabilities for submission, curation, search, and retrieval of genomics, transcriptomics and proteomics (omics) data from biomedical research of space environments. The focus of development of the GLDS for Phase II has been federated data search for and retrieval of these kinds of data across other open-access systems, so that users are able to conduct biological meta-investigations using data from a variety of sources. Such meta-investigations are key to corroborating findings from many kinds of assays and translating them into systems biology knowledge and, eventually, therapeutics.

28 CFR 60.2 - Authorized categories.

Code of Federal Regulations, 2013 CFR

2013-07-01

... Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS... federal law enforcement officers are authorized to request the issuance of a search warrant: (a) Any... direction who is authorized by statute or other appropriate authority to enforce the criminal laws of the...

28 CFR 60.2 - Authorized categories.

Code of Federal Regulations, 2014 CFR

2014-07-01

... Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS... federal law enforcement officers are authorized to request the issuance of a search warrant: (a) Any... direction who is authorized by statute or other appropriate authority to enforce the criminal laws of the...

28 CFR 60.2 - Authorized categories.

Code of Federal Regulations, 2012 CFR

2012-07-01

... Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS... federal law enforcement officers are authorized to request the issuance of a search warrant: (a) Any... direction who is authorized by statute or other appropriate authority to enforce the criminal laws of the...

28 CFR 60.2 - Authorized categories.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS... federal law enforcement officers are authorized to request the issuance of a search warrant: (a) Any... direction who is authorized by statute or other appropriate authority to enforce the criminal laws of the...

28 CFR 60.2 - Authorized categories.

Code of Federal Regulations, 2011 CFR

2011-07-01

... Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) AUTHORIZATION OF FEDERAL LAW ENFORCEMENT OFFICERS... federal law enforcement officers are authorized to request the issuance of a search warrant: (a) Any... direction who is authorized by statute or other appropriate authority to enforce the criminal laws of the...

Solution to the satisfiability problem using a complete Grover search with trapped ions

NASA Astrophysics Data System (ADS)

Yang, Wan-Li; Wei, Hua; Zhou, Fei; Chang, Weng-Long; Feng, Mang

2009-07-01

The main idea in the original Grover search (1997 Phys. Rev. Lett. 79 325) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black box giving us information about the target state. We design quantum circuits to accomplish a complete Grover search involving both the Oracle's job and the amplification of the target state, which are employed to solve satisfiability (SAT) problems. We explore how to carry out the quantum circuits with currently available ion-trap quantum computing technology.

Feature selection with harmony search.

PubMed

Diao, Ren; Shen, Qiang

2012-12-01

Many search strategies have been exploited for the task of feature selection (FS), in an effort to identify more compact and better quality subsets. Such work typically involves the use of greedy hill climbing (HC), or nature-inspired heuristics, in order to discover the optimal solution without going through exhaustive search. In this paper, a novel FS approach based on harmony search (HS) is presented. It is a general approach that can be used in conjunction with many subset evaluation techniques. The simplicity of HS is exploited to reduce the overall complexity of the search process. The proposed approach is able to escape from local solutions and identify multiple solutions owing to the stochastic nature of HS. Additional parameter control schemes are introduced to reduce the effort and impact of parameter configuration. These can be further combined with the iterative refinement strategy, tailored to enforce the discovery of quality subsets. The resulting approach is compared with those that rely on HC, genetic algorithms, and particle swarm optimization, accompanied by in-depth studies of the suggested improvements.

An analysis of iterated local search for job-shop scheduling.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Whitley, L. Darrell; Howe, Adele E.; Watson, Jean-Paul

2003-08-01

Iterated local search, or ILS, is among the most straightforward meta-heuristics for local search. ILS employs both small-step and large-step move operators. Search proceeds via iterative modifications to a single solution, in distinct alternating phases. In the first phase, local neighborhood search (typically greedy descent) is used in conjunction with the small-step operator to transform solutions into local optima. In the second phase, the large-step operator is applied to generate perturbations to the local optima obtained in the first phase. Ideally, when local neighborhood search is applied to the resulting solution, search will terminate at a different local optimum, i.e.,more » the large-step perturbations should be sufficiently large to enable escape from the attractor basins of local optima. ILS has proven capable of delivering excellent performance on numerous N P-Hard optimization problems. [LMS03]. However, despite its implicity, very little is known about why ILS can be so effective, and under what conditions. The goal of this paper is to advance the state-of-the-art in the analysis of meta-heuristics, by providing answers to this research question. They focus on characterizing both the relationship between the structure of the underlying search space and ILS performance, and the dynamic behavior of ILS. The analysis proceeds in the context of the job-shop scheduling problem (JSP) [Tai94]. They begin by demonstrating that the attractor basins of local optima in the JSP are surprisingly weak, and can be escaped with high probaiblity by accepting a short random sequence of less-fit neighbors. this result is used to develop a new ILS algorithms for the JSP, I-JAR, whose performance is competitive with tabu search on difficult benchmark instances. They conclude by developing a very accurate behavioral model of I-JAR, which yields significant insights into the dynamics of search. The analysis is based on a set of 100 random 10 x 10 problem instances, in addition to some widely used benchmark instances. Both I-JAR and the tabu search algorithm they consider are based on the N1 move operator introduced by van Laarhoven et al. [vLAL92]. The N1 operator induces a connected search space, such that it is always possible to move from an arbitrary solution to an optimal solution; this property is integral to the development of a behavioral model of I-JAR. However, much of the analysis generalizes to other move operators, including that of Nowicki and Smutnick [NS96]. Finally the models are based on the distance between two solutions, which they take as the well-known disjunctive graph distance [MBK99].« less

47 CFR 80.1125 - Search and rescue coordinating communications.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 5 2012-10-01 2012-10-01 false Search and rescue coordinating communications. 80.1125 Section 80.1125 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES STATIONS IN THE MARITIME SERVICES Global Maritime Distress and Safety System (GMDSS...

41 CFR 105-60.305-5 - Searches.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 41 Public Contracts and Property Management 3 2014-01-01 2014-01-01 false Searches. 105-60.305-5 Section 105-60.305-5 Public Contracts and Property Management Federal Property Management Regulations System (Continued) GENERAL SERVICES ADMINISTRATION Regional Offices-General Services Administration 60...

41 CFR 105-60.305-5 - Searches.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 41 Public Contracts and Property Management 3 2012-01-01 2012-01-01 false Searches. 105-60.305-5 Section 105-60.305-5 Public Contracts and Property Management Federal Property Management Regulations System (Continued) GENERAL SERVICES ADMINISTRATION Regional Offices-General Services Administration 60...

41 CFR 105-60.305-5 - Searches.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 41 Public Contracts and Property Management 3 2013-07-01 2013-07-01 false Searches. 105-60.305-5 Section 105-60.305-5 Public Contracts and Property Management Federal Property Management Regulations System (Continued) GENERAL SERVICES ADMINISTRATION Regional Offices-General Services Administration 60...

Federal Research and Development Funding: FY2012

DTIC Science & Technology

2011-03-29

including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and... reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including...advisor, John Holdren—have raised concerns about the potential harm of a “boom-bust” approach to federal R&D funding (i.e., rapid growth in federal R

A Shared Infrastructure for Federated Search Across Distributed Scientific Metadata Catalogs

NASA Astrophysics Data System (ADS)

Reed, S. A.; Truslove, I.; Billingsley, B. W.; Grauch, A.; Harper, D.; Kovarik, J.; Lopez, L.; Liu, M.; Brandt, M.

2013-12-01

The vast amount of science metadata can be overwhelming and highly complex. Comprehensive analysis and sharing of metadata is difficult since institutions often publish to their own repositories. There are many disjoint standards used for publishing scientific data, making it difficult to discover and share information from different sources. Services that publish metadata catalogs often have different protocols, formats, and semantics. The research community is limited by the exclusivity of separate metadata catalogs and thus it is desirable to have federated search interfaces capable of unified search queries across multiple sources. Aggregation of metadata catalogs also enables users to critique metadata more rigorously. With these motivations in mind, the National Snow and Ice Data Center (NSIDC) and Advanced Cooperative Arctic Data and Information Service (ACADIS) implemented two search interfaces for the community. Both the NSIDC Search and ACADIS Arctic Data Explorer (ADE) use a common infrastructure which keeps maintenance costs low. The search clients are designed to make OpenSearch requests against Solr, an Open Source search platform. Solr applies indexes to specific fields of the metadata which in this instance optimizes queries containing keywords, spatial bounds and temporal ranges. NSIDC metadata is reused by both search interfaces but the ADE also brokers additional sources. Users can quickly find relevant metadata with minimal effort and ultimately lowers costs for research. This presentation will highlight the reuse of data and code between NSIDC and ACADIS, discuss challenges and milestones for each project, and will identify creation and use of Open Source libraries.

76 FR 2425 - Draft Regulatory Guide: Reissuance and Availability

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-13

... posted on the NRC website and on the Federal rulemaking website Regulations.gov . Because your comments... publicly disclosed. Federal Rulemaking Website: Go to http://www.regulations.gov and search for [email protected] . The Regulatory Analysis is available electronically under ADAMS Accession Number...

Online bibliographic sources in hydrology

USGS Publications Warehouse

Wild, Emily C.; Havener, W. Michael

2001-01-01

Traditional commercial bibliographic databases and indexes provide some access to hydrology materials produced by the government; however, these sources do not provide comprehensive coverage of relevant hydrologic publications. This paper discusses bibliographic information available from the federal government and state geological surveys, water resources agencies, and depositories. In addition to information in these databases, the paper describes the scope, styles of citing, subject terminology, and the ways these information sources are currently being searched, formally and informally, by hydrologists. Information available from the federal and state agencies and from the state depositories might be missed by limiting searches to commercially distributed databases.

A hybrid, auto-adaptive and rule-based multi-agent approach using evolutionary algorithms for improved searching

NASA Astrophysics Data System (ADS)

Izquierdo, Joaquín; Montalvo, Idel; Campbell, Enrique; Pérez-García, Rafael

2016-08-01

Selecting the most appropriate heuristic for solving a specific problem is not easy, for many reasons. This article focuses on one of these reasons: traditionally, the solution search process has operated in a given manner regardless of the specific problem being solved, and the process has been the same regardless of the size, complexity and domain of the problem. To cope with this situation, search processes should mould the search into areas of the search space that are meaningful for the problem. This article builds on previous work in the development of a multi-agent paradigm using techniques derived from knowledge discovery (data-mining techniques) on databases of so-far visited solutions. The aim is to improve the search mechanisms, increase computational efficiency and use rules to enrich the formulation of optimization problems, while reducing the search space and catering to realistic problems.

Improving Grasp Skills Using Schema Structured Learning

NASA Technical Reports Server (NTRS)

Platt, Robert; Grupen, ROderic A.; Fagg, Andrew H.

2006-01-01

Abstract In the control-based approach to robotics, complex behavior is created by sequencing and combining control primitives. While it is desirable for the robot to autonomously learn the correct control sequence, searching through the large number of potential solutions can be time consuming. This paper constrains this search to variations of a generalized solution encoded in a framework known as an action schema. A new algorithm, SCHEMA STRUCTURED LEARNING, is proposed that repeatedly executes variations of the generalized solution in search of instantiations that satisfy action schema objectives. This approach is tested in a grasping task where Dexter, the UMass humanoid robot, learns which reaching and grasping controllers maximize the probability of grasp success.

NOAA Workforce Management Office

Science.gov Websites

Home Careers at NOAA Search Criteria Click to Search WORKFORCE MANAGEMENT OFFICE NATIONAL OCEANIC Federal Employees Health (FEHB) Life (FEGLI) Life Insurance and Active Duty Information Long Term Care (FLTCIP) New Employee Benefit Information OPM Retirement Information Premium Conversion - Health Benefits

78 FR 52607 - Unified Registration System

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-23

...'' and click ``Search.'' Next, click ``Open Docket Folder'' in the ``Actions'' column. Finally, in the... comments received are posted without change to http://www.regulations.gov . Anyone is able to search the... License CFR Code of Federal Regulations CMV Commercial Motor Vehicle CR Compliance Review CSA Compliance...

Team Teaching in the Saturday Morning Search for Solutions.

ERIC Educational Resources Information Center

Solomon, Pearl G.; And Others

The Marie Curie Mathematics and Science Center at St. Thomas Aquinas College (New York), in a comprehensive effort to improve mathematics and science education, offers the Saturday Morning Search for Solutions enrichment program for area students in grades 7-12. The program is interdisciplinary, connecting technology and the study of societal…

Using Dissimilarity Metrics to Identify Interesting Designs

NASA Technical Reports Server (NTRS)

Feather, Martin; Kiper, James

2006-01-01

A computer program helps to blend the power of automated-search software, which is able to generate large numbers of design solutions, with the insight of expert designers, who are able to identify preferred designs but do not have time to examine all the solutions. From among the many automated solutions to a given design problem, the program selects a smaller number of solutions that are worthy of scrutiny by the experts in the sense that they are sufficiently dissimilar from each other. The program makes the selection in an interactive process that involves a sequence of data-mining steps interspersed with visual displays of results of these steps to the experts. At crucial points between steps, the experts provide directives to guide the process. The program uses heuristic search techniques to identify nearly optimal design solutions and uses dissimilarity metrics defined by the experts to characterize the degree to which solutions are interestingly different. The search, data-mining, and visualization features of the program were derived from previously developed risk-management software used to support a risk-centric design methodology

77 FR 20019 - FirstEnergy Solutions Corp., Allegheny Energy Supply Company, LLC v. PJM Interconnection, L.L.C...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-03

... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission [Docket No. EL12-50-000] FirstEnergy Solutions Corp., Allegheny Energy Supply Company, LLC v. PJM Interconnection, L.L.C.; Notice of Complaint... 206 of the Federal Energy Regulatory Commission's Rules of Practice and Procedure, 18 CFR 385.206 and...

76 FR 7832 - Evans Solutions, LLC; Notice of Declaration of Intention and Soliciting Comments, Protests, and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-11

... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission [Docket No. DI10-20-000] Evans Solutions... original and seven copies should be filed with: Secretary, Federal Energy Regulatory Commission, 888 First...-acre man-made lake; (2) a powerhouse containing two 5-MW turbines and twelve 5-MW generators; (3) a...

ACHP | Heritage Tourism

Science.gov Websites

Search skip specific nav links Home arrow Heritage Tourism Heritage Tourism ACHP Reports Partnering to Promote Heritage Tourism in Local Communities: Guidance for Federal Agencies Federal Programs that Can Support Heritage Tourism Web-Available Studies of the Economic Impacts of Historic Preservation Heritage

77 FR 44647 - Agency Information Collection Activities: Proposed Collection; Comment Request, National...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-30

... individuals to search for displaced friends, family, and household members. Affected Public: Individuals and..., National Emergency Family Registry and Locator System (NEFRLS) AGENCY: Federal Emergency Management Agency... effort to reduce paperwork and respondent burden, invites the general public and other Federal agencies...

12 CFR 911.9 - Fees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 12 Banks and Banking 8 2012-01-01 2012-01-01 false Fees. 911.9 Section 911.9 Banks and Banking FEDERAL HOUSING FINANCE BOARD FEDERAL HOUSING FINANCE BOARD ORGANIZATION AND OPERATIONS AVAILABILITY OF UNPUBLISHED INFORMATION § 911.9 Fees. (a) Fees for records search, copying, and certification. Unless waived...

12 CFR 911.9 - Fees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 7 2010-01-01 2010-01-01 false Fees. 911.9 Section 911.9 Banks and Banking FEDERAL HOUSING FINANCE BOARD FEDERAL HOUSING FINANCE BOARD ORGANIZATION AND OPERATIONS AVAILABILITY OF UNPUBLISHED INFORMATION § 911.9 Fees. (a) Fees for records search, copying, and certification. Unless waived...

12 CFR 911.9 - Fees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 12 Banks and Banking 8 2013-01-01 2013-01-01 false Fees. 911.9 Section 911.9 Banks and Banking FEDERAL HOUSING FINANCE BOARD FEDERAL HOUSING FINANCE BOARD ORGANIZATION AND OPERATIONS AVAILABILITY OF UNPUBLISHED INFORMATION § 911.9 Fees. (a) Fees for records search, copying, and certification. Unless waived...

12 CFR 911.9 - Fees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 12 Banks and Banking 7 2011-01-01 2011-01-01 false Fees. 911.9 Section 911.9 Banks and Banking FEDERAL HOUSING FINANCE BOARD FEDERAL HOUSING FINANCE BOARD ORGANIZATION AND OPERATIONS AVAILABILITY OF UNPUBLISHED INFORMATION § 911.9 Fees. (a) Fees for records search, copying, and certification. Unless waived...

Broad-search algorithms for the spacecraft trajectory design of Callisto-Ganymede-Io triple flyby sequences from 2024 to 2040, Part II: Lambert pathfinding and trajectory solutions

NASA Astrophysics Data System (ADS)

Lynam, Alfred E.

2014-01-01

Triple-satellite-aided capture employs gravity-assist flybys of three of the Galilean moons of Jupiter in order to decrease the amount of ΔV required to capture a spacecraft into Jupiter orbit. Similarly, triple flybys can be used within a Jupiter satellite tour to rapidly modify the orbital parameters of a Jovicentric orbit, or to increase the number of science flybys. In order to provide a nearly comprehensive search of the solution space of Callisto-Ganymede-Io triple flybys from 2024 to 2040, a third-order, Chebyshev's method variant of the p-iteration solution to Lambert's problem is paired with a second-order, Newton-Raphson method, time of flight iteration solution to the V∞-matching problem. The iterative solutions of these problems provide the orbital parameters of the Callisto-Ganymede transfer, the Ganymede flyby, and the Ganymede-Io transfer, but the characteristics of the Callisto and Io flybys are unconstrained, so they are permitted to vary in order to produce an even larger number of trajectory solutions. The vast amount of solution data is searched to find the best triple-satellite-aided capture window between 2024 and 2040.

Update on CERN Search based on SharePoint 2013

NASA Astrophysics Data System (ADS)

Alvarez, E.; Fernandez, S.; Lossent, A.; Posada, I.; Silva, B.; Wagner, A.

2017-10-01

CERN’s enterprise Search solution “CERN Search” provides a central search solution for users and CERN service providers. A total of about 20 million public and protected documents from a wide range of document collections is indexed, including Indico, TWiki, Drupal, SharePoint, JACOW, E-group archives, EDMS, and CERN Web pages. In spring 2015, CERN Search was migrated to a new infrastructure based on SharePoint 2013. In the context of this upgrade, the document pre-processing and indexing process was redesigned and generalised. The new data feeding framework allows to profit from new functionality and it facilitates the long term maintenance of the system.

NOAA Workforce Management Office

Science.gov Websites

Request Forms Military Service Deposit Information NOAA Forms OPM Forms Performance Management Request Home Careers at NOAA Search Criteria Click to Search WORKFORCE MANAGEMENT OFFICE NATIONAL OCEANIC Federal Employees Health (FEHB) Life (FEGLI) Life Insurance and Active Duty Information Long Term Care

Search without Boundaries Using Simple APIs

ERIC Educational Resources Information Center

Tong, Qi (Helen)

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…

2/19/2016: Clarification on survival craft requirements for uninspected

Science.gov Websites

, 2016 The Coast Guard published Marine Safety Information Bulletin 04-16 to provide clarifying . Comments comments Tags: fishing vessel, marine safety information bulletin Search for: Search Categories - Lifesaving & Fire Safety Emerging Policy Environmental Response Policy Federal Register Investigations

Making Sense of Federal Employment and Training Policy for Youth and Adults. Volume II: Expert Recommendations To Create a Comprehensive and Unified System.

ERIC Educational Resources Information Center

Moore, Kristina M., Ed.; And Others

This document contains 27 essays and 5 policy statements regarding creation of a comprehensive and unified federal employment and training policy for youth and adults. The following essays are included: "In Search of the American Way" (Wills); "Rethink the Demand Side" (Smith); "The Federal Government as a Change Agent" (Nathan); "Making Sense of…

One-dimensional swarm algorithm packaging

NASA Astrophysics Data System (ADS)

Lebedev, Boris K.; Lebedev, Oleg B.; Lebedeva, Ekaterina O.

2018-05-01

The paper considers an algorithm for solving the problem of onedimensional packaging based on the adaptive behavior model of an ant colony. The key role in the development of the ant algorithm is the choice of representation (interpretation) of the solution. The structure of the solution search graph, the procedure for finding solutions on the graph, the methods of deposition and evaporation of pheromone are described. Unlike the canonical paradigm of an ant algorithm, an ant on the solution search graph generates sets of elements distributed across blocks. Experimental studies were conducted on IBM PC. Compared with the existing algorithms, the results are improved.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

PubMed

Xia, Yangkun; Fu, Zhuo; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order

PubMed Central

Xia, Yangkun; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can’t be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution. PMID:29763419

A new improved artificial bee colony algorithm for ship hull form optimization

NASA Astrophysics Data System (ADS)

Huang, Fuxin; Wang, Lijue; Yang, Chi

2016-04-01

The artificial bee colony (ABC) algorithm is a relatively new swarm intelligence-based optimization algorithm. Its simplicity of implementation, relatively few parameter settings and promising optimization capability make it widely used in different fields. However, it has problems of slow convergence due to its solution search equation. Here, a new solution search equation based on a combination of the elite solution pool and the block perturbation scheme is proposed to improve the performance of the algorithm. In addition, two different solution search equations are used by employed bees and onlooker bees to balance the exploration and exploitation of the algorithm. The developed algorithm is validated by a set of well-known numerical benchmark functions. It is then applied to optimize two ship hull forms with minimum resistance. The tested results show that the proposed new improved ABC algorithm can outperform the ABC algorithm in most of the tested problems.

Advanced scatter search approach and its application in a sequencing problem of mixed-model assembly lines in a case company

NASA Astrophysics Data System (ADS)

Liu, Qiong; Wang, Wen-xi; Zhu, Ke-ren; Zhang, Chao-yong; Rao, Yun-qing

2014-11-01

Mixed-model assembly line sequencing is significant in reducing the production time and overall cost of production. To improve production efficiency, a mathematical model aiming simultaneously to minimize overtime, idle time and total set-up costs is developed. To obtain high-quality and stable solutions, an advanced scatter search approach is proposed. In the proposed algorithm, a new diversification generation method based on a genetic algorithm is presented to generate a set of potentially diverse and high-quality initial solutions. Many methods, including reference set update, subset generation, solution combination and improvement methods, are designed to maintain the diversification of populations and to obtain high-quality ideal solutions. The proposed model and algorithm are applied and validated in a case company. The results indicate that the proposed advanced scatter search approach is significant for mixed-model assembly line sequencing in this company.

A novel artificial bee colony algorithm based on modified search equation and orthogonal learning.

PubMed

Gao, Wei-feng; Liu, San-yang; Huang, Ling-ling

2013-06-01

The artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, ABC has an insufficiency regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose an improved ABC method called as CABC where a modified search equation is applied to generate a candidate solution to improve the search ability of ABC. Furthermore, we use the orthogonal experimental design (OED) to form an orthogonal learning (OL) strategy for variant ABCs to discover more useful information from the search experiences. Owing to OED's good character of sampling a small number of well representative combinations for testing, the OL strategy can construct a more promising and efficient candidate solution. In this paper, the OL strategy is applied to three versions of ABC, i.e., the standard ABC, global-best-guided ABC (GABC), and CABC, which yields OABC, OGABC, and OCABC, respectively. The experimental results on a set of 22 benchmark functions demonstrate the effectiveness and efficiency of the modified search equation and the OL strategy. The comparisons with some other ABCs and several state-of-the-art algorithms show that the proposed algorithms significantly improve the performance of ABC. Moreover, OCABC offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all the test functions.

Alternative Fuels Data Center: Federal Laws and Incentives

Science.gov Websites

and Incentives on AddThis.com... More in this section... Search Federal State Local Examples Summary Payments Advanced Energy Research Project Grants Advanced Technology Vehicle (ATV) and Alternative Fuel Alternative Fuel Tax Exemption Alternative Fuel and Advanced Vehicle Technology Research and Demonstration

76 FR 27372 - Small Business Size Standards: Waiver of the Nonmanufacturer Rule

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-11

... market research using the Dynamic Small Business Search (DSBS) database and no small business... no small business manufacturers or processors available to participate in the Federal market. In order to be considered available to participate in the Federal market for a class of products, a small...

Media and Violence. Part Two: Searching for Solutions. Media & Values 63.

ERIC Educational Resources Information Center

Silver, Rosalind, Ed.

1993-01-01

This issue of "Media & Values" explores the influence of mass media and violence in society. The essays present various interpretations of that influence and the implications for the society. A special section entitled "Forum: Searching for Solutions" contains 5 articles. Articles include: (1) "20 Ways to Create a Culture of Caring" (Jay Dover);…

Administrative simplification, simplified for Hawai'i.

PubMed

Sakamoto, David

2012-04-01

The American health care system contains a layer of administrative controls that has become increasingly burdensome to medical practices in terms of uncompensated physician and staff time and practice costs. A primary care physician in solo practice spends between 4 and 10 hours a week directly interacting with health insurance companies and his or her staff will spend an additional 60 hours a week. This reduces patient-care availability, net practice income and physician job satisfaction. A literature review was conducted to determine possible solutions to administrative burdens physicians face in Hawai'i. A total of 51 articles were found matching search criteria with five being reports from major organizations. Twenty-seven articles were found that related to administrative simplification. The "administrative complexity" problem has been defined and its financial impact quantified. Promising solutions have been developed and proposed by private not-for-profit organizations and by the government, both state and federal. A successful administrative simplification plan would: (1) Provide rapid access to insurance information; (2) Allow medical practices to readily track specific claims; (3) Streamline the preauthorization process through the use of decision-support tools at the practice level and by directing interactions through real-time network connections between insurers and provider electronic health records, thus minimizing phone time; (4) Adopt the Universal Provider Datasource system for provider credentialing; and (5) Standardize (to the greatest degree possible) provider/insurer contracts. These solutions are outlined in detail.

The Job Search Goes Computer.

ERIC Educational Resources Information Center

Kennedy, Joyce Lain

1994-01-01

Discusses significant new developments in the electronic search process: (1) New Government Automation; (2) New Federal Initiatives; (3) New Telecommunications Services; (4) Campus Data Bases; (5) Off-Campus Data Bases; (6) Faxed or E-Mailed Resumes; (7) Automation of 3rd-Party Recruiters; (8) New Cyberservices; (9) Interview-Prep Software; (10)…

31 CFR 700.12 - Authority to search persons and vehicles.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 31 Money and Finance:Treasury 3 2013-07-01 2013-07-01 false Authority to search persons and vehicles. 700.12 Section 700.12 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FEDERAL LAW ENFORCEMENT TRAINING CENTER, DEPARTMENT OF THE TREASURY REGULATIONS GOVERNING CONDUCT...

31 CFR 700.12 - Authority to search persons and vehicles.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 31 Money and Finance:Treasury 3 2014-07-01 2014-07-01 false Authority to search persons and vehicles. 700.12 Section 700.12 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FEDERAL LAW ENFORCEMENT TRAINING CENTER, DEPARTMENT OF THE TREASURY REGULATIONS GOVERNING CONDUCT...

31 CFR 700.12 - Authority to search persons and vehicles.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 31 Money and Finance:Treasury 3 2011-07-01 2011-07-01 false Authority to search persons and vehicles. 700.12 Section 700.12 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FEDERAL LAW ENFORCEMENT TRAINING CENTER, DEPARTMENT OF THE TREASURY REGULATIONS GOVERNING CONDUCT...

31 CFR 700.12 - Authority to search persons and vehicles.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 31 Money and Finance:Treasury 3 2012-07-01 2012-07-01 false Authority to search persons and vehicles. 700.12 Section 700.12 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FEDERAL LAW ENFORCEMENT TRAINING CENTER, DEPARTMENT OF THE TREASURY REGULATIONS GOVERNING CONDUCT...

31 CFR 700.12 - Authority to search persons and vehicles.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Authority to search persons and vehicles. 700.12 Section 700.12 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FEDERAL LAW ENFORCEMENT TRAINING CENTER, DEPARTMENT OF THE TREASURY REGULATIONS GOVERNING CONDUCT...

Assessing the health information needs of unaffiliated health professionals and using training on openly available search tools and resources to provide solutions to their information access challenges and barriers.

PubMed

Matsoukas, Konstantina

2014-01-01

This article will describe a year-long (2010-11) joint project between Columbia University Medical Center's Health Sciences Library and the Institute for Family Health (IFH), a network of Federally Qualified Health Centers (FQHCs) serving disadvantaged populations in New York State. This National Institutes of Health-funded pilot project aimed to (a) determine the medical literature and training needs of IFH personnel, (b) develop generic licensing agreements with publishers that would enable a health sciences library to provide access to electronic resources for FQHC personnel, and (c) develop reference/education services for IFH personnel. How the reference and education aims were met will be described and discussed here as the lessons learned from this project may be useful to librarians considering doing instructional outreach to unaffiliated health professionals working at FQHCs nationwide.

(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…

Legislation for Youth Sport Concussion in Canada: Review, Conceptual Framework, and Recommendations.

PubMed

Russell, Kelly; Ellis, Michael J; Bauman, Shannon; Tator, Charles H

2017-05-01

In this article, we conduct a review of introduced and enacted youth concussion legislation in Canada and present a conceptual framework and recommendations for future youth sport concussion laws. We conducted online searches of federal, provincial, and territorial legislatures to identify youth concussion bills that were introduced or successfully enacted into law. Internet searches were carried out from July 26 and 27, 2016. Online searches identified six youth concussion bills that were introduced in provincial legislatures, including two in Ontario and Nova Scotia and one each in British Columbia and Quebec. One of these bills (Ontario Bill 149, Rowan's Law Advisory Committee Act, 2016) was enacted into provincial law; it is not actual concussion legislation, but rather a framework for possible enactment of legislation. Two bills have been introduced in federal parliament but neither bill has been enacted into law. At present, there is no provincial or federal concussion legislation that directly legislates concussion education, prevention, management, or policy in youth sports in Canada. The conceptual framework and recommendations presented here should be used to guide the design and implementation of future youth sport concussion laws in Canada.

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

PubMed

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

2018-03-01

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

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

PubMed Central

Keegan, Ronan M.; McNicholas, Stuart J.; Thomas, Jens M. H.; Simpkin, Adam J.; Uski, Ville; Ballard, Charles C.

2018-01-01

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

BioFed: federated query processing over life sciences linked open data.

PubMed

Hasnain, Ali; Mehmood, Qaiser; Sana E Zainab, Syeda; Saleem, Muhammad; Warren, Claude; Zehra, Durre; Decker, Stefan; Rebholz-Schuhmann, Dietrich

2017-03-15

Biomedical data, e.g. from knowledge bases and ontologies, is increasingly made available following open linked data principles, at best as RDF triple data. This is a necessary step towards unified access to biological data sets, but this still requires solutions to query multiple endpoints for their heterogeneous data to eventually retrieve all the meaningful information. Suggested solutions are based on query federation approaches, which require the submission of SPARQL queries to endpoints. Due to the size and complexity of available data, these solutions have to be optimised for efficient retrieval times and for users in life sciences research. Last but not least, over time, the reliability of data resources in terms of access and quality have to be monitored. Our solution (BioFed) federates data over 130 SPARQL endpoints in life sciences and tailors query submission according to the provenance information. BioFed has been evaluated against the state of the art solution FedX and forms an important benchmark for the life science domain. The efficient cataloguing approach of the federated query processing system 'BioFed', the triple pattern wise source selection and the semantic source normalisation forms the core to our solution. It gathers and integrates data from newly identified public endpoints for federated access. Basic provenance information is linked to the retrieved data. Last but not least, BioFed makes use of the latest SPARQL standard (i.e., 1.1) to leverage the full benefits for query federation. The evaluation is based on 10 simple and 10 complex queries, which address data in 10 major and very popular data sources (e.g., Dugbank, Sider). BioFed is a solution for a single-point-of-access for a large number of SPARQL endpoints providing life science data. It facilitates efficient query generation for data access and provides basic provenance information in combination with the retrieved data. BioFed fully supports SPARQL 1.1 and gives access to the endpoint's availability based on the EndpointData graph. Our evaluation of BioFed against FedX is based on 20 heterogeneous federated SPARQL queries and shows competitive execution performance in comparison to FedX, which can be attributed to the provision of provenance information for the source selection. Developing and testing federated query engines for life sciences data is still a challenging task. According to our findings, it is advantageous to optimise the source selection. The cataloguing of SPARQL endpoints, including type and property indexing, leads to efficient querying of data resources over the Web of Data. This could even be further improved through the use of ontologies, e.g., for abstract normalisation of query terms.

Injuries and illnesses among Federal Emergency Management Agency-certified search-and-recovery and search-and-rescue dogs deployed to Oso, Washington, following the March 22, 2014, State Route 530 landslide.

PubMed

Gordon, Lori E

2015-10-15

To establish types and rates of injuries and illnesses among search-and-recovery and search-and-rescue dogs deployed to Oso, Wash, following the March 22, 2014, State Route 530 landslide. Medical records review and cross-sectional survey. 25 Federal Emergency Management Agency-certified search dogs. On-site medical records and postdeployment laboratory test results were reviewed and an electronic survey was distributed to handlers within 8 days after demobilization. Dogs worked a total of 244 search shifts totaling 2,015 hours. Injuries and illnesses were reported in 21 (84%) dogs. Wounds (abrasions, pad wear, paw pad splits, and lacerations) were the most common injury, with an incidence rate of 28.3 wounds/1,000 hours worked. Dehydration was the most common illness, with an incidence rate of 10.4 cases of dehydration/1,000 hours worked. Total incidence rate for all health events was 66.5 events/1,000 hours worked. Two search dogs were removed from search operations for 2 days because of health issues. All others continued search operations while receiving treatment for their medical issues. All health issues were resolved during the deployment or within 2 weeks after demobilization. Results revealed that search dogs deployed to the Oso, Wash, landslide incurred injuries and illnesses similar to those reported following other disasters (dehydration, wounding, vomiting, and diarrhea) but also incurred medical issues not previously documented (acute caudal myopathy, cutaneous mass ruptures, and fever). The reported medical issues were minor; however, prompt veterinary care helped prevent them from developing into more serious conditions.

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

PubMed

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

2017-11-01

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

Committee-Based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems.

PubMed

Wang, Handing; Jin, Yaochu; Doherty, John

2017-09-01

Function evaluations (FEs) of many real-world optimization problems are time or resource consuming, posing a serious challenge to the application of evolutionary algorithms (EAs) to solve these problems. To address this challenge, the research on surrogate-assisted EAs has attracted increasing attention from both academia and industry over the past decades. However, most existing surrogate-assisted EAs (SAEAs) either still require thousands of expensive FEs to obtain acceptable solutions, or are only applied to very low-dimensional problems. In this paper, a novel surrogate-assisted particle swarm optimization (PSO) inspired from committee-based active learning (CAL) is proposed. In the proposed algorithm, a global model management strategy inspired from CAL is developed, which searches for the best and most uncertain solutions according to a surrogate ensemble using a PSO algorithm and evaluates these solutions using the expensive objective function. In addition, a local surrogate model is built around the best solution obtained so far. Then, a PSO algorithm searches on the local surrogate to find its optimum and evaluates it. The evolutionary search using the global model management strategy switches to the local search once no further improvement can be observed, and vice versa. This iterative search process continues until the computational budget is exhausted. Experimental results comparing the proposed algorithm with a few state-of-the-art SAEAs on both benchmark problems up to 30 decision variables as well as an airfoil design problem demonstrate that the proposed algorithm is able to achieve better or competitive solutions with a limited budget of hundreds of exact FEs.

A Novel Quantum-Behaved Bat Algorithm with Mean Best Position Directed for Numerical Optimization

PubMed Central

Zhu, Wenyong; Liu, Zijuan; Duan, Qingyan; Cao, Long

2016-01-01

This paper proposes a novel quantum-behaved bat algorithm with the direction of mean best position (QMBA). In QMBA, the position of each bat is mainly updated by the current optimal solution in the early stage of searching and in the late search it also depends on the mean best position which can enhance the convergence speed of the algorithm. During the process of searching, quantum behavior of bats is introduced which is beneficial to jump out of local optimal solution and make the quantum-behaved bats not easily fall into local optimal solution, and it has better ability to adapt complex environment. Meanwhile, QMBA makes good use of statistical information of best position which bats had experienced to generate better quality solutions. This approach not only inherits the characteristic of quick convergence, simplicity, and easy implementation of original bat algorithm, but also increases the diversity of population and improves the accuracy of solution. Twenty-four benchmark test functions are tested and compared with other variant bat algorithms for numerical optimization the simulation results show that this approach is simple and efficient and can achieve a more accurate solution. PMID:27293424

Heuristics in Problem Solving: The Role of Direction in Controlling Search Space

ERIC Educational Resources Information Center

Chu, Yun; Li, Zheng; Su, Yong; Pizlo, Zygmunt

2010-01-01

Isomorphs of a puzzle called m+m resulted in faster solution times and an easily reproduced solution path in a labeled version of the problem compared to a more difficult binary version. We conjecture that performance is related to a type of heuristic called direction that not only constrains search space in the labeled version, but also…

Lévy flight artificial bee colony algorithm

NASA Astrophysics Data System (ADS)

Sharma, Harish; Bansal, Jagdish Chand; Arya, K. V.; Yang, Xin-She

2016-08-01

Artificial bee colony (ABC) optimisation algorithm is a relatively simple and recent population-based probabilistic approach for global optimisation. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the ABC, there is a high chance to skip the true solution due to its large step sizes. In order to balance between diversity and convergence in the ABC, a Lévy flight inspired search strategy is proposed and integrated with ABC. The proposed strategy is named as Lévy Flight ABC (LFABC) has both the local and global search capability simultaneously and can be achieved by tuning the Lévy flight parameters and thus automatically tuning the step sizes. In the LFABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Furthermore, to improve the exploration capability, the numbers of scout bees are increased. The experiments on 20 test problems of different complexities and five real-world engineering optimisation problems show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest-guided ABC, best-so-far ABC and modified ABC in most of the experiments.

An Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch.

PubMed

Yurtkuran, Alkın; Emel, Erdal

2016-01-01

The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead of greedy selection between old solution and new candidate solution, worse candidate solutions have a probability to be accepted. Additionally, the acceptance probability of worse candidates is nonlinearly decreased throughout the search process adaptively. Moreover, in order to improve the performance of the ABC and balance the intensification and diversification, a probabilistic multisearch strategy is presented. Three different search equations with distinctive characters are employed using predetermined search probabilities. By implementing a new solution acceptance rule and a probabilistic multisearch approach, the intensification and diversification performance of the ABC algorithm is improved. The proposed algorithm has been tested on well-known benchmark functions of varying dimensions by comparing against novel ABC variants, as well as several recent state-of-the-art algorithms. Computational results show that the proposed ABC-SA outperforms other ABC variants and is superior to state-of-the-art algorithms proposed in the literature.

Planned Parenthood Federation of America: Its Role as Provider of Information Services.

ERIC Educational Resources Information Center

Roberts, Gloria A.

1985-01-01

Planned Parenthood Federation of America was established in 1916 to fulfill the need to provide family planning information and services to women. The Katharine Dexter McCormick Library serves organizational goals by publishing family planning bibliographies, performing literature searches on in-house database, and providing reference services to…

Starting Early: A Guide to Federal Resources in Maternal and Child Health.

ERIC Educational Resources Information Center

Mockenhaupt, Robin

Designed to simplify the search for federal government resources on maternal and child health, this guide was prepared for use by health professionals, educators, administrators, and the general public. It describes over 250 print and nonprint (posters, audiovisuals) resources in prenatal, infant, child, and adolescent health. The guide is divided…

78 FR 35801 - Safety and Security Zones, San Juan Captain of the Port Zone

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-14

... Rico and U. S. Virgin Island port communities. This action would modify existing safety zones... federal holidays. The telephone number is 202-366-9329. See the ``Public Participation and Request for..., except federal holidays. 3. Privacy Act Anyone can search the electronic form of comments received into...

78 FR 40519 - Cooper Nuclear Station; Application and Amendment to Facility Operating License Involving...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-05

...; Application and Amendment to Facility Operating License Involving Proposed No Significant Hazards... submitting comments on a specific subject): Federal Rulemaking Web site: Go to http://www.regulations.gov and...: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID NRC-2013-0139. NRC...

Regulations.gov Federal Regulatory Portal

ERIC Educational Resources Information Center

Ashlin, John; Davis, Richard; Dalecky, Selene; Grasso, Richard; LaPlant, Lisa; Morales, Oscar; Nelson, Jennifer; White, Michael; Whitt, Sharon A.

2004-01-01

The Regulations.gov Online Rulemaking Project is 1 of the 24 e-Government Initiatives on the President's Management Agenda (PMA), which was announced by the White House in 2001. The Regulations.gov Web site is the central electronic rulemaking portal for the federal government. Through a single Web site, citizens can search, view, and comment on…

Defining Values for Research and Technology: The University's Changing Role

ERIC Educational Resources Information Center

Greenough, William T., Ed.; McConnaughay, Philip J., Ed.; Kesan, Jay P., Ed.

2006-01-01

Since the end of the Cold War, federal funding for research at American universities has sharply decreased, leaving administrators searching for a new benefactor. At the same time, changes in federal policy permitting universities to patent, license, and profit from their discoveries combined with the emergence of new fields that thinned the lines…

Application of Harmony Search algorithm to the solution of groundwater management models

NASA Astrophysics Data System (ADS)

Tamer Ayvaz, M.

2009-06-01

This study proposes a groundwater resources management model in which the solution is performed through a combined simulation-optimization model. A modular three-dimensional finite difference groundwater flow model, MODFLOW is used as the simulation model. This model is then combined with a Harmony Search (HS) optimization algorithm which is based on the musical process of searching for a perfect state of harmony. The performance of the proposed HS based management model is tested on three separate groundwater management problems: (i) maximization of total pumping from an aquifer (steady-state); (ii) minimization of the total pumping cost to satisfy the given demand (steady-state); and (iii) minimization of the pumping cost to satisfy the given demand for multiple management periods (transient). The sensitivity of HS algorithm is evaluated by performing a sensitivity analysis which aims to determine the impact of related solution parameters on convergence behavior. The results show that HS yields nearly same or better solutions than the previous solution methods and may be used to solve management problems in groundwater modeling.

Climate Prediction Center - Outlooks: UV Alert Forecast

Science.gov Websites

Organization Search Go Search the CPC Go About Us Our Mission Who We Are Contact Us CPC Information CPC Web Team USA.gov is the U.S. Government's official Web portal to all Federal, state and local government Web resources and services. HOME > Stratosphere Home > Stratosphere UV Index > UV Alert

How Many People Search the ERIC Database Each Day?

ERIC Educational Resources Information Center

Rudner, Lawrence

This study estimated the number of people searching the ERIC database each day. The Educational Resources Information Center (ERIC) is a national information system designed to provide ready access to an extensive body of education-related literature. Federal funds traditionally have paid for the development of the database, but not the…

Climate Prediction Center - Monitoring Atlantic Hurricane Potential

Science.gov Websites

Organization Search Go Search the CPC Go About Us Our Mission Who We Are Contact Us CPC Information CPC Web Team USA.gov is the U.S. Government's official Web portal to all Federal, state and local government Web resources and services. HOME > Monitoring and Data > Monitoring Atlantic Hurricane Potential

78 FR 19695 - National Advisory Committee on Institutional Quality and Integrity (NACIQI)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-02

... of higher education under Title IV, of the HEA, together with recommendations for improvement in such... available via the Federal Digital System at: www.gpo.gov/fdsys . At this site you can view this document, as... the article search feature at: www.federalregister.gov . Specifically, through the advanced search...

77 FR 64493 - National Advisory Committee on Institutional Quality and Integrity (NACIQI)

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-22

... process for institutions of higher education under Title IV, of the HEA, together with recommendations for... available via the Federal Digital System at: www.gpo.gov/fdsys . At this site you can view this document, as... the article search feature at: www.federalregister.gov . Specifically, through the advanced search...

Helping Families Search for Solutions: Working with Adolescents

ERIC Educational Resources Information Center

Paylo, Matthew J.

2005-01-01

In this column, the author focuses on the ways that family counselors can use solution-based therapies (solution-oriented and solution-focused) to work with families with adolescents in individual and/or family therapy. The theoretical foundation for solution-based therapies suggests techniques that help families focus on solutions and not remain…

Small Business Innovations

NASA Technical Reports Server (NTRS)

1993-01-01

Under an Army Small Business Innovation Research (SBIR) grant, Symbiotics, Inc. developed a software system that permits users to upgrade products from standalone applications so they can communicate in a distributed computing environment. Under a subsequent NASA SBIR grant, Symbiotics added additional tools to the SOCIAL product to enable NASA to coordinate conventional systems for planning Shuttle launch support operations. Using SOCIAL, data may be shared among applications in a computer network even when the applications are written in different programming languages. The product was introduced to the commercial market in 1993 and is used to monitor and control equipment for operation support and to integrate financial networks. The SBIR program was established to increase small business participation in federal R&D activities and to transfer government research to industry. InQuisiX is a reuse library providing high performance classification, cataloging, searching, browsing, retrieval and synthesis capabilities. These form the foundation for software reuse, producing higher quality software at lower cost and in less time. Software Productivity Solutions, Inc. developed the technology under Small Business Innovation Research (SBIR) projects funded by NASA and the Army and is marketing InQuisiX in conjunction with Science Applications International Corporation (SAIC). The SBIR program was established to increase small business participation in federal R&D activities and to transfer government research to industry.

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

PubMed Central

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments. PMID:24701158

An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.

PubMed

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

Is Federalism Based on Ethnic Partition a Viable Solution in Iraq?

DTIC Science & Technology

2007-12-14

the expansion of federalism may be a potential solution for resolving the conflict in Iraq. The fourth pillar of the political track in the...Iraq) was ungovernable. He noted deep-seated religious, sectional, and political differences in what had become a separate country only after the...made substantial miscalculations when it removed the Sunnis from power in Iraq. The Bush administration thought of politics as the relationship

Three hybridization models based on local search scheme for job shop scheduling problem

NASA Astrophysics Data System (ADS)

Balbi Fraga, Tatiana

2015-05-01

This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

Multi-Objective Community Detection Based on Memetic Algorithm

PubMed Central

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels. PMID:25932646

Multi-objective community detection based on memetic algorithm.

PubMed

Wu, Peng; Pan, Li

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels.

A Corporate Library's "Single Search Box" Solution

ERIC Educational Resources Information Center

Waldstein, Robert

2013-01-01

Alcatel-Lucent has had an internal library website called InfoView since 1993. They always had pages for the various diverse resources they maintained for Alcatel-Lucent employees, such as books, serials, artifacts, market reports, and discounts. Each page had two search boxes: one for a "site" search on all pages and one searching the…

Preparing for Federal Grant Consolidation: A Reexamination and Search for Affiliate Guidance.

ERIC Educational Resources Information Center

Ross, E. Clarke

1981-01-01

The paper reviews research and experience in human service integration and examines the impact of federal grant consolidation upon services for the disabled. Reasons for the existence of categorical aid are noted. An idealized integrated services system is proposed, and factors such as excessive red tape and lack of coordination which reflect a…

77 FR 47677 - Duke Energy Carolinas, LLC, McGuire Nuclear Station, Units 1 and 2, Notice of Consideration of...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-09

... Facility Operating License, Proposed No Significant Hazards Consideration Determination, and Opportunity... following methods: Federal Rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID... related to this document by any of the following methods: Federal Rulemaking Web Site: Go to http://www...

78 FR 6142 - Vogtle Electric Generating Plant, Units 3 and 4; Application and Amendment to Combined Licenses...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-29

... NRC-2008- 0252. You may submit comments by any of the following methods: Federal Rulemaking Web site... publicly available, by any of the following methods: Federal Rulemaking Web site: Go to http://www... ``Begin Web- based ADAMS Search.'' For problems with ADAMS, please contact the NRC's Public Document Room...

San Diego State U. Defends Its Role in Federal Drug Sting

ERIC Educational Resources Information Center

Lipka, Sara

2008-01-01

When a freshman at San Diego State University (SDSU) died of a cocaine overdose last May, the campus police chief decided to pursue a full-scale investigation. In December, he summoned undercover agents from the federal Drug Enforcement Administration to pose as students and roam the campus in search of illegal drugs. According to college…

13 CFR 127.102 - What are the definitions of the terms used in this part?

Code of Federal Regulations, 2010 CFR

2010-01-01

... ADMINISTRATION WOMEN-OWNED SMALL BUSINESS FEDERAL CONTRACT ASSISTANCE PROCEDURES General Provisions § 127.102... contractor data for the Federal government. CCR also serves as the single portal for conducting searches of... more women who are U.S. citizens and who are economically disadvantaged in accordance with §§ 127.200...

Insight into the ten-penny problem: guiding search by constraints and maximization.

PubMed

Öllinger, Michael; Fedor, Anna; Brodt, Svenja; Szathmáry, Eörs

2017-09-01

For a long time, insight problem solving has been either understood as nothing special or as a particular class of problem solving. The first view implicates the necessity to find efficient heuristics that restrict the search space, the second, the necessity to overcome self-imposed constraints. Recently, promising hybrid cognitive models attempt to merge both approaches. In this vein, we were interested in the interplay of constraints and heuristic search, when problem solvers were asked to solve a difficult multi-step problem, the ten-penny problem. In three experimental groups and one control group (N = 4 × 30) we aimed at revealing, what constraints drive problem difficulty in this problem, and how relaxing constraints, and providing an efficient search criterion facilitates the solution. We also investigated how the search behavior of successful problem solvers and non-solvers differ. We found that relaxing constraints was necessary but not sufficient to solve the problem. Without efficient heuristics that facilitate the restriction of the search space, and testing the progress of the problem solving process, the relaxation of constraints was not effective. Relaxing constraints and applying the search criterion are both necessary to effectively increase solution rates. We also found that successful solvers showed promising moves earlier and had a higher maximization and variation rate across solution attempts. We propose that this finding sheds light on how different strategies contribute to solving difficult problems. Finally, we speculate about the implications of our findings for insight problem solving.

General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

NASA Astrophysics Data System (ADS)

Fu, Xiang-Qun; Bao, Wan-Su; Wang, Xiang; Shi, Jian-Hong

2016-10-01

Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is \\sumj = 0d {(O(\\sqrt {Cn - k + 1d - j }) + O(C_kj log C_k^j))} with Σd i =0 Ck i memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm. Supported by the National Basic Research Program of China under Grant No. 2013CB338002 and the National Natural Science Foundation of China under Grant No. 61502526

Russian Electoral Politics and the Search for National Identity.

ERIC Educational Resources Information Center

Ishiyama, John T.; Launer, Michael K.; Likhachova, Irina E.; Williams, David Cratis; Young, Marilyn J.

1997-01-01

Explores the role of national identity formation in the democratization of the Russian Federation, analyzing arguments of the 1993 and 1995 Duma elections and the 1996 Russian presidential campaign. Contends results of these elections say more about the search for Russian identity in the wake of social and economic change than they do about the…

Climate Prediction Center - Monitoring East Pacific Hurricane Potential

Science.gov Websites

Organization Search Go Search the CPC Go About Us Our Mission Who We Are Contact Us CPC Information CPC Web Team USA.gov is the U.S. Government's official Web portal to all Federal, state and local government Web resources and services. HOME > Monitoring and Data > Monitoring East Pacific Hurricane

Human Flesh Search Engine and Online Privacy.

PubMed

Zhang, Yang; Gao, Hong

2016-04-01

Human flesh search engine can be a double-edged sword, bringing convenience on the one hand and leading to infringement of personal privacy on the other hand. This paper discusses the ethical problems brought about by the human flesh search engine, as well as possible solutions.

Knowledge Distance, Cognitive-Search Processes, and Creativity: The Making of Winning Solutions in Science Contests.

PubMed

Acar, Oguz Ali; van den Ende, Jan

2016-05-01

Prior research has provided conflicting arguments and evidence about whether people who are outsiders or insiders relative to a knowledge domain are more likely to demonstrate scientific creativity in that particular domain. We propose that the nature of the relationship between creativity and the distance of an individual's expertise from a knowledge domain depends on his or her cognitive processes of problem solving (i.e., cognitive-search effort and cognitive-search variation). In an analysis of 230 solutions generated in a science contest platform, we found that distance was positively associated with creativity when problem solvers engaged in a focused search (i.e., low cognitive-search variation) and exerted a high level of cognitive effort. People whose expertise was close to a knowledge domain, however, were more likely to demonstrate creativity in that domain when they drew on a wide variety of different knowledge elements for recombination (i.e., high cognitive-search variation) and exerted substantial cognitive effort. © The Author(s) 2016.

Phaser.MRage: automated molecular replacement

PubMed Central

Bunkóczi, Gábor; Echols, Nathaniel; McCoy, Airlie J.; Oeffner, Robert D.; Adams, Paul D.; Read, Randy J.

2013-01-01

Phaser.MRage is a molecular-replacement automation framework that implements a full model-generation workflow and provides several layers of model exploration to the user. It is designed to handle a large number of models and can distribute calculations efficiently onto parallel hardware. In addition, phaser.MRage can identify correct solutions and use this information to accelerate the search. Firstly, it can quickly score all alternative models of a component once a correct solution has been found. Secondly, it can perform extensive analysis of identified solutions to find protein assemblies and can employ assembled models for subsequent searches. Thirdly, it is able to use a priori assembly information (derived from, for example, homologues) to speculatively place and score molecules, thereby customizing the search procedure to a certain class of protein molecule (for example, antibodies) and incorporating additional biological information into molecular replacement. PMID:24189240

Phaser.MRage: automated molecular replacement.

PubMed

Bunkóczi, Gábor; Echols, Nathaniel; McCoy, Airlie J; Oeffner, Robert D; Adams, Paul D; Read, Randy J

2013-11-01

Phaser.MRage is a molecular-replacement automation framework that implements a full model-generation workflow and provides several layers of model exploration to the user. It is designed to handle a large number of models and can distribute calculations efficiently onto parallel hardware. In addition, phaser.MRage can identify correct solutions and use this information to accelerate the search. Firstly, it can quickly score all alternative models of a component once a correct solution has been found. Secondly, it can perform extensive analysis of identified solutions to find protein assemblies and can employ assembled models for subsequent searches. Thirdly, it is able to use a priori assembly information (derived from, for example, homologues) to speculatively place and score molecules, thereby customizing the search procedure to a certain class of protein molecule (for example, antibodies) and incorporating additional biological information into molecular replacement.

Renewable Energy Prices in State-Level Feed-in Tariffs. Federal Law Constraints and Possible Solutions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hempling, Scott; Elefant, Carolyn; Cory, Karlynn

2010-01-01

This report details how state feed-in tariff (FIT) programs can be legally implemented and how they can comply with federal requirements. The report describes the federal constraints on FIT programs and identifies legal methods that are free of those constrains.

A k-Vector Approach to Sampling, Interpolation, and Approximation

NASA Astrophysics Data System (ADS)

Mortari, Daniele; Rogers, Jonathan

2013-12-01

The k-vector search technique is a method designed to perform extremely fast range searching of large databases at computational cost independent of the size of the database. k-vector search algorithms have historically found application in satellite star-tracker navigation systems which index very large star catalogues repeatedly in the process of attitude estimation. Recently, the k-vector search algorithm has been applied to numerous other problem areas including non-uniform random variate sampling, interpolation of 1-D or 2-D tables, nonlinear function inversion, and solution of systems of nonlinear equations. This paper presents algorithms in which the k-vector search technique is used to solve each of these problems in a computationally-efficient manner. In instances where these tasks must be performed repeatedly on a static (or nearly-static) data set, the proposed k-vector-based algorithms offer an extremely fast solution technique that outperforms standard methods.

Technology in rural transportation. Simple solution #9, transportation operations optimization

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #7, lane drop driver awareness

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #8, mobile weather sensors

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #4, low cost vehicle detection

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #3, coordinated rural transit services

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #14, public service weather radio

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #2, coordinate addressing system

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

A guided search genetic algorithm using mined rules for optimal affective product design

NASA Astrophysics Data System (ADS)

Fung, Chris K. Y.; Kwong, C. K.; Chan, Kit Yan; Jiang, H.

2014-08-01

Affective design is an important aspect of new product development, especially for consumer products, to achieve a competitive edge in the marketplace. It can help companies to develop new products that can better satisfy the emotional needs of customers. However, product designers usually encounter difficulties in determining the optimal settings of the design attributes for affective design. In this article, a novel guided search genetic algorithm (GA) approach is proposed to determine the optimal design attribute settings for affective design. The optimization model formulated based on the proposed approach applied constraints and guided search operators, which were formulated based on mined rules, to guide the GA search and to achieve desirable solutions. A case study on the affective design of mobile phones was conducted to illustrate the proposed approach and validate its effectiveness. Validation tests were conducted, and the results show that the guided search GA approach outperforms the GA approach without the guided search strategy in terms of GA convergence and computational time. In addition, the guided search optimization model is capable of improving GA to generate good solutions for affective design.

Improved Genetic Algorithm Based on the Cooperation of Elite and Inverse-elite

NASA Astrophysics Data System (ADS)

Kanakubo, Masaaki; Hagiwara, Masafumi

In this paper, we propose an improved genetic algorithm based on the combination of Bee system and Inverse-elitism, both are effective strategies for the improvement of GA. In the Bee system, in the beginning, each chromosome tries to find good solution individually as global search. When some chromosome is regarded as superior one, the other chromosomes try to find solution around there. However, since chromosomes for global search are generated randomly, Bee system lacks global search ability. On the other hand, in the Inverse-elitism, an inverse-elite whose gene values are reversed from the corresponding elite is produced. This strategy greatly contributes to diversification of chromosomes, but it lacks local search ability. In the proposed method, the Inverse-elitism with Pseudo-simplex method is employed for global search of Bee system in order to strengthen global search ability. In addition, it also has strong local search ability. The proposed method has synergistic effects of the three strategies. We confirmed validity and superior performance of the proposed method by computer simulations.

An Analysis of the Applicability of Federal Law Regarding Hash-Based Searches of Digital Media

DTIC Science & Technology

2014-06-01

that connect the SD card to the crime. • The second scenario involves a border crossing search by Customs and Border Pro - tection (CBP). In this... marijuana was being grown in the home of Danny Lee Kyllo due to circumstances involving another investiga- tion. Knowing that the indoor growth of marijuana ...requested and was issued a warrant to search the home for drugs. Upon execution of the warrant, more than 100 marijuana plants were found and Kyllo was

An evolutionary strategy based on partial imitation for solving optimization problems

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2016-12-01

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define 'partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted 'partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.

Particle swarm optimization-based automatic parameter selection for deep neural networks and its applications in large-scale and high-dimensional data

PubMed Central

2017-01-01

In this paper, we propose a new automatic hyperparameter selection approach for determining the optimal network configuration (network structure and hyperparameters) for deep neural networks using particle swarm optimization (PSO) in combination with a steepest gradient descent algorithm. In the proposed approach, network configurations were coded as a set of real-number m-dimensional vectors as the individuals of the PSO algorithm in the search procedure. During the search procedure, the PSO algorithm is employed to search for optimal network configurations via the particles moving in a finite search space, and the steepest gradient descent algorithm is used to train the DNN classifier with a few training epochs (to find a local optimal solution) during the population evaluation of PSO. After the optimization scheme, the steepest gradient descent algorithm is performed with more epochs and the final solutions (pbest and gbest) of the PSO algorithm to train a final ensemble model and individual DNN classifiers, respectively. The local search ability of the steepest gradient descent algorithm and the global search capabilities of the PSO algorithm are exploited to determine an optimal solution that is close to the global optimum. We constructed several experiments on hand-written characters and biological activity prediction datasets to show that the DNN classifiers trained by the network configurations expressed by the final solutions of the PSO algorithm, employed to construct an ensemble model and individual classifier, outperform the random approach in terms of the generalization performance. Therefore, the proposed approach can be regarded an alternative tool for automatic network structure and parameter selection for deep neural networks. PMID:29236718

Children's Cardiomyopathy Foundation

MedlinePlus

... search for cures while improving diagnosis, treatment, and quality of life for children affected by cardiomyopathy. CCF actively works with federal agencies, medical societies, voluntary health organizations, ...

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum.

PubMed

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents' positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness.

Database Search Engines: Paradigms, Challenges and Solutions.

PubMed

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

2016-01-01

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

Technology in rural transportation. Simple solution #12, public agency outreach for transportation management

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #10, wireless pagers to activate warning beacons

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #6, traveler information on the internet

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #11, Emergency vehicle traffic signal pre-emption

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #1, traveler warnings for spot hazardous conditions

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

Technology in rural transportation. Simple solution #5, traveler information using fax machines

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

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

NASA Astrophysics Data System (ADS)

Aungkulanon, P.; Luangpaiboon, P.

2010-10-01

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

An active visual search interface for Medline.

PubMed

Xuan, Weijian; Dai, Manhong; Mirel, Barbara; Wilson, Justin; Athey, Brian; Watson, Stanley J; Meng, Fan

2007-01-01

Searching the Medline database is almost a daily necessity for many biomedical researchers. However, available Medline search solutions are mainly designed for the quick retrieval of a small set of most relevant documents. Because of this search model, they are not suitable for the large-scale exploration of literature and the underlying biomedical conceptual relationships, which are common tasks in the age of high throughput experimental data analysis and cross-discipline research. We try to develop a new Medline exploration approach by incorporating interactive visualization together with powerful grouping, summary, sorting and active external content retrieval functions. Our solution, PubViz, is based on the FLEX platform designed for interactive web applications and its prototype is publicly available at: http://brainarray.mbni.med.umich.edu/Brainarray/DataMining/PubViz.

Administrative Simplification, Simplified for Hawai‘i

PubMed Central

2012-01-01

Background The American health care system contains a layer of administrative controls that has become increasingly burdensome to medical practices in terms of uncompensated physician and staff time and practice costs. A primary care physician in solo practice spends between 4 and 10 hours a week directly interacting with health insurance companies and his or her staff will spend an additional 60 hours a week. This reduces patient-care availability, net practice income and physician job satisfaction. Methods A literature review was conducted to determine possible solutions to administrative burdens physicians face in Hawai‘i. A total of 51 articles were found matching search criteria with five being reports from major organizations. Results Twenty-seven articles were found that related to administrative simplification. The “administrative complexity” problem has been defined and its financial impact quantified. Promising solutions have been developed and proposed by private not-for-profit organizations and by the government, both state and federal. Discussion A successful administrative simplification plan would: (1) Provide rapid access to insurance information; (2) Allow medical practices to readily track specific claims; (3) Streamline the preauthorization process through the use of decision-support tools at the practice level and by directing interactions through real-time network connections between insurers and provider electronic health records, thus minimizing phone time; (4) Adopt the Universal Provider Datasource system for provider credentialing; and (5) Standardize (to the greatest degree possible) provider/insurer contracts. These solutions are outlined in detail. PMID:22737644

MONSS: A multi-objective nonlinear simplex search approach

NASA Astrophysics Data System (ADS)

Zapotecas-Martínez, Saúl; Coello Coello, Carlos A.

2016-01-01

This article presents a novel methodology for dealing with continuous box-constrained multi-objective optimization problems (MOPs). The proposed algorithm adopts a nonlinear simplex search scheme in order to obtain multiple elements of the Pareto optimal set. The search is directed by a well-distributed set of weight vectors, each of which defines a scalarization problem that is solved by deforming a simplex according to the movements described by Nelder and Mead's method. Considering an MOP with n decision variables, the simplex is constructed using n+1 solutions which minimize different scalarization problems defined by n+1 neighbor weight vectors. All solutions found in the search are used to update a set of solutions considered to be the minima for each separate problem. In this way, the proposed algorithm collectively obtains multiple trade-offs among the different conflicting objectives, while maintaining a proper representation of the Pareto optimal front. In this article, it is shown that a well-designed strategy using just mathematical programming techniques can be competitive with respect to the state-of-the-art multi-objective evolutionary algorithms against which it was compared.

Analysis of Health Sector Budget of Nepal.

PubMed

Dulal, R K; Magar, A; Karki, S D; Khatiwada, D; Hamal, P K

2014-01-01

Primarily, health sector connects two segments - medicine and public health, where medicine deals with individual patients and public health with the population health. Budget enables both the disciplines to function effectively. The Interim Constitution of Nepal, 2007 has adapted the inspiration of federalism and declared the provision of basic health care services free of cost as a fundamental right, which needs strengthening under foreseen federalism. An observational retrospective cohort study, aiming at examining the health sector budget allocation and outcome, was done. Authors gathered health budget figures (2001 to 2013) and facts published from authentic sources. Googling was done for further information. The keywords for search used were: fiscal federalism, health care, public health, health budget, health financing, external development partner, bilateral and multilateral partners and healthcare accessibility. The search was limited to English and Nepali-language report, articles and news published. Budget required to meet the population's need is still limited in Nepal. The health sector budget could not achieve even gainful results due to mismatch in policy and policy implementation despite of political commitment. Since Nepal is transforming towards federalism, an increased complexity under federated system is foreseeable, particularly in the face of changed political scenario and its players. It should have clear goals, financing policy and strict implementation plans for budget execution, task performance and achieving results as per planning. Additionally, collection of revenue, risk pooling and purchasing of services should be better integrated between central government and federated states to horn effectiveness and efficiency.

Local economic importance of designated wilderness: Evidence in the literature

Treesearch

Neal Christensen

2011-01-01

As we approach the 50th anniversary of the passage of the 1964 Wilderness Act, the public and federal land management agencies continue to search for a better understanding of the benefits and costs of inclusion of new areas within the National Wilderness Preservation System (NWPS). There are numerous U.S. federal lands considered suitable for inclusion in the NWPS....

78 FR 46855 - Safety Zone; East End Maritime Foundation Fireworks Display, Greenport Harbor, Greenport, NY

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-02

.... Deliveries accepted between 9 a.m. and 5 p.m., Monday through Friday, except federal holidays. The telephone.... and 5 p.m., Monday through Friday, except Federal holidays. 3. Privacy Act Anyone can search the.... This rule will be enforced for a limited period of time on September 21, 2013, with a rain date of...

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…

Geometric Models for Collaborative Search and Filtering

ERIC Educational Resources Information Center

Bitton, Ephrat

2011-01-01

This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

Improving PHENIX search with Solr, Nutch and Drupal.

NASA Astrophysics Data System (ADS)

Morrison, Dave; Sourikova, Irina

2012-12-01

During its 20 years of R&D, construction and operation the PHENIX experiment at the Relativistic Heavy Ion Collider (RHIC) has accumulated large amounts of proprietary collaboration data that is hosted on many servers around the world and is not open for commercial search engines for indexing and searching. The legacy search infrastructure did not scale well with the fast growing PHENIX document base and produced results inadequate in both precision and recall. After considering the possible alternatives that would provide an aggregated, fast, full text search of a variety of data sources and file formats we decided to use Nutch [1] as a web crawler and Solr [2] as a search engine. To present XML-based Solr search results in a user-friendly format we use Drupal [3] as a web interface to Solr. We describe the experience of building a federated search for a heterogeneous collection of 10 million PHENIX documents with Nutch, Solr and Drupal.

Demographic management in a federated healthcare environment.

PubMed

Román, I; Roa, L M; Reina-Tosina, J; Madinabeitia, G

2006-09-01

The purpose of this paper is to provide a further step toward the decentralization of identification and demographic information about persons by solving issues related to the integration of demographic agents in a federated healthcare environment. The aim is to identify a particular person in every system of a federation and to obtain a unified view of his/her demographic information stored in different locations. This work is based on semantic models and techniques, and pursues the reconciliation of several current standardization works including ITU-T's Open Distributed Processing, CEN's prEN 12967, OpenEHR's dual and reference models, CEN's General Purpose Information Components and CORBAmed's PID service. We propose a new paradigm for the management of person identification and demographic data, based on the development of an open architecture of specialized distributed components together with the incorporation of techniques for the efficient management of domain ontologies, in order to have a federated demographic service. This new service enhances previous correlation solutions sharing ideas with different standards and domains like semantic techniques and database systems. The federation philosophy enforces us to devise solutions to the semantic, functional and instance incompatibilities in our approach. Although this work is based on several models and standards, we have improved them by combining their contributions and developing a federated architecture that does not require the centralization of demographic information. The solution is thus a good approach to face integration problems and the applied methodology can be easily extended to other tasks involved in the healthcare organization.

Local search heuristic for the discrete leader-follower problem with multiple follower objectives

NASA Astrophysics Data System (ADS)

Kochetov, Yury; Alekseeva, Ekaterina; Mezmaz, Mohand

2016-10-01

We study a discrete bilevel problem, called as well as leader-follower problem, with multiple objectives at the lower level. It is assumed that constraints at the upper level can include variables of both levels. For such ill-posed problem we define feasible and optimal solutions for pessimistic case. A central point of this work is a two stage method to get a feasible solution under the pessimistic case, given a leader decision. The target of the first stage is a follower solution that violates the leader constraints. The target of the second stage is a pessimistic feasible solution. Each stage calls a heuristic and a solver for a series of particular mixed integer programs. The method is integrated inside a local search based heuristic that is designed to find near-optimal leader solutions.

77 FR 46128 - Proposed Revision 0 to Standard Review Plan Section 19.5: Adequacy of Design Features and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-02

... searching on http://www.regulations.gov under Docket ID NRC-2012-0180. You may submit comments by any of the following methods: Federal rulemaking Web site: Go to http://www.regulations.gov and search for Docket ID..., Policy Branch, Division of Advanced Reactors and Rulemaking, Office of New Reactors, U.S. Nuclear...

75 FR 23760 - Notice of Public Hearing Regarding Environmental Protection Agency Region III's Proposed...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-04

... County, West Virginia in the Federal Register soliciting comments from the public. The permittee is Mingo Logan Coal Company. That notice can be found at http://www.regulations.gov (search for EPA-R03-OW-2009... at http://www.regulations.gov (search for EPA-R03-OW-2009-0985). For those who have special needs and...

77 FR 44110 - Special Conditions: Agusta S.p.A. Model AW139 and AB139 Helicopter, Installation of a Search and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-27

... must comply with the following: (i) The hoist operator control must be designed and located to provide... failures affecting the control system must be evaluated. (ii) The AFCS must be designed so that it cannot... Helicopter, Installation of a Search and Rescue (SAR) Automatic Flight Control System (AFCS) AGENCY: Federal...

An Exploratory Study of School-Age Children's Use of a Heterogeneous Resource Site

ERIC Educational Resources Information Center

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

2008-01-01

In this study, students' use of a new educational Web portal was evaluated with particular emphasis on searching and browsing strategies. The effects and implications of a federated search system are also discussed. Fifty-four students, ranging from 5th to 12th grade, were given five tasks to complete using the SchoolRooms interface. The tasks…

45 CFR 2540.203 - What search components of the National Service Criminal History Check must I satisfy to determine...

Code of Federal Regulations, 2014 CFR

2014-10-01

... Public Web site (NSOPW), and (2) Either: (i) A name- or fingerprint-based search of the official state...) Submission of fingerprints through a state central record repository for a fingerprint-based Federal Bureau... Department of Justice (DOJ) National Sex Offender Public Web site (NSOPW); (ii) A name- or fingerprint-based...

77 FR 47114 - Manufacturer of Controlled Substances; Notice of Registration; Catalent Pharma Solutions, Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-07

...; Notice of Registration; Catalent Pharma Solutions, Inc. By Notice dated April 17, 2012, and published in the Federal Register on April 26, 2012, 77 FR 24984, Catalent Pharma Solutions, Inc., 10381 Decatur...) and 952(a) and determined that the registration of Catalent Pharma Solutions, Inc. to import the basic...

Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem

NASA Astrophysics Data System (ADS)

Quan, Zhe; Wu, Lei

2017-09-01

This article investigates the use of parallel computing for solving the disjunctively constrained knapsack problem. The proposed parallel computing model can be viewed as a cooperative algorithm based on a multi-neighbourhood search. The cooperation system is composed of a team manager and a crowd of team members. The team members aim at applying their own search strategies to explore the solution space. The team manager collects the solutions from the members and shares the best one with them. The performance of the proposed method is evaluated on a group of benchmark data sets. The results obtained are compared to those reached by the best methods from the literature. The results show that the proposed method is able to provide the best solutions in most cases. In order to highlight the robustness of the proposed parallel computing model, a new set of large-scale instances is introduced. Encouraging results have been obtained.

On the use of harmony search algorithm in the training of wavelet neural networks

NASA Astrophysics Data System (ADS)

Lai, Kee Huong; Zainuddin, Zarita; Ong, Pauline

2015-10-01

Wavelet neural networks (WNNs) are a class of feedforward neural networks that have been used in a wide range of industrial and engineering applications to model the complex relationships between the given inputs and outputs. The training of WNNs involves the configuration of the weight values between neurons. The backpropagation training algorithm, which is a gradient-descent method, can be used for this training purpose. Nonetheless, the solutions found by this algorithm often get trapped at local minima. In this paper, a harmony search-based algorithm is proposed for the training of WNNs. The training of WNNs, thus can be formulated as a continuous optimization problem, where the objective is to maximize the overall classification accuracy. Each candidate solution proposed by the harmony search algorithm represents a specific WNN architecture. In order to speed up the training process, the solution space is divided into disjoint partitions during the random initialization step of harmony search algorithm. The proposed training algorithm is tested onthree benchmark problems from the UCI machine learning repository, as well as one real life application, namely, the classification of electroencephalography signals in the task of epileptic seizure detection. The results obtained show that the proposed algorithm outperforms the traditional harmony search algorithm in terms of overall classification accuracy.

Improved understanding of the searching behavior of ant colony optimization algorithms applied to the water distribution design problem

NASA Astrophysics Data System (ADS)

Zecchin, A. C.; Simpson, A. R.; Maier, H. R.; Marchi, A.; Nixon, J. B.

2012-09-01

Evolutionary algorithms (EAs) have been applied successfully to many water resource problems, such as system design, management decision formulation, and model calibration. The performance of an EA with respect to a particular problem type is dependent on how effectively its internal operators balance the exploitation/exploration trade-off to iteratively find solutions of an increasing quality. For a given problem, different algorithms are observed to produce a variety of different final performances, but there have been surprisingly few investigations into characterizing how the different internal mechanisms alter the algorithm's searching behavior, in both the objective and decision space, to arrive at this final performance. This paper presents metrics for analyzing the searching behavior of ant colony optimization algorithms, a particular type of EA, for the optimal water distribution system design problem, which is a classical NP-hard problem in civil engineering. Using the proposed metrics, behavior is characterized in terms of three different attributes: (1) the effectiveness of the search in improving its solution quality and entering into optimal or near-optimal regions of the search space, (2) the extent to which the algorithm explores as it converges to solutions, and (3) the searching behavior with respect to the feasible and infeasible regions. A range of case studies is considered, where a number of ant colony optimization variants are applied to a selection of water distribution system optimization problems. The results demonstrate the utility of the proposed metrics to give greater insight into how the internal operators affect each algorithm's searching behavior.

Block Architecture Problem with Depth First Search Solution and Its Application

NASA Astrophysics Data System (ADS)

Rahim, Robbi; Abdullah, Dahlan; Simarmata, Janner; Pranolo, Andri; Saleh Ahmar, Ansari; Hidayat, Rahmat; Napitupulu, Darmawan; Nurdiyanto, Heri; Febriadi, Bayu; Zamzami, Z.

2018-01-01

Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

Experimental design for estimating unknown groundwater pumping using genetic algorithm and reduced order model

NASA Astrophysics Data System (ADS)

Ushijima, Timothy T.; Yeh, William W.-G.

2013-10-01

An optimal experimental design algorithm is developed to select locations for a network of observation wells that provide maximum information about unknown groundwater pumping in a confined, anisotropic aquifer. The design uses a maximal information criterion that chooses, among competing designs, the design that maximizes the sum of squared sensitivities while conforming to specified design constraints. The formulated optimization problem is non-convex and contains integer variables necessitating a combinatorial search. Given a realistic large-scale model, the size of the combinatorial search required can make the problem difficult, if not impossible, to solve using traditional mathematical programming techniques. Genetic algorithms (GAs) can be used to perform the global search; however, because a GA requires a large number of calls to a groundwater model, the formulated optimization problem still may be infeasible to solve. As a result, proper orthogonal decomposition (POD) is applied to the groundwater model to reduce its dimensionality. Then, the information matrix in the full model space can be searched without solving the full model. Results from a small-scale test case show identical optimal solutions among the GA, integer programming, and exhaustive search methods. This demonstrates the GA's ability to determine the optimal solution. In addition, the results show that a GA with POD model reduction is several orders of magnitude faster in finding the optimal solution than a GA using the full model. The proposed experimental design algorithm is applied to a realistic, two-dimensional, large-scale groundwater problem. The GA converged to a solution for this large-scale problem.

Mobile Phone Health Applications for the Federal Sector.

PubMed

Burrows, Christin S; Weigel, Fred K

2016-01-01

As the US healthcare system moves toward a mobile care model, mobile phones will play a significant role in the future of healthcare delivery. Today, 90% of American adults own a mobile phone and 64% own a smartphone, yet many healthcare organizations are only beginning to explore the opportunities in which mobile phones can improve and streamline care. After searching Google Scholar, the Association for Computing Machinery Database, and PubMed for articles related to mobile phone health applications and cell phone text message health, we selected articles and studies related to the application of mobile phones in healthcare. From our initial review, we identified the potential application areas and continued to refine our search, identifying a total of 55 articles for additional review and analysis. From the literature, we identified 3 main themes for mobile phone implementation in improving healthcare: primary, preventive, and population health. We recommend federal health leaders pursue the value and potential in these areas; not only because 90% of Americans already own mobile phones, but also because mobile phone integration can provide substantial access and potential cost savings. From the positive findings of multiple studies in primary, preventive, and population health, we propose a 5-year federal implementation plan to integrate mobile phone capabilities into federal healthcare delivery. Our proposal has the potential to improve access, reduce costs, and increase patient satisfaction, therefore changing the way the federal sector delivers healthcare by 2021.

A Grid Metadata Service for Earth and Environmental Sciences

NASA Astrophysics Data System (ADS)

Fiore, Sandro; Negro, Alessandro; Aloisio, Giovanni

2010-05-01

Critical challenges for climate modeling researchers are strongly connected with the increasingly complex simulation models and the huge quantities of produced datasets. Future trends in climate modeling will only increase computational and storage requirements. For this reason the ability to transparently access to both computational and data resources for large-scale complex climate simulations must be considered as a key requirement for Earth Science and Environmental distributed systems. From the data management perspective (i) the quantity of data will continuously increases, (ii) data will become more and more distributed and widespread, (iii) data sharing/federation will represent a key challenging issue among different sites distributed worldwide, (iv) the potential community of users (large and heterogeneous) will be interested in discovery experimental results, searching of metadata, browsing collections of files, compare different results, display output, etc.; A key element to carry out data search and discovery, manage and access huge and distributed amount of data is the metadata handling framework. What we propose for the management of distributed datasets is the GRelC service (a data grid solution focusing on metadata management). Despite the classical approaches, the proposed data-grid solution is able to address scalability, transparency, security and efficiency and interoperability. The GRelC service we propose is able to provide access to metadata stored in different and widespread data sources (relational databases running on top of MySQL, Oracle, DB2, etc. leveraging SQL as query language, as well as XML databases - XIndice, eXist, and libxml2 based documents, adopting either XPath or XQuery) providing a strong data virtualization layer in a grid environment. Such a technological solution for distributed metadata management leverages on well known adopted standards (W3C, OASIS, etc.); (ii) supports role-based management (based on VOMS), which increases flexibility and scalability; (iii) provides full support for Grid Security Infrastructure, which means (authorization, mutual authentication, data integrity, data confidentiality and delegation); (iv) is compatible with existing grid middleware such as gLite and Globus and finally (v) is currently adopted at the Euro-Mediterranean Centre for Climate Change (CMCC - Italy) to manage the entire CMCC data production activity as well as in the international Climate-G testbed.

Double hashing technique in closed hashing search process

NASA Astrophysics Data System (ADS)

Rahim, Robbi; Zulkarnain, Iskandar; Jaya, Hendra

2017-09-01

The search process is used in various activities performed both online and offline, many algorithms that can be used to perform the search process one of which is a hash search algorithm, search process with hash search algorithm used in this study using double hashing technique where the data will be formed into the table with same length and then search, the results of this study indicate that the search process with double hashing technique allows faster searching than the usual search techniques, this research allows to search the solution by dividing the value into the main table and overflow table so that the search process is expected faster than the data stacked in the form of one table and collision data could avoided.

A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.

PubMed

Drake, John H; Özcan, Ender; Burke, Edmund K

2016-01-01

Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on a single candidate solution, and two candidate solutions are required for crossover, a mechanism is required to control the choice of the other solution. The frameworks we propose maintain a list of potential solutions for use in crossover. We investigate the use of such lists at two conceptual levels. First, crossover is controlled at the hyper-heuristic level where no problem-specific information is required. Second, it is controlled at the problem domain level where problem-specific information is used to produce good-quality solutions to use in crossover. A number of selection hyper-heuristics are compared using these frameworks over three benchmark libraries with varying properties for an NP-hard optimisation problem: the multidimensional 0-1 knapsack problem. It is shown that allowing crossover to be managed at the domain level outperforms managing crossover at the hyper-heuristic level in this problem domain.

Cross Validation Through Two-Dimensional Solution Surface for Cost-Sensitive SVM.

PubMed

Gu, Bin; Sheng, Victor S; Tay, Keng Yeow; Romano, Walter; Li, Shuo

2017-06-01

Model selection plays an important role in cost-sensitive SVM (CS-SVM). It has been proven that the global minimum cross validation (CV) error can be efficiently computed based on the solution path for one parameter learning problems. However, it is a challenge to obtain the global minimum CV error for CS-SVM based on one-dimensional solution path and traditional grid search, because CS-SVM is with two regularization parameters. In this paper, we propose a solution and error surfaces based CV approach (CV-SES). More specifically, we first compute a two-dimensional solution surface for CS-SVM based on a bi-parameter space partition algorithm, which can fit solutions of CS-SVM for all values of both regularization parameters. Then, we compute a two-dimensional validation error surface for each CV fold, which can fit validation errors of CS-SVM for all values of both regularization parameters. Finally, we obtain the CV error surface by superposing K validation error surfaces, which can find the global minimum CV error of CS-SVM. Experiments are conducted on seven datasets for cost sensitive learning and on four datasets for imbalanced learning. Experimental results not only show that our proposed CV-SES has a better generalization ability than CS-SVM with various hybrids between grid search and solution path methods, and than recent proposed cost-sensitive hinge loss SVM with three-dimensional grid search, but also show that CV-SES uses less running time.

Design of transonic airfoil sections using a similarity theory

NASA Technical Reports Server (NTRS)

Nixon, D.

1978-01-01

A study of the available methods for transonic airfoil and wing design indicates that the most powerful technique is the numerical optimization procedure. However, the computer time for this method is relatively large because of the amount of computation required in the searches during optimization. The optimization method requires that base and calibration solutions be computed to determine a minimum drag direction. The design space is then computationally searched in this direction; it is these searches that dominate the computation time. A recent similarity theory allows certain transonic flows to be calculated rapidly from the base and calibration solutions. In this paper the application of the similarity theory to design problems is examined with the object of at least partially eliminating the costly searches of the design optimization method. An example of an airfoil design is presented.

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

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

28 CFR 511.12 - Prohibited objects.

Code of Federal Regulations, 2010 CFR

2010-07-01

... violate criminal laws or are prohibited by Federal regulations or Bureau policies. ... GENERAL MANAGEMENT POLICY Searching and Detaining or Arresting Non-Inmates § 511.12 Prohibited objects. (a...

A Guide to Federal Education Programs That Can Fund K-12 Universal Prevention and Social and Emotional Learning Activities

ERIC Educational Resources Information Center

Rentner, Diane Stark; Price, Olga Acosta

2014-01-01

Federal education funding has often been overlooked by districts in search of sources of support for prevention. This guide is intended to help school districts take advantage of those funds by identifying K-12 grant programs in the U.S. Department of Education (ED) that could be used to implement prevention efforts in elementary and secondary…

A near-optimum procedure for selecting stations in a streamgaging network

USGS Publications Warehouse

Lanfear, Kenneth J.

2005-01-01

Two questions are fundamental to Federal government goals for a network of streamgages which are operated by the U.S. Geological Survey: (1) how well does the present network of streamagaging stations meet defined Federal goals and (2) what is the optimum set of stations to add or reactivate to support remaining goals? The solution involves an incremental-stepping procedure that is based on Basic Feasible Incremental Solutions (BFIS?s) where each BFIS satisfies at least one Federal streamgaging goal. A set of minimum Federal goals for streamgaging is defined to include water measurements for legal compacts and decrees, flooding, water budgets, regionalization of streamflow characteristics, and water quality. Fully satisfying all these goals by using the assumptions outlined in this paper would require adding 887 new streamgaging stations to the U.S. Geological Survey network and reactivating an additional 857 stations that are currently inactive.

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

PubMed

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

2008-04-01

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

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

Solving optimization problems by the public goods game

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2017-09-01

We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

An Experience Oriented-Convergence Improved Gravitational Search Algorithm for Minimum Variance Distortionless Response Beamforming Optimum

PubMed Central

Darzi, Soodabeh; Tiong, Sieh Kiong; Tariqul Islam, Mohammad; Rezai Soleymanpour, Hassan; Kibria, Salehin

2016-01-01

An experience oriented-convergence improved gravitational search algorithm (ECGSA) based on two new modifications, searching through the best experiments and using of a dynamic gravitational damping coefficient (α), is introduced in this paper. ECGSA saves its best fitness function evaluations and uses those as the agents’ positions in searching process. In this way, the optimal found trajectories are retained and the search starts from these trajectories, which allow the algorithm to avoid the local optimums. Also, the agents can move faster in search space to obtain better exploration during the first stage of the searching process and they can converge rapidly to the optimal solution at the final stage of the search process by means of the proposed dynamic gravitational damping coefficient. The performance of ECGSA has been evaluated by applying it to eight standard benchmark functions along with six complicated composite test functions. It is also applied to adaptive beamforming problem as a practical issue to improve the weight vectors computed by minimum variance distortionless response (MVDR) beamforming technique. The results of implementation of the proposed algorithm are compared with some well-known heuristic methods and verified the proposed method in both reaching to optimal solutions and robustness. PMID:27399904

Voronoi Diagram Based Optimization of Dynamic Reactive Power Sources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, Weihong; Sun, Kai; Qi, Junjian

2015-01-01

Dynamic var sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues or even voltage collapse. This paper proposes a new approach to optimization of the sizes of dynamic var sources at candidate locations by a Voronoi diagram based algorithm. It first disperses sample points of potential solutions in a searching space, evaluates a cost function at each point by barycentric interpolation for the subspaces around the point, and then constructs a Voronoi diagram about cost function values over the entire space. Accordingly, the final optimal solution can be obtained. Case studies on the WSCC 9-bus system and NPCC 140-busmore » system have validated that the new approach can quickly identify the boundary of feasible solutions in searching space and converge to the global optimal solution.« less

Direct-To-Consumer Internet Promotion Of Robotic Prostatectomy Exhibits Varying Quality Of Information

PubMed Central

Mirkin, Joshua N.; Lowrance, William T.; Feifer, Andrew H.; Mulhall, John P.; Eastham, James E.; Elkin, Elena B.

2013-01-01

Robotic surgery to remove a cancerous prostate has become a popular treatment. Internet marketing of this surgery provides an intriguing case study of direct-to-consumer promotions of medical devices, which are more loosely regulated than pharmaceutical promotions. We investigated whether the claims made in online promotions of robotic prostatectomy were consistent with evidence from comparative effectiveness studies. After performing a search and crosssectional analysis of websites that mentioned the procedure, we found that many sites claimed benefits that were unsupported by evidence and that 42 percent of the sites failed to mention risks. Most sites were published by hospitals and physicians, which the public may regard as more objective than pages published by manufacturers. Unbalanced information may inappropriately raise patients’ expectations. Increasing enforcement and regulation of online promotions may be beyond the capabilities of federal authorities. Thus, the most feasible solution may be for the government and medical societies to promote the production of balanced educational material. PMID:22492893

Direct-to-consumer Internet promotion of robotic prostatectomy exhibits varying quality of information.

PubMed

Mirkin, Joshua N; Lowrance, William T; Feifer, Andrew H; Mulhall, John P; Eastham, James E; Elkin, Elena B

2012-04-01

Robotic surgery to remove a cancerous prostate has become a popular treatment. Internet marketing of this surgery provides an intriguing case study of direct-to-consumer promotions of medical devices, which are more loosely regulated than pharmaceutical promotions. We investigated whether the claims made in online promotions of robotic prostatectomy were consistent with evidence from comparative effectiveness studies. After performing a search and cross-sectional analysis of websites that mentioned the procedure, we found that many sites claimed benefits that were unsupported by evidence and that 42 percent of the sites failed to mention risks. Most sites were published by hospitals and physicians, which the public may regard as more objective than pages published by manufacturers. Unbalanced information may inappropriately raise patients' expectations. Increasing enforcement and regulation of online promotions may be beyond the capabilities of federal authorities. Thus, the most feasible solution may be for the government and medical societies to promote the production of balanced educational material.

Nurse Discontent: The Search for Realistic Solutions.

ERIC Educational Resources Information Center

Ginzberg, Eli; And Others

1982-01-01

Following a report on the findings of a survey of North Florida nurses, the authors present several approaches for nursing administrators to consider when searching for more productive strategies to improve retention of hospital nurses. (CT)

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

NASA Technical Reports Server (NTRS)

Ortiz, Francisco

2004-01-01

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Building an Open Data Portal for the European Space Agency Climate Change Initiative based on an Iterative Development Methodology and Linked Data Technologies

NASA Astrophysics Data System (ADS)

Kershaw, P.; Bennett, V. L.; Stephens, A.; Wilson, A.; Waterfall, A. M.; Petrie, R.; Iwi, A.; Donegan, S.; Juckes, M. N.; Parton, G.

2016-12-01

The Climate Change Initiative (CCI) programme was initiated by the European Space Agency (ESA) in 2009 to address the GCOS Essential Climate Variable (ECV) requirements to provide stable, long-term, satellite-based data products to characterise the climate system and its changes. CEDA, working as part of a project consortium, were awarded the contract to build the Open Data Portal, consisting collectively of a central archive and single point of access for dissemination of the data to the international user community. Reflecting climate and earth observation community requirements, the system needed to support a range of access services in use by this domain and specifically, to integrate into existing infrastructure in the form of the Earth System Grid Federation (ESGF). This range of requirements together with the heterogeneity of the ECV datasets presented significant challenges. However, the use of Linked Data technologies and an iterative approach to data model development and data publishing have been instrumental in meeting the objectives and building a cohesive system. The portal supports data discovery based on the OGC CSW specification and on ESGF's powerful faceted search. These services provide complementary content at different levels of granularity and it therefore became clear that a common data model was needed. Key terms are defined in vocabularies serialised in SKOS and OWL and are accessible from a central vocabulary server to provide a single authoritative source for applications consuming metadata content. Exploiting the vocabulary service therefore, it has been possible to develop an innovative solution tagging ISO 19115 records for the CSW with the equivalent vocabulary terms used for the ESGF faceted search system. In this way it has been possible to create a rich user interface for the portal combining search results from both search services and the ability to dynamically populate facet selection and context-based help information from the vocabulary service.

75 FR 77664 - Honeywell International, Inc., Automation and Control Solutions Division, Including On-Site...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-13

..., Inc., Automation and Control Solutions Division, Including On-Site Leased Workers From Manpower...., Automation and Control Solutions Division, Rock Island, Illinois. The notice was published in the Federal...-site at the Rock Island, Illinois location of Honeywell International, Inc., Automation and Control...

77 FR 75766 - Federal Acquisition Regulation; Nondisplacement of Qualified Workers Under Service Contracts

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-21

... offeror's ingenuity in proposing a technical approach or solution based on limitations of the existing... solution. Another respondent expressed concern that the rule would limit offerors' ability to craft innovative solutions to Government requirements. Response: Under the SCA, the successor contractor must pay...

Confronting Barriers, Creating Solutions: Parental Leave for Junior Colleagues

NASA Astrophysics Data System (ADS)

Helfand, David J.

2013-01-01

Barriers to instituting parental leave policies for graduate students and postdoctoral fellows are present at the departmental, university/institute, and federal levels. Within departments, collegial persuasion involving both those affected and senior leadership can be successful in overcoming sociological resistance, although financial constraints may be harder to surmount. Universities are constrained by internal policies and the structure of their fringe benefits pools which are in turn limited by reimbursement rates that must be negotiated with their federal oversight agencies. Federal effort-reporting rules also complicate the situation. I will describe the type of creative solutions that can work at the departmental level, as well as discussing the actions the Society is pursuing in an attempt to lower the external barriers to local action.

History of the Journal of Nursing of the Federal University of Santa Maria.

PubMed

Budó, Maria de Lourdes Denardin; Beck, Carmem Lúcia Colomé; Silva, Dalva Cezar da; Prestes, Francine Cassol; Soares, Rhea Silvia de Avila; Garcia, Raquel Pötter

2017-02-09

To report the history of the Journal of Nursing of the Federal University of Santa Maria. This is an experience report based on information from secondary materials, such as websites and documents. Data were grouped and presented according to the time sequence. The magazine was established in 2010 and in its six years of existence, the number of published articles increased from 58 to 75, it was approved for indexation in databases and obtained the Qualis B3. Actions were aimed at strengthening the journal, searching for financial resources, increasing disclosure, the number of reviewers and collaborators. The magazine's history involves several steps, which have been permeated by challenges and achievements that involve the search for the continuous strengthening of the journal and related publications.

"Biocompatible" Neutral pH Low-GDP Peritoneal Dialysis Solutions: Much Ado About Nothing?

PubMed

Misra, Paraish S; Nessim, Sharon J; Perl, Jeffrey

2017-03-01

Adverse outcomes in peritoneal dialysis (PD), including PD related infections, the loss of residual kidney function (RKF), and longitudinal, deleterious changes in peritoneal membrane function continue to limit the long-term success of PD therapy. The observation that these deleterious changes occur upon exposure to conventional glucose-based PD solutions fuels the search for a more biocompatible PD solution. The development of a novel PD solution with a neutral pH, and lower in glucose degradation products (GDPs) compared to its conventional predecessors has been labeled a "biocompatible" solution. While considerable evidence in support of these novel solutions' biocompatibility has emerged from cell culture and animal studies, the clinical benefits as compared to conventional PD solutions are less clear. Neutral pH low GDP (NpHLGDP) PD solutions appear to be effective in reducing infusion pain, but their effects on other clinical endpoints including peritoneal membrane function, preservation of RKF, PD-related infections, and technique and patient survival are less clear. The literature is limited by studies characterized by relatively few patients, short follow-up time, heterogeneity with regards to the novel PD solution type under study, and the different patient populations under study. Nonetheless, the search for a more biocompatible PD solution continues with emerging data on promising non glucose-based solutions. © 2017 Wiley Periodicals, Inc.

On the role of fusion neutron source with thorium blanket in forming the nuclide composition of the nuclear fuel cycle of the Russian Federation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shmelev, A. N.; Kulikov, G. G., E-mail: ggkulikov@mephi.ru

The possible role of available thorium resources of the Russian Federation in utilization of thorium in the closed (U–Pu)-fuel cycle of nuclear power is considered. The efficiency of application of fusion neutron sources with thorium blanket for economical use of available thorium resources is demonstrated. The objective of this study is the search for a solution of such major tasks of nuclear power as reduction of the amount of front-end operations in the nuclear fuel cycle and enhancement of its protection against uncontrolled proliferation of fissile materials with the smallest possible alterations in the fuel cycle. The earlier results aremore » analyzed, new information on the amount of thorium resources of the Russian Federation is used, and additional estimates are made. The following basic results obtained on the basis of the assumption of involving fusion reactors with Th-blanket in future nuclear power for generation of the light uranium fraction {sup 232+233+234}U and {sup 231}Pa are formulated. (1) The fuel cycle would shift from fissile {sup 235}U to {sup 233}U, which is more attractive for thermal power reactors. (2) The light uranium fraction is the most “protected” in the uranium fuel component, and being mixed with regenerated uranium, it would become reduced-enrichment uranium fuel, which would relieve the problem of nonproliferation of the fissile material. (3) The addition of {sup 231}Pa into the fuel would stabilize its neutron-multiplying properties, thus making it possible to implement a long fuel residence time and, as a consequence, increase the export potential of the whole nuclear power technology. (4) The available thorium resource in the vicinity of Krasnoufimsk is sufficient for operation of the large-scale nuclear power industry of the Russian Federation with an electric power of 70 GW for more than one quarter of a century. The general conclusion is that involvement of a small number of fusion reactors with Th-blanket in the future nuclear power industry of the Russian Federation would to a large extent solve its problems and increase its export potential.« less

On the role of fusion neutron source with thorium blanket in forming the nuclide composition of the nuclear fuel cycle of the Russian Federation

NASA Astrophysics Data System (ADS)

Shmelev, A. N.; Kulikov, G. G.

2016-12-01

The possible role of available thorium resources of the Russian Federation in utilization of thorium in the closed (U-Pu)-fuel cycle of nuclear power is considered. The efficiency of application of fusion neutron sources with thorium blanket for economical use of available thorium resources is demonstrated. The objective of this study is the search for a solution of such major tasks of nuclear power as reduction of the amount of front-end operations in the nuclear fuel cycle and enhancement of its protection against uncontrolled proliferation of fissile materials with the smallest possible alterations in the fuel cycle. The earlier results are analyzed, new information on the amount of thorium resources of the Russian Federation is used, and additional estimates are made. The following basic results obtained on the basis of the assumption of involving fusion reactors with Th-blanket in future nuclear power for generation of the light uranium fraction 232+233+234U and 231Pa are formulated. (1) The fuel cycle would shift from fissile 235U to 233U, which is more attractive for thermal power reactors. (2) The light uranium fraction is the most "protected" in the uranium fuel component, and being mixed with regenerated uranium, it would become reduced-enrichment uranium fuel, which would relieve the problem of nonproliferation of the fissile material. (3) The addition of 231Pa into the fuel would stabilize its neutron-multiplying properties, thus making it possible to implement a long fuel residence time and, as a consequence, increase the export potential of the whole nuclear power technology. (4) The available thorium resource in the vicinity of Krasnoufimsk is sufficient for operation of the large-scale nuclear power industry of the Russian Federation with an electric power of 70 GW for more than one quarter of a century. The general conclusion is that involvement of a small number of fusion reactors with Th-blanket in the future nuclear power industry of the Russian Federation would to a large extent solve its problems and increase its export potential.

Exploration of Best-Fit Solution for Harbormaster Security Information Sharing Systems

DTIC Science & Technology

2012-06-01

amongst harbor cargo operators engaged in intermodal shipping. Through interviews conducted of MIST’s federal and local partners, careful examination...harbor cargo operators engaged in intermodal shipping. Through interviews conducted of MIST’s federal and local partners, careful examination of...system amongst harbor operators engaged in intermodal shipping. Through interviews conducted of MIST’s federal and local partners, careful

Learning Problem-Solving Rules as Search through a Hypothesis Space

ERIC Educational Resources Information Center

Lee, Hee Seung; Betts, Shawn; Anderson, John R.

2016-01-01

Learning to solve a class of problems can be characterized as a search through a space of hypotheses about the rules for solving these problems. A series of four experiments studied how different learning conditions affected the search among hypotheses about the solution rule for a simple computational problem. Experiment 1 showed that a problem…

Applications of Artificial Intelligence (AI) and Expert Systems for Online Searching.

ERIC Educational Resources Information Center

Hawkins, Donald T.

1988-01-01

Discussion of the online searching process identifies the formulation of a search strategy as the major problem area for users of online systems. Artificial intelligence is suggested as a solution to this problem, and several expert systems for information retrieval are described. An annotated list of 24 items for further reading is included. (23…

The ESGF Software Stack: a Configurable and Extensible Framework for Enabling Access to Geospatial Data

NASA Astrophysics Data System (ADS)

Cinquini, L.; Bell, G. M.; Williams, D.; Harney, J.

2012-12-01

The Earth System Grid Federation (ESGF) is a multi-agency, international collaboration that aims at developing state-of-the-art services for the management and access of Earth system data. ESGF is currently used to serve the totality of the model output used for the forthcoming IPCC 5th assessment report on climate change, as well as supporting observational and reanalysis datasets. Also, it is been adopted by several other projects that focus on global, regional and local climate modeling. The ESGF software stack is composed of several modular applications that cover related but disjoint areas of functionality: data publishing, data search and discovery, data access, user management, security, and federation. Overall, the ESGF infrastructure offers a configurable end-to-end solution to the problem of enabling web-based access to large amounts of geospatial data. This talk will present the architectural and configuration options that are available to a data provider leveraging ESGF to serve their data: which services to expose, how to scale to larger data collections, how to establish access control, how to customize the user interface, and others. Additionally, the framework provides extension points that allow each site to plug in custom functionality such as crawling of specific metadata repositories, exposing domain-specific analysis and visualization services, developing custom access clients that interact with the system APIs. These configuration and extension capabilities are based on simple but effective domain-specific object models, that underpin the software applications: the data model, the security model, and the federation model. The ESGF software stack is developed collaboratively by software engineers at many institutions around the world, and is made freely available to the community under an open source license to promote adoption, reuse, inspection and continuous improvement.

Single-agent parallel window search

NASA Technical Reports Server (NTRS)

Powley, Curt; Korf, Richard E.

1991-01-01

Parallel window search is applied to single-agent problems by having different processes simultaneously perform iterations of Iterative-Deepening-A(asterisk) (IDA-asterisk) on the same problem but with different cost thresholds. This approach is limited by the time to perform the goal iteration. To overcome this disadvantage, the authors consider node ordering. They discuss how global node ordering by minimum h among nodes with equal f = g + h values can reduce the time complexity of serial IDA-asterisk by reducing the time to perform the iterations prior to the goal iteration. Finally, the two ideas of parallel window search and node ordering are combined to eliminate the weaknesses of each approach while retaining the strengths. The resulting approach, called simply parallel window search, can be used to find a near-optimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.

Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems.

PubMed

Mavrovouniotis, Michalis; Muller, Felipe M; Yang, Shengxiang

2016-06-13

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can significantly improve the performance of ACO. In this paper, a memetic ACO algorithm, where a local search operator (called unstring and string) is integrated into ACO, is proposed to address DTSPs. The best solution from ACO is passed to the local search operator, which removes and inserts cities in such a way that improves the solution quality. The proposed memetic ACO algorithm is designed to address both symmetric and asymmetric DTSPs. The experimental results show the efficiency of the proposed memetic algorithm for addressing DTSPs in comparison with other state-of-the-art algorithms.

Colloidal Silver Products

MedlinePlus

... your health care providers about any complementary health approaches you use. Give them a full picture of ... information on NCCIH and complementary and integrative health approaches, including publications and searches of Federal databases of ...

Chiropractic: An Introduction

MedlinePlus

... the sciences. Chiropractic training is a 4-year academic program that includes both classroom work and direct ... health approaches, including publications and searches of Federal databases of scientific and medical literature. The Clearinghouse does ...

Worldwide trends in fishing interest indicated by Internet search volume

USGS Publications Warehouse

Wilde, G.R.; Pope, K.L.

2013-01-01

There is a growing body of literature that shows internet search volume on a topic, such as fishing, is a viable measure of salience. Herein, internet search volume for 'fishing' and 'angling' is used as a measure of public interest in fishing, in particular, recreational fishing. An online tool, Google Insights for Search, which allows one to study internet search terms and their volume since 2004, is used to examine trends in interest in fishing for 50 countries. Trends in normalised fishing search volume, during 2004 through 2011, varied from a 72.6% decrease (Russian Federation) to a 133.7% increase (Hungary). Normalised fishing search volume declined in 40 (80%) of the countries studied. The decline has been relatively large in English-speaking countries, but also has been large in Central and South American, and European countries. Analyses of search queries provide a low-cost means of gaining insight into angler interests and, possibly, behaviour in countries around the world.

Design Conference for the Evaluation of the Talent Search Program: Synthesis of Major Themes and Commissioned Papers Prepared for the Conference (Washington, D.C., September 30, 1992).

ERIC Educational Resources Information Center

Westat, Inc., Rockville, MD.

This report gathers papers prepared for a design conference for the evaluation of the Federal Talent Search Program, an early intervention program to identify gifted and talented financially needy students and connect them with discretionary grants for higher education. An introductory paper synthesizes major conference themes. These include: (1)…

Structure solution of DNA-binding proteins and complexes with ARCIMBOLDO libraries

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pröpper, Kevin; Instituto de Biologia Molecular de Barcelona; Meindl, Kathrin

2014-06-01

The structure solution of DNA-binding protein structures and complexes based on the combination of location of DNA-binding protein motif fragments with density modification in a multi-solution frame is described. Protein–DNA interactions play a major role in all aspects of genetic activity within an organism, such as transcription, packaging, rearrangement, replication and repair. The molecular detail of protein–DNA interactions can be best visualized through crystallography, and structures emphasizing insight into the principles of binding and base-sequence recognition are essential to understanding the subtleties of the underlying mechanisms. An increasing number of high-quality DNA-binding protein structure determinations have been witnessed despite themore » fact that the crystallographic particularities of nucleic acids tend to pose specific challenges to methods primarily developed for proteins. Crystallographic structure solution of protein–DNA complexes therefore remains a challenging area that is in need of optimized experimental and computational methods. The potential of the structure-solution program ARCIMBOLDO for the solution of protein–DNA complexes has therefore been assessed. The method is based on the combination of locating small, very accurate fragments using the program Phaser and density modification with the program SHELXE. Whereas for typical proteins main-chain α-helices provide the ideal, almost ubiquitous, small fragments to start searches, in the case of DNA complexes the binding motifs and DNA double helix constitute suitable search fragments. The aim of this work is to provide an effective library of search fragments as well as to determine the optimal ARCIMBOLDO strategy for the solution of this class of structures.« less

Drug and Alcohol Testing Survey - 1998 Results

DOT National Transportation Integrated Search

1997-01-01

This application was identified as a promising rural Intelligent Transportation Systems (ITS) solution under a project sponsored by the Federal Highway Administration (FHWA) and the ENTERPRISE program. This summary describes the solution as well as o...

The dynamics of search, impasse, and representational change provide a coherent explanation of difficulty in the nine-dot problem.

PubMed

Öllinger, Michael; Jones, Gary; Knoblich, Günther

2014-03-01

The nine-dot problem is often used to demonstrate and explain mental impasse, creativity, and out of the box thinking. The present study investigated the interplay of a restricted initial search space, the likelihood of invoking a representational change, and the subsequent constraining of an unrestricted search space. In three experimental conditions, participants worked on different versions of the nine-dot problem that hinted at removing particular sources of difficulty from the standard problem. The hints were incremental such that the first suggested a possible route for a solution attempt; the second additionally indicated the dot at which lines meet on the solution path; and the final condition also provided non-dot locations that appear in the solution path. The results showed that in the experimental conditions, representational change is encountered more quickly and problems are solved more often than for the control group. We propose a cognitive model that focuses on general problem-solving heuristics and representational change to explain problem difficulty.

An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems

PubMed Central

Wang, Gai-Ge; Feng, Qingjiang; Zhao, Xiang-Jun

2014-01-01

An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals combined with genetic mutation with a small probability. Subsequently, in order to improve the convergence speed and enhance the exploitation ability, a novel CS model is proposed with considering the specific advantages of Lévy flights and frog-leap operator. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Finally, numerical simulations are carried out on six different types of 0-1 knapsack instances, and the comparative results have shown the effectiveness of the proposed algorithm and its ability to achieve good quality solutions, which outperforms the binary cuckoo search, the binary differential evolution, and the genetic algorithm. PMID:25404940

Optimization of High-Dimensional Functions through Hypercube Evaluation

PubMed Central

Abiyev, Rahib H.; Tunay, Mustafa

2015-01-01

A novel learning algorithm for solving global numerical optimization problems is proposed. The proposed learning algorithm is intense stochastic search method which is based on evaluation and optimization of a hypercube and is called the hypercube optimization (HO) algorithm. The HO algorithm comprises the initialization and evaluation process, displacement-shrink process, and searching space process. The initialization and evaluation process initializes initial solution and evaluates the solutions in given hypercube. The displacement-shrink process determines displacement and evaluates objective functions using new points, and the search area process determines next hypercube using certain rules and evaluates the new solutions. The algorithms for these processes have been designed and presented in the paper. The designed HO algorithm is tested on specific benchmark functions. The simulations of HO algorithm have been performed for optimization of functions of 1000-, 5000-, or even 10000 dimensions. The comparative simulation results with other approaches demonstrate that the proposed algorithm is a potential candidate for optimization of both low and high dimensional functions. PMID:26339237

Molecule database framework: a framework for creating database applications with chemical structure search capability

PubMed Central

2013-01-01

Background Research in organic chemistry generates samples of novel chemicals together with their properties and other related data. The involved scientists must be able to store this data and search it by chemical structure. There are commercial solutions for common needs like chemical registration systems or electronic lab notebooks. However for specific requirements of in-house databases and processes no such solutions exist. Another issue is that commercial solutions have the risk of vendor lock-in and may require an expensive license of a proprietary relational database management system. To speed up and simplify the development for applications that require chemical structure search capabilities, I have developed Molecule Database Framework. The framework abstracts the storing and searching of chemical structures into method calls. Therefore software developers do not require extensive knowledge about chemistry and the underlying database cartridge. This decreases application development time. Results Molecule Database Framework is written in Java and I created it by integrating existing free and open-source tools and frameworks. The core functionality includes: • Support for multi-component compounds (mixtures) • Import and export of SD-files • Optional security (authorization) For chemical structure searching Molecule Database Framework leverages the capabilities of the Bingo Cartridge for PostgreSQL and provides type-safe searching, caching, transactions and optional method level security. Molecule Database Framework supports multi-component chemical compounds (mixtures). Furthermore the design of entity classes and the reasoning behind it are explained. By means of a simple web application I describe how the framework could be used. I then benchmarked this example application to create some basic performance expectations for chemical structure searches and import and export of SD-files. Conclusions By using a simple web application it was shown that Molecule Database Framework successfully abstracts chemical structure searches and SD-File import and export to simple method calls. The framework offers good search performance on a standard laptop without any database tuning. This is also due to the fact that chemical structure searches are paged and cached. Molecule Database Framework is available for download on the projects web page on bitbucket: https://bitbucket.org/kienerj/moleculedatabaseframework. PMID:24325762

Molecule database framework: a framework for creating database applications with chemical structure search capability.

PubMed

Kiener, Joos

2013-12-11

Research in organic chemistry generates samples of novel chemicals together with their properties and other related data. The involved scientists must be able to store this data and search it by chemical structure. There are commercial solutions for common needs like chemical registration systems or electronic lab notebooks. However for specific requirements of in-house databases and processes no such solutions exist. Another issue is that commercial solutions have the risk of vendor lock-in and may require an expensive license of a proprietary relational database management system. To speed up and simplify the development for applications that require chemical structure search capabilities, I have developed Molecule Database Framework. The framework abstracts the storing and searching of chemical structures into method calls. Therefore software developers do not require extensive knowledge about chemistry and the underlying database cartridge. This decreases application development time. Molecule Database Framework is written in Java and I created it by integrating existing free and open-source tools and frameworks. The core functionality includes:•Support for multi-component compounds (mixtures)•Import and export of SD-files•Optional security (authorization)For chemical structure searching Molecule Database Framework leverages the capabilities of the Bingo Cartridge for PostgreSQL and provides type-safe searching, caching, transactions and optional method level security. Molecule Database Framework supports multi-component chemical compounds (mixtures).Furthermore the design of entity classes and the reasoning behind it are explained. By means of a simple web application I describe how the framework could be used. I then benchmarked this example application to create some basic performance expectations for chemical structure searches and import and export of SD-files. By using a simple web application it was shown that Molecule Database Framework successfully abstracts chemical structure searches and SD-File import and export to simple method calls. The framework offers good search performance on a standard laptop without any database tuning. This is also due to the fact that chemical structure searches are paged and cached. Molecule Database Framework is available for download on the projects web page on bitbucket: https://bitbucket.org/kienerj/moleculedatabaseframework.

Seqcrawler: biological data indexing and browsing platform.

PubMed

Sallou, Olivier; Bretaudeau, Anthony; Roult, Aurelien

2012-07-24

Seqcrawler takes its roots in software like SRS or Lucegene. It provides an indexing platform to ease the search of data and meta-data in biological banks and it can scale to face the current flow of data. While many biological bank search tools are available on the Internet, mainly provided by large organizations to search their data, there is a lack of free and open source solutions to browse one's own set of data with a flexible query system and able to scale from a single computer to a cloud system. A personal index platform will help labs and bioinformaticians to search their meta-data but also to build a larger information system with custom subsets of data. The software is scalable from a single computer to a cloud-based infrastructure. It has been successfully tested in a private cloud with 3 index shards (pieces of index) hosting ~400 millions of sequence information (whole GenBank, UniProt, PDB and others) for a total size of 600 GB in a fault tolerant architecture (high-availability). It has also been successfully integrated with software to add extra meta-data from blast results to enhance users' result analysis. Seqcrawler provides a complete open source search and store solution for labs or platforms needing to manage large amount of data/meta-data with a flexible and customizable web interface. All components (search engine, visualization and data storage), though independent, share a common and coherent data system that can be queried with a simple HTTP interface. The solution scales easily and can also provide a high availability infrastructure.

A Method for Estimating View Transformations from Image Correspondences Based on the Harmony Search Algorithm.

PubMed

Cuevas, Erik; Díaz, Margarita

2015-01-01

In this paper, a new method for robustly estimating multiple view relations from point correspondences is presented. The approach combines the popular random sampling consensus (RANSAC) algorithm and the evolutionary method harmony search (HS). With this combination, the proposed method adopts a different sampling strategy than RANSAC to generate putative solutions. Under the new mechanism, at each iteration, new candidate solutions are built taking into account the quality of the models generated by previous candidate solutions, rather than purely random as it is the case of RANSAC. The rules for the generation of candidate solutions (samples) are motivated by the improvisation process that occurs when a musician searches for a better state of harmony. As a result, the proposed approach can substantially reduce the number of iterations still preserving the robust capabilities of RANSAC. The method is generic and its use is illustrated by the estimation of homographies, considering synthetic and real images. Additionally, in order to demonstrate the performance of the proposed approach within a real engineering application, it is employed to solve the problem of position estimation in a humanoid robot. Experimental results validate the efficiency of the proposed method in terms of accuracy, speed, and robustness.

Planning Following Stroke: A Relational Complexity Approach Using the Tower of London

PubMed Central

Andrews, Glenda; Halford, Graeme S.; Chappell, Mark; Maujean, Annick; Shum, David H. K.

2014-01-01

Planning on the 4-disk version of the Tower of London (TOL4) was examined in stroke patients and unimpaired controls. Overall TOL4 solution scores indicated impaired planning in the frontal stroke but not non-frontal stroke patients. Consistent with the claim that processing the relations between current states, intermediate states, and goal states is a key process in planning, the domain-general relational complexity metric was a good indicator of the experienced difficulty of TOL4 problems. The relational complexity metric shared variance with task-specific metrics of moves to solution and search depth. Frontal stroke patients showed impaired planning compared to controls on problems at all three complexity levels, but at only two of the three levels of moves to solution, search depth and goal ambiguity. Non-frontal stroke patients showed impaired planning only on the most difficult quaternary-relational and high search depth problems. An independent measure of relational processing (viz., Latin square task) predicted TOL4 solution scores after controlling for stroke status and location, and executive processing (Trail Making Test). The findings suggest that planning involves a domain-general capacity for relational processing that depends on the frontal brain regions. PMID:25566042

An improved exploratory search technique for pure integer linear programming problems

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1990-01-01

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Primary Disaster Field Office (DFO), Lufkin, Texas

NASA Technical Reports Server (NTRS)

Wetherbee, James D.

2005-01-01

On February 1, 2003, the Space Shuttle Columbia broke apart during atmospheric re-entry on mission STS-107; the complexity of such an event cannot be underestimated. The Lufkin Disaster Field Office (DFO) served as the primary DFO for all operations, including staging assets and deploying field teams for search, recovery and security. There were many organizations that had operational experience with disaster recovery. Offers to help came from many groups including the White House Liaison Office, the Department of Defense (DOD), branches of local, state and federal government, the Federal Bureau of Investigation (FBI), the Federal Emergency Management Agency (FEMA), the Environmental Protection Agency (EPA), state police, fire departments, the Texas Forestry Service, the Texas Army National Guard, medical groups, various rescue forces, contractor companies, the Salvation Army, local businesses, and citizens of our country and especially East Texas. The challenge was to know how much help to accept and how to efficiently incorporate their valuable assistance into a comprehensive and cohesive operational plan. There were more than 2,000 people involved with search and recovery.

Alternative Fuels Data Center

Science.gov Websites

Data Center on AddThis.com... More in this section... Search Federal State Local Examples Summary assistance, etc. Other Includes requirements to promulgate rules, study groups/committees, etc. Air Quality

A Taxonomic Search Engine: Federating taxonomic databases using web services

PubMed Central

Page, Roderic DM

2005-01-01

Background The taxonomic name of an organism is a key link between different databases that store information on that organism. However, in the absence of a single, comprehensive database of organism names, individual databases lack an easy means of checking the correctness of a name. Furthermore, the same organism may have more than one name, and the same name may apply to more than one organism. Results The Taxonomic Search Engine (TSE) is a web application written in PHP that queries multiple taxonomic databases (ITIS, Index Fungorum, IPNI, NCBI, and uBIO) and summarises the results in a consistent format. It supports "drill-down" queries to retrieve a specific record. The TSE can optionally suggest alternative spellings the user can try. It also acts as a Life Science Identifier (LSID) authority for the source taxonomic databases, providing globally unique identifiers (and associated metadata) for each name. Conclusion The Taxonomic Search Engine is available at and provides a simple demonstration of the potential of the federated approach to providing access to taxonomic names. PMID:15757517

Chemical evaluation of electronic cigarettes.

PubMed

Cheng, Tianrong

2014-05-01

To review the available evidence evaluating the chemicals in refill solutions, cartridges, aerosols and environmental emissions of electronic cigarettes (e-cigarettes). Systematic literature searches were conducted to identify research related to e-cigarettes and chemistry using 5 reference databases and 11 search terms. The search date range was January 2007 to September 2013. The search yielded 36 articles, of which 29 were deemed relevant for analysis. The levels of nicotine, tobacco-specific nitrosamines (TSNAs), aldehydes, metals, volatile organic compounds (VOCs), flavours, solvent carriers and tobacco alkaloids in e-cigarette refill solutions, cartridges, aerosols and environmental emissions vary considerably. The delivery of nicotine and the release of TSNAs, aldehydes and metals are not consistent across products. Furthermore, the nicotine level listed on the labels of e-cigarette cartridges and refill solutions is often significantly different from measured values. Phenolic compounds, polycyclic aromatic hydrocarbons and drugs have also been reported in e-cigarette refill solutions, cartridges and aerosols. Varying results in particle size distributions of particular matter emissions from e-cigarettes across studies have been observed. Methods applied for the generation and chemical analyses of aerosols differ across studies. Performance characteristics of e-cigarette devices also vary across and within brands. Additional studies based on knowledge of e-cigarette user behaviours and scientifically validated aerosol generation and chemical analysis methods would be helpful in generating reliable measures of chemical quantities. This would allow comparisons of e-cigarette aerosol and traditional smoke constituent levels and would inform an evaluation of the toxicity potential of e-cigarettes.

BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees.

PubMed

Fleischauer, Markus; Böcker, Sebastian

2018-01-01

Supertree methods enable the reconstruction of large phylogenies. The supertree problem can be formalized in different ways in order to cope with contradictory information in the input. Some supertree methods are based on encoding the input trees in a matrix; other methods try to find minimum cuts in some graph. Recently, we introduced Bad Clade Deletion (BCD) supertrees which combines the graph-based computation of minimum cuts with optimizing a global objective function on the matrix representation of the input trees. The BCD supertree method has guaranteed polynomial running time and is very swift in practice. The quality of reconstructed supertrees was superior to matrix representation with parsimony (MRP) and usually on par with SuperFine for simulated data; but particularly for biological data, quality of BCD supertrees could not keep up with SuperFine supertrees. Here, we present a beam search extension for the BCD algorithm that keeps alive a constant number of partial solutions in each top-down iteration phase. The guaranteed worst-case running time of the new algorithm is still polynomial in the size of the input. We present an exact and a randomized subroutine to generate suboptimal partial solutions. Both beam search approaches consistently improve supertree quality on all evaluated datasets when keeping 25 suboptimal solutions alive. Supertree quality of the BCD Beam Search algorithm is on par with MRP and SuperFine even for biological data. This is the best performance of a polynomial-time supertree algorithm reported so far.

Open Innovation and the Evolving Federal R&D Enterprise

EPA Science Inventory

Open Innovation approaches, from crowdsourcing to prize competitions, are being adopted by federal agencies at an accelerating rate over the last ten years. Open Innovation is a problem‐solving approach that seeks to gather and develop external ideas and solutions in additi...

77 FR 5566 - Notice of Availability of the Final EIS for the HB In-Situ Solution Mine Project, Eddy County...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-03

...] Notice of Availability of the Final EIS for the HB In-Situ Solution Mine Project, Eddy County, New Mexico... Statement (Final EIS) for the HB In-Situ Solution Mine Project, and by this notice is announcing its... the Federal Register. ADDRESSES: Copies of the HB In-Situ Solution Mining EIS are available for public...

Alternative Fuels Data Center: All-Electric Vehicles

Science.gov Websites

. electricity production contributes to air pollution, the U.S. Environmental Protection Agency categorizes all Location Map a Route Laws & Incentives Search Federal State Key Legislation Data & Tools Widgets

Exploiting OAuth 2.0: from User Delegation for OGC Services to a Generic Federation-as-a-Service Solution for Federated Identity Management

NASA Astrophysics Data System (ADS)

Kershaw, Philip; Jensen, Jens; Stephens, Ag; van Engen, Willem

2013-04-01

We explore an application of OAuth to enable user delegation for OGC-based services and the evolution of this solution to form part of a wider Federation-as-a-Service offering for federated identity management. OAuth has established itself in the commercial sector as a means for users to delegate access to secured resources under their control to third parties. It has also found its way into the academic and research domains as a solution for user delegation. Notable examples including the CILogon project for Teragrid in the US, and also, closer to the Earth Sciences, as part of the OGC Web Services, Phase 6 Testbed. Both are examples of OAuth 1.0 implementations. Version 2.0 has seen significant changes to this original specification which have not been without controversy but it has arguably provided a greater degree of flexibility in how it can be applied and the use cases that it can address. At CEDA (Centre for Environmental Data Archival, STFC), a Python implementation of OAuth 2.0 was made to explore these capabilities with a focus on providing a solution for user delegation for data access, processing and visualisation services for the Earth Observation and Climate sciences domains. The initial goal was to provide a means of delegating short-lived user credentials to trusted services along the same lines as the established approach of Proxy certificates widely used in Grid computing. For the OGC and other HTTP-based services employed by CEDA, OAuth makes a natural fit for this role, integrating with minimal impact on existing interfaces. Working implementations have been made for CEDA's COWS Web Processing Service and Web Map Service. Packaging the software and making it available in Open Source repositories together with the generic nature of the solution have made it readily exploitable in other application domains. At the Max Planck Institute for Psycholinguistics (Nijmegen, The Netherlands), the software will be used to integrate some tools in the CLARIN infrastructure*. Enhancements have been fedback to the package through this activity. Collaboration with STFC's Scientific Computing department has also seen this solution expand and evolve to support a more demanding set of use cases required to meet the needs for Contrail, an EU Framework 7 project. The goal of Contrail is to develop an Open Source solution for federating resources from multiple Cloud providers. Bringing the solution developed with OAuth together with technologies such as SAML and OpenID it has been possible to develop a generic suite of services to support federated access and identity management, a Federation-as-a-Service package. This is showing promise with trials with the EUDAT project. A deployment of the Contrail software is also planned for CEMS (the facility for Climate and Environmental Monitoring from Space), a new joint academic-industry led facility based at the STFC Harwell site providing access to large-volume Earth Observation and Climate datasets through a Cloud-based service model. * This work is part of the programme of BiG Grid, the Dutch e-Science Grid, which is financially supported by the Netherlands Organisation for Scientific Research, NWO.

A Solution Framework for Environmental Characterization Problems

EPA Science Inventory

This paper describes experiences developing a grid-enabled framework for solving environmental inverse problems. The solution approach taken here couples environmental simulation models with global search methods and requires readily available computational resources of the grid ...

Spacecraft Attitude Maneuver Planning Using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Kornfeld, Richard P.

2004-01-01

A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This approach for attitude path planning makes full use of a priori constraint knowledge and is computationally tractable enough to be executed onboard a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used as is or as an initial solution to initialize additional deterministic optimization algorithms. A number of representative case examples for time-fixed and time-varying conditions yielded search times that are typically on the order of minutes, thus demonstrating the viability of this method. This approach is applicable to all deep space and planet Earth missions requiring greater spacecraft autonomy, and greatly facilitates navigation and science observation planning.

A hybrid artificial bee colony algorithm for numerical function optimization

NASA Astrophysics Data System (ADS)

Alqattan, Zakaria N.; Abdullah, Rosni

2015-02-01

Artificial Bee Colony (ABC) algorithm is one of the swarm intelligence algorithms; it has been introduced by Karaboga in 2005. It is a meta-heuristic optimization search algorithm inspired from the intelligent foraging behavior of the honey bees in nature. Its unique search process made it as one of the most competitive algorithm with some other search algorithms in the area of optimization, such as Genetic algorithm (GA) and Particle Swarm Optimization (PSO). However, the ABC performance of the local search process and the bee movement or the solution improvement equation still has some weaknesses. The ABC is good in avoiding trapping at the local optimum but it spends its time searching around unpromising random selected solutions. Inspired by the PSO, we propose a Hybrid Particle-movement ABC algorithm called HPABC, which adapts the particle movement process to improve the exploration of the original ABC algorithm. Numerical benchmark functions were used in order to experimentally test the HPABC algorithm. The results illustrate that the HPABC algorithm can outperform the ABC algorithm in most of the experiments (75% better in accuracy and over 3 times faster).

46 CFR 402.220 - Registration of pilots.

Code of Federal Regulations, 2014 CFR

2014-10-01

... in search and rescue and civil defense procedures as issued by the U.S. Coast Guard, Federal, State, and local port authorities. (5) Instruction in basic helm and engine telegraph orders in the Greek...

46 CFR 402.220 - Registration of pilots.

Code of Federal Regulations, 2012 CFR

2012-10-01

... in search and rescue and civil defense procedures as issued by the U.S. Coast Guard, Federal, State, and local port authorities. (5) Instruction in basic helm and engine telegraph orders in the Greek...

46 CFR 402.220 - Registration of pilots.

Code of Federal Regulations, 2013 CFR

2013-10-01

... in search and rescue and civil defense procedures as issued by the U.S. Coast Guard, Federal, State, and local port authorities. (5) Instruction in basic helm and engine telegraph orders in the Greek...

ACHP | News

Science.gov Websites

Search skip specific nav links Home arrow News Internal Revenue Service Wins Chairman's Award for Federal Redstone Castle WASHINGTON, DC-The Internal Revenue Service (IRS) received the Advisory Council on Historic

46 CFR 402.220 - Registration of pilots.

Code of Federal Regulations, 2011 CFR

2011-10-01

... in search and rescue and civil defense procedures as issued by the U.S. Coast Guard, Federal, State, and local port authorities. (5) Instruction in basic helm and engine telegraph orders in the Greek...

46 CFR 402.220 - Registration of pilots.

Code of Federal Regulations, 2010 CFR

2010-10-01

... in search and rescue and civil defense procedures as issued by the U.S. Coast Guard, Federal, State, and local port authorities. (5) Instruction in basic helm and engine telegraph orders in the Greek...

Optimization in optical systems revisited: Beyond genetic algorithms

NASA Astrophysics Data System (ADS)

Gagnon, Denis; Dumont, Joey; Dubé, Louis

2013-05-01

Designing integrated photonic devices such as waveguides, beam-splitters and beam-shapers often requires optimization of a cost function over a large solution space. Metaheuristics - algorithms based on empirical rules for exploring the solution space - are specifically tailored to those problems. One of the most widely used metaheuristics is the standard genetic algorithm (SGA), based on the evolution of a population of candidate solutions. However, the stochastic nature of the SGA sometimes prevents access to the optimal solution. Our goal is to show that a parallel tabu search (PTS) algorithm is more suited to optimization problems in general, and to photonics in particular. PTS is based on several search processes using a pool of diversified initial solutions. To assess the performance of both algorithms (SGA and PTS), we consider an integrated photonics design problem, the generation of arbitrary beam profiles using a two-dimensional waveguide-based dielectric structure. The authors acknowledge financial support from the Natural Sciences and Engineering Research Council of Canada (NSERC).

77 FR 43820 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-26

.... Applicants: Direct Energy Services, LLC, Energetix, Inc., NYSEG Solutions, Inc. Description: Joint Application for Authorization under Section 203 of the Federal Power Act of Direct Energy Services, LLC, et al... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission Combined Notice of Filings 1 Take notice...

A Machine Learning Approach to Student Modeling.

DTIC Science & Technology

1984-05-01

machine learning , and describe ACN, a student modeling system that incorporates this approach. This system begins with a set of overly general rules, which it uses to search a problem space until it arrives at the same answer as the student. The ACM computer program then uses the solution path it has discovered to determine positive and negative instances of its initial rules, and employs a discrimination learning mechanism to place additional conditions on these rules. The revised rules will reproduce the solution path without search, and constitute a cognitive model of

Absolute Points for Multiple Assignment Problems

ERIC Educational Resources Information Center

Adlakha, V.; Kowalski, K.

2006-01-01

An algorithm is presented to solve multiple assignment problems in which a cost is incurred only when an assignment is made at a given cell. The proposed method recursively searches for single/group absolute points to identify cells that must be loaded in any optimal solution. Unlike other methods, the first solution is the optimal solution. The…

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

NASA Astrophysics Data System (ADS)

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

2012-12-01

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

A novel harmony search-K means hybrid algorithm for clustering gene expression data

PubMed Central

Nazeer, KA Abdul; Sebastian, MP; Kumar, SD Madhu

2013-01-01

Recent progress in bioinformatics research has led to the accumulation of huge quantities of biological data at various data sources. The DNA microarray technology makes it possible to simultaneously analyze large number of genes across different samples. Clustering of microarray data can reveal the hidden gene expression patterns from large quantities of expression data that in turn offers tremendous possibilities in functional genomics, comparative genomics, disease diagnosis and drug development. The k- ¬means clustering algorithm is widely used for many practical applications. But the original k-¬means algorithm has several drawbacks. It is computationally expensive and generates locally optimal solutions based on the random choice of the initial centroids. Several methods have been proposed in the literature for improving the performance of the k-¬means algorithm. A meta-heuristic optimization algorithm named harmony search helps find out near-global optimal solutions by searching the entire solution space. Low clustering accuracy of the existing algorithms limits their use in many crucial applications of life sciences. In this paper we propose a novel Harmony Search-K means Hybrid (HSKH) algorithm for clustering the gene expression data. Experimental results show that the proposed algorithm produces clusters with better accuracy in comparison with the existing algorithms. PMID:23390351

A novel harmony search-K means hybrid algorithm for clustering gene expression data.

PubMed

Nazeer, Ka Abdul; Sebastian, Mp; Kumar, Sd Madhu

2013-01-01

Recent progress in bioinformatics research has led to the accumulation of huge quantities of biological data at various data sources. The DNA microarray technology makes it possible to simultaneously analyze large number of genes across different samples. Clustering of microarray data can reveal the hidden gene expression patterns from large quantities of expression data that in turn offers tremendous possibilities in functional genomics, comparative genomics, disease diagnosis and drug development. The k- ¬means clustering algorithm is widely used for many practical applications. But the original k-¬means algorithm has several drawbacks. It is computationally expensive and generates locally optimal solutions based on the random choice of the initial centroids. Several methods have been proposed in the literature for improving the performance of the k-¬means algorithm. A meta-heuristic optimization algorithm named harmony search helps find out near-global optimal solutions by searching the entire solution space. Low clustering accuracy of the existing algorithms limits their use in many crucial applications of life sciences. In this paper we propose a novel Harmony Search-K means Hybrid (HSKH) algorithm for clustering the gene expression data. Experimental results show that the proposed algorithm produces clusters with better accuracy in comparison with the existing algorithms.

Smarter Earth Science Data System

NASA Technical Reports Server (NTRS)

Huang, Thomas

2013-01-01

The explosive growth in Earth observational data in the recent decade demands a better method of interoperability across heterogeneous systems. The Earth science data system community has mastered the art in storing large volume of observational data, but it is still unclear how this traditional method scale over time as we are entering the age of Big Data. Indexed search solutions such as Apache Solr (Smiley and Pugh, 2011) provides fast, scalable search via keyword or phases without any reasoning or inference. The modern search solutions such as Googles Knowledge Graph (Singhal, 2012) and Microsoft Bing, all utilize semantic reasoning to improve its accuracy in searches. The Earth science user community is demanding for an intelligent solution to help them finding the right data for their researches. The Ontological System for Context Artifacts and Resources (OSCAR) (Huang et al., 2012), was created in response to the DARPA Adaptive Vehicle Make (AVM) programs need for an intelligent context models management system to empower its terrain simulation subsystem. The core component of OSCAR is the Environmental Context Ontology (ECO) is built using the Semantic Web for Earth and Environmental Terminology (SWEET) (Raskin and Pan, 2005). This paper presents the current data archival methodology within a NASA Earth science data centers and discuss using semantic web to improve the way we capture and serve data to our users.

A master-slave parallel hybrid multi-objective evolutionary algorithm for groundwater remediation design under general hydrogeological conditions

NASA Astrophysics Data System (ADS)

Wu, J.; Yang, Y.; Luo, Q.; Wu, J.

2012-12-01

This study presents a new hybrid multi-objective evolutionary algorithm, the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), whereby the global search ability of niched Pareto tabu search (NPTS) is improved by the diversification of candidate solutions arose from the evolving nondominated sorting genetic algorithm II (NSGA-II) population. Also, the NPTSGA coupled with the commonly used groundwater flow and transport codes, MODFLOW and MT3DMS, is developed for multi-objective optimal design of groundwater remediation systems. The proposed methodology is then applied to a large-scale field groundwater remediation system for cleanup of large trichloroethylene (TCE) plume at the Massachusetts Military Reservation (MMR) in Cape Cod, Massachusetts. Furthermore, a master-slave (MS) parallelization scheme based on the Message Passing Interface (MPI) is incorporated into the NPTSGA to implement objective function evaluations in distributed processor environment, which can greatly improve the efficiency of the NPTSGA in finding Pareto-optimal solutions to the real-world application. This study shows that the MS parallel NPTSGA in comparison with the original NPTS and NSGA-II can balance the tradeoff between diversity and optimality of solutions during the search process and is an efficient and effective tool for optimizing the multi-objective design of groundwater remediation systems under complicated hydrogeologic conditions.

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

Performance-Based Service Acquisition (PBSA) Study and Graduate Level Course Material

DTIC Science & Technology

2005-12-01

Realizing Marketplace Potential, Acquisition Solutions, Inc (Advisory), February 2001 Dickson, Bob, March 10, 2003. Federal 7 Contract Law : Feds...Management and Policy Federal Contract Law : Feds should use market research to refine IT plans Session 4: The Performance Requirements and...March 10, 2003. Federal Contract Law : Feds should use market research to refine IT plans, Post-Newsweek Media, Inchttp://appserv.gcn.com/cgi- bin/udt

Taboo Search: An Approach to the Multiple Minima Problem

NASA Astrophysics Data System (ADS)

Cvijovic, Djurdje; Klinowski, Jacek

1995-02-01

Described here is a method, based on Glover's taboo search for discrete functions, of solving the multiple minima problem for continuous functions. As demonstrated by model calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimization, this procedure is generally applicable, easy to implement, derivative-free, and conceptually simple.

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bernal, Andrés; Patiny, Luc; Castillo, Andrés M.

2015-02-21

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound method are presented: 1. reduction of the size of the solution space by resort to a condensed structure formula, wherein symmetric nuclei are grouped together; 2. partitioning of the solution space based on symmetry, that becomes the basis for an efficient branching procedure; and 3. a criterion of selection of input restrictions that leads to increased gaps between branches and thus faster pruningmore » of non-viable solutions. Although the examples chosen to illustrate this work focus on small-molecule NMR assignment, the results are generic and might help solving other combinatorial optimization problems.« less

77 FR 11618 - Solutions Capital I, L.P.; Notice Seeking Exemption Under the Small Business Investment Act...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-27

... SMALL BUSINESS ADMINISTRATION [License No. 03/03-0247] Solutions Capital I, L.P.; Notice Seeking Exemption Under the Small Business Investment Act, Conflicts of Interest Notice is hereby given that Solutions Capital I, L.P., 1100 Wilson Blvd., Suite 3000, Arlington, VA 22209, a Federal Licensee under the...

75 FR 32230 - Solutions Capital I, L.P.; Notice Seeking Exemption Under Section 312 of the Small Business...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-07

... SMALL BUSINESS ADMINISTRATION [License No. 03/03-0247] Solutions Capital I, L.P.; Notice Seeking Exemption Under Section 312 of the Small Business Investment Act, Conflicts of Interest Notice is hereby given that Solutions Capital I, L.P., 1100 Wilson Blvd., Suite 3000, Arlington, VA 22209, a Federal...

‘I’m searching for solutions’: why are obese individuals turning to the Internet for help and support with ‘being fat’?

PubMed Central

Lewis, Sophie; Thomas, Samantha L.; Blood, R. Warwick; Castle, David; Hyde, Jim; Komesaroff, Paul A.

2010-01-01

Abstract Introduction  This study explores what types of information obese individuals search for on the Internet, their motivations for seeking information and how they apply it in their daily lives. Method  In‐depth telephone interviews with an Australian community sample of 142 individuals with a BMI ≥ 30 were conducted. Theoretical, purposive and strategic samplings were employed. Data were analysed using a constant comparative method. Results  Of the 142 individuals who participated in the study, 111 (78%) searched for information about weight loss or obesity. Of these, about three quarters searched for weight loss solutions. The higher the individual’s weight, the more they appeared to search for weight loss solutions. Participants also searched for information about health risks associated with obesity (n = 28), how to prevent poor health outcomes (n = 30) and for peer support forums with other obese individuals (n = 25). Whilst participants visited a range of websites, including government‐sponsored sites, community groups and weight loss companies, they overwhelmingly acted upon the advice given on commercial diet websites. However, safe, non‐judgemental spaces such as the Fatosphere (online fat acceptance community) provided much needed solidarity and support. Conclusions  The Internet provides a convenient source of support and information for obese individuals. However, many turn to the same unsuccessful solutions online (e.g. fad dieting) they turn to in the community. Government and community organisations could draw upon some lessons learned in other consumer‐driven online spaces (e.g. the Fatosphere) to provide supportive environments for obese individuals that resonate with their health and social experiences, and address their needs. PMID:21199200

Harmony search optimization algorithm for a novel transportation problem in a consolidation network

NASA Astrophysics Data System (ADS)

Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad

2014-11-01

This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.

Public Leadership Competencies in Adoption of Enterprise Systems at Federal Government Institutions

ERIC Educational Resources Information Center

Lapham, John Edmund

2009-01-01

The Federal Government continues to implement enterprise systems (information and communication technology solutions) as part of reinvention and business transformation. Enterprise system implementations are complex, costly, and often under achieving endeavors requiring that effective public leaders engage and influence the sociotechnical projects…

Analysis of helicopter position determination methods

DOT National Transportation Integrated Search

1992-01-01

The Federal Aviation Administration (FAA), along with members of the helicopter industry, is continually searching for methods to reduce the cost and effort required for helicopter noise certification. In September 1992, the FAA adopted Appendix J of...

77 FR 56645 - Federal Acquisition Regulation; Information Collection; Accident Prevention Plans and Recordkeeping

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-13

... selecting ``Search''. Select the link ``Submit a Comment'' that corresponds with ``Information Collection... involves work of a long duration, or hazardous nature, the contracting officer shall insert the clause with...

David Lee, Douglas Osheroff, Superfluidity, and Helium 3

Science.gov Websites

, and experimental searches for new magnetically ordered two dimensional phases of both solid and liquid non-federal websites. Their policies may differ from this site. Website Policies/Important Links U.S

In Search of Good Counsel.

ERIC Educational Resources Information Center

Tanner-Otts, Virginia

1995-01-01

School attorneys interpret state and federal laws, head off expensive lawsuits, and defend their districts aggressively in court. Offers advice on how to find and keep a good attorney. Contains a sample advertisement for the position. (MLF)

Bibliography on Rail Technology

DOT National Transportation Integrated Search

1977-03-01

This rail technology review provides assistance to a number of rail technology programs initiated by the Transportation Systems Center (TSC) for the Federal Railroad Administration (FRA). The results of a search and review in four specific areas in t...

78 FR 17185 - Proposed Collection; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-20

... Agent Platform, Customer Relationship Management (CRM) and supporting Knowledge Base (KB) solution that... . Follow the instructions for submitting comments. Mail: Federal Docket Management System Office, 2nd Floor.... Title, Associated Form, and OMB Control Number: Customer Care Center Enterprise Solution (CCCES); OMB...

[Evaluation of possibility of using new financial instruments for supporting biomedical projects].

PubMed

Starodubov, V I; Kurakova, N G; Eremchenko, O A; Tsvetkova, L A; Zinov, V G

2014-01-01

Analysis of selection criteria on projects of Russian medical research centers for funding in Russian scientific fund and Federal program "Research and innovations" was done. It was noted that a high degree of uncertainty of such concepts as "priority direction", "applied" and "search" research and "industrial partner" in regards to research of biomedical theme. Analysis of classified "Medicine and health care" "Forecast of scientific-technological development of Russian Federation till 2030 year" were completed.

Federal Logistics Information System (FLIS) Procedures Manual. Volume 5: Data Bank Interrogations/Search.

DTIC Science & Technology

1995-04-01

NO. 5 DoD 4100.39-M D oD 4100.39-MN Volume 5 DLSC- VPH 1 January 1997 "N FEDERAL LOGISTICS INFORMATION SYSTEM (FLIS) PROCEDURES MANUAL I. Volume 5. DoD...LOGISTICS SERVICES CENTER 74 WASHINGTON AVE N BATTLE CREEK MI 49017-3084 CH 4 CHANGE NO. 4 DoD 4100.39-M DoD 4100.39-M Volume 5 DLSC- VPH 1 July 1996 "FEDERAL...CENTER Volume 5 74 WASHINGTON AVE N BATTLE CREEK, MI 49017-3084 DLSC- VPH 1 April 1995 FOREWORD This is one of the volumes (see backside of cover for

Findability of Federal Research Data

NASA Astrophysics Data System (ADS)

Hourcle, J. A.

2013-12-01

Findability of Federal Research Data Although many of the federal agencies have been providing access to scientific research data for years if not decades, the findability of the data has been quite lacking. Many discipline-wide efforts have been made in the big science communities, such as PDS for planetary science and the VOs in night time astronomy and heliophysics, but there is a lack of single entry point for someone looking for data. The science.gov website contains links to many of these big-science search systems, but doesn't differentiate between links to science quality data and websites or browse products, making it more difficult to search specifically for data. The data.gov website is a useful repository for PIs of small science data to stash their data, particularly as it allows for interested parties to interact with tabular data. Unfortunately, as each group thinks of their data differently, much of what's now in the system is a mess; collections of data being tracked as individual records with no relationships between them. Big science projects also get tracked as single records, potentially with only a single record for missions with multiple instruments and significantly different data series. We present recommendations on how to improve the findability of federal research data on data.gov, based on years of working on the Virtual Solar Observatory and withing the science informatics community.

Hybrid water flow-like algorithm with Tabu search for traveling salesman problem

NASA Astrophysics Data System (ADS)

Bostamam, Jasmin M.; Othman, Zulaiha

2016-08-01

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TS-TSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TS-TSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique.

Chemical evaluation of electronic cigarettes

PubMed Central

Cheng, Tianrong

2014-01-01

Objective To review the available evidence evaluating the chemicals in refill solutions, cartridges, aerosols and environmental emissions of electronic cigarettes (e-cigarettes). Methods Systematic literature searches were conducted to identify research related to e-cigarettes and chemistry using 5 reference databases and 11 search terms. The search date range was January 2007 to September 2013. The search yielded 36 articles, of which 29 were deemed relevant for analysis. Results The levels of nicotine, tobacco-specific nitrosamines (TSNAs), aldehydes, metals, volatile organic compounds (VOCs), flavours, solvent carriers and tobacco alkaloids in e-cigarette refill solutions, cartridges, aerosols and environmental emissions vary considerably. The delivery of nicotine and the release of TSNAs, aldehydes and metals are not consistent across products. Furthermore, the nicotine level listed on the labels of e-cigarette cartridges and refill solutions is often significantly different from measured values. Phenolic compounds, polycyclic aromatic hydrocarbons and drugs have also been reported in e-cigarette refill solutions, cartridges and aerosols. Varying results in particle size distributions of particular matter emissions from e-cigarettes across studies have been observed. Methods applied for the generation and chemical analyses of aerosols differ across studies. Performance characteristics of e-cigarette devices also vary across and within brands. Conclusions Additional studies based on knowledge of e-cigarette user behaviours and scientifically validated aerosol generation and chemical analysis methods would be helpful in generating reliable measures of chemical quantities. This would allow comparisons of e-cigarette aerosol and traditional smoke constituent levels and would inform an evaluation of the toxicity potential of e-cigarettes. PMID:24732157

The NCAR Digital Asset Services Hub (DASH): Implementing Unified Data Discovery and Access

NASA Astrophysics Data System (ADS)

Stott, D.; Worley, S. J.; Hou, C. Y.; Nienhouse, E.

2017-12-01

The National Center for Atmospheric Research (NCAR) Directorate created the Data Stewardship Engineering Team (DSET) to plan and implement an integrated single entry point for uniform digital asset discovery and access across the organization in order to improve the efficiency of access, reduce the costs, and establish the foundation for interoperability with other federated systems. This effort supports new policies included in federal funding mandates, NSF data management requirements, and journal citation recommendations. An inventory during the early planning stage identified diverse asset types across the organization that included publications, datasets, metadata, models, images, and software tools and code. The NCAR Digital Asset Services Hub (DASH) is being developed and phased in this year to improve the quality of users' experiences in finding and using these assets. DASH serves to provide engagement, training, search, and support through the following four nodes (see figure). DASH MetadataDASH provides resources for creating and cataloging metadata to the NCAR Dialect, a subset of ISO 19115. NMDEdit, an editor based on a European open source application, has been configured for manual entry of NCAR metadata. CKAN, an open source data portal platform, harvests these XML records (along with records output directly from databases) from a Web Accessible Folder (WAF) on GitHub for validation. DASH SearchThe NCAR Dialect metadata drives cross-organization search and discovery through CKAN, which provides the display interface of search results. DASH search will establish interoperability by facilitating metadata sharing with other federated systems. DASH ConsultingThe DASH Data Curation & Stewardship Coordinator assists with Data Management (DM) Plan preparation and advises on Digital Object Identifiers. The coordinator arranges training sessions on the DASH metadata tools and DM planning, and provides one-on-one assistance as requested. DASH RepositoryA repository is under development for NCAR datasets currently not in existing lab-managed archives. The DASH repository will be under NCAR governance and meet Trustworthy Repositories Audit & Certification (TRAC) requirements. This poster will highlight the processes, lessons learned, and current status of the DASH effort at NCAR.

A Method for Estimating View Transformations from Image Correspondences Based on the Harmony Search Algorithm

PubMed Central

Cuevas, Erik; Díaz, Margarita

2015-01-01

In this paper, a new method for robustly estimating multiple view relations from point correspondences is presented. The approach combines the popular random sampling consensus (RANSAC) algorithm and the evolutionary method harmony search (HS). With this combination, the proposed method adopts a different sampling strategy than RANSAC to generate putative solutions. Under the new mechanism, at each iteration, new candidate solutions are built taking into account the quality of the models generated by previous candidate solutions, rather than purely random as it is the case of RANSAC. The rules for the generation of candidate solutions (samples) are motivated by the improvisation process that occurs when a musician searches for a better state of harmony. As a result, the proposed approach can substantially reduce the number of iterations still preserving the robust capabilities of RANSAC. The method is generic and its use is illustrated by the estimation of homographies, considering synthetic and real images. Additionally, in order to demonstrate the performance of the proposed approach within a real engineering application, it is employed to solve the problem of position estimation in a humanoid robot. Experimental results validate the efficiency of the proposed method in terms of accuracy, speed, and robustness. PMID:26339228

The use of methods of structural optimization at the stage of designing high-rise buildings with steel construction

NASA Astrophysics Data System (ADS)

Vasilkin, Andrey

2018-03-01

The more designing solutions at the search stage for design for high-rise buildings can be synthesized by the engineer, the more likely that the final adopted version will be the most efficient and economical. However, in modern market conditions, taking into account the complexity and responsibility of high-rise buildings the designer does not have the necessary time to develop, analyze and compare any significant number of options. To solve this problem, it is expedient to use the high potential of computer-aided designing. To implement automated search for design solutions, it is proposed to develop the computing facilities, the application of which will significantly increase the productivity of the designer and reduce the complexity of designing. Methods of structural and parametric optimization have been adopted as the basis of the computing facilities. Their efficiency in the synthesis of design solutions is shown, also the schemes, that illustrate and explain the introduction of structural optimization in the traditional design of steel frames, are constructed. To solve the problem of synthesis and comparison of design solutions for steel frames, it is proposed to develop the computing facilities that significantly reduces the complexity of search designing and based on the use of methods of structural and parametric optimization.

Considering Decision Variable Diversity in Multi-Objective Optimization: Application in Hydrologic Model Calibration

NASA Astrophysics Data System (ADS)

Sahraei, S.; Asadzadeh, M.

2017-12-01

Any modern multi-objective global optimization algorithm should be able to archive a well-distributed set of solutions. While the solution diversity in the objective space has been explored extensively in the literature, little attention has been given to the solution diversity in the decision space. Selection metrics such as the hypervolume contribution and crowding distance calculated in the objective space would guide the search toward solutions that are well-distributed across the objective space. In this study, the diversity of solutions in the decision-space is used as the main selection criteria beside the dominance check in multi-objective optimization. To this end, currently archived solutions are clustered in the decision space and the ones in less crowded clusters are given more chance to be selected for generating new solution. The proposed approach is first tested on benchmark mathematical test problems. Second, it is applied to a hydrologic model calibration problem with more than three objective functions. Results show that the chance of finding more sparse set of high-quality solutions increases, and therefore the analyst would receive a well-diverse set of options with maximum amount of information. Pareto Archived-Dynamically Dimensioned Search, which is an efficient and parsimonious multi-objective optimization algorithm for model calibration, is utilized in this study.

Federated Space-Time Query for Earth Science Data Using OpenSearch Conventions

NASA Technical Reports Server (NTRS)

Lynnes, Chris; Beaumont, Bruce; Duerr, Ruth; Hua, Hook

2009-01-01

This slide presentation reviews a Space-time query system that has been developed to assist the user in finding Earth science data that fulfills the researchers needs. It reviews the reasons why finding Earth science data can be so difficult, and explains the workings of the Space-Time Query with OpenSearch and how this system can assist researchers in finding the required data, It also reviews the developments with client server systems.

75 FR 20400 - Submission for Review: Federal Cyber Service: Scholarship for Service (SFS) Registration Web Site

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-19

... OFFICE OF PERSONNEL MANAGEMENT Submission for Review: Federal Cyber Service: Scholarship for Service (SFS) Registration Web Site AGENCY: U.S. Office of Personnel Management. ACTION: 60-Day Notice and request for comments. SUMMARY: The Human Resources Solutions, Office of Personnel Management (OPM) offers...

75 FR 57086 - Submission for Review: Federal Cyber Service: Scholarship for Service (SFS) Registration Web Site

Federal Register 2010, 2011, 2012, 2013, 2014

2010-09-17

... OFFICE OF PERSONNEL MANAGEMENT Submission for Review: Federal Cyber Service: Scholarship for Service (SFS) Registration Web Site AGENCY: Office of Personnel Management. ACTION: 30-Day Notice and request for comments. SUMMARY: The Office of Personnel Management (OPM), Human Resources Solutions...

CALIL.JP, a new web service that provides one-stop searching of Japan-wide libraries' collections

NASA Astrophysics Data System (ADS)

Yoshimoto, Ryuuji

Calil.JP is a new free online service that enables federated searching, marshalling and integration of Web-OPAC data on the collections of libraries from around Japan. It offers the search results through user-friendly interface. Developed with a concept of accelerating discovery of fun-to-read books and motivating users to head for libraries, Calil was initially designed mainly for public library users. It now extends to cover university libraries and special libraries. This article presents the Calil's basic capabilities, concept, progress made thus far, and plan for further development as viewed from an engineering development manager.

BCI Control of Heuristic Search Algorithms

PubMed Central

Cavazza, Marc; Aranyi, Gabor; Charles, Fred

2017-01-01

The ability to develop Brain-Computer Interfaces (BCI) to Intelligent Systems would offer new perspectives in terms of human supervision of complex Artificial Intelligence (AI) systems, as well as supporting new types of applications. In this article, we introduce a basic mechanism for the control of heuristic search through fNIRS-based BCI. The rationale is that heuristic search is not only a basic AI mechanism but also one still at the heart of many different AI systems. We investigate how users’ mental disposition can be harnessed to influence the performance of heuristic search algorithm through a mechanism of precision-complexity exchange. From a system perspective, we use weighted variants of the A* algorithm which have an ability to provide faster, albeit suboptimal solutions. We use recent results in affective BCI to capture a BCI signal, which is indicative of a compatible mental disposition in the user. It has been established that Prefrontal Cortex (PFC) asymmetry is strongly correlated to motivational dispositions and results anticipation, such as approach or even risk-taking, and that this asymmetry is amenable to Neurofeedback (NF) control. Since PFC asymmetry is accessible through fNIRS, we designed a BCI paradigm in which users vary their PFC asymmetry through NF during heuristic search tasks, resulting in faster solutions. This is achieved through mapping the PFC asymmetry value onto the dynamic weighting parameter of the weighted A* (WA*) algorithm. We illustrate this approach through two different experiments, one based on solving 8-puzzle configurations, and the other on path planning. In both experiments, subjects were able to speed up the computation of a solution through a reduction of search space in WA*. Our results establish the ability of subjects to intervene in heuristic search progression, with effects which are commensurate to their control of PFC asymmetry: this opens the way to new mechanisms for the implementation of hybrid cognitive systems. PMID:28197092

BCI Control of Heuristic Search Algorithms.

PubMed

Cavazza, Marc; Aranyi, Gabor; Charles, Fred

2017-01-01

The ability to develop Brain-Computer Interfaces (BCI) to Intelligent Systems would offer new perspectives in terms of human supervision of complex Artificial Intelligence (AI) systems, as well as supporting new types of applications. In this article, we introduce a basic mechanism for the control of heuristic search through fNIRS-based BCI. The rationale is that heuristic search is not only a basic AI mechanism but also one still at the heart of many different AI systems. We investigate how users' mental disposition can be harnessed to influence the performance of heuristic search algorithm through a mechanism of precision-complexity exchange. From a system perspective, we use weighted variants of the A* algorithm which have an ability to provide faster, albeit suboptimal solutions. We use recent results in affective BCI to capture a BCI signal, which is indicative of a compatible mental disposition in the user. It has been established that Prefrontal Cortex (PFC) asymmetry is strongly correlated to motivational dispositions and results anticipation, such as approach or even risk-taking, and that this asymmetry is amenable to Neurofeedback (NF) control. Since PFC asymmetry is accessible through fNIRS, we designed a BCI paradigm in which users vary their PFC asymmetry through NF during heuristic search tasks, resulting in faster solutions. This is achieved through mapping the PFC asymmetry value onto the dynamic weighting parameter of the weighted A* (WA*) algorithm. We illustrate this approach through two different experiments, one based on solving 8-puzzle configurations, and the other on path planning. In both experiments, subjects were able to speed up the computation of a solution through a reduction of search space in WA*. Our results establish the ability of subjects to intervene in heuristic search progression, with effects which are commensurate to their control of PFC asymmetry: this opens the way to new mechanisms for the implementation of hybrid cognitive systems.

Engineering calculations for communications satellite systems planning

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Levis, C. A.; Mount-Campbell, C.; Gonsalvez, D. J.; Wang, C. W.; Yamamura, Y.

1985-01-01

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Graph pyramids as models of human problem solving

NASA Astrophysics Data System (ADS)

Pizlo, Zygmunt; Li, Zheng

2004-05-01

Prior theories have assumed that human problem solving involves estimating distances among states and performing search through the problem space. The role of mental representation in those theories was minimal. Results of our recent experiments suggest that humans are able to solve some difficult problems quickly and accurately. Specifically, in solving these problems humans do not seem to rely on distances or on search. It is quite clear that producing good solutions without performing search requires a very effective mental representation. In this paper we concentrate on studying the nature of this representation. Our theory takes the form of a graph pyramid. To verify the psychological plausibility of this theory we tested subjects in a Euclidean Traveling Salesman Problem in the presence of obstacles. The role of the number and size of obstacles was tested for problems with 6-50 cities. We analyzed the effect of experimental conditions on solution time per city and on solution error. The main result is that time per city is systematically affected only by the size of obstacles, but not by their number, or by the number of cities.

Global optimization methods for engineering design

NASA Technical Reports Server (NTRS)

Arora, Jasbir S.

1990-01-01

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

NASA Astrophysics Data System (ADS)

Nouri, Houssem Eddine; Belkahla Driss, Olfa; Ghédira, Khaled

2018-03-01

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based clustered holonic multiagent model. First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space. Second, a local search technique is used by a set of cluster agents to guide the research in promising regions of the search space and to improve the quality of the NGA final population. The efficiency of our approach is explained by the flexible selection of the promising parts of the search space by the clustering operator after the genetic algorithm process, and by applying the intensification technique of the tabu search allowing to restart the search from a set of elite solutions to attain new dominant scheduling solutions. Computational results are presented using four sets of well-known benchmark literature instances. New upper bounds are found, showing the effectiveness of the presented approach.

Mechanisms of Surface-Mediated DNA Hybridization

PubMed Central

2015-01-01

Single-molecule total internal reflection fluorescence microscopy was employed in conjunction with resonance energy transfer (RET) to observe the dynamic behavior of donor-labeled ssDNA at the interface between aqueous solution and a solid surface decorated with complementary acceptor-labeled ssDNA. At least 100 000 molecular trajectories were determined for both complementary strands and negative control ssDNA. RET was used to identify trajectory segments corresponding to the hybridized state. The vast majority of molecules from solution adsorbed nonspecifically to the surface, where a brief two-dimensional search was performed with a 7% chance of hybridization. Successful hybridization events occurred with a characteristic search time of ∼0.1 s, and unsuccessful searches resulted in desorption from the surface, ultimately repeating the adsorption and search process. Hybridization was reversible, and two distinct modes of melting (i.e., dehybridization) were observed, corresponding to long-lived (∼15 s) and short-lived (∼1.4 s) hybridized time intervals. A strand that melted back onto the surface could rehybridize after a brief search or desorb from the interface. These mechanistic observations provide guidance for technologies that involve DNA interactions in the near-surface region, suggesting a need to design surfaces that both enhance the complex multidimensional search process and stabilize the hybridized state. PMID:24708278

Eagle-i: Making Invisible Resources, Visible

PubMed Central

Haendel, M.; Wilson, M.; Torniai, C.; Segerdell, E.; Shaffer, C.; Frost, R.; Bourges, D.; Brownstein, J.; McInnerney, K.

2010-01-01

RP-134 The eagle-i Consortium – Dartmouth College, Harvard Medical School, Jackson State University, Morehouse School of Medicine, Montana State University, Oregon Health and Science University (OHSU), the University of Alaska, the University of Hawaii, and the University of Puerto Rico – aims to make invisible resources for scientific research visible by developing a searchable network of resource repositories at research institutions nationwide. Now in early development, it is hoped that the system will scale beyond the consortium at the end of the two-year pilot. Data Model & Ontology: The eagle-i ontology development team at the OHSU Library is generating the data model and ontologies necessary for resource indexing and querying. Our indexing system will enable cores and research labs to represent resources within a defined vocabulary, leading to more effective searches and better linkage between data types. This effort is being guided by active discussions within the ontology community (http://RRontology.tk) bringing together relevant preexisting ontologies in a logical framework. The goal of these discussions is to provide context for interoperability and domain-wide standards for resource types used throughout biomedical research. Research community feedback is welcomed. Architecture Development, led by a team at Harvard, includes four main components: tools for data collection, management and curation; an institutional resource repository; a federated network; and a central search application. Each participating institution will populate and manage their repository locally, using data collection and curation tools. To help improve search performance, data tools will support the semi-automatic annotation of resources. A central search application will use a federated protocol to broadcast queries to all repositories and display aggregated results. The search application will leverage the eagle-i ontologies to help guide users to valid queries via auto-suggestions and taxonomy browsing and improve search result quality via concept-based search and synonym expansion. Website: http://eagle-i.org. NIH/NCRR ARRA award #U24RR029825

7 CFR 3430.36 - Procedures to minimize or eliminate duplication of effort.

Code of Federal Regulations, 2013 CFR

2013-01-01

.... Business processes may include the review of the Current and Pending Support Form; documented CRIS searches... participation in Federal Government-wide and other committees, taskforces, or groups that seek to solve problems...

7 CFR 3430.36 - Procedures to minimize or eliminate duplication of effort.

Code of Federal Regulations, 2012 CFR

2012-01-01

.... Business processes may include the review of the Current and Pending Support Form; documented CRIS searches... participation in Federal Government-wide and other committees, taskforces, or groups that seek to solve problems...

7 CFR 3430.36 - Procedures to minimize or eliminate duplication of effort.

Code of Federal Regulations, 2014 CFR

2014-01-01

.... Business processes may include the review of the Current and Pending Support Form; documented CRIS searches... participation in Federal Government-wide and other committees, taskforces, or groups that seek to solve problems...

41 CFR 102-73.305 - What relocation assistance policy must Federal agencies follow?

Code of Federal Regulations, 2012 CFR

2012-01-01

... displaced person for actual— (a) Reasonable moving expenses (in moving himself, his family, and business...) Reasonable expenses in searching for a replacement business or farm; and (d) Reasonable expenses necessary to...

41 CFR 102-73.305 - What relocation assistance policy must Federal agencies follow?

Code of Federal Regulations, 2011 CFR

2011-01-01

... displaced person for actual— (a) Reasonable moving expenses (in moving himself, his family, and business...) Reasonable expenses in searching for a replacement business or farm; and (d) Reasonable expenses necessary to...

41 CFR 102-73.305 - What relocation assistance policy must Federal agencies follow?

Code of Federal Regulations, 2013 CFR

2013-07-01

... displaced person for actual— (a) Reasonable moving expenses (in moving himself, his family, and business...) Reasonable expenses in searching for a replacement business or farm; and (d) Reasonable expenses necessary to...

41 CFR 102-73.305 - What relocation assistance policy must Federal agencies follow?

Code of Federal Regulations, 2014 CFR

2014-01-01

... displaced person for actual— (a) Reasonable moving expenses (in moving himself, his family, and business...) Reasonable expenses in searching for a replacement business or farm; and (d) Reasonable expenses necessary to...

77 FR 77051 - Applications for New Awards; National Institute on Disability and Rehabilitation Research (NIDRR...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-31

... development of accessible information technology including cloud computing, software, systems, and devices... documents of the Department published in the Federal Register by using the article search feature at: www...

78 FR 57266 - Final Waiver and Extension of the Project Period for the Individuals With Disabilities Education...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-18

... affiliates need continued support to engage in meaningful dialogue, continual learning, and problem solving... Federal Register by using the article search feature at: www.federalregister.gov . Specifically, through...

Alternative Fuels Data Center: Propane Fueling Station Locations

Science.gov Websites

petroleum gas (propane) fueling stations near an address or ZIP code or along a route in the United States Location Map a Route Laws & Incentives Search Federal State Key Legislation Data & Tools Widgets

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

NASA Technical Reports Server (NTRS)

Sen, Syamal K.; AliShaykhian, Gholam

2010-01-01

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Trading a Problem-solving Task

NASA Astrophysics Data System (ADS)

Matsubara, Shigeo

This paper focuses on a task allocation problem, especially cases where the task is to find a solution in a search problem or a constraint satisfaction problem. If the search problem is hard to solve, a contractor may fail to find a solution. Here, the more computational resources such as the CPU time the contractor invests in solving the search problem, the more a solution is likely to be found. This brings about a new problem that a contractee has to find an appropriate level of the quality in a task achievement as well as to find an efficient allocation of a task among contractors. For example, if the contractee asks the contractor to find a solution with certainty, the payment from the contractee to the contractor may exceed the contractee's benefit from obtaining a solution, which discourages the contractee from trading a task. However, solving this problem is difficult because the contractee cannot ascertain the contractor's problem-solving ability such as the amount of available resources and knowledge (e.g. algorithms, heuristics) or monitor what amount of resources are actually invested in solving the allocated task. To solve this problem, we propose a task allocation mechanism that is able to choose an appropriate level of the quality in a task achievement and prove that this mechanism guarantees that each contractor reveals its true information. Moreover, we show that our mechanism can increase the contractee's utility compared with a simple auction mechanism by using computer simulation.

Dimensionality of Community Satisfaction.

ERIC Educational Resources Information Center

Williams, R. Gary; Knop, Edward

Using factor analysis (both principal factor solutions and rotated factor solutions) to search for underlying statistical commonality among 12 indicators of community satisfaction in 6 Colorado communities, the research explores various dimensions of community satisfaction that may be important across different communities. The communities under…

2015 ESGF Progress Report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Williams, D. N.

2015-06-22

The Earth System Grid Federation (ESGF) is a multi-agency, international collaboration whose purpose is to develop the software infrastructure needed to facilitate and empower the study of climate change on a global scale. ESGF’s architecture employs a system of geographically distributed peer nodes that are independently administered yet united by common federation protocols and application programming interfaces. The cornerstones of its interoperability are the peer-to-peer messaging, which is continuously exchanged among all nodes in the federation; a shared architecture for search and discovery; and a security infrastructure based on industry standards. ESGF integrates popular application engines available from the open-sourcemore » community with custom components (for data publishing, searching, user interface, security, and messaging) that were developed collaboratively by the team. The full ESGF infrastructure has now been adopted by multiple Earth science projects and allows access to petabytes of geophysical data, including the Coupled Model Intercomparison Project (CMIP)—output used by the Intergovernmental Panel on Climate Change assessment reports. ESGF is a successful example of integration of disparate open-source technologies into a cohesive functional system that serves the needs of the global climate science community.« less

TALE proteins search DNA using a rotationally decoupled mechanism.

PubMed

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

2016-10-01

Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins used extensively for gene editing. Despite recent progress, however, little is known about their sequence search mechanism. Here, we use single-molecule experiments to study TALE search along DNA. Our results show that TALEs utilize a rotationally decoupled mechanism for nonspecific search, despite remaining associated with DNA templates during the search process. Our results suggest that the protein helical structure enables TALEs to adopt a loosely wrapped conformation around DNA templates during nonspecific search, facilitating rapid one-dimensional (1D) diffusion under a range of solution conditions. Furthermore, this model is consistent with a previously reported two-state mechanism for TALE search that allows these proteins to overcome the search speed-stability paradox. Taken together, our results suggest that TALE search is unique among the broad class of sequence-specific DNA-binding proteins and supports efficient 1D search along DNA.

Semantic Clustering of Search Engine Results

PubMed Central

Soliman, Sara Saad; El-Sayed, Maged F.; Hassan, Yasser F.

2015-01-01

This paper presents a novel approach for search engine results clustering that relies on the semantics of the retrieved documents rather than the terms in those documents. The proposed approach takes into consideration both lexical and semantics similarities among documents and applies activation spreading technique in order to generate semantically meaningful clusters. This approach allows documents that are semantically similar to be clustered together rather than clustering documents based on similar terms. A prototype is implemented and several experiments are conducted to test the prospered solution. The result of the experiment confirmed that the proposed solution achieves remarkable results in terms of precision. PMID:26933673

A hybrid monkey search algorithm for clustering analysis.

PubMed

Chen, Xin; Zhou, Yongquan; Luo, Qifang

2014-01-01

Clustering is a popular data analysis and data mining technique. The k-means clustering algorithm is one of the most commonly used methods. However, it highly depends on the initial solution and is easy to fall into local optimum solution. In view of the disadvantages of the k-means method, this paper proposed a hybrid monkey algorithm based on search operator of artificial bee colony algorithm for clustering analysis and experiment on synthetic and real life datasets to show that the algorithm has a good performance than that of the basic monkey algorithm for clustering analysis.

LP-search and its use in analysis of the accuracy of control systems with acoustical models

NASA Technical Reports Server (NTRS)

Sergeyev, V. I.; Sobol, I. M.; Statnikov, R. B.; Statnikov, I. N.

1973-01-01

The LP-search is proposed as an analog of the Monte Carlo method for finding values in nonlinear statistical systems. It is concluded that: To attain the required accuracy in solution to the problem of control for a statistical system in the LP-search, a considerably smaller number of tests is required than in the Monte Carlo method. The LP-search allows the possibility of multiple repetitions of tests under identical conditions and observability of the output variables of the system.

DNA profiles, computer searches, and the Fourth Amendment.

PubMed

Kimel, Catherine W

2013-01-01

Pursuant to federal statutes and to laws in all fifty states, the United States government has assembled a database containing the DNA profiles of over eleven million citizens. Without judicial authorization, the government searches each of these profiles one-hundred thousand times every day, seeking to link database subjects to crimes they are not suspected of committing. Yet, courts and scholars that have addressed DNA databasing have focused their attention almost exclusively on the constitutionality of the government's seizure of the biological samples from which the profiles are generated. This Note fills a gap in the scholarship by examining the Fourth Amendment problems that arise when the government searches its vast DNA database. This Note argues that each attempt to match two DNA profiles constitutes a Fourth Amendment search because each attempted match infringes upon database subjects' expectations of privacy in their biological relationships and physical movements. The Note further argues that database searches are unreasonable as they are currently conducted, and it suggests an adaptation of computer-search procedures to remedy the constitutional deficiency.

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

PubMed

Wang, Chunlin; Lefkowitz, Elliot J

2004-10-28

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

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

PubMed Central

Wang, Chunlin; Lefkowitz, Elliot J

2004-01-01

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

Hybrid Differential Dynamic Programming with Stochastic Search

NASA Technical Reports Server (NTRS)

Aziz, Jonathan; Parker, Jeffrey; Englander, Jacob

2016-01-01

Differential dynamic programming (DDP) has been demonstrated as a viable approach to low-thrust trajectory optimization, namely with the recent success of NASAs Dawn mission. The Dawn trajectory was designed with the DDP-based Static Dynamic Optimal Control algorithm used in the Mystic software. Another recently developed method, Hybrid Differential Dynamic Programming (HDDP) is a variant of the standard DDP formulation that leverages both first-order and second-order state transition matrices in addition to nonlinear programming (NLP) techniques. Areas of improvement over standard DDP include constraint handling, convergence properties, continuous dynamics, and multi-phase capability. DDP is a gradient based method and will converge to a solution nearby an initial guess. In this study, monotonic basin hopping (MBH) is employed as a stochastic search method to overcome this limitation, by augmenting the HDDP algorithm for a wider search of the solution space.

Installation Restoration Program. Phase 1. Records Search: U. S. Air Force Reserve and Pennsylvania Air National Guard Facilities at Greater Pittsburgh Airport

DTIC Science & Technology

1984-12-01

coupled with the enactment of environmental legislation at the Federal, state, and local levels of government , has required action to be taken to... governing the disposal of hazardous waste is the Resource Conservation and Recovery Act (RCRA), as amended. Under Section 6003 of the Act, Federal agencies...disposal sites and make information available to requesting agencies. To assure compliance with these hazardous waste regulations, DoD issued Defense

76 FR 16399 - Combined Notice of Filings #2

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-23

... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission Combined Notice of Filings 2 Take notice that the Commission received the following qualifying facility filings: Docket Numbers: QF11-158-000. Applicants: Alcor Energy Solutions, LLC. Description: Form 556 of Alcor Energy Solutions, LLC. Filed Date: 02...

Resolving Past Liabilities for Future Reduction in Greenhouse Gases; Nuclear Energy and the Outstanding Federal Liability of Spent Nuclear Fuel

NASA Astrophysics Data System (ADS)

Donohue, Jay

This thesis will: (1) examine the current state of nuclear power in the U.S.; (2) provide a comparison of nuclear power to both existing alternative/renewable sources of energy as well as fossil fuels; (3) dissect Standard Contracts created pursuant to the National Waste Policy Act (NWPA), Congress' attempt to find a solution for Spent Nuclear Fuel (SNF), and the designation of Yucca Mountain as a repository; (4) the anticipated failure of Yucca Mountain; (5) explore WIPP as well as attempts to build a facility on Native American land in Utah; (6) examine reprocessing as a solution for SNF used by France and Japan; and, finally, (7) propose a solution to reduce GHG's by developing new nuclear energy plants with financial support from the U.S. government and a solution to build a storage facility for SNF through the sitting of a repository based on a "bottom-up" cooperative federalism approach.

Ontology Mappings to Improve Learning Resource Search

ERIC Educational Resources Information Center

Gasevic, Dragan; Hatala, Marek

2006-01-01

This paper proposes an ontology mapping-based framework that allows searching for learning resources using multiple ontologies. The present applications of ontologies in e-learning use various ontologies (eg, domain, curriculum, context), but they do not give a solution on how to interoperate e-learning systems based on different ontologies. The…

Arc-An OAI Service Provider for Digital Library Federation; Kepler-An OAI Data/Service Provider for the Individual; Information Objects and Rights Management: A Mediation-Based Approach to DRM Interoperability; Automated Name Authority Control and Enhanced Searching in the Levy Collection; Renardus Project Developments and the Wider Digital Library Context.

ERIC Educational Resources Information Center

Liu, Xiaoming; Maly, Kurt; Zubair, Mohammad; Nelson, Michael L.; Erickson, John S.; DiLauro, Tim; Choudhury, G. Sayeed; Patton, Mark; Warner, James W.; Brown, Elizabeth W.; Heery, Rachel; Carpenter, Leona; Day, Michael

2001-01-01

Includes five articles that discuss the OAI (Open Archive Initiative), an interface between data providers and service providers; information objects and digital rights management interoperability; digitizing library collections, including automated name authority control, metadata, and text searching engines; and building digital library services…

13 CFR 107.305 - Evaluation of license applicants.

Code of Federal Regulations, 2013 CFR

2013-01-01

..., any interviews with the applicant's management team, and the results of background investigations, public record searches, and other due diligence conducted by SBA and other Federal agencies. SBA's evaluation will consider factors including the following: (a) Management qualifications, including...

75 FR 25311 - Requested Administrative Waiver of the Coastwise Trade Laws

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-07

....m. and 5 p.m., E.T., Monday through Friday, except federal holidays. An electronic version of this..., Washington, U.S. Virgin Islands.'' Privacy Act Anyone is able to search the electronic form of all comments...

78 FR 22864 - Applications for New Awards; National Institute on Disability and Rehabilitation Research...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-17

... Cloud and Web Computing DRRP Projects program, CFDA Number 84.133A-8, must be submitted electronically... the Department published in the Federal Register by using the article search feature at: www...

77 FR 74662 - Federal Acquisition Regulation; Submission for OMB Review; Accident Prevention Plans and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-17

... Keyword or ID'' and selecting ``Search''. Select the link ``Submit a Comment'' that corresponds with... involves work of a long duration, or hazardous nature, the contracting officer shall insert the clause with...

Barriers and solutions to online learning in medical education - an integrative review.

PubMed

O'Doherty, Diane; Dromey, Marie; Lougheed, Justan; Hannigan, Ailish; Last, Jason; McGrath, Deirdre

2018-06-07

The aim of this study is to review the literature on known barriers and solutions that face educators when developing and implementing online learning programs for medical students and postgraduate trainees. An integrative review was conducted over a three-month period by an inter-institutional research team. The search included ScienceDirect, Scopus, BioMedical, PubMed, Medline (EBSCO & Ovid), ERIC, LISA, EBSCO, Google Scholar, ProQuest A&I, ProQuest UK & Ireland, UL Institutional Repository (IR), UCDIR and the All Aboard Report. Search terms included online learning, medical educators, development, barriers, solutions and digital literacy. The search was carried out by two reviewers. Titles and abstracts were screened independently and reviewed with inclusion/exclusion criteria. A consensus was drawn on which articles were included. Data appraisal was performed using the Critical Appraisal Skills Programme (CASP) Qualitative Research Checklist and NHMRC Appraisal Evidence Matrix. Data extraction was completed using the Cochrane Data Extraction Form and a modified extraction tool. Of the 3101 abstracts identified from the search, ten full-text papers met the inclusion criteria. Data extraction was completed on seven papers of high methodological quality and on three lower quality papers. Findings suggest that the key barriers which affect the development and implementation of online learning in medical education include time constraints, poor technical skills, inadequate infrastructure, absence of institutional strategies and support and negative attitudes of all involved. Solutions to these include improved educator skills, incentives and reward for the time involved with development and delivery of online content, improved institutional strategies and support and positive attitude amongst all those involved in the development and delivery of online content. This review has identified barriers and solutions amongst medical educators to the implementation of online learning in medical education. Results can be used to inform institutional and educator practice in the development of further online learning.

75 FR 47304 - Accessible Mobile Phone Options for People Who Are Blind, Deaf-Blind, or Have Low Vision

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-05

... FEDERAL COMMUNICATIONS COMMISSION [CG Docket No. 10-145; DA 10-1324] Accessible Mobile Phone Options for People Who Are Blind, Deaf- Blind, or Have Low Vision AGENCY: Federal Communications... wireless communication access by these populations; the cost and feasibility of technical solutions to...

Improving Federal Education Programs through an Integrated Performance and Benchmarking System.

ERIC Educational Resources Information Center

Department of Education, Washington, DC. Office of the Under Secretary.

This document highlights the problems with current federal education program data collection activities and lists several factors that make movement toward a possible solution, then discusses the vision for the Integrated Performance and Benchmarking System (IPBS), a vision of an Internet-based system for harvesting information from states about…

User Problems Associated with the Services of Federal and Quasi-Federal Technical Information Producing Agencies.

ERIC Educational Resources Information Center

Los Angeles Regional Technical Information Users Council, CA.

Nine reports of the Los Angeles Regional Technical Information Users Council, which identify and discuss user problem areas and recommend solutions, comprise this document. The topics of the reports are: (1) Air Force Technical Objective Document Release Program (AFTOD); (2) Army Qualitative Requirements Information Program (QDRI); (3)…

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

21 CFR 522.810 - Embutramide, chloroquine, and lidocaine solution.

Code of Federal Regulations, 2013 CFR

2013-04-01

... euthanasia. (3) Limitations. Not for use in animals intended for food. Federal law restricts this drug to use... SERVICES (CONTINUED) ANIMAL DRUGS, FEEDS, AND RELATED PRODUCTS IMPLANTATION OR INJECTABLE DOSAGE FORM NEW ANIMAL DRUGS § 522.810 Embutramide, chloroquine, and lidocaine solution. (a) Specifications. Each...

21 CFR 522.810 - Embutramide, chloroquine, and lidocaine solution.

Code of Federal Regulations, 2011 CFR

2011-04-01

... euthanasia. (3) Limitations. Not for use in animals intended for food. Federal law restricts this drug to use... SERVICES (CONTINUED) ANIMAL DRUGS, FEEDS, AND RELATED PRODUCTS IMPLANTATION OR INJECTABLE DOSAGE FORM NEW ANIMAL DRUGS § 522.810 Embutramide, chloroquine, and lidocaine solution. (a) Specifications. Each...

21 CFR 522.810 - Embutramide, chloroquine, and lidocaine solution.

Code of Federal Regulations, 2012 CFR

2012-04-01

... euthanasia. (3) Limitations. Not for use in animals intended for food. Federal law restricts this drug to use... SERVICES (CONTINUED) ANIMAL DRUGS, FEEDS, AND RELATED PRODUCTS IMPLANTATION OR INJECTABLE DOSAGE FORM NEW ANIMAL DRUGS § 522.810 Embutramide, chloroquine, and lidocaine solution. (a) Specifications. Each...

21 CFR 522.810 - Embutramide, chloroquine, and lidocaine solution.

Code of Federal Regulations, 2014 CFR

2014-04-01

... euthanasia. (3) Limitations. Not for use in animals intended for food. Federal law restricts this drug to use... SERVICES (CONTINUED) ANIMAL DRUGS, FEEDS, AND RELATED PRODUCTS IMPLANTATION OR INJECTABLE DOSAGE FORM NEW ANIMAL DRUGS § 522.810 Embutramide, chloroquine, and lidocaine solution. (a) Specifications. Each...

Optimal Spatial Design of Capacity and Quantity of Rainwater Catchment Systems for Urban Flood Mitigation

NASA Astrophysics Data System (ADS)

Huang, C.; Hsu, N.

2013-12-01

This study imports Low-Impact Development (LID) technology of rainwater catchment systems into a Storm-Water runoff Management Model (SWMM) to design the spatial capacity and quantity of rain barrel for urban flood mitigation. This study proposes a simulation-optimization model for effectively searching the optimal design. In simulation method, we design a series of regular spatial distributions of capacity and quantity of rainwater catchment facilities, and thus the reduced flooding circumstances using a variety of design forms could be simulated by SWMM. Moreover, we further calculate the net benefit that is equal to subtract facility cost from decreasing inundation loss and the best solution of simulation method would be the initial searching solution of the optimization model. In optimizing method, first we apply the outcome of simulation method and Back-Propagation Neural Network (BPNN) for developing a water level simulation model of urban drainage system in order to replace SWMM which the operating is based on a graphical user interface and is hard to combine with optimization model and method. After that we embed the BPNN-based simulation model into the developed optimization model which the objective function is minimizing the negative net benefit. Finally, we establish a tabu search-based algorithm to optimize the planning solution. This study applies the developed method in Zhonghe Dist., Taiwan. Results showed that application of tabu search and BPNN-based simulation model into the optimization model not only can find better solutions than simulation method in 12.75%, but also can resolve the limitations of previous studies. Furthermore, the optimized spatial rain barrel design can reduce 72% of inundation loss according to historical flood events.

A hybrid binary particle swarm optimization for large capacitated multi item multi level lot sizing (CMIMLLS) problem

NASA Astrophysics Data System (ADS)

Mishra, S. K.; Sahithi, V. V. D.; Rao, C. S. P.

2016-09-01

The lot sizing problem deals with finding optimal order quantities which minimizes the ordering and holding cost of product mix. when multiple items at multiple levels with all capacity restrictions are considered, the lot sizing problem become NP hard. Many heuristics were developed in the past have inevitably failed due to size, computational complexity and time. However the authors were successful in the development of PSO based technique namely iterative improvement binary particles swarm technique to address very large capacitated multi-item multi level lot sizing (CMIMLLS) problem. First binary particle Swarm Optimization algorithm is used to find a solution in a reasonable time and iterative improvement local search mechanism is employed to improvise the solution obtained by BPSO algorithm. This hybrid mechanism of using local search on the global solution is found to improve the quality of solutions with respect to time thus IIBPSO method is found best and show excellent results.

TemperSAT: A new efficient fair-sampling random k-SAT solver

NASA Astrophysics Data System (ADS)

Fang, Chao; Zhu, Zheng; Katzgraber, Helmut G.

The set membership problem is of great importance to many applications and, in particular, database searches for target groups. Recently, an approach to speed up set membership searches based on the NP-hard constraint-satisfaction problem (random k-SAT) has been developed. However, the bottleneck of the approach lies in finding the solution to a large SAT formula efficiently and, in particular, a large number of independent solutions is needed to reduce the probability of false positives. Unfortunately, traditional random k-SAT solvers such as WalkSAT are biased when seeking solutions to the Boolean formulas. By porting parallel tempering Monte Carlo to the sampling of binary optimization problems, we introduce a new algorithm (TemperSAT) whose performance is comparable to current state-of-the-art SAT solvers for large k with the added benefit that theoretically it can find many independent solutions quickly. We illustrate our results by comparing to the currently fastest implementation of WalkSAT, WalkSATlm.

Document Clustering Approach for Meta Search Engine

NASA Astrophysics Data System (ADS)

Kumar, Naresh, Dr.

2017-08-01

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

Adversarial search by evolutionary computation.

PubMed

Hong, T P; Huang, K Y; Lin, W Y

2001-01-01

In this paper, we consider the problem of finding good next moves in two-player games. Traditional search algorithms, such as minimax and alpha-beta pruning, suffer great temporal and spatial expansion when exploring deeply into search trees to find better next moves. The evolution of genetic algorithms with the ability to find global or near global optima in limited time seems promising, but they are inept at finding compound optima, such as the minimax in a game-search tree. We thus propose a new genetic algorithm-based approach that can find a good next move by reserving the board evaluation values of new offspring in a partial game-search tree. Experiments show that solution accuracy and search speed are greatly improved by our algorithm.

77 FR 31815 - Hazardous Materials Regulations: Combustible Liquids

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-30

... are: Safety (hazard communication and packaging integrity); International commerce (frustration/delay... exempt seasonal workers from the Federal Motor Carrier Safety Administration's Commercial Driver's...: Anyone is able to search the electronic form of any written communications and comments received into any...

77 FR 21766 - Access to Confidential Business Information by CGI Federal Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-11

... identification, pass through a metal detector, and sign the EPA visitor log. All visitor bags are processed through an X-ray machine and subject to search. Visitors will be provided an EPA/DC badge that must be...

Alternative Fuels Data Center: About the Laws and Incentives Data

Science.gov Websites

... Search Federal State Local Examples Summary Tables About the Laws and Incentives Data Download Data You final rules. Existing information is reviewed at the same time new information is added to ensure it is

Canada

ERIC Educational Resources Information Center

Lawson, Robert F.; Ghosh, Ratna

1986-01-01

Discusses Canada's problems in searching for a national identity and the controversy of the Federal policy of multiculturalism. Presents its objectives within a bilingual framework and the contradictions involved. Suggests a workable model involving assimilation conditioned by regional or local circumstances, useful also as a development strategy.…

BIOREMEDIATION IN THE FIELD SEARCH SYSTEM (BFSS) - USER DOCUMENTATION

EPA Science Inventory

The Bioremediation Field Initiative is a cooperative effort of the U.S. EPA's Office of Research and Development (ORD), Office of Solid Waste and Emergency Response (OSWER), and regional offices, and other federal agencies, state agencies, industry, and universities to ...

Helicopter winchmens' experiences with pain management in challenging environments.

PubMed

van der Velde, J; Linehan, L; Cusack, S

2013-02-01

We conducted a survey of Irish Coast Guard Search and Rescue Helicopter winchmen to establish if their pain management scope of practice was adequate for their working environment. We surveyed 17 SAR personnel. 88% of winchmen have experienced scenarios where they were unable to reduce pain scores below 6/10. In seeking solutions within current Irish Prehospital Clinical Practice Guidelines, repeated descriptions of operations in extreme weather and sea conditions were given which were entirely incompatible with the dexterity required to break a glass ampoule and draw up solution, let alone site an intravenous (IV) line or administer a drug via intramuscular (IM) injection. Irish Coast Guard Search and Rescue Helicopter winchmen encounter polytrauma patients in extreme pain in uniquely challenging environments. Novel solutions to pain management within this tightly governed system are urgently required.

Legionellosis on the Rise: A Review of Guidelines for Prevention in the United States

PubMed Central

Parr, Alyssa; Whitney, Ellen A.; Berkelman, Ruth L.

2015-01-01

Context: Reported cases of legionellosis more than tripled between 2001 and 2012 in the United States. The disease results primarily from exposure to aerosolized water contaminated with Legionella. Objective: To identify and describe policies and guidelines for the primary prevention of legionellosis in the US. Design: An Internet search for Legionella prevention guidelines in the United States at the federal and state levels was conducted from March to June 2012. Local government agency guidelines and guidelines from professional organizations that were identified in the initial search were also included. Setting: Federal, state, and local governing bodies and professional organizations. Results: Guidelines and regulations for the primary prevention of legionellosis (ie, Legionnaires' disease and Pontiac fever) have been developed by various public health and other government agencies at the federal, state, and local levels as well as by professional organizations. These guidelines are similar in recommending maintenance of building water systems; federal and other guidelines differ in the population/institutions targeted, the extent of technical detail, and support of monitoring water systems for levels of Legionella contamination. Conclusions: Legionellosis deserves a higher public health priority for research and policy development. Guidance across public health agencies for the primary prevention of legionellosis requires strengthening as this disease escalates in importance as a cause of severe morbidity and mortality. We recommend a formal and comprehensive review of national public health guidelines for prevention of legionellosis. PMID:25203696

B-tree search reinforcement learning for model based intelligent agent

NASA Astrophysics Data System (ADS)

Bhuvaneswari, S.; Vignashwaran, R.

2013-03-01

Agents trained by learning techniques provide a powerful approximation of active solutions for naive approaches. In this study using B - Trees implying reinforced learning the data search for information retrieval is moderated to achieve accuracy with minimum search time. The impact of variables and tactics applied in training are determined using reinforcement learning. Agents based on these techniques perform satisfactory baseline and act as finite agents based on the predetermined model against competitors from the course.

Literature Search through Mixed-Membership Community Discovery

NASA Astrophysics Data System (ADS)

Eliassi-Rad, Tina; Henderson, Keith

We introduce a new approach to literature search that is based on finding mixed-membership communities on an augmented co-authorship graph (ACA) with a scalable generative model. An ACA graph contains two types of edges: (1) coauthorship links and (2) links between researchers with substantial expertise overlap. Our solution eliminates the biases introduced by either looking at citations of a paper or doing a Web search. A case study on PubMed shows the benefits of our approach.

Topology search of 3-DOF translational parallel manipulators with three identical limbs for leg mechanisms

NASA Astrophysics Data System (ADS)

Wang, Mingfeng; Ceccarelli, Marco

2015-07-01

Three-degree of freedom(3-DOF) translational parallel manipulators(TPMs) have been widely studied both in industry and academia in the past decades. However, most architectures of 3-DOF TPMs are created mainly on designers' intuition, empirical knowledge, or associative reasoning and the topology synthesis researches of 3-DOF TPMs are still limited. In order to find out the atlas of designs for 3-DOF TPMs, a topology search is presented for enumeration of 3-DOF TPMs whose limbs can be modeled as 5-DOF serial chains. The proposed topology search of 3-DOF TPMs is aimed to overcome the sensitivities of the design solution of a 3-DOF TPM for a LARM leg mechanism in a biped robot. The topology search, which is based on the concept of generation and specialization in graph theory, is reported as a step-by-step procedure with desired specifications, principle and rules of generalization, design requirements and constraints, and algorithm of number synthesis. In order to obtain new feasible designs for a chosen example and to limit the search domain under general considerations, one topological generalized kinematic chain is chosen to be specialized. An atlas of new feasible designs is obtained and analyzed for a specific solution as leg mechanisms. The proposed methodology provides a topology search for 3-DOF TPMs for leg mechanisms, but it can be also expanded for other applications and tasks.

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

NASA Astrophysics Data System (ADS)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Fall with Linear Drag and Wien's Displacement Law: Approximate Solution and Lambert Function

ERIC Educational Resources Information Center

Vial, Alexandre

2012-01-01

We present an approximate solution for the downward time of travel in the case of a mass falling with a linear drag force. We show how a quasi-analytical solution implying the Lambert function can be found. We also show that solving the previous problem is equivalent to the search for Wien's displacement law. These results can be of interest for…