Enabling Near Real-Time Remote Search for Fast Transient Events with Lossy Data Compression

NASA Astrophysics Data System (ADS)

Vohl, Dany; Pritchard, Tyler; Andreoni, Igor; Cooke, Jeffrey; Meade, Bernard

2017-09-01

We present a systematic evaluation of JPEG2000 (ISO/IEC 15444) as a transport data format to enable rapid remote searches for fast transient events as part of the Deeper Wider Faster programme. Deeper Wider Faster programme uses 20 telescopes from radio to gamma rays to perform simultaneous and rapid-response follow-up searches for fast transient events on millisecond-to-hours timescales. Deeper Wider Faster programme search demands have a set of constraints that is becoming common amongst large collaborations. Here, we focus on the rapid optical data component of Deeper Wider Faster programme led by the Dark Energy Camera at Cerro Tololo Inter-American Observatory. Each Dark Energy Camera image has 70 total coupled-charged devices saved as a 1.2 gigabyte FITS file. Near real-time data processing and fast transient candidate identifications-in minutes for rapid follow-up triggers on other telescopes-requires computational power exceeding what is currently available on-site at Cerro Tololo Inter-American Observatory. In this context, data files need to be transmitted rapidly to a foreign location for supercomputing post-processing, source finding, visualisation and analysis. This step in the search process poses a major bottleneck, and reducing the data size helps accommodate faster data transmission. To maximise our gain in transfer time and still achieve our science goals, we opt for lossy data compression-keeping in mind that raw data is archived and can be evaluated at a later time. We evaluate how lossy JPEG2000 compression affects the process of finding transients, and find only a negligible effect for compression ratios up to 25:1. We also find a linear relation between compression ratio and the mean estimated data transmission speed-up factor. Adding highly customised compression and decompression steps to the science pipeline considerably reduces the transmission time-validating its introduction to the Deeper Wider Faster programme science pipeline and enabling science that was otherwise too difficult with current technology.

Exploring What’s Missing: What Do Target Absent Trials Reveal About Autism Search Superiority?

PubMed Central

Keehn, Brandon; Joseph, Robert M.

2016-01-01

We used eye-tracking to investigate the roles of enhanced discrimination and peripheral selection in superior visual search in autism spectrum disorder (ASD). Children with ASD were faster at visual search than their typically developing peers. However, group differences in performance and eye-movements did not vary with the level of difficulty of discrimination or selection. Rather, consistent with prior ASD research, group differences were mainly the effect of faster performance on target-absent trials. Eye-tracking revealed a lack of left-visual-field search asymmetry in ASD, which may confer an additional advantage when the target is absent. Lastly, ASD symptomatology was positively associated with search superiority, the mechanisms of which may shed light on the atypical brain organization that underlies social-communicative impairment in ASD. PMID:26762114

Studies on hand-held visual communication device for the deaf and speech-impaired 2. Keyboard design.

PubMed

Thurlow, W R

1980-01-01

Experiments with keyboard arrangements of letters show that simple alphabetic letter-key sequences with 4 to 5 letters in a row lead to most rapid visual search performance. Such arrangements can be used on keyboards operated by the index finger of one hand. Arrangement of letters in words offers a promising alternative because these arrangements can be readily memorized and can result in small interletter distances on the keyboard for frequently occurring letter sequences. Experiments on operation of keyboards show that a space or shift key operated by the left hand (which also holds the communication device) results in faster keyboard operation than when space or shift keys on the front of the keyboard (operated by right hand) are used. Special problems of the deaf-blind are discussed. Keyboard arrangements are investigated, and matching tactual codes are suggested.

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

PubMed

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

2012-12-01

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

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

NASA Technical Reports Server (NTRS)

Kenwright, David; Lane, David

1995-01-01

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Memetic algorithms for de novo motif-finding in biomedical sequences.

PubMed

Bi, Chengpeng

2012-09-01

The objectives of this study are to design and implement a new memetic algorithm for de novo motif discovery, which is then applied to detect important signals hidden in various biomedical molecular sequences. In this paper, memetic algorithms are developed and tested in de novo motif-finding problems. Several strategies in the algorithm design are employed that are to not only efficiently explore the multiple sequence local alignment space, but also effectively uncover the molecular signals. As a result, there are a number of key features in the implementation of the memetic motif-finding algorithm (MaMotif), including a chromosome replacement operator, a chromosome alteration-aware local search operator, a truncated local search strategy, and a stochastic operation of local search imposed on individual learning. To test the new algorithm, we compare MaMotif with a few of other similar algorithms using simulated and experimental data including genomic DNA, primary microRNA sequences (let-7 family), and transmembrane protein sequences. The new memetic motif-finding algorithm is successfully implemented in C++, and exhaustively tested with various simulated and real biological sequences. In the simulation, it shows that MaMotif is the most time-efficient algorithm compared with others, that is, it runs 2 times faster than the expectation maximization (EM) method and 16 times faster than the genetic algorithm-based EM hybrid. In both simulated and experimental testing, results show that the new algorithm is compared favorably or superior to other algorithms. Notably, MaMotif is able to successfully discover the transcription factors' binding sites in the chromatin immunoprecipitation followed by massively parallel sequencing (ChIP-Seq) data, correctly uncover the RNA splicing signals in gene expression, and precisely find the highly conserved helix motif in the transmembrane protein sequences, as well as rightly detect the palindromic segments in the primary microRNA sequences. The memetic motif-finding algorithm is effectively designed and implemented, and its applications demonstrate it is not only time-efficient, but also exhibits excellent performance while compared with other popular algorithms. Copyright © 2012 Elsevier B.V. All rights reserved.

Stable statistical representations facilitate visual search.

PubMed

Corbett, Jennifer E; Melcher, David

2014-10-01

Observers represent the average properties of object ensembles even when they cannot identify individual elements. To investigate the functional role of ensemble statistics, we examined how modulating statistical stability affects visual search. We varied the mean and/or individual sizes of an array of Gabor patches while observers searched for a tilted target. In "stable" blocks, the mean and/or local sizes of the Gabors were constant over successive displays, whereas in "unstable" baseline blocks they changed from trial to trial. Although there was no relationship between the context and the spatial location of the target, observers found targets faster (as indexed by faster correct responses and fewer saccades) as the global mean size became stable over several displays. Building statistical stability also facilitated scanning the scene, as measured by larger saccadic amplitudes, faster saccadic reaction times, and shorter fixation durations. These findings suggest a central role for peripheral visual information, creating context to free resources for detailed processing of salient targets and maintaining the illusion of visual stability.

Spatial partitions systematize visual search and enhance target memory.

PubMed

Solman, Grayden J F; Kingstone, Alan

2017-02-01

Humans are remarkably capable of finding desired objects in the world, despite the scale and complexity of naturalistic environments. Broadly, this ability is supported by an interplay between exploratory search and guidance from episodic memory for previously observed target locations. Here we examined how the environment itself may influence this interplay. In particular, we examined how partitions in the environment-like buildings, rooms, and furniture-can impact memory during repeated search. We report that the presence of partitions in a display, independent of item configuration, reliably improves episodic memory for item locations. Repeated search through partitioned displays was faster overall and was characterized by more rapid ballistic orienting in later repetitions. Explicit recall was also both faster and more accurate when displays were partitioned. Finally, we found that search paths were more regular and systematic when displays were partitioned. Given the ubiquity of partitions in real-world environments, these results provide important insights into the mechanisms of naturalistic search and its relation to memory.

Incidental Learning Speeds Visual Search by Lowering Response Thresholds, Not by Improving Efficiency: Evidence from Eye Movements

ERIC Educational Resources Information Center

Hout, Michael C.; Goldinger, Stephen D.

2012-01-01

When observers search for a target object, they incidentally learn the identities and locations of "background" objects in the same display. This learning can facilitate search performance, eliciting faster reaction times for repeated displays. Despite these findings, visual search has been successfully modeled using architectures that maintain no…

The Conceptual Grouping Effect: Categories Matter (and Named Categories Matter More)

ERIC Educational Resources Information Center

Lupyan, Gary

2008-01-01

Do conceptual categories affect basic visual processing? A conceptual grouping effect for familiar stimuli is reported using a visual search paradigm. Search through conceptually-homogeneous non-targets was faster and more efficient than search through conceptually-heterogeneous non-targets. This effect cannot be attributed to perceptual factors…

Changes in Search Path Complexity and Length During Learning of a Virtual Water Maze: Age Differences and Differential Associations with Hippocampal Subfield Volumes

PubMed Central

Daugherty, Ana M.; Bender, Andrew R.; Yuan, Peng; Raz, Naftali

2016-01-01

Impairment of hippocampus-dependent cognitive processes has been proposed to underlie age-related deficits in navigation. Animal studies suggest a differential role of hippocampal subfields in various aspects of navigation, but that hypothesis has not been tested in humans. In this study, we examined the association between volume of hippocampal subfields and age differences in virtual spatial navigation. In a sample of 65 healthy adults (age 19–75 years), advanced age was associated with a slower rate of improvement operationalized as shortening of the search path over 25 learning trials on a virtual Morris water maze task. The deficits were partially explained by greater complexity of older adults' search paths. Larger subiculum and entorhinal cortex volumes were associated with a faster decrease in search path complexity, which in turn explained faster shortening of search distance. Larger Cornu Ammonis (CA)1–2 volume was associated with faster distance shortening, but not in path complexity reduction. Age differences in regional volumes collectively accounted for 23% of the age-related variance in navigation learning. Independent of subfield volumes, advanced age was associated with poorer performance across all trials, even after reaching the asymptote. Thus, subiculum and CA1–2 volumes were associated with speed of acquisition, but not magnitude of gains in virtual maze navigation. PMID:25838036

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation

PubMed Central

2011-01-01

Background The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. Results A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Conclusions Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance. PMID:21631914

Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.

PubMed

Rognes, Torbjørn

2011-06-01

The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.

A Multistrategy Optimization Improved Artificial Bee Colony Algorithm

PubMed Central

Liu, Wen

2014-01-01

Being prone to the shortcomings of premature and slow convergence rate of artificial bee colony algorithm, an improved algorithm was proposed. Chaotic reverse learning strategies were used to initialize swarm in order to improve the global search ability of the algorithm and keep the diversity of the algorithm; the similarity degree of individuals of the population was used to characterize the diversity of population; population diversity measure was set as an indicator to dynamically and adaptively adjust the nectar position; the premature and local convergence were avoided effectively; dual population search mechanism was introduced to the search stage of algorithm; the parallel search of dual population considerably improved the convergence rate. Through simulation experiments of 10 standard testing functions and compared with other algorithms, the results showed that the improved algorithm had faster convergence rate and the capacity of jumping out of local optimum faster. PMID:24982924

FastBit Reference Manual

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

Wu, Kesheng

2007-08-02

An index in a database system is a data structure that utilizes redundant information about the base data to speed up common searching and retrieval operations. Most commonly used indexes are variants of B-trees, such as B+-tree and B*-tree. FastBit implements a set of alternative indexes call compressed bitmap indexes. Compared with B-tree variants, these indexes provide very efficient searching and retrieval operations by sacrificing the efficiency of updating the indexes after the modification of an individual record. In addition to the well-known strengths of bitmap indexes, FastBit has a special strength stemming from the bitmap compression scheme used. Themore » compression method is called the Word-Aligned Hybrid (WAH) code. It reduces the bitmap indexes to reasonable sizes and at the same time allows very efficient bitwise logical operations directly on the compressed bitmaps. Compared with the well-known compression methods such as LZ77 and Byte-aligned Bitmap code (BBC), WAH sacrifices some space efficiency for a significant improvement in operational efficiency. Since the bitwise logical operations are the most important operations needed to answer queries, using WAH compression has been shown to answer queries significantly faster than using other compression schemes. Theoretical analyses showed that WAH compressed bitmap indexes are optimal for one-dimensional range queries. Only the most efficient indexing schemes such as B+-tree and B*-tree have this optimality property. However, bitmap indexes are superior because they can efficiently answer multi-dimensional range queries by combining the answers to one-dimensional queries.« less

Explicit awareness supports conditional visual search in the retrieval guidance paradigm.

PubMed

Buttaccio, Daniel R; Lange, Nicholas D; Hahn, Sowon; Thomas, Rick P

2014-01-01

In four experiments we explored whether participants would be able to use probabilistic prompts to simplify perceptually demanding visual search in a task we call the retrieval guidance paradigm. On each trial a memory prompt appeared prior to (and during) the search task and the diagnosticity of the prompt(s) was manipulated to provide complete, partial, or non-diagnostic information regarding the target's color on each trial (Experiments 1-3). In Experiment 1 we found that the more diagnostic prompts was associated with faster visual search performance. However, similar visual search behavior was observed in Experiment 2 when the diagnosticity of the prompts was eliminated, suggesting that participants in Experiment 1 were merely relying on base rate information to guide search and were not utilizing the prompts. In Experiment 3 participants were informed of the relationship between the prompts and the color of the target and this was associated with faster search performance relative to Experiment 1, suggesting that the participants were using the prompts to guide search. Additionally, in Experiment 3 a knowledge test was implemented and performance in this task was associated with qualitative differences in search behavior such that participants that were able to name the color(s) most associated with the prompts were faster to find the target than participants who were unable to do so. However, in Experiments 1-3 diagnosticity of the memory prompt was manipulated via base rate information, making it possible that participants were merely relying on base rate information to inform search in Experiment 3. In Experiment 4 we manipulated diagnosticity of the prompts without manipulating base rate information and found a similar pattern of results as Experiment 3. Together, the results emphasize the importance of base rate and diagnosticity information in visual search behavior. In the General discussion section we explore how a recent computational model of hypothesis generation (HyGene; Thomas, Dougherty, Sprenger, & Harbison, 2008), linking attention with long-term and working memory, accounts for the present results and provides a useful framework of cued recall visual search. Copyright © 2013 Elsevier B.V. All rights reserved.

Changes in Search Path Complexity and Length During Learning of a Virtual Water Maze: Age Differences and Differential Associations with Hippocampal Subfield Volumes.

PubMed

Daugherty, Ana M; Bender, Andrew R; Yuan, Peng; Raz, Naftali

2016-06-01

Impairment of hippocampus-dependent cognitive processes has been proposed to underlie age-related deficits in navigation. Animal studies suggest a differential role of hippocampal subfields in various aspects of navigation, but that hypothesis has not been tested in humans. In this study, we examined the association between volume of hippocampal subfields and age differences in virtual spatial navigation. In a sample of 65 healthy adults (age 19-75 years), advanced age was associated with a slower rate of improvement operationalized as shortening of the search path over 25 learning trials on a virtual Morris water maze task. The deficits were partially explained by greater complexity of older adults' search paths. Larger subiculum and entorhinal cortex volumes were associated with a faster decrease in search path complexity, which in turn explained faster shortening of search distance. Larger Cornu Ammonis (CA)1-2 volume was associated with faster distance shortening, but not in path complexity reduction. Age differences in regional volumes collectively accounted for 23% of the age-related variance in navigation learning. Independent of subfield volumes, advanced age was associated with poorer performance across all trials, even after reaching the asymptote. Thus, subiculum and CA1-2 volumes were associated with speed of acquisition, but not magnitude of gains in virtual maze navigation. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Perceptual Grouping in Haptic Search: The Influence of Proximity, Similarity, and Good Continuation

ERIC Educational Resources Information Center

Overvliet, Krista E.; Krampe, Ralf Th.; Wagemans, Johan

2012-01-01

We conducted a haptic search experiment to investigate the influence of the Gestalt principles of proximity, similarity, and good continuation. We expected faster search when the distractors could be grouped. We chose edges at different orientations as stimuli because they are processed similarly in the haptic and visual modality. We therefore…

Exploring What's Missing: What Do Target Absent Trials Reveal about Autism Search Superiority?

ERIC Educational Resources Information Center

Keehn, Brandon; Joseph, Robert M.

2016-01-01

We used eye-tracking to investigate the roles of enhanced discrimination and peripheral selection in superior visual search in autism spectrum disorder (ASD). Children with ASD were faster at visual search than their typically developing peers. However, group differences in performance and eye-movements did not vary with the level of difficulty of…

Improved dichotomous search frequency offset estimator for burst-mode continuous phase modulation

NASA Astrophysics Data System (ADS)

Zhai, Wen-Chao; Li, Zan; Si, Jiang-Bo; Bai, Jun

2015-11-01

A data-aided technique for carrier frequency offset estimation with continuous phase modulation (CPM) in burst-mode transmission is presented. The proposed technique first exploits a special pilot sequence, or training sequence, to form a sinusoidal waveform. Then, an improved dichotomous search frequency offset estimator is introduced to determine the frequency offset using the sinusoid. Theoretical analysis and simulation results indicate that our estimator is noteworthy in the following aspects. First, the estimator can operate independently of timing recovery. Second, it has relatively low outlier, i.e., the minimum signal-to-noise ratio (SNR) required to guarantee estimation accuracy. Finally, the most important property is that our estimator is complexity-reduced compared to the existing dichotomous search methods: it eliminates the need for fast Fourier transform (FFT) and modulation removal, and exhibits faster convergence rate without accuracy degradation. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education, China (Grant No. 20110203110011), and the Programme of Introducing Talents of Discipline to Universities, China (Grant No. B08038).

Visual Search Performance in the Autism Spectrum II: The Radial Frequency Search Task with Additional Segmentation Cues

ERIC Educational Resources Information Center

Almeida, Renita A.; Dickinson, J. Edwin; Maybery, Murray T.; Badcock, Johanna C.; Badcock, David R.

2010-01-01

The Embedded Figures Test (EFT) requires detecting a shape within a complex background and individuals with autism or high Autism-spectrum Quotient (AQ) scores are faster and more accurate on this task than controls. This research aimed to uncover the visual processes producing this difference. Previously we developed a search task using radial…

SW#db: GPU-Accelerated Exact Sequence Similarity Database Search.

PubMed

Korpar, Matija; Šošić, Martin; Blažeka, Dino; Šikić, Mile

2015-01-01

In recent years we have witnessed a growth in sequencing yield, the number of samples sequenced, and as a result-the growth of publicly maintained sequence databases. The increase of data present all around has put high requirements on protein similarity search algorithms with two ever-opposite goals: how to keep the running times acceptable while maintaining a high-enough level of sensitivity. The most time consuming step of similarity search are the local alignments between query and database sequences. This step is usually performed using exact local alignment algorithms such as Smith-Waterman. Due to its quadratic time complexity, alignments of a query to the whole database are usually too slow. Therefore, the majority of the protein similarity search methods prior to doing the exact local alignment apply heuristics to reduce the number of possible candidate sequences in the database. However, there is still a need for the alignment of a query sequence to a reduced database. In this paper we present the SW#db tool and a library for fast exact similarity search. Although its running times, as a standalone tool, are comparable to the running times of BLAST, it is primarily intended to be used for exact local alignment phase in which the database of sequences has already been reduced. It uses both GPU and CPU parallelization and was 4-5 times faster than SSEARCH, 6-25 times faster than CUDASW++ and more than 20 times faster than SSW at the time of writing, using multiple queries on Swiss-prot and Uniref90 databases.

Real People Don't Do Boolean: How To Teach End Users To Find High-Quality Information on the Internet.

ERIC Educational Resources Information Center

Vine, Rita

2001-01-01

Explains how to train users in effective Web searching. Discusses challenges of teaching Web information retrieval; a framework for information searching; choosing the right search tools for users; the seven-step lesson planning process; tips for delivering group Internet training; and things that help people work faster and smarter on the Web.…

Reprint of "pFind-Alioth: A novel unrestricted database search algorithm to improve the interpretation of high-resolution MS/MS data".

PubMed

Chi, Hao; He, Kun; Yang, Bing; Chen, Zhen; Sun, Rui-Xiang; Fan, Sheng-Bo; Zhang, Kun; Liu, Chao; Yuan, Zuo-Fei; Wang, Quan-Hui; Liu, Si-Qi; Dong, Meng-Qiu; He, Si-Min

2015-11-03

Database search is the dominant approach in high-throughput proteomic analysis. However, the interpretation rate of MS/MS spectra is very low in such a restricted mode, which is mainly due to unexpected modifications and irregular digestion types. In this study, we developed a new algorithm called Alioth, to be integrated into the search engine of pFind, for fast and accurate unrestricted database search on high-resolution MS/MS data. An ion index is constructed for both peptide precursors and fragment ions, by which arbitrary digestions and a single site of any modifications and mutations can be searched efficiently. A new re-ranking algorithm is used to distinguish the correct peptide-spectrum matches from random ones. The algorithm is tested on several HCD datasets and the interpretation rate of MS/MS spectra using Alioth is as high as 60%-80%. Peptides from semi- and non-specific digestions, as well as those with unexpected modifications or mutations, can be effectively identified using Alioth and confidently validated using other search engines. The average processing speed of Alioth is 5-10 times faster than some other unrestricted search engines and is comparable to or even faster than the restricted search algorithms tested.This article is part of a Special Issue entitled: Computational Proteomics. Copyright © 2015 Elsevier B.V. All rights reserved.

PubMed vs. HighWire Press: a head-to-head comparison of two medical literature search engines.

PubMed

Vanhecke, Thomas E; Barnes, Michael A; Zimmerman, Janet; Shoichet, Sandor

2007-09-01

PubMed and HighWire Press are both useful medical literature search engines available for free to anyone on the internet. We measured retrieval accuracy, number of results generated, retrieval speed, features and search tools on HighWire Press and PubMed using the quick search features of each. We found that using HighWire Press resulted in a higher likelihood of retrieving the desired article and higher number of search results than the same search on PubMed. PubMed was faster than HighWire Press in delivering search results regardless of search settings. There are considerable differences in search features between these two search engines.

GPU-Acceleration of Sequence Homology Searches with Database Subsequence Clustering.

PubMed

Suzuki, Shuji; Kakuta, Masanori; Ishida, Takashi; Akiyama, Yutaka

2016-01-01

Sequence homology searches are used in various fields and require large amounts of computation time, especially for metagenomic analysis, owing to the large number of queries and the database size. To accelerate computing analyses, graphics processing units (GPUs) are widely used as a low-cost, high-performance computing platform. Therefore, we mapped the time-consuming steps involved in GHOSTZ, which is a state-of-the-art homology search algorithm for protein sequences, onto a GPU and implemented it as GHOSTZ-GPU. In addition, we optimized memory access for GPU calculations and for communication between the CPU and GPU. As per results of the evaluation test involving metagenomic data, GHOSTZ-GPU with 12 CPU threads and 1 GPU was approximately 3.0- to 4.1-fold faster than GHOSTZ with 12 CPU threads. Moreover, GHOSTZ-GPU with 12 CPU threads and 3 GPUs was approximately 5.8- to 7.7-fold faster than GHOSTZ with 12 CPU threads.

Context-Sensitive Grammar Transform: Compression and Pattern Matching

NASA Astrophysics Data System (ADS)

Maruyama, Shirou; Tanaka, Youhei; Sakamoto, Hiroshi; Takeda, Masayuki

A framework of context-sensitive grammar transform for speeding-up compressed pattern matching (CPM) is proposed. A greedy compression algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type compressed pattern matching algorithm. The compression ratio is a match for gzip and Re-Pair, and the search speed of our CPM algorithm is almost twice faster than the KMP-type CPM algorithm on Byte-Pair-Encoding by Shibata et al.[18], and in the case of short patterns, faster than the Boyer-Moore-Horspool algorithm with the stopper encoding by Rautio et al.[14], which is regarded as one of the best combinations that allows a practically fast search.

Going beyond Google for Faster and Smarter Web Searching

ERIC Educational Resources Information Center

Vine, Rita

2004-01-01

With more than 4 billion web pages in its database, Google is suitable for many different kinds of searches. When you know what you are looking for, Google can be a pretty good first choice, as long as you want to search a word pattern that can be expected to appear on any results pages. The problem starts when you don't know exactly what you're…

78 FR 39781 - Consequence Study of a Beyond-Design-Basis Earthquake Affecting the Spent Fuel Pool for a U.S...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-02

... Spent Fuel Pool Study). The purpose of this study was to examine if faster removal of older, colder... NRC Library at http://www.nrc.gov/reading-rm/adams.html . To begin the search, select ``ADAMS Public... of postulated spent fuel pool accidents. The purpose of this study is to examine if faster removal of...

Intelligent fuzzy approach for fast fractal image compression

NASA Astrophysics Data System (ADS)

Nodehi, Ali; Sulong, Ghazali; Al-Rodhaan, Mznah; Al-Dhelaan, Abdullah; Rehman, Amjad; Saba, Tanzila

2014-12-01

Fractal image compression (FIC) is recognized as a NP-hard problem, and it suffers from a high number of mean square error (MSE) computations. In this paper, a two-phase algorithm was proposed to reduce the MSE computation of FIC. In the first phase, based on edge property, range and domains are arranged. In the second one, imperialist competitive algorithm (ICA) is used according to the classified blocks. For maintaining the quality of the retrieved image and accelerating algorithm operation, we divided the solutions into two groups: developed countries and undeveloped countries. Simulations were carried out to evaluate the performance of the developed approach. Promising results thus achieved exhibit performance better than genetic algorithm (GA)-based and Full-search algorithms in terms of decreasing the number of MSE computations. The number of MSE computations was reduced by the proposed algorithm for 463 times faster compared to the Full-search algorithm, although the retrieved image quality did not have a considerable change.

Vehicle routing problem with time windows using natural inspired algorithms

NASA Astrophysics Data System (ADS)

Pratiwi, A. B.; Pratama, A.; Sa’diyah, I.; Suprajitno, H.

2018-03-01

Process of distribution of goods needs a strategy to make the total cost spent for operational activities minimized. But there are several constrains have to be satisfied which are the capacity of the vehicles and the service time of the customers. This Vehicle Routing Problem with Time Windows (VRPTW) gives complex constrains problem. This paper proposes natural inspired algorithms for dealing with constrains of VRPTW which involves Bat Algorithm and Cat Swarm Optimization. Bat Algorithm is being hybrid with Simulated Annealing, the worst solution of Bat Algorithm is replaced by the solution from Simulated Annealing. Algorithm which is based on behavior of cats, Cat Swarm Optimization, is improved using Crow Search Algorithm to make simplier and faster convergence. From the computational result, these algorithms give good performances in finding the minimized total distance. Higher number of population causes better computational performance. The improved Cat Swarm Optimization with Crow Search gives better performance than the hybridization of Bat Algorithm and Simulated Annealing in dealing with big data.

An Improved Quantum-Behaved Particle Swarm Optimization Algorithm with Elitist Breeding for Unconstrained Optimization.

PubMed

Yang, Zhen-Lun; Wu, Angus; Min, Hua-Qing

2015-01-01

An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm to escape from the likely local optima and guide the swarm to perform more efficient search. During the iterative optimization process of EB-QPSO, when criteria met, the personal best of each particle and the global best of the swarm are used to generate new diverse individuals through the transposon operators. The new generated individuals with better fitness are selected to be the new personal best particles and global best particle to guide the swarm for further solution exploration. A comprehensive simulation study is conducted on a set of twelve benchmark functions. Compared with five state-of-the-art quantum-behaved particle swarm optimization algorithms, the proposed EB-QPSO performs more competitively in all of the benchmark functions in terms of better global search capability and faster convergence rate.

RAPSearch: a fast protein similarity search tool for short reads

PubMed Central

2011-01-01

Background Next Generation Sequencing (NGS) is producing enormous corpuses of short DNA reads, affecting emerging fields like metagenomics. Protein similarity search--a key step to achieve annotation of protein-coding genes in these short reads, and identification of their biological functions--faces daunting challenges because of the very sizes of the short read datasets. Results We developed a fast protein similarity search tool RAPSearch that utilizes a reduced amino acid alphabet and suffix array to detect seeds of flexible length. For short reads (translated in 6 frames) we tested, RAPSearch achieved ~20-90 times speedup as compared to BLASTX. RAPSearch missed only a small fraction (~1.3-3.2%) of BLASTX similarity hits, but it also discovered additional homologous proteins (~0.3-2.1%) that BLASTX missed. By contrast, BLAT, a tool that is even slightly faster than RAPSearch, had significant loss of sensitivity as compared to RAPSearch and BLAST. Conclusions RAPSearch is implemented as open-source software and is accessible at http://omics.informatics.indiana.edu/mg/RAPSearch. It enables faster protein similarity search. The application of RAPSearch in metageomics has also been demonstrated. PMID:21575167

Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index.

PubMed

Pandey, Prashant; Almodaresi, Fatemeh; Bender, Michael A; Ferdman, Michael; Johnson, Rob; Patro, Rob

2018-06-18

Sequence-level searches on large collections of RNA sequencing experiments, such as the NCBI Sequence Read Archive (SRA), would enable one to ask many questions about the expression or variation of a given transcript in a population. Existing approaches, such as the sequence Bloom tree, suffer from fundamental limitations of the Bloom filter, resulting in slow build and query times, less-than-optimal space usage, and potentially large numbers of false-positives. This paper introduces Mantis, a space-efficient system that uses new data structures to index thousands of raw-read experiments and facilitates large-scale sequence searches. In our evaluation, index construction with Mantis is 6× faster and yields a 20% smaller index than the state-of-the-art split sequence Bloom tree (SSBT). For queries, Mantis is 6-108× faster than SSBT and has no false-positives or -negatives. For example, Mantis was able to search for all 200,400 known human transcripts in an index of 2,652 RNA sequencing experiments in 82 min; SSBT took close to 4 days. Copyright © 2018 Elsevier Inc. All rights reserved.

Effects of Symbol Brightness Cueing on Attention During a Visual Search of a Cockpit Display of Traffic Information

NASA Technical Reports Server (NTRS)

Johnson, Walter W.; Liao, Min-Ju; Granada, Stacie

2003-01-01

This study investigated visual search performance for target aircraft symbols on a Cockpit Display of Traffic Information (CDTI). Of primary interest was the influence of target brightness (intensity) and highlighting validity (search directions) on the ability to detect a target aircraft among distractor aircraft. Target aircraft were distinguished by an airspace course that conflicted with Ownship (that is, the participant's aircraft). The display could present all (homogeneous) bright aircraft, all (homogeneous) dim aircraft, or mixed bright and dim aircraft, with the target aircraft being either bright or dim. In the mixed intensity condition, participants may or may not have been instructed whether the target was bright or dim. Results indicated that highlighting validity facilitated better detection times. However, instead of bright targets being detected faster, dim targets were found to be detected more slowly in the mixed intensity display than in the homogeneous display. This relative slowness may be due to a delay in confirming the dim aircraft to be a target when it it was among brighter distractor aircraft. This hypothesis will be tested in future research. Funding for this work was provided by the Advanced Air Transportation Technologies Project of NASA's Airspace Operation Systems Program.

Visual search performance in the autism spectrum II: the radial frequency search task with additional segmentation cues.

PubMed

Almeida, Renita A; Dickinson, J Edwin; Maybery, Murray T; Badcock, Johanna C; Badcock, David R

2010-12-01

The Embedded Figures Test (EFT) requires detecting a shape within a complex background and individuals with autism or high Autism-spectrum Quotient (AQ) scores are faster and more accurate on this task than controls. This research aimed to uncover the visual processes producing this difference. Previously we developed a search task using radial frequency (RF) patterns with controllable amounts of target/distracter overlap on which high AQ participants showed more efficient search than low AQ observers. The current study extended the design of this search task by adding two lines which traverse the display on random paths sometimes intersecting target/distracters, other times passing between them. As with the EFT, these lines segment and group the display in ways that are task irrelevant. We tested two new groups of observers and found that while RF search was slowed by the addition of segmenting lines for both groups, the high AQ group retained a consistent search advantage (reflected in a shallower gradient for reaction time as a function of set size) over the low AQ group. Further, the high AQ group were significantly faster and more accurate on the EFT compared to the low AQ group. That is, the results from the present RF search task demonstrate that segmentation and grouping created by intersecting lines does not further differentiate the groups and is therefore unlikely to be a critical factor underlying the EFT performance difference. However, once again, we found that superior EFT performance was associated with shallower gradients on the RF search task. Copyright © 2010 Elsevier Ltd. All rights reserved.

The Analysis of Alpha Beta Pruning and MTD(f) Algorithm to Determine the Best Algorithm to be Implemented at Connect Four Prototype

NASA Astrophysics Data System (ADS)

Tommy, Lukas; Hardjianto, Mardi; Agani, Nazori

2017-04-01

Connect Four is a two-player game which the players take turns dropping discs into a grid to connect 4 of one’s own discs next to each other vertically, horizontally, or diagonally. At Connect Four, Computer requires artificial intelligence (AI) in order to play properly like human. There are many AI algorithms that can be implemented to Connect Four, but the suitable algorithms are unknown. The suitable algorithm means optimal in choosing move and its execution time is not slow at search depth which is deep enough. In this research, analysis and comparison between standard alpha beta (AB) Pruning and MTD(f) will be carried out at the prototype of Connect Four in terms of optimality (win percentage) and speed (execution time and the number of leaf nodes). Experiments are carried out by running computer versus computer mode with 12 different conditions, i.e. varied search depth (5 through 10) and who moves first. The percentage achieved by MTD(f) based on experiments is win 45,83%, lose 37,5% and draw 16,67%. In the experiments with search depth 8, MTD(f) execution time is 35, 19% faster and evaluate 56,27% fewer leaf nodes than AB Pruning. The results of this research are MTD(f) is as optimal as AB Pruning at Connect Four prototype, but MTD(f) on average is faster and evaluates fewer leaf nodes than AB Pruning. The execution time of MTD(f) is not slow and much faster than AB Pruning at search depth which is deep enough.

Detection of Emotional Faces: Salient Physical Features Guide Effective Visual Search

ERIC Educational Resources Information Center

Calvo, Manuel G.; Nummenmaa, Lauri

2008-01-01

In this study, the authors investigated how salient visual features capture attention and facilitate detection of emotional facial expressions. In a visual search task, a target emotional face (happy, disgusted, fearful, angry, sad, or surprised) was presented in an array of neutral faces. Faster detection of happy and, to a lesser extent,…

Is contextual cueing more than the guidance of visual-spatial attention?

PubMed

Schankin, Andrea; Hagemann, Dirk; Schubö, Anna

2011-04-01

When search displays are repeatedly presented, participants become faster in finding the target (contextual cueing, CC). It has been debated whether a more liberal response criterion might contribute to CC. In the current experiment, participants had to search through target-absent and target-present trials to compute d-prime as the measurement of sensitivity and beta as the measurement of response bias. Results showed that participants' sensitivity was not affected by the repetition of search displays. Although repeated displays led to both faster RTs and a more liberal response criterion, these effects were uncorrelated. In the event-related potential, RT effects were reflected by a late positive activity, which reflects response-related processes, but not by differences in the N2pc as electrophysiological correlate of focused attention. These results indicate that a more liberal response criterion is not the cause for CC effects in RTs but that other response-related processes might still contribute to the effect. Copyright © 2011 Elsevier B.V. All rights reserved.

GPU-Acceleration of Sequence Homology Searches with Database Subsequence Clustering

PubMed Central

Suzuki, Shuji; Kakuta, Masanori; Ishida, Takashi; Akiyama, Yutaka

2016-01-01

Sequence homology searches are used in various fields and require large amounts of computation time, especially for metagenomic analysis, owing to the large number of queries and the database size. To accelerate computing analyses, graphics processing units (GPUs) are widely used as a low-cost, high-performance computing platform. Therefore, we mapped the time-consuming steps involved in GHOSTZ, which is a state-of-the-art homology search algorithm for protein sequences, onto a GPU and implemented it as GHOSTZ-GPU. In addition, we optimized memory access for GPU calculations and for communication between the CPU and GPU. As per results of the evaluation test involving metagenomic data, GHOSTZ-GPU with 12 CPU threads and 1 GPU was approximately 3.0- to 4.1-fold faster than GHOSTZ with 12 CPU threads. Moreover, GHOSTZ-GPU with 12 CPU threads and 3 GPUs was approximately 5.8- to 7.7-fold faster than GHOSTZ with 12 CPU threads. PMID:27482905

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

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

Azad, Ariful; Buluc, Aydn; Pothen, Alex

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

DOE PAGES

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-03-24

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Optimization with artificial neural network systems - A mapping principle and a comparison to gradient based methods

NASA Technical Reports Server (NTRS)

Leong, Harrison Monfook

1988-01-01

General formulae for mapping optimization problems into systems of ordinary differential equations associated with artificial neural networks are presented. A comparison is made to optimization using gradient-search methods. The performance measure is the settling time from an initial state to a target state. A simple analytical example illustrates a situation where dynamical systems representing artificial neural network methods would settle faster than those representing gradient-search. Settling time was investigated for a more complicated optimization problem using computer simulations. The problem was a simplified version of a problem in medical imaging: determining loci of cerebral activity from electromagnetic measurements at the scalp. The simulations showed that gradient based systems typically settled 50 to 100 times faster than systems based on current neural network optimization methods.

Mitigating Exertional Heat Illness in Military Personnel: The Science Behind a Rice-Based Electrolyte and Rehydration Drink.

PubMed

Moore, Brenda; O'Hara, Reginald

Exertional heat illness continues to be prevalent among members of active duty personnel, especially those in specific military occupational specialties such as loadmasters, flight crew, flight maintainers, and Special Operations Forces. Therefore, the primary objective of this article was to elucidate the various oral rehydration solutions (ORSs) on the market that are used to mitigate exertional heat illness (EHI) in military personnel, and to focus on the science behind a ricebased electrolyte drink, CeraSport®, currently used by US military personnel in mitigating EHI during sustained training operations in high-heat environments. A search of the literature (through March 2016) was performed using PubMed and ProQuest, in addition to searching bibliographies and text books. We reviewed 63 articles and three texts. Articles were limited to those published in English and to studies that used only carbohydrates (e.g., no amino acids) and drinks reported to be used by the military in field training and deployment. Heat illness is prevalent among military personnel operating in high-heat environments and a variety of ORSs and sports drinks are available to help mitigate this. However, CeraSport, compared with other ORSs and sports drinks, may offer benefits such as faster gastric emptying rates and improved absorption from the gastrointestinal tract, which can provide rapidly available carbohydrate substrates for energy needs, and increased water retention for maintenance of blood plasma volume. 2016.

Quantum partial search for uneven distribution of multiple target items

NASA Astrophysics Data System (ADS)

Zhang, Kun; Korepin, Vladimir

2018-06-01

Quantum partial search algorithm is an approximate search. It aims to find a target block (which has the target items). It runs a little faster than full Grover search. In this paper, we consider quantum partial search algorithm for multiple target items unevenly distributed in a database (target blocks have different number of target items). The algorithm we describe can locate one of the target blocks. Efficiency of the algorithm is measured by number of queries to the oracle. We optimize the algorithm in order to improve efficiency. By perturbation method, we find that the algorithm runs the fastest when target items are evenly distributed in database.

Real-world visual search is dominated by top-down guidance.

PubMed

Chen, Xin; Zelinsky, Gregory J

2006-11-01

How do bottom-up and top-down guidance signals combine to guide search behavior? Observers searched for a target either with or without a preview (top-down manipulation) or a color singleton (bottom-up manipulation) among the display objects. With a preview, reaction times were faster and more initial eye movements were guided to the target; the singleton failed to attract initial saccades under these conditions. Only in the absence of a preview did subjects preferentially fixate the color singleton. We conclude that the search for realistic objects is guided primarily by top-down control. Implications for saliency map models of visual search are discussed.

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…

Perceptual Grouping, Not Emotion, Accounts for Search Asymmetries with Schematic Faces

ERIC Educational Resources Information Center

Becker, Stefanie I.; Horstmann, Gernot; Remington, Roger W.

2011-01-01

Several different explanations have been proposed to account for the search asymmetry (SA) for angry schematic faces (i.e., the fact that an angry face target among friendly faces can be found faster than vice versa). The present study critically tested the perceptual grouping account, (a) that the SA is not due to emotional factors, but to…

Beneficial Effects of Pre-operative Exercise Therapy in Patients with an Abdominal Aortic Aneurysm: A Systematic Review.

PubMed

Pouwels, S; Willigendael, E M; van Sambeek, M R H M; Nienhuijs, S W; Cuypers, P W M; Teijink, J A W

2015-01-01

The impact of post-operative complications in abdominal aortic aneurysm (AAA) surgery is substantial, and increases with age and concomitant co-morbidities. This systematic review focuses on the possible effects of pre-operative exercise therapy (PET) in patients with AAA on post-operative complications,aerobic capacity, physical fitness, and recovery. A systematic search on PET prior to AAA surgery was conducted. The methodological quality of the included studies was rated using the Physiotherapy Evidence Database scale. The agreement between the reviewers was assessed with Cohen's kappa. Five studies were included, with a methodological quality ranging from moderate to good. Cohen's kappa was 0.79. Three studies focused on patients with an AAA (without indication for surgical repair) with physical fitness as the outcome measure. One study focused on PET in patients awaiting AAA surgery and one study focused on the effects of PET on post-operative complications, length of stay, and recovery. PET has beneficial effects on various physical fitness variables of patients with an AAA. Whether this leads to less complications or faster recovery remains unclear. In view of the large impact of post-operative complications, it is valuable to explore the possible benefits of a PET program in AAA surgery.

Fluorescence-spectrometer helps Mobil increase analytical output by 50%

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

Hamm, J.C.; Peckham, M.R.; Powers, J.

1987-09-01

A wide range of gear-oil packages and synthetic oil bases for motor vehicle use are produced at Mobil Chemical Company's Beaumont, TX, Chemical Specialties Plant (BCSP). Also manufactured are industrial lubricants, hydraulic fluids, and a selection of specialty oils. For a number of years, Mobil used what at that time represented up-to-date X-ray fluorescence technology for analyzing its oil products. Mobil decided to search for a more efficient X-ray fluorescence spectrometer for oil analyses that would provide a number of major features such a high speed, accuracy and reproducibility, appropriate software for matrix correction, a helium atmosphere for determining lightmore » elements in liquids, and the ability to determine both high and low (ppm level) concentrations quantitatively. In the spring of 1985, Mobil installed new X-ray fluorescence equipment that gives much faster analysis of liquid samples, greater analytical sensitivity, and a much more stable system. In addition, the unit produces calibration curves, retains reference-standards data in memory, and gives numerical or graphical readouts which directly show deviations from the specified levels of Cl, S, and P components for each sample, analyzed sequentially or simultaneously. The spectrometer combines the speed and high throughput of multichannel spectrometers along with the high flexibility of sequential goniometers. The hybrid configuration incorporates a versatile goniometer with as many as 10 monochromators and operates under computer control. All benefits of the modern equipment have given Mobil better product quality, faster production approvals, and greater overall operational economics.« less

Pharmer: efficient and exact pharmacophore search.

PubMed

Koes, David Ryan; Camacho, Carlos J

2011-06-27

Pharmacophore search is a key component of many drug discovery efforts. Pharmer is a new computational approach to pharmacophore search that scales with the breadth and complexity of the query, not the size of the compound library being screened. Two novel methods for organizing pharmacophore data, the Pharmer KDB-tree and Bloom fingerprints, enable Pharmer to perform an exact pharmacophore search of almost two million structures in less than a minute. In general, Pharmer is more than an order of magnitude faster than existing technologies. The complete source code is available under an open-source license at http://pharmer.sourceforge.net .

SL12-GADRAS-PD2Ka Annual Report

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

Mitchell, Dean J.

2014-09-09

The GADRAS Development project comprises several elements that are all related to the Detector Response Function (DRF), which is the core of GADRAS. An ongoing activity is implementing continuous improvements in the accuracy and versatility of the DRF. The ability to perform rapid computation of the response of gammaray detectors for 3-D descriptions of source objects and their environments is a good example of a recent utilization of this versatility. The 3-D calculations, which execute several orders of magnitude faster than competing techniques, compute the response as an extension of the DRF so the radiation transport problem is never solvedmore » explicitly, thus saving considerable computational time. Maintenance of the Graphic User Interface (GUI) and extension of the GUI to enable construction of the 3-D source models is included in tasking for the GADRAS Development project. Another aspect of this project is application of the isotope identification algorithms for search applications. Specifically, SNL is tasked with development of an isotope-identification based search capability for use with the RSL-developed AVID system, which supports simultaneous operation of numerous radiation search assets. A Publically Available (PA) GADRAS-DRF application, which eliminates sensitive analysis components, will soon be available so that the DRF can be used by researchers at universities and corporations.« less

Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching.

PubMed

Navarro, Gonzalo; Raffinot, Mathieu

2003-01-01

The problem of fast exact and approximate searching for a pattern that contains classes of characters and bounded size gaps (CBG) in a text has a wide range of applications, among which a very important one is protein pattern matching (for instance, one PROSITE protein site is associated with the CBG [RK] - x(2,3) - [DE] - x(2,3) - Y, where the brackets match any of the letters inside, and x(2,3) a gap of length between 2 and 3). Currently, the only way to search for a CBG in a text is to convert it into a full regular expression (RE). However, a RE is more sophisticated than a CBG, and searching for it with a RE pattern matching algorithm complicates the search and makes it slow. This is the reason why we design in this article two new practical CBG matching algorithms that are much simpler and faster than all the RE search techniques. The first one looks exactly once at each text character. The second one does not need to consider all the text characters, and hence it is usually faster than the first one, but in bad cases may have to read the same text character more than once. We then propose a criterion based on the form of the CBG to choose a priori the fastest between both. We also show how to search permitting a few mistakes in the occurrences. We performed many practical experiments using the PROSITE database, and all of them show that our algorithms are the fastest in virtually all cases.

Digital Versus Conventional Impressions in Fixed Prosthodontics: A Review.

PubMed

Ahlholm, Pekka; Sipilä, Kirsi; Vallittu, Pekka; Jakonen, Minna; Kotiranta, Ulla

2018-01-01

To conduct a systematic review to evaluate the evidence of possible benefits and accuracy of digital impression techniques vs. conventional impression techniques. Reports of digital impression techniques versus conventional impression techniques were systematically searched for in the following databases: Cochrane Central Register of Controlled Trials, PubMed, and Web of Science. A combination of controlled vocabulary, free-text words, and well-defined inclusion and exclusion criteria guided the search. Digital impression accuracy is at the same level as conventional impression methods in fabrication of crowns and short fixed dental prostheses (FDPs). For fabrication of implant-supported crowns and FDPs, digital impression accuracy is clinically acceptable. In full-arch impressions, conventional impression methods resulted in better accuracy compared to digital impressions. Digital impression techniques are a clinically acceptable alternative to conventional impression methods in fabrication of crowns and short FDPs. For fabrication of implant-supported crowns and FDPs, digital impression systems also result in clinically acceptable fit. Digital impression techniques are faster and can shorten the operation time. Based on this study, the conventional impression technique is still recommended for full-arch impressions. © 2016 by the American College of Prosthodontists.

Object tracking with robotic total stations: Current technologies and improvements based on image data

NASA Astrophysics Data System (ADS)

Ehrhart, Matthias; Lienhart, Werner

2017-09-01

The importance of automated prism tracking is increasingly triggered by the rising automation of total station measurements in machine control, monitoring and one-person operation. In this article we summarize and explain the different techniques that are used to coarsely search a prism, to precisely aim at a prism, and to identify whether the correct prism is tracked. Along with the state-of-the-art review, we discuss and experimentally evaluate possible improvements based on the image data of an additional wide-angle camera which is available for many total stations today. In cases in which the total station's fine aiming module loses the prism, the tracked object may still be visible to the wide-angle camera because of its larger field of view. The theodolite angles towards the target can then be derived from its image coordinates which facilitates a fast reacquisition of the prism. In experimental measurements we demonstrate that our image-based approach for the coarse target search is 4 to 10-times faster than conventional approaches.

Benchmarking database performance for genomic data.

PubMed

Khushi, Matloob

2015-06-01

Genomic regions represent features such as gene annotations, transcription factor binding sites and epigenetic modifications. Performing various genomic operations such as identifying overlapping/non-overlapping regions or nearest gene annotations are common research needs. The data can be saved in a database system for easy management, however, there is no comprehensive database built-in algorithm at present to identify overlapping regions. Therefore I have developed a novel region-mapping (RegMap) SQL-based algorithm to perform genomic operations and have benchmarked the performance of different databases. Benchmarking identified that PostgreSQL extracts overlapping regions much faster than MySQL. Insertion and data uploads in PostgreSQL were also better, although general searching capability of both databases was almost equivalent. In addition, using the algorithm pair-wise, overlaps of >1000 datasets of transcription factor binding sites and histone marks, collected from previous publications, were reported and it was found that HNF4G significantly co-locates with cohesin subunit STAG1 (SA1).Inc. © 2015 Wiley Periodicals, Inc.

Sequence-based heuristics for faster annotation of non-coding RNA families.

PubMed

Weinberg, Zasha; Ruzzo, Walter L

2006-01-01

Non-coding RNAs (ncRNAs) are functional RNA molecules that do not code for proteins. Covariance Models (CMs) are a useful statistical tool to find new members of an ncRNA gene family in a large genome database, using both sequence and, importantly, RNA secondary structure information. Unfortunately, CM searches are extremely slow. Previously, we created rigorous filters, which provably sacrifice none of a CM's accuracy, while making searches significantly faster for virtually all ncRNA families. However, these rigorous filters make searches slower than heuristics could be. In this paper we introduce profile HMM-based heuristic filters. We show that their accuracy is usually superior to heuristics based on BLAST. Moreover, we compared our heuristics with those used in tRNAscan-SE, whose heuristics incorporate a significant amount of work specific to tRNAs, where our heuristics are generic to any ncRNA. Performance was roughly comparable, so we expect that our heuristics provide a high-quality solution that--unlike family-specific solutions--can scale to hundreds of ncRNA families. The source code is available under GNU Public License at the supplementary web site.

The politics of the face-in-the-crowd.

PubMed

Mills, Mark; Smith, Kevin B; Hibbing, John R; Dodd, Michael D

2014-06-01

Recent work indicates that the more conservative one is, the faster one is to fixate on negative stimuli, whereas the less conservative one is, the faster one is to fixate on positive stimuli. The present series of experiments used the face-in-the-crowd paradigm to examine whether variability in the efficiency with which positive and negative stimuli are detected underlies such speed differences. Participants searched for a discrepant facial expression (happy or angry) amid a varying number of neutral distractors (Experiments 1 and 4). A combination of response time and eye movement analyses indicated that variability in search efficiency explained speed differences for happy expressions, whereas variability in post-selectional processes explained speed differences for angry expressions. These results appear to be emotionally mediated as search performance did not vary with political temperament when displays were inverted (Experiment 2) or when controlled processing was required for successful task performance (Experiment 3). Taken together, the present results suggest political temperament is at least partially instantiated by attentional biases for emotional material. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments.

PubMed

Daily, Jeff

2016-02-10

Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. A faster intra-sequence local pairwise alignment implementation is described and benchmarked, including new global and semi-global variants. Using a 375 residue query sequence a speed of 136 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon E5-2670 24-core processor system, the highest reported for an implementation based on Farrar's 'striped' approach. Rognes's SWIPE optimal database search application is still generally the fastest available at 1.2 to at best 2.4 times faster than Parasail for sequences shorter than 500 amino acids. However, Parasail was faster for longer sequences. For global alignments, Parasail's prefix scan implementation is generally the fastest, faster even than Farrar's 'striped' approach, however the opal library is faster for single-threaded applications. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. Applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.

Sequence search on a supercomputer.

PubMed

Gotoh, O; Tagashira, Y

1986-01-10

A set of programs was developed for searching nucleic acid and protein sequence data bases for sequences similar to a given sequence. The programs, written in FORTRAN 77, were optimized for vector processing on a Hitachi S810-20 supercomputer. A search of a 500-residue protein sequence against the entire PIR data base Ver. 1.0 (1) (0.5 M residues) is carried out in a CPU time of 45 sec. About 4 min is required for an exhaustive search of a 1500-base nucleotide sequence against all mammalian sequences (1.2M bases) in Genbank Ver. 29.0. The CPU time is reduced to about a quarter with a faster version.

GRATEFUL MED

EPA Science Inventory

Since the early 1970s, the National Library of Medicine (NLM) has made searching the biomedical literature faster and easier by providing online information on NLMs family of databases -- (currently 40 online databases). MEDLINE?, NLMs premier database, has over 8.5 million citat...

GIGGLE: a search engine for large-scale integrated genome analysis.

PubMed

Layer, Ryan M; Pedersen, Brent S; DiSera, Tonya; Marth, Gabor T; Gertz, Jason; Quinlan, Aaron R

2018-02-01

GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (https://github.com/ryanlayer/giggle) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation.

Tachyon search speeds up retrieval of similar sequences by several orders of magnitude.

PubMed

Tan, Joshua; Kuchibhatla, Durga; Sirota, Fernanda L; Sherman, Westley A; Gattermayer, Tobias; Kwoh, Chia Yee; Eisenhaber, Frank; Schneider, Georg; Maurer-Stroh, Sebastian

2012-06-15

The usage of current sequence search tools becomes increasingly slower as databases of protein sequences continue to grow exponentially. Tachyon, a new algorithm that identifies closely related protein sequences ~200 times faster than standard BLAST, circumvents this limitation with a reduced database and oligopeptide matching heuristic. The tool is publicly accessible as a webserver at http://tachyon.bii.a-star.edu.sg and can also be accessed programmatically through SOAP.

GIGGLE: a search engine for large-scale integrated genome analysis

PubMed Central

Layer, Ryan M; Pedersen, Brent S; DiSera, Tonya; Marth, Gabor T; Gertz, Jason; Quinlan, Aaron R

2018-01-01

GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (https://github.com/ryanlayer/giggle) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation. PMID:29309061

Increasing Navigation Speed at Endoluminal CT Colonography Reduces Colonic Visualization and Polyp Identification.

PubMed

Plumb, Andrew A; Phillips, Peter; Spence, Graeme; Mallett, Susan; Taylor, Stuart A; Halligan, Steve; Fanshawe, Thomas

2017-08-01

Purpose To investigate the effect of increasing navigation speed on the visual search and decision making during polyp identification for computed tomography (CT) colonography Materials and Methods Institutional review board permission was obtained to use deidentified CT colonography data for this prospective reader study. After obtaining informed consent from the readers, 12 CT colonography fly-through examinations that depicted eight polyps were presented at four different fixed navigation speeds to 23 radiologists. Speeds ranged from 1 cm/sec to 4.5 cm/sec. Gaze position was tracked by using an infrared eye tracker, and readers indicated that they saw a polyp by clicking a mouse. Patterns of searching and decision making by speed were investigated graphically and by multilevel modeling. Results Readers identified polyps correctly in 56 of 77 (72.7%) of viewings at the slowest speed but in only 137 of 225 (60.9%) of viewings at the fastest speed (P = .004). They also identified fewer false-positive features at faster speeds (42 of 115; 36.5%) of videos at slowest speed, 89 of 345 (25.8%) at fastest, P = .02). Gaze location was highly concentrated toward the central quarter of the screen area at faster speeds (mean gaze points at slowest speed vs fastest speed, 86% vs 97%, respectively). Conclusion Faster navigation speed at endoluminal CT colonography led to progressive restriction of visual search patterns. Greater speed also reduced both true-positive and false-positive colorectal polyp identification. © RSNA, 2017 Online supplemental material is available for this article.

Iterative integral parameter identification of a respiratory mechanics model.

PubMed

Schranz, Christoph; Docherty, Paul D; Chiew, Yeong Shiong; Möller, Knut; Chase, J Geoffrey

2012-07-18

Patient-specific respiratory mechanics models can support the evaluation of optimal lung protective ventilator settings during ventilation therapy. Clinical application requires that the individual's model parameter values must be identified with information available at the bedside. Multiple linear regression or gradient-based parameter identification methods are highly sensitive to noise and initial parameter estimates. Thus, they are difficult to apply at the bedside to support therapeutic decisions. An iterative integral parameter identification method is applied to a second order respiratory mechanics model. The method is compared to the commonly used regression methods and error-mapping approaches using simulated and clinical data. The clinical potential of the method was evaluated on data from 13 Acute Respiratory Distress Syndrome (ARDS) patients. The iterative integral method converged to error minima 350 times faster than the Simplex Search Method using simulation data sets and 50 times faster using clinical data sets. Established regression methods reported erroneous results due to sensitivity to noise. In contrast, the iterative integral method was effective independent of initial parameter estimations, and converged successfully in each case tested. These investigations reveal that the iterative integral method is beneficial with respect to computing time, operator independence and robustness, and thus applicable at the bedside for this clinical application.

Object based implicit contextual learning: a study of eye movements.

PubMed

van Asselen, Marieke; Sampaio, Joana; Pina, Ana; Castelo-Branco, Miguel

2011-02-01

Implicit contextual cueing refers to a top-down mechanism in which visual search is facilitated by learned contextual features. In the current study we aimed to investigate the mechanism underlying implicit contextual learning using object information as a contextual cue. Therefore, we measured eye movements during an object-based contextual cueing task. We demonstrated that visual search is facilitated by repeated object information and that this reduction in response times is associated with shorter fixation durations. This indicates that by memorizing associations between objects in our environment we can recognize objects faster, thereby facilitating visual search.

Faster quantum walk search on a weighted graph

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2015-09-01

A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ (N3 /4) . We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ (√{N }) . To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

Autonomously Generating Operations Sequences for a Mars Rover Using Artificial Intelligence-Based Planning

NASA Astrophysics Data System (ADS)

Sherwood, R.; Mutz, D.; Estlin, T.; Chien, S.; Backes, P.; Norris, J.; Tran, D.; Cooper, B.; Rabideau, G.; Mishkin, A.; Maxwell, S.

2001-07-01

This article discusses a proof-of-concept prototype for ground-based automatic generation of validated rover command sequences from high-level science and engineering activities. This prototype is based on ASPEN, the Automated Scheduling and Planning Environment. This artificial intelligence (AI)-based planning and scheduling system will automatically generate a command sequence that will execute within resource constraints and satisfy flight rules. An automated planning and scheduling system encodes rover design knowledge and uses search and reasoning techniques to automatically generate low-level command sequences while respecting rover operability constraints, science and engineering preferences, environmental predictions, and also adhering to hard temporal constraints. This prototype planning system has been field-tested using the Rocky 7 rover at JPL and will be field-tested on more complex rovers to prove its effectiveness before transferring the technology to flight operations for an upcoming NASA mission. Enabling goal-driven commanding of planetary rovers greatly reduces the requirements for highly skilled rover engineering personnel. This in turn greatly reduces mission operations costs. In addition, goal-driven commanding permits a faster response to changes in rover state (e.g., faults) or science discoveries by removing the time-consuming manual sequence validation process, allowing rapid "what-if" analyses, and thus reducing overall cycle times.

Boosting the FM-Index on the GPU: Effective Techniques to Mitigate Random Memory Access.

PubMed

Chacón, Alejandro; Marco-Sola, Santiago; Espinosa, Antonio; Ribeca, Paolo; Moure, Juan Carlos

2015-01-01

The recent advent of high-throughput sequencing machines producing big amounts of short reads has boosted the interest in efficient string searching techniques. As of today, many mainstream sequence alignment software tools rely on a special data structure, called the FM-index, which allows for fast exact searches in large genomic references. However, such searches translate into a pseudo-random memory access pattern, thus making memory access the limiting factor of all computation-efficient implementations, both on CPUs and GPUs. Here, we show that several strategies can be put in place to remove the memory bottleneck on the GPU: more compact indexes can be implemented by having more threads work cooperatively on larger memory blocks, and a k-step FM-index can be used to further reduce the number of memory accesses. The combination of those and other optimisations yields an implementation that is able to process about two Gbases of queries per second on our test platform, being about 8 × faster than a comparable multi-core CPU version, and about 3 × to 5 × faster than the FM-index implementation on the GPU provided by the recently announced Nvidia NVBIO bioinformatics library.

Tandem mass spectrometry spectral libraries and library searching.

PubMed

Deutsch, Eric W

2011-01-01

Spectral library searching in the field of proteomics has been gaining visibility and use in the last few years, primarily due to the expansion of public proteomics data repositories and the large spectral libraries that can be generated from them. Spectral library searching has several advantages over conventional sequence searching: it is generally much faster, and has higher specificity and sensitivity. The speed increase is primarily, due to having a smaller, fully indexable search space of real spectra that are known to be observable. The increase in specificity and sensitivity is primarily due to the ability of a search engine to utilize the known intensities of the fragment ions, rather than just comparing with theoretical spectra as is done with sequence searching. The main disadvantage of spectral library searching is that one can only identify peptide ions that have been seen before and are stored in the spectral library. In this chapter, an overview of spectral library searching and the libraries currently available are presented.

Faster search by lackadaisical quantum walk

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2018-03-01

In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of O(1/log N) in O(√{N log N}) steps, which with amplitude amplification yields an overall runtime of O(√{N} log N). We show that making the quantum walk lackadaisical or lazy by adding a self-loop of weight 4 / N to each vertex speeds up the search, causing the success probability to reach a constant near 1 in O(√{N log N}) steps, thus yielding an O(√{log N}) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem. Our results are based on numerical simulations since the algorithm is not an instance of the abstract search algorithm.

Improved nearest codeword search scheme using a tighter kick-out condition

NASA Astrophysics Data System (ADS)

Hwang, Kuo-Feng; Chang, Chin-Chen

2001-09-01

Using a tighter kick-out condition as a faster approach to nearest codeword searches is proposed. The proposed scheme finds the nearest codeword that is identical to the one found using a full search. However, using our scheme, the search time is much shorter. Our scheme first establishes a tighter kick-out condition. Then, the temporal nearest codeword can be obtained from the codewords that survive the tighter condition. Finally, the temporal nearest codeword cooperatives with the query vector to constitute a better kick-out condition. In other words, more codewords can be excluded without actually computing the distances between the bypassed codewords and the query vector. Comparison to previous work are included to present the benefits of the proposed scheme in relation to search time.

Echolocation in Blainville's beaked whales (Mesoplodon densirostris).

PubMed

Madsen, P T; de Soto, N Aguilar; Arranz, P; Johnson, M

2013-06-01

Here we use sound and movement recording tags to study how deep-diving Blainville's beaked whales (Mesoplodon densirostris) use echolocation to forage in their natural mesopelagic habitat. These whales ensonify thousands of organisms per dive but select only about 25 prey for capture. They negotiate their cluttered environment by radiating sound in a narrow 20° field of view which they sample with 1.5-3 clicks per metre travelled requiring only some 60 clicks to locate, select and approach each prey. Sampling rates do not appear to be defined by the range to individual targets, but rather by the movement of the predator. Whales sample faster when they encounter patches of prey allowing them to search new water volumes while turning rapidly to stay within a patch. This implies that the Griffin search-approach-capture model of biosonar foraging must be expanded to account for sampling behaviours adapted to the overall prey distribution. Beaked whales can classify prey at more than 15 m range adopting stereotyped motor patterns when approaching some prey. This long detection range relative to swimming speed facilitates a deliberate mode of sensory-motor operation in which prey and capture tactics can be selected to optimize energy returns during long breath-hold dives.

Non-intubated video-assisted thoracic surgery: where does evidence stand?

PubMed Central

Tacconi, Federico

2016-01-01

In recent years, non-intubated video-assisted thoracic surgery (NIVATS) strategies are gaining popularity worldwide. The main goal of this surgical practice is to achieve an overall improvement of patients’ management and outcome thanks to the avoidance of side-effects related to general anesthesia (GA) and one-lung ventilation. The spectrum of expected benefits is multifaceted and includes reduced postoperative morbidity, faster discharge, decreased hospital costs and a globally reduced perturbation of patients’ well-being status. We have conducted a literature search to evaluate the available evidence on this topic. Meta-analysis of collected results was also done where appropriate. Despite some fragmentation of data and potential biases, the available data suggest that NIVATS operations can reduce operative morbidity and hospital stay when compared to equipollent procedures performed under GA. Larger, well designed prospective studies are thus warranted to assess the effectiveness of NIVATS as far as to investigate comprehensively the various outcomes. Multi-institutional and multidisciplinary cooperation will be welcome to establish uniform study protocols and to help address the questions that are to be answered yet. PMID:27195134

Are There Faster Than Light Particles?

ERIC Educational Resources Information Center

Kreisler, Michael N.

1969-01-01

Based upon recent relativistic theory, the researcher describes the search for tachyons, particles having velocities greater than that of a light. The properties of these particles are speculated upon. The author delineates the difficulties anticipated in their detection and the assumptions underlying their methodology. (RR)

Supershear Rayleigh Waves at a Soft Interface

NASA Astrophysics Data System (ADS)

Le Goff, Anne; Cobelli, Pablo; Lagubeau, Guillaume

2013-06-01

We report on the experimental observation of waves at a liquid foam surface propagating faster than the bulk shear waves. The existence of such waves has long been debated, but the recent observation of supershear events in a geophysical context has inspired us to search for their existence in a model viscoelastic system. An optimized fast profilometry technique allows us to observe on a liquid foam surface the waves triggered by the impact of a projectile. At high impact velocity, we show that the expected subshear Rayleigh waves are accompanied by faster surface waves that can be identified as supershear Rayleigh waves.

Dissociation between recognition and detection advantage for facial expressions: a meta-analysis.

PubMed

Nummenmaa, Lauri; Calvo, Manuel G

2015-04-01

Happy facial expressions are recognized faster and more accurately than other expressions in categorization tasks, whereas detection in visual search tasks is widely believed to be faster for angry than happy faces. We used meta-analytic techniques for resolving this categorization versus detection advantage discrepancy for positive versus negative facial expressions. Effect sizes were computed on the basis of the r statistic for a total of 34 recognition studies with 3,561 participants and 37 visual search studies with 2,455 participants, yielding a total of 41 effect sizes for recognition accuracy, 25 for recognition speed, and 125 for visual search speed. Random effects meta-analysis was conducted to estimate effect sizes at population level. For recognition tasks, an advantage in recognition accuracy and speed for happy expressions was found for all stimulus types. In contrast, for visual search tasks, moderator analysis revealed that a happy face detection advantage was restricted to photographic faces, whereas a clear angry face advantage was found for schematic and "smiley" faces. Robust detection advantage for nonhappy faces was observed even when stimulus emotionality was distorted by inversion or rearrangement of the facial features, suggesting that visual features primarily drive the search. We conclude that the recognition advantage for happy faces is a genuine phenomenon related to processing of facial expression category and affective valence. In contrast, detection advantages toward either happy (photographic stimuli) or nonhappy (schematic) faces is contingent on visual stimulus features rather than facial expression, and may not involve categorical or affective processing. (c) 2015 APA, all rights reserved).

Multiple Signal Classification for Gravitational Wave Burst Search

NASA Astrophysics Data System (ADS)

Cao, Junwei; He, Zhengqi

2013-01-01

This work is mainly focused on the application of the multiple signal classification (MUSIC) algorithm for gravitational wave burst search. This algorithm extracts important gravitational wave characteristics from signals coming from detectors with arbitrary position, orientation and noise covariance. In this paper, the MUSIC algorithm is described in detail along with the necessary adjustments required for gravitational wave burst search. The algorithm's performance is measured using simulated signals and noise. MUSIC is compared with the Q-transform for signal triggering and with Bayesian analysis for direction of arrival (DOA) estimation, using the Ω-pipeline. Experimental results show that MUSIC has a lower resolution but is faster. MUSIC is a promising tool for real-time gravitational wave search for multi-messenger astronomy.

Real-time earthquake monitoring using a search engine method.

PubMed

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

2014-12-04

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

Real-time earthquake monitoring using a search engine method

PubMed Central

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

2014-01-01

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

Online games: a novel approach to explore how partial information influences human random searches

NASA Astrophysics Data System (ADS)

Martínez-García, Ricardo; Calabrese, Justin M.; López, Cristóbal

2017-01-01

Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.

Online games: a novel approach to explore how partial information influences human random searches.

PubMed

Martínez-García, Ricardo; Calabrese, Justin M; López, Cristóbal

2017-01-06

Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.

Finding paths in tree graphs with a quantum walk

NASA Astrophysics Data System (ADS)

Koch, Daniel; Hillery, Mark

2018-01-01

We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

Derivation of Optimal Operating Rules for Large-scale Reservoir Systems Considering Multiple Trade-off

NASA Astrophysics Data System (ADS)

Zhang, J.; Lei, X.; Liu, P.; Wang, H.; Li, Z.

2017-12-01

Flood control operation of multi-reservoir systems such as parallel reservoirs and hybrid reservoirs often suffer from complex interactions and trade-off among tributaries and the mainstream. The optimization of such systems is computationally intensive due to nonlinear storage curves, numerous constraints and complex hydraulic connections. This paper aims to derive the optimal flood control operating rules based on the trade-off among tributaries and the mainstream using a new algorithm known as weighted non-dominated sorting genetic algorithm II (WNSGA II). WNSGA II could locate the Pareto frontier in non-dominated region efficiently due to the directed searching by weighted crowding distance, and the results are compared with those of conventional operating rules (COR) and single objective genetic algorithm (GA). Xijiang river basin in China is selected as a case study, with eight reservoirs and five flood control sections within four tributaries and the mainstream. Furthermore, the effects of inflow uncertainty have been assessed. Results indicate that: (1) WNSGA II could locate the non-dominated solutions faster and provide better Pareto frontier than the traditional non-dominated sorting genetic algorithm II (NSGA II) due to the weighted crowding distance; (2) WNSGA II outperforms COR and GA on flood control in the whole basin; (3) The multi-objective operating rules from WNSGA II deal with the inflow uncertainties better than COR. Therefore, the WNSGA II can be used to derive stable operating rules for large-scale reservoir systems effectively and efficiently.

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

High-performance metadata indexing and search in petascale data storage systems

NASA Astrophysics Data System (ADS)

Leung, A. W.; Shao, M.; Bisson, T.; Pasupathy, S.; Miller, E. L.

2008-07-01

Large-scale storage systems used for scientific applications can store petabytes of data and billions of files, making the organization and management of data in these systems a difficult, time-consuming task. The ability to search file metadata in a storage system can address this problem by allowing scientists to quickly navigate experiment data and code while allowing storage administrators to gather the information they need to properly manage the system. In this paper, we present Spyglass, a file metadata search system that achieves scalability by exploiting storage system properties, providing the scalability that existing file metadata search tools lack. In doing so, Spyglass can achieve search performance up to several thousand times faster than existing database solutions. We show that Spyglass enables important functionality that can aid data management for scientists and storage administrators.

A hybrid approach to generating search subspaces in dynamically constrained 4-dimensional data assimilation

NASA Astrophysics Data System (ADS)

Yaremchuk, Max; Martin, Paul; Beattie, Christopher

2017-09-01

Development and maintenance of the linearized and adjoint code for advanced circulation models is a challenging issue, requiring a significant proportion of total effort in operational data assimilation (DA). The ensemble-based DA techniques provide a derivative-free alternative, which appears to be competitive with variational methods in many practical applications. This article proposes a hybrid scheme for generating the search subspaces in the adjoint-free 4-dimensional DA method (a4dVar) that does not use a predefined ensemble. The method resembles 4dVar in that the optimal solution is strongly constrained by model dynamics and search directions are supplied iteratively using information from the current and previous model trajectories generated in the process of optimization. In contrast to 4dVar, which produces a single search direction from exact gradient information, a4dVar employs an ensemble of directions to form a subspace in order to proceed. In the earlier versions of a4dVar, search subspaces were built using the leading EOFs of either the model trajectory or the projections of the model-data misfits onto the range of the background error covariance (BEC) matrix at the current iteration. In the present study, we blend both approaches and explore a hybrid scheme of ensemble generation in order to improve the performance and flexibility of the algorithm. In addition, we introduce balance constraints into the BEC structure and periodically augment the search ensemble with BEC eigenvectors to avoid repeating minimization over already explored subspaces. Performance of the proposed hybrid a4dVar (ha4dVar) method is compared with that of standard 4dVar in a realistic regional configuration assimilating real data into the Navy Coastal Ocean Model (NCOM). It is shown that the ha4dVar converges faster than a4dVar and can be potentially competitive with 4dvar both in terms of the required computational time and the forecast skill.

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.

User Inspired Management of Scientific Jobs in Grids and Clouds

ERIC Educational Resources Information Center

Withana, Eran Chinthaka

2011-01-01

From time-critical, real time computational experimentation to applications which process petabytes of data there is a continuing search for faster, more responsive computing platforms capable of supporting computational experimentation. Weather forecast models, for instance, process gigabytes of data to produce regional (mesoscale) predictions on…

Temperature controller for crystal resonators

NASA Technical Reports Server (NTRS)

Turlington, T. R.

1980-01-01

Controller operates on less than 5W prime power and heats crystal from -10 C to 75 C in less than 45s. Unit is faster and more accurate (to within 0.7 C) than other inexpensive controllers and faster and less expensive than very precise controllers in vacuum flasks.

Inhibitory control differentiates rare target search performance in children.

PubMed

Li, Hongting; Chan, John S Y; Cheung, Sui-Yin; Yan, Jin H

2012-02-01

Age-related differences in rare-target search are primarily explained by the speed-accuracy trade-off, primed responses, or decision making. The goal was to examine how motor inhibition influences visual search. Children pressed a key when a rare target was detected. On no-target trials, children withheld reactions. Response time (RT), hits, misses, correct rejection, and false alarms were measured. Tapping tests assessed motor control. Older children tapped faster, were more sensitive to rare targets (higher d'), and reacted more slowly than younger ones. Girls outperformed boys in search sensitivity but not in RT. Motor speed was closely associated with hit rate and RT. Results suggest that development of inhibitory control plays a key role in visual detection. The potential implications for cognitive-motor development and individual differences are discussed.

Visual and Auditory Memory: Relationships to Reading Achievement.

ERIC Educational Resources Information Center

Bruning, Roger H.; And Others

1978-01-01

Good and poor readers' visual and auditory memory were tested. No group differences existed for single mode presentation in recognition frequency or latency. With multimodal presentation, good readers had faster latencies. Dual coding and self-terminating memory search hypotheses were supported. Implications for the reading process and reading…

CLAST: CUDA implemented large-scale alignment search tool.

PubMed

Yano, Masahiro; Mori, Hiroshi; Akiyama, Yutaka; Yamada, Takuji; Kurokawa, Ken

2014-12-11

Metagenomics is a powerful methodology to study microbial communities, but it is highly dependent on nucleotide sequence similarity searching against sequence databases. Metagenomic analyses with next-generation sequencing technologies produce enormous numbers of reads from microbial communities, and many reads are derived from microbes whose genomes have not yet been sequenced, limiting the usefulness of existing sequence similarity search tools. Therefore, there is a clear need for a sequence similarity search tool that can rapidly detect weak similarity in large datasets. We developed a tool, which we named CLAST (CUDA implemented large-scale alignment search tool), that enables analyses of millions of reads and thousands of reference genome sequences, and runs on NVIDIA Fermi architecture graphics processing units. CLAST has four main advantages over existing alignment tools. First, CLAST was capable of identifying sequence similarities ~80.8 times faster than BLAST and 9.6 times faster than BLAT. Second, CLAST executes global alignment as the default (local alignment is also an option), enabling CLAST to assign reads to taxonomic and functional groups based on evolutionarily distant nucleotide sequences with high accuracy. Third, CLAST does not need a preprocessed sequence database like Burrows-Wheeler Transform-based tools, and this enables CLAST to incorporate large, frequently updated sequence databases. Fourth, CLAST requires <2 GB of main memory, making it possible to run CLAST on a standard desktop computer or server node. CLAST achieved very high speed (similar to the Burrows-Wheeler Transform-based Bowtie 2 for long reads) and sensitivity (equal to BLAST, BLAT, and FR-HIT) without the need for extensive database preprocessing or a specialized computing platform. Our results demonstrate that CLAST has the potential to be one of the most powerful and realistic approaches to analyze the massive amount of sequence data from next-generation sequencing technologies.

Competitive code-based fast palmprint identification using a set of cover trees

NASA Astrophysics Data System (ADS)

Yue, Feng; Zuo, Wangmeng; Zhang, David; Wang, Kuanquan

2009-06-01

A palmprint identification system recognizes a query palmprint image by searching for its nearest neighbor from among all the templates in a database. When applied on a large-scale identification system, it is often necessary to speed up the nearest-neighbor searching process. We use competitive code, which has very fast feature extraction and matching speed, for palmprint identification. To speed up the identification process, we extend the cover tree method and propose to use a set of cover trees to facilitate the fast and accurate nearest-neighbor searching. We can use the cover tree method because, as we show, the angular distance used in competitive code can be decomposed into a set of metrics. Using the Hong Kong PolyU palmprint database (version 2) and a large-scale palmprint database, our experimental results show that the proposed method searches for nearest neighbors faster than brute force searching.

Visual Search Efficiency is Greater for Human Faces Compared to Animal Faces

PubMed Central

Simpson, Elizabeth A.; Mertins, Haley L.; Yee, Krysten; Fullerton, Alison; Jakobsen, Krisztina V.

2015-01-01

The Animate Monitoring Hypothesis proposes that humans and animals were the most important categories of visual stimuli for ancestral humans to monitor, as they presented important challenges and opportunities for survival and reproduction; however, it remains unknown whether animal faces are located as efficiently as human faces. We tested this hypothesis by examining whether human, primate, and mammal faces elicit similarly efficient searches, or whether human faces are privileged. In the first three experiments, participants located a target (human, primate, or mammal face) among distractors (non-face objects). We found fixations on human faces were faster and more accurate than primate faces, even when controlling for search category specificity. A final experiment revealed that, even when task-irrelevant, human faces slowed searches for non-faces, suggesting some bottom-up processing may be responsible for the human face search efficiency advantage. PMID:24962122

Efficient privacy-preserving string search and an application in genomics.

PubMed

Shimizu, Kana; Nuida, Koji; Rätsch, Gunnar

2016-06-01

Personal genomes carry inherent privacy risks and protecting privacy poses major social and technological challenges. We consider the case where a user searches for genetic information (e.g. an allele) on a server that stores a large genomic database and aims to receive allele-associated information. The user would like to keep the query and result private and the server the database. We propose a novel approach that combines efficient string data structures such as the Burrows-Wheeler transform with cryptographic techniques based on additive homomorphic encryption. We assume that the sequence data is searchable in efficient iterative query operations over a large indexed dictionary, for instance, from large genome collections and employing the (positional) Burrows-Wheeler transform. We use a technique called oblivious transfer that is based on additive homomorphic encryption to conceal the sequence query and the genomic region of interest in positional queries. We designed and implemented an efficient algorithm for searching sequences of SNPs in large genome databases. During search, the user can only identify the longest match while the server does not learn which sequence of SNPs the user queried. In an experiment based on 2184 aligned haploid genomes from the 1000 Genomes Project, our algorithm was able to perform typical queries within [Formula: see text] 4.6 s and [Formula: see text] 10.8 s for client and server side, respectively, on laptop computers. The presented algorithm is at least one order of magnitude faster than an exhaustive baseline algorithm. https://github.com/iskana/PBWT-sec and https://github.com/ratschlab/PBWT-sec shimizu-kana@aist.go.jp or Gunnar.Ratsch@ratschlab.org Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

Efficient privacy-preserving string search and an application in genomics

PubMed Central

Shimizu, Kana; Nuida, Koji; Rätsch, Gunnar

2016-01-01

Motivation: Personal genomes carry inherent privacy risks and protecting privacy poses major social and technological challenges. We consider the case where a user searches for genetic information (e.g. an allele) on a server that stores a large genomic database and aims to receive allele-associated information. The user would like to keep the query and result private and the server the database. Approach: We propose a novel approach that combines efficient string data structures such as the Burrows–Wheeler transform with cryptographic techniques based on additive homomorphic encryption. We assume that the sequence data is searchable in efficient iterative query operations over a large indexed dictionary, for instance, from large genome collections and employing the (positional) Burrows–Wheeler transform. We use a technique called oblivious transfer that is based on additive homomorphic encryption to conceal the sequence query and the genomic region of interest in positional queries. Results: We designed and implemented an efficient algorithm for searching sequences of SNPs in large genome databases. During search, the user can only identify the longest match while the server does not learn which sequence of SNPs the user queried. In an experiment based on 2184 aligned haploid genomes from the 1000 Genomes Project, our algorithm was able to perform typical queries within ≈ 4.6 s and ≈ 10.8 s for client and server side, respectively, on laptop computers. The presented algorithm is at least one order of magnitude faster than an exhaustive baseline algorithm. Availability and implementation: https://github.com/iskana/PBWT-sec and https://github.com/ratschlab/PBWT-sec. Contacts: shimizu-kana@aist.go.jp or Gunnar.Ratsch@ratschlab.org Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27153731

k-RP*{sub s}: A scalable distributed data structure for high-performance multi-attribute access

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

Litwin, W.; Neimat, M.A.

k-RP*{sub s} is a new data structure for scalable multicomputer files with multi-attribute (k-d) keys. We discuss the k-RP*{sub s} file evolution and search algorithms. Performance analysis shows that a k-RP*{sub s} file can be much larger and orders of magnitude faster than a traditional k-d file. The speed-up is especially important for range and partial match searches that are often impractical with traditional k-d files. This opens up a new perspective for many applications.

Validating the random search model for two targets of different difficulty.

PubMed

Chan, Alan H S; Yu, Ruifeng

2010-02-01

A random visual search model was fitted to 1,788 search times obtained from a nonidentical double-target search task. 30 Hong Kong Chinese (13 men, 17 women) ages 18 to 33 years (M = 23, SD = 6.8) took part in the experiment voluntarily. The overall adequacy and prediction accuracy of the model for various search time parameters (mean and median search times and response times) for both individual and pooled data show that search strategy may reasonably be inferred from search time distributions. The results also suggested the general applicability of the random search model for describing the search behavior of a large number of participants performing the type of search used here, as well as the practical feasibility of its application for determination of stopping policy for optimization of an inspection system design. Although the data generally conformed to the model the search for the more difficult target was faster than expected. The more difficult target was usually detected after the easier target and it is suggested that some degree of memory-guided searching may have been used for the second target. Some abnormally long search times were observed and it is possible that these might have been due to the characteristics of visual lobes, nonoptimum interfixation distances and inappropriate overlapping of lobes, as has been previously reported.

Discriminability and dimensionality effects in visual search for featural conjunctions: a functional pop-out.

PubMed

Dehaene, S

1989-07-01

Treisman and Gelade's (1980) feature-integration theory of attention states that a scene must be serially scanned before the objects in it can be accurately perceived. Is serial scanning compatible with the speed observed in the perception of real-world scenes? Most real scenes consist of many more dimensions (color, size, shape, depth, etc.) than those generally found in search paradigms. Furthermore, real objects differ from each other along many of these dimensions. The present experiment assessed the influence of the total number of dimensions and target/distractor discriminability (the number of dimensions that suffice to separate a target from distractors) on search times for a conjunction of features. Search was always found to be serial. However, for the most discriminable targets, search rate was so fast that search times were in the same range as pop-out detection times. Apparently, greater discriminability enables subjects to direct attention at a faster rate and at only a fraction of the items in a scene.

Transients in the Local Universe : Systematically Searching the Gap between Novae and Supernovae

NASA Astrophysics Data System (ADS)

Kasliwal, Mansi M.; Kulkarni, S.

2009-05-01

We present three systematic transient searches of the glaring luminosity gap between brightest novae (Mv = -10) and faintest supernovae (Mv = -16). The least explored regime in this gap, with several intriguing theoretical predictions, is short-duration transients (<10; days). Our searches are targeted and designed to be deeper and faster cadence (1-day) than traditional supernova searches and probe a larger volume compared to nova searches. We summarize discoveries from our search of the nearest, brightest galaxies (P60-FasTING, Fast Transients In Nearest Galaxies) and nearest galaxy clusters (CFHT-COVET, Coma and Virgo Exploration for Transients). We also highlight first results from the Palomar Transient Factory which targets local (<200 Mpc) luminosity concentrations. We suggest that building a complete inventory of transients in the local universe is timely. These transients are potential electromagnetic counterparts to next-generation instruments (e.g. Advanced LIGO, Auger, ICECUBE) which are also limited in sensitivity (due to intrumental or physical effects) to the local universe.

Simultaneous development of laparoscopy and robotics provides acceptable perioperative outcomes and shows robotics to have a faster learning curve and to be overall faster in rectal cancer surgery: analysis of novice MIS surgeon learning curves.

PubMed

Melich, George; Hong, Young Ki; Kim, Jieun; Hur, Hyuk; Baik, Seung Hyuk; Kim, Nam Kyu; Sender Liberman, A; Min, Byung Soh

2015-03-01

Laparoscopy offers some evidence of benefit compared to open rectal surgery. Robotic rectal surgery is evolving into an accepted approach. The objective was to analyze and compare laparoscopic and robotic rectal surgery learning curves with respect to operative times and perioperative outcomes for a novice minimally invasive colorectal surgeon. One hundred and six laparoscopic and 92 robotic LAR rectal surgery cases were analyzed. All surgeries were performed by a surgeon who was primarily trained in open rectal surgery. Patient characteristics and perioperative outcomes were analyzed. Operative time and CUSUM plots were used for evaluating the learning curve for laparoscopic versus robotic LAR. Laparoscopic versus robotic LAR outcomes feature initial group operative times of 308 (291-325) min versus 397 (373-420) min and last group times of 220 (212-229) min versus 204 (196-211) min-reversed in favor of robotics; major complications of 4.7 versus 6.5 % (NS), resection margin involvement of 2.8 versus 4.4 % (NS), conversion rate of 3.8 versus 1.1 (NS), lymph node harvest of 16.3 versus 17.2 (NS), and estimated blood loss of 231 versus 201 cc (NS). Due to faster learning curves for extracorporeal phase and total mesorectal excision phase, the robotic surgery was observed to be faster than laparoscopic surgery after the initial 41 cases. CUSUM plots demonstrate acceptable perioperative surgical outcomes from the beginning of the study. Initial robotic operative times improved with practice rapidly and eventually became faster than those for laparoscopy. Developing both laparoscopic and robotic skills simultaneously can provide acceptable perioperative outcomes in rectal surgery. It might be suggested that in the current milieu of clashing interests between evolving technology and economic constrains, there might be advantages in embracing both approaches.

Two Improved Access Methods on Compact Binary (CB) Trees.

ERIC Educational Resources Information Center

Shishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi

2000-01-01

Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)

Transnational Higher Education in Uzbekistan

ERIC Educational Resources Information Center

Sia, E. K.

2014-01-01

This paper provides an overview of transnational higher education (THE) in Uzbekistan. It includes a brief account of THE current and future market trends. The data, gathered from a literature search, show that the demand for THE (off-campus) is growing even faster than the demand for international (on-campus) programmes. This paper then provides…

Stanford-Based HighWire Press Transforms the Publication of Scientific Journals.

ERIC Educational Resources Information Center

Young, Jeffrey R.

1997-01-01

In two years, HighWire Press at Stanford University (California) has revolutionized online scientific publishing; electronic journals are reaching readers faster, are easier to search, and are entering new foreign markets. The largest scientific publishers will put about 200 journals online in 1997. Other changes foreseen include immediate rather…

Eyewitness Identification Accuracy and Response Latency: The Unruly 10-12-Second Rule

ERIC Educational Resources Information Center

Weber, Nathan; Brewer, Neil; Wells, Gary L.; Semmler, Carolyn; Keast, Amber

2004-01-01

Data are reported from 3,213 research eyewitnesses confirming that accurate eyewitness identifications from lineups are made faster than are inaccurate identifications. However, consistent with predictions from the recognition and search literatures, the authors did not find support for the "10-12-s rule" in which lineup identifications faster…

The Mechanisms Underlying the ASD Advantage in Visual Search

ERIC Educational Resources Information Center

Kaldy, Zsuzsa; Giserman, Ivy; Carter, Alice S.; Blaser, Erik

2016-01-01

A number of studies have demonstrated that individuals with autism spectrum disorders (ASDs) are faster or more successful than typically developing control participants at various visual-attentional tasks (for reviews, see Dakin and Frith in "Neuron" 48:497-507, 2005; Simmons et al. in "Vis Res" 49:2705-2739, 2009). This…

Recoding between two types of STM representation revealed by the dynamics of memory search.

PubMed

Leszczyński, Marcin; Myers, Nicholas E; Akyürek, Elkan G; Schubö, Anna

2012-03-01

Visual STM (VSTM) is thought to be related to visual attention in several ways. Attention controls access to VSTM during memory encoding and plays a role in the maintenance of stored information by strengthening memorized content. We investigated the involvement of visual attention in recall from VSTM. In two experiments, we measured electrophysiological markers of attention in a memory search task with varying intervals between VSTM encoding and recall, and so we were able to track recoding of representations in memory. Results confirmed the involvement of attention in VSTM recall. However, the amplitude of the N2pc and N3rs components, which mark orienting of attention and search within VSTM, decreased as a function of delay. Conversely, the amplitude of the P3 and sustained posterior contralateral negativity components increased as a function of delay, effectively the opposite of the N2pc and N3rs modulations. These effects were only observed when verbal memory was not taxed. Thus, the results suggested that gradual recoding from visuospatial orienting of attention into verbal recall mechanisms takes place from short to long retention intervals. Interestingly, recall at longer delays was faster than at short delays, indicating that verbal representation is coupled with faster responses. These results extend the orienting-of-attention hypothesis by including an account of representational recoding during short-term consolidation and its consequences for recall from VSTM.

The effectiveness of corticotomy and piezocision on canine retraction: A systematic review.

PubMed

Viwattanatipa, Nita; Charnchairerk, Satadarun

2018-05-01

The aim of this systematic review was to evaluate the effectiveness and complications of corticotomy and piezocision in canine retraction. Five electronic databases (PubMed, SCOPUS, Web of Science, Embase, and CENTRAL) were searched for articles published up to July 2017. The databases were searched for randomized control trials (RCTs), with a split-mouth design, using either corticotomy or piezocision. The primary outcome reported for canine retraction was either the amount of tooth movement, rate of tooth movement, or treatment time. The secondary outcome was complications. The selection process was based on the PRISMA guidelines. A risk of bias assessment was also performed. Our search retrieved 530 abstracts. However, only five RCTs were finally included. Corticotomy showed a more significant (i.e., 2 to 4 times faster) increase in the rate of tooth movement than did the conventional method. For piezocision, both accumulative tooth movement and rate of tooth movement were twice faster than those of the conventional method. Corticotomy (with a flap design avoiding marginal bone incision) or flapless piezocision procedures were not detrimental to periodontal health. Nevertheless, piezocision resulted in higher levels of patient satisfaction. The main limitation of this study was the limited number of primary research publications on both techniques. For canine retraction into the immediate premolar extraction site, the rate of canine movement after piezocision was almost comparable to that of corticotomy with only buccal flap elevation.

Joint compensation scheme of polarization crosstalk, intersymbol interference, frequency offset, and phase noise based on cascaded Kalman filter

NASA Astrophysics Data System (ADS)

Zhang, Qun; Yang, Yanfu; Xiang, Qian; Zhou, Zhongqing; Yao, Yong

2018-02-01

A joint compensation scheme based on cascaded Kalman filter is proposed, which can implement polarization tracking, channel equalization, frequency offset, and phase noise compensation simultaneously. The experimental results show that the proposed algorithm can not only compensate multiple channel impairments simultaneously but also improve the polarization tracking capacity and accelerate the convergence speed. The scheme has up to eight times faster convergence speed compared with radius-directed equalizer (RDE) + Max-FFT (maximum fast Fourier transform) + BPS (blind phase search) and can track up polarization rotation 60 times and 15 times faster than that of RDE + Max-FFT + BPS and CMMA (cascaded multimodulus algorithm) + Max-FFT + BPS, respectively.

Improvements In A Laser-Speckle Surface-Strain Gauge

NASA Technical Reports Server (NTRS)

Lant, Christian T.

1996-01-01

Compact optical subsystem incorporates several improvements over optical subsystems of previous versions of laser-speckle surface-strain gauge: faster acquisition of data, faster response to transients, reduced size and weight, lower cost, and less complexity. Principle of operation described previously in "Laser System Measures Two-Dimensional Strain" (LEW-15046), and "Two-Dimensional Laser-Speckle Surface-Strain Gauge" (LEW-15337).

NREL's CelA Catalyzes Plant Cell Walls Faster | News | NREL

Science.gov Websites

12, 2015 Close-up photo of a scientist in safety glasses examining small items in plastic containers because high temperatures mean faster action. Also, because it can operate above the boiling point of alcohol, the alcohol is separated naturally, saving a costly step in the conversion process-and the high

Faster Hall-Effect Current-Measuring Circuit

NASA Technical Reports Server (NTRS)

Sullender, Craig C.; Johnson, Daniel D.; Walker, Daniel D.

1993-01-01

Current-measuring circuit operates on Hall-effect-sensing and magnetic-field-nulling principles similar to those described in article, "Nulling Hall-Effect Current-Measuring Circuit" (LEW-15023), but simpler and responds faster. Designed without feedback loop, and analog pulse-width-modulated output indicates measured current. Circuit measures current at frequency higher than bandwidth of its Hall-effect sensor.

The interplay of episodic and semantic memory in guiding repeated search in scenes.

PubMed

Võ, Melissa L-H; Wolfe, Jeremy M

2013-02-01

It seems intuitive to think that previous exposure or interaction with an environment should make it easier to search through it and, no doubt, this is true in many real-world situations. However, in a recent study, we demonstrated that previous exposure to a scene does not necessarily speed search within that scene. For instance, when observers performed as many as 15 searches for different objects in the same, unchanging scene, the speed of search did not decrease much over the course of these multiple searches (Võ & Wolfe, 2012). Only when observers were asked to search for the same object again did search become considerably faster. We argued that our naturalistic scenes provided such strong "semantic" guidance-e.g., knowing that a faucet is usually located near a sink-that guidance by incidental episodic memory-having seen that faucet previously-was rendered less useful. Here, we directly manipulated the availability of semantic information provided by a scene. By monitoring observers' eye movements, we found a tight coupling of semantic and episodic memory guidance: Decreasing the availability of semantic information increases the use of episodic memory to guide search. These findings have broad implications regarding the use of memory during search in general and particularly during search in naturalistic scenes. Copyright © 2012 Elsevier B.V. All rights reserved.

The interplay of episodic and semantic memory in guiding repeated search in scenes

PubMed Central

Võ, Melissa L.-H.; Wolfe, Jeremy M.

2012-01-01

It seems intuitive to think that previous exposure or interaction with an environment should make it easier to search through it and, no doubt, this is true in many real-world situations. However, in a recent study, we demonstrated that previous exposure to a scene does not necessarily speed search within that scene. For instance, when observers performed as many as fifteen searches for different objects in the same, unchanging scene, the speed of search did not decrease much over the course of these multiple searches (Võ & Wolfe, 2012). Only when observers were asked to search for the same object again did search become considerably faster. We argued that our naturalistic scenes provided such strong “semantic” guidance — e.g., knowing that a faucet is usually located near a sink — that guidance by incidental episodic memory — having seen that faucet previously — was rendered less useful. Here, we directly manipulated the availability of semantic information provided by a scene. By monitoring observers’ eye movements, we found a tight coupling of semantic and episodic memory guidance: Decreasing the availability of semantic information increases the use of episodic memory to guide search. These findings have broad implications regarding the use of memory during search in general and particularly during search in naturalistic scenes. PMID:23177141

G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.

PubMed

Wang, Xiaohong; Smalter, Aaron; Huan, Jun; Lushington, Gerald H

2009-01-01

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others.Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database.Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index structure is scalable to large database with smaller indexing size, faster indexing construction time, and faster query processing time as compared to state-of-the-art indexing methods such as C-tree, gIndex, and GraphGrep.

Adaptive rood pattern search for fast block-matching motion estimation.

PubMed

Nie, Yao; Ma, Kai-Kuang

2002-01-01

In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) initial search and 2) refined local search. For each macroblock (MB), the initial search is performed only once at the beginning in order to find a good starting point for the follow-up refined local search. By doing so, unnecessary intermediate search and the risk of being trapped into local minimum matching error points could be greatly reduced in long search case. For the initial search stage, an adaptive rood pattern (ARP) is proposed, and the ARP's size is dynamically determined for each MB, based on the available motion vectors (MVs) of the neighboring MBs. In the refined local search stage, a unit-size rood pattern (URP) is exploited repeatedly, and unrestrictedly, until the final MV is found. To further speed up the search, zero-motion prejudgment (ZMP) is incorporated in our method, which is particularly beneficial to those video sequences containing small motion contents. Extensive experiments conducted based on the MPEG-4 Verification Model (VM) encoding platform show that the search speed of our proposed ARPS-ZMP is about two to three times faster than that of the diamond search (DS), and our method even achieves higher peak signal-to-noise ratio (PSNR) particularly for those video sequences containing large and/or complex motion contents.

Advanced Keyboard

NASA Technical Reports Server (NTRS)

1993-01-01

Using chordic technology, a data entry operator can finger key combinations for text or graphics input. Because only one hand is needed, a disabled person may use it. Strain and fatigue are less than when using a conventional keyboard; input is faster, and the system can be learned in about an hour. Infogrip, Inc. developed chordic input technology with Stennis Space Center (SSC). (NASA is interested in potentially faster human/computer interaction on spacecraft as well as a low cost tactile/visual training system for the handicapped.) The company is now marketing the BAT as an improved system for both disabled and non-disabled computer operators.

An effective hybrid firefly algorithm with harmony search for global numerical optimization.

PubMed

Guo, Lihong; Wang, Gai-Ge; Wang, Heqi; Wang, Dinan

2013-01-01

A hybrid metaheuristic approach by hybridizing harmony search (HS) and firefly algorithm (FA), namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.

Tachyon search speeds up retrieval of similar sequences by several orders of magnitude

PubMed Central

Tan, Joshua; Kuchibhatla, Durga; Sirota, Fernanda L.; Sherman, Westley A.; Gattermayer, Tobias; Kwoh, Chia Yee; Eisenhaber, Frank; Schneider, Georg; Maurer-Stroh, Sebastian

2012-01-01

Summary: The usage of current sequence search tools becomes increasingly slower as databases of protein sequences continue to grow exponentially. Tachyon, a new algorithm that identifies closely related protein sequences ~200 times faster than standard BLAST, circumvents this limitation with a reduced database and oligopeptide matching heuristic. Availability and implementation: The tool is publicly accessible as a webserver at http://tachyon.bii.a-star.edu.sg and can also be accessed programmatically through SOAP. Contact: sebastianms@bii.a-star.edu.sg Supplementary information: Supplementary data are available at the Bioinformatics online. PMID:22531216

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.

Hyperlink Format, Categorization Abilities and Memory Span as Contributors to Deaf Users Hypertext Access

ERIC Educational Resources Information Center

Farjardo, Inmaculada; Arfe, Barbara; Benedetti, Patrizia; Altoe, Gianmarco

2008-01-01

Sixty deaf and hearing students were asked to search for goods in a Hypertext Supermarket with either graphical or textual links of high typicality, frequency, and familiarity. Additionally, they performed a picture and word categorization task and two working memory span tasks (spatial and verbal). Results showed that deaf students were faster in…

Faster than a Speeding Bullet (or, How To Keep up with the Internet).

ERIC Educational Resources Information Center

Fingerman, Susan

1999-01-01

Discusses how librarians can keep up with Internet developments. Advice includes: step back and think; recognize that it is a hopeless task; stay focused; and "stand on the shoulders of others." World Wide Web sites that provide access to information on specific subjects, hardware/software, Internet issues, and search engines are cited,…

Planning chemical syntheses with deep neural networks and symbolic AI

NASA Astrophysics Data System (ADS)

Segler, Marwin H. S.; Preuss, Mike; Waller, Mark P.

2018-03-01

To plan the syntheses of small organic molecules, chemists use retrosynthesis, a problem-solving technique in which target molecules are recursively transformed into increasingly simpler precursors. Computer-aided retrosynthesis would be a valuable tool but at present it is slow and provides results of unsatisfactory quality. Here we use Monte Carlo tree search and symbolic artificial intelligence (AI) to discover retrosynthetic routes. We combined Monte Carlo tree search with an expansion policy network that guides the search, and a filter network to pre-select the most promising retrosynthetic steps. These deep neural networks were trained on essentially all reactions ever published in organic chemistry. Our system solves for almost twice as many molecules, thirty times faster than the traditional computer-aided search method, which is based on extracted rules and hand-designed heuristics. In a double-blind AB test, chemists on average considered our computer-generated routes to be equivalent to reported literature routes.

Selection and response bias as determinants of priming of pop-out search: Revelations from diffusion modeling.

PubMed

Burnham, Bryan R

2018-05-03

During visual search, both top-down factors and bottom-up properties contribute to the guidance of visual attention, but selection history can influence attention independent of bottom-up and top-down factors. For example, priming of pop-out (PoP) is the finding that search for a singleton target is faster when the target and distractor features repeat than when those features trade roles between trials. Studies have suggested that such priming (selection history) effects on pop-out search manifest either early, by biasing the selection of the preceding target feature, or later in processing, by facilitating response and target retrieval processes. The present study was designed to examine the influence of selection history on pop-out search by introducing a speed-accuracy trade-off manipulation in a pop-out search task. Ratcliff diffusion modeling (RDM) was used to examine how selection history influenced both attentional bias and response execution processes. The results support the hypothesis that selection history biases attention toward the preceding target's features on the current trial and also influences selection of the response to the target.

Perceptual Factors Influence Visual Search for Meaningful Symbols In Individuals with Intellectual Disabilities and Down Syndrome or Autism Spectrum Disorders

PubMed Central

Wilkinson, Krista M.; McIlvane, William J.

2013-01-01

Augmentative and alternative communication (AAC) systems often supplement oral communication of individuals with intellectual and communication disabilities. Research with nondisabled preschoolers has demonstrated that two visual perceptual factors influence speed and/or accuracy of finding a target - the internal color and spatial organization of symbols. Twelve participants with Down syndrome and 12 with ASD underwent two search tasks. In one, the symbols were clustered by internal color; in the other the identical symbols had no arrangement cue. Visual search was superior in participants with ASD compared to those with Down syndrome. In both groups, responses were significantly faster when the symbols were clustered by internal color. Construction of aided AAC displays may benefit from attention to their physical/perceptual features. PMID:24245729

Eyewitness identification accuracy and response latency: the unruly 10-12-second rule.

PubMed

Weber, Nathan; Brewer, Neil; Wells, Gary L; Semmler, Carolyn; Keast, Amber

2004-09-01

Data are reported from 3,213 research eyewitnesses confirming that accurate eyewitness identifications from lineups are made faster than are inaccurate identifications. However, consistent with predictions from the recognition and search literatures, the authors did not find support for the "10-12-s rule" in which lineup identifications faster than 10-12 s maximally discriminate between accurate and inaccurate identifications (D. Dunning & S. Perretta, 2002). Instead, the time frame that proved most discriminating was highly variable across experiments, ranging from 5 s to 29 s, and the maximally discriminating time was often unimpressive in its ability to sort accurate from inaccurate identifications. The authors suggest several factors that are likely to moderate the 10-12-s rule. (c) 2004 APA, all rights reserved.

Age-related changes in conjunctive visual search in children with and without ASD.

PubMed

Iarocci, Grace; Armstrong, Kimberly

2014-04-01

Visual-spatial strengths observed among people with autism spectrum disorder (ASD) may be associated with increased efficiency of selective attention mechanisms such as visual search. In a series of studies, researchers examined the visual search of targets that share features with distractors in a visual array and concluded that people with ASD showed enhanced performance on visual search tasks. However, methodological limitations, the small sample sizes, and the lack of developmental analysis have tempered the interpretations of these results. In this study, we specifically addressed age-related changes in visual search. We examined conjunctive visual search in groups of children with (n = 34) and without ASD (n = 35) at 7-9 years of age when visual search performance is beginning to improve, and later, at 10-12 years, when performance has improved. The results were consistent with previous developmental findings; 10- to 12-year-old children were significantly faster visual searchers than their 7- to 9-year-old counterparts. However, we found no evidence of enhanced search performance among the children with ASD at either the younger or older ages. More research is needed to understand the development of visual search in both children with and without ASD. © 2014 International Society for Autism Research, Wiley Periodicals, Inc.

Ground Data System Risk Mitigation Techniques for Faster, Better, Cheaper Missions

NASA Technical Reports Server (NTRS)

Catena, John J.; Saylor, Rick; Casasanta, Ralph; Weikel, Craig; Powers, Edward I. (Technical Monitor)

2000-01-01

With the advent of faster, cheaper, and better missions, NASA Projects acknowledged that a higher level of risk was inherent and accepted with this approach. It was incumbent however upon each component of the Project whether spacecraft, payload, launch vehicle, or ground data system to ensure that the mission would nevertheless be an unqualified success. The Small Explorer (SMEX) program's ground data system (GDS) team developed risk mitigation techniques to achieve these goals starting in 1989. These techniques have evolved through the SMEX series of missions and are practiced today under the Triana program. These techniques are: (1) Mission Team Organization--empowerment of a closeknit ground data system team comprising system engineering, software engineering, testing, and flight operations personnel; (2) Common Spacecraft Test and Operational Control System--utilization of the pre-launch spacecraft integration system as the post-launch ground data system on-orbit command and control system; (3) Utilization of operations personnel in pre-launch testing--making the flight operations team an integrated member of the spacecraft testing activities at the beginning of the spacecraft fabrication phase; (4) Consolidated Test Team--combined system, mission readiness and operations testing to optimize test opportunities with the ground system and spacecraft; and (5). Reuse of Spacecraft, Systems and People--reuse of people, software and on-orbit spacecraft throughout the SMEX mission series. The SMEX ground system development approach for faster, cheaper, better missions has been very successful. This paper will discuss these risk management techniques in the areas of ground data system design, implementation, test, and operational readiness.

Optimal Padding for the Two-Dimensional Fast Fourier Transform

NASA Technical Reports Server (NTRS)

Dean, Bruce H.; Aronstein, David L.; Smith, Jeffrey S.

2011-01-01

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Visual search accelerates during adolescence.

PubMed

Burggraaf, Rudolf; van der Geest, Jos N; Frens, Maarten A; Hooge, Ignace T C

2018-05-01

We studied changes in visual-search performance and behavior during adolescence. Search performance was analyzed in terms of reaction time and response accuracy. Search behavior was analyzed in terms of the objects fixated and the duration of these fixations. A large group of adolescents (N = 140; age: 12-19 years; 47% female, 53% male) participated in a visual-search experiment in which their eye movements were recorded with an eye tracker. The experiment consisted of 144 trials (50% with a target present), and participants had to decide whether a target was present. Each trial showed a search display with 36 Gabor patches placed on a hexagonal grid. The target was a vertically oriented element with a high spatial frequency. Nontargets differed from the target in spatial frequency, orientation, or both. Search performance and behavior changed during adolescence; with increasing age, fixation duration and reaction time decreased. Response accuracy, number of fixations, and selection of elements to fixate upon did not change with age. Thus, the speed of foveal discrimination increases with age, while the efficiency of peripheral selection does not change. We conclude that the way visual information is gathered does not change during adolescence, but the processing of visual information becomes faster.

Top-down contextual knowledge guides visual attention in infancy.

PubMed

Tummeltshammer, Kristen; Amso, Dima

2017-10-26

The visual context in which an object or face resides can provide useful top-down information for guiding attention orienting, object recognition, and visual search. Although infants have demonstrated sensitivity to covariation in spatial arrays, it is presently unclear whether they can use rapidly acquired contextual knowledge to guide attention during visual search. In this eye-tracking experiment, 6- and 10-month-old infants searched for a target face hidden among colorful distracter shapes. Targets appeared in Old or New visual contexts, depending on whether the visual search arrays (defined by the spatial configuration, shape and color of component items in the search display) were repeated or newly generated throughout the experiment. Targets in Old contexts appeared in the same location within the same configuration, such that context covaried with target location. Both 6- and 10-month-olds successfully distinguished between Old and New contexts, exhibiting faster search times, fewer looks at distracters, and more anticipation of targets when contexts repeated. This initial demonstration of contextual cueing effects in infants indicates that they can use top-down information to facilitate orienting during memory-guided visual search. © 2017 John Wiley & Sons Ltd.

Detection of emotional faces: salient physical features guide effective visual search.

PubMed

Calvo, Manuel G; Nummenmaa, Lauri

2008-08-01

In this study, the authors investigated how salient visual features capture attention and facilitate detection of emotional facial expressions. In a visual search task, a target emotional face (happy, disgusted, fearful, angry, sad, or surprised) was presented in an array of neutral faces. Faster detection of happy and, to a lesser extent, surprised and disgusted faces was found both under upright and inverted display conditions. Inversion slowed down the detection of these faces less than that of others (fearful, angry, and sad). Accordingly, the detection advantage involves processing of featural rather than configural information. The facial features responsible for the detection advantage are located in the mouth rather than the eye region. Computationally modeled visual saliency predicted both attentional orienting and detection. Saliency was greatest for the faces (happy) and regions (mouth) that were fixated earlier and detected faster, and there was close correspondence between the onset of the modeled saliency peak and the time at which observers initially fixated the faces. The authors conclude that visual saliency of specific facial features--especially the smiling mouth--is responsible for facilitated initial orienting, which thus shortens detection. (PsycINFO Database Record (c) 2008 APA, all rights reserved).

IVHS Institutional and Legal Issues Program: Review of the FAST-TRAC Operational Test

DOT National Transportation Integrated Search

1994-06-01

The FAST-TRAC (Faster and Safer Travel through Traffic Routing and Advanced Controls) operational test attempted to integrate advanced traveler information systems (ATIS) and advanced traffic management system (ATMS) technologies in Oakland County, M...

Earthquake detection through computationally efficient similarity search

PubMed Central

Yoon, Clara E.; O’Reilly, Ossian; Bergen, Karianne J.; Beroza, Gregory C.

2015-01-01

Seismology is experiencing rapid growth in the quantity of data, which has outpaced the development of processing algorithms. Earthquake detection—identification of seismic events in continuous data—is a fundamental operation for observational seismology. We developed an efficient method to detect earthquakes using waveform similarity that overcomes the disadvantages of existing detection methods. Our method, called Fingerprint And Similarity Thresholding (FAST), can analyze a week of continuous seismic waveform data in less than 2 hours, or 140 times faster than autocorrelation. FAST adapts a data mining algorithm, originally designed to identify similar audio clips within large databases; it first creates compact “fingerprints” of waveforms by extracting key discriminative features, then groups similar fingerprints together within a database to facilitate fast, scalable search for similar fingerprint pairs, and finally generates a list of earthquake detections. FAST detected most (21 of 24) cataloged earthquakes and 68 uncataloged earthquakes in 1 week of continuous data from a station located near the Calaveras Fault in central California, achieving detection performance comparable to that of autocorrelation, with some additional false detections. FAST is expected to realize its full potential when applied to extremely long duration data sets over a distributed network of seismic stations. The widespread application of FAST has the potential to aid in the discovery of unexpected seismic signals, improve seismic monitoring, and promote a greater understanding of a variety of earthquake processes. PMID:26665176

Solubility and Diffusivity: Important Metrics in the Search for the Root Cause of Light- and Elevated Temperature-Induced Degradation

DOE PAGES

Jensen, Mallory A.; Morishige, Ashley E.; Chakraborty, Sagnik; ...

2018-02-02

Light- and elevated temperature-induced degradation (LeTID) is a detrimental effect observed under operating conditions in p-type multicrystalline silicon (mc-Si) solar cells. In this paper, we employ synchrotron-based techniques to study the dissolution of precipitates due to different firing processes at grain boundaries in LeTID-affected mc-Si. The synchrotron measurements show clear dissolution of collocated metal precipitates during firing. We compare our observations with degradation behavior in the same wafers. The experimental results are complemented with process simulations to provide insight into the change in bulk point defect concentration due to firing. Several studies have proposed that LeTID is caused by metal-richmore » precipitate dissolution during contact firing, and we find that the solubility and diffusivity are promising screening metrics to identify metals that are compatible with this hypothesis. While slower and less soluble elements (e.g., Fe and Cr) are not compatible according to our simulations, the point defect concentrations of faster and more soluble elements (e.g., Cu and Ni) increase after a high-temperature firing process, primarily due to emitter segregation rather than precipitate dissolution. Finally, these results are a useful complement to lifetime spectroscopy techniques, and can be used to evaluate additional candidates in the search for the root cause of LeTID.« less

Solubility and Diffusivity: Important Metrics in the Search for the Root Cause of Light- and Elevated Temperature-Induced Degradation

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

Jensen, Mallory A.; Morishige, Ashley E.; Chakraborty, Sagnik

Light- and elevated temperature-induced degradation (LeTID) is a detrimental effect observed under operating conditions in p-type multicrystalline silicon (mc-Si) solar cells. In this paper, we employ synchrotron-based techniques to study the dissolution of precipitates due to different firing processes at grain boundaries in LeTID-affected mc-Si. The synchrotron measurements show clear dissolution of collocated metal precipitates during firing. We compare our observations with degradation behavior in the same wafers. The experimental results are complemented with process simulations to provide insight into the change in bulk point defect concentration due to firing. Several studies have proposed that LeTID is caused by metal-richmore » precipitate dissolution during contact firing, and we find that the solubility and diffusivity are promising screening metrics to identify metals that are compatible with this hypothesis. While slower and less soluble elements (e.g., Fe and Cr) are not compatible according to our simulations, the point defect concentrations of faster and more soluble elements (e.g., Cu and Ni) increase after a high-temperature firing process, primarily due to emitter segregation rather than precipitate dissolution. Finally, these results are a useful complement to lifetime spectroscopy techniques, and can be used to evaluate additional candidates in the search for the root cause of LeTID.« less

Tissue adhesives for closure of surgical incisions.

PubMed

Coulthard, Paul; Esposito, Marco; Worthington, Helen V; van der Elst, Maarten; van Waes, Oscar J F; Darcey, James

2010-05-12

Sutures, staples and adhesive tapes are the traditional methods of wound closure, whilst tissue adhesives have entered clinical practice more recently. Closure of wounds with sutures enables meticulous closure, but they may show tissue reactivity and can require removal. Tissue adhesives offer the advantages of no risk of needlestick injury and no requirement to remove sutures later. Tissue adhesives have been used primarily in emergency rooms but this review looks at the use of tissue adhesives in the operating room where surgeons are increasingly using these for the closure of surgical skin incisions. To determine the relative effects of various tissue adhesives and conventional skin closure techniques on the healing of surgical wounds. For this update we searched the Cochrane Wounds Group Specialised Register (Searched 17/11/09); The Cochrane Central Register of Controlled Trials (CENTRAL) - The Cochrane Library Issue 4 2009; Ovid MEDLINE - 1950 to November Week 1 2009; Ovid EMBASE - 1980 to 2009 Week 46; EBSCO CINAHL - 1982 to 17 November 20098. No date or language restrictions were applied. Only randomised controlled clinical trials were eligible for inclusion. Screening of eligible studies and data extraction were conducted independently and in triplicate whilst assessment of the methodological quality of the trials was conducted independently and in duplicate. Results were expressed as random effects models using mean difference for continuous outcomes and relative risks with 95% confidence intervals for dichotomous outcomes. Heterogeneity was investigated including both clinical and methodological factors. This update identified an additional six trials resulting in a total of fourteen RCTs (1152 patients) which met the inclusion criteria. Sutures were significantly better than tissue adhesives for minimising dehiscence (10 trials). Sutures were also found to be significantly faster to use. For all other analyses of infection, patient and operator satisfaction and cost there was no significant difference between sutures and tissue adhesives. No differences were found between tissue adhesives and tapes (2 trials) for minimising dehiscence, infection, patients assessment of cosmetic appearance, patient satisfaction or surgeon satisfaction. However a statistically significant difference in favour of using tape was found for surgeons' assessment of cosmetic appearance (mean difference 13, 95% CI 5 to 21). Tapes were also demonstrated to be significantly faster to use than tissue adhesives as were staples (1 trial). No other outcome measures were analysed in this group. One trial compared tissue adhesives with a variety of methods of wound closure and found both patients and clinicians were significantly more satisfied with the alternative closure methods than the adhesives. In this same trial tissue adhesives were significantly less time consuming to use. For the remaining outcomes of dehiscence and infection no difference was observed between groups. This trial also compared high viscosity with low viscosity adhesives and found that high viscosity adhesives were less time consuming to use than low viscosity tissue adhesives. For all other outcomes of dehiscence, infection, patient satisfaction and operator satisfaction there was no statistically significant difference between high and low viscosity adhesives. Sutures were significantly better than tissue adhesives for minimising dehiscence and were found to be significantly faster to use. Although surgeons may consider the use of tissue adhesives as an alternative to other methods of surgical site closure in the operating theatre they must be aware that adhesives may take more time to apply and that if higher tension is needed upon an incision, sutures may minimise dehiscence. There is a need for more well designed randomised controlled trials comparing tissue adhesives and alternative methods of closure. These trials should include people whose health may interfere with wound healing and surgical sites of high tension.

Principled negotiation and distributed optimization for advanced air traffic management

NASA Astrophysics Data System (ADS)

Wangermann, John Paul

Today's aircraft/airspace system faces complex challenges. Congestion and delays are widespread as air traffic continues to grow. Airlines want to better optimize their operations, and general aviation wants easier access to the system. Additionally, the accident rate must decline just to keep the number of accidents each year constant. New technology provides an opportunity to rethink the air traffic management process. Faster computers, new sensors, and high-bandwidth communications can be used to create new operating models. The choice is no longer between "inflexible" strategic separation assurance and "flexible" tactical conflict resolution. With suitable operating procedures, it is possible to have strategic, four-dimensional separation assurance that is flexible and allows system users maximum freedom to optimize operations. This thesis describes an operating model based on principled negotiation between agents. Many multi-agent systems have agents that have different, competing interests but have a shared interest in coordinating their actions. Principled negotiation is a method of finding agreement between agents with different interests. By focusing on fundamental interests and searching for options for mutual gain, agents with different interests reach agreements that provide benefits for both sides. Using principled negotiation, distributed optimization by each agent can be coordinated leading to iterative optimization of the system. Principled negotiation is well-suited to aircraft/airspace systems. It allows aircraft and operators to propose changes to air traffic control. Air traffic managers check the proposal maintains required aircraft separation. If it does, the proposal is either accepted or passed to agents whose trajectories change as part of the proposal for approval. Aircraft and operators can use all the data at hand to develop proposals that optimize their operations, while traffic managers can focus on their primary duty of ensuring aircraft safety. This thesis describes how an aircraft/airspace system using principled negotiation operates, and reports simulation results on the concept. The results show safety is maintained while aircraft have freedom to optimize their operations.

Efficient sequential and parallel algorithms for finding edit distance based motifs.

PubMed

Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar

2016-08-18

Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in this paper are also applicable to other motif search problems such as Planted Motif Search (PMS) and Simple Motif Search (SMS).

An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization

PubMed Central

Guo, Lihong; Wang, Gai-Ge; Wang, Heqi; Wang, Dinan

2013-01-01

A hybrid metaheuristic approach by hybridizing harmony search (HS) and firefly algorithm (FA), namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods. PMID:24348137

Cherenkov radiation of superluminal particles

NASA Astrophysics Data System (ADS)

Rohrlich, Daniel; Aharonov, Yakir

2002-10-01

Any charged particle moving faster than light through a medium emits Cherenkov radiation. We show that charged particles moving faster than light through the vacuum emit Cherenkov radiation. How can a particle move faster than light? The weak speed of a charged particle can exceed the speed of light. By definition, the weak velocity w is <Ψfin|v|Ψin>/<Ψfin|Ψin>, where v is the velocity operator and |Ψin> and |Ψfin> are, respectively, the states of a particle before and after a velocity measurement. We discuss the consistency of weak values and show that superluminal weak speed is consistent with relativistic causality.

Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

NASA Astrophysics Data System (ADS)

Nakamura, Katsuhiko; Hoshina, Akemi

This paper discusses recent improvements and extensions in Synapse system for inductive inference of context free grammars (CFGs) from sample strings. Synapse uses incremental learning, rule generation based on bottom-up parsing, and the search for rule sets. The form of production rules in the previous system is extended from Revised Chomsky Normal Form A→βγ to Extended Chomsky Normal Form, which also includes A→B, where each of β and γ is either a terminal or nonterminal symbol. From the result of bottom-up parsing, a rule generation mechanism synthesizes minimum production rules required for parsing positive samples. Instead of inductive CYK algorithm in the previous version of Synapse, the improved version uses a novel rule generation method, called ``bridging,'' which bridges the lacked part of the derivation tree for the positive string. The improved version also employs a novel search strategy, called serial search in addition to minimum rule set search. The synthesis of grammars by the serial search is faster than the minimum set search in most cases. On the other hand, the size of the generated CFGs is generally larger than that by the minimum set search, and the system can find no appropriate grammar for some CFL by the serial search. The paper shows experimental results of incremental learning of several fundamental CFGs and compares the methods of rule generation and search strategies.

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

Aurally aided visual search performance in a dynamic environment

NASA Astrophysics Data System (ADS)

McIntire, John P.; Havig, Paul R.; Watamaniuk, Scott N. J.; Gilkey, Robert H.

2008-04-01

Previous research has repeatedly shown that people can find a visual target significantly faster if spatial (3D) auditory displays direct attention to the corresponding spatial location. However, previous research has only examined searches for static (non-moving) targets in static visual environments. Since motion has been shown to affect visual acuity, auditory acuity, and visual search performance, it is important to characterize aurally-aided search performance in environments that contain dynamic (moving) stimuli. In the present study, visual search performance in both static and dynamic environments is investigated with and without 3D auditory cues. Eight participants searched for a single visual target hidden among 15 distracting stimuli. In the baseline audio condition, no auditory cues were provided. In the 3D audio condition, a virtual 3D sound cue originated from the same spatial location as the target. In the static search condition, the target and distractors did not move. In the dynamic search condition, all stimuli moved on various trajectories at 10 deg/s. The results showed a clear benefit of 3D audio that was present in both static and dynamic environments, suggesting that spatial auditory displays continue to be an attractive option for a variety of aircraft, motor vehicle, and command & control applications.

CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment

PubMed Central

Manavski, Svetlin A; Valle, Giorgio

2008-01-01

Background Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more than 25 years. It is based on a dynamic programming approach that explores all the possible alignments between two sequences; as a result it returns the optimal local alignment. Unfortunately, the computational cost is very high, requiring a number of operations proportional to the product of the length of two sequences. Furthermore, the exponential growth of protein and DNA databases makes the Smith-Waterman algorithm unrealistic for searching similarities in large sets of sequences. For these reasons heuristic approaches such as those implemented in FASTA and BLAST tend to be preferred, allowing faster execution times at the cost of reduced sensitivity. The main motivation of our work is to exploit the huge computational power of commonly available graphic cards, to develop high performance solutions for sequence alignment. Results In this paper we present what we believe is the fastest solution of the exact Smith-Waterman algorithm running on commodity hardware. It is implemented in the recently released CUDA programming environment by NVidia. CUDA allows direct access to the hardware primitives of the last-generation Graphics Processing Units (GPU) G80. Speeds of more than 3.5 GCUPS (Giga Cell Updates Per Second) are achieved on a workstation running two GeForce 8800 GTX. Exhaustive tests have been done to compare our implementation to SSEARCH and BLAST, running on a 3 GHz Intel Pentium IV processor. Our solution was also compared to a recently published GPU implementation and to a Single Instruction Multiple Data (SIMD) solution. These tests show that our implementation performs from 2 to 30 times faster than any other previous attempt available on commodity hardware. Conclusions The results show that graphic cards are now sufficiently advanced to be used as efficient hardware accelerators for sequence alignment. Their performance is better than any alternative available on commodity hardware platforms. The solution presented in this paper allows large scale alignments to be performed at low cost, using the exact Smith-Waterman algorithm instead of the largely adopted heuristic approaches. PMID:18387198

Transanal hemorrhoidal dearterialization with mucopexy versus open hemorrhoidectomy in the treatment of hemorrhoids: a meta-analysis of randomized control trials.

PubMed

Xu, L; Chen, H; Lin, G; Ge, Q; Qi, H; He, X

2016-12-01

The aim of this study was to analyse the outcomes of transanal hemorrhoidal dearterialization with mucopexy (THDm) versus open hemorrhoidectomy (OH) in the management of hemorrhoids. Randomized controlled trials in English were found by searching PubMed, Web of science, EMBASE, and the Cochrane Library database. Trials that compared THDm with OH were identified. Data were extracted independently for each study, and a meta-analysis was performed using fixed and random effects models. Four trials, including 316 patients, met the inclusion criteria. No statistically significant differences were noted in either total complications or postoperative bleeding, incontinence, recurrent prolapse, and urinary retention rate. Operative time was significantly longer for THDm with Doppler guidance than for THDm without Doppler guidance. Patients returned to normal activities faster after THDm than after OH. No statistically significant differences between THDm and OH were noted with regard to recurrence and reoperation rates. Our meta-analysis shows that THDm and OH are equally effective and can be attempted for the management of hemorrhoids. However, for THDm with Doppler guidance, more instruments and a longer operative time are required. Future large-scale, high-quality, multicenter trials with long-term outcomes are needed to prove these results and determine whether Doppler guidance in THD is truly necessary or not.

Characteristic sounds facilitate visual search.

PubMed

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

2008-06-01

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

Misleading contextual cues: how do they affect visual search?

PubMed

Manginelli, Angela A; Pollmann, Stefan

2009-03-01

Contextual cueing occurs when repetitions of the distractor configuration are implicitly learned. This implicit learning leads to faster search times in repeated displays. Here, we investigated how search adapts to a change of the target location in old displays from a consistent location in the learning phase to a consistent new location in the transfer phase. In agreement with the literature, contextual cueing was accompanied by fewer fixations, a more efficient scan path and, specifically, an earlier onset of a monotonic gaze approach phase towards the target location in repeated displays. When the repeated context was no longer predictive of the old target location, search times and number of fixations for old displays increased to the level of novel displays. Along with this, scan paths for old and new displays became equally efficient. After the target location change, there was a bias of exploration towards the old target location, which soon disappeared. Thus, change of implicitly learned spatial relations between target and distractor configuration eliminated the advantageous effects of contextual cueing, but did not lead to a lasting impairment of search in repeated displays relative to novel displays.

Negative emotional stimuli reduce contextual cueing but not response times in inefficient search.

PubMed

Kunar, Melina A; Watson, Derrick G; Cole, Louise; Cox, Angeline

2014-02-01

In visual search, previous work has shown that negative stimuli narrow the focus of attention and speed reaction times (RTs). This paper investigates these two effects by first asking whether negative emotional stimuli narrow the focus of attention to reduce the learning of a display context in a contextual cueing task and, second, whether exposure to negative stimuli also reduces RTs in inefficient search tasks. In Experiment 1, participants viewed either negative or neutral images (faces or scenes) prior to a contextual cueing task. In a typical contextual cueing experiment, RTs are reduced if displays are repeated across the experiment compared with novel displays that are not repeated. The results showed that a smaller contextual cueing effect was obtained after participants viewed negative stimuli than when they viewed neutral stimuli. However, in contrast to previous work, overall search RTs were not faster after viewing negative stimuli (Experiments 2 to 4). The findings are discussed in terms of the impact of emotional content on visual processing and the ability to use scene context to help facilitate search.

Visual search and emotion: how children with autism spectrum disorders scan emotional scenes.

PubMed

Maccari, Lisa; Pasini, Augusto; Caroli, Emanuela; Rosa, Caterina; Marotta, Andrea; Martella, Diana; Fuentes, Luis J; Casagrande, Maria

2014-11-01

This study assessed visual search abilities, tested through the flicker task, in children diagnosed with autism spectrum disorders (ASDs). Twenty-two children diagnosed with ASD and 22 matched typically developing (TD) children were told to detect changes in objects of central interest or objects of marginal interest (MI) embedded in either emotion-laden (positive or negative) or neutral real-world pictures. The results showed that emotion-laden pictures equally interfered with performance of both ASD and TD children, slowing down reaction times compared with neutral pictures. Children with ASD were faster than TD children, particularly in detecting changes in MI objects, the most difficult condition. However, their performance was less accurate than performance of TD children just when the pictures were negative. These findings suggest that children with ASD have better visual search abilities than TD children only when the search is particularly difficult and requires strong serial search strategies. The emotional-social impairment that is usually considered as a typical feature of ASD seems to be limited to processing of negative emotional information.

Working-memory capacity predicts the executive control of visual search among distractors: the influences of sustained and selective attention.

PubMed

Poole, Bradley J; Kane, Michael J

2009-07-01

Variation in working-memory capacity (WMC) predicts individual differences in only some attention-control capabilities. Whereas higher WMC subjects outperform lower WMC subjects in tasks requiring the restraint of prepotent but inappropriate responses, and the constraint of attentional focus to target stimuli against distractors, they do not differ in prototypical visual-search tasks, even those that yield steep search slopes and engender top-down control. The present three experiments tested whether WMC, as measured by complex memory span tasks, would predict search latencies when the 1-8 target locations to be searched appeared alone, versus appearing among distractor locations to be ignored, with the latter requiring selective attentional focus. Subjects viewed target-location cues and then fixated on those locations over either long (1,500-1,550 ms) or short (300 ms) delays. Higher WMC subjects identified targets faster than did lower WMC subjects only in the presence of distractors and only over long fixation delays. WMC thus appears to affect subjects' ability to maintain a constrained attentional focus over time.

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

Who's Trending in Agriculture? A Look at Social Media

ERIC Educational Resources Information Center

Carter, Jarai

2013-01-01

Information spreads fast, but even faster with the use of social media. For instance, if one goes to twitter and searches "Farm Bill" it can be seen that many people have tweeted about the recent passing of the Farm Bill and re-tweeted information about this. This increased the attention given to this bill as seen by the hundreds of tweets on this…

Operations automation

NASA Technical Reports Server (NTRS)

Boreham, Charles Thomas

1994-01-01

This is truly the era of 'faster-better-cheaper' at the National Aeronautics and Space Administration/Jet Propulsion Laboratory (NASA/JPL). To continue JPL's primary mission of building and operating interplanetary spacecraft, all possible avenues are being explored in the search for better value for each dollar spent. A significant cost factor in any mission is the amount of manpower required to receive, decode, decommutate, and distribute spacecraft engineering and experiment data. The replacement of the many mission-unique data systems with the single Advanced Multimission Operations System (AMMOS) has already allowed for some manpower reduction. Now, we find that further economies are made possible by drastically reducing the number of human interventions required to perform the setup, data saving, station handover, processed data loading, and tear down activities that are associated with each spacecraft tracking pass. We have recently adapted three public domain tools to the AMMOS system which allow common elements to be scheduled and initialized without the normal human intervention. This is accomplished with a stored weekly event schedule. The manual entries and specialized scripts which had to be provided just prior to and during a pass are now triggered by the schedule to perform the functions unique to the upcoming pass. This combination of public domain software and the AMMOS system has been run in parallel with the flight operation in an online testing phase for six months. With this methodology, a savings of 11 man-years per year is projected with no increase in data loss or project risk. There are even greater savings to be gained as we learn other uses for this configuration.

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

PubMed

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

2015-01-01

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

Expertise in complex decision making: the role of search in chess 70 years after de Groot.

PubMed

Connors, Michael H; Burns, Bruce D; Campitelli, Guillermo

2011-01-01

One of the most influential studies in all expertise research is de Groot's (1946) study of chess players, which suggested that pattern recognition, rather than search, was the key determinant of expertise. Many changes have occurred in the chess world since de Groot's study, leading some authors to argue that the cognitive mechanisms underlying expertise have also changed. We decided to replicate de Groot's study to empirically test these claims and to examine whether the trends in the data have changed over time. Six Grandmasters, five International Masters, six Experts, and five Class A players completed the think-aloud procedure for two chess positions. Findings indicate that Grandmasters and International Masters search more quickly than Experts and Class A players, and that both groups today search substantially faster than players in previous studies. The findings, however, support de Groot's overall conclusions and are consistent with predictions made by pattern recognition models. Copyright © 2011 Cognitive Science Society, Inc.

On the improvement of Wiener attack on RSA with small private exponent.

PubMed

Wu, Mu-En; Chen, Chien-Ming; Lin, Yue-Hsun; Sun, Hung-Min

2014-01-01

RSA system is based on the hardness of the integer factorization problem (IFP). Given an RSA modulus N = pq, it is difficult to determine the prime factors p and q efficiently. One of the most famous short exponent attacks on RSA is the Wiener attack. In 1997, Verheul and van Tilborg use an exhaustive search to extend the boundary of the Wiener attack. Their result shows that the cost of exhaustive search is 2r + 8 bits when extending the Weiner's boundary r bits. In this paper, we first reduce the cost of exhaustive search from 2r + 8 bits to 2r + 2 bits. Then, we propose a method named EPF. With EPF, the cost of exhaustive search is further reduced to 2r - 6 bits when we extend Weiner's boundary r bits. It means that our result is 2(14) times faster than Verheul and van Tilborg's result. Besides, the security boundary is extended 7 bits.

On the Improvement of Wiener Attack on RSA with Small Private Exponent

PubMed Central

Chen, Chien-Ming; Lin, Yue-Hsun

2014-01-01

RSA system is based on the hardness of the integer factorization problem (IFP). Given an RSA modulus N = pq, it is difficult to determine the prime factors p and q efficiently. One of the most famous short exponent attacks on RSA is the Wiener attack. In 1997, Verheul and van Tilborg use an exhaustive search to extend the boundary of the Wiener attack. Their result shows that the cost of exhaustive search is 2r + 8 bits when extending the Weiner's boundary r bits. In this paper, we first reduce the cost of exhaustive search from 2r + 8 bits to 2r + 2 bits. Then, we propose a method named EPF. With EPF, the cost of exhaustive search is further reduced to 2r − 6 bits when we extend Weiner's boundary r bits. It means that our result is 214 times faster than Verheul and van Tilborg's result. Besides, the security boundary is extended 7 bits. PMID:24982974

Finding similar nucleotide sequences using network BLAST searches.

PubMed

Ladunga, Istvan

2009-06-01

The Basic Local Alignment Search Tool (BLAST) is a keystone of bioinformatics due to its performance and user-friendliness. Beginner and intermediate users will learn how to design and submit blastn and Megablast searches on the Web pages at the National Center for Biotechnology Information. We map nucleic acid sequences to genomes, find identical or similar mRNA, expressed sequence tag, and noncoding RNA sequences, and run Megablast searches, which are much faster than blastn. Understanding results is assisted by taxonomy reports, genomic views, and multiple alignments. We interpret expected frequency thresholds, biological significance, and statistical significance. Weak hits provide no evidence, but hints for further analyses. We find genes that may code for homologous proteins by translated BLAST. We reduce false positives by filtering out low-complexity regions. Parsed BLAST results can be integrated into analysis pipelines. Links in the output connect to Entrez, PUBMED, structural, sequence, interaction, and expression databases. This facilitates integration with a wide spectrum of biological knowledge.

Electroencephalography epilepsy classifications using hybrid cuckoo search and neural network

NASA Astrophysics Data System (ADS)

Pratiwi, A. B.; Damayanti, A.; Miswanto

2017-07-01

Epilepsy is a condition that affects the brain and causes repeated seizures. This seizure is episodes that can vary and nearly undetectable to long periods of vigorous shaking or brain contractions. Epilepsy often can be confirmed with an electrocephalography (EEG). Neural Networks has been used in biomedic signal analysis, it has successfully classified the biomedic signal, such as EEG signal. In this paper, a hybrid cuckoo search and neural network are used to recognize EEG signal for epilepsy classifications. The weight of the multilayer perceptron is optimized by the cuckoo search algorithm based on its error. The aim of this methods is making the network faster to obtained the local or global optimal then the process of classification become more accurate. Based on the comparison results with the traditional multilayer perceptron, the hybrid cuckoo search and multilayer perceptron provides better performance in term of error convergence and accuracy. The purpose methods give MSE 0.001 and accuracy 90.0 %.

The Effects of Soil Texture on the Ability of Human Remains Detection Dogs to Detect Buried Human Remains.

PubMed

Alexander, Michael B; Hodges, Theresa K; Wescott, Daniel J; Aitkenhead-Peterson, Jacqueline A

2016-05-01

Despite technological advances, human remains detection (HRD) dogs still remain one of the best tools for locating clandestine graves. However, soil texture may affect the escape of decomposition gases and therefore the effectiveness of HDR dogs. Six nationally credentialed HRD dogs (three HRD only and three cross-trained) were evaluated on novel buried human remains in contrasting soils, a clayey and a sandy soil. Search time and accuracy were compared for the clayey soil and sandy soil to assess odor location difficulty. Sandy soil (p < 0.001) yielded significantly faster trained response times, but no significant differences were found in performance accuracy between soil textures or training method. Results indicate soil texture may be significant factor in odor detection difficulty. Prior knowledge of soil texture and moisture may be useful for search management and planning. Appropriate adjustments to search segment sizes, sweep widths and search time allotment depending on soil texture may optimize successful detection. © 2016 American Academy of Forensic Sciences.

Application of artificial intelligence to search ground-state geometry of clusters

NASA Astrophysics Data System (ADS)

Lemes, Maurício Ruv; Marim, L. R.; dal Pino, A.

2002-08-01

We introduce a global optimization procedure, the neural-assisted genetic algorithm (NAGA). It combines the power of an artificial neural network (ANN) with the versatility of the genetic algorithm. This method is suitable to solve optimization problems that depend on some kind of heuristics to limit the search space. If a reasonable amount of data is available, the ANN can ``understand'' the problem and provide the genetic algorithm with a selected population of elements that will speed up the search for the optimum solution. We tested the method in a search for the ground-state geometry of silicon clusters. We trained the ANN with information about the geometry and energetics of small silicon clusters. Next, the ANN learned how to restrict the configurational space for larger silicon clusters. For Si10 and Si20, we noticed that the NAGA is at least three times faster than the ``pure'' genetic algorithm. As the size of the cluster increases, it is expected that the gain in terms of time will increase as well.

Cloud parallel processing of tandem mass spectrometry based proteomics data.

PubMed

Mohammed, Yassene; Mostovenko, Ekaterina; Henneman, Alex A; Marissen, Rob J; Deelder, André M; Palmblad, Magnus

2012-10-05

Data analysis in mass spectrometry based proteomics struggles to keep pace with the advances in instrumentation and the increasing rate of data acquisition. Analyzing this data involves multiple steps requiring diverse software, using different algorithms and data formats. Speed and performance of the mass spectral search engines are continuously improving, although not necessarily as needed to face the challenges of acquired big data. Improving and parallelizing the search algorithms is one possibility; data decomposition presents another, simpler strategy for introducing parallelism. We describe a general method for parallelizing identification of tandem mass spectra using data decomposition that keeps the search engine intact and wraps the parallelization around it. We introduce two algorithms for decomposing mzXML files and recomposing resulting pepXML files. This makes the approach applicable to different search engines, including those relying on sequence databases and those searching spectral libraries. We use cloud computing to deliver the computational power and scientific workflow engines to interface and automate the different processing steps. We show how to leverage these technologies to achieve faster data analysis in proteomics and present three scientific workflows for parallel database as well as spectral library search using our data decomposition programs, X!Tandem and SpectraST.

Adding a Visualization Feature to Web Search Engines: It’s Time

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

Wong, Pak C.

Since the first world wide web (WWW) search engine quietly entered our lives in 1994, the “information need” behind web searching has rapidly grown into a multi-billion dollar business that dominates the internet landscape, drives e-commerce traffic, propels global economy, and affects the lives of the whole human race. Today’s search engines are faster, smarter, and more powerful than those released just a few years ago. With the vast investment pouring into research and development by leading web technology providers and the intense emotion behind corporate slogans such as “win the web” or “take back the web,” I can’t helpmore » but ask why are we still using the very same “text-only” interface that was used 13 years ago to browse our search engine results pages (SERPs)? Why has the SERP interface technology lagged so far behind in the web evolution when the corresponding search technology has advanced so rapidly? In this article I explore some current SERP interface issues, suggest a simple but practical visual-based interface design approach, and argue why a visual approach can be a strong candidate for tomorrow’s SERP interface.« less

Dermatological image search engines on the Internet: do they work?

PubMed

Cutrone, M; Grimalt, R

2007-02-01

Atlases on CD-ROM first substituted the use of paediatric dermatology atlases printed on paper. This permitted a faster search and a practical comparison of differential diagnoses. The third step in the evolution of clinical atlases was the onset of the online atlas. Many doctors now use the Internet image search engines to obtain clinical images directly. The aim of this study was to test the reliability of the image search engines compared to the online atlases. We tested seven Internet image search engines with three paediatric dermatology diseases. In general, the service offered by the search engines is good, and continues to be free of charge. The coincidence between what we searched for and what we found was generally excellent, and contained no advertisements. Most Internet search engines provided similar results but some were more user friendly than others. It is not necessary to repeat the same research with Picsearch, Lycos and MSN, as the response would be the same; there is a possibility that they might share software. Image search engines are a useful, free and precise method to obtain paediatric dermatology images for teaching purposes. There is still the matter of copyright to be resolved. What are the legal uses of these 'free' images? How do we define 'teaching purposes'? New watermark methods and encrypted electronic signatures might solve these problems and answer these questions.

Natural Language Interfaces to Database Systems

DTIC Science & Technology

1988-10-01

the power was nff to avoid re-entering data for each run of the calculations. External physical devices were developed such as punched tape and...given rise to more powerful or faster tools. Today, operations with the latest fifth generation database management system are not going to be any faster...database does not represent an evolution of greater power or speed. The fascinating aspect is that it represents an evolution of usability and more

GPU Based N-Gram String Matching Algorithm with Score Table Approach for String Searching in Many Documents

NASA Astrophysics Data System (ADS)

Srinivasa, K. G.; Shree Devi, B. N.

2017-10-01

String searching in documents has become a tedious task with the evolution of Big Data. Generation of large data sets demand for a high performance search algorithm in areas such as text mining, information retrieval and many others. The popularity of GPU's for general purpose computing has been increasing for various applications. Therefore it is of great interest to exploit the thread feature of a GPU to provide a high performance search algorithm. This paper proposes an optimized new approach to N-gram model for string search in a number of lengthy documents and its GPU implementation. The algorithm exploits GPGPUs for searching strings in many documents employing character level N-gram matching with parallel Score Table approach and search using CUDA API. The new approach of Score table used for frequency storage of N-grams in a document, makes the search independent of the document's length and allows faster access to the frequency values, thus decreasing the search complexity. The extensive thread feature in a GPU has been exploited to enable parallel pre-processing of trigrams in a document for Score Table creation and parallel search in huge number of documents, thus speeding up the whole search process even for a large pattern size. Experiments were carried out for many documents of varied length and search strings from the standard Lorem Ipsum text on NVIDIA's GeForce GT 540M GPU with 96 cores. Results prove that the parallel approach for Score Table creation and searching gives a good speed up than the same approach executed serially.

Contextual cueing by global features

PubMed Central

Kunar, Melina A.; Flusberg, Stephen J.; Wolfe, Jeremy M.

2008-01-01

In visual search tasks, attention can be guided to a target item, appearing amidst distractors, on the basis of simple features (e.g. find the red letter among green). Chun and Jiang’s (1998) “contextual cueing” effect shows that RTs are also speeded if the spatial configuration of items in a scene is repeated over time. In these studies we ask if global properties of the scene can speed search (e.g. if the display is mostly red, then the target is at location X). In Experiment 1a, the overall background color of the display predicted the target location. Here the predictive color could appear 0, 400 or 800 msec in advance of the search array. Mean RTs are faster in predictive than in non-predictive conditions. However, there is little improvement in search slopes. The global color cue did not improve search efficiency. Experiments 1b-1f replicate this effect using different predictive properties (e.g. background orientation/texture, stimuli color etc.). The results show a strong RT effect of predictive background but (at best) only a weak improvement in search efficiency. A strong improvement in efficiency was found, however, when the informative background was presented 1500 msec prior to the onset of the search stimuli and when observers were given explicit instructions to use the cue (Experiment 2). PMID:17355043

Optimum Aggregation and Control of Spatially Distributed Flexible Resources in Smart Grid

DOE PAGES

Bhattarai, Bishnu; Mendaza, Iker Diaz de Cerio; Myers, Kurt S.; ...

2017-03-24

This paper presents an algorithm to optimally aggregate spatially distributed flexible resources at strategic microgrid/smart-grid locations. The aggregation reduces a distribution network having thousands of nodes to an equivalent network with a few aggregated nodes, thereby enabling distribution system operators (DSOs) to make faster operational decisions. Moreover, the aggregation enables flexibility from small distributed flexible resources to be traded to different power and energy markets. A hierarchical control architecture comprising a combination of centralized and decentralized control approaches is proposed to practically deploy the aggregated flexibility. The proposed method serves as a great operational tool for DSOs to decide themore » exact amount of required flexibilities from different network section(s) for solving grid constraint violations. The effectiveness of the proposed method is demonstrated through simulation of three operational scenarios in a real low voltage distribution system having high penetrations of electric vehicles and heat pumps. Finally, the simulation results demonstrated that the aggregation helps DSOs not only in taking faster operational decisions, but also in effectively utilizing the available flexibility.« less

Optimum Aggregation and Control of Spatially Distributed Flexible Resources in Smart Grid

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

Bhattarai, Bishnu; Mendaza, Iker Diaz de Cerio; Myers, Kurt S.

This paper presents an algorithm to optimally aggregate spatially distributed flexible resources at strategic microgrid/smart-grid locations. The aggregation reduces a distribution network having thousands of nodes to an equivalent network with a few aggregated nodes, thereby enabling distribution system operators (DSOs) to make faster operational decisions. Moreover, the aggregation enables flexibility from small distributed flexible resources to be traded to different power and energy markets. A hierarchical control architecture comprising a combination of centralized and decentralized control approaches is proposed to practically deploy the aggregated flexibility. The proposed method serves as a great operational tool for DSOs to decide themore » exact amount of required flexibilities from different network section(s) for solving grid constraint violations. The effectiveness of the proposed method is demonstrated through simulation of three operational scenarios in a real low voltage distribution system having high penetrations of electric vehicles and heat pumps. Finally, the simulation results demonstrated that the aggregation helps DSOs not only in taking faster operational decisions, but also in effectively utilizing the available flexibility.« less

Stochastic control approaches for sensor management in search and exploitation

NASA Astrophysics Data System (ADS)

Hitchings, Darin Chester

Recent improvements in the capabilities of autonomous vehicles have motivated their increased use in such applications as defense, homeland security, environmental monitoring, and surveillance. To enhance performance in these applications, new algorithms are required to control teams of robots autonomously and through limited interactions with human operators. In this dissertation we develop new algorithms for control of robots performing information-seeking missions in unknown environments. These missions require robots to control their sensors in order to discover the presence of objects, keep track of the objects, and learn what these objects are, given a fixed sensing budget. Initially, we investigate control of multiple sensors, with a finite set of sensing options and finite-valued measurements, to locate and classify objects given a limited resource budget. The control problem is formulated as a Partially Observed Markov Decision Problem (POMDP), but its exact solution requires excessive computation. Under the assumption that sensor error statistics are independent and time-invariant, we develop a class of algorithms using Lagrangian Relaxation techniques to obtain optimal mixed strategies using performance bounds developed in previous research. We investigate alternative Receding Horizon (RH) controllers to convert the mixed strategies to feasible adaptive-sensing strategies and evaluate the relative performance of these controllers in simulation. The resulting controllers provide superior performance to alternative algorithms proposed in the literature and obtain solutions to large-scale POMDP problems several orders of magnitude faster than optimal Dynamic Programming (DP) approaches with comparable performance quality. We extend our results for finite action, finite measurement sensor control to scenarios with moving objects. We use Hidden Markov Models (HMMs) for the evolution of objects, according to the dynamics of a birth-death process. We develop a new lower bound on the performance of adaptive controllers in these scenarios, develop algorithms for computing solutions to this lower bound, and use these algorithms as part of a RH controller for sensor allocation in the presence of moving objects We also consider an adaptive Search problem where sensing actions are continuous and the underlying measurement space is also continuous. We extend our previous hierarchical decomposition approach based on performance bounds to this problem and develop novel implementations of Stochastic Dynamic Programming (SDP) techniques to solve this problem. Our algorithms are nearly two orders of magnitude faster than previously proposed approaches and yield solutions of comparable quality. For supervisory control, we discuss how human operators can work with and augment robotic teams performing these tasks. Our focus is on how tasks are partitioned among teams of robots and how a human operator can make intelligent decisions for task partitioning. We explore these questions through the design of a game that involves robot automata controlled by our algorithms and a human supervisor that partitions tasks based on different levels of support information. This game can be used with human subject experiments to explore the effect of information on quality of supervisory control.

Sequential search leads to faster, more efficient fragment-based de novo protein structure prediction.

PubMed

de Oliveira, Saulo H P; Law, Eleanor C; Shi, Jiye; Deane, Charlotte M

2018-04-01

Most current de novo structure prediction methods randomly sample protein conformations and thus require large amounts of computational resource. Here, we consider a sequential sampling strategy, building on ideas from recent experimental work which shows that many proteins fold cotranslationally. We have investigated whether a pseudo-greedy search approach, which begins sequentially from one of the termini, can improve the performance and accuracy of de novo protein structure prediction. We observed that our sequential approach converges when fewer than 20 000 decoys have been produced, fewer than commonly expected. Using our software, SAINT2, we also compared the run time and quality of models produced in a sequential fashion against a standard, non-sequential approach. Sequential prediction produces an individual decoy 1.5-2.5 times faster than non-sequential prediction. When considering the quality of the best model, sequential prediction led to a better model being produced for 31 out of 41 soluble protein validation cases and for 18 out of 24 transmembrane protein cases. Correct models (TM-Score > 0.5) were produced for 29 of these cases by the sequential mode and for only 22 by the non-sequential mode. Our comparison reveals that a sequential search strategy can be used to drastically reduce computational time of de novo protein structure prediction and improve accuracy. Data are available for download from: http://opig.stats.ox.ac.uk/resources. SAINT2 is available for download from: https://github.com/sauloho/SAINT2. saulo.deoliveira@dtc.ox.ac.uk. Supplementary data are available at Bioinformatics online.

Training eye movements for visual search in individuals with macular degeneration

PubMed Central

Janssen, Christian P.; Verghese, Preeti

2016-01-01

We report a method to train individuals with central field loss due to macular degeneration to improve the efficiency of visual search. Our method requires participants to make a same/different judgment on two simple silhouettes. One silhouette is presented in an area that falls within the binocular scotoma while they are fixating the center of the screen with their preferred retinal locus (PRL); the other silhouette is presented diametrically opposite within the intact visual field. Over the course of 480 trials (approximately 6 hr), we gradually reduced the amount of time that participants have to make a saccade and judge the similarity of stimuli. This requires that they direct their PRL first toward the stimulus that is initially hidden behind the scotoma. Results from nine participants show that all participants could complete the task faster with training without sacrificing accuracy on the same/different judgment task. Although a majority of participants were able to direct their PRL toward the initially hidden stimulus, the ability to do so varied between participants. Specifically, six of nine participants made faster saccades with training. A smaller set (four of nine) made accurate saccades inside or close to the target area and retained this strategy 2 to 3 months after training. Subjective reports suggest that training increased awareness of the scotoma location for some individuals. However, training did not transfer to a different visual search task. Nevertheless, our study suggests that increasing scotoma awareness and training participants to look toward their scotoma may help them acquire missing information. PMID:28027382

Failures of Perception in the Low-Prevalence Effect: Evidence From Active and Passive Visual Search

PubMed Central

Hout, Michael C.; Walenchok, Stephen C.; Goldinger, Stephen D.; Wolfe, Jeremy M.

2017-01-01

In visual search, rare targets are missed disproportionately often. This low-prevalence effect (LPE) is a robust problem with demonstrable societal consequences. What is the source of the LPE? Is it a perceptual bias against rare targets or a later process, such as premature search termination or motor response errors? In 4 experiments, we examined the LPE using standard visual search (with eye tracking) and 2 variants of rapid serial visual presentation (RSVP) in which observers made present/absent decisions after sequences ended. In all experiments, observers looked for 2 target categories (teddy bear and butterfly) simultaneously. To minimize simple motor errors, caused by repetitive absent responses, we held overall target prevalence at 50%, with 1 low-prevalence and 1 high-prevalence target type. Across conditions, observers either searched for targets among other real-world objects or searched for specific bears or butterflies among within-category distractors. We report 4 main results: (a) In standard search, high-prevalence targets were found more quickly and accurately than low-prevalence targets. (b) The LPE persisted in RSVP search, even though observers never terminated search on their own. (c) Eye-tracking analyses showed that high-prevalence targets elicited better attentional guidance and faster perceptual decisions. And (d) even when observers looked directly at low-prevalence targets, they often (12%–34% of trials) failed to detect them. These results strongly argue that low-prevalence misses represent failures of perception when early search termination or motor errors are controlled. PMID:25915073

In search of the emotional face: anger versus happiness superiority in visual search.

PubMed

Savage, Ruth A; Lipp, Ottmar V; Craig, Belinda M; Becker, Stefanie I; Horstmann, Gernot

2013-08-01

Previous research has provided inconsistent results regarding visual search for emotional faces, yielding evidence for either anger superiority (i.e., more efficient search for angry faces) or happiness superiority effects (i.e., more efficient search for happy faces), suggesting that these results do not reflect on emotional expression, but on emotion (un-)related low-level perceptual features. The present study investigated possible factors mediating anger/happiness superiority effects; specifically search strategy (fixed vs. variable target search; Experiment 1), stimulus choice (Nimstim database vs. Ekman & Friesen database; Experiments 1 and 2), and emotional intensity (Experiment 3 and 3a). Angry faces were found faster than happy faces regardless of search strategy using faces from the Nimstim database (Experiment 1). By contrast, a happiness superiority effect was evident in Experiment 2 when using faces from the Ekman and Friesen database. Experiment 3 employed angry, happy, and exuberant expressions (Nimstim database) and yielded anger and happiness superiority effects, respectively, highlighting the importance of the choice of stimulus materials. Ratings of the stimulus materials collected in Experiment 3a indicate that differences in perceived emotional intensity, pleasantness, or arousal do not account for differences in search efficiency. Across three studies, the current investigation indicates that prior reports of anger or happiness superiority effects in visual search are likely to reflect on low-level visual features associated with the stimulus materials used, rather than on emotion. PsycINFO Database Record (c) 2013 APA, all rights reserved.

Search time critically depends on irrelevant subset size in visual search.

PubMed

Benjamins, Jeroen S; Hooge, Ignace T C; van Elst, Jacco C; Wertheim, Alexander H; Verstraten, Frans A J

2009-02-01

In order for our visual system to deal with the massive amount of sensory input, some of this input is discarded, while other parts are processed [Wolfe, J. M. (1994). Guided search 2.0: a revised model of visual search. Psychonomic Bulletin and Review, 1, 202-238]. From the visual search literature it is unclear how well one set of items can be selected that differs in only one feature from target (a 1F set), while another set of items can be ignored that differs in two features from target (a 2F set). We systematically varied the percentage of 2F non-targets to determine the contribution of these non-targets to search behaviour. Increasing the percentage 2F non-targets, that have to be ignored, was expected to result in increasingly faster search, since it decreases the size of 1F set that has to be searched. Observers searched large displays for a target in the 1F set with a variable percentage of 2F non-targets. Interestingly, when the search displays contained 5% 2F non-targets, the search time was longer compared to the search time in other conditions. This effect of 2F non-targets on performance was independent of set size. An inspection of the saccades revealed that saccade target selection did not contribute to the longer search times in displays with 5% 2F non-targets. Occurrence of longer search times in displays containing 5% 2F non-targets might be attributed to covert processes related to visual analysis of the fixated part of the display. Apparently, visual search performance critically depends on the percentage of irrelevant 2F non-targets.

No attentional capture from invisible flicker

PubMed Central

Alais, David; Locke, Shannon M.; Leung, Johahn; Van der Burg, Erik

2016-01-01

We tested whether fast flicker can capture attention using eight flicker frequencies from 20–96 Hz, including several too high to be perceived (>50 Hz). Using a 480 Hz visual display rate, we presented smoothly sampled sinusoidal temporal modulations at: 20, 30, 40, 48, 60, 69, 80, and 96 Hz. We first established flicker detection rates for each frequency. Performance was at or near ceiling until 48 Hz and dropped sharply to chance level at 60 Hz and above. We then presented the same flickering stimuli as pre-cues in a visual search task containing five elements. Flicker location varied randomly and was therefore congruent with target location on 20% of trials. Comparing congruent and incongruent trials revealed a very strong congruency effect (faster search for cued targets) for all detectable frequencies (20–48 Hz) but no effect for faster flicker rates that were detected at chance. This pattern of results (obtained with brief flicker cues: 58 ms) was replicated for long flicker cues (1000 ms) intended to allow for entrainment to the flicker frequency. These results indicate that only visible flicker serves as an exogenous attentional cue and that flicker rates too high to be perceived are completely ineffective. PMID:27377759

Simrank: Rapid and sensitive general-purpose k-mer search tool

PubMed Central

2011-01-01

Background Terabyte-scale collections of string-encoded data are expected from consortia efforts such as the Human Microbiome Project http://nihroadmap.nih.gov/hmp. Intra- and inter-project data similarity searches are enabled by rapid k-mer matching strategies. Software applications for sequence database partitioning, guide tree estimation, molecular classification and alignment acceleration have benefited from embedded k-mer searches as sub-routines. However, a rapid, general-purpose, open-source, flexible, stand-alone k-mer tool has not been available. Results Here we present a stand-alone utility, Simrank, which allows users to rapidly identify database strings the most similar to query strings. Performance testing of Simrank and related tools against DNA, RNA, protein and human-languages found Simrank 10X to 928X faster depending on the dataset. Conclusions Simrank provides molecular ecologists with a high-throughput, open source choice for comparing large sequence sets to find similarity. PMID:21524302

Evaluation of a visual layering methodology for colour coding control room displays.

PubMed

Van Laar, Darren; Deshe, Ofer

2002-07-01

Eighteen people participated in an experiment in which they were asked to search for targets on control room like displays which had been produced using three different coding methods. The monochrome coding method displayed the information in black and white only, the maximally discriminable method contained colours chosen for their high perceptual discriminability, the visual layers method contained colours developed from psychological and cartographic principles which grouped information into a perceptual hierarchy. The visual layers method produced significantly faster search times than the other two coding methods which did not differ significantly from each other. Search time also differed significantly for presentation order and for the method x order interaction. There was no significant difference between the methods in the number of errors made. Participants clearly preferred the visual layers coding method. Proposals are made for the design of experiments to further test and develop the visual layers colour coding methodology.

Characteristic sounds facilitate visual search

PubMed Central

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

2009-01-01

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

Resolution enhancement of low-quality videos using a high-resolution frame

NASA Astrophysics Data System (ADS)

Pham, Tuan Q.; van Vliet, Lucas J.; Schutte, Klamer

2006-01-01

This paper proposes an example-based Super-Resolution (SR) algorithm of compressed videos in the Discrete Cosine Transform (DCT) domain. Input to the system is a Low-Resolution (LR) compressed video together with a High-Resolution (HR) still image of similar content. Using a training set of corresponding LR-HR pairs of image patches from the HR still image, high-frequency details are transferred from the HR source to the LR video. The DCT-domain algorithm is much faster than example-based SR in spatial domain 6 because of a reduction in search dimensionality, which is a direct result of the compact and uncorrelated DCT representation. Fast searching techniques like tree-structure vector quantization 16 and coherence search1 are also key to the improved efficiency. Preliminary results on MJPEG sequence show promising result of the DCT-domain SR synthesis approach.

Spatially localized motion aftereffect disappears faster from awareness when selectively attended to according to its direction.

PubMed

Murd, Carolina; Bachmann, Talis

2011-05-25

In searching for the target-afterimage patch among spatially separate alternatives of color-afterimages the target fades from awareness before its competitors (Bachmann, T., & Murd, C. (2010). Covert spatial attention in search for the location of a color-afterimage patch speeds up its decay from awareness: Introducing a method useful for the study of neural correlates of visual awareness. Vision Research 50, 1048-1053). In an analogous study presented here we show that a similar effect is obtained when a target spatial location specified according to the direction of motion aftereffect within it is searched by covert top-down attention. The adverse effect of selective attention on the duration of awareness of sensory qualiae known earlier to be present for color and periodic spatial contrast is extended also to sensory channels carrying motion information. Copyright © 2011 Elsevier Ltd. All rights reserved.

A fuzzy-match search engine for physician directories.

PubMed

Rastegar-Mojarad, Majid; Kadolph, Christopher; Ye, Zhan; Wall, Daniel; Murali, Narayana; Lin, Simon

2014-11-04

A search engine to find physicians' information is a basic but crucial function of a health care provider's website. Inefficient search engines, which return no results or incorrect results, can lead to patient frustration and potential customer loss. A search engine that can handle misspellings and spelling variations of names is needed, as the United States (US) has culturally, racially, and ethnically diverse names. The Marshfield Clinic website provides a search engine for users to search for physicians' names. The current search engine provides an auto-completion function, but it requires an exact match. We observed that 26% of all searches yielded no results. The goal was to design a fuzzy-match algorithm to aid users in finding physicians easier and faster. Instead of an exact match search, we used a fuzzy algorithm to find similar matches for searched terms. In the algorithm, we solved three types of search engine failures: "Typographic", "Phonetic spelling variation", and "Nickname". To solve these mismatches, we used a customized Levenshtein distance calculation that incorporated Soundex coding and a lookup table of nicknames derived from US census data. Using the "Challenge Data Set of Marshfield Physician Names," we evaluated the accuracy of fuzzy-match engine-top ten (90%) and compared it with exact match (0%), Soundex (24%), Levenshtein distance (59%), and fuzzy-match engine-top one (71%). We designed, created a reference implementation, and evaluated a fuzzy-match search engine for physician directories. The open-source code is available at the codeplex website and a reference implementation is available for demonstration at the datamarsh website.

Enhanced identification of eligibility for depression research using an electronic medical record search engine.

PubMed

Seyfried, Lisa; Hanauer, David A; Nease, Donald; Albeiruti, Rashad; Kavanagh, Janet; Kales, Helen C

2009-12-01

Electronic medical records (EMRs) have become part of daily practice for many physicians. Attempts have been made to apply electronic search engine technology to speed EMR review. This was a prospective, observational study to compare the speed and clinical accuracy of a medical record search engine vs. manual review of the EMR. Three raters reviewed 49 cases in the EMR to screen for eligibility in a depression study using the electronic medical record search engine (EMERSE). One week later raters received a scrambled set of the same patients including 9 distractor cases, and used manual EMR review to determine eligibility. For both methods, accuracy was assessed for the original 49 cases by comparison with a gold standard rater. Use of EMERSE resulted in considerable time savings; chart reviews using EMERSE were significantly faster than traditional manual review (p=0.03). The percent agreement of raters with the gold standard (e.g. concurrent validity) using either EMERSE or manual review was not significantly different. Using a search engine optimized for finding clinical information in the free-text sections of the EMR can provide significant time savings while preserving clinical accuracy. The major power of this search engine is not from a more advanced and sophisticated search algorithm, but rather from a user interface designed explicitly to help users search the entire medical record in a way that protects health information.

Randomized trial for answers to clinical questions: evaluating a pre-appraised versus a MEDLINE search protocol.

PubMed

Patel, Manesh R; Schardt, Connie M; Sanders, Linda L; Keitz, Sheri A

2006-10-01

The paper compares the speed, validity, and applicability of two different protocols for searching the primary medical literature. A randomized trial involving medicine residents was performed. An inpatient general medicine rotation was used. Thirty-two internal medicine residents were block randomized into four groups of eight. Success rate of each search protocol was measured by perceived search time, number of questions answered, and proportion of articles that were applicable and valid. Residents randomized to the MEDLINE-first (protocol A) group searched 120 questions, and residents randomized to the MEDLINE-last (protocol B) searched 133 questions. In protocol A, 104 answers (86.7%) and, in protocol B, 117 answers (88%) were found to clinical questions. In protocol A, residents reported that 26 (25.2%) of the answers were obtained quickly or rated as "fast" (<5 minutes) as opposed to 55 (51.9%) in protocol B, (P = 0.0004). A subset of questions and articles (n = 79) were reviewed by faculty who found that both protocols identified similar numbers of answer articles that addressed the questions and were felt to be valid using critical appraisal criteria. For resident-generated clinical questions, both protocols produced a similarly high percentage of applicable and valid articles. The MEDLINE-last search protocol was perceived to be faster. However, in the MEDLINE-last protocol, a significant portion of questions (23%) still required searching MEDLINE to find an answer.

Enhanced Identification of Eligibility for Depression Research Using an Electronic Medical Record Search Engine

PubMed Central

Seyfried, Lisa; Hanauer, David; Nease, Donald; Albeiruti, Rashad; Kavanagh, Janet; Kales, Helen C.

2009-01-01

Purpose Electronic medical records (EMR) have become part of daily practice for many physicians. Attempts have been made to apply electronic search engine technology to speed EMR review. This was a prospective, observational study to compare the speed and accuracy of electronic search engine vs. manual review of the EMR. Methods Three raters reviewed 49 cases in the EMR to screen for eligibility in a depression study using the electronic search engine (EMERSE). One week later raters received a scrambled set of the same patients including 9 distractor cases, and used manual EMR review to determine eligibility. For both methods, accuracy was assessed for the original 49 cases by comparison with a gold standard rater. Results Use of EMERSE resulted in considerable time savings; chart reviews using EMERSE were significantly faster than traditional manual review (p=0.03). The percent agreement of raters with the gold standard (e.g. concurrent validity) using either EMERSE or manual review was not significantly different. Conclusions Using a search engine optimized for finding clinical information in the free-text sections of the EMR can provide significant time savings while preserving reliability. The major power of this search engine is not from a more advanced and sophisticated search algorithm, but rather from a user interface designed explicitly to help users search the entire medical record in a way that protects health information. PMID:19560962

Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns

PubMed Central

2013-01-01

Background It is well known that the search for homologous RNAs is more effective if both sequence and structure information is incorporated into the search. However, current tools for searching with RNA sequence-structure patterns cannot fully handle mutations occurring on both these levels or are simply not fast enough for searching large sequence databases because of the high computational costs of the underlying sequence-structure alignment problem. Results We present new fast index-based and online algorithms for approximate matching of RNA sequence-structure patterns supporting a full set of edit operations on single bases and base pairs. Our methods efficiently compute semi-global alignments of structural RNA patterns and substrings of the target sequence whose costs satisfy a user-defined sequence-structure edit distance threshold. For this purpose, we introduce a new computing scheme to optimally reuse the entries of the required dynamic programming matrices for all substrings and combine it with a technique for avoiding the alignment computation of non-matching substrings. Our new index-based methods exploit suffix arrays preprocessed from the target database and achieve running times that are sublinear in the size of the searched sequences. To support the description of RNA molecules that fold into complex secondary structures with multiple ordered sequence-structure patterns, we use fast algorithms for the local or global chaining of approximate sequence-structure pattern matches. The chaining step removes spurious matches from the set of intermediate results, in particular of patterns with little specificity. In benchmark experiments on the Rfam database, our improved online algorithm is faster than the best previous method by up to factor 45. Our best new index-based algorithm achieves a speedup of factor 560. Conclusions The presented methods achieve considerable speedups compared to the best previous method. This, together with the expected sublinear running time of the presented index-based algorithms, allows for the first time approximate matching of RNA sequence-structure patterns in large sequence databases. Beyond the algorithmic contributions, we provide with RaligNAtor a robust and well documented open-source software package implementing the algorithms presented in this manuscript. The RaligNAtor software is available at http://www.zbh.uni-hamburg.de/ralignator. PMID:23865810

Cognitive processes facilitated by contextual cueing: evidence from event-related brain potentials.

PubMed

Schankin, Andrea; Schubö, Anna

2009-05-01

Finding a target in repeated search displays is faster than finding the same target in novel ones (contextual cueing). It is assumed that the visual context (the arrangement of the distracting objects) is used to guide attention efficiently to the target location. Alternatively, other factors, e.g., facilitation in early visual processing or in response selection, may play a role as well. In a contextual cueing experiment, participant's electrophysiological brain activity was recorded. Participants identified the target faster and more accurately in repeatedly presented displays. In this condition, the N2pc, a component reflecting the allocation of visual-spatial attention, was enhanced, indicating that attention was allocated more efficiently to those targets. However, also response-related processes, reflected by the LRP, were facilitated, indicating that guidance of attention cannot account for the entire contextual cueing benefit.

Is There a Standard Default Keyword Operator? A Bibliometric Analysis of Processing Options Chosen by Libraries To Execute Keyword Searches in Online Public Access Catalogs.

ERIC Educational Resources Information Center

Klein, Gary M.

1994-01-01

Online public access catalogs from 67 libraries using NOTIS software were searched using Internet connections to determine the positional operators selected as the default keyword operator on each catalog. Results indicate the lack of a processing standard for keyword searches. Five tables provide information. (Author/AEF)

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

Kurt Derr

Mobile Ad hoc NETworks (MANETs) are distributed self-organizing networks that can change locations and configure themselves on the fly. This paper focuses on an algorithmic approach for the deployment of a MANET within an enclosed area, such as a building in a disaster scenario, which can provide a robust communication infrastructure for search and rescue operations. While a virtual spring mesh (VSM) algorithm provides scalable, self-organizing, and fault-tolerant capabilities required by aMANET, the VSM lacks the MANET's capabilities of deployment mechanisms for blanket coverage of an area and does not provide an obstacle avoidance mechanism. This paper presents a newmore » technique, an extended VSM (EVSM) algorithm that provides the following novelties: (1) new control laws for exploration and expansion to provide blanket coverage, (2) virtual adaptive springs enabling the mesh to expand as necessary, (3) adapts to communications disturbances by varying the density and movement of mobile nodes, and (4) new metrics to assess the performance of the EVSM algorithm. Simulation results show that EVSM provides up to 16% more coverage and is 3.5 times faster than VSM in environments with eight obstacles.« less

49 CFR 7.44 - Services performed without charge or at a reduced charge.

Code of Federal Regulations, 2013 CFR

2013-10-01

... charged to any requestor making a request under subpart C of this part for the first two hours of search... search is required two hours of search time will be considered spent when the hourly costs of operating the central processing unit used to perform the search added to the computer operator's salary cost...

49 CFR 7.44 - Services performed without charge or at a reduced charge.

Code of Federal Regulations, 2011 CFR

2011-10-01

... charged to any requestor making a request under subpart C of this part for the first two hours of search... search is required two hours of search time will be considered spent when the hourly costs of operating the central processing unit used to perform the search added to the computer operator's salary cost...

49 CFR 7.44 - Services performed without charge or at a reduced charge.

Code of Federal Regulations, 2012 CFR

2012-10-01

... charged to any requestor making a request under subpart C of this part for the first two hours of search... search is required two hours of search time will be considered spent when the hourly costs of operating the central processing unit used to perform the search added to the computer operator's salary cost...

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

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

Sheng, Zheng, E-mail: 19994035@sina.com; Wang, Jun; Zhou, Bihua

2014-03-15

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

Properties of heuristic search strategies

NASA Technical Reports Server (NTRS)

Vanderbrug, G. J.

1973-01-01

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

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

Characterizing the Habitable Zone Planets of Kepler Stars

NASA Astrophysics Data System (ADS)

Fischer, Debra

Planet Hunters (PH) is a well-established and successful web interface that allows citizen scientists to search for transiting planets in the NASA Kepler public archive data. Over the past 3 years, our users have made more than 20 million light curve classifications. We now have more than 300,000 users around the world. However, more than half of the Kepler data has not yet been displayed to our volunteers. In June 2014 we are launching Planet Hunters v2.0. The backend of the site has been completely redesigned. The new website is more intuitive and faster; we have improved the real-time weighting algorithm that assigns transit scores for faster and more accurate extraction of the transit events from the database. With Planet Hunters v2.0, we expect that assessments will be ten times faster, so that we have the opportunity to complete the classifications for the backlog of Kepler light curve in the next three years. There are three goals for this project. First, we will data-mine the PH classifications to search for long period planets with fewer than 5 transit events. We have demonstrated that our volunteers are efficient at detecting planets with long periods and radii greater than a few REARTH. This region of parameter space is optimal for characterizing larger planets orbiting close to the habitable zone. To build upon the citizen science efforts, we will model the light curves, search for evidence of false positives, and contribute observations of stellar spectra to refine both the stellar and orbital parameters. Second, we will carry out a careful analysis of the fraction of transits that are missed (a function of planet radius and orbital period) to derive observational incompleteness factors. The incompleteness factors will be combined with geometrical detection factors to assess the planet occurrence rate for wide separations. This is a unique scientific contribution current studies of planet occurrence rate are either restricted to orbital periods shorter than 100 days or they use extrapolation to estimate planet occurrence rates beyond 100 days. The new detections of transit candidates at wider separations and the incompleteness analysis will be used to carry out an analysis of the architecture of exoplanetary systems from 1 5 AU. We are synthesizing a statistical description with information from short-period Kepler transits, the longer period Kepler transit candidates from this proposal, a completeness analysis of radial velocity data, and statistical information from microlensing. While our architecture analysis will only sketch out the bare bones of planetary systems (massive or large planets), this is still a novel analysis that may point to the location of rocky planets if packed planetary systems prevail. Finally, we will expand our guest scientist program for serendipitous discoveries. We have already partnered with scientists who are searching for cataclysmic variables, heartbeat stars, and exomoons. Our undergrad students have already carried out summer research as guest scientists to characterize inflated jupiters, search for Trojan planets, and to search for microlensing events.

Locating underwater objects. [technology transfer

NASA Technical Reports Server (NTRS)

Grice, C. F.

1974-01-01

Underwater search operations are considered to be engineering and operational problems. A process for proper definition of the problem and selection of instrumentation and operational procedures is described. An outline of underwater search instrumentation and techniques is given.

Experimental system for measurement of radiologists' performance by visual search task.

PubMed

Maeda, Eriko; Yoshikawa, Takeharu; Nakashima, Ryoichi; Kobayashi, Kazufumi; Yokosawa, Kazuhiko; Hayashi, Naoto; Masutani, Yoshitaka; Yoshioka, Naoki; Akahane, Masaaki; Ohtomo, Kuni

2013-01-01

Detective performance of radiologists for "obvious" targets should be evaluated by visual search task instead of ROC analysis, but visual task have not been applied to radiology studies. The aim of this study was to set up an environment that allows visual search task in radiology, to evaluate its feasibility, and to preliminarily investigate the effect of career on the performance. In a darkroom, ten radiologists were asked to answer the type of lesion by pressing buttons, when images without lesions, with bulla, ground-glass nodule, and solid nodule were randomly presented on a display. Differences in accuracy and reaction times depending on board certification were investigated. The visual search task was successfully and feasibly performed. Radiologists were found to have high sensitivity, specificity, positive predictive values and negative predictive values in non-board and board groups. Reaction time was under 1 second for all target types in both groups. Board radiologists were significantly faster in answering for bulla, but there were no significant differences for other targets and values. We developed an experimental system that allows visual search experiment in radiology. Reaction time for detection of bulla was shortened with experience.

Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

PubMed

Mei, Gang; Xu, Nengxiong; Xu, Liangliang

2016-01-01

This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.

Signals of threat do not capture, but prioritize, attention: a conditioning approach.

PubMed

Notebaert, Lies; Crombez, Geert; Van Damme, Stefaan; De Houwer, Jan; Theeuwes, Jan

2011-02-01

Research suggests that threatening information captures attention more rapidly than neutral information. However, in most studies threat stimuli differ perceptually from neutral stimuli and are instrumental to perform the task, leaving the question unanswered whether threat is sufficient to capture attention. In experiment 1, we designed a visual search task with stimuli of equal salience (colored circles) that have the potential to lead to efficient search (10 ms/item). In experiment 2, one of the colors (conditioned stimulus, CS+) was made threatening by means of fear conditioning. Participants responded to a target presented in one of the circles. Overall, the search was faster on congruent trials (where the target was presented in the CS+) than on baseline trials (where the CS + was absent). Furthermore, the search was slower on incongruent trials (where the target was presented in another color than the CS+) than on baseline trials. The search on congruent trials was affected by set size (90 ms/item), but to a lesser extent than on baseline trials (105 ms/item). We conclude that threat prioritizes, but does not capture attention. PsycINFO Database Record (c) 2011 APA, all rights reserved.

Analyzing locomotion synthesis with feature-based motion graphs.

PubMed

Mahmudi, Mentar; Kallmann, Marcelo

2013-05-01

We propose feature-based motion graphs for realistic locomotion synthesis among obstacles. Among several advantages, feature-based motion graphs achieve improved results in search queries, eliminate the need of postprocessing for foot skating removal, and reduce the computational requirements in comparison to traditional motion graphs. Our contributions are threefold. First, we show that choosing transitions based on relevant features significantly reduces graph construction time and leads to improved search performances. Second, we employ a fast channel search method that confines the motion graph search to a free channel with guaranteed clearance among obstacles, achieving faster and improved results that avoid expensive collision checking. Lastly, we present a motion deformation model based on Inverse Kinematics applied over the transitions of a solution branch. Each transition is assigned a continuous deformation range that does not exceed the original transition cost threshold specified by the user for the graph construction. The obtained deformation improves the reachability of the feature-based motion graph and in turn also reduces the time spent during search. The results obtained by the proposed methods are evaluated and quantified, and they demonstrate significant improvements in comparison to traditional motion graph techniques.

Fast parallel tandem mass spectral library searching using GPU hardware acceleration.

PubMed

Baumgardner, Lydia Ashleigh; Shanmugam, Avinash Kumar; Lam, Henry; Eng, Jimmy K; Martin, Daniel B

2011-06-03

Mass spectrometry-based proteomics is a maturing discipline of biologic research that is experiencing substantial growth. Instrumentation has steadily improved over time with the advent of faster and more sensitive instruments collecting ever larger data files. Consequently, the computational process of matching a peptide fragmentation pattern to its sequence, traditionally accomplished by sequence database searching and more recently also by spectral library searching, has become a bottleneck in many mass spectrometry experiments. In both of these methods, the main rate-limiting step is the comparison of an acquired spectrum with all potential matches from a spectral library or sequence database. This is a highly parallelizable process because the core computational element can be represented as a simple but arithmetically intense multiplication of two vectors. In this paper, we present a proof of concept project taking advantage of the massively parallel computing available on graphics processing units (GPUs) to distribute and accelerate the process of spectral assignment using spectral library searching. This program, which we have named FastPaSS (for Fast Parallelized Spectral Searching), is implemented in CUDA (Compute Unified Device Architecture) from NVIDIA, which allows direct access to the processors in an NVIDIA GPU. Our efforts demonstrate the feasibility of GPU computing for spectral assignment, through implementation of the validated spectral searching algorithm SpectraST in the CUDA environment.

Electrophysiological evidence that top-down knowledge controls working memory processing for subsequent visual search.

PubMed

Kawashima, Tomoya; Matsumoto, Eriko

2016-03-23

Items in working memory guide visual attention toward a memory-matching object. Recent studies have shown that when searching for an object this attentional guidance can be modulated by knowing the probability that the target will match an item in working memory. Here, we recorded the P3 and contralateral delay activity to investigate how top-down knowledge controls the processing of working memory items. Participants performed memory task (recognition only) and memory-or-search task (recognition or visual search) in which they were asked to maintain two colored oriented bars in working memory. For visual search, we manipulated the probability that target had the same color as memorized items (0, 50, or 100%). Participants knew the probabilities before the task. Target detection in 100% match condition was faster than that in 50% match condition, indicating that participants used their knowledge of the probabilities. We found that the P3 amplitude in 100% condition was larger than in other conditions and that contralateral delay activity amplitude did not vary across conditions. These results suggest that more attention was allocated to the memory items when observers knew in advance that their color would likely match a target. This led to better search performance despite using qualitatively equal working memory representations.

Modernizing Electricity Delivery

EPA Pesticide Factsheets

Explains how modern grid, or smart grid, investments can enable grid operators to respond faster to changes in grid conditions and allow for two-way communication between utilities and electricity end-users.

Human Factors Integration Requirements for Armoured Fighting Vehicles (AFVs). Part 3: Literature Review

DTIC Science & Technology

1999-10-01

whole task trarning formats and learner and program control strategies were investigated separately in two experiments usmg a microcomputer based... Strategy (CATS). The report contains a review and annotated bibliography on 39 documents that address tank gunnery training device effectiveness. It also...participants feH the training strategy was usually about right no safety or health hazards were noted; manual search was faster in detecting targets that

Development of a Sonar Oil Tanker Cargo Measurement System.

DTIC Science & Technology

1980-08-01

used at any one time is dependent upon the capacity of the stripping system. The operation is conducted to strip at least as fast , if not faster, than...operational mode, measure the average value and variance of the thickness of an oil layer on an intermit - tent sampling basis. Laboratory testing

Learning in fully recurrent neural networks by approaching tangent planes to constraint surfaces.

PubMed

May, P; Zhou, E; Lee, C W

2012-10-01

In this paper we present a new variant of the online real time recurrent learning algorithm proposed by Williams and Zipser (1989). Whilst the original algorithm utilises gradient information to guide the search towards the minimum training error, it is very slow in most applications and often gets stuck in local minima of the search space. It is also sensitive to the choice of learning rate and requires careful tuning. The new variant adjusts weights by moving to the tangent planes to constraint surfaces. It is simple to implement and requires no parameters to be set manually. Experimental results show that this new algorithm gives significantly faster convergence whilst avoiding problems like local minima. Copyright © 2012 Elsevier Ltd. All rights reserved.

Perceptual integration of motion and form information: evidence of parallel-continuous processing.

PubMed

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

2000-04-01

In three visual search experiments, the processes involved in the efficient detection of motion-form conjunction targets were investigated. Experiment 1 was designed to estimate the relative contributions of stationary and moving nontargets to the search rate. Search rates were primarily determined by the number of moving nontargets; stationary nontargets sharing the target form also exerted a significant effect, but this was only about half as strong as that of moving nontargets; stationary nontargets not sharing the target form had little influence. In Experiments 2 and 3, the effects of display factors influencing the visual (form) quality of moving items (movement speed and item size) were examined. Increasing the speed of the moving items (> 1.5 degrees/sec) facilitated target detection when the task required segregation of the moving from the stationary items. When no segregation was necessary, increasing the movement speed impaired performance: With large display items, motion speed had little effect on target detection, but with small items, search efficiency declined when items moved faster than 1.5 degrees/sec. This pattern indicates that moving nontargets exert a strong effect on the search rate (Experiment 1) because of the loss of visual quality for moving items above a certain movement speed. A parallel-continuous processing account of motion-form conjunction search is proposed, which combines aspects of Guided Search (Wolfe, 1994) and attentional engagement theory (Duncan & Humphreys, 1989).

Protein structural similarity search by Ramachandran codes

PubMed Central

Lo, Wei-Cheng; Huang, Po-Jung; Chang, Chih-Hung; Lyu, Ping-Chiang

2007-01-01

Background Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed, several methods have been designed to reduce three-dimensional protein structures to one-dimensional text strings that are then analyzed by traditional sequence alignment methods; however, the accuracy is usually sacrificed and the speed is still unable to match sequence similarity search tools. Here, we aimed to improve the linear encoding methodology and develop efficient search tools that can rapidly retrieve structural homologs from large protein databases. Results We propose a new linear encoding method, SARST (Structural similarity search Aided by Ramachandran Sequential Transformation). SARST transforms protein structures into text strings through a Ramachandran map organized by nearest-neighbor clustering and uses a regenerative approach to produce substitution matrices. Then, classical sequence similarity search methods can be applied to the structural similarity search. Its accuracy is similar to Combinatorial Extension (CE) and works over 243,000 times faster, searching 34,000 proteins in 0.34 sec with a 3.2-GHz CPU. SARST provides statistically meaningful expectation values to assess the retrieved information. It has been implemented into a web service and a stand-alone Java program that is able to run on many different platforms. Conclusion As a database search method, SARST can rapidly distinguish high from low similarities and efficiently retrieve homologous structures. It demonstrates that the easily accessible linear encoding methodology has the potential to serve as a foundation for efficient protein structural similarity search tools. These search tools are supposed applicable to automated and high-throughput functional annotations or predictions for the ever increasing number of published protein structures in this post-genomic era. PMID:17716377

Cortical Mechanisms of Prioritizing Selection for Rejection in Visual Search.

PubMed

Donohue, Sarah E; Bartsch, Mandy V; Heinze, Hans-Jochen; Schoenfeld, Mircea A; Hopf, Jens-Max

2018-05-16

In visual search, the more one knows about a target, the faster one can find it. Surprisingly, target identification is also faster with knowledge about distractor-features. The latter is paradoxical, as it implies that to avoid the selection of an item, the item must somehow be selected to some degree. This conundrum has been termed the "ignoring paradox", and, to date, little is known about how the brain resolves it. Here, in data from four experiments using neuromagnetic brain recordings in male and female humans, we provide evidence that this paradox is resolved by giving distracting information priority in cortical processing. This attentional priority to distractors manifests as an enhanced early neuromagnetic index, which occurs before target-related processing, and regardless of distractor predictability. It is most pronounced on trials for which a response rapidly occurred, and is followed by a suppression of the distracting information. These observations together suggest that in visual search items cannot be ignored without first being selected. SIGNIFICANCE STATEMENT How can we ignore distracting stimuli in our environment? To do this successfully, a logical hypothesis is that as few neural resources as possible should be devoted to distractor processing. Yet, to avoid devoting resources to a distractor, the brain must somehow mark what to avoid; this is a philosophical problem, which has been termed the "ignoring paradox" or "white bear phenomenon". Here, we use MEG recordings to determine how the human brain resolves this paradox. Our data show that distractors are not only processed, they are given temporal priority, with the brain building a robust representation of the to-be-ignored items. Thus, successful suppression of distractors can only be achieved if distractors are first strongly neurally represented. Copyright © 2018 the authors 0270-6474/18/384738-11$15.00/0.

Clinician search behaviors may be influenced by search engine design.

PubMed

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

2010-06-30

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

A systematic review of cognitive decline in dementia with Lewy bodies versus Alzheimer’s disease

PubMed Central

2014-01-01

Introduction The aim of this review was to investigate whether there is a faster cognitive decline in dementia with Lewy bodies (DLB) than in Alzheimer’s disease (AD) over time. Methods PsycINFO and Medline were searched from 1946 to February 2013. A quality rating from 1 to 15 (best) was applied to the included studies. A quantitative meta-analysis was done on studies with mini mental state examination (MMSE) as the outcome measure. Results A total of 18 studies were included. Of these, six (36%) reported significant differences in the rate of cognitive decline. Three studies reported a faster cognitive decline on MMSE in patients with mixed DLB and AD compared to pure forms, whereas two studies reported a faster decline on delayed recall and recognition in AD and one in DLB on verbal fluency. Mean quality scores for studies that did or did not differ were not significantly different. Six studies reported MMSE scores and were included in the meta-analysis, which showed no significant difference in annual decline on MMSE between DLB (mean 3.4) and AD (mean 3.3). Conclusions Our findings do not support the hypothesis of a faster rate of cognitive decline in DLB compared to AD. Future studies should apply recent diagnostic criteria, as well as extensive diagnostic evaluation and ideally autopsy diagnosis. Studies with large enough samples, detailed cognitive tests, at least two years follow up and multivariate statistical analysis are also needed. PMID:25478024

Secondary scintillation yield from GEM and THGEM gaseous electron multipliers for direct dark matter search

NASA Astrophysics Data System (ADS)

Monteiro, C. M. B.; Fernandes, L. M. P.; Veloso, J. F. C. A.; Oliveira, C. A. B.; dos Santos, J. M. F.

2012-07-01

The search for alternatives to PMTs as photosensors in optical TPCs for rare event detection has significantly increased in the last few years. In particular, in view of the next generation large volume detectors, the use of photosensors with lower natural radioactivity, such as large area APDs or GM-APDs, with the additional possibility of sparse surface coverage, triggered the intense study of secondary scintillation production in micropattern electron multipliers, such as GEMs and THGEMs, as alternatives to the commonly used uniform electric field region between two parallel meshes. The much higher scintillation output obtained from the electron avalanches in such microstructures presents an advantage in those situations. The accurate knowledge of the amount of such scintillation is important for correct detector simulation and optimization. It will also serve as a benchmark for software tools developed and/or under development for the calculation of the amount of such scintillation.The secondary scintillation yield, or electroluminescence yield, in the electron avalanches of GEMs and THGEMs operating in gaseous xenon and argon has been determined for different gas pressures. At 1 bar, THGEMs deliver electroluminescence yields that are more than one order of magnitude higher when compared to those achieved in GEMs and two orders of magnitude when compared to those achieved in a uniform field gap. The THGEM electroluminescence yield presents a faster decrease with pressure when comparing to the GEM electroluminescence yield, reaching similar values to what is achieved in GEMs for xenon pressures of 2.5 bar, but still one order of magnitude higher than that produced in a uniform field gap. Another exception is the GEM operating in argon, which presents an electroluminescence yield similar to that produced in a uniform electric field gap, while the THGEM achieves yields that are more than one order of magnitude higher.

Cool Apps: Building Cryospheric Data Applications with Standards-Based Service Oriented Architecture

NASA Astrophysics Data System (ADS)

Oldenburg, J.; Truslove, I.; Collins, J. A.; Liu, M.; Lewis, S.; Brodzik, M.

2012-12-01

The National Snow and Ice Data Center (NSIDC) holds a large collection of cryospheric data, and is involved in a number of informatics research and development projects aimed at improving the discoverability and accessibility of these data. To develop high- quality software in a timely manner, we have adopted a Service- Oriented Architecture (SOA) approach for our core technical infrastructure development. Data services at NSIDC are internally exposed to other tools and applications through standards-based service interfaces. These standards include OAI-PMH (Open Archives Initiative Protocol for Metadata Harvesting), various OGC (Open Geospatial Consortium) standards including WMS (Web Map Service) and WFS (Web Feature Service), ESIP (Federation of Earth Sciences Information Partners) OpenSearch, and NSIDC-defined service endpoints which follow a RESTful architecture. By taking a standards-based approach, we are able to use off-the-shelf tools and libraries to consume, translate and broker these data services, and thus develop applications faster. Additionally, by exposing public interfaces to these services we provide valuable data services to technical collaborators; for example, NASA Reverb (http://reverb.echo.nasa.gov) uses NSIDC's WMS services. Our latest generation of web applications consume these data services directly. The most complete example of this is the Operation IceBridge Data Portal (http://nsidc.org/icebridge/ portal) which depends on many of the aforementioned services, retrieving data in several ways. The maps it displays are obtained through the use of WMS and WFS protocols from a MapServer instance hosted at NSIDC. Links to the scientific data collected on Operation IceBridge campaigns are obtained through ESIP OpenSearch requests service providers that encapsulate our metadata databases. These standards-based web services are also developed at NSIDC and are designed to be used independently of the Portal. This poster provides a visual representation of the relationships described above, with additional details and examples, and more generally outlines the benefits and challenges of this SOA approach.

Visuospatial working memory mediates inhibitory and facilitatory guidance in preview search.

PubMed

Barrett, Doug J K; Shimozaki, Steven S; Jensen, Silke; Zobay, Oliver

2016-10-01

Visual search is faster and more accurate when a subset of distractors is presented before the display containing the target. This "preview benefit" has been attributed to separate inhibitory and facilitatory guidance mechanisms during search. In the preview task the temporal cues thought to elicit inhibition and facilitation provide complementary sources of information about the likely location of the target. In this study, we use a Bayesian observer model to compare sensitivity when the temporal cues eliciting inhibition and facilitation produce complementary, and competing, sources of information. Observers searched for T-shaped targets among L-shaped distractors in 2 standard and 2 preview conditions. In the standard conditions, all the objects in the display appeared at the same time. In the preview conditions, the initial subset of distractors either stayed on the screen or disappeared before the onset of the search display, which contained the target when present. In the latter, the synchronous onset of old and new objects negates the predictive utility of stimulus-driven capture during search. The results indicate observers combine memory-driven inhibition and sensory-driven capture to reduce spatial uncertainty about the target's likely location during search. In the absence of spatially predictive onsets, memory-driven inhibition at old locations persists despite irrelevant sensory change at previewed locations. This result is consistent with a bias toward unattended objects during search via the active suppression of irrelevant capture at previously attended locations. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Enhanced Information Retrieval Using AJAX

NASA Astrophysics Data System (ADS)

Kachhwaha, Rajendra; Rajvanshi, Nitin

2010-11-01

Information Retrieval deals with the representation, storage, organization of, and access to information items. The representation and organization of information items should provide the user with easy access to the information with the rapid development of Internet, large amounts of digitally stored information is readily available on the World Wide Web. This information is so huge that it becomes increasingly difficult and time consuming for the users to find the information relevant to their needs. The explosive growth of information on the Internet has greatly increased the need for information retrieval systems. However, most of the search engines are using conventional information retrieval systems. An information system needs to implement sophisticated pattern matching tools to determine contents at a faster rate. AJAX has recently emerged as the new tool such the of information retrieval process of information retrieval can become fast and information reaches the use at a faster pace as compared to conventional retrieval systems.

Machine-Learning Techniques Applied to Antibacterial Drug Discovery

PubMed Central

Durrant, Jacob D.; Amaro, Rommie E.

2014-01-01

The emergence of drug-resistant bacteria threatens to catapult humanity back to the pre-antibiotic era. Even now, multi-drug-resistant bacterial infections annually result in millions of hospital days, billions in healthcare costs, and, most importantly, tens of thousands of lives lost. As many pharmaceutical companies have abandoned antibiotic development in search of more lucrative therapeutics, academic researchers are uniquely positioned to fill the resulting vacuum. Traditional high-throughput screens and lead-optimization efforts are expensive and labor intensive. Computer-aided drug discovery techniques, which are cheaper and faster, can accelerate the identification of novel antibiotics in an academic setting, leading to improved hit rates and faster transitions to pre-clinical and clinical testing. The current review describes two machine-learning techniques, neural networks and decision trees, that have been used to identify experimentally validated antibiotics. We conclude by describing the future directions of this exciting field. PMID:25521642

A human performance evaluation of graphic symbol-design features.

PubMed

Samet, M G; Geiselman, R E; Landee, B M

1982-06-01

16 subjects learned each of two tactical display symbol sets (conventional symbols and iconic symbols) in turn and were then shown a series of graphic displays containing various symbol configurations. For each display, the subject was asked questions corresponding to different behavioral processes relating to symbol use (identification, search, comparison, pattern recognition). The results indicated that: (a) conventional symbols yielded faster pattern-recognition performance than iconic symbols, and iconic symbols did not yield faster identification than conventional symbols, and (b) the portrayal of additional feature information (through the use of perimeter density or vector projection coding) slowed processing of the core symbol information in four tasks, but certain symbol-design features created less perceptual interference and had greater correspondence with the portrayal of specific tactical concepts than others. The results were discussed in terms of the complexities involved in the selection of symbol design features for use in graphic tactical displays.

Defense.gov Special Report: Guard Responds to Washington Mudslide

Science.gov Websites

Department of Defense Submit Search Guardsmen Respond to Washington Mudslide Disaster A deadly mudslide over a square mile. National Guardsmen have been assisting in search operations. News Stories Guardsmen Improve Health Conditions for Workers While search and rescue operations continue following the March 22

The effect of mood state on visual search times for detecting a target in noise: An application of smartphone technology

PubMed Central

Maekawa, Toru; de Brecht, Matthew; Yamagishi, Noriko

2018-01-01

The study of visual perception has largely been completed without regard to the influence that an individual’s emotional status may have on their performance in visual tasks. However, there is a growing body of evidence to suggest that mood may affect not only creative abilities and interpersonal skills but also the capacity to perform low-level cognitive tasks. Here, we sought to determine whether rudimentary visual search processes are similarly affected by emotion. Specifically, we examined whether an individual’s perceived happiness level affects their ability to detect a target in noise. To do so, we employed pop-out and serial visual search paradigms, implemented using a novel smartphone application that allowed search times and self-rated levels of happiness to be recorded throughout each twenty-four-hour period for two weeks. This experience sampling protocol circumvented the need to alter mood artificially with laboratory-based induction methods. Using our smartphone application, we were able to replicate the classic visual search findings, whereby pop-out search times remained largely unaffected by the number of distractors whereas serial search times increased with increasing number of distractors. While pop-out search times were unaffected by happiness level, serial search times with the maximum numbers of distractors (n = 30) were significantly faster for high happiness levels than low happiness levels (p = 0.02). Our results demonstrate the utility of smartphone applications in assessing ecologically valid measures of human visual performance. We discuss the significance of our findings for the assessment of basic visual functions using search time measures, and for our ability to search effectively for targets in real world settings. PMID:29664952

The effect of mood state on visual search times for detecting a target in noise: An application of smartphone technology.

PubMed

Maekawa, Toru; Anderson, Stephen J; de Brecht, Matthew; Yamagishi, Noriko

2018-01-01

The study of visual perception has largely been completed without regard to the influence that an individual's emotional status may have on their performance in visual tasks. However, there is a growing body of evidence to suggest that mood may affect not only creative abilities and interpersonal skills but also the capacity to perform low-level cognitive tasks. Here, we sought to determine whether rudimentary visual search processes are similarly affected by emotion. Specifically, we examined whether an individual's perceived happiness level affects their ability to detect a target in noise. To do so, we employed pop-out and serial visual search paradigms, implemented using a novel smartphone application that allowed search times and self-rated levels of happiness to be recorded throughout each twenty-four-hour period for two weeks. This experience sampling protocol circumvented the need to alter mood artificially with laboratory-based induction methods. Using our smartphone application, we were able to replicate the classic visual search findings, whereby pop-out search times remained largely unaffected by the number of distractors whereas serial search times increased with increasing number of distractors. While pop-out search times were unaffected by happiness level, serial search times with the maximum numbers of distractors (n = 30) were significantly faster for high happiness levels than low happiness levels (p = 0.02). Our results demonstrate the utility of smartphone applications in assessing ecologically valid measures of human visual performance. We discuss the significance of our findings for the assessment of basic visual functions using search time measures, and for our ability to search effectively for targets in real world settings.

Walk this way: approaching bodies can influence the processing of faces.

PubMed

Pilz, Karin S; Vuong, Quoc C; Bülthoff, Heinrich H; Thornton, Ian M

2011-01-01

A highly familiar type of movement occurs whenever a person walks towards you. In the present study, we investigated whether this type of motion has an effect on face processing. We took a range of different 3D head models and placed them on a single, identical 3D body model. The resulting figures were animated to approach the observer. In a first series of experiments, we used a sequential matching task to investigate how the motion of an approaching person affects immediate responses to faces. We compared observers' responses following approach sequences to their performance with figures walking backwards (receding motion) or remaining still. Observers were significantly faster in responding to a target face that followed an approach sequence, compared to both receding and static primes. In a second series of experiments, we investigated long-term effects of motion using a delayed visual search paradigm. After studying moving or static avatars, observers searched for target faces in static arrays of varying set sizes. Again, observers were faster at responding to faces that had been learned in the context of an approach sequence. Together these results suggest that the context of a moving body influences face processing, and support the hypothesis that our visual system has mechanisms that aid the encoding of behaviourally-relevant and familiar dynamic events. Copyright © 2010 Elsevier B.V. All rights reserved.

BowMapCL: Burrows-Wheeler Mapping on Multiple Heterogeneous Accelerators.

PubMed

Nogueira, David; Tomas, Pedro; Roma, Nuno

2016-01-01

The computational demand of exact-search procedures has pressed the exploitation of parallel processing accelerators to reduce the execution time of many applications. However, this often imposes strict restrictions in terms of the problem size and implementation efforts, mainly due to their possibly distinct architectures. To circumvent this limitation, a new exact-search alignment tool (BowMapCL) based on the Burrows-Wheeler Transform and FM-Index is presented. Contrasting to other alternatives, BowMapCL is based on a unified implementation using OpenCL, allowing the exploitation of multiple and possibly different devices (e.g., NVIDIA, AMD/ATI, and Intel GPUs/APUs). Furthermore, to efficiently exploit such heterogeneous architectures, BowMapCL incorporates several techniques to promote its performance and scalability, including multiple buffering, work-queue task-distribution, and dynamic load-balancing, together with index partitioning, bit-encoding, and sampling. When compared with state-of-the-art tools, the attained results showed that BowMapCL (using a single GPU) is 2 × to 7.5 × faster than mainstream multi-threaded CPU BWT-based aligners, like Bowtie, BWA, and SOAP2; and up to 4 × faster than the best performing state-of-the-art GPU implementations (namely, SOAP3 and HPG-BWT). When multiple and completely distinct devices are considered, BowMapCL efficiently scales the offered throughput, ensuring a convenient load-balance of the involved processing in the several distinct devices.

Automated Planning and Scheduling for Planetary Rover Distributed Operations

NASA Technical Reports Server (NTRS)

Backes, Paul G.; Rabideau, Gregg; Tso, Kam S.; Chien, Steve

1999-01-01

Automated planning and Scheduling, including automated path planning, has been integrated with an Internet-based distributed operations system for planetary rover operations. The resulting prototype system enables faster generation of valid rover command sequences by a distributed planetary rover operations team. The Web Interface for Telescience (WITS) provides Internet-based distributed collaboration, the Automated Scheduling and Planning Environment (ASPEN) provides automated planning and scheduling, and an automated path planner provided path planning. The system was demonstrated on the Rocky 7 research rover at JPL.

Algorithms and data structures for automated change detection and classification of sidescan sonar imagery

NASA Astrophysics Data System (ADS)

Gendron, Marlin Lee

During Mine Warfare (MIW) operations, MIW analysts perform change detection by visually comparing historical sidescan sonar imagery (SSI) collected by a sidescan sonar with recently collected SSI in an attempt to identify objects (which might be explosive mines) placed at sea since the last time the area was surveyed. This dissertation presents a data structure and three algorithms, developed by the author, that are part of an automated change detection and classification (ACDC) system. MIW analysts at the Naval Oceanographic Office, to reduce the amount of time to perform change detection, are currently using ACDC. The dissertation introductory chapter gives background information on change detection, ACDC, and describes how SSI is produced from raw sonar data. Chapter 2 presents the author's Geospatial Bitmap (GB) data structure, which is capable of storing information geographically and is utilized by the three algorithms. This chapter shows that a GB data structure used in a polygon-smoothing algorithm ran between 1.3--48.4x faster than a sparse matrix data structure. Chapter 3 describes the GB clustering algorithm, which is the author's repeatable, order-independent method for clustering. Results from tests performed in this chapter show that the time to cluster a set of points is not affected by the distribution or the order of the points. In Chapter 4, the author presents his real-time computer-aided detection (CAD) algorithm that automatically detects mine-like objects on the seafloor in SSI. The author ran his GB-based CAD algorithm on real SSI data, and results of these tests indicate that his real-time CAD algorithm performs comparably to or better than other non-real-time CAD algorithms. The author presents his computer-aided search (CAS) algorithm in Chapter 5. CAS helps MIW analysts locate mine-like features that are geospatially close to previously detected features. A comparison between the CAS and a great circle distance algorithm shows that the CAS performs geospatial searching 1.75x faster on large data sets. Finally, the concluding chapter of this dissertation gives important details on how the completed ACDC system will function, and discusses the author's future research to develop additional algorithms and data structures for ACDC.

High speed clinical data retrieval system with event time sequence feature: with 10 years of clinical data of Hamamatsu University Hospital CPOE.

PubMed

Kimura, M; Tani, S; Watanabe, H; Naito, Y; Sakusabe, T; Watanabe, H; Nakaya, J; Sasaki, F; Numano, T; Furuta, T; Furuta, T

2008-01-01

This paper illustrates a high speed clinical data retrieving system, from 10 years of data of operating hospital information system for the purposes of research, evidence creation, patient safety, etc., even incorporating time sequence of causal relations. Total of 73,709,298 records of 10 years at Hamamatsu University Hospital (as of June 2008) are sent from HIS to retrieval system in HL7 v2.5 format. Hierarchical variable length database is used to install them. A search for "listing patients who were prescribed Pravastatin (Mevalotin and generic drugs, any titer)" took 1.92 seconds. "Pravastatin (any) prescribed and recorded AST >150 within two weeks" took 112.22 seconds. Searching conditions can be set to be more complex, connected by Boolean operator and/or. This system called D*D is in operation at Hamamatsu University Hospital since August 2002. It is used for 48,518 times (monthly average of 703 searches). Neither searching, nor background export of data from HIS caused delay of routine operating CPOE. Search database outside of routine operating CPOE, with daily export of order data in HL7 v2.5 format, is proved to provide excellent search environment without causing trouble. Hierarchical representation gives high-speed search response, especially with time sequence of events.

Search and rescue in Alaska's national parks.

PubMed

Heggie, Travis W

2008-11-01

Recreational travel to wilderness destinations such as national parks is increasing. The inherent risks present in such destinations can result in injury and illness, have a significant impact on local medical resources, and end with expensive search and rescue operations. In order to increase our understanding of the activities and situations which lead to wilderness search and rescue incidents, this study examines search and rescue operations from National Park Service units in Alaska. A retrospective review of all search and rescue incident reports filed by National Park Service units in Alaska during 2002. During 2002 there were 25 reported search and rescue incidents involving 38 individuals. The majority of incidents (19 of 25) occurred at Denali National Park and Preserve. Thirteen fatalities were reported in six incidents, nine incidents involved traumatic injuries, eight involved illnesses, and two involved both injuries and an illness. Mountain climbing (20) and hiking (8) were the most common subject activities at the time search and rescue assistance was required. Climbing solo (4), uneven and wet terrain (4), falls into crevasses (3), and a lack of experience or ability (3) were the factors most commonly contributing to search and rescue incidents. Nineteen helicopters were utilized in 15 operations and fixed-wing aircraft were utilized in seven operations. Males accounted for 33 of the 38 individuals involved in all search and rescue incidents and United States citizens accounted for 74% of the individuals involved. The mountain environment higher than 4500m was the most common search and rescue environment (11). The average cost was USD $6253. Search and rescue operations in Alaska can be expensive and end with severe health consequences. Preventive education efforts at park visitor centers and at the lower and upper base camps on Mt. McKinley should be continued. In addition, pre-departure travel education efforts via the internet should be expanded for all park units and match the detail provided on the Denali National Park and Preserve website.

Operational Changes Are Enhancing System Flexibility | Energy Analysis |

Science.gov Websites

) improves system efficiency, reduces the amount of reserves required to balance the system, and enables balance. In addition, expanded balancing footprints can enhance the benefits of faster dispatch, reducing

A Telescopic Binary Learning Machine for Training Neural Networks.

PubMed

Brunato, Mauro; Battiti, Roberto

2017-03-01

This paper proposes a new algorithm based on multiscale stochastic local search with binary representation for training neural networks [binary learning machine (BLM)]. We study the effects of neighborhood evaluation strategies, the effect of the number of bits per weight and that of the maximum weight range used for mapping binary strings to real values. Following this preliminary investigation, we propose a telescopic multiscale version of local search, where the number of bits is increased in an adaptive manner, leading to a faster search and to local minima of better quality. An analysis related to adapting the number of bits in a dynamic way is presented. The control on the number of bits, which happens in a natural manner in the proposed method, is effective to increase the generalization performance. The learning dynamics are discussed and validated on a highly nonlinear artificial problem and on real-world tasks in many application domains; BLM is finally applied to a problem requiring either feedforward or recurrent architectures for feedback control.

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

PubMed Central

Crawford, Broderick; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n 2 × n 2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n 2. Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods. PMID:26078751

The effect of semantic context on prospective memory performance.

PubMed

Thomas, Brandon J; McBride, Dawn M

2016-01-01

The current study provides evidence for spontaneous processing in prospective memory (PM) or memory for intentions. Discrepancy-plus-search is the spontaneous processing of PM cues via disruptions in processing fluency of ongoing task items. We tested whether this mechanism can be demonstrated in an ongoing rating task with a dominant semantic context. Ongoing task items were manipulated such that the PM cues were members of a semantic category (i.e., Body Parts) that was congruent or discrepant with the dominant semantic category in the ongoing task. Results showed that participants correctly responded to more PM cues when there was a category discrepancy between the PM cues and ongoing task items. Moreover, participants' identification of PM cues was accompanied by faster ongoing task reaction times when PM cues were discrepant with ongoing task items than when they were congruent. These results suggest that a discrepancy-plus-search process supports PM retrieval in certain contexts, and that some discrepancy-plus-search mechanisms may result from the violation of processing expectations within a semantic context.

Preschoolers' speed of locating a target symbol under different color conditions.

PubMed

Wilkinson, Krista M; Carlin, Michael; Jagaroo, Vinoth

2006-06-01

A pressing decision in AAC concerns the organization of aided visual symbols. One recent proposal suggested that basic principles of visual processing may be important determinants of how easily a symbol is found in an array, and that this, in turn will influence more functional outcomes like symbol identification or use. This study examined the role of color on accuracy and speed of symbol location by 16 preschool children without disabilities. Participants searched for a target stimulus in an array of eight stimuli. In the same-color condition, the eight stimuli were all red; in the guided search condition, four of the stimuli were red and four were yellow; in the unique-color condition, all stimuli were unique colors. Accuracy was higher and reaction time was faster when stimuli were unique colors than when they were all one color. Reaction time and accuracy did not differ under the guided search and the color-unique conditions. The implications for AAC are discussed.

Spatial context learning survives interference from working memory load

PubMed Central

Vickery, Timothy J.; Sussman, Rachel S.; Jiang, Yuhong V.

2010-01-01

The human visual system is constantly confronted with an overwhelming amount of information, only a subset of which can be processed in complete detail. Attention and implicit learning are two important mechanisms that optimize vision. This study addresses the relationship between these two mechanisms. Specifically we ask: Is implicit learning of spatial context affected by the amount of working memory load devoted to an irrelevant task? We tested observers in visual search tasks where search displays occasionally repeated. Observers became faster searching repeated displays than unrepeated ones, showing contextual cueing. We found that the size of contextual cueing was unaffected by whether observers learned repeated displays under unitary attention or when their attention was divided using working memory manipulations. These results held when working memory was loaded by colors, dot patterns, individual dot locations, or multiple potential targets. We conclude that spatial context learning is robust to interference from manipulations that limit the availability of attention and working memory. PMID:20853996

Pretraining Cortical Thickness Predicts Subsequent Perceptual Learning Rate in a Visual Search Task.

PubMed

Frank, Sebastian M; Reavis, Eric A; Greenlee, Mark W; Tse, Peter U

2016-03-01

We report that preexisting individual differences in the cortical thickness of brain areas involved in a perceptual learning task predict the subsequent perceptual learning rate. Participants trained in a motion-discrimination task involving visual search for a "V"-shaped target motion trajectory among inverted "V"-shaped distractor trajectories. Motion-sensitive area MT+ (V5) was functionally identified as critical to the task: after 3 weeks of training, activity increased in MT+ during task performance, as measured by functional magnetic resonance imaging. We computed the cortical thickness of MT+ from anatomical magnetic resonance imaging volumes collected before training started, and found that it significantly predicted subsequent perceptual learning rates in the visual search task. Participants with thicker neocortex in MT+ before training learned faster than those with thinner neocortex in that area. A similar association between cortical thickness and training success was also found in posterior parietal cortex (PPC). © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles.

PubMed

Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando; Norero, Enrique

2015-01-01

The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n(2) × n(2) grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n(2). Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it. In this paper, we propose a new hybrid algorithm that smartly combines a classic tabu search procedure with the alldifferent global constraint from the constraint programming world. The alldifferent constraint is known to be efficient for domain filtering in the presence of constraints that must be pairwise different, which are exactly the kind of constraints that Sudokus own. This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus. We illustrate interesting experimental results where our proposed algorithm outperforms the best results previously reported by hybrids and approximate methods.

FIREDOC users manual, 3rd edition

NASA Astrophysics Data System (ADS)

Jason, Nora H.

1993-12-01

FIREDOC is the on-line bibliographic database which reflects the holdings (published reports, journal articles, conference proceedings, books, and audiovisual items) of the Fire Research Information Services (FRIS) at the Building and Fire Research Laboratory (BFRL), National Institute of Standards and Technology (NIST). This manual provides step-by-step procedures for entering and exiting the database via telecommunication lines, as well as a number of techniques for searching the database and processing the results of the searches. This Third Edition is necessitated by the change to a UNIX platform. The new computer allows for faster response time if searching via a modem and, in addition, offers internet accessibility. FIREDOC may be used with personal computers, using DOS or Windows, or with Macintosh computers and workstations. A new section on how to access Internet is included, and one on how to obtain the references of interest to you. Appendix F: Quick Guide to Getting Started will be useful to both modem and Internet users.

ELA-max: A new topical lidocaine formulation.

PubMed

Goldman, Ran D

2004-05-01

To evaluate the role of a new formulation of lidocaine (ELA-max) in local anesthesia in children and compare it with the eutectic mixture of local anesthetics (EMLA). Relevant literature was identified by a MEDLINE search (1966-November 2003) using the search terms ELA-max and EMLA. Bibliographies of selected articles were also examined to include all relevant investigations. The product manufacturer was contacted for inclusion of the most recent data available. Topical anesthesia in children is clinically challenging. ELA-max has been shown to be as effective as EMLA for venipuncture in children, but with faster onset. Adverse effects, such as transient blanching with redness and erythema, have been reported. Further investigation is needed to determine the effectiveness of ELA-max on other painful procedures in children, as well as its safety.

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

The time course of location-avoidance learning in fear of spiders.

PubMed

Rinck, Mike; Koene, Marieke; Telli, Sibel; Moerman-van den Brink, Wiltine; Verhoeven, Barbara; Becker, Eni S

2016-01-01

Two experiments were designed to study the time course of avoidance learning in spider fearfuls (SFs) under controlled experimental conditions. To achieve this, we employed an immersive virtual environment (IVE): While walking freely through a virtual art museum to search for specific paintings, the participants were exposed to virtual spiders. Unbeknown to the participants, only two of four museum rooms contained spiders, allowing for avoidance learning. Indeed, the more SF the participants were, the faster they learned to avoid the rooms that contained spiders (Experiment. 1), and within the first six trials, high fearfuls already developed a preference for starting their search task in rooms without spiders (Experiment 2). These results illustrate the time course of avoidance learning in SFs, and they speak to the usefulness of IVEs in fundamental anxiety research.

In search of the autologous clip: a case for experimental standardization.

PubMed

Krugman, Kimberly A; Martin, Kimberly E; Cosgriff, Ned; Slakey, Douglas P

2011-10-01

In an effort to enable faster and, at times, more challenging surgeries without compromising patient or physician safety, medical device manufacturers have created myriad solutions to vascular ligation through the development of novel tools. The speed of development, FDA approval, and dissemination of these devices into the hands of surgeons often outpaces the ability of investigators to critically evaluate comparative effectiveness of these devices. The Medline database was searched for energy-based vessel ligation devices. To remove any perception bias against non-Covidien instruments, critical review was applied only to the devices manufactured by our company. We report on the variability present in published results and offer vital metrics for future studies. Standardized testing and reporting for measures of safety and efficacy of these surgical instruments awaits definition from a consensus group.

3D statistical shape models incorporating 3D random forest regression voting for robust CT liver segmentation

NASA Astrophysics Data System (ADS)

Norajitra, Tobias; Meinzer, Hans-Peter; Maier-Hein, Klaus H.

2015-03-01

During image segmentation, 3D Statistical Shape Models (SSM) usually conduct a limited search for target landmarks within one-dimensional search profiles perpendicular to the model surface. In addition, landmark appearance is modeled only locally based on linear profiles and weak learners, altogether leading to segmentation errors from landmark ambiguities and limited search coverage. We present a new method for 3D SSM segmentation based on 3D Random Forest Regression Voting. For each surface landmark, a Random Regression Forest is trained that learns a 3D spatial displacement function between the according reference landmark and a set of surrounding sample points, based on an infinite set of non-local randomized 3D Haar-like features. Landmark search is then conducted omni-directionally within 3D search spaces, where voxelwise forest predictions on landmark position contribute to a common voting map which reflects the overall position estimate. Segmentation experiments were conducted on a set of 45 CT volumes of the human liver, of which 40 images were randomly chosen for training and 5 for testing. Without parameter optimization, using a simple candidate selection and a single resolution approach, excellent results were achieved, while faster convergence and better concavity segmentation were observed, altogether underlining the potential of our approach in terms of increased robustness from distinct landmark detection and from better search coverage.

Fast parallel tandem mass spectral library searching using GPU hardware acceleration

PubMed Central

Baumgardner, Lydia Ashleigh; Shanmugam, Avinash Kumar; Lam, Henry; Eng, Jimmy K.; Martin, Daniel B.

2011-01-01

Mass spectrometry-based proteomics is a maturing discipline of biologic research that is experiencing substantial growth. Instrumentation has steadily improved over time with the advent of faster and more sensitive instruments collecting ever larger data files. Consequently, the computational process of matching a peptide fragmentation pattern to its sequence, traditionally accomplished by sequence database searching and more recently also by spectral library searching, has become a bottleneck in many mass spectrometry experiments. In both of these methods, the main rate limiting step is the comparison of an acquired spectrum with all potential matches from a spectral library or sequence database. This is a highly parallelizable process because the core computational element can be represented as a simple but arithmetically intense multiplication of two vectors. In this paper we present a proof of concept project taking advantage of the massively parallel computing available on graphics processing units (GPUs) to distribute and accelerate the process of spectral assignment using spectral library searching. This program, which we have named FastPaSS (for Fast Parallelized Spectral Searching) is implemented in CUDA (Compute Unified Device Architecture) from NVIDIA which allows direct access to the processors in an NVIDIA GPU. Our efforts demonstrate the feasibility of GPU computing for spectral assignment, through implementation of the validated spectral searching algorithm SpectraST in the CUDA environment. PMID:21545112

The psychological four-color mapping problem.

PubMed

Francis, Gregory; Bias, Keri; Shive, Joshua

2010-06-01

Mathematicians have proven that four colors are sufficient to color 2-D maps so that no neighboring regions share the same color. Here we consider the psychological 4-color problem: Identifying which 4 colors should be used to make a map easy to use. We build a model of visual search for this design task and demonstrate how to apply it to the task of identifying the optimal colors for a map. We parameterized the model with a set of 7 colors using a visual search experiment in which human participants found a target region on a small map. We then used the model to predict search times for new maps and identified the color assignments that minimize or maximize average search time. The differences between these maps were predicted to be substantial. The model was then tested with a larger set of 31 colors on a map of English counties under conditions in which participants might memorize some aspects of the map. Empirical tests of the model showed that an optimally best colored version of this map is searched 15% faster than the correspondingly worst colored map. Thus, the color assignment seems to affect search times in a way predicted by the model, and this effect persists even when participants might use other sources of knowledge about target location. PsycINFO Database Record (c) 2010 APA, all rights reserved.

Interaction between numbers and size during visual search.

PubMed

Krause, Florian; Bekkering, Harold; Pratt, Jay; Lindemann, Oliver

2017-05-01

The current study investigates an interaction between numbers and physical size (i.e. size congruity) in visual search. In three experiments, participants had to detect a physically large (or small) target item among physically small (or large) distractors in a search task comprising single-digit numbers. The relative numerical size of the digits was varied, such that the target item was either among the numerically large or small numbers in the search display and the relation between numerical and physical size was either congruent or incongruent. Perceptual differences of the stimuli were controlled by a condition in which participants had to search for a differently coloured target item with the same physical size and by the usage of LCD-style numbers that were matched in visual similarity by shape transformations. The results of all three experiments consistently revealed that detecting a physically large target item is significantly faster when the numerical size of the target item is large as well (congruent), compared to when it is small (incongruent). This novel finding of a size congruity effect in visual search demonstrates an interaction between numerical and physical size in an experimental setting beyond typically used binary comparison tasks, and provides important new evidence for the notion of shared cognitive codes for numbers and sensorimotor magnitudes. Theoretical consequences for recent models on attention, magnitude representation and their interactions are discussed.

Casual Video Games as Training Tools for Attentional Processes in Everyday Life.

PubMed

Stroud, Michael J; Whitbourne, Susan Krauss

2015-11-01

Three experiments examined the attentional components of the popular match-3 casual video game, Bejeweled Blitz (BJB). Attentionally demanding, BJB is highly popular among adults, particularly those in middle and later adulthood. In experiment 1, 54 older adults (Mage = 70.57) and 33 younger adults (Mage = 19.82) played 20 rounds of BJB, and completed online tasks measuring reaction time, simple visual search, and conjunction visual search. Prior experience significantly predicted BJB scores for younger adults, but for older adults, both prior experience and simple visual search task scores predicted BJB performance. Experiment 2 tested whether BJB practice alone would result in a carryover benefit to a visual search task in a sample of 58 young adults (Mage = 19.57) who completed 0, 10, or 30 rounds of BJB followed by a BJB-like visual search task with targets present or absent. Reaction times were significantly faster for participants who completed 30 but not 10 rounds of BJB compared with the search task only. This benefit was evident when targets were both present and absent, suggesting that playing BJB improves not only target detection, but also the ability to quit search effectively. Experiment 3 tested whether the attentional benefit in experiment 2 would apply to non-BJB stimuli. The results revealed a similar numerical but not significant trend. Taken together, the findings suggest there are benefits of casual video game playing to attention and relevant everyday skills, and that these games may have potential value as training tools.

Mechanism of Facilitated Diffusion during a DNA Search in Crowded Environments.

PubMed

Krepel, Dana; Gomez, David; Klumpp, Stefan; Levy, Yaakov

2016-11-03

The key feature explaining the rapid recognition of a DNA target site by its protein lies in the combination of one- and three-dimensional (1D and 3D) diffusion, which allows efficient scanning of the many alternative sites. This facilitated diffusion mechanism is expected to be affected by cellular conditions, particularly crowding, given that up to 40% of the total cellular volume may by occupied by macromolecules. Using coarse-grained molecular dynamics and Monte Carlo simulations, we show that the crowding particles can enhance facilitated diffusion and accelerate search kinetics. This effect originates from a trade-off between 3D and 1D diffusion. The 3D diffusion coefficient is lower under crowded conditions, but it has little influence because the excluded volume effect of molecular crowding restricts its use. Largely prevented from using 3D diffusion, the searching protein dramatically increases its use of the hopping search mode, which results in a higher linear diffusion coefficient. The coefficient of linear diffusion also increases under crowded conditions as a result of increased collisions between the crowding particles and the searching protein. Overall, less 3D diffusion coupled with an increase in the use of the hopping and speed of 1D diffusion results in faster search kinetics under crowded conditions. Our study shows that the search kinetics and mechanism are modulated not only by the crowding occupancy but also by the properties of the crowding particles and the salt concentration.

36 CFR 1250.56 - Fee schedule for NARA operational records.

Code of Federal Regulations, 2012 CFR

2012-07-01

..., the rate is $33 per hour (or fraction thereof) (2) Computer searching. This is the actual cost to NARA of operating the computer and the salary of the operator. When the search is relatively... issues regarding the application of exemptions. (c) Reproduction fees—(1) Self-service photocopying. At...

36 CFR 1250.56 - Fee schedule for NARA operational records.

Code of Federal Regulations, 2011 CFR

2011-07-01

..., the rate is $33 per hour (or fraction thereof) (2) Computer searching. This is the actual cost to NARA of operating the computer and the salary of the operator. When the search is relatively... issues regarding the application of exemptions. (c) Reproduction fees—(1) Self-service photocopying. At...

36 CFR 1250.56 - Fee schedule for NARA operational records.

Code of Federal Regulations, 2014 CFR

2014-07-01

..., the rate is $33 per hour (or fraction thereof) (2) Computer searching. This is the actual cost to NARA of operating the computer and the salary of the operator. When the search is relatively... issues regarding the application of exemptions. (c) Reproduction fees—(1) Self-service photocopying. At...

Trimble Use Case Information : A Presentation to DOT Adjacent Band Compatibility Workshop #2

DOT National Transportation Integrated Search

2014-12-04

Trimble Use Case Overview: Heavy Civil Construction - Planning, Designing, Building and Operating: Enhanced information, decision making and control across the entire project lifecycle, generating benefits including: - Faster Completion - Reduced Fue...

Laser Balancing

NASA Technical Reports Server (NTRS)

1981-01-01

Mechanical Technology, Incorporated developed a fully automatic laser machining process that allows more precise balancing removes metal faster, eliminates excess metal removal and other operator induced inaccuracies, and provides significant reduction in balancing time. Manufacturing costs are reduced as a result.

Driving at Night Can Be Deadly

DOT National Transportation Integrated Search

1996-06-17

Efficient Commercial Vehicle Operations (CVO) is imperative as manufacturers and distributors move to new technologies, faster production methods and "Just in Time" delivery. CVO must offer more reliable travel times, as well as safety and flexibilit...

Development of a Compound Optimization Approach Based on Imperialist Competitive Algorithm

NASA Astrophysics Data System (ADS)

Wang, Qimei; Yang, Zhihong; Wang, Yong

In this paper, an improved novel approach is developed for the imperialist competitive algorithm to achieve a greater performance. The Nelder-Meand simplex method is applied to execute alternately with the original procedures of the algorithm. The approach is tested on twelve widely-used benchmark functions and is also compared with other relative studies. It is shown that the proposed approach has a faster convergence rate, better search ability, and higher stability than the original algorithm and other relative methods.

XPAR-2 Search Mode Initial Design

DTIC Science & Technology

2013-11-01

by an azimuth sector, an elevation sector, and out to a required maximum range. The frame-time, which is defined as the time it takes the antenna beam...continues its scan, more targets are detected and the measurements are used to form their track files, which are then updated when the beam scans over...every additional target to be tracked. Although the track update rate can be made much faster than that in the TWS mode, it is obvious that there is a

H-BLAST: a fast protein sequence alignment toolkit on heterogeneous computers with GPUs.

PubMed

Ye, Weicai; Chen, Ying; Zhang, Yongdong; Xu, Yuesheng

2017-04-15

The sequence alignment is a fundamental problem in bioinformatics. BLAST is a routinely used tool for this purpose with over 118 000 citations in the past two decades. As the size of bio-sequence databases grows exponentially, the computational speed of alignment softwares must be improved. We develop the heterogeneous BLAST (H-BLAST), a fast parallel search tool for a heterogeneous computer that couples CPUs and GPUs, to accelerate BLASTX and BLASTP-basic tools of NCBI-BLAST. H-BLAST employs a locally decoupled seed-extension algorithm for better performance on GPUs, and offers a performance tuning mechanism for better efficiency among various CPUs and GPUs combinations. H-BLAST produces identical alignment results as NCBI-BLAST and its computational speed is much faster than that of NCBI-BLAST. Speedups achieved by H-BLAST over sequential NCBI-BLASTP (resp. NCBI-BLASTX) range mostly from 4 to 10 (resp. 5 to 7.2). With 2 CPU threads and 2 GPUs, H-BLAST can be faster than 16-threaded NCBI-BLASTX. Furthermore, H-BLAST is 1.5-4 times faster than GPU-BLAST. https://github.com/Yeyke/H-BLAST.git. yux06@syr.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Predicting Airport Screening Officers' Visual Search Competency With a Rapid Assessment.

PubMed

Mitroff, Stephen R; Ericson, Justin M; Sharpe, Benjamin

2018-03-01

Objective The study's objective was to assess a new personnel selection and assessment tool for aviation security screeners. A mobile app was modified to create a tool, and the question was whether it could predict professional screeners' on-job performance. Background A variety of professions (airport security, radiology, the military, etc.) rely on visual search performance-being able to detect targets. Given the importance of such professions, it is necessary to maximize performance, and one means to do so is to select individuals who excel at visual search. A critical question is whether it is possible to predict search competency within a professional search environment. Method Professional searchers from the USA Transportation Security Administration (TSA) completed a rapid assessment on a tablet-based X-ray simulator (XRAY Screener, derived from the mobile technology app Airport Scanner; Kedlin Company). The assessment contained 72 trials that were simulated X-ray images of bags. Participants searched for prohibited items and tapped on them with their finger. Results Performance on the assessment significantly related to on-job performance measures for the TSA officers such that those who were better XRAY Screener performers were both more accurate and faster at the actual airport checkpoint. Conclusion XRAY Screener successfully predicted on-job performance for professional aviation security officers. While questions remain about the underlying cognitive mechanisms, this quick assessment was found to significantly predict on-job success for a task that relies on visual search performance. Application It may be possible to quickly assess an individual's visual search competency, which could help organizations select new hires and assess their current workforce.

Job task characteristics of Australian emergency services volunteers during search and rescue operations.

PubMed

Silk, Aaron; Lenton, Gavin; Savage, Robbie; Aisbett, Brad

2018-02-01

Search and rescue operations are necessary in locating, assisting and recovering individuals lost or in distress. In Australia, land-based search and rescue roles require a range of physically demanding tasks undertaken in dynamic and challenging environments. The aim of the current research was to identify and characterise the physically demanding tasks inherent to search and rescue operation personnel within Australia. These aims were met through a subjective job task analysis approach. In total, 11 criterion tasks were identified by personnel. These tasks were the most physically demanding, frequently occurring and operationally important tasks to these specialist roles. Muscular strength was the dominant fitness component for 7 of the 11 tasks. In addition to the discrete criterion tasks, an operational scenario was established. With the tasks and operational scenario identified, objective task analysis procedures can be undertaken so that practitioners can implement evidence-based strategies, such as physical selection procedures and task-based physical training programs, commensurate with the physical demands of search and rescue job roles. Practitioner Summary: The identification of physically demanding tasks amongst specialist emergency service roles predicates health and safety strategies which can be incorporated into organisations. Knowledge of physical task parameters allows employers to mitigate injury risk through the implementation of strategies modelled on the precise physical demands of the role.

Tse computers. [Chinese pictograph character binary image processor design for high speed applications

NASA Technical Reports Server (NTRS)

Strong, J. P., III

1973-01-01

Tse computers have the potential of operating four or five orders of magnitude faster than present digital computers. The computers of the new design use binary images as their basic computational entity. The word 'tse' is the transliteration of the Chinese word for 'pictograph character.' Tse computers are large collections of devices that perform logical operations on binary images. The operations on binary images are to be performed over the entire image simultaneously.

Automated design of image operators that detect interest points.

PubMed

Trujillo, Leonardo; Olague, Gustavo

2008-01-01

This work describes how evolutionary computation can be used to synthesize low-level image operators that detect interesting points on digital images. Interest point detection is an essential part of many modern computer vision systems that solve tasks such as object recognition, stereo correspondence, and image indexing, to name but a few. The design of the specialized operators is posed as an optimization/search problem that is solved with genetic programming (GP), a strategy still mostly unexplored by the computer vision community. The proposed approach automatically synthesizes operators that are competitive with state-of-the-art designs, taking into account an operator's geometric stability and the global separability of detected points during fitness evaluation. The GP search space is defined using simple primitive operations that are commonly found in point detectors proposed by the vision community. The experiments described in this paper extend previous results (Trujillo and Olague, 2006a,b) by presenting 15 new operators that were synthesized through the GP-based search. Some of the synthesized operators can be regarded as improved manmade designs because they employ well-known image processing techniques and achieve highly competitive performance. On the other hand, since the GP search also generates what can be considered as unconventional operators for point detection, these results provide a new perspective to feature extraction research.

Medical Support for Aircraft Disaster Search and Recovery Operations at Sea: the RSN Experience.

PubMed

Teo, Kok Ann Colin; Chong, Tse Feng Gabriel; Liow, Min Han Lincoln; Tang, Kong Choong

2016-06-01

The maritime environment presents a unique set of challenges to search and recovery (SAR) operations. There is a paucity of information available to guide provision of medical support for SAR operations for aircraft disasters at sea. The Republic of Singapore Navy (RSN) took part in two such SAR operations in 2014 which showcased the value of a military organization in these operations. Key considerations in medical support for similar operations include the resultant casualty profile and challenges specific to the maritime environment, such as large distances of area of operations from land, variable sea states, and space limitations. Medical support planning can be approached using well-established disaster management life cycle phases of preparedness, mitigation, response, and recovery, which all are described in detail. This includes key areas of dedicated training and exercises, force protection, availability of air assets and chamber support, psychological care, and the forensic handling of human remains. Relevant lessons learned by RSN from the Air Asia QZ8501 search operation are also included in the description of these key areas. Teo KAC , Chong TFG , Liow MHL , Tang KC . Medical support for aircraft disaster search and recovery operations at sea: the RSN experience. Prehosp Disaster Med. 2016; 31(3):294-299.

Independence of long-term contextual memory and short-term perceptual hypotheses: Evidence from contextual cueing of interrupted search.

PubMed

Schlagbauer, Bernhard; Mink, Maurice; Müller, Hermann J; Geyer, Thomas

2017-02-01

Observers are able to resume an interrupted search trial faster relative to responding to a new, unseen display. This finding of rapid resumption is attributed to short-term perceptual hypotheses generated on the current look and confirmed upon subsequent looks at the same display. It has been suggested that the contents of perceptual hypotheses are similar to those of other forms of memory acquired long-term through repeated exposure to the same search displays over the course of several trials, that is, the memory supporting "contextual cueing." In three experiments, we investigated the relationship between short-term perceptual hypotheses and long-term contextual memory. The results indicated that long-term, contextual memory of repeated displays neither affected the generation nor the confirmation of short-term perceptual hypotheses for these displays. Furthermore, the analysis of eye movements suggests that long-term memory provides an initial benefit in guiding attention to the target, whereas in subsequent looks guidance is entirely based on short-term perceptual hypotheses. Overall, the results reveal a picture of both long- and short-term memory contributing to reliable performance gains in interrupted search, while exerting their effects in an independent manner.

Fast Localization in Large-Scale Environments Using Supervised Indexing of Binary Features.

PubMed

Youji Feng; Lixin Fan; Yihong Wu

2016-01-01

The essence of image-based localization lies in matching 2D key points in the query image and 3D points in the database. State-of-the-art methods mostly employ sophisticated key point detectors and feature descriptors, e.g., Difference of Gaussian (DoG) and Scale Invariant Feature Transform (SIFT), to ensure robust matching. While a high registration rate is attained, the registration speed is impeded by the expensive key point detection and the descriptor extraction. In this paper, we propose to use efficient key point detectors along with binary feature descriptors, since the extraction of such binary features is extremely fast. The naive usage of binary features, however, does not lend itself to significant speedup of localization, since existing indexing approaches, such as hierarchical clustering trees and locality sensitive hashing, are not efficient enough in indexing binary features and matching binary features turns out to be much slower than matching SIFT features. To overcome this, we propose a much more efficient indexing approach for approximate nearest neighbor search of binary features. This approach resorts to randomized trees that are constructed in a supervised training process by exploiting the label information derived from that multiple features correspond to a common 3D point. In the tree construction process, node tests are selected in a way such that trees have uniform leaf sizes and low error rates, which are two desired properties for efficient approximate nearest neighbor search. To further improve the search efficiency, a probabilistic priority search strategy is adopted. Apart from the label information, this strategy also uses non-binary pixel intensity differences available in descriptor extraction. By using the proposed indexing approach, matching binary features is no longer much slower but slightly faster than matching SIFT features. Consequently, the overall localization speed is significantly improved due to the much faster key point detection and descriptor extraction. It is empirically demonstrated that the localization speed is improved by an order of magnitude as compared with state-of-the-art methods, while comparable registration rate and localization accuracy are still maintained.

36 CFR § 1250.56 - Fee schedule for NARA operational records.

Code of Federal Regulations, 2013 CFR

2013-07-01

... professional employee of NARA, the rate is $33 per hour (or fraction thereof) (2) Computer searching. This is the actual cost to NARA of operating the computer and the salary of the operator. When the search is... general legal or policy issues regarding the application of exemptions. (c) Reproduction fees—(1) Self...

Performance Evaluation of Block Acquisition and Tracking Algorithms Using an Open Source GPS Receiver Platform

NASA Technical Reports Server (NTRS)

Ramachandran, Ganesh K.; Akopian, David; Heckler, Gregory W.; Winternitz, Luke B.

2011-01-01

Location technologies have many applications in wireless communications, military and space missions, etc. US Global Positioning System (GPS) and other existing and emerging Global Navigation Satellite Systems (GNSS) are expected to provide accurate location information to enable such applications. While GNSS systems perform very well in strong signal conditions, their operation in many urban, indoor, and space applications is not robust or even impossible due to weak signals and strong distortions. The search for less costly, faster and more sensitive receivers is still in progress. As the research community addresses more and more complicated phenomena there exists a demand on flexible multimode reference receivers, associated SDKs, and development platforms which may accelerate and facilitate the research. One of such concepts is the software GPS/GNSS receiver (GPS SDR) which permits a facilitated access to algorithmic libraries and a possibility to integrate more advanced algorithms without hardware and essential software updates. The GNU-SDR and GPS-SDR open source receiver platforms are such popular examples. This paper evaluates the performance of recently proposed block-corelator techniques for acquisition and tracking of GPS signals using open source GPS-SDR platform.

Modeling resident error-making patterns in detection of mammographic masses using computer-extracted image features: preliminary experiments

NASA Astrophysics Data System (ADS)

Mazurowski, Maciej A.; Zhang, Jing; Lo, Joseph Y.; Kuzmiak, Cherie M.; Ghate, Sujata V.; Yoon, Sora

2014-03-01

Providing high quality mammography education to radiology trainees is essential, as good interpretation skills potentially ensure the highest benefit of screening mammography for patients. We have previously proposed a computer-aided education system that utilizes trainee models, which relate human-assessed image characteristics to interpretation error. We proposed that these models be used to identify the most difficult and therefore the most educationally useful cases for each trainee. In this study, as a next step in our research, we propose to build trainee models that utilize features that are automatically extracted from images using computer vision algorithms. To predict error, we used a logistic regression which accepts imaging features as input and returns error as output. Reader data from 3 experts and 3 trainees were used. Receiver operating characteristic analysis was applied to evaluate the proposed trainee models. Our experiments showed that, for three trainees, our models were able to predict error better than chance. This is an important step in the development of adaptive computer-aided education systems since computer-extracted features will allow for faster and more extensive search of imaging databases in order to identify the most educationally beneficial cases.

Applang - A DSL for specification of mobile applications for android platform based on textX

NASA Astrophysics Data System (ADS)

Kosanović, Milan; Dejanović, Igor; Milosavljević, Gordana

2016-06-01

Mobile platforms become a ubiquitous part of our daily lives thus making more pressure to software developers to develop more applications faster and with the support for different mobile operating systems. To foster the faster development of mobile services and applications and to support various mobile operating systems a new software development approaches must be undertaken. Domain-Specific Languages (DSL) are a viable approach that promise to solve a problem of target platform diversity as well as to facilitate rapid application development and shorter time-to-market. This paper presents Applang, a DSL for the specification of mobile applications for the Android platform, based on textX meta-language. The application is described using Applang DSL and the source code for a target platform is automatically generated by the provided code generator. The same application defined using single Applang source can be transformed to various targets with little or no manual modifications.

Search and Rescue Operations of Aircraft in Africa: Some Compelling Issues

NASA Technical Reports Server (NTRS)

Abeyratne, Ruwantissa I. R.

2002-01-01

The world aviation community has felt the compelling need for a well-coordinated global programme for search and rescue operations of aircraft ever since commercial aviation was regulated in 1944. Guidelines and plans of action for search and rescue have therefore been considered critical in the event of an aircraft accident. This fact is eminently brought to bear in the continental regions of Africa and South America in particular, where vast expanses of land are still uninhabited or sparsely populated and controlled flight into terrain (CFIT-where an aircraft may crash on land while still under the control of technical crew) is a common occurrence. There are numerous guidelines that have been adopted under the umbrella of the International Civil Aviation Organization which are already in place for the provision of search and rescue operations pertaining to aircraft. However, when an accident occurs in the territory of a State, there are sensitivities involving the State in which the aircraft concerned was registered and issues of sovereignty which have to be considered. Additionally. issues such as the voluntary nature of the search and rescue services offered. confidentiality, timeliness of such operations, fairness and uniformity all play a critical role. This article addresses the issue of search and rescue operations in Africa and examines in some detail where the world aviation community is right now and where it is headed in this important field of human endeavour.

A versatile sensor network for urban search and rescue operations

NASA Astrophysics Data System (ADS)

Känsälä, Klaus; Korkalainen, Marko; Mäyrä, Aki

2011-11-01

The presentation is based in the research work carried out in EU funded project SGL for USaR (Second Generation Locator for Urban Search and Rescue Operations). The aim of this project is to develop wireless standalone communication system with embedded sensor network which can be globally used in rescue operations after accidents or terrorist attacks. The system should be able to operate without external support for several days: it should have autonomy with power supply and communication. The devices must be lightweight so that rescue team can easily carry them and finally they must be easy to install and use. The range of the wireless communication must cover an area of several square kilometers. The embedded sensor system must be able to detect sings of life but also detect hazards threatening the rescue operators thus preventing more accidents. It should also support positioning and digital mapping as well as the management of the search and rescue operation. This sensor network for urban search and rescue operations has been tested on a field conditions and it has proven to be robust and reliable and provides an energy efficient way of communication and positioning on harsh conditions.

Community structure dynamics during startup in microbial fuel cells - The effect of phosphate concentrations.

PubMed

Yanuka-Golub, Keren; Reshef, Leah; Rishpon, Judith; Gophna, Uri

2016-07-01

For microbial fuel cells (MFCs) to become a cost-effective wastewater treatment technology, they must produce a stable electro-active microbial community quickly and operate under realistic wastewater nutrient conditions. The composition of the anodic-biofilm and planktonic-cells communities was followed temporally for MFCs operated under typical laboratory phosphate concentrations (134mgL(-1)P) versus wastewater phosphate concentrations (16mgL(-1)P). A stable peak voltage was attained two-fold faster in MFCs operating under lower phosphate concentration. All anodic-biofilms were composed of well-known exoelectrogenic bacterial families; however, MFCs showing faster startup and a stable voltage had a Desulfuromonadaceae-dominated-biofilm, while biofilms co-dominated by Desulfuromonadaceae and Geobacteraceae characterized slower or less stable MFCs. Interestingly,planktonic-cell concentrations of these bacteria followed a similar trend as the anodic-biofilm and could therefore serve as a biomarker for its formation. These results demonstrate that wastewater-phosphate concentrations do not compromise MFCs efficiency, and considerably speed up startup times. Copyright © 2016 Elsevier Ltd. All rights reserved.

Computationally efficient control allocation

NASA Technical Reports Server (NTRS)

Durham, Wayne (Inventor)

2001-01-01

A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

Transperitoneal approach versus retroperitoneal approach: a meta-analysis of laparoscopic partial nephrectomy for renal cell carcinoma.

PubMed

Ren, Tong; Liu, Yan; Zhao, Xiaowen; Ni, Shaobin; Zhang, Cheng; Guo, Changgang; Ren, Minghua

2014-01-01

To compare the efficiency and safety of the transperitoneal approaches with retroperitoneal approaches in laparoscopic partial nephrectomy for renal cell carcinoma and provide evidence-based medicine support for clinical treatment. A systematic computer search of PUBMED, EMBASE, and the Cochrane Library was executed to identify retrospective observational and prospective randomized controlled trials studies that compared the outcomes of the two approaches in laparoscopic partial nephrectomy. Two reviewers independently screened, extracted, and evaluated the included studies and executed statistical analysis by using software STATA 12.0. Outcomes of interest included perioperative and postoperative variables, surgical complications and oncological variables. There were 8 studies assessed transperitoneal laparoscopic partial nephrectomy (TLPN) versus retroperitoneal laparoscopic partial nephrectomy (RLPN) were included. RLPN had a shorter operating time (SMD = 1.001,95%confidence interval[CI] 0.609-1.393,P<0.001), a lower estimated blood loss (SMD = 0.403,95%CI 0.015-0.791,P = 0.042) and a shorter length of hospital stay (WMD = 0.936 DAYS,95%CI 0.609-1.263,P<0.001) than TLPN. There were no significant differences between the transperitoneal and retroperitoneal approaches in other outcomes of interest. This meta-analysis indicates that, in appropriately selected patients, especially patients with intraperitoneal procedures history or posteriorly located renal tumors, the RLPN can shorten the operation time, reduce the estimated blood loss and shorten the length of hospital stay. RLPN may be equally safe and be faster compared with the TLPN.

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP.

PubMed

Mohsen, Abdulqader M

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality.

Finite element computation on nearest neighbor connected machines

NASA Technical Reports Server (NTRS)

Mcaulay, A. D.

1984-01-01

Research aimed at faster, more cost effective parallel machines and algorithms for improving designer productivity with finite element computations is discussed. A set of 8 boards, containing 4 nearest neighbor connected arrays of commercially available floating point chips and substantial memory, are inserted into a commercially available machine. One-tenth Mflop (64 bit operation) processors provide an 89% efficiency when solving the equations arising in a finite element problem for a single variable regular grid of size 40 by 40 by 40. This is approximately 15 to 20 times faster than a much more expensive machine such as a VAX 11/780 used in double precision. The efficiency falls off as faster or more processors are envisaged because communication times become dominant. A novel successive overrelaxation algorithm which uses cyclic reduction in order to permit data transfer and computation to overlap in time is proposed.

Programmable Positioner For Spot Welding

NASA Technical Reports Server (NTRS)

Roden, William A.

1989-01-01

Welding station mechanized by installing preset indexing system and gear drive. Mechanism includes a low-cost, versatile, single-axis motion control and motor drive to provide fully-automatic weld sequencing and spot-to-spot spacing. Welding station relieves operator of some difficult, tedious tasks and increases both productivity and quality of welds. Results in welds of higher quality and greater accuracy, fewer weld defects, and faster welding operation.

Evidence Base for the Development of an Enduring DND/CAF Operational Energy Strategy (DOES): Expressing Canadian Values Through Defence Operational Energy Stewardship Here and Abroad

DTIC Science & Technology

2014-12-01

Class Ships, DTIC Document. D. De Donno, L.C., and L. Tarricone (2013), Enabling Self-Powered Autonomous Wireless Sensors with New-Generation I2C-RFID...use energy consumption, electricity is growing much faster than direct use of fuels.” Advance information technologies, sensors and weapons as...operating bases (FOBs) and any off-grid encampments). 3. Tactical Platforms (i.e., independent, military vehicles incorporating sensor , communications and

Operating the EOSDIS at the land processes DAAC managing expectations, requirements, and performance across agencies, missions, instruments, systems, and user communities

USGS Publications Warehouse

Kalvelage, T.A.; ,

2002-01-01

NASA developed the Earth Observing System (EOS) during the 1990'S. At the Land Processes Distributed Active Archive Center (LP DAAC), located at the USGS EROS Data Center, the EOS Data and Information System (EOSDIS) is required to support heritage missions as well as Landsat 7, Terra, and Aqua. The original system concept of the early 1990'S changed as each community had its say - first the managers, then engineers, scientists, developers, operators, and then finally the general public. The systems at the LP DAAC - particularly the largest single system, the EOSDIS Core System (ECS) - are changing as experience accumulates, technology changes, and each user group gains influence. The LP DAAC has adapted as contingencies were planned for, requirements and therefore plans were modified, and expectations changed faster than requirements could hope to be satisfied. Although not responsible for Quality Assurance of the science data, the LP DAAC works to ensure the data are accessible and useable by influencing systems, capabilities, and data formats where possible, and providing tools and user support as necessary. While supporting multiple missions and instruments, the LP DAAC also works with and learns from multiple management and oversight groups as they review mission requirements, system capabilities, and the overall operation of the LP DAAC. Stakeholders, including the Land Science community, are consulted regularly to ensure that the LP DAAC remains cognizant and responsive to the evolving needs of the user community. Today, the systems do not look or function as originally planned, but they do work, and they allow customers to search and order of an impressive amount of diverse data.

The Design and Construction Process of a Test Stand for Casting the Power Steering’S Housing with the Use of the Pdcpd Material

NASA Astrophysics Data System (ADS)

Sobek, M.; Baier, A.; Grabowski, Ł.

2018-01-01

The use of new technologies and materials in various industries is a natural process that is directly related to the very high rate of development of these technologies. Certain industries decide to much faster introduce new technologies and materials. One of such branches is the automotive industry, whose representatives are very energetically looking for both financial savings and savings resulting from the vehicles mass reduction. An economically justified approach to construction materials is leading the search for new solutions and materials. The use of a modern material such as the two-component PDCPD composite shows hitherto unknown possibilities of producing subassemblies of many different constructions. The possibility of using a modern composite material with parameters comparable to that of metals and significantly lighter, can be an excellent alternative in the selection of materials for many parts of motor vehicles. The potentiality of precise casting of tolerated surfaces will allow to reduce the operations related to machining process, which is an indispensable part of the production process of elements that are cast of metal. This article describes the process of designing and building a test stand for precise positioning of power steering gear components at the stage of casting their housing. The article presents the principle of operation of the test stand and the process of preparation for the casting and the cast itself will be rudely described. Due to the implementation of research as part of a research project with an industrial partner, the article will only describe some operations. This is related to the confidentiality of the project.

A general CPL-AdS methodology for fixing dynamic parameters in dual environments.

PubMed

Huang, De-Shuang; Jiang, Wen

2012-10-01

The algorithm of Continuous Point Location with Adaptive d-ary Search (CPL-AdS) strategy exhibits its efficiency in solving stochastic point location (SPL) problems. However, there is one bottleneck for this CPL-AdS strategy which is that, when the dimension of the feature, or the number of divided subintervals for each iteration, d is large, the decision table for elimination process is almost unavailable. On the other hand, the larger dimension of the features d can generally make this CPL-AdS strategy avoid oscillation and converge faster. This paper presents a generalized universal decision formula to solve this bottleneck problem. As a matter of fact, this decision formula has a wider usage beyond handling out this SPL problems, such as dealing with deterministic point location problems and searching data in Single Instruction Stream-Multiple Data Stream based on Concurrent Read and Exclusive Write parallel computer model. Meanwhile, we generalized the CPL-AdS strategy with an extending formula, which is capable of tracking an unknown dynamic parameter λ in both informative and deceptive environments. Furthermore, we employed different learning automata in the generalized CPL-AdS method to find out if faster learning algorithm will lead to better realization of the generalized CPL-AdS method. All of these aforementioned contributions are vitally important whether in theory or in practical applications. Finally, extensive experiments show that our proposed approaches are efficient and feasible.

Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO

NASA Technical Reports Server (NTRS)

Wintemitz, Luke; Boegner, Greg; Sirotzky, Steve

2004-01-01

A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.

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

PubMed

Nahum, Yoav

2008-02-01

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

34 CFR 5.60 - Schedule of fees.

Code of Federal Regulations, 2010 CFR

2010-07-01

... rate of pay per hour of the employee conducting the search plus 16 percent of that rate. (iii) Computer... operator plus 16% of that rate plus $287 per hour for computer operation. Two hours of search time on a... of the computer operator's basic rate of pay per hour plus 16 percent of that rate. (2) Review of...

Evaluation of sequential images for photogrammetrically point determination

NASA Astrophysics Data System (ADS)

Kowalczyk, M.

2011-12-01

Close range photogrammetry encounters many problems with reconstruction of objects three-dimensional shape. Relative orientation parameters of taken photos makes usually key role leading to right solution of this problem. Automation of technology process is hardly performed due to recorded scene complexity and configuration of camera positions. This configuration makes the process of joining photos into one set usually impossible automatically. Application of camcorder is the solution widely proposed in literature for support in 3D models creation. Main advantages of this tool are connected with large number of recorded images and camera positions. Exterior orientation changes barely between two neighboring frames. Those features of film sequence gives possibilities for creating models with basic algorithms, working faster and more robust, than with remotely taken photos. The first part of this paper presents results of experiments determining interior orientation parameters of some sets of frames, presenting three-dimensional test field. This section describes calibration repeatability of film frames taken from camcorder. It is important due to stability of interior camera geometric parameters. Parametric model of systematical errors was applied for correcting images. Afterwards a short film of the same test field had been taken for determination of check points group. This part has been done for controlling purposes of camera application in measurement tasks. Finally there are presented some results of experiments which compare determination of recorded object points in 3D space. In common digital photogrammetry, where separate photos are used, first levels of image pyramids are taken to connect with feature based matching. This complicated process creates a lot of emergencies, which can produce false detections of image similarities. In case of digital film camera, authors of publications avoid this dangerous step, going straightly to area based matching, aiming high degree of similarity for two corresponding film frames. First approximation, in establishing connections between photos, comes from whole image distance. This image distance method can work with more than just two dimensions of translation vector. Scale and angles are also used for improving image matching. This operation creates more similar looking frames where corresponding characteristic points lays close to each other. Procedure searching for pairs of points works faster and more accurately, because analyzed areas can be reduced. Another proposed solution comes from image created by adding differences between particular frames, gives more rough results, but works much faster than standard matching.

Surviving Atmospheric Spacecraft Breakup

NASA Technical Reports Server (NTRS)

Szewczyk, Nathaniel J.; Conley, Catharine A.

2003-01-01

In essence, to survival a spacecraft breakup an animal must not experience a lethal event. Much as with surviving aircraft breakup, dissipation of lethal forces via breakup of the craft around the organism is likely to greatly increase the odds of survival. As spacecraft can travel higher and faster than aircraft, it is often assumed that spacecraft breakup is not a survivable event. Similarly, the belief that aircraft breakup or crashes are not survivable events is still prevalent in the general population. As those of us involved in search and rescue know, it is possible to survive both aircraft breakup and crashes. Here we make the first report of an animal, C. elegans, surviving atmospheric breakup of the spacecraft supporting it and discuss both the lethal events these animals had to escape and the implications implied for search and rescue following spacecraft breakup.

Trans advanced surface laser ablation (TransPRK) outcomes using SmartPulseTechnology.

PubMed

Aslanides, Ioannis M; Kymionis, George D

2017-02-01

To evaluate early visual rehabilitation, post-operative pain, epithelial healing and haze after transepithelial photorefractive keratectomy (TransPRK) using the SmartPulseTechnology (SPT) of Schwind Amaris (Schwind eye-tech-solutions GmbH, Kleinostheim, Germany). This was a retrospective comparative evaluation of a cohort of myopic patients undergoing TransPRK with SPT (group 1), with one matched control group that underwent conventional TransPRK (group 2). All cases had a 6-month post-operative follow-up including visual acuity and slit-lamp examination. Subjective evaluation of pain was recorded post-operatively. 49 eyes of 25 patients in group 1 and 40 eyes of 20 patients in group 2 were enrolled. The patients' visual rehabilitation was significantly faster in group 1, one day and one week post-operatively (P<0.05). From one month onward there was no significant difference between the groups. The epithelial defect size was significantly smaller on post-operative days 1 and 2 for group 1 (P<0.05 in both cases). The pain score was also significantly less in group 1 (P<0.05). The haze level had no significant difference between the groups at any post-operative point (P>0.05). TransPRK using SPT provides promising results in the early post-operative period. Visual rehabilitation, re-epithelialization and pain were faster in the early post-operative period in group 1 in comparison with group 2. Haze formation was not significantly different between the two groups; however, it was consistently less in group 1. Copyright © 2016 British Contact Lens Association. Published by Elsevier Ltd. All rights reserved.

Speeding up 3D speckle tracking using PatchMatch

NASA Astrophysics Data System (ADS)

Zontak, Maria; O'Donnell, Matthew

2016-03-01

Echocardiography provides valuable information to diagnose heart dysfunction. A typical exam records several minutes of real-time cardiac images. To enable complete analysis of 3D cardiac strains, 4-D (3-D+t) echocardiography is used. This results in a huge dataset and requires effective automated analysis. Ultrasound speckle tracking is an effective method for tissue motion analysis. It involves correlation of a 3D kernel (block) around a voxel with kernels in later frames. The search region is usually confined to a local neighborhood, due to biomechanical and computational constraints. For high strains and moderate frame-rates, however, this search region will remain large, leading to a considerable computational burden. Moreover, speckle decorrelation (due to high strains) leads to errors in tracking. To solve this, spatial motion coherency between adjacent voxels should be imposed, e.g., by averaging their correlation functions.1 This requires storing correlation functions for neighboring voxels, thus increasing memory demands. In this work, we propose an efficient search using PatchMatch, 2 a powerful method to find correspondences between images. Here we adopt PatchMatch for 3D volumes and radio-frequency signals. As opposed to an exact search, PatchMatch performs random sampling of the search region and propagates successive matches among neighboring voxels. We show that: 1) Inherently smooth offset propagation in PatchMatch contributes to spatial motion coherence without any additional processing or memory demand. 2) For typical scenarios, PatchMatch is at least 20 times faster than the exact search, while maintaining comparable tracking accuracy.

Rapid broad area search and detection of Chinese surface-to-air missile sites using deep convolutional neural networks

NASA Astrophysics Data System (ADS)

Marcum, Richard A.; Davis, Curt H.; Scott, Grant J.; Nivin, Tyler W.

2017-10-01

We evaluated how deep convolutional neural networks (DCNN) could assist in the labor-intensive process of human visual searches for objects of interest in high-resolution imagery over large areas of the Earth's surface. Various DCNN were trained and tested using fewer than 100 positive training examples (China only) from a worldwide surface-to-air-missile (SAM) site dataset. A ResNet-101 DCNN achieved a 98.2% average accuracy for the China SAM site data. The ResNet-101 DCNN was used to process ˜19.6 M image chips over a large study area in southeastern China. DCNN chip detections (˜9300) were postprocessed with a spatial clustering algorithm to produce a ranked list of ˜2100 candidate SAM site locations. The combination of DCNN processing and spatial clustering effectively reduced the search area by ˜660X (0.15% of the DCNN-processed land area). An efficient web interface was used to facilitate a rapid serial human review of the candidate SAM sites in the China study area. Four novice imagery analysts with no prior imagery analysis experience were able to complete a DCNN-assisted SAM site search in an average time of ˜42 min. This search was ˜81X faster than a traditional visual search over an equivalent land area of ˜88,640 km2 while achieving nearly identical statistical accuracy (˜90% F1).

Adaptive infinite impulse response system identification using modified-interior search algorithm with Lèvy flight.

PubMed

Kumar, Manjeet; Rawat, Tarun Kumar; Aggarwal, Apoorva

2017-03-01

In this paper, a new meta-heuristic optimization technique, called interior search algorithm (ISA) with Lèvy flight is proposed and applied to determine the optimal parameters of an unknown infinite impulse response (IIR) system for the system identification problem. ISA is based on aesthetics, which is commonly used in interior design and decoration processes. In ISA, composition phase and mirror phase are applied for addressing the nonlinear and multimodal system identification problems. System identification using modified-ISA (M-ISA) based method involves faster convergence, single parameter tuning and does not require derivative information because it uses a stochastic random search using the concepts of Lèvy flight. A proper tuning of control parameter has been performed in order to achieve a balance between intensification and diversification phases. In order to evaluate the performance of the proposed method, mean square error (MSE), computation time and percentage improvement are considered as the performance measure. To validate the performance of M-ISA based method, simulations has been carried out for three benchmarked IIR systems using same order and reduced order system. Genetic algorithm (GA), particle swarm optimization (PSO), cat swarm optimization (CSO), cuckoo search algorithm (CSA), differential evolution using wavelet mutation (DEWM), firefly algorithm (FFA), craziness based particle swarm optimization (CRPSO), harmony search (HS) algorithm, opposition based harmony search (OHS) algorithm, hybrid particle swarm optimization-gravitational search algorithm (HPSO-GSA) and ISA are also used to model the same examples and simulation results are compared. Obtained results confirm the efficiency of the proposed method. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Anti Submarine Warfare Search Models

DTIC Science & Technology

2016-09-01

worthwhile to send a helicopter out to search for the target? The answer to this operational question depends on the probability of finding the target and...fist,” and “lungs” of the ASW weapon. This balance certainly depends upon the mission and the tactical parameters of the associated scenario. For...effectiveness of search models depends on the scenario and assumptions made, and one can never perfectly model an operational scenario. Each chapter

76 FR 56097 - Special Conditions: Pratt and Whitney Canada Model PT6C-67E Turboshaft Engine

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-12

...) power rating. This rating is primarily intended for high power hovering operations during search and... rotorcraft search and rescue missions that require extensive hover operations at high power. The use of 30...

Application of kernel functions for accurate similarity search in large chemical databases.

PubMed

Wang, Xiaohong; Huan, Jun; Smalter, Aaron; Lushington, Gerald H

2010-04-29

Similarity search in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screening among others. It is widely believed that structure based methods provide an efficient way to do the query. Recently various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models, graph kernel functions can not be applied to large chemical compound database due to the high computational complexity and the difficulties in indexing similarity search for large databases. To bridge graph kernel function and similarity search in chemical databases, we applied a novel kernel-based similarity measurement, developed in our team, to measure similarity of graph represented chemicals. In our method, we utilize a hash table to support new graph kernel function definition, efficient storage and fast search. We have applied our method, named G-hash, to large chemical databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Moreover, the similarity measurement and the index structure is scalable to large chemical databases with smaller indexing size, and faster query processing time as compared to state-of-the-art indexing methods such as Daylight fingerprints, C-tree and GraphGrep. Efficient similarity query processing method for large chemical databases is challenging since we need to balance running time efficiency and similarity search accuracy. Our previous similarity search method, G-hash, provides a new way to perform similarity search in chemical databases. Experimental study validates the utility of G-hash in chemical databases.

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

PubMed

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

2018-01-01

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

Monitoring Processes in Visual Search Enhanced by Professional Experience: The Case of Orange Quality-Control Workers

PubMed Central

Visalli, Antonino; Vallesi, Antonino

2018-01-01

Visual search tasks have often been used to investigate how cognitive processes change with expertise. Several studies have shown visual experts' advantages in detecting objects related to their expertise. Here, we tried to extend these findings by investigating whether professional search experience could boost top-down monitoring processes involved in visual search, independently of advantages specific to objects of expertise. To this aim, we recruited a group of quality-control workers employed in citrus farms. Given the specific features of this type of job, we expected that the extensive employment of monitoring mechanisms during orange selection could enhance these mechanisms even in search situations in which orange-related expertise is not suitable. To test this hypothesis, we compared performance of our experimental group and of a well-matched control group on a computerized visual search task. In one block the target was an orange (expertise target) while in the other block the target was a Smurfette doll (neutral target). The a priori hypothesis was to find an advantage for quality-controllers in those situations in which monitoring was especially involved, that is, when deciding the presence/absence of the target required a more extensive inspection of the search array. Results were consistent with our hypothesis. Quality-controllers were faster in those conditions that extensively required monitoring processes, specifically, the Smurfette-present and both target-absent conditions. No differences emerged in the orange-present condition, which resulted to mainly rely on bottom-up processes. These results suggest that top-down processes in visual search can be enhanced through immersive real-life experience beyond visual expertise advantages. PMID:29497392

Research on particle swarm optimization algorithm based on optimal movement probability

NASA Astrophysics Data System (ADS)

Ma, Jianhong; Zhang, Han; He, Baofeng

2017-01-01

The particle swarm optimization algorithm to improve the control precision, and has great application value training neural network and fuzzy system control fields etc.The traditional particle swarm algorithm is used for the training of feed forward neural networks,the search efficiency is low, and easy to fall into local convergence.An improved particle swarm optimization algorithm is proposed based on error back propagation gradient descent. Particle swarm optimization for Solving Least Squares Problems to meme group, the particles in the fitness ranking, optimization problem of the overall consideration, the error back propagation gradient descent training BP neural network, particle to update the velocity and position according to their individual optimal and global optimization, make the particles more to the social optimal learning and less to its optimal learning, it can avoid the particles fall into local optimum, by using gradient information can accelerate the PSO local search ability, improve the multi beam particle swarm depth zero less trajectory information search efficiency, the realization of improved particle swarm optimization algorithm. Simulation results show that the algorithm in the initial stage of rapid convergence to the global optimal solution can be near to the global optimal solution and keep close to the trend, the algorithm has faster convergence speed and search performance in the same running time, it can improve the convergence speed of the algorithm, especially the later search efficiency.

The mechanisms underlying the ASD advantage in visual search

PubMed Central

Kaldy, Zsuzsa; Giserman, Ivy; Carter, Alice S.; Blaser, Erik

2013-01-01

A number of studies have demonstrated that individuals with Autism Spectrum Disorders (ASD) are faster or more successful than typically developing control participants at various visual-attentional tasks (for reviews, see Dakin & Frith, 2005; Simmons, et al., 2009). This “ASD advantage” was first identified in the domain of visual search by Plaisted and colleagues (Plaisted, O’Riordan, & Baron-Cohen, 1998). Here we survey the findings of visual search studies from the past 15 years that contrasted the performance of individuals with and without ASD. Although there are some minor caveats, the overall consensus is that - across development and a broad range of symptom severity - individuals with ASD reliably outperform controls on visual search. The etiology of the ASD advantage has not been formally specified, but has been commonly attributed to ‘enhanced perceptual discrimination’, a superior ability to visually discriminate between targets and distractors in such tasks (e.g. O’Riordan, 2000). As well, there is considerable evidence for impairments of the attentional network in ASD (for a review, see Keehn, Muller, & Townsend, 2013). We discuss some recent results from our laboratory that support an attentional, rather than perceptual explanation for the ASD advantage in visual search. We speculate that this new conceptualization may offer a better understanding of some of the behavioral symptoms associated with ASD, such as over-focusing and restricted interests. PMID:24091470

Customer Relationship Management.

ERIC Educational Resources Information Center

Fayerman, Michael

2002-01-01

Presents an approach increasingly employed by businesses to track and respond to their customers to provide better and faster services: customer relationship management. Discusses its applicability to the operations of higher education and institutional research and the role it plays in the knowledge management framework. (EV)

Combining Speed Information Across Space

NASA Technical Reports Server (NTRS)

Verghese, Preeti; Stone, Leland S.

1995-01-01

We used speed discrimination tasks to measure the ability of observers to combine speed information from multiple stimuli distributed across space. We compared speed discrimination thresholds in a classical discrimination paradigm to those in an uncertainty/search paradigm. Thresholds were measured using a temporal two-interval forced-choice design. In the discrimination paradigm, the n gratings in each interval all moved at the same speed and observers were asked to choose the interval with the faster gratings. Discrimination thresholds for this paradigm decreased as the number of gratings increased. This decrease was not due to increasing the effective stimulus area as a control experiment that increased the area of a single grating did not show a similar improvement in thresholds. Adding independent speed noise to each of the n gratings caused thresholds to decrease at a rate similar to the original no-noise case, consistent with observers combining an independent sample of speed from each grating in both the added- and no-noise cases. In the search paradigm, observers were asked to choose the interval in which one of the n gratings moved faster. Thresholds in this case increased with the number of gratings, behavior traditionally attributed to an input bottleneck. However, results from the discrimination paradigm showed that the increase was not due to observers' inability to process these gratings. We have also shown that the opposite trends of the data in the two paradigms can be predicted by a decision theory model that combines independent samples of speed information across space. This demonstrates that models typically used in classical detection and discrimination paradigms are also applicable to search paradigms. As our model does not distinguish between samples in space and time, it predicts that discrimination performance should be the same regardless of whether the gratings are presented in two spatial intervals or two temporal intervals. Our last experiment largely confirmed this prediction.

Discharge measurements using a broad-band acoustic Doppler current profiler

USGS Publications Warehouse

Simpson, Michael R.

2002-01-01

The measurement of unsteady or tidally affected flow has been a problem faced by hydrologists for many years. Dynamic discharge conditions impose an unreasonably short time constraint on conventional current-meter discharge-measurement methods, which typically last a minimum of 1 hour. Tidally affected discharge can change more than 100 percent during a 10-minute period. Over the years, the U.S. Geological Survey (USGS) has developed moving-boat discharge-measurement techniques that are much faster but less accurate than conventional methods. For a bibliography of conventional moving-boat publications, see Simpson and Oltmann (1993, page 17). The advent of the acoustic Doppler current profiler (ADCP) made possible the development of a discharge-measurement system capable of more accurately measuring unsteady or tidally affected flow. In most cases, an ADCP discharge-measurement system is dramatically faster than conventional discharge-measurement systems, and has comparable or better accuracy. In many cases, an ADCP discharge-measurement system is the only choice for use at a particular measurement site. ADCP systems are not yet ?turnkey;? they are still under development, and for proper operation, require a significant amount of operator training. Not only must the operator have a rudimentary knowledge of acoustic physics, but also a working knowledge of ADCP operation, the manufacturer's discharge-measurement software, and boating techniques and safety.

Turbine and superheater bypass evaluation. Final report. [Faster startup in cycling operation and less erosion with steam bypass systems, including bypass design

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

Rosard, D.D.; Steltz, W.G.

1986-10-01

Properly sized turbine and boiler bypass systems permit two-shift cycling operation of units, shorten start-up time, and reduce life expenditures of plant components. With bypasses installed, faster startups can reduce fuel costs by $100,000 per year for a typical 500-MW fossil-fired unit. This report discusses the technical characteristics of existing bypass systems and provides guidelines for sizing bypass systems to achieve economical and reliable two-shift operation. The collection and analysis of startup data from several generating units were used in conjunction with computer simulations to illustrate the effects of adding various arrangements and sizes of steam bypass systems. The report,more » which indicates that shutdown procedures have significant impact on subsequent startup and loading time, describes operating practices to optimize the effectiveness of bypass systems. To determine the effectiveness of large turbine bypass systems of less than 100% capacity in preventing boiler trips following load rejection, transient field data were compared to a load rejection simulation using the modular modeling system (MMS). The MMS was then used to predict system response to other levels of load rejection. 7 refs., 87 figs., 8 tabs.« less

Digital Equipment Corporation's CRDOM Software and Database Publications.

ERIC Educational Resources Information Center

Adams, Michael Q.

1986-01-01

Acquaints information professionals with Digital Equipment Corporation's compact optical disk read-only-memory (CDROM) search and retrieval software and growing library of CDROM database publications (COMPENDEX, Chemical Abstracts Services). Highlights include MicroBASIS, boolean operators, range operators, word and phrase searching, proximity…

Time Management in the Operating Room: An Analysis of the Dedicated Minimally Invasive Surgery Suite

PubMed Central

Hsiao, Kenneth C.; Machaidze, Zurab

2004-01-01

Background: Dedicated minimally invasive surgery suites are available that contain specialized equipment to facilitate endoscopic surgery. Laparoscopy performed in a general operating room is hampered by the multitude of additional equipment that must be transported into the room. The objective of this study was to compare the preparation times between procedures performed in traditional operating rooms versus dedicated minimally invasive surgery suites to see whether operating room efficiency is improved in the specialized room. Methods: The records of 50 patients who underwent laparoscopic procedures between September 2000 and April 2002 were retrospectively reviewed. Twenty-three patients underwent surgery in a general operating room and 18 patients in an minimally invasive surgery suite. Nine patients were excluded because of cystoscopic procedures undergone prior to laparoscopy. Various time points were recorded from which various time intervals were derived, such as preanesthesia time, anesthesia induction time, and total preparation time. A 2-tailed, unpaired Student t test was used for statistical analysis. Results: The mean preanesthesia time was significantly faster in the minimally invasive surgery suite (12.2 minutes) compared with that in the traditional operating room (17.8 minutes) (P=0.013). Mean anesthesia induction time in the minimally invasive surgery suite (47.5 minutes) was similar to time in the traditional operating room (45.7 minutes) (P=0.734). The average total preparation time for the minimally invasive surgery suite (59.6 minutes) was not significantly faster than that in the general operating room (63.5 minutes) (P=0.481). Conclusion: The amount of time that elapses between the patient entering the room and anesthesia induction is statically shorter in a dedicated minimally invasive surgery suite. Laparoscopic surgery is performed more efficiently in a dedicated minimally invasive surgery suite versus a traditional operating room. PMID:15554269

Contextual cueing in multiconjunction visual search is dependent on color- and configuration-based intertrial contingencies.

PubMed

Geyer, Thomas; Shi, Zhuanghua; Müller, Hermann J

2010-06-01

Three experiments examined memory-based guidance of visual search using a modified version of the contextual-cueing paradigm (Jiang & Chun, 2001). The target, if present, was a conjunction of color and orientation, with target (and distractor) features randomly varying across trials (multiconjunction search). Under these conditions, reaction times (RTs) were faster when all items in the display appeared at predictive ("old") relative to nonpredictive ("new") locations. However, this RT benefit was smaller compared to when only one set of items, namely that sharing the target's color (but not that in the alternative color) appeared in predictive arrangement. In all conditions, contextual cueing was reliable on both target-present and -absent trials and enhanced if a predictive display was preceded by a predictive (though differently arranged) display, rather than a nonpredictive display. These results suggest that (1) contextual cueing is confined to color subsets of items, that (2) retrieving contextual associations for one color subset of items can be impeded by associations formed within the alternative subset ("contextual interference"), and (3) that contextual cueing is modulated by intertrial priming.

Searching for differences in race: is there evidence for preferential detection of other-race faces?

PubMed

Lipp, Ottmar V; Terry, Deborah J; Smith, Joanne R; Tellegen, Cassandra L; Kuebbeler, Jennifer; Newey, Mareka

2009-06-01

Previous research has suggested that like animal and social fear-relevant stimuli, other-race faces (African American) are detected preferentially in visual search. Three experiments using Chinese or Indonesian faces as other-race faces yielded the opposite pattern of results: faster detection of same-race faces among other-race faces. This apparently inconsistent pattern of results was resolved by showing that Asian and African American faces are detected preferentially in tasks that have small stimulus sets and employ fixed target searches. Asian and African American other-race faces are found slower among Caucasian face backgrounds if larger stimulus sets are used in tasks with a variable mapping of stimulus to background or target. Thus, preferential detection of other-race faces was not found under task conditions in which preferential detection of animal and social fear-relevant stimuli is evident. Although consistent with the view that same-race faces are processed in more detail than other-race faces, the current findings suggest that other-race faces do not draw attention preferentially.

Reverse engineering a gene network using an asynchronous parallel evolution strategy

PubMed Central

2010-01-01

Background The use of reverse engineering methods to infer gene regulatory networks by fitting mathematical models to gene expression data is becoming increasingly popular and successful. However, increasing model complexity means that more powerful global optimisation techniques are required for model fitting. The parallel Lam Simulated Annealing (pLSA) algorithm has been used in such approaches, but recent research has shown that island Evolutionary Strategies can produce faster, more reliable results. However, no parallel island Evolutionary Strategy (piES) has yet been demonstrated to be effective for this task. Results Here, we present synchronous and asynchronous versions of the piES algorithm, and apply them to a real reverse engineering problem: inferring parameters in the gap gene network. We find that the asynchronous piES exhibits very little communication overhead, and shows significant speed-up for up to 50 nodes: the piES running on 50 nodes is nearly 10 times faster than the best serial algorithm. We compare the asynchronous piES to pLSA on the same test problem, measuring the time required to reach particular levels of residual error, and show that it shows much faster convergence than pLSA across all optimisation conditions tested. Conclusions Our results demonstrate that the piES is consistently faster and more reliable than the pLSA algorithm on this problem, and scales better with increasing numbers of nodes. In addition, the piES is especially well suited to further improvements and adaptations: Firstly, the algorithm's fast initial descent speed and high reliability make it a good candidate for being used as part of a global/local search hybrid algorithm. Secondly, it has the potential to be used as part of a hierarchical evolutionary algorithm, which takes advantage of modern multi-core computing architectures. PMID:20196855

Using Content Distribution Networks for Astronomy Outreach

NASA Astrophysics Data System (ADS)

Jäger, M.; Christiansen, L. L.; André, M.

2015-09-01

Thousands of people from all over the world search the internet on a daily basis for the newest discoveries in astronomy: be it in the form of press releases, high resolution images, videos or even planetarium fulldome content. The growing amount of data available, combined with the increasing number of media files and users distributed across the globe, leads to a significant decrease in speed for those users located furthest from the server delivering the content. One solution for bringing astronomical content to users faster is to use a content delivery network.

Advanced plastic scintillators for fast neutron discrimination

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

Feng, Patrick L; Anstey, Mitchell; Doty, F. Patrick

2014-09-01

The present work addresses the need for solid-state, fast neutron discriminating scintillators that possess higher light yields and faster decay kinetics than existing organic scintillators. These respective attributes are of critical importance for improving the gamma-rejection capabilities and increasing the neutron discrimination performance under high-rate conditions. Two key applications that will benefit from these improvements include large-volume passive detection scenarios as well as active interrogation search for special nuclear materials. Molecular design principles were employed throughout this work, resulting in synthetically tailored materials that possess the targeted scintillation properties.

Efficient solution of the simplified P N equations

DOE PAGES

Hamilton, Steven P.; Evans, Thomas M.

2014-12-23

We show new solver strategies for the multigroup SPN equations for nuclear reactor analysis. By forming the complete matrix over space, moments, and energy a robust set of solution strategies may be applied. Moreover, power iteration, shifted power iteration, Rayleigh quotient iteration, Arnoldi's method, and a generalized Davidson method, each using algebraic and physics-based multigrid preconditioners, have been compared on C5G7 MOX test problem as well as an operational PWR model. These results show that the most ecient approach is the generalized Davidson method, that is 30-40 times faster than traditional power iteration and 6-10 times faster than Arnoldi's method.

Anatomy of a hash-based long read sequence mapping algorithm for next generation DNA sequencing.

PubMed

Misra, Sanchit; Agrawal, Ankit; Liao, Wei-keng; Choudhary, Alok

2011-01-15

Recently, a number of programs have been proposed for mapping short reads to a reference genome. Many of them are heavily optimized for short-read mapping and hence are very efficient for shorter queries, but that makes them inefficient or not applicable for reads longer than 200 bp. However, many sequencers are already generating longer reads and more are expected to follow. For long read sequence mapping, there are limited options; BLAT, SSAHA2, FANGS and BWA-SW are among the popular ones. However, resequencing and personalized medicine need much faster software to map these long sequencing reads to a reference genome to identify SNPs or rare transcripts. We present AGILE (AliGnIng Long rEads), a hash table based high-throughput sequence mapping algorithm for longer 454 reads that uses diagonal multiple seed-match criteria, customized q-gram filtering and a dynamic incremental search approach among other heuristics to optimize every step of the mapping process. In our experiments, we observe that AGILE is more accurate than BLAT, and comparable to BWA-SW and SSAHA2. For practical error rates (< 5%) and read lengths (200-1000 bp), AGILE is significantly faster than BLAT, SSAHA2 and BWA-SW. Even for the other cases, AGILE is comparable to BWA-SW and several times faster than BLAT and SSAHA2. http://www.ece.northwestern.edu/~smi539/agile.html.

Vehicle Detection in Aerial Images Based on Region Convolutional Neural Networks and Hard Negative Example Mining.

PubMed

Tang, Tianyu; Zhou, Shilin; Deng, Zhipeng; Zou, Huanxin; Lei, Lin

2017-02-10

Detecting vehicles in aerial imagery plays an important role in a wide range of applications. The current vehicle detection methods are mostly based on sliding-window search and handcrafted or shallow-learning-based features, having limited description capability and heavy computational costs. Recently, due to the powerful feature representations, region convolutional neural networks (CNN) based detection methods have achieved state-of-the-art performance in computer vision, especially Faster R-CNN. However, directly using it for vehicle detection in aerial images has many limitations: (1) region proposal network (RPN) in Faster R-CNN has poor performance for accurately locating small-sized vehicles, due to the relatively coarse feature maps; and (2) the classifier after RPN cannot distinguish vehicles and complex backgrounds well. In this study, an improved detection method based on Faster R-CNN is proposed in order to accomplish the two challenges mentioned above. Firstly, to improve the recall, we employ a hyper region proposal network (HRPN) to extract vehicle-like targets with a combination of hierarchical feature maps. Then, we replace the classifier after RPN by a cascade of boosted classifiers to verify the candidate regions, aiming at reducing false detection by negative example mining. We evaluate our method on the Munich vehicle dataset and the collected vehicle dataset, with improvements in accuracy and robustness compared to existing methods.

Rethinking the concept of sepsis and septic shock.

PubMed

A Cabrita, Joana; Pinheiro, Isabel; Menezes Falcão, L

2018-06-16

Sepsis is a major global health problem and represents a challenge for physicians all over the world. The knowledge of sepsis and septic shock is a topic of interest among the scientific community and society in general. New guidelines for management of sepsis and septic shock were developed in 2016, providing an update on this area. In Sepsis-3 new definitions for sepsis and septic shock were published. The purpose of this narrative review is to discuss and compare the new criteria of 2016 with the old criteria, purposing at the same time an alternative approach for this topic. SOFA criteria (Sequential Organ Failure Assessment Score) are more complete, but too extensive and usually difficult to apply outside the intensive care units, therefore inducing potentially delay in the proper treatment. We purpose combined criteria for the selection of sepsis patients. Initially, we could apply qSOFA (quick Sepsis Related Organ Failure Assessment) criteria, due to its easy application, associated with the SIRS (systemic inflammatory response syndrome) criteria, allowing to select the patients who are infected and need faster treatment. In that way we would use the best of old and newest criteria, allowing the early selection of patients who are infected and require faster treatment, while the search for a better and faster tool continues. Copyright © 2018 European Federation of Internal Medicine. Published by Elsevier B.V. All rights reserved.

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

PubMed

Kawahara, Jun-ichiro

2010-09-01

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

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

Annealing Ant Colony Optimization with Mutation Operator for Solving TSP

PubMed Central

2016-01-01

Ant Colony Optimization (ACO) has been successfully applied to solve a wide range of combinatorial optimization problems such as minimum spanning tree, traveling salesman problem, and quadratic assignment problem. Basic ACO has drawbacks of trapping into local minimum and low convergence rate. Simulated annealing (SA) and mutation operator have the jumping ability and global convergence; and local search has the ability to speed up the convergence. Therefore, this paper proposed a hybrid ACO algorithm integrating the advantages of ACO, SA, mutation operator, and local search procedure to solve the traveling salesman problem. The core of algorithm is based on the ACO. SA and mutation operator were used to increase the ants population diversity from time to time and the local search was used to exploit the current search area efficiently. The comparative experiments, using 24 TSP instances from TSPLIB, show that the proposed algorithm outperformed some well-known algorithms in the literature in terms of solution quality. PMID:27999590

An operational search and rescue model for the Norwegian Sea and the North Sea

NASA Astrophysics Data System (ADS)

Breivik, Øyvind; Allen, Arthur A.

A new operational, ensemble-based search and rescue model for the Norwegian Sea and the North Sea is presented. The stochastic trajectory model computes the net motion of a range of search and rescue objects. A new, robust formulation for the relation between the wind and the motion of the drifting object (termed the leeway of the object) is employed. Empirically derived coefficients for 63 categories of search objects compiled by the US Coast Guard are ingested to estimate the leeway of the drifting objects. A Monte Carlo technique is employed to generate an ensemble that accounts for the uncertainties in forcing fields (wind and current), leeway drift properties, and the initial position of the search object. The ensemble yields an estimate of the time-evolving probability density function of the location of the search object, and its envelope defines the search area. Forcing fields from the operational oceanic and atmospheric forecast system of The Norwegian Meteorological Institute are used as input to the trajectory model. This allows for the first time high-resolution wind and current fields to be used to forecast search areas up to 60 h into the future. A limited set of field exercises show good agreement between model trajectories, search areas, and observed trajectories for life rafts and other search objects. Comparison with older methods shows that search areas expand much more slowly using the new ensemble method with high resolution forcing fields and the new leeway formulation. It is found that going to higher-order stochastic trajectory models will not significantly improve the forecast skill and the rate of expansion of search areas.

Optimizing snow plowing operations in urban road networks : final research report.

DOT National Transportation Integrated Search

2015-01-01

Due to the disruptive effect of snowstorms on cities, both in terms of : mobility and safety, the faster the streets can be cleared the better. Yet in : most cities (including Pittsburgh), static plans for snowplowing are : developed using simple all...

FBC: a flat binary code scheme for fast Manhattan hash retrieval

NASA Astrophysics Data System (ADS)

Kong, Yan; Wu, Fuzhang; Gao, Lifa; Wu, Yanjun

2018-04-01

Hash coding is a widely used technique in approximate nearest neighbor (ANN) search, especially in document search and multimedia (such as image and video) retrieval. Based on the difference of distance measurement, hash methods are generally classified into two categories: Hamming hashing and Manhattan hashing. Benefitting from better neighborhood structure preservation, Manhattan hashing methods outperform earlier methods in search effectiveness. However, due to using decimal arithmetic operations instead of bit operations, Manhattan hashing becomes a more time-consuming process, which significantly decreases the whole search efficiency. To solve this problem, we present an intuitive hash scheme which uses Flat Binary Code (FBC) to encode the data points. As a result, the decimal arithmetic used in previous Manhattan hashing can be replaced by more efficient XOR operator. The final experiments show that with a reasonable memory space growth, our FBC speeds up more than 80% averagely without any search accuracy loss when comparing to the state-of-art Manhattan hashing methods.

Lévy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments

NASA Astrophysics Data System (ADS)

Pasternak, Zohar; Bartumeus, Frederic; Grasso, Frank W.

2009-10-01

Locating chemical plumes in aquatic or terrestrial environments is important for many economic, conservation, security and health related human activities. The localization process is composed mainly of two phases: finding the chemical plume and then tracking it to its source. Plume tracking has been the subject of considerable study whereas plume finding has received little attention. We address here the latter issue, where the searching agent must find the plume in a region often many times larger than the plume and devoid of the relevant chemical cues. The probability of detecting the plume not only depends on the movements of the searching agent but also on the fluid mechanical regime, shaping plume intermittency in space and time; this is a basic, general problem when exploring for ephemeral resources (e.g. moving and/or concealing targets). Here we present a bio-inspired search strategy named Lévy-taxis that, under certain conditions, located odor plumes significantly faster and with a better success rate than other search strategies such as Lévy walks (LW), correlated random walks (CRW) and systematic zig-zag. These results are based on computer simulations which contain, for the first time ever, digitalized real-world water flow and chemical plume instead of their theoretical model approximations. Combining elements of LW and CRW, Lévy-taxis is particularly efficient for searching in flow-dominated environments: it adaptively controls the stochastic search pattern using environmental information (i.e. flow) that is available throughout the course of the search and shows correlation with the source providing the cues. This strategy finds natural application in real-world search missions, both by humans and autonomous robots, since it accomodates the stochastic nature of chemical mixing in turbulent flows. In addition, it may prove useful in the field of behavioral ecology, explaining and predicting the movement patterns of various animals searching for food or mates.

Searching target sites on DNA by proteins: Role of DNA dynamics under confinement

PubMed Central

Mondal, Anupam; Bhattacherjee, Arnab

2015-01-01

DNA-binding proteins (DBPs) rapidly search and specifically bind to their target sites on genomic DNA in order to trigger many cellular regulatory processes. It has been suggested that the facilitation of search dynamics is achieved by combining 3D diffusion with one-dimensional sliding and hopping dynamics of interacting proteins. Although, recent studies have advanced the knowledge of molecular determinants that affect one-dimensional search efficiency, the role of DNA molecule is poorly understood. In this study, by using coarse-grained simulations, we propose that dynamics of DNA molecule and its degree of confinement due to cellular crowding concertedly regulate its groove geometry and modulate the inter-communication with DBPs. Under weak confinement, DNA dynamics promotes many short, rotation-decoupled sliding events interspersed by hopping dynamics. While this results in faster 1D diffusion, associated probability of missing targets by jumping over them increases. In contrast, strong confinement favours rotation-coupled sliding to locate targets but lacks structural flexibility to achieve desired specificity. By testing under physiological crowding, our study provides a plausible mechanism on how DNA molecule may help in maintaining an optimal balance between fast hopping and rotation-coupled sliding dynamics, to locate target sites rapidly and form specific complexes precisely. PMID:26400158

Accelerated Profile HMM Searches

PubMed Central

Eddy, Sean R.

2011-01-01

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

When listening to rain sounds boosts arithmetic ability

PubMed Central

De Benedetto, Francesco; Ferrari, Maria Vittoria; Ferrarini, Giorgia

2018-01-01

Studies in the literature have provided conflicting evidence about the effects of background noise or music on concurrent cognitive tasks. Some studies have shown a detrimental effect, while others have shown a beneficial effect of background auditory stimuli. The aim of this study was to investigate the influence of agitating, happy or touching music, as opposed to environmental sounds or silence, on the ability of non-musician subjects to perform arithmetic operations. Fifty university students (25 women and 25 men, 25 introverts and 25 extroverts) volunteered for the study. The participants were administered 180 easy or difficult arithmetic operations (division, multiplication, subtraction and addition) while listening to heavy rain sounds, silence or classical music. Silence was detrimental when participants were faced with difficult arithmetic operations, as it was associated with significantly worse accuracy and slower RTs than music or rain sound conditions. This finding suggests that the benefit of background stimulation was not music-specific but possibly due to an enhanced cerebral alertness level induced by the auditory stimulation. Introverts were always faster than extroverts in solving mathematical problems, except when the latter performed calculations accompanied by the sound of heavy rain, a condition that made them as fast as introverts. While the background auditory stimuli had no effect on the arithmetic ability of either group in the easy condition, it strongly affected extroverts in the difficult condition, with RTs being faster during agitating or joyful music as well as rain sounds, compared to the silent condition. For introverts, agitating music was associated with faster response times than the silent condition. This group difference may be explained on the basis of the notion that introverts have a generally higher arousal level compared to extroverts and would therefore benefit less from the background auditory stimuli. PMID:29466472

Improved performance in NASTRAN (R)

NASA Technical Reports Server (NTRS)

Chan, Gordon C.

1989-01-01

Three areas of improvement in COSMIC/NASTRAN, 1989 release, were incorporated recently that make the analysis program run faster on large problems. Actual log files and actual timings on a few test samples that were run on IBM, CDC, VAX, and CRAY computers were compiled. The speed improvement is proportional to the problem size and number of continuation cards. Vectorizing certain operations in BANDIT, makes BANDIT run twice as fast in some large problems using structural elements with many node points. BANDIT is a built-in NASTRAN processor that optimizes the structural matrix bandwidth. The VAX matrix packing routine BLDPK was modified so that it is now packing a column of a matrix 3 to 9 times faster. The denser and bigger the matrix, the greater is the speed improvement. This improvement makes a host of routines and modules that involve matrix operation run significantly faster, and saves disc space for dense matrices. A UNIX version, converted from 1988 COSMIC/NASTRAN, was tested successfully on a Silicon Graphics computer using the UNIX V Operating System, with Berkeley 4.3 Extensions. The Utility Modules INPUTT5 and OUTPUT5 were expanded to handle table data, as well as matrices. Both INPUTT5 and OUTPUT5 are general input/output modules that read and write FORTRAN files with or without format. More user informative messages are echoed from PARAMR, PARAMD, and SCALAR modules to ensure proper data values and data types being handled. Two new Utility Modules, GINOFILE and DATABASE, were written for the 1989 release. Seven rigid elements are added to COSMIC/NASTRAN. They are: CRROD, CRBAR, CRTRPLT, CRBE1, CRBE2, CRBE3, and CRSPLINE.

Parallel heterogeneous architectures for efficient OMP compressive sensing reconstruction

NASA Astrophysics Data System (ADS)

Kulkarni, Amey; Stanislaus, Jerome L.; Mohsenin, Tinoosh

2014-05-01

Compressive Sensing (CS) is a novel scheme, in which a signal that is sparse in a known transform domain can be reconstructed using fewer samples. The signal reconstruction techniques are computationally intensive and have sluggish performance, which make them impractical for real-time processing applications . The paper presents novel architectures for Orthogonal Matching Pursuit algorithm, one of the popular CS reconstruction algorithms. We show the implementation results of proposed architectures on FPGA, ASIC and on a custom many-core platform. For FPGA and ASIC implementation, a novel thresholding method is used to reduce the processing time for the optimization problem by at least 25%. Whereas, for the custom many-core platform, efficient parallelization techniques are applied, to reconstruct signals with variant signal lengths of N and sparsity of m. The algorithm is divided into three kernels. Each kernel is parallelized to reduce execution time, whereas efficient reuse of the matrix operators allows us to reduce area. Matrix operations are efficiently paralellized by taking advantage of blocked algorithms. For demonstration purpose, all architectures reconstruct a 256-length signal with maximum sparsity of 8 using 64 measurements. Implementation on Xilinx Virtex-5 FPGA, requires 27.14 μs to reconstruct the signal using basic OMP. Whereas, with thresholding method it requires 18 μs. ASIC implementation reconstructs the signal in 13 μs. However, our custom many-core, operating at 1.18 GHz, takes 18.28 μs to complete. Our results show that compared to the previous published work of the same algorithm and matrix size, proposed architectures for FPGA and ASIC implementations perform 1.3x and 1.8x respectively faster. Also, the proposed many-core implementation performs 3000x faster than the CPU and 2000x faster than the GPU.

When listening to rain sounds boosts arithmetic ability.

PubMed

Proverbio, Alice Mado; De Benedetto, Francesco; Ferrari, Maria Vittoria; Ferrarini, Giorgia

2018-01-01

Studies in the literature have provided conflicting evidence about the effects of background noise or music on concurrent cognitive tasks. Some studies have shown a detrimental effect, while others have shown a beneficial effect of background auditory stimuli. The aim of this study was to investigate the influence of agitating, happy or touching music, as opposed to environmental sounds or silence, on the ability of non-musician subjects to perform arithmetic operations. Fifty university students (25 women and 25 men, 25 introverts and 25 extroverts) volunteered for the study. The participants were administered 180 easy or difficult arithmetic operations (division, multiplication, subtraction and addition) while listening to heavy rain sounds, silence or classical music. Silence was detrimental when participants were faced with difficult arithmetic operations, as it was associated with significantly worse accuracy and slower RTs than music or rain sound conditions. This finding suggests that the benefit of background stimulation was not music-specific but possibly due to an enhanced cerebral alertness level induced by the auditory stimulation. Introverts were always faster than extroverts in solving mathematical problems, except when the latter performed calculations accompanied by the sound of heavy rain, a condition that made them as fast as introverts. While the background auditory stimuli had no effect on the arithmetic ability of either group in the easy condition, it strongly affected extroverts in the difficult condition, with RTs being faster during agitating or joyful music as well as rain sounds, compared to the silent condition. For introverts, agitating music was associated with faster response times than the silent condition. This group difference may be explained on the basis of the notion that introverts have a generally higher arousal level compared to extroverts and would therefore benefit less from the background auditory stimuli.

The Future Mission Tasking and Resourcing of the U.S. Coast Guard Auxiliary

DTIC Science & Technology

2012-09-01

Time Between Overhaul TC Transport Canada USPS U.S. Power Squadrons VE Vessel Examination VISAR Virgin Islands Search and Rescue VSC...70% of the nation’s search and rescue with 1,800 volunteers who serve at 66 stations and operate 160 lifeboats.52 (7) The (British) Virgin Islands...Search and Rescue (VISAR). It was modeled after RNLI and operates two rescue boats, one based on Tortola, and the other Virgin Gorda. The

Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder

NASA Astrophysics Data System (ADS)

Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian

2018-04-01

Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.

Contextual remapping in visual search after predictable target-location changes.

PubMed

Conci, Markus; Sun, Luning; Müller, Hermann J

2011-07-01

Invariant spatial context can facilitate visual search. For instance, detection of a target is faster if it is presented within a repeatedly encountered, as compared to a novel, layout of nontargets, demonstrating a role of contextual learning for attentional guidance ('contextual cueing'). Here, we investigated how context-based learning adapts to target location (and identity) changes. Three experiments were performed in which, in an initial learning phase, observers learned to associate a given context with a given target location. A subsequent test phase then introduced identity and/or location changes to the target. The results showed that contextual cueing could not compensate for target changes that were not 'predictable' (i.e. learnable). However, for predictable changes, contextual cueing remained effective even immediately after the change. These findings demonstrate that contextual cueing is adaptive to predictable target location changes. Under these conditions, learned contextual associations can be effectively 'remapped' to accommodate new task requirements.

Proficiency of individuals with autism spectrum disorder at disembedding figures: A systematic review.

PubMed

Horlin, Chiara; Black, Melissa; Falkmer, Marita; Falkmer, Torbjorn

2016-01-01

This systematic review examines the proficiency and visual search strategies of individuals with autism spectrum disorders (ASD) while disembedding figures and whether they differ from typical controls and other comparative samples. Five databases, including Proquest, Psychinfo, Medline, CINAHL and Science Direct were used to identify published studies meeting the inclusion and exclusion criteria. Twenty articles were included in the review, the majority of which matched participants by mental age. Outcomes discussed were time taken to identify targets, the number correctly identified, and fixation frequency and duration. Individuals with ASD perform at the same speed or faster than controls and other clinical samples. However, there appear to be no differences between individuals with ASD and controls for number of correctly identified targets. Only one study examined visual search strategies and suggests that individuals with ASD exhibit shorter first and final fixations to targets compared with controls.

Accurate Grid-based Clustering Algorithm with Diagonal Grid Searching and Merging

NASA Astrophysics Data System (ADS)

Liu, Feng; Ye, Chengcheng; Zhu, Erzhou

2017-09-01

Due to the advent of big data, data mining technology has attracted more and more attentions. As an important data analysis method, grid clustering algorithm is fast but with relatively lower accuracy. This paper presents an improved clustering algorithm combined with grid and density parameters. The algorithm first divides the data space into the valid meshes and invalid meshes through grid parameters. Secondly, from the starting point located at the first point of the diagonal of the grids, the algorithm takes the direction of “horizontal right, vertical down” to merge the valid meshes. Furthermore, by the boundary grid processing, the invalid grids are searched and merged when the adjacent left, above, and diagonal-direction grids are all the valid ones. By doing this, the accuracy of clustering is improved. The experimental results have shown that the proposed algorithm is accuracy and relatively faster when compared with some popularly used algorithms.

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

Fast dictionary generation and searching for magnetic resonance fingerprinting.

PubMed

Jun Xie; Mengye Lyu; Jian Zhang; Hui, Edward S; Wu, Ed X; Ze Wang

2017-07-01

A super-fast dictionary generation and searching (DGS) algorithm was developed for MR parameter quantification using magnetic resonance fingerprinting (MRF). MRF is a new technique for simultaneously quantifying multiple MR parameters using one temporally resolved MR scan. But it has a multiplicative computation complexity, resulting in a big burden of dictionary generating, saving, and retrieving, which can easily be intractable for any state-of-art computers. Based on retrospective analysis of the dictionary matching object function, a multi-scale ZOOM like DGS algorithm, dubbed as MRF-ZOOM, was proposed. MRF ZOOM is quasi-parameter-separable so the multiplicative computation complexity is broken into additive one. Evaluations showed that MRF ZOOM was hundreds or thousands of times faster than the original MRF parameter quantification method even without counting the dictionary generation time in. Using real data, it yielded nearly the same results as produced by the original method. MRF ZOOM provides a super-fast solution for MR parameter quantification.

Difficulties and challenges associated with literature searches in operating room management, complete with recommendations.

PubMed

Wachtel, Ruth E; Dexter, Franklin

2013-12-01

The purpose of this article is to teach operating room managers, financial analysts, and those with a limited knowledge of search engines, including PubMed, how to locate articles they need in the areas of operating room and anesthesia group management. Many physicians are unaware of current literature in their field and evidence-based practices. The most common source of information is colleagues. Many people making management decisions do not read published scientific articles. Databases such as PubMed are available to search for such articles. Other databases, such as citation indices and Google Scholar, can be used to uncover additional articles. Nevertheless, most people who do not know how to use these databases are reluctant to utilize help resources when they do not know how to accomplish a task. Most people are especially reluctant to use on-line help files. Help files and search databases are often difficult to use because they have been designed for users already familiar with the field. The help files and databases have specialized vocabularies unique to the application. MeSH terms in PubMed are not useful alternatives for operating room management, an important limitation, because MeSH is the default when search terms are entered in PubMed. Librarians or those trained in informatics can be valuable assets for searching unusual databases, but they must possess the domain knowledge relative to the subject they are searching. The search methods we review are especially important when the subject area (e.g., anesthesia group management) is so specific that only 1 or 2 articles address the topic of interest. The materials are presented broadly enough that the reader can extrapolate the findings to other areas of clinical and management issues in anesthesiology.

21 CFR 1401.10 - Fees to be charged-general.

Code of Federal Regulations, 2011 CFR

2011-04-01

... search. (b) Computerized search for records. ONDCP will charge 116% of the salary of the programmer/operator and the apportionable time of the central processing unit directly attributed to the search. (c...

21 CFR 1401.10 - Fees to be charged-general.

Code of Federal Regulations, 2010 CFR

2010-04-01

... search. (b) Computerized search for records. ONDCP will charge 116% of the salary of the programmer/operator and the apportionable time of the central processing unit directly attributed to the search. (c...

Ambulance helicopter contribution to search and rescue in North Norway.

PubMed

Glomseth, Ragnar; Gulbrandsen, Fritz I; Fredriksen, Knut

2016-09-13

Search and rescue (SAR) operations constitute a significant proportion of Norwegian ambulance helicopter missions, and they may limit the service's capacity for medical operations. We compared the relative contribution of the different helicopter resources using a common definition of SAR-operation in order to investigate how the SAR workload had changed over the last years. We searched the mission databases at the relevant SAR and helicopter emergency medical service (HEMS) bases and the Joint Rescue Coordination Centre (North) for helicopter-supported SAR operations within the potential operation area of the Tromsø HEMS base in 2000-2010. We defined SAR operations as missions over land or sea within 10 nautical miles from the coast with an initial search phase, missions with use of rescue hoist or static rope, and avalanche operations. There were 769 requests in 639 different SAR operations, and 600 missions were completed. The number increased during the study period, from 46 in 2000 to 77 in 2010. The Tromsø HEMS contributed with the highest number of missions and experienced the largest increase, from 10 % of the operations in 2000 to 50 % in 2010. Simple terrain and sea operations dominated, and avalanches accounted for as many as 12 % of all missions. The helicopter crews used static rope or rescue hoist in 141 operations. We have described all helicopter supported SAR operations in our area by combining databases. The Tromsø HEMS service had taken over one half of the missions by 2010. Increased availability for SAR work is one potential explanation. The number of SAR missions increased during 2000-2010, and the Tromsø HEMS experienced the greatest increase in workload.

Flight plan optimization

NASA Astrophysics Data System (ADS)

Dharmaseelan, Anoop; Adistambha, Keyne D.

2015-05-01

Fuel cost accounts for 40 percent of the operating cost of an airline. Fuel cost can be minimized by planning a flight on optimized routes. The routes can be optimized by searching best connections based on the cost function defined by the airline. The most common algorithm that used to optimize route search is Dijkstra's. Dijkstra's algorithm produces a static result and the time taken for the search is relatively long. This paper experiments a new algorithm to optimize route search which combines the principle of simulated annealing and genetic algorithm. The experimental results of route search, presented are shown to be computationally fast and accurate compared with timings from generic algorithm. The new algorithm is optimal for random routing feature that is highly sought by many regional operators.

Runway Scheduling Using Generalized Dynamic Programming

NASA Technical Reports Server (NTRS)

Montoya, Justin; Wood, Zachary; Rathinam, Sivakumar

2011-01-01

A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

Understanding and Mitigating Forum Spam

ERIC Educational Resources Information Center

Shin, Youngsang

2011-01-01

The Web is large and expanding, making it challenging to attract new visitors to websites. Website operators often use Search Engine Optimization (SEO) techniques to boost the search engine rankings of their sites, thereby maximizing the inflow of visitors. Malicious operators take SEO to the extreme through many unsavory techniques that are often…

12 CFR 1402.21 - Categories of requesters-fees.

Code of Federal Regulations, 2013 CFR

2013-01-01

... searches made by computer, the Farm Credit System Insurance Corporation will determine the hourly cost of... the cost of search (including the operator time and the cost of operating the computer to process a... 1402.21 Banks and Banking FARM CREDIT SYSTEM INSURANCE CORPORATION RELEASING INFORMATION Fees for...

12 CFR 1402.21 - Categories of requesters-fees.

Code of Federal Regulations, 2014 CFR

2014-01-01

... searches made by computer, the Farm Credit System Insurance Corporation will determine the hourly cost of... the cost of search (including the operator time and the cost of operating the computer to process a... 1402.21 Banks and Banking FARM CREDIT SYSTEM INSURANCE CORPORATION RELEASING INFORMATION Fees for...

12 CFR 1402.21 - Categories of requesters-fees.

Code of Federal Regulations, 2012 CFR

2012-01-01

... searches made by computer, the Farm Credit System Insurance Corporation will determine the hourly cost of... the cost of search (including the operator time and the cost of operating the computer to process a... 1402.21 Banks and Banking FARM CREDIT SYSTEM INSURANCE CORPORATION RELEASING INFORMATION Fees for...

12 CFR 1402.21 - Categories of requesters-fees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... searches made by computer, the Farm Credit System Insurance Corporation will determine the hourly cost of... the cost of search (including the operator time and the cost of operating the computer to process a... 1402.21 Banks and Banking FARM CREDIT SYSTEM INSURANCE CORPORATION RELEASING INFORMATION Fees for...

12 CFR 1402.21 - Categories of requesters-fees.

Code of Federal Regulations, 2011 CFR

2011-01-01

... searches made by computer, the Farm Credit System Insurance Corporation will determine the hourly cost of... the cost of search (including the operator time and the cost of operating the computer to process a... 1402.21 Banks and Banking FARM CREDIT SYSTEM INSURANCE CORPORATION RELEASING INFORMATION Fees for...

Subject Retrieval from Full-Text Databases in the Humanities

ERIC Educational Resources Information Center

East, John W.

2007-01-01

This paper examines the problems involved in subject retrieval from full-text databases of secondary materials in the humanities. Ten such databases were studied and their search functionality evaluated, focusing on factors such as Boolean operators, document surrogates, limiting by subject area, proximity operators, phrase searching, wildcards,…

New knowledge-based genetic algorithm for excavator boom structural optimization

NASA Astrophysics Data System (ADS)

Hua, Haiyan; Lin, Shuwen

2014-03-01

Due to the insufficiency of utilizing knowledge to guide the complex optimal searching, existing genetic algorithms fail to effectively solve excavator boom structural optimization problem. To improve the optimization efficiency and quality, a new knowledge-based real-coded genetic algorithm is proposed. A dual evolution mechanism combining knowledge evolution with genetic algorithm is established to extract, handle and utilize the shallow and deep implicit constraint knowledge to guide the optimal searching of genetic algorithm circularly. Based on this dual evolution mechanism, knowledge evolution and population evolution can be connected by knowledge influence operators to improve the configurability of knowledge and genetic operators. Then, the new knowledge-based selection operator, crossover operator and mutation operator are proposed to integrate the optimal process knowledge and domain culture to guide the excavator boom structural optimization. Eight kinds of testing algorithms, which include different genetic operators, are taken as examples to solve the structural optimization of a medium-sized excavator boom. By comparing the results of optimization, it is shown that the algorithm including all the new knowledge-based genetic operators can more remarkably improve the evolutionary rate and searching ability than other testing algorithms, which demonstrates the effectiveness of knowledge for guiding optimal searching. The proposed knowledge-based genetic algorithm by combining multi-level knowledge evolution with numerical optimization provides a new effective method for solving the complex engineering optimization problem.

An effective PSO-based memetic algorithm for flow shop scheduling.

PubMed

Liu, Bo; Wang, Ling; Jin, Yi-Hui

2007-02-01

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness of the PSOMA. Additionally, the effects of some parameters on optimization performances are also discussed.

Harmony search optimization for HDR prostate brachytherapy

NASA Astrophysics Data System (ADS)

Panchal, Aditya

In high dose-rate (HDR) prostate brachytherapy, multiple catheters are inserted interstitially into the target volume. The process of treating the prostate involves calculating and determining the best dose distribution to the target and organs-at-risk by means of optimizing the time that the radioactive source dwells at specified positions within the catheters. It is the goal of this work to investigate the use of a new optimization algorithm, known as Harmony Search, in order to optimize dwell times for HDR prostate brachytherapy. The new algorithm was tested on 9 different patients and also compared with the genetic algorithm. Simulations were performed to determine the optimal value of the Harmony Search parameters. Finally, multithreading of the simulation was examined to determine potential benefits. First, a simulation environment was created using the Python programming language and the wxPython graphical interface toolkit, which was necessary to run repeated optimizations. DICOM RT data from Varian BrachyVision was parsed and used to obtain patient anatomy and HDR catheter information. Once the structures were indexed, the volume of each structure was determined and compared to the original volume calculated in BrachyVision for validation. Dose was calculated using the AAPM TG-43 point source model of the GammaMed 192Ir HDR source and was validated against Varian BrachyVision. A DVH-based objective function was created and used for the optimization simulation. Harmony Search and the genetic algorithm were implemented as optimization algorithms for the simulation and were compared against each other. The optimal values for Harmony Search parameters (Harmony Memory Size [HMS], Harmony Memory Considering Rate [HMCR], and Pitch Adjusting Rate [PAR]) were also determined. Lastly, the simulation was modified to use multiple threads of execution in order to achieve faster computational times. Experimental results show that the volume calculation that was implemented in this thesis was within 2% of the values computed by Varian BrachyVision for the prostate, within 3% for the rectum and bladder and 6% for the urethra. The calculation of dose compared to BrachyVision was determined to be different by only 0.38%. Isodose curves were also generated and were found to be similar to BrachyVision. The comparison between Harmony Search and genetic algorithm showed that Harmony Search was over 4 times faster when compared over multiple data sets. The optimal Harmony Memory Size was found to be 5 or lower; the Harmony Memory Considering Rate was determined to be 0.95, and the Pitch Adjusting Rate was found to be 0.9. Ultimately, the effect of multithreading showed that as intensive computations such as optimization and dose calculation are involved, the threads of execution scale with the number of processors, achieving a speed increase proportional to the number of processor cores. In conclusion, this work showed that Harmony Search is a viable alternative to existing algorithms for use in HDR prostate brachytherapy optimization. Coupled with the optimal parameters for the algorithm and a multithreaded simulation, this combination has the capability to significantly decrease the time spent on minimizing optimization problems in the clinic that are time intensive, such as brachytherapy, IMRT and beam angle optimization.

Ocean Drilling Program: Science Operator Search Engine

Science.gov Websites

and products Drilling services and tools Online Janus database Search the ODP/TAMU web site ODP's main -USIO site, plus IODP, ODP, and DSDP Publications, together or separately. ODP | Search | Database

Rapid code acquisition algorithms employing PN matched filters

NASA Technical Reports Server (NTRS)

Su, Yu T.

1988-01-01

The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposals using PNMF are seen as special cases of the present algorithms.

Robust local search for spacecraft operations using adaptive noise

NASA Technical Reports Server (NTRS)

Fukunaga, Alex S.; Rabideau, Gregg; Chien, Steve

2004-01-01

Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

Using Advanced Tabu Search Approaches to Perform Enhanced Air Mobility Command Operational Airlift Analyses

DTIC Science & Technology

2009-02-28

2, No. 2, 2007, pp. 156-172. 21. Lambert, G.,J.W. Barnes, and D. Van Veldhuizen ,, "A Tabu Search Approach to the Strategic Airlift Problem...Industrial Engineering, accepted, to appear 2009, pp 1 -86, published by Taylor and Francis/CRC Press. 27. Roesener, A., J. W. Barnes, J. Moore, D. Van ... Veldhuizen , "An Advanced Tabu Search Approach To The Static Airlift Loading Problem," Military Operations Research, 2007, (in second review). 28. Burks

Privacy-preserving search for chemical compound databases.

PubMed

Shimizu, Kana; Nuida, Koji; Arai, Hiromi; Mitsunari, Shigeo; Attrapadung, Nuttapong; Hamada, Michiaki; Tsuda, Koji; Hirokawa, Takatsugu; Sakuma, Jun; Hanaoka, Goichiro; Asai, Kiyoshi

2015-01-01

Searching for similar compounds in a database is the most important process for in-silico drug screening. Since a query compound is an important starting point for the new drug, a query holder, who is afraid of the query being monitored by the database server, usually downloads all the records in the database and uses them in a closed network. However, a serious dilemma arises when the database holder also wants to output no information except for the search results, and such a dilemma prevents the use of many important data resources. In order to overcome this dilemma, we developed a novel cryptographic protocol that enables database searching while keeping both the query holder's privacy and database holder's privacy. Generally, the application of cryptographic techniques to practical problems is difficult because versatile techniques are computationally expensive while computationally inexpensive techniques can perform only trivial computation tasks. In this study, our protocol is successfully built only from an additive-homomorphic cryptosystem, which allows only addition performed on encrypted values but is computationally efficient compared with versatile techniques such as general purpose multi-party computation. In an experiment searching ChEMBL, which consists of more than 1,200,000 compounds, the proposed method was 36,900 times faster in CPU time and 12,000 times as efficient in communication size compared with general purpose multi-party computation. We proposed a novel privacy-preserving protocol for searching chemical compound databases. The proposed method, easily scaling for large-scale databases, may help to accelerate drug discovery research by making full use of unused but valuable data that includes sensitive information.

Cognitive control over working memory biases of selection.

PubMed

Kiyonaga, Anastasia; Egner, Tobias; Soto, David

2012-08-01

Across many studies, researchers have found that representations in working memory (WM) can guide visual attention toward items that match the features of the WM contents. While some researchers have contended that this occurs involuntarily, others have suggested that the impact of WM contents on attention can be strategically controlled. Here, we varied the probability that WM items would coincide with either targets or distractors in a visual search task to examine (1) whether participants could intentionally enhance or inhibit the influence of WM items on attention and (2) whether cognitive control over WM biases would also affect access to the memory contents in a surprise recognition test. We found visual search to be faster when the WM item coincided with the search target, and this effect was enhanced when the memory item reliably predicted the location of the target. Conversely, visual search was slowed when the memory item coincided with a search distractor, and this effect was diminished, but not abolished, when the memory item was reliably associated with distractors. This strategic dampening of the influence of WM items on attention came at a price to memory, however, as participants were slowest to perform WM recognition tests on blocks in which the WM contents were consistently invalid. These results document that attentional capture by WM contents is partly, but not fully, malleable by top-down control, which appears to adjust the state of the WM contents to optimize search behavior. These data illustrate the role of cognitive control in modulating the strength of WM biases of selection, and they support a tight coupling between WM and attention.

Privacy-preserving search for chemical compound databases

PubMed Central

2015-01-01

Background Searching for similar compounds in a database is the most important process for in-silico drug screening. Since a query compound is an important starting point for the new drug, a query holder, who is afraid of the query being monitored by the database server, usually downloads all the records in the database and uses them in a closed network. However, a serious dilemma arises when the database holder also wants to output no information except for the search results, and such a dilemma prevents the use of many important data resources. Results In order to overcome this dilemma, we developed a novel cryptographic protocol that enables database searching while keeping both the query holder's privacy and database holder's privacy. Generally, the application of cryptographic techniques to practical problems is difficult because versatile techniques are computationally expensive while computationally inexpensive techniques can perform only trivial computation tasks. In this study, our protocol is successfully built only from an additive-homomorphic cryptosystem, which allows only addition performed on encrypted values but is computationally efficient compared with versatile techniques such as general purpose multi-party computation. In an experiment searching ChEMBL, which consists of more than 1,200,000 compounds, the proposed method was 36,900 times faster in CPU time and 12,000 times as efficient in communication size compared with general purpose multi-party computation. Conclusion We proposed a novel privacy-preserving protocol for searching chemical compound databases. The proposed method, easily scaling for large-scale databases, may help to accelerate drug discovery research by making full use of unused but valuable data that includes sensitive information. PMID:26678650

Wind Tunnel Management and Resource Optimization: A Systems Modeling Approach

NASA Technical Reports Server (NTRS)

Jacobs, Derya, A.; Aasen, Curtis A.

2000-01-01

Time, money, and, personnel are becoming increasingly scarce resources within government agencies due to a reduction in funding and the desire to demonstrate responsible economic efficiency. The ability of an organization to plan and schedule resources effectively can provide the necessary leverage to improve productivity, provide continuous support to all projects, and insure flexibility in a rapidly changing environment. Without adequate internal controls the organization is forced to rely on external support, waste precious resources, and risk an inefficient response to change. Management systems must be developed and applied that strive to maximize the utility of existing resources in order to achieve the goal of "faster, cheaper, better". An area of concern within NASA Langley Research Center was the scheduling, planning, and resource management of the Wind Tunnel Enterprise operations. Nine wind tunnels make up the Enterprise. Prior to this research, these wind tunnel groups did not employ a rigorous or standardized management planning system. In addition, each wind tunnel unit operated from a position of autonomy, with little coordination of clients, resources, or project control. For operating and planning purposes, each wind tunnel operating unit must balance inputs from a variety of sources. Although each unit is managed by individual Facility Operations groups, other stakeholders influence wind tunnel operations. These groups include, for example, the various researchers and clients who use the facility, the Facility System Engineering Division (FSED) tasked with wind tunnel repair and upgrade, the Langley Research Center (LaRC) Fabrication (FAB) group which fabricates repair parts and provides test model upkeep, the NASA and LARC Strategic Plans, and unscheduled use of the facilities by important clients. Expanding these influences horizontally through nine wind tunnel operations and vertically along the NASA management structure greatly increases the complexity of developing a model that can be used for successfully implementing a standardized management planning tool. The objective of this study was to implement an Integrated Wind Tunnel Planning System to improve the operations within the aeronautics testing and research group, in particular Wind Tunnel Enterprise. The study included following steps: Conducted literature search and expert discussions (NASA and Old Dominion University faculty), Performed environmental scan of NASA Langley wind tunnel operations as foundation for problem definition. Established operation requirements and evaluation methodologies. Examined windtunnel operations to map out the common characteristics, critical components, and system structure. Reviewed and evaluated various project scheduling and management systems for implementation, Evaluated and implemented "Theory of Constraints (TOC)" project scheduling methodology at NASA Langley wind tunnel operations together with NASA staff.

Using the Turning Research Into Practice (TRIP) database: how do clinicians really search?*

PubMed Central

Meats, Emma; Brassey, Jon; Heneghan, Carl; Glasziou, Paul

2007-01-01

Objectives: Clinicians and patients are increasingly accessing information through Internet searches. This study aimed to examine clinicians' current search behavior when using the Turning Research Into Practice (TRIP) database to examine search engine use and the ways it might be improved. Methods: A Web log analysis was undertaken of the TRIP database—a meta-search engine covering 150 health resources including MEDLINE, The Cochrane Library, and a variety of guidelines. The connectors for terms used in searches were studied, and observations were made of 9 users' search behavior when working with the TRIP database. Results: Of 620,735 searches, most used a single term, and 12% (n = 75,947) used a Boolean operator: 11% (n = 69,006) used “AND” and 0.8% (n = 4,941) used “OR.” Of the elements of a well-structured clinical question (population, intervention, comparator, and outcome), the population was most commonly used, while fewer searches included the intervention. Comparator and outcome were rarely used. Participants in the observational study were interested in learning how to formulate better searches. Conclusions: Web log analysis showed most searches used a single term and no Boolean operators. Observational study revealed users were interested in conducting efficient searches but did not always know how. Therefore, either better training or better search interfaces are required to assist users and enable more effective searching. PMID:17443248

Prepare for the Job Search. Job Search. Competency 1.0.

ERIC Educational Resources Information Center

Ohio State Univ., Columbus. National Center for Research in Vocational Education.

This competency booklet for individualized competency-based instruction is the first of five in the Job Search Skills package. (Instructor program and guides are available separately as CE 031 965 and 966, the other booklets as CE 031 968-971.) It contains 15 operational units related to the job search competency of preparing for the job search.…

75 FR 23306 - Southern Nuclear Operating Company, et al.: Supplementary Notice of Hearing and Opportunity To...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-03

...'' field when using either the Web-based search (advanced search) engine or the ADAMS FIND tool in Citrix... should enter ``05200011'' in the ``Docket Number'' field in the web-based search (advanced search) engine... ML100740441. To search for documents in ADAMS using Vogtle Units 3 and 4 COL application docket numbers, 52...

Generalized Grover's Algorithm for Multiple Phase Inversion States

NASA Astrophysics Data System (ADS)

Byrnes, Tim; Forster, Gary; Tessler, Louis

2018-02-01

Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator inverts the sign on only one state. Here we provide an exact solution to the problem of performing Grover's search where the Grover operator inverts the sign on N states. We show the underlying structure in terms of the eigenspectrum of the generalized Hamiltonian, and derive an appropriate initial state to perform the Grover evolution. This allows us to use the quantum phase estimation algorithm to solve the search problem in this generalized case, completely bypassing the Grover algorithm altogether. We obtain a time complexity of this case of √{D /Mα }, where D is the search space dimension, M is the number of target states, and α ≈1 , which is close to the optimal scaling.

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.

Sensitivity projections for dark matter searches with the Fermi large area telescope

NASA Astrophysics Data System (ADS)

Charles, E.; Sánchez-Conde, M.; Anderson, B.; Caputo, R.; Cuoco, A.; Di Mauro, M.; Drlica-Wagner, A.; Gomez-Vargas, G. A.; Meyer, M.; Tibaldo, L.; Wood, M.; Zaharijas, G.; Zimmer, S.; Ajello, M.; Albert, A.; Baldini, L.; Bechtol, K.; Bloom, E. D.; Ceraudo, F.; Cohen-Tanugi, J.; Digel, S. W.; Gaskins, J.; Gustafsson, M.; Mirabal, N.; Razzano, M.

2016-06-01

The nature of dark matter is a longstanding enigma of physics; it may consist of particles beyond the Standard Model that are still elusive to experiments. Among indirect search techniques, which look for stable products from the annihilation or decay of dark matter particles, or from axions coupling to high-energy photons, observations of the γ-ray sky have come to prominence over the last few years, because of the excellent sensitivity of the Large Area Telescope (LAT) on the Fermi Gamma-ray Space Telescope mission. The LAT energy range from 20 meV to above 300 GeV is particularly well suited for searching for products of the interactions of dark matter particles. In this report we describe methods used to search for evidence of dark matter with the LAT, and review the status of searches performed with up to six years of LAT data. We also discuss the factors that determine the sensitivities of these searches, including the magnitudes of the signals and the relevant backgrounds, considering both statistical and systematic uncertainties. We project the expected sensitivities of each search method for 10 and 15 years of LAT data taking. In particular, we find that the sensitivity of searches targeting dwarf galaxies, which provide the best limits currently, will improve faster than the square root of observing time. Current LAT limits for dwarf galaxies using six years of data reach the thermal relic level for masses up to 120 GeV for the b b ¯ annihilation channel for reasonable dark matter density profiles. With projected discoveries of additional dwarfs, these limits could extend to about 250 GeV. With as much as 15 years of LAT data these searches would be sensitive to dark matter annihilations at the thermal relic cross section for masses to greater than 400 GeV (200 GeV) in the b b ¯ (τ+τ-) annihilation channels.

Field effect transistors improve buffer amplifier

NASA Technical Reports Server (NTRS)

1967-01-01

Unity gain buffer amplifier with a Field Effect Transistor /FET/ differential input stage responds much faster than bipolar transistors when operated at low current levels. The circuit uses a dual FET in a unity gain buffer amplifier having extremely high input impedance, low bias current requirements, and wide bandwidth.

Privatization and regulation of transport infrastructure in the 1990s : successes ... and bugs to fix for the next millennium

DOT National Transportation Integrated Search

1999-11-01

The FAST-TRAC (Faster and Safer Travel through Traffic Routing and Advanced Controls) Operational Field Test (OFT) is an Intelligent Transportation Systems (ITS) project being conducted in Southeast Michigan, largely within Oakland County. The projec...

MetAlign 3.0: performance enhancement by efficient use of advances in computer hardware.

PubMed

Lommen, Arjen; Kools, Harrie J

2012-08-01

A new, multi-threaded version of the GC-MS and LC-MS data processing software, metAlign, has been developed which is able to utilize multiple cores on one PC. This new version was tested using three different multi-core PCs with different operating systems. The performance of noise reduction, baseline correction and peak-picking was 8-19 fold faster compared to the previous version on a single core machine from 2008. The alignment was 5-10 fold faster. Factors influencing the performance enhancement are discussed. Our observations show that performance scales with the increase in processor core numbers we currently see in consumer PC hardware development.

The Mechanisms Underlying the ASD Advantage in Visual Search.

PubMed

Kaldy, Zsuzsa; Giserman, Ivy; Carter, Alice S; Blaser, Erik

2016-05-01

A number of studies have demonstrated that individuals with autism spectrum disorders (ASDs) are faster or more successful than typically developing control participants at various visual-attentional tasks (for reviews, see Dakin and Frith in Neuron 48:497-507, 2005; Simmons et al. in Vis Res 49:2705-2739, 2009). This "ASD advantage" was first identified in the domain of visual search by Plaisted et al. (J Child Psychol Psychiatry 39:777-783, 1998). Here we survey the findings of visual search studies from the past 15 years that contrasted the performance of individuals with and without ASD. Although there are some minor caveats, the overall consensus is that-across development and a broad range of symptom severity-individuals with ASD reliably outperform controls on visual search. The etiology of the ASD advantage has not been formally specified, but has been commonly attributed to 'enhanced perceptual discrimination', a superior ability to visually discriminate between targets and distractors in such tasks (e.g. O'Riordan in Cognition 77:81-96, 2000). As well, there is considerable evidence for impairments of the attentional network in ASD (for a review, see Keehn et al. in J Child Psychol Psychiatry 37:164-183, 2013). We discuss some recent results from our laboratory that support an attentional, rather than perceptual explanation for the ASD advantage in visual search. We speculate that this new conceptualization may offer a better understanding of some of the behavioral symptoms associated with ASD, such as over-focusing and restricted interests.

Modeling peripheral vision for moving target search and detection.

PubMed

Yang, Ji Hyun; Huston, Jesse; Day, Michael; Balogh, Imre

2012-06-01

Most target search and detection models focus on foveal vision. In reality, peripheral vision plays a significant role, especially in detecting moving objects. There were 23 subjects who participated in experiments simulating target detection tasks in urban and rural environments while their gaze parameters were tracked. Button responses associated with foveal object and peripheral object (PO) detection and recognition were recorded. In an urban scenario, pedestrians appearing in the periphery holding guns were threats and pedestrians with empty hands were non-threats. In a rural scenario, non-U.S. unmanned aerial vehicles (UAVs) were considered threats and U.S. UAVs non-threats. On average, subjects missed detecting 2.48 POs among 50 POs in the urban scenario and 5.39 POs in the rural scenario. Both saccade reaction time and button reaction time can be predicted by peripheral angle and entrance speed of POs. Fast moving objects were detected faster than slower objects and POs appearing at wider angles took longer to detect than those closer to the gaze center. A second-order mixed-effect model was applied to provide each subject's prediction model for peripheral target detection performance as a function of eccentricity angle and speed. About half the subjects used active search patterns while the other half used passive search patterns. An interactive 3-D visualization tool was developed to provide a representation of macro-scale head and gaze movement in the search and target detection task. An experimentally validated stochastic model of peripheral vision in realistic target detection scenarios was developed.

Searching Lost People with Uavs: the System and Results of the Close-Search Project

NASA Astrophysics Data System (ADS)

Molina, P.; Colomina, I.; Vitoria, T.; Silva, P. F.; Skaloud, J.; Kornus, W.; Prades, R.; Aguilera, C.

2012-07-01

This paper will introduce the goals, concept and results of the project named CLOSE-SEARCH, which stands for 'Accurate and safe EGNOS-SoL Navigation for UAV-based low-cost Search-And-Rescue (SAR) operations'. The main goal is to integrate a medium-size, helicopter-type Unmanned Aerial Vehicle (UAV), a thermal imaging sensor and an EGNOS-based multi-sensor navigation system, including an Autonomous Integrity Monitoring (AIM) capability, to support search operations in difficult-to-access areas and/or night operations. The focus of the paper is three-fold. Firstly, the operational and technical challenges of the proposed approach are discussed, such as ultra-safe multi-sensor navigation system, the use of combined thermal and optical vision (infrared plus visible) for person recognition and Beyond-Line-Of-Sight communications among others. Secondly, the implementation of the integrity concept for UAV platforms is discussed herein through the AIM approach. Based on the potential of the geodetic quality analysis and on the use of the European EGNOS system as a navigation performance starting point, AIM approaches integrity from the precision standpoint; that is, the derivation of Horizontal and Vertical Protection Levels (HPLs, VPLs) from a realistic precision estimation of the position parameters is performed and compared to predefined Alert Limits (ALs). Finally, some results from the project test campaigns are described to report on particular project achievements. Together with actual Search-and-Rescue teams, the system was operated in realistic, user-chosen test scenarios. In this context, and specially focusing on the EGNOS-based UAV navigation, the AIM capability and also the RGB/thermal imaging subsystem, a summary of the results is presented.

28 CFR 25.6 - Accessing records in the system.

Code of Federal Regulations, 2010 CFR

2010-07-01

... through the FBI NICS Operations Center. FFLs may contact the NICS Operations Center by use of a toll-free...) Search the relevant databases (i.e., NICS Index, NCIC, III) for any matching records; and (iv) Provide..., it will search the relevant databases (i.e., NICS Index, NCIC, III) for any matching record(s) and...

Financial Aid as a Service. A Review of Operations. Summary Report.

ERIC Educational Resources Information Center

Adams, Judith

This review presents a summary of five reports resulting from several studies of Financial Aid Office (FAO) operations at Macomb Community College (MCC) in Michigan designed to determine how services were rendered or perceived. The first report presents findings from the literature search evaluation. An extensive search revealed few published…

12 CFR 1070.22 - Fees for processing requests for CFPB records.

Code of Federal Regulations, 2013 CFR

2013-01-01

... CFPB shall charge the requester for the actual direct cost of the search, including computer search time, runs, and the operator's salary. The fee for computer output will be the actual direct cost. For... and the cost of operating the computer to process a request) equals the equivalent dollar amount of...

Product Operations Status Summary Metrics

NASA Technical Reports Server (NTRS)

Takagi, Atsuya; Toole, Nicholas

2010-01-01

The Product Operations Status Summary Metrics (POSSUM) computer program provides a readable view into the state of the Phoenix Operations Product Generation Subsystem (OPGS) data pipeline. POSSUM provides a user interface that can search the data store, collect product metadata, and display the results in an easily-readable layout. It was designed with flexibility in mind for support in future missions. Flexibility over various data store hierarchies is provided through the disk-searching facilities of Marsviewer. This is a proven program that has been in operational use since the first day of the Phoenix mission.

Design of Low-Cost Impact Reporting System

DTIC Science & Technology

2015-12-01

Single Board Computers (SBC) available. Arduino and Raspberry Pi are very low cost and have huge communities for hardware design. Most of the SBC... Raspberry Pi Model B has a considerably faster processor than the Arduino. Although it provides only approximately 25 General Purpose Input and Output...reporting system must be able to operate on its own power for more than 2 or 3 hours. The Raspberry Pi Model B operates on 5 volts direct current at

[Historical review and future orientations of the conventional vascular microanastomoses].

PubMed

Leclère, F M P; Schoofs, M; Mordon, S

2011-06-01

Microvascular surgery has become an important method for reconstructing surgical defects due to trauma, tumors or after burn. The most important factor for successful free flap transfer is a well-executed anastomosis. The time needed to perform the anastomosis and the failure rate are not negligible despite the high level of operator's experience. During the history, many alternatives were tried to help the microsurgeon and to reduce the complications. A Medline literature search was performed to find articles dealing with non-suture methods of microvascular anastomosis. Many historical books were also included. The non-suture techniques can be divided into four groups based on the used mechanism of sutures: double intubation including tubes and stents, intubation-eversion including simple rings, double eversion including staples and double rings, and wall adjustement with adhesives or laser. All these techniques were able to produce a faster and easier microvascular anastomosis. Nevertheless, disadvantages of the suturless techniques include toxicity, high cost, leakage or aneurysm formation. More refinement is needed before their widespread adoption. Thus, laser-assisted microvascular anastomosis using 1,9 μm diode laser appeared to be a safe and reliable help for the microsurgeon and may be further developed in the near future. Copyright © 2010 Elsevier Masson SAS. All rights reserved.

An O([Formula: see text]) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges.

PubMed

Yu, Shuzhi; Hao, Fanchang; Leong, Hon Wai

2016-02-01

We consider the problem of sorting signed permutations by reversals, transpositions, transreversals, and block-interchanges. The problem arises in the study of species evolution via large-scale genome rearrangement operations. Recently, Hao et al. gave a 2-approximation scheme called genome sorting by bridges (GSB) for solving this problem. Their result extended and unified the results of (i) He and Chen - a 2-approximation algorithm allowing reversals, transpositions, and block-interchanges (by also allowing transversals) and (ii) Hartman and Sharan - a 1.5-approximation algorithm allowing reversals, transpositions, and transversals (by also allowing block-interchanges). The GSB result is based on introduction of three bridge structures in the breakpoint graph, the L-bridge, T-bridge, and X-bridge that models goodreversal, transposition/transreversal, and block-interchange, respectively. However, the paper by Hao et al. focused on proving the 2-approximation GSB scheme and only mention a straightforward [Formula: see text] algorithm. In this paper, we give an [Formula: see text] algorithm for implementing the GSB scheme. The key idea behind our faster GSB algorithm is to represent cycles in the breakpoint graph by their canonical sequences, which greatly simplifies the search for these bridge structures. We also give some comparison results (running time and computed distances) against the original GSB implementation.

Evaluation of image features and classification methods for Barrett's cancer detection using VLE imaging

NASA Astrophysics Data System (ADS)

Klomp, Sander; van der Sommen, Fons; Swager, Anne-Fré; Zinger, Svitlana; Schoon, Erik J.; Curvers, Wouter L.; Bergman, Jacques J.; de With, Peter H. N.

2017-03-01

Volumetric Laser Endomicroscopy (VLE) is a promising technique for the detection of early neoplasia in Barrett's Esophagus (BE). VLE generates hundreds of high resolution, grayscale, cross-sectional images of the esophagus. However, at present, classifying these images is a time consuming and cumbersome effort performed by an expert using a clinical prediction model. This paper explores the feasibility of using computer vision techniques to accurately predict the presence of dysplastic tissue in VLE BE images. Our contribution is threefold. First, a benchmarking is performed for widely applied machine learning techniques and feature extraction methods. Second, three new features based on the clinical detection model are proposed, having superior classification accuracy and speed, compared to earlier work. Third, we evaluate automated parameter tuning by applying simple grid search and feature selection methods. The results are evaluated on a clinically validated dataset of 30 dysplastic and 30 non-dysplastic VLE images. Optimal classification accuracy is obtained by applying a support vector machine and using our modified Haralick features and optimal image cropping, obtaining an area under the receiver operating characteristic of 0.95 compared to the clinical prediction model at 0.81. Optimal execution time is achieved using a proposed mean and median feature, which is extracted at least factor 2.5 faster than alternative features with comparable performance.

Ethnography of Novices' First Use of Web Search Engines: Affective Control in Cognitive Processing.

ERIC Educational Resources Information Center

Nahl, Diane

1998-01-01

This study of 18 novice Internet users employed a structured self-report method to investigate affective and cognitive operations in the following phases of World Wide Web searching: presearch formulation, search statement formulation, search strategy, and evaluation of results. Users also rated their self-confidence as searchers and satisfaction…

Search Hardware: Latest and Greatest.

ERIC Educational Resources Information Center

Alberico, Ralph

1988-01-01

Uses the different search environments of information brokers and institutional searchers to illustrate the factors that should be considered when selecting microcomputers for search operations. The factors discussed include speed, storage capabilities, displays, modems, printing technologies, facsimile transmission, and portability. A directory…

Market Assessment For Traveler Services, A Choice Modeling Study Phase Iii, Fast-Trac Deliverable, #16B: Final Choice Modeling Report

DOT National Transportation Integrated Search

1999-02-12

FAST-TRAC : THIS REPORT DESCRIBES THE CHOICE MODEL STUDY OF THE FAST-TRAC (FASTER AND SAFER TRAVEL THROUGH TRAFFIC ROUTING AND ADVANCED CONTROLS) OPERATIONAL TEST IN SOUTHEAST MICHIGAN. CHOICE MODELING IS A STATED-PREFERENCE APPROACH IN WHICH RESP...

The Global Maritime Partnership: Networking Challenges and Opportunities

DTIC Science & Technology

2010-06-01

The Victorians eagerly embraced the telegraph as something that was “faster and better” than waiting for newspapers to arrive via ship and... fashion . ３１ While little quantitative work on network-centric operations has been done based on from-the-ground-up modeling and simulation, the United

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

Kercel, S.W.; Baylor, V.M.; Labaj, L.E.

Enclosed Space Detection System (ESDS) is a fast, inexpensive, and reliable device for detecting human occupants hidden in vehicles. Operation requires less than two minutes. ESDS is used to foil attempts at smuggling illegal aliens, terrorists, and escaping prisoners. It is being tested at nuclear weapons facilities and has been operated at several prisons and international border crossings. ESDS is the first practical electronic alternative to physical searches of vehicles for hidden passengers. At critical checkpoints, a thorough physical search of a single fully loaded truck requires a team of from two to six people, and may take as longmore » as eight hours. Despite this level of security, experience has shown that the search can occasionally be foiled. Due to the enormous time and expense of thorough physical searches of vehicles, they are seldom conducted at any but the most critical of locations, simply leaving many sites vulnerable to crime and terrorism. Prior to the development of the ESDS, the only other effective alternative to physical search was the use of specially-trained canines, which can be vastly superior to the physical search in both time and accuracy. However, as discussed in this paper, canine inspection is not really a competitive substitute for ESDS because canine reliability (80% at most) is not as high as that of the ESDS (99%+), while the costs, training requirements, and operator skill needed are significantly higher with canines than with the ESDS. In addition, the ESDS has straightforward self-diagnostic tests to ensure the system is operating correctly; such tests are not currently available with either canine or human inspectors. ESDS offers an attractive supplement or alternative to meet current security requirements for vehicle searches at portals at government, nuclear, industrial, and other facilities where concealed persons may pose a threat either by entering or leaving.« less

Operational VGOS Scheduling

NASA Astrophysics Data System (ADS)

Searle, Anthony; Petrachenko, Bill

2016-12-01

The VLBI Global Observing System (VGOS) has been designed to take advantage of advances in data recording speeds and storage capacity, allowing for smaller and faster antennas, wider bandwidths, and shorter observation durations. Here, schedules for a ``realistic" VGOS network, frequency sequences, and expanded source lists are presented using a new source-based scheduling algorithm. The VGOS aim for continuous observations presents new operational challenges. As the source-based strategy is independent of the observing network, there are operational advantages which allow for more flexible scheduling of continuous VLBI observations. Using VieVS, simulations of several schedules are presented and compared with previous VGOS studies.

Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments

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

Daily, Jeffrey A.

Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates permore » second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.« less

Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments

DOE PAGES

Daily, Jeffrey A.

2016-02-10

Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates permore » second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.« less

SlideSort: all pairs similarity search for short reads

PubMed Central

Shimizu, Kana; Tsuda, Koji

2011-01-01

Motivation: Recent progress in DNA sequencing technologies calls for fast and accurate algorithms that can evaluate sequence similarity for a huge amount of short reads. Searching similar pairs from a string pool is a fundamental process of de novo genome assembly, genome-wide alignment and other important analyses. Results: In this study, we designed and implemented an exact algorithm SlideSort that finds all similar pairs from a string pool in terms of edit distance. Using an efficient pattern growth algorithm, SlideSort discovers chains of common k-mers to narrow down the search. Compared to existing methods based on single k-mers, our method is more effective in reducing the number of edit distance calculations. In comparison to backtracking methods such as BWA, our method is much faster in finding remote matches, scaling easily to tens of millions of sequences. Our software has an additional function of single link clustering, which is useful in summarizing short reads for further processing. Availability: Executable binary files and C++ libraries are available at http://www.cbrc.jp/~shimizu/slidesort/ for Linux and Windows. Contact: slidesort@m.aist.go.jp; shimizu-kana@aist.go.jp Supplementary information: Supplementary data are available at Bioinformatics online. PMID:21148542

Fat Content Modulates Rapid Detection of Food: A Visual Search Study Using Fast Food and Japanese Diet

PubMed Central

Sawada, Reiko; Sato, Wataru; Toichi, Motomi; Fushiki, Tohru

2017-01-01

Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat content on the detection of food remains unclear. To investigate these issues, we measured reaction times (RTs) during a visual search task in which participants with normal weight detected high-fat food (i.e., fast food), low-fat food (i.e., Japanese diet), and non-food (i.e., kitchen utensils) targets within crowds of non-food distractors (i.e., cars). Results showed that RTs for food targets were shorter than those for non-food targets. Moreover, the RTs for high-fat food were shorter than those for low-fat food. These results suggest that food is more rapidly detected than non-food within the environment and that a higher fat content in food facilitates rapid detection. PMID:28690568

Food Catches the Eye but Not for Everyone: A BMI–Contingent Attentional Bias in Rapid Detection of Nutriments

PubMed Central

Nummenmaa, Lauri; Hietanen, Jari K.; Calvo, Manuel G.; Hyönä, Jukka

2011-01-01

An organism's survival depends crucially on its ability to detect and acquire nutriment. Attention circuits interact with cognitive and motivational systems to facilitate detection of salient sensory events in the environment. Here we show that the human attentional system is tuned to detect food targets among nonfood items. In two visual search experiments participants searched for discrepant food targets embedded in an array of nonfood distracters or vice versa. Detection times were faster when targets were food rather than nonfood items, and the detection advantage for food items showed a significant negative correlation with Body Mass Index (BMI). Also, eye tracking during searching within arrays of visually homogenous food and nonfood targets demonstrated that the BMI-contingent attentional bias was due to rapid capturing of the eyes by food items in individuals with low BMI. However, BMI was not associated with decision times after the discrepant food item was fixated. The results suggest that visual attention is biased towards foods, and that individual differences in energy consumption - as indexed by BMI - are associated with differential attentional effects related to foods. We speculate that such differences may constitute an important risk factor for gaining weight. PMID:21603657

Fat Content Modulates Rapid Detection of Food: A Visual Search Study Using Fast Food and Japanese Diet.

PubMed

Sawada, Reiko; Sato, Wataru; Toichi, Motomi; Fushiki, Tohru

2017-01-01

Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat content on the detection of food remains unclear. To investigate these issues, we measured reaction times (RTs) during a visual search task in which participants with normal weight detected high-fat food (i.e., fast food), low-fat food (i.e., Japanese diet), and non-food (i.e., kitchen utensils) targets within crowds of non-food distractors (i.e., cars). Results showed that RTs for food targets were shorter than those for non-food targets. Moreover, the RTs for high-fat food were shorter than those for low-fat food. These results suggest that food is more rapidly detected than non-food within the environment and that a higher fat content in food facilitates rapid detection.

Components of reward-driven attentional capture.

PubMed

Sha, Li Z; Jiang, Yuhong V

2016-02-01

Recent research reported that task-irrelevant colors captured attention if these colors previously served as search targets and received high monetary reward. We showed that both monetary reward and value-independent mechanisms influenced selective attention. Participants searched for two potential target colors among distractor colors in the training phase. Subsequently, they searched for a shape singleton in a testing phase. Experiment 1 found that participants were slower in the testing phase if a distractor of a previous target color was present rather than absent. Such slowing was observed even when no monetary reward was used during training. Experiment 2 associated monetary rewards with the target colors during the training phase. Participants were faster finding the target associated with higher monetary reward. However, reward training did not yield value-dependent attentional capture in the testing phase. Attentional capture by the previous target colors was not significantly greater for the previously high-reward color than the previously low or no-reward color. These findings revealed both the power and limitations of monetary reward on attention. Although monetary reward can increase attentional priority for the high-reward target during training, subsequent attentional capture effects may not be reward-based, but reflect, in part, attentional capture by previous targets.

Positional priming of visual pop-out search is supported by multiple spatial reference frames

PubMed Central

Gokce, Ahu; Müller, Hermann J.; Geyer, Thomas

2015-01-01

The present study investigates the representations(s) underlying positional priming of visual ‘pop-out’ search (Maljkovic and Nakayama, 1996). Three search items (one target and two distractors) were presented at different locations, in invariant (Experiment 1) or random (Experiment 2) cross-trial sequences. By these manipulations it was possible to disentangle retinotopic, spatiotopic, and object-centered priming representations. Two forms of priming were tested: target location facilitation (i.e., faster reaction times – RTs– when the trial n target is presented at a trial n-1 target relative to n-1 blank location) and distractor location inhibition (i.e., slower RTs for n targets presented at n-1 distractor compared to n-1 blank locations). It was found that target locations were coded in positional short-term memory with reference to both spatiotopic and object-centered representations (Experiment 1 vs. 2). In contrast, distractor locations were maintained in an object-centered reference frame (Experiments 1 and 2). We put forward the idea that the uncertainty induced by the experiment manipulation (predictable versus random cross-trial item displacements) modulates the transition from object- to space-based representations in cross-trial memory for target positions. PMID:26136718

Guidance of spatial attention by incidental learning and endogenous cuing

PubMed Central

Jiang, Yuhong V.; Swallow, Khena M.; Rosenbaum, Gail M.

2012-01-01

Our visual system is highly sensitive to regularities in the environment. Locations that were important in one’s previous experience are often prioritized during search, even though observers may not be aware of the learning. In this study we characterized the guidance of spatial attention by incidental learning of a target’s spatial probability, and examined the interaction between endogenous cuing and probability cuing. Participants searched for a target (T) among distractors (L’s). The target was more often located in one region of the screen than in others. We found that search RT was faster when the target appeared in the high-frequency region rather than the low-frequency regions. This difference increased when there were more items on the display, suggesting that probability cuing guides spatial attention. Additional data indicated that on their own, probability cuing and endogenous cuing (e.g., a central arrow that predicted a target’s location) were similarly effective at guiding attention. However, when both cues were presented at once, probability cuing was largely eliminated. Thus, although both incidental learning and endogenous cuing can effectively guide attention, endogenous cuing takes precedence over incidental learning. PMID:22506784

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

PubMed Central

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

2016-01-01

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

Owners and Operators

Science.gov Websites

Hands logo Search 1920s 1922 1923 1924 1925 1926 1927 1928 1929 Search 1930s 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 Search 1940s 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 Search 1950s 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 Search 1960s 1960 1961 1962 1963 1964 1965 1966 1967

The Perfectly Organized Search Service.

ERIC Educational Resources Information Center

Leach, Sandra Sinsel; Spencer, Mary Ellen

1993-01-01

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

FLOWER IPv4/IPv6 Network Flow Summarization software

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

Nickless, Bill; Curtis, Darren; Christy, Jason

FLOWER was written as a refactoring/reimplementation of the existing Flo software used by the Cooperative Protection Program (CPP) to provide network flow summaries for analysis by the Operational Analysis Center (OAC) and other US Department of Energy cyber security elements. FLOWER is designed and tested to operate at 10 gigabits/second, nearly 10 times faster than competing solutions. FLOWER output is optimized for importation into SQL databases for categorization and analysis. FLOWER is written in C++ using current best software engineering practices.

Feasibility of Using Littoral Combat Ships (LCS) for Humanitarian Assistance/Disaster Relief (HA/DR) Operations

DTIC Science & Technology

2012-09-01

when travelling at sprint speed. To help overcome the shortcomings of the LCS in conducting HA/DR operations, the Irregular Warfare (IW) mission...high sprint speed, which allows the LCS to reach the disaster region faster than any other ships, especially if the IW mission package is adopted. The...high sprint speed in excess of 40 knots and a high sustained speed to enable it to run along a 30+ knots CSG or 20+ knots ESG. The high sprint

Space Station services and design features for users

NASA Technical Reports Server (NTRS)

Kurzhals, Peter R.; Mckinney, Royce L.

1987-01-01

The operational design features and services planned for the NASA Space Station will furnish, in addition to novel opportunities and facilities, lower costs through interface standardization and automation and faster access by means of computer-aided integration and control processes. By furnishing a basis for large-scale space exploitation, the Space Station will possess industrial production and operational services capabilities that may be used by the private sector for commercial ventures; it could also ultimately support lunar and planetary exploration spacecraft assembly and launch facilities.

Motion Sickness Treatment Apparatus and Method

NASA Technical Reports Server (NTRS)

Reschke, Millard F. (Inventor); Somers, Jeffrey T. (Inventor); Ford, George A. (Inventor)

2005-01-01

Methods and apparatus are disclosed for treating motion sickness. In a preferred embodiment a method of the invention comprises operating eyewear having shutter lenses to open said shutter lenses at a selected operating frequency ranging from within about 3 Hz to about 50 Hz. The shutter lenses are opened for a short duration at the selected operating frequency wherein the duration is selected to prevent retinal slip. The shutter lenses may be operated at a relatively slow frequency of about 4 Hz when the user is in passive activity such as riding in a boat or car or in limited motion situations in a spacecraft. The shutter lenses may be operated at faster frequencies related to motion of the user's head when the user is active.

Sensitivity projections for dark matter dearches with the Fermi large area telescope

DOE PAGES

Charles, E.; M. Sanchez-Conde; Anderson, B.; ...

2016-05-20

The nature of dark matter is a longstanding enigma of physics; it may consist of particles beyond the Standard Model that are still elusive to experiments. Among indirect search techniques, which look for stable products from the annihilation or decay of dark matter particles, or from axions coupling to high-energy photons, observations of themore » $$\\gamma$$-ray sky have come to prominence over the last few years, because of the excellent sensitivity of the Large Area Telescope (LAT) on the Fermi Gamma-ray Space Telescope mission. The LAT energy range from 20 MeV to above 300 GeV is particularly well suited for searching for products of the interactions of dark matter particles. In this report we describe methods used to search for evidence of dark matter with the LAT, and review the status of searches performed with up to six years of LAT data. We also discuss the factors that determine the sensitivities of these searches, including the magnitudes of the signals and the relevant backgrounds, considering both statistical and systematic uncertainties. We project the expected sensitivities of each search method for 10 and 15 years of LAT data taking. In particular, we find that the sensitivity of searches targeting dwarf galaxies, which provide the best limits currently, will improve faster than the square root of observing time. Current LAT limits for dwarf galaxies using six years of data reach the thermal relic level for masses up to 120 GeV for the $$b\\bar{b}$$ annihilation channel for reasonable dark matter density profiles. With projected discoveries of additional dwarfs, these limits could extend to about 250 GeV. With as much as 15 years of LAT data these searches would be sensitive to dark matter annihilations at the thermal relic cross section for masses to greater than 400 GeV (200 GeV) in the $$b\\bar{b}$$ ($$\\tau^+ \\tau^-$$) annihilation channels.« less

Sensitivity projections for dark matter dearches with the Fermi large area telescope

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

Charles, E.; M. Sanchez-Conde; Anderson, B.

The nature of dark matter is a longstanding enigma of physics; it may consist of particles beyond the Standard Model that are still elusive to experiments. Among indirect search techniques, which look for stable products from the annihilation or decay of dark matter particles, or from axions coupling to high-energy photons, observations of themore » $$\\gamma$$-ray sky have come to prominence over the last few years, because of the excellent sensitivity of the Large Area Telescope (LAT) on the Fermi Gamma-ray Space Telescope mission. The LAT energy range from 20 MeV to above 300 GeV is particularly well suited for searching for products of the interactions of dark matter particles. In this report we describe methods used to search for evidence of dark matter with the LAT, and review the status of searches performed with up to six years of LAT data. We also discuss the factors that determine the sensitivities of these searches, including the magnitudes of the signals and the relevant backgrounds, considering both statistical and systematic uncertainties. We project the expected sensitivities of each search method for 10 and 15 years of LAT data taking. In particular, we find that the sensitivity of searches targeting dwarf galaxies, which provide the best limits currently, will improve faster than the square root of observing time. Current LAT limits for dwarf galaxies using six years of data reach the thermal relic level for masses up to 120 GeV for the $$b\\bar{b}$$ annihilation channel for reasonable dark matter density profiles. With projected discoveries of additional dwarfs, these limits could extend to about 250 GeV. With as much as 15 years of LAT data these searches would be sensitive to dark matter annihilations at the thermal relic cross section for masses to greater than 400 GeV (200 GeV) in the $$b\\bar{b}$$ ($$\\tau^+ \\tau^-$$) annihilation channels.« less

How social information affects information search and choice in probabilistic inferences.

PubMed

Puskaric, Marin; von Helversen, Bettina; Rieskamp, Jörg

2018-01-01

When making decisions, people are often exposed to relevant information stemming from qualitatively different sources. For instance, when making a choice between two alternatives people can rely on the advice of other people (i.e., social information) or search for factual information about the alternatives (i.e., non-social information). Prior research in categorization has shown that social information is given special attention when both social and non-social information is available, even when the social information has no additional informational value. The goal of the current work is to investigate whether framing information as social or non-social also influences information search and choice in probabilistic inferences. In a first study, we found that framing cues (i.e., the information used to make a decision) with medium validity as social increased the probability that they were searched for compared to a task where the same cues were framed as non-social information, but did not change the strategy people relied on. A second and a third study showed that framing a cue with high validity as social information facilitated learning to rely on a non-compensatory decision strategy. Overall, the results suggest that social in comparison to non-social information is given more attention and is learned faster than non-social information. Copyright © 2017 Elsevier B.V. All rights reserved.

LFQuant: a label-free fast quantitative analysis tool for high-resolution LC-MS/MS proteomics data.

PubMed

Zhang, Wei; Zhang, Jiyang; Xu, Changming; Li, Ning; Liu, Hui; Ma, Jie; Zhu, Yunping; Xie, Hongwei

2012-12-01

Database searching based methods for label-free quantification aim to reconstruct the peptide extracted ion chromatogram based on the identification information, which can limit the search space and thus make the data processing much faster. The random effect of the MS/MS sampling can be remedied by cross-assignment among different runs. Here, we present a new label-free fast quantitative analysis tool, LFQuant, for high-resolution LC-MS/MS proteomics data based on database searching. It is designed to accept raw data in two common formats (mzXML and Thermo RAW), and database search results from mainstream tools (MASCOT, SEQUEST, and X!Tandem), as input data. LFQuant can handle large-scale label-free data with fractionation such as SDS-PAGE and 2D LC. It is easy to use and provides handy user interfaces for data loading, parameter setting, quantitative analysis, and quantitative data visualization. LFQuant was compared with two common quantification software packages, MaxQuant and IDEAL-Q, on the replication data set and the UPS1 standard data set. The results show that LFQuant performs better than them in terms of both precision and accuracy, and consumes significantly less processing time. LFQuant is freely available under the GNU General Public License v3.0 at http://sourceforge.net/projects/lfquant/. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining.

PubMed

Salehi, Mojtaba; Bahreininejad, Ardeshir

2011-08-01

Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.

Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining

PubMed Central

Salehi, Mojtaba

2010-01-01

Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously. PMID:21845020

A Web-Based Search Service to Support Imaging Spectrometer Instrument Operations

NASA Technical Reports Server (NTRS)

Smith, Alexander; Thompson, David R.; Sayfi, Elias; Xing, Zhangfan; Castano, Rebecca

2013-01-01

Imaging spectrometers yield rich and informative data products, but interpreting them demands time and expertise. There is a continual need for new algorithms and methods for rapid first-draft analyses to assist analysts during instrument opera-tions. Intelligent data analyses can summarize scenes to draft geologic maps, searching images to direct op-erator attention to key features. This validates data quality while facilitating rapid tactical decision making to select followup targets. Ideally these algorithms would operate in seconds, never grow bored, and be free from observation bias about the kinds of mineral-ogy that will be found.

Evaluation of low-level laser therapy in rabbit oral mucosa after soft tissue graft application: A pilot study.

PubMed

Kara, Cankat; Demir, Turgut; Ozbek, Elvan

2013-12-01

The aim of the present study was to assess the histopathological effects of low-level laser therapy (LLLT) on healing of the oral mucosa after soft tissue graft operations. The alterations at the end of healing in normal and LLLT-applied oral mucosa were studied in two healthy adult New Zealand white rabbits by taking specimens for light microscopic inspection. There was no adverse event reported in the study and no post-operative complications, such as swelling, bleeding, or edema, were observed in the rabbits. Complete wound healing was faster in the LLLT-applied rabbit. Compared to the normal rabbit oral mucosa, thickening of the stratum corneum (hyperkeratosis) was found in the epithelia of the rabbits. A significant increase in the epithelial thickness was found in the samples of rabbits, suggesting increased scar tissue following the wound repair. Additionally, many mitotic figures were present in the epithelia of the LLLT-applied rabbit, indicating epithelial cell hyperplasia. Long and irregular connective tissue protrusions projecting into the undersurface of the epithelium and mononuclear cell infiltrations were noted in the rabbits. The results suggest that LLLT used for soft tissue operations provides better and faster wound healing and that LLLT enhances epithelization.

The Role of Color in Search Templates for Real-world Target Objects.

PubMed

Nako, Rebecca; Smith, Tim J; Eimer, Martin

2016-11-01

During visual search, target representations (attentional templates) control the allocation of attention to template-matching objects. The activation of new attentional templates can be prompted by verbal or pictorial target specifications. We measured the N2pc component of the ERP as a temporal marker of attentional target selection to determine the role of color signals in search templates for real-world search target objects that are set up in response to word or picture cues. On each trial run, a word cue (e.g., "apple") was followed by three search displays that contained the cued target object among three distractors. The selection of the first target was based on the word cue only, whereas selection of the two subsequent targets could be controlled by templates set up after the first visual presentation of the target (picture cue). In different trial runs, search displays either contained objects in their natural colors or monochromatic objects. These two display types were presented in different blocks (Experiment 1) or in random order within each block (Experiment 2). RTs were faster, and target N2pc components emerged earlier for the second and third display of each trial run relative to the first display, demonstrating that pictures are more effective than word cues in guiding search. N2pc components were triggered more rapidly for targets in the second and third display in trial runs with colored displays. This demonstrates that when visual target attributes are fully specified by picture cues, the additional presence of color signals in target templates facilitates the speed with which attention is allocated to template-matching objects. No such selection benefits for colored targets were found when search templates were set up in response to word cues. Experiment 2 showed that color templates activated by word cues can even impair the attentional selection of noncolored targets. Results provide new insights into the status of color during the guidance of visual search for real-world target objects. Color is a powerful guiding feature when the precise visual properties of these objects are known but seems to be less important when search targets are specified by word cues.

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.

Search and Rescue. Auxiliary Operational Specialty Course. Student Text.

ERIC Educational Resources Information Center

Coast Guard, Washington, DC.

This text, based on the National Search and Rescue (SAR) Plan, was prepared to provide a course of study on common procedures for SAR operations so that any basically qualified person in the U.S. Coast Guard Auxiliary can effectively accomplish a SAR mission and act as on-scene commander if required. There are 13 chapters: Introduction to Search…

Practical Sequential Design Procedures for Submarine ASW Search Operational Testing: A Simulation Study

DTIC Science & Technology

1998-10-01

The efficient design of a free play , 24 hour per day, operational test (OT) of an ASW search system remains a challenge to the OT community. It will...efficient, realistic, free play , 24 hour per day OT. The basic test control premise described here is to stop the test event if the time without a

An Accurate and Efficient Algorithm for Detection of Radio Bursts with an Unknown Dispersion Measure, for Single-dish Telescopes and Interferometers

NASA Astrophysics Data System (ADS)

Zackay, Barak; Ofek, Eran O.

2017-01-01

Astronomical radio signals are subjected to phase dispersion while traveling through the interstellar medium. To optimally detect a short-duration signal within a frequency band, we have to precisely compensate for the unknown pulse dispersion, which is a computationally demanding task. We present the “fast dispersion measure transform” algorithm for optimal detection of such signals. Our algorithm has a low theoretical complexity of 2{N}f{N}t+{N}t{N}{{Δ }}{{log}}2({N}f), where Nf, Nt, and NΔ are the numbers of frequency bins, time bins, and dispersion measure bins, respectively. Unlike previously suggested fast algorithms, our algorithm conserves the sensitivity of brute-force dedispersion. Our tests indicate that this algorithm, running on a standard desktop computer and implemented in a high-level programming language, is already faster than the state-of-the-art dedispersion codes running on graphical processing units (GPUs). We also present a variant of the algorithm that can be efficiently implemented on GPUs. The latter algorithm’s computation and data-transport requirements are similar to those of a two-dimensional fast Fourier transform, indicating that incoherent dedispersion can now be considered a nonissue while planning future surveys. We further present a fast algorithm for sensitive detection of pulses shorter than the dispersive smearing limits of incoherent dedispersion. In typical cases, this algorithm is orders of magnitude faster than enumerating dispersion measures and coherently dedispersing by convolution. We analyze the computational complexity of pulsed signal searches by radio interferometers. We conclude that, using our suggested algorithms, maximally sensitive blind searches for dispersed pulses are feasible using existing facilities. We provide an implementation of these algorithms in Python and MATLAB.

Reward learning modulates the attentional processing of faces in children with and without autism spectrum disorder.

PubMed

Li, Tianbi; Wang, Xueqin; Pan, Junhao; Feng, Shuyuan; Gong, Mengyuan; Wu, Yaxue; Li, Guoxiang; Li, Sheng; Yi, Li

2017-11-01

The processing of social stimuli, such as human faces, is impaired in individuals with autism spectrum disorder (ASD), which could be accounted for by their lack of social motivation. The current study examined how the attentional processing of faces in children with ASD could be modulated by the learning of face-reward associations. Sixteen high-functioning children with ASD and 20 age- and ability-matched typically developing peers participated in the experiments. All children started with a reward learning task, in which the children were presented with three female faces that were attributed with positive, negative, and neutral values, and were required to remember the faces and their associated values. After this, they were tested on the recognition of the learned faces and a visual search task in which the learned faces served as the distractor. We found a modulatory effect of the face-reward associations on the visual search but not the recognition performance in both groups despite the lower efficacy among children with ASD in learning the face-reward associations. Specifically, both groups responded faster when one of the distractor faces was associated with positive or negative values than when the distractor face was neutral, suggesting an efficient attentional processing of these reward-associated faces. Our findings provide direct evidence for the perceptual-level modulatory effect of reward learning on the attentional processing of faces in individuals with ASD. Autism Res 2017, 10: 1797-1807. © 2017 International Society for Autism Research, Wiley Periodicals, Inc. In our study, we tested whether the face processing of individuals with ASD could be changed when the faces were associated with different social meanings. We found no effect of social meanings on face recognition, but both groups responded faster in the visual search task when one of the distractor faces was associated with positive or negative values than when the neutral face. The findings suggest that children with ASD could efficiently process faces associated with different values like typical children. © 2017 International Society for Autism Research, Wiley Periodicals, Inc.

Minimal access surgery for repair of congenital diaphragmatic hernia: is it advantageous?--An open review.

PubMed

Vijfhuize, S; Deden, A C; Costerus, S A; Sloots, C E J; Wijnen, R M H

2012-10-01

Congenital diaphragmatic hernia (CDH) is a congenital life-threatening condition requiring surgical repair in the neonatal period. Minimal access surgery (MAS) is gaining ground on the classical open approach by laparotomy or thoracotomy as it minimizes damage to the abdominal or thoracic wall. Using an open review of the literature, we aimed to determine whether MAS is safe and effective in treating CDH. Furthermore, we provide selection criteria for the optimal surgical approach, laid down in a decision algorithm. An online search of MEDLINE was performed (May 2012), followed by a citations search. All study types except case reports describing open and/or MAS repair of Bochdalek CDH were eligible. Primary outcome data, for example, surgical complications and mortality, were recorded, as well as secondary outcome measures, for example, operative time, duration of postoperative ventilation, tolerance of enteral nutrition, and total length of stay (LOS) in hospital. Analysis was performed in accordance with the standards of the Cochrane Handbook for Systematic Reviews of Interventions. We identified 15 relevant studies, 5 of them describing MAS only and 10 comparing MAS to open repair of CDH. Numbers of included patients and selection criteria for MAS varied widely. Most studies have methodological limitations, such as the use of retrospective data or historical control groups. ECMO treatment and patch use were more frequent in the open repair group (both p < 0.0001). Recurrence risk seemed to be increased in the MAS group. The need for conversion in MAS series ranged widely, from 3.4 to 75.0%. The risk of general surgical complications did not vary between groups. Mortality seemed to be less in the MAS group. Operative time seemed to be longer in the MAS group. Duration of postoperative ventilation and total LOS appeared to be reduced in this group and patients returned quicker to enteral nutrition. We demonstrate that MAS for diaphragmatic hernia appears to be safe in terms of complications and mortality. Besides, it is associated with faster postoperative recovery. Growing experience with this technique is expected to lower the recurrence risk and to shorten the operative time. These findings should be interpreted cautiously because of methodological limitations of the studies included. Selection criteria used in various studies are associated with an important risk of selection bias. Nonetheless, these criteria can be used to identify patients who will benefit most from MAS. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.

Air Force Roadmap 2006-2025

DTIC Science & Technology

2006-06-01

systems. Cyberspace is the electronic medium of net-centric operations, communications systems, and computers, in which horizontal integration and online...will be interoperable, more robust, responsive, and able to support faster spacecraft initialization times. This Intergrated Satellite Control... horizontally and vertically integrated information through machine-to-machine conversations enabled by a peer-based network of sensors, command

[A comparison between adults and children tonsillectomy with monopolar electrocautery].

PubMed

Ao, Min; Deng, Jie; Gao, Lei; He, Gang

2015-02-01

Tonsillectomy is one of the most frequently applied operations in the ENT practice. This prospective study compared intraoperative records and postoperative clinical outcomes between adults and children patients following monopolar electrocautery tonsillectomy. Forty adult patients and Forty children patients with histories of recurrent tonsillitis or hypertrophic tonsillitis were enrolled. Intraoperative parameters and postoperative outcomes were compared. Children tonsillectomy with monopolar electrocautery was significantly faster to perform (P < 0.05), and produced significantly less intraoperative blood loss (P < 0.05), and faster to return to commencement of a regular diet (P < 0.05) than adults. Children tonsillectomy endured less postopera- tive pain within a week (P > 0.05) than adults, but there was no significant difference in pain on the 14th postoperative day in two groups. There was no obvious postoperative hemorrhage in two groups. There was no significant difference in postoperative tonsillar fossa healing and postoperative temperature between the groups. Children and adults tonsillectomy with monopolar electrocautery had clinical characteristics respectively. Monopolar electrocautery tonsillectomy was safe and operated easily in both two groups.

Waste treatment by bacterial additions

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

Deutsch, D.J.; Stigall, E.; Barth, E.

1979-04-23

Companies such as General Environmental Science Corp. and Polybac Corp., which market specialized bacterial cultures for treating industrial wastes, claim that the cultures improve the operation of activated-sludge, trickling-filter, and lagoon-treatment plants, and provide faster system response to startups, variable and shock loads, and cold weather. The effectiveness of the special cultures is difficult to verify and has been questioned by environmental experts, including R. L. Raymond (Suntech Inc.) and E. Barth (EPA), although E. Stigall (EPA) believes they may aid plant recovery after upsets. A study by Business Communications Co. has predicted that the market for such additives willmore » reach $50 million by 1987, from $5 million in 1979. The use of such cultures in Exxon Corp.'s 1 million gal/day activated sludge system at the Benicia, Calif., oil refinery improved the system's performance by 32Vertical Bar3<, resulted in faster unit startups and more stable operation, and reduced foaming. J. T. Baker Co. has used successfully two broad-spectrum dried additives for ammonia removal and hydrocarbon degradation at its 3 million gal/day secondary treatment plant at Phillipsburg, N.J.« less

Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities

PubMed Central

Li, Jun-qing; Pan, Quan-ke; Mao, Kun

2014-01-01

A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm. PMID:24883414

National Centers for Environmental Prediction

Science.gov Websites

Organization Search Enter text Search Navigation Bar End Cap Search EMC Go Branches Global Climate and Weather Modeling Mesoscale Modeling Marine Modeling and Analysis Teams Climate Data Assimilation Ensembles and Post Model Configuration Collaborators Documentation and Code FAQ Operational Change Log Parallel Experiment

32 CFR Appendix A to Part 292 - Uniform Agency Fees for Search and Duplication Under the Freedom of Information Act (as Amended)

Code of Federal Regulations, 2011 CFR

2011-07-01

... a. above) for the computer/operator/programmer determining how to conduct and subsequently executing the search will be recorded as part of the computer search. c. Actual time spent travelling to a...

Improved Evolutionary Hybrids for Flexible Ligand Docking in Autodock

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

Belew, R.K.; Hart, W.E.; Morris, G.M.

1999-01-27

In this paper we evaluate the design of the hybrid evolutionary algorithms (EAs) that are currently used to perform flexible ligand binding in the Autodock docking software. Hybrid EAs incorporate specialized operators that exploit domain-specific features to accelerate an EA's search. We consider hybrid EAs that use an integrated local search operator to reline individuals within each iteration of the search. We evaluate several factors that impact the efficacy of a hybrid EA, and we propose new hybrid EAs that provide more robust convergence to low-energy docking configurations than the methods currently available in Autodock.

Multimodal cues provide redundant information for bumblebees when the stimulus is visually salient, but facilitate red target detection in a naturalistic background

PubMed Central

Corcobado, Guadalupe; Trillo, Alejandro

2017-01-01

Our understanding of how floral visitors integrate visual and olfactory cues when seeking food, and how background complexity affects flower detection is limited. Here, we aimed to understand the use of visual and olfactory information for bumblebees (Bombus terrestris terrestris L.) when seeking flowers in a visually complex background. To explore this issue, we first evaluated the effect of flower colour (red and blue), size (8, 16 and 32 mm), scent (presence or absence) and the amount of training on the foraging strategy of bumblebees (accuracy, search time and flight behaviour), considering the visual complexity of our background, to later explore whether experienced bumblebees, previously trained in the presence of scent, can recall and make use of odour information when foraging in the presence of novel visual stimuli carrying a familiar scent. Of all the variables analysed, flower colour had the strongest effect on the foraging strategy. Bumblebees searching for blue flowers were more accurate, flew faster, followed more direct paths between flowers and needed less time to find them, than bumblebees searching for red flowers. In turn, training and the presence of odour helped bees to find inconspicuous (red) flowers. When bees foraged on red flowers, search time increased with flower size; but search time was independent of flower size when bees foraged on blue flowers. Previous experience with floral scent enhances the capacity of detection of a novel colour carrying a familiar scent, probably by elemental association influencing attention. PMID:28898287

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.

The relation between visualization size, grouping, and user performance.

PubMed

Gramazio, Connor C; Schloss, Karen B; Laidlaw, David H

2014-12-01

In this paper we make the following contributions: (1) we describe how the grouping, quantity, and size of visual marks affects search time based on the results from two experiments; (2) we report how search performance relates to self-reported difficulty in finding the target for different display types; and (3) we present design guidelines based on our findings to facilitate the design of effective visualizations. Both Experiment 1 and 2 asked participants to search for a unique target in colored visualizations to test how the grouping, quantity, and size of marks affects user performance. In Experiment 1, the target square was embedded in a grid of squares and in Experiment 2 the target was a point in a scatterplot. Search performance was faster when colors were spatially grouped than when they were randomly arranged. The quantity of marks had little effect on search time for grouped displays ("pop-out"), but increasing the quantity of marks slowed reaction time for random displays. Regardless of color layout (grouped vs. random), response times were slowest for the smallest mark size and decreased as mark size increased to a point, after which response times plateaued. In addition to these two experiments we also include potential application areas, as well as results from a small case study where we report preliminary findings that size may affect how users infer how visualizations should be used. We conclude with a list of design guidelines that focus on how to best create visualizations based on grouping, quantity, and size of visual marks.

Clinical use of a cordless laparoscopic ultrasonic device.

PubMed

Kim, Fernando J; Sehrt, David; Molina, Wilson R; Pompeo, Alexandre

2014-01-01

On April 25, 2012, the first laparoscopic cordless ultrasonic device (Sonicision, Covidien, Mansfield, Massachusetts) was used in a clinical setting. We describe our initial experience. The cordless device is assembled with a reusable battery and generator on a base hand-piece. It has a minimum and maximum power setting controlled by a single trigger for both coagulation and cutting. A laparoscopic radical nephrectomy was performed on a 56-year-old man with a 7-cm right renal mass. A laparoscopic pelvic lymphadenectomy was performed in a 51-year-old man with high-risk prostate cancer. Data on surgical team satisfaction, operative time, number of activations, and times the laparoscope was removed as a result of plume were collected. The surgical technician successfully assembled the device at the beginning of the cases with verbal instructions from the surgeon. Operative time for nephrectomy was 77 minutes, with 143 total activations (minimum = 86, maximum = 57). The operative time for the pelvic lymphadenectomy was 27 minutes, with 38 total activations (minimum = 27, maximum = 11). One battery was used in each case. The laparoscope was removed twice during the nephrectomy and once during the lymphadenectomy. Surgical staff satisfaction survey results revealed easier and faster assembly, more space in the operating room, ergonomic handle, and comparable cutting/coagulation, weight, and plume generation with other devices (Table 1). [Table: see text]. The first clinical application of the pioneering cordless dissector was successfully performed, resulting in surgeons' perceptions of comparable results with other devices of easier and safer use and faster assembly.

Cue generation and memory construction in direct and generative autobiographical memory retrieval.

PubMed

Harris, Celia B; O'Connor, Akira R; Sutton, John

2015-05-01

Theories of autobiographical memory emphasise effortful, generative search processes in memory retrieval. However recent research suggests that memories are often retrieved directly, without effortful search. We investigated whether direct and generative retrieval differed in the characteristics of memories recalled, or only in terms of retrieval latency. Participants recalled autobiographical memories in response to cue words. For each memory, they reported whether it was retrieved directly or generatively, rated its visuo-spatial perspective, and judged its accompanying recollective experience. Our results indicated that direct retrieval was commonly reported and was faster than generative retrieval, replicating recent findings. The characteristics of directly retrieved memories differed from generatively retrieved memories: directly retrieved memories had higher field perspective ratings and lower observer perspective ratings. However, retrieval mode did not influence recollective experience. We discuss our findings in terms of cue generation and content construction, and the implication for reconstructive models of autobiographical memory. Copyright © 2015 Elsevier Inc. All rights reserved.

Observing eye movements and the influence of cognition during a symbol search task: a comparison across three age groups.

PubMed

Perrin, Maxine; Robillard, Manon; Roy-Charland, Annie

2017-12-01

This study examined eye movements during a visual search task as well as cognitive abilities within three age groups. The aim was to explore scanning patterns across symbol grids and to better understand the impact of symbol location in AAC displays on speed and accuracy of symbol selection. For the study, 60 students were asked to locate a series of symbols on 16 cell grids. The EyeLink 1000 was used to measure eye movements, accuracy, and response time. Accuracy was high across all cells. Participants had faster response times, longer fixations, and more frequent fixations on symbols located in the middle of the grid. Group comparisons revealed significant differences for accuracy and reaction times. The Leiter-R was used to evaluate cognitive abilities. Sustained attention and cognitive flexibility scores predicted the participants' reaction time and accuracy in symbol selection. Findings suggest that symbol location within AAC devices and individuals' cognitive abilities influence the speed and accuracy of retrieving symbols.

Threat is in the sex of the beholder: men find weapons faster than do women.

PubMed

Sulikowski, Danielle; Burke, Darren

2014-10-29

In visual displays, people locate potentially threatening stimuli, such as snakes, spiders, and weapons, more quickly than similar benign stimuli, such as beetles and gadgets. Such biases are likely adaptive, facilitating fast responses to potential threats. Currently, and historically, men have engaged in more weapons-related activities (fighting and hunting) than women. If biases of visual attention for weapons result from selection pressures related to these activities, then we would predict such biases to be stronger in men than in women. The current study reports the results of two visual search experiments, in which men showed a stronger bias of attention toward guns and knives than did women, whether the weapons were depicted wielded or not. When the weapons were depicted wielded, both sexes searched for them with more caution than when they were not. Neither of these effects extended reliably to syringes, a non-weapon-yet potentially threatening-object. The findings are discussed with respect to the "weapons effect" and social coercion theory.

Making working memory work: The effects of extended practice on focus capacity and the processes of updating, forward access, and random access

PubMed Central

Price, John M.; Colflesh, Gregory J. H.; Cerella, John; Verhaeghen, Paul

2014-01-01

We investigated the effects of 10 hours of practice on variations of the N-Back task to investigate the processes underlying possible expansion of the focus of attention within working memory. Using subtractive logic, we showed that random access (i.e., Sternberg-like search) yielded a modest effect (a 50% increase in speed) whereas the processes of forward access (i.e., retrieval in order, as in a standard N-Back task) and updating (i.e., changing the contents of working memory) were executed about 5 times faster after extended practice. We additionally found that extended practice increased working memory capacity as measured by the size of the focus of attention for the forward-access task, but not for variations where probing was in random order. This suggests that working memory capacity may depend on the type of search process engaged, and that certain working-memory-related cognitive processes are more amenable to practice than others. PMID:24486803

How much information? East Asian and North American cultural products and information search performance.

PubMed

Wang, Huaitang; Masuda, Takahiko; Ito, Kenichi; Rashid, Marghalara

2012-12-01

Literature in cultural psychology suggests that compared with North Americans, East Asians prefer context-rich cultural products (e.g., paintings and photographs). The present article further examines the preferred amount of information in cultural products produced by East Asians and North Americans (Study 1: Society for Personality and Social Psychology conference posters; Study 2: government and university portal pages). The authors found that East Asians produced more information-rich products than did North Americans. Study 3 further examined people's information search speed when identifying target objects on mock webpages containing large amounts of information. The results indicated that East Asians were faster than North Americans in dealing with information on mock webpages with large amounts of information. Finally, the authors found that there were cultural differences as well as similarities in functional and aesthetic preferences regarding styles of information presentation. The interplay between cultural products and skills for accommodating to the cultural products is discussed.

Mary, a Pipeline to Aid Discovery of Optical Transients

NASA Astrophysics Data System (ADS)

Andreoni, I.; Jacobs, C.; Hegarty, S.; Pritchard, T.; Cooke, J.; Ryder, S.

2017-09-01

The ability to quickly detect transient sources in optical images and trigger multi-wavelength follow up is key for the discovery of fast transients. These include events rare and difficult to detect such as kilonovae, supernova shock breakout, and `orphan' Gamma-ray Burst afterglows. We present the Mary pipeline, a (mostly) automated tool to discover transients during high-cadenced observations with the Dark Energy Camera at Cerro Tololo Inter-American Observatory (CTIO). The observations are part of the `Deeper Wider Faster' programme, a multi-facility, multi-wavelength programme designed to discover fast transients, including counterparts to Fast Radio Bursts and gravitational waves. Our tests of the Mary pipeline on Dark Energy Camera images return a false positive rate of 2.2% and a missed fraction of 3.4% obtained in less than 2 min, which proves the pipeline to be suitable for rapid and high-quality transient searches. The pipeline can be adapted to search for transients in data obtained with imagers other than Dark Energy Camera.

Real-time Automatic Search for Multi-wavelength Counterparts of DWF Transients

NASA Astrophysics Data System (ADS)

Murphy, Christopher; Cucchiara, Antonino; Andreoni, Igor; Cooke, Jeff; Hegarty, Sarah

2018-01-01

The Deeper Wider Faster (DWF) survey aims to find and classify the fastest transients in the Universe. DWF utilizes the Dark Energy Camera (DECam), collecting a continuous sequence of 20s images over a 3 square degree field of view.Once an interesting transient is detected during DWF observations, the DWF collaboration has access to several facilities for rapid follow-up in multiple wavelengths (from gamma to radio).An online web tool has been designed to help with real-time visual classification of possible astrophysical transients in data collected by the DWF observing program. The goal of this project is to create a python-based code to improve the classification process by querying several existing archive databases. Given the DWF transient location and search radius, the developed code will extract a list of possible counterparts and all available information (e.g. magnitude, radio fluxes, distance separation).Thanks to this tool, the human classifier can make a quicker decision in order to trigger the collaboration rapid-response resources.

Using Bitmap Indexing Technology for Combined Numerical and TextQueries

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

Stockinger, Kurt; Cieslewicz, John; Wu, Kesheng

2006-10-16

In this paper, we describe a strategy of using compressedbitmap indices to speed up queries on both numerical data and textdocuments. By using an efficient compression algorithm, these compressedbitmap indices are compact even for indices with millions of distinctterms. Moreover, bitmap indices can be used very efficiently to answerBoolean queries over text documents involving multiple query terms.Existing inverted indices for text searches are usually inefficient forcorpora with a very large number of terms as well as for queriesinvolving a large number of hits. We demonstrate that our compressedbitmap index technology overcomes both of those short-comings. In aperformance comparison against amore » commonly used database system, ourindices answer queries 30 times faster on average. To provide full SQLsupport, we integrated our indexing software, called FastBit, withMonetDB. The integrated system MonetDB/FastBit provides not onlyefficient searches on a single table as FastBit does, but also answersjoin queries efficiently. Furthermore, MonetDB/FastBit also provides avery efficient retrieval mechanism of result records.« less

AQUAdexIM: highly efficient in-memory indexing and querying of astronomy time series images

NASA Astrophysics Data System (ADS)

Hong, Zhi; Yu, Ce; Wang, Jie; Xiao, Jian; Cui, Chenzhou; Sun, Jizhou

2016-12-01

Astronomy has always been, and will continue to be, a data-based science, and astronomers nowadays are faced with increasingly massive datasets, one key problem of which is to efficiently retrieve the desired cup of data from the ocean. AQUAdexIM, an innovative spatial indexing and querying method, performs highly efficient on-the-fly queries under users' request to search for Time Series Images from existing observation data on the server side and only return the desired FITS images to users, so users no longer need to download entire datasets to their local machines, which will only become more and more impractical as the data size keeps increasing. Moreover, AQUAdexIM manages to keep a very low storage space overhead and its specially designed in-memory index structure enables it to search for Time Series Images of a given area of the sky 10 times faster than using Redis, a state-of-the-art in-memory database.

Soldier experiments and assessments using SPEAR speech control system for UGVs

NASA Astrophysics Data System (ADS)

Brown, Jonathan; Blanco, Chris; Czerniak, Jeffrey; Hoffman, Brian; Hoffman, Orin; Juneja, Amit; Ngia, Lester; Pruthi, Tarun; Liu, Dongqing

2010-04-01

This paper reports on a Soldier Experiment performed by the Army Research Lab's Human Research Engineering Directorate (HRED) Field Element located at the Maneuver Center of Excellence, Ft. Benning, and a Limited Use Assessment conducted by the Marine Corps Forces Pacific Command Experimentation Center (MEC) at Camp Pendleton evaluating the effectiveness of using speech commands to control an Unmanned Ground Vehicle. SPEAR, developed by Think-A-Move, Ltd., provides speech control of UGVs. SPEAR detects user speech in the ear canal with an earpiece containing an in-ear microphone. The system design provides up to 30 dB of passive noise reduction, enabling it to work well in high-noise environments, where traditional speech systems, using external microphones, fail; it also utilizes a proprietary speech recognition engine. SPEAR has been integrated with iRobot's PackBot 510 with FasTac Kit, and with Multi-Robot Operator Control Unit (MOCU), developed by SPAWAR Systems Center Pacific. These integrated systems allow speech to supplement the hand-controller for multi-modal control of different UGV functions simultaneously. HRED's experiment measured the impact of SPEAR on reducing the cognitive load placed on UGV Operators and the time to complete specific tasks. Army NCOs and Officer School Candidates participated in this experiment, which found that speech control was faster than manual control to complete tasks requiring menu navigation, as well as reducing the cognitive load on UGV Operators. The MEC assessment examined speech commands used for two different missions: Route Clearance and Cordon and Search; participants included Explosive Ordnance Disposal Technicians and Combat Engineers. The majority of the Marines thought it was easier to complete the mission scenarios with SPEAR than with only using manual controls, and that using SPEAR improved their situational awareness. Overall results of these Assessments are reported in the paper, along with possible applications to autonomous mine detection systems.

A capacitated vehicle routing problem with order available time in e-commerce industry

NASA Astrophysics Data System (ADS)

Liu, Ling; Li, Kunpeng; Liu, Zhixue

2017-03-01

In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

National Centers for Environmental Prediction

Science.gov Websites

Organization Search Enter text Search Navigation Bar End Cap Search EMC Go Branches Global Climate and Weather Modeling Mesoscale Modeling Marine Modeling and Analysis Teams Climate Data Assimilation Ensembles and Post Configuration Collaborators Documentation and Code FAQ Operational Change Log Parallel Experiment Change Log

National Centers for Environmental Prediction

Science.gov Websites

Organization Search Enter text Search Navigation Bar End Cap Search EMC Go Branches Global Climate and Weather Modeling Mesoscale Modeling Marine Modeling and Analysis Teams Climate Data Assimilation Ensembles and Post Collaborators Documentation and Code FAQ Operational Change Log Parallel Experiment Change Log Contacts

49 CFR 7.43 - Fee schedule.

Code of Federal Regulations, 2010 CFR

2010-10-01

.... The rates for manual searching, computer operator/programmer time and time spent reviewing records... requested under subpart C of this part, including making it available for inspection, will be determined by... search. (b) The standard fee for a computer search for a record requested under subpart C of this part is...

49 CFR 7.43 - Fee schedule.

Code of Federal Regulations, 2011 CFR

2011-10-01

.... The rates for manual searching, computer operator/programmer time and time spent reviewing records... requested under subpart C of this part, including making it available for inspection, will be determined by... search. (b) The standard fee for a computer search for a record requested under subpart C of this part is...

Large Scale IR Evaluation

ERIC Educational Resources Information Center

Pavlu, Virgil

2008-01-01

Today, search engines are embedded into all aspects of digital world: in addition to Internet search, all operating systems have integrated search engines that respond even as you type, even over the network, even on cell phones; therefore the importance of their efficacy and efficiency cannot be overstated. There are many open possibilities for…

The Gerda experiment for the search of 0νββ decay in 76Ge

DOE PAGES

Ackermann, K. -H.; Agostini, M.; Allardt, M.; ...

2013-03-01

The Gerda collaboration is performing a search for neutrinoless double beta decay of 76 Ge with the eponymous detector. The experiment has been installed and commissioned at the Laboratori Nazionali del Gran Sasso and has started operation in November 2011. The design, construction and first operational results are described, along with detailed information from the R & D phase.

Technology Evaluation for an Advanced Individual Protection System (AIPS)

DTIC Science & Technology

1992-12-01

this analysis are: time of operation, duration of thermal management, power consumed during operation, cooling/heating benefit , time between recharge...BRDEC) TOPICS: o individual power * batteries/engines/fuel cel!s POC: Wes Goodwin (NRDEC) TOPICS: * microclimate cooling e vapor compression cycles e...individual power 2.3 LITERATURE SEARCHES The literature searches began by reviewing Battelle in-house sources for useful reports. This included a

Novel fiber optic immunosensor instrument

NASA Astrophysics Data System (ADS)

Wang, Zhiyu; Huang, Wenling; Tang, Lei; Zhou, Bo; Li, Yugi; He, Jun

1996-09-01

It has developed and performed a novel fiberoptic immunosensor instrument with operating wavelength 400 - 760 nm and repeatability cv equals 0.27%. The instrument has many excellent features such as simplified operation, faster testing time, higher sensitivity and economic cost. It has completely eliminated recovery period which traditional immunosensor owned due to use separative sensor structure. It can widely apply to test for bacteria, virus, hormone, parasite and cancer protein in clinical examination. The instrument has operated in laboratory and relevant medicine units and successfully tested monoclonal rat-anti-human of 413 cases in clinic and prepared with existing ELISA method, the coincidence probability reached 94 to 100%.

Clinical operations generation next… The age of technology and outsourcing

PubMed Central

Temkar, Priya

2015-01-01

Huge cost pressures and the need to drive faster approvals has driven a technology transformation in the clinical trial (CT) industry. The CT industry is thus leveraging mobile data, cloud computing, social media, robotic automation, and electronic source to drive efficiencies in a big way. Outsourcing of clinical operations support services to technology companies with a clinical edge is gaining tremendous importance. This paper provides an overview of current technology trends, applicable Food and Drug Administration (FDA) guidelines, basic challenges that the pharma industry is facing in trying to implement such changes and its shift towards outsourcing these services to enable it to focus on site operations. PMID:26623386

Unit undergoes controls upgrade to meet cycling needs

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

Weston, B.; Tinkham, R.; Chloupek, J.

1994-04-01

New England Electric System's Brayton Point Unit 3, Somerset, Mass, along with many other units in the US, has been forced into cycling operation on a much more frequent basis than was intended when the original controls were installed. Low-load operation and lengthy startup times also had to be addressed. An integrated control and monitoring system installed at Unit 3 to handle the boiler/turbine controls, burner management, and equipment monitoring functions. New strategies, particularly with the startup valves, were implemented to provide faster, safer, and more economical startups. The retrofit has been a success, with marked improvement in both startupmore » and operation.« less

Clinical operations generation next… The age of technology and outsourcing.

PubMed

Temkar, Priya

2015-01-01

Huge cost pressures and the need to drive faster approvals has driven a technology transformation in the clinical trial (CT) industry. The CT industry is thus leveraging mobile data, cloud computing, social media, robotic automation, and electronic source to drive efficiencies in a big way. Outsourcing of clinical operations support services to technology companies with a clinical edge is gaining tremendous importance. This paper provides an overview of current technology trends, applicable Food and Drug Administration (FDA) guidelines, basic challenges that the pharma industry is facing in trying to implement such changes and its shift towards outsourcing these services to enable it to focus on site operations.

Boosted Higgs bosons from chromomagnetic b 's: b b ¯h at high luminosity

NASA Astrophysics Data System (ADS)

Bramante, Joseph; Delgado, Antonio; Lehman, Landon; Martin, Adam

2016-03-01

This paper examines detection prospects and constraints on the chromomagnetic dipole operator for the bottom quark. This operator has a flavor, chirality and Lorentz structure that is distinct from other dimension-6 operators considered in Higgs coupling studies. Its nonstandard Lorentz structure results in boosted b b ¯h events, providing a rate-independent signal of new physics. To date, we find this operator is unconstrained by p p →h +jets and p p →b ¯b searches: for order-1 couplings the permitted cutoff Λ for this operator can be as low as Λ ˜1 TeV . We show how to improve this bound with collider cuts that allow a b -tagged Higgs-plus-dijet search in the Higgs-to-diphoton decay channel to exclude cutoffs as high as ˜6 TeV at 2 σ with 3 ab-1 of luminosity at the 14 TeV LHC. Cuts on the pT of the Higgs are key to this search, because the chromomagnetic dipole yields a nonstandard fraction of boosted Higgses.

Distributed subterranean exploration and mapping with teams of UAVs

NASA Astrophysics Data System (ADS)

Rogers, John G.; Sherrill, Ryan E.; Schang, Arthur; Meadows, Shava L.; Cox, Eric P.; Byrne, Brendan; Baran, David G.; Curtis, J. Willard; Brink, Kevin M.

2017-05-01

Teams of small autonomous UAVs can be used to map and explore unknown environments which are inaccessible to teams of human operators in humanitarian assistance and disaster relief efforts (HA/DR). In addition to HA/DR applications, teams of small autonomous UAVs can enhance Warfighter capabilities and provide operational stand-off for military operations such as cordon and search, counter-WMD, and other intelligence, surveillance, and reconnaissance (ISR) operations. This paper will present a hardware platform and software architecture to enable distributed teams of heterogeneous UAVs to navigate, explore, and coordinate their activities to accomplish a search task in a previously unknown environment.

Planning for operating room efficiency and faster anesthesia wake-up time in open major upper abdominal surgery.

PubMed

Lai, Hou-Chuan; Chan, Shun-Ming; Lu, Chueng-He; Wong, Chih-Shung; Cherng, Chen-Hwan; Wu, Zhi-Fu

2017-02-01

Reducing anesthesia-controlled time (ACT) may improve operation room (OR) efficiency result from different anesthetic techniques. However, the information about the difference in ACT between desflurane (DES) anesthesia and propofol-based total intravenous anesthesia (TIVA) techniques for open major upper abdominal surgery under general anesthesia (GA) is not available in the literature.This retrospective study uses our hospital database to analyze the ACT of open major upper abdominal surgery without liver resection after either desflurane/fentanyl-based anesthesia or TIVA via target-controlled infusion with fentanyl/propofol from January 2010 to December 2011. The various time intervals including waiting for anesthesia time, anesthesia time, surgical time, extubation time, exit from OR after extubation, total OR time, and postanesthetic care unit (PACU) stay time and percentage of prolonged extubation (≥15 minutes) were compared between these 2 anesthetic techniques.We included data from 343 patients, with 159 patients receiving TIVA and 184 patients receiving DES. The only significant difference is extubation time, TIVA was faster than the DES group (8.5 ± 3.8 vs 9.4 ± 3.7 minutes; P = 0.04). The factors contributed to prolonged extubation were age, gender, body mass index, DES anesthesia, and anesthesia time.In our hospital, propofol-based TIVA by target-controlled infusion provides faster emergence compared with DES anesthesia; however, it did not improve OR efficiency in open major abdominal surgery. Older, male gender, higher body mass index, DES anesthesia, and lengthy anesthesia time were factors that contribute to extubation time.

Ensemble Solute Transport in 2-D Operator-Stable Random Fields

NASA Astrophysics Data System (ADS)

Monnig, N. D.; Benson, D. A.

2006-12-01

The heterogeneous velocity field that exists at many scales in an aquifer will typically cause a dissolved solute plume to grow at a rate faster than Fick's Law predicts. Some statistical model must be adopted to account for the aquifer structure that engenders the velocity heterogeneity. A fractional Brownian motion (fBm) model has been shown to create the long-range correlation that can produce continually faster-than-Fickian plume growth. Previous fBm models have assumed isotropic scaling (defined here by a scalar Hurst coefficient). Motivated by field measurements of aquifer hydraulic conductivity, recent techniques were developed to construct random fields with anisotropic scaling with a self-similarity parameter that is defined by a matrix. The growth of ensemble plumes is analyzed for transport through 2-D "operator- stable" fBm hydraulic conductivity (K) fields. Both the longitudinal and transverse Hurst coefficients are important to both plume growth rates and the timing and duration of breakthrough. Smaller Hurst coefficients in the transverse direction lead to more "continuity" or stratification in the direction of transport. The result is continually faster-than-Fickian growth rates, highly non-Gaussian ensemble plumes, and a longer tail early in the breakthrough curve. Contrary to some analytic stochastic theories for monofractal K fields, the plume growth rate never exceeds Mercado's [1967] purely stratified aquifer growth rate of plume apparent dispersivity proportional to mean distance. Apparent super-Mercado growth must be the result of other factors, such as larger plumes corresponding to either a larger initial plume size or greater variance of the ln(K) field.

An enhanced high-speed multi-digit BCD adder using quantum-dot cellular automata

NASA Astrophysics Data System (ADS)

Ajitha, D.; Ramanaiah, K. V.; Sumalatha, V.

2017-02-01

The advent of development of high-performance, low-power digital circuits is achieved by a suitable emerging nanodevice called quantum-dot cellular automata (QCA). Even though many efficient arithmetic circuits were designed using QCA, there is still a challenge to implement high-speed circuits in an optimized manner. Among these circuits, one of the essential structures is a parallel multi-digit decimal adder unit with significant speed which is very attractive for future environments. To achieve high speed, a new correction logic formulation method is proposed for single and multi-digit BCD adder. The proposed enhanced single-digit BCD adder (ESDBA) is 26% faster than the carry flow adder (CFA)-based BCD adder. The multi-digit operations are also performed using the proposed ESDBA, which is cascaded innovatively. The enhanced multi-digit BCD adder (EMDBA) performs two 4-digit and two 8-digit BCD addition 50% faster than the CFA-based BCD adder with the nominal overhead of the area. The EMDBA performs two 4-digit BCD addition 24% faster with 23% decrease in the area, similarly for 8-digit operation the EMDBA achieves 36% increase in speed with 21% less area compared to the existing carry look ahead (CLA)-based BCD adder design. The proposed multi-digit adder produces significantly less delay of (N –1) + 3.5 clock cycles compared to the N* One digit BCD adder delay required by the conventional BCD adder method. It is observed that as per our knowledge this is the first innovative proposal for multi-digit BCD addition using QCA.

Accelerating moderately stiff chemical kinetics in reactive-flow simulations using GPUs

NASA Astrophysics Data System (ADS)

Niemeyer, Kyle E.; Sung, Chih-Jen

2014-01-01

The chemical kinetics ODEs arising from operator-split reactive-flow simulations were solved on GPUs using explicit integration algorithms. Nonstiff chemical kinetics of a hydrogen oxidation mechanism (9 species and 38 irreversible reactions) were computed using the explicit fifth-order Runge-Kutta-Cash-Karp method, and the GPU-accelerated version performed faster than single- and six-core CPU versions by factors of 126 and 25, respectively, for 524,288 ODEs. Moderately stiff kinetics, represented with mechanisms for hydrogen/carbon-monoxide (13 species and 54 irreversible reactions) and methane (53 species and 634 irreversible reactions) oxidation, were computed using the stabilized explicit second-order Runge-Kutta-Chebyshev (RKC) algorithm. The GPU-based RKC implementation demonstrated an increase in performance of nearly 59 and 10 times, for problem sizes consisting of 262,144 ODEs and larger, than the single- and six-core CPU-based RKC algorithms using the hydrogen/carbon-monoxide mechanism. With the methane mechanism, RKC-GPU performed more than 65 and 11 times faster, for problem sizes consisting of 131,072 ODEs and larger, than the single- and six-core RKC-CPU versions, and up to 57 times faster than the six-core CPU-based implicit VODE algorithm on 65,536 ODEs. In the presence of more severe stiffness, such as ethylene oxidation (111 species and 1566 irreversible reactions), RKC-GPU performed more than 17 times faster than RKC-CPU on six cores for 32,768 ODEs and larger, and at best 4.5 times faster than VODE on six CPU cores for 65,536 ODEs. With a larger time step size, RKC-GPU performed at best 2.5 times slower than six-core VODE for 8192 ODEs and larger. Therefore, the need for developing new strategies for integrating stiff chemistry on GPUs was discussed.

Modeling and prediction of human word search behavior in interactive machine translation

NASA Astrophysics Data System (ADS)

Ji, Duo; Yu, Bai; Ma, Bin; Ye, Na

2017-12-01

As a kind of computer aided translation method, Interactive Machine Translation technology reduced manual translation repetitive and mechanical operation through a variety of methods, so as to get the translation efficiency, and played an important role in the practical application of the translation work. In this paper, we regarded the behavior of users' frequently searching for words in the translation process as the research object, and transformed the behavior to the translation selection problem under the current translation. The paper presented a prediction model, which is a comprehensive utilization of alignment model, translation model and language model of the searching words behavior. It achieved a highly accurate prediction of searching words behavior, and reduced the switching of mouse and keyboard operations in the users' translation process.

An efficient algorithm for the retarded time equation for noise from rotating sources

NASA Astrophysics Data System (ADS)

Loiodice, S.; Drikakis, D.; Kokkalis, A.

2018-01-01

This study concerns modelling of noise emanating from rotating sources such as helicopter rotors. We present an accurate and efficient algorithm for the solution of the retarded time equation, which can be used both in subsonic and supersonic flow regimes. A novel approach for the search of the roots of the retarded time function was developed based on considerations of the kinematics of rotating sources and of the bifurcation analysis of the retarded time function. It is shown that the proposed algorithm is faster than the classical Newton and Brent methods, especially in the presence of sources rotating supersonically.

Efficient algorithms for a class of partitioning problems

NASA Technical Reports Server (NTRS)

Iqbal, M. Ashraf; Bokhari, Shahid H.

1990-01-01

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.

19 CFR 122.174 - Operational procedures.

Code of Federal Regulations, 2010 CFR

2010-04-01

... ACSPP to conduct the following procedures: (i) Perform a thorough internal and external search of the... thorough internal and external search of the departing aircraft; (ii) Maintain total control of all...

Methods for using novel cathode and electrolyte materials for solid oxide fuel cells and ion transport membranes

DOEpatents

Jacobson, Allan J.; Wang, Shuangyan; Kim, Gun Tae

2016-01-12

Methods using novel cathode, electrolyte and oxygen separation materials operating at intermediate temperatures for use in solid oxide fuel cells and ion transport membranes include oxides with perovskite related structures and an ordered arrangement of A site cations. The materials have significantly faster oxygen kinetics than in corresponding disordered perovskites.

Cathode and electrolyte materials for solid oxide fuel cells and ion transport membranes

DOEpatents

Jacobson, Allan J; Wang, Shuangyan; Kim, Gun Tae

2014-01-28

Novel cathode, electrolyte and oxygen separation materials are disclosed that operate at intermediate temperatures for use in solid oxide fuel cells and ion transport membranes based on oxides with perovskite related structures and an ordered arrangement of A site cations. The materials have significantly faster oxygen kinetics than in corresponding disordered perovskites.

The New Economy: Beyond the Hype. The OECD Growth Project. Economics.

ERIC Educational Resources Information Center

Clarke, Rory; Durand, Martine; Pilat, Dirk; Torres, Raymond

Shifts that have taken place in growth patterns of the economies of Organisation of Economic Co-Operation and Development countries in recent years are examined. The key factor to examine is productivity, since its increase allows the achievement of faster rates of noninflationary economic expansion. By the end of the 1990s, evidence of…

Contingency Software in Autonomous Systems: Technical Level Briefing

NASA Technical Reports Server (NTRS)

Lutz, Robyn R.; Patterson-Hines, Ann

2006-01-01

Contingency management is essential to the robust operation of complex systems such as spacecraft and Unpiloted Aerial Vehicles (UAVs). Automatic contingency handling allows a faster response to unsafe scenarios with reduced human intervention on low-cost and extended missions. Results, applied to the Autonomous Rotorcraft Project and Mars Science Lab, pave the way to more resilient autonomous systems.

Enhancing private sector engagement: Louisiana's business emergency operations centre.

PubMed

Day, Jamison M; Strother, Shannon; Kolluru, Ramesh; Booth, Joseph; Rawls, Jason; Calderon, Andres

2010-07-01

Public sector emergency management is more effective when it coordinates its efforts with private sector companies that can provide useful capabilities faster, cheaper and better than government agencies. A business emergency operations centre (EOC) provides a space for private sector and non-governmental organisations to gather together in support of government efforts. This paper reviews business-related EOC practices in multiple US states and details the development of a new business EOC by the State of Louisiana, including lessons learned in response to the May 2010 oil spill.

On singlet s-wave electron-hydrogen scattering.

NASA Technical Reports Server (NTRS)

Madan, R. N.

1973-01-01

Discussion of various zeroth-order approximations to s-wave scattering of electrons by hydrogen atoms below the first excitation threshold. The formalism previously developed by the author (1967, 1968) is applied to Feshbach operators to derive integro-differential equations, with the optical-potential set equal to zero, for the singlet and triplet cases. Phase shifts of s-wave scattering are computed in the zeroth-order approximation of the Feshbach operator method and in the static-exchange approximation. It is found that the convergence of numerical computations is faster in the former approximation than in the latter.

40 CFR 1515.12 - Fees in general.

Code of Federal Regulations, 2011 CFR

2011-07-01

... attributable to searching for and printing records responsive to the FOIA request and operator/programmer salary attributable to the search. (c) Record reviews. Time devoted to reviewing records shall be charged...

Full-Text Searching on Major Supermarket Systems: Dialog, Data-Star, and Nexis.

ERIC Educational Resources Information Center

Tenopir, Carol; Berglund, Sharon

1993-01-01

Examines the similarities, differences, and full-text features of the three most-used online systems for full-text searching in general libraries: DIALOG, Data-Star, and NEXIS. Overlapping databases, unique sources, search features, proximity operators, set building, language enhancement and word equivalencies, and display features are discussed.…

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

10 CFR 9.33 - Search, review, and special service fees.

Code of Federal Regulations, 2010 CFR

2010-01-01

... in excess of 100 pages when agency records are not sought for commercial use and the request is made...) Search time that exceeds two hours and duplication of agency records of more than 100 pages for requests... records plus the operator/programmer salary apportionable to the search. (b) The NRC may charge requesters...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2012 CFR

2012-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2010 CFR

2010-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2013 CFR

2013-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2011 CFR

2011-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

12 CFR 792.19 - How does NCUA calculate the fees for processing my request?

Code of Federal Regulations, 2014 CFR

2014-01-01

... FREEDOM OF INFORMATION ACT AND PRIVACY ACT, AND BY SUBPOENA; SECURITY PROCEDURES FOR CLASSIFIED.... Searches may be done manually or by computer. Search does not include modification of an existing program... cost of operating the computer for computer searches for records. (c) NCUA will charge the following...

Searching and Researching on the Internet and the World Wide Web.

ERIC Educational Resources Information Center

Ackerman, Ernest; Hartman, Karen

This book focuses on formulating Internet search strategies, understanding how to form search expressions, critically evaluating information, and citing resources. It is written for users who are acquainted with the fundamental operations of a personal computer, as well as those with more online experience. The book is arranged so that the…

Spacecraft Environments Interactive: Space Radiation and Its Effects on Electronic System

NASA Technical Reports Server (NTRS)

Howard, J. W., Jr.; Hardage, D. M.

1999-01-01

The natural space environment is characterized by complex and subtle phenomena hostile to spacecraft. Effects of these phenomena impact spacecraft design, development, and operation. Space systems become increasingly susceptible to the space environment as use of composite materials and smaller, faster electronics increases. This trend makes an understanding of space radiation and its effects on electronic systems essential to accomplish overall mission objectives, especially in the current climate of smaller/better/cheaper faster. This primer outlines the radiation environments encountered in space, discusses regions and types of radiation, applies the information to effects that these environments have on electronic systems, addresses design guidelines and system reliability, and stresses the importance of early involvement of radiation specialists in mission planning, system design, and design review (part-by-part verification).

Evolution of Archival Storage (from Tape to Memory)

NASA Technical Reports Server (NTRS)

Ramapriyan, Hampapuram K.

2015-01-01

Over the last three decades, there has been a significant evolution in storage technologies supporting archival of remote sensing data. This section provides a brief survey of how these technologies have evolved. Three main technologies are considered - tape, hard disk and solid state disk. Their historical evolution is traced, summarizing how reductions in cost have helped being able to store larger volumes of data on faster media. The cost per GB of media is only one of the considerations in determining the best approach to archival storage. Active archives generally require faster response to user requests for data than permanent archives. The archive costs have to consider facilities and other capital costs, operations costs, software licenses, utilities costs, etc. For meeting requirements in any organization, typically a mix of technologies is needed.

Cooperative mobile agents search using beehive partitioned structure and Tabu Random search algorithm

NASA Astrophysics Data System (ADS)

Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.

2013-05-01

In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.

Memory-efficient table look-up optimized algorithm for context-based adaptive variable length decoding in H.264/advanced video coding

NASA Astrophysics Data System (ADS)

Wang, Jianhua; Cheng, Lianglun; Wang, Tao; Peng, Xiaodong

2016-03-01

Table look-up operation plays a very important role during the decoding processing of context-based adaptive variable length decoding (CAVLD) in H.264/advanced video coding (AVC). However, frequent table look-up operation can result in big table memory access, and then lead to high table power consumption. Aiming to solve the problem of big table memory access of current methods, and then reduce high power consumption, a memory-efficient table look-up optimized algorithm is presented for CAVLD. The contribution of this paper lies that index search technology is introduced to reduce big memory access for table look-up, and then reduce high table power consumption. Specifically, in our schemes, we use index search technology to reduce memory access by reducing the searching and matching operations for code_word on the basis of taking advantage of the internal relationship among length of zero in code_prefix, value of code_suffix and code_lengh, thus saving the power consumption of table look-up. The experimental results show that our proposed table look-up algorithm based on index search can lower about 60% memory access consumption compared with table look-up by sequential search scheme, and then save much power consumption for CAVLD in H.264/AVC.