Compressing bitmap indexes for faster search operations
International Nuclear Information System (INIS)
Wu, Kesheng; Otoo, Ekow J.; Shoshani, Arie
2002-01-01
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, NOT, etc. Using the general purpose compression schemes, such as gzip, the logical operations on the compressed bitmaps are much slower than on the uncompressed bitmaps. Specialized compression schemes, like the byte-aligned bitmap code(BBC), are usually faster in performing logical operations than the general purpose schemes, but in many cases they are still orders of magnitude slower than the uncompressed scheme. To make the compressed bitmap indexes operate more efficiently, we designed a CPU-friendly scheme which we refer to as the word-aligned hybrid code (WAH). Tests on both synthetic and real application data show that the new scheme significantly outperforms well-known compression schemes at a modest increase in storage space. Compared to BBC, a scheme well-known for its operational efficiency, WAH performs logical operations about 12 times faster and uses only 60 percent more space. Compared to the uncompressed scheme, in most test cases WAH is faster while still using less space. We further verified with additional tests that the improvement in logical operation speed translates to similar improvement in query processing speed
Compressing bitmap indexes for faster search operations
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Otoo, Ekow J.; Shoshani, Arie
2002-04-25
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, NOT, etc. Using the general purpose compression schemes, such as gzip, the logical operations on the compressed bitmaps are much slower than on the uncompressed bitmaps. Specialized compression schemes, like the byte-aligned bitmap code(BBC), are usually faster in performing logical operations than the general purpose schemes, but in many cases they are still orders of magnitude slower than the uncompressed scheme. To make the compressed bitmap indexes operate more efficiently, we designed a CPU-friendly scheme which we refer to as the word-aligned hybrid code (WAH). Tests on both synthetic and real application data show that the new scheme significantly outperforms well-known compression schemes at a modest increase in storage space. Compared to BBC, a scheme well-known for its operational efficiency, WAH performs logical operations about 12 times faster and uses only 60 percent more space. Compared to the uncompressed scheme, in most test cases WAH is faster while still using less space. We further verified with additional tests that the improvement in logical operation speed translates to similar improvement in query processing speed.
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.
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.
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Directory of Open Access Journals (Sweden)
Rognes Torbjørn
2011-06-01
Full Text Available Abstract 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.
Qin, Xiaoyan Angela; Koutstaal, Wilma; Engel, Stephen A
2014-05-01
Familiar items are found faster than unfamiliar ones in visual search tasks. This effect has important implications for cognitive theory, because it may reveal how mental representations of commonly encountered items are changed by experience to optimize performance. It remains unknown, however, whether everyday items with moderate levels of exposure would show benefits in visual search, and if so, what kind of experience would be required to produce them. Here, we tested whether familiar product logos were searched for faster than unfamiliar ones, and also familiarized subjects with previously unfamiliar logos. Subjects searched for preexperimentally familiar and unfamiliar logos, half of which were familiarized in the laboratory, amongst other, unfamiliar distractor logos. In three experiments, we used an N-back-like familiarization task, and in four others we used a task that asked detailed questions about the perceptual aspects of the logos. The number of familiarization exposures ranged from 30 to 84 per logo across experiments, with two experiments involving across-day familiarization. Preexperimentally familiar target logos were searched for faster than were unfamiliar, nonfamiliarized logos, by 8 % on average. This difference was reliable in all seven experiments. However, familiarization had little or no effect on search speeds; its average effect was to improve search times by 0.7 %, and its effect was significant in only one of the seven experiments. If priming, mere exposure, episodic memory, or relatively modest familiarity were responsible for familiarity's effects on search, then performance should have improved following familiarization. Our results suggest that the search-related advantage of familiar logos does not develop easily or rapidly.
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
Directory of Open Access Journals (Sweden)
Ricardo Soto
2014-01-01
Full Text Available The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9×9 grid, divided into nine 3×3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature.
A GPU Implementation of Local Search Operators for Symmetric Travelling Salesman Problem
Directory of Open Access Journals (Sweden)
Juraj Fosin
2013-06-01
Full Text Available The Travelling Salesman Problem (TSP is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs has brought huge improvement in decreasing the applications’ execution time. In this paper, we implement 2-opt and 3-opt local search operators for solving the TSP on the GPU using CUDA. The novelty presented in this paper is a new parallel iterated local search approach with 2-opt and 3-opt operators for symmetric TSP, optimized for the execution on GPUs. With our implementation large TSP problems (up to 85,900 cities can be solved using the GPU. We will show that our GPU implementation can be up to 20x faster without losing quality for all TSPlib problems as well as for our CRO TSP problem.
CERN Bulletin
2010-01-01
Following the programmed technical stop last week, operators focussed on preparing the machine for faster filling, which includes multibunch injection and a faster pre-cycle phase. The LHC1 screen shot during the first multibunch injection operation. The LHC operational schedule incorporates a technical stop for preventive maintenance roughly every six weeks of stable operation, during which several interventions on the various machines are carried out. Last week these included the replacement of a faulty magnet in the SPS pre-accelerator, which required the subsequent re-setting of the system of particle extraction and transfer to the LHC. At the end of last week, all the machines were handed back for operation and work could start on accommodating all the changes made into the complex systems in order for normal operation to be resumed. These ‘recovery’ operations continued through the weekend and into this week. At the beginning of this week, operators succeeded in pro...
The potential use of unmanned aircraft systems (drones) in mountain search and rescue operations.
Karaca, Yunus; Cicek, Mustafa; Tatli, Ozgur; Sahin, Aynur; Pasli, Sinan; Beser, Muhammed Fatih; Turedi, Suleyman
2018-04-01
This study explores the potential use of drones in searching for and locating victims and of motorized transportation of search and rescue providers in a mountain environment using a simulation model. This prospective randomized simulation study was performed in order to compare two different search and rescue techniques in searching for an unconscious victim on snow-covered ground. In the control arm, the Classical Line Search Technique (CLT) was used, in which the search is performed on foot and the victim is reached on foot. In the intervention arm, the Drone-snowmobile Technique (DST) was used, the search being performed by drone and the victim reached by snowmobile. The primary outcome of the study was the comparison of the two search and rescue techniques in terms of first human contact time. Twenty search and rescue operations were conducted in this study. Median time to arrival at the mannequin was 57.3min for CLT, compared to 8.9min for DST. The median value of the total searched area was 88,322.0m 2 for CLT and 228,613.0m 2 for DST. The median area searched per minute was 1489.6m 2 for CLT and 32,979.9m 2 for DST (pdrone using DST compared to the classical technique, and the victim can be located faster and reached earlier with rescuers transported by snowmobile. Copyright © 2017 Elsevier Inc. All rights reserved.
FASTER Test Reactor Preconceptual Design Report
Energy Technology Data Exchange (ETDEWEB)
Grandy, C. [Argonne National Lab. (ANL), Argonne, IL (United States); Belch, H. [Argonne National Lab. (ANL), Argonne, IL (United States); Brunett, A. J. [Argonne National Lab. (ANL), Argonne, IL (United States); Heidet, F. [Argonne National Lab. (ANL), Argonne, IL (United States); Hill, R. [Argonne National Lab. (ANL), Argonne, IL (United States); Hoffman, E. [Argonne National Lab. (ANL), Argonne, IL (United States); Jin, E. [Argonne National Lab. (ANL), Argonne, IL (United States); Mohamed, W. [Argonne National Lab. (ANL), Argonne, IL (United States); Moisseytsev, A. [Argonne National Lab. (ANL), Argonne, IL (United States); Passerini, S. [Argonne National Lab. (ANL), Argonne, IL (United States); Sienicki, J. [Argonne National Lab. (ANL), Argonne, IL (United States); Sumner, T. [Argonne National Lab. (ANL), Argonne, IL (United States); Vilim, R. [Argonne National Lab. (ANL), Argonne, IL (United States); Hayes, S. [Argonne National Lab. (ANL), Argonne, IL (United States)
2016-03-31
The FASTER test reactor plant is a sodium-cooled fast spectrum test reactor that provides high levels of fast and thermal neutron flux for scientific research and development. The 120MWe FASTER reactor plant has a superheated steam power conversion system which provides electrical power to a local grid allowing for recovery of operating costs for the reactor plant.
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.
FASTER test reactor preconceptual design report summary
Energy Technology Data Exchange (ETDEWEB)
Grandy, C. [Argonne National Lab. (ANL), Argonne, IL (United States); Belch, H. [Argonne National Lab. (ANL), Argonne, IL (United States); Brunett, A. [Argonne National Lab. (ANL), Argonne, IL (United States); Heidet, F. [Argonne National Lab. (ANL), Argonne, IL (United States); Hill, R. [Argonne National Lab. (ANL), Argonne, IL (United States); Hoffman, E. [Argonne National Lab. (ANL), Argonne, IL (United States); Jin, E. [Argonne National Lab. (ANL), Argonne, IL (United States); Mohamed, W. [Argonne National Lab. (ANL), Argonne, IL (United States); Moisseytsev, A. [Argonne National Lab. (ANL), Argonne, IL (United States); Passerini, S. [Argonne National Lab. (ANL), Argonne, IL (United States); Sienicki, J. [Argonne National Lab. (ANL), Argonne, IL (United States); Sumner, T. [Argonne National Lab. (ANL), Argonne, IL (United States); Vilim, R. [Argonne National Lab. (ANL), Argonne, IL (United States); Hayes, Steven [Argonne National Lab. (ANL), Argonne, IL (United States)
2016-02-29
The FASTER reactor plant is a sodium-cooled fast spectrum test reactor that provides high levels of fast and thermal neutron flux for scientific research and development. The 120MWe FASTER reactor plant has a superheated steam power conversion system which provides electrical power to a local grid allowing for recovery of operating costs for the reactor plant.
Contextual cueing of pop-out visual search: when context guides the deployment of attention.
Geyer, Thomas; Zehetleitner, Michael; Müller, Hermann J
2010-05-01
Visual context information can guide attention in demanding (i.e., inefficient) search tasks. When participants are repeatedly presented with identically arranged ('repeated') displays, reaction times are faster relative to newly composed ('non-repeated') displays. The present article examines whether this 'contextual cueing' effect operates also in simple (i.e., efficient) search tasks and if so, whether there it influences target, rather than response, selection. The results were that singleton-feature targets were detected faster when the search items were presented in repeated, rather than non-repeated, arrangements. Importantly, repeated, relative to novel, displays also led to an increase in signal detection accuracy. Thus, contextual cueing can expedite the selection of pop-out targets, most likely by enhancing feature contrast signals at the overall-salience computation stage.
Optimization of partial search
International Nuclear Information System (INIS)
Korepin, Vladimir E
2005-01-01
A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm. (letter to the editor)
Query-dependent banding (QDB for faster RNA similarity searches.
Directory of Open Access Journals (Sweden)
Eric P Nawrocki
2007-03-01
Full Text Available When searching sequence databases for RNAs, it is desirable to score both primary sequence and RNA secondary structure similarity. Covariance models (CMs are probabilistic models well-suited for RNA similarity search applications. However, the computational complexity of CM dynamic programming alignment algorithms has limited their practical application. Here we describe an acceleration method called query-dependent banding (QDB, which uses the probabilistic query CM to precalculate regions of the dynamic programming lattice that have negligible probability, independently of the target database. We have implemented QDB in the freely available Infernal software package. QDB reduces the average case time complexity of CM alignment from LN(2.4 to LN(1.3 for a query RNA of N residues and a target database of L residues, resulting in a 4-fold speedup for typical RNA queries. Combined with other improvements to Infernal, including informative mixture Dirichlet priors on model parameters, benchmarks also show increased sensitivity and specificity resulting from improved parameterization.
A versatile sensor network for urban search and rescue operations
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.
A search asymmetry reversed by figure-ground assignment.
Humphreys, G W; Müller, H
2000-05-01
We report evidence demonstrating that a search asymmetry favoring concave over convex targets can be reversed by altering the figure-ground assignment of edges in shapes. Visual search for a concave target among convex distractors is faster than search for a convex target among concave distractors (a search asymmetry). By using shapes with ambiguous local figure-ground relations, we demonstrated that search can be efficient (with search slopes around 10 ms/item) or inefficient (with search slopes around 30-40 ms/item) with the same stimuli, depending on whether edges are assigned to concave or convex "figures." This assignment process can operate in a top-down manner, according to the task set. The results suggest that attention is allocated to spatial regions following the computation of figure-ground relations in parallel across the elements present. This computation can also be modulated by top-down processes.
Identifying a "default" visual search mode with operant conditioning.
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.
Looking for trouble: a description of oculomotor search strategies during live CCTV operation.
Stainer, Matthew J; Scott-Brown, Kenneth C; Tatler, Benjamin W
2013-01-01
Recent research has begun to address how CCTV operators in the modern control room attempt to search for crime (e.g., Howard et al., 2011). However, an often-neglected element of the CCTV task is that the operators have at their disposal a multiplexed wall of scenes, and a single spot-monitor on which they can select any of these feeds for inspection. Here we examined how 2 trained CCTV operators used these sources of information to search from crime during a morning, afternoon, and night-time shift. We found that they spent surprisingly little time viewing the multiplex wall, instead preferentially spending most of their time searching on the single-scene spot-monitor. Such search must require a sophisticated understanding of the surveilled environment, as the operators must make their selection of which screen to view based on their prediction of where crime is likely to occur. This seems to be reflected in the difference in the screens that they selected to view at different times of the day. For example, night-clubs received close monitoring at night, but were seldom viewed in mid-morning. Such narrowing of search based on a contextual understanding of an environment is not a new idea (e.g., Torralba et al., 2006), and appears to contribute to operator's selection strategy. This research prompts new questions regarding the nature of representation that operators have of their environment, and how they might develop expectation-based search strategies to countermand the demands of the large influx of visual information. Future research should ensure not to neglect examination of operator behavior "in the wild" (Hutchins, 1995a), as such insights are difficult to gain from laboratory based paradigms alone.
Strategies to improve sleep during extended search and rescue operations.
Jenkins, Jennifer Lee; Fredericksen, Kim; Stone, Roger; Tang, Nelson
2007-01-01
This study investigated strategies to improve sleeping conditions during search and rescue operations during disaster response. Forty members of the Montgomery County (Maryland) Urban Search and Rescue Team were surveyed for individual sleep habits and sleeping aids used during extended deployments. Team members were also asked to suggest methods to improve sleep on future deployments. The average amount of sleep during field operations was 5.4 hours with a range of 4-8 hours. Eight percent surveyed would prefer another schedule besides the 12-hour work day, all of whom proposed three 8-hour shifts. Fifteen percent of participants were interested in a pharmacological sleeping aid. Fifty percent of search and rescue members interviewed would consider using nonpharmacological sleeping aids. Furthermore, 40% of participants stated they had successfully devised self-employed methods of sleep aids for previous deployments, such as ear plugs, massage, mental imagery, personal routines, music and headphones, reading, and blindfolds. This study suggests that availability of both pharmacological and nonpharmacological sleeping aids to search and rescue workers via the team cache could impact the quantity of sleep. Further investigation into methods of optimizing sleep during field missions could theoretically show enhanced performance through various aspects of missions including mitigation of errors, improved productivity, and improved overall physiological and emotional well-being of search and rescue personnel.
Looking for trouble: A description of oculomotor search strategies during live CCTV operation.
Directory of Open Access Journals (Sweden)
Matthew James Stainer
2013-09-01
Full Text Available Recent research has begun to address how CCTV operators in the modern control room attempt to search for crime (e.g., Howard et al., 2011. However, an often-neglected element of the CCTV task is that the operators have at their disposal a multiplexed wall of scenes, and a single spot-monitor on which they can select any of these feeds for inspection. Here we examined how 2 trained CCTV operators used these sources of information to search from crime during a morning, afternoon and night-time shift. We found that they spent surprisingly little time viewing the multiplex wall, instead preferentially spending most of their time searching on the single-scene spot-monitor. Such search must require a sophisticated understanding of the surveilled environment, as the operators must make their selection of which screen to view based on their prediction of where crime is likely to occur. This seems to be reflected in the difference in the screens that they selected to view at different times of the day. For example, night-clubs received close monitoring at night, but were seldom viewed in mid-morning. Such narrowing of search based on a contextual understanding of an environment is not a new idea (e.g., Torralba et al., 2006, and appears to contribute to operator’s selection strategy. This research prompts new questions regarding the nature of representation that operators have of their environment, and how they might develop expectation-based search strategies to countermand the demands of the large influx of visual information. Future research should ensure not to neglect examination of operator behavior ‘in the wild’ (Hutchins, 1995a, as such insights are difficult to gain from laboratory based paradigms alone.
CERN. Geneva
2016-01-01
Did you know that Python preallocates integers from -5 to 257 ? Reusing them 1000 times, instead of allocating memory for a bigger integer, can save you a couple of milliseconds of code’s execution time. If you want to learn more about this kind of optimizations then, … well, probably this presentation is not for you :) Instead of going into such small details, I will talk about more "sane" ideas for writing faster code. After a very brief overview of how to optimize Python code (rule 1: don’t do this; rule 2: don’t do this yet; rule 3: ok, but what if I really want to do this ?), I will show simple and fast ways of measuring the execution time and finally, discuss examples of how some code structures could be improved. You will see: - What is the fastest way of removing duplicates from a list - How much faster your code is when you reuse the built-in functions instead of trying to reinvent the wheel - What is faster than the good ol’ for loop - If the lookup is faster in a list or a set (and w...
LETTER TO THE EDITOR: Optimization of partial search
Korepin, Vladimir E.
2005-11-01
A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm.
Looking for trouble: a description of oculomotor search strategies during live CCTV operation
Stainer, Matthew J.; Scott-Brown, Kenneth C.; Tatler, Benjamin W.
2013-01-01
Recent research has begun to address how CCTV operators in the modern control room attempt to search for crime (e.g., Howard et al., 2011). However, an often-neglected element of the CCTV task is that the operators have at their disposal a multiplexed wall of scenes, and a single spot-monitor on which they can select any of these feeds for inspection. Here we examined how 2 trained CCTV operators used these sources of information to search from crime during a morning, afternoon, and night-tim...
Faster Black-Box Algorithms Through Higher Arity Operators
DEFF Research Database (Denmark)
Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo
2011-01-01
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of LeadingOnes drops from (n2) for unary operators to O(n log n). For OneMax, the (n...
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.
20 Recipes for Programming MVC 3 Faster, Smarter Web Development
Munro, Jamie
2011-01-01
There's no need to reinvent the wheel every time you run into a problem with ASP.NET's Model-View-Controller (MVC) framework. This concise cookbook provides recipes to help you solve tasks many web developers encounter every day. Each recipe includes the C# code you need, along with a complete working example of how to implement the solution. Learn practical techniques for applying user authentication, providing faster page reloads, validating user data, filtering search results, and many other issues related to MVC3 development. These recipes help you: Restrict access to views with password
The relationship between visual search and categorization of own- and other-age faces.
Craig, Belinda M; Lipp, Ottmar V
2018-03-13
Young adult participants are faster to detect young adult faces in crowds of infant and child faces than vice versa. These findings have been interpreted as evidence for more efficient attentional capture by own-age than other-age faces, but could alternatively reflect faster rejection of other-age than own-age distractors, consistent with the previously reported other-age categorization advantage: faster categorization of other-age than own-age faces. Participants searched for own-age faces in other-age backgrounds or vice versa. Extending the finding to different other-age groups, young adult participants were faster to detect young adult faces in both early adolescent (Experiment 1) and older adult backgrounds (Experiment 2). To investigate whether the own-age detection advantage could be explained by faster categorization and rejection of other-age background faces, participants in experiments 3 and 4 also completed an age categorization task. Relatively faster categorization of other-age faces was related to relatively faster search through other-age backgrounds on target absent trials but not target present trials. These results confirm that other-age faces are more quickly categorized and searched through and that categorization and search processes are related; however, this correlational approach could not confirm or reject the contribution of background face processing to the own-age detection advantage. © 2018 The British Psychological Society.
Medical Support for Aircraft Disaster Search and Recovery Operations at Sea: the RSN Experience.
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.
Robustness of a bisimulation-type faster-than preorder
Directory of Open Access Journals (Sweden)
Katrin Iltgen
2009-11-01
Full Text Available TACS is an extension of CCS where upper time bounds for delays can be specified. Luettgen and Vogler defined three variants of bismulation-type faster-than relations and showed that they all three lead to the same preorder, demonstrating the robustness of their approach. In the present paper, the operational semantics of TACS is extended; it is shown that two of the variants still give the same preorder as before, underlining robustness. An explanation is given why this result fails for the third variant. It is also shown that another variant, which mixes old and new operational semantics, can lead to smaller relations that prove the same preorder.
Slow light brings faster communications
International Nuclear Information System (INIS)
Gauthier, D.
2006-01-01
Two teams of researchers have managed to significantly reduce the speed of light in an optical fibre, which could open the door to all-optical routers for telecommunications, as Daniel Gauthier explains. Optical engineers around the globe are working hard to meet the ever-growing demand for higher-speed information networks, and the latest systems being developed operate at rates close to 160 GB per second - which is over 100 times quicker than the fastest broadband services currently available and a world away from the 56 kb per second dial-up connections of the early years of the Internet. Paradoxically, it seems that making light travel slower rather than faster might be the best way to meet these high-speed challenges. (U.K.)
Internet Job Search and Unemployment Durations
Kuhn, Peter; Skuterud, Mikal Skuterud
2002-01-01
After decades of stability, the technologies used by workers to locate new jobs began to change rapidly with the diffusion of internet access in the late 1990’s. Which types of persons incorporated the internet into their job search strategy, and did searching for work on line help these workers find new jobs faster? We address these questions using measures of internet job search derived from the December 1998 and August 2000 CPS Computer and Internet Supplements, matched with job search o...
An operational search and rescue model for the Norwegian Sea and the North Sea
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.
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
Directory of Open Access Journals (Sweden)
Zhenghao Xi
2014-01-01
Full Text Available 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.
Independent operation of implicit working memory under cognitive load.
Ji, Eunhee; Lee, Kyung Min; Kim, Min-Shik
2017-10-01
Implicit working memory (WM) has been known to operate non-consciously and unintentionally. The current study investigated whether implicit WM is a discrete mechanism from explicit WM in terms of cognitive resource. To induce cognitive resource competition, we used a conjunction search task (Experiment 1) and imposed spatial WM load (Experiment 2a and 2b). Each trial was composed of a set of five consecutive search displays. The location of the first four displays appeared as per pre-determined patterns, but the fifth display could follow the same pattern or not. If implicit WM can extract the moving pattern of stimuli, response times for the fifth target would be faster when it followed the pattern compared to when it did not. Our results showed implicit WM can operate when participants are searching for the conjunction target and even while maintaining spatial WM information. These results suggest that implicit WM is independent from explicit spatial WM. Copyright © 2017. Published by Elsevier Inc.
LITERATURE SEARCH FOR METHODS FOR HAZARD ANALYSES OF AIR CARRIER OPERATIONS.
Energy Technology Data Exchange (ETDEWEB)
MARTINEZ - GURIDI,G.; SAMANTA,P.
2002-07-01
Representatives of the Federal Aviation Administration (FAA) and several air carriers under Title 14 of the Code of Federal Regulations (CFR) Part 121 developed a system-engineering model of the functions of air-carrier operations. Their analyses form the foundation or basic architecture upon which other task areas are based: hazard analyses, performance measures, and risk indicator design. To carry out these other tasks, models may need to be developed using the basic architecture of the Air Carrier Operations System Model (ACOSM). Since ACOSM encompasses various areas of air-carrier operations and can be used to address different task areas with differing but interrelated objectives, the modeling needs are broad. A literature search was conducted to identify and analyze the existing models that may be applicable for pursuing the task areas in ACOSM. The intent of the literature search was not necessarily to identify a specific model that can be directly used, but rather to identify relevant ones that have similarities with the processes and activities defined within ACOSM. Such models may provide useful inputs and insights in structuring ACOSM models. ACOSM simulates processes and activities in air-carrier operation, but, in a general framework, it has similarities with other industries where attention also has been paid to hazard analyses, emphasizing risk management, and in designing risk indicators. To assure that efforts in other industries are adequately considered, the literature search includes publications from other industries, e.g., chemical, nuclear, and process industries. This report discusses the literature search, the relevant methods identified and provides a preliminary assessment of their use in developing the models needed for the ACOSM task areas. A detailed assessment of the models has not been made. Defining those applicable for ACOSM will need further analyses of both the models and tools identified. The report is organized in four chapters
Spatial partitions systematize visual search and enhance target memory.
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.
Sequence-based heuristics for faster annotation of non-coding RNA families.
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.
Playing shooter and driving videogames improves top-down guidance in visual search.
Wu, Sijing; Spence, Ian
2013-05-01
Playing action videogames is known to improve visual spatial attention and related skills. Here, we showed that playing action videogames also improves classic visual search, as well as the ability to locate targets in a dual search that mimics certain aspects of an action videogame. In Experiment 1A, first-person shooter (FPS) videogame players were faster than nonplayers in both feature search and conjunction search, and in Experiment 1B, they were faster and more accurate in a peripheral search and identification task while simultaneously performing a central search. In Experiment 2, we showed that 10 h of play could improve the performance of nonplayers on each of these tasks. Three different genres of videogames were used for training: two action games and a 3-D puzzle game. Participants who played an action game (either an FPS or a driving game) achieved greater gains on all search tasks than did those who trained using the puzzle game. Feature searches were faster after playing an action videogame, suggesting that players developed a better target template to guide search in a top-down manner. The results of the dual search suggest that, in addition to enhancing the ability to divide attention, playing an action game improves the top-down guidance of attention to possible target locations. The results have practical implications for the development of training tools to improve perceptual and cognitive skills.
International Nuclear Information System (INIS)
Sengupta, Anand S.; Dhurandhar, Sanjeev; Lazzarini, Albert
2003-01-01
The first scientific runs of kilometer scale laser interferometric detectors such as LIGO are under way. Data from these detectors will be used to look for signatures of gravitational waves from astrophysical objects such as inspiraling neutron-star-black-hole binaries using matched filtering. The computational resources required for online flat-search implementation of the matched filtering are large if searches are carried out for a small total mass. A flat search is implemented by constructing a single discrete grid of densely populated template waveforms spanning the dynamical parameters--masses, spins--which are correlated with the interferometer data. The correlations over the kinematical parameters can be maximized a priori without constructing a template bank over them. Mohanty and Dhurandhar showed that a significant reduction in computational resources can be accomplished by using a hierarchy of such template banks where candidate events triggered by a sparsely populated grid are followed up by the regular, dense flat-search grid. The estimated speedup in this method was a factor ∼25 over the flat search. In this paper we report an improved implementation of the hierarchical search, wherein we extend the domain of hierarchy to an extra dimension--namely, the time of arrival of the signal in the bandwidth of the interferometer. This is accomplished by lowering the Nyquist sampling rate of the signal in the trigger stage. We show that this leads to further improvement in the efficiency of data analysis and speeds up the online computation by a factor of ∼65-70 over the flat search. We also take into account and discuss issues related to template placement, trigger thresholds, and other peculiar problems that do not arise in earlier implementation schemes of the hierarchical search. We present simulation results for 2PN waveforms embedded in the noise expected for initial LIGO detectors
Stable statistical representations facilitate visual search.
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.
Learning to Solve Problems by Searching for Macro-Operators
1983-07-01
executing generalized robot plans. Aritificial Intelligence 3:25 1-288, 1972. [Frey 821 Frey, Alexander Ii. Jr., and David Singmaster. Handbook of Cubik...and that searching for macros may be a useful general learning paradigm. 1.1. Introduction One view of die die field of artificial intelligence is that... intelligence literature [Schofield 67, Gaschnig 79, Ericsson 761 and provides one of the simplest examples of the operation of the Macro Problem Solver. It
Fast and accurate protein substructure searching with simulated annealing and GPUs
Directory of Open Access Journals (Sweden)
Stivala Alex D
2010-09-01
Full Text Available Abstract Background Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioinformatics. While there are many existing methods for structural similarity searching, faster and more accurate approaches are still required, and few current methods are capable of substructure (motif searching. Results We developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely used existing methods. Furthermore, we created a parallel implementation on a modern graphics processing unit (GPU. Conclusions The GPU implementation achieves up to 34 times speedup over the CPU implementation of tableau-based structure search with simulated annealing, making it one of the fastest available methods. To the best of our knowledge, this is the first application of a GPU to the protein structural search problem.
Local search heuristics for the probabilistic dial-a-ride problem
DEFF Research Database (Denmark)
Ho, Sin C.; Haugland, Dag
2011-01-01
evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one...
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.
National Research Council Canada - National Science Library
Chase, Eric
2000-01-01
This thesis provides a preliminary cost and operational effectiveness analysis of alternative force structures for the United States Marine Corps operational support airlift and search and rescue missions...
PKIS: practical keyword index search on cloud datacenter
Directory of Open Access Journals (Sweden)
Park Jae Hyun
2011-01-01
Full Text Available Abstract This paper highlights the importance of the interoperability of the encrypted DB in terms of the characteristics of DB and efficient schemes. Although most prior researches have developed efficient algorithms under the provable security, they do not focus on the interoperability of the encrypted DB. In order to address this lack of practical aspects, we conduct two practical approaches--efficiency and group search in cloud datacenter. The process of this paper is as follows: first, we create two schemes of efficiency and group search--practical keyword index search--I and II; second, we define and analyze group search secrecy and keyword index search privacy in our schemes; third, we experiment on efficient performances over our proposed encrypted DB. As the result, we summarize two major results: (1our proposed schemes can support a secure group search without re-encrypting all documents under the group-key update and (2our experiments represent that our scheme is approximately 935 times faster than Golle's scheme and about 16 times faster than Song's scheme for 10,000 documents. Based on our experiments and results, this paper has the following contributions: (1 in the current cloud computing environments, our schemes provide practical, realistic, and secure solutions over the encrypted DB and (2 this paper identifies the importance of interoperability with database management system for designing efficient schemes.
Faster-than-real-time robot simulation for plan development and robot safety
International Nuclear Information System (INIS)
Crane, C.D. III; Dalton, R.; Ogles, J.; Tulenko, J.S.; Zhou, X.
1990-01-01
The University of Florida, in cooperation with the Universities of Texas, Tennessee, and Michigan and Oak Ridge National Laboratory (ORNL), is developing an advanced robotic system for the US Department of Energy under the University Program for Robotics for Advanced Reactors. As part of this program, the University of Florida has been pursuing the development of a faster-than-real-time robotic simulation program for planning and control of mobile robotic operations to ensure the efficient and safe operation of mobile robots in nuclear power plants and other hazardous environments
Directory of Open Access Journals (Sweden)
Zhihua Zhang
2016-01-01
Full Text Available 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.
Castel, Alan D; Pratt, Jay; Drummond, Emily
2005-06-01
The ability to efficiently search the visual environment is a critical function of the visual system, and recent research has shown that experience playing action video games can influence visual selective attention. The present research examined the similarities and differences between video game players (VGPs) and non-video game players (NVGPs) in terms of the ability to inhibit attention from returning to previously attended locations, and the efficiency of visual search in easy and more demanding search environments. Both groups were equally good at inhibiting the return of attention to previously cued locations, although VGPs displayed overall faster reaction times to detect targets. VGPs also showed overall faster response time for easy and difficult visual search tasks compared to NVGPs, largely attributed to faster stimulus-response mapping. The findings suggest that relative to NVGPs, VGPs rely on similar types of visual processing strategies but possess faster stimulus-response mappings in visual attention tasks.
Explicit awareness supports conditional visual search in the retrieval guidance paradigm.
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
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.
A high-speed drug interaction search system for ease of use in the clinical environment.
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.
Clinician search behaviors may be influenced by search engine design.
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
Hybrid Search for Faster Production and Safer Process Conditions in Friction Stir Welding
DEFF Research Database (Denmark)
Tutum, Cem Celal; Deb, Kalyanmoy; Hattel, Jesper Henri
2011-01-01
The objective of this paper is to investigate optimum process parameters and tool geometries in Friction Stir Welding (FSW) to minimize temperature difference between the leading edge of the tool probe and the work piece material in front of the tool shoulder, and simultaneously maximize traverse...... welding speed, which conflicts with the former objective. An evolutionary multi-objective optimization algorithm (i.e. NSGA-II), is applied to find multiple trade-off solutions followed by a gradient-based local search (i.e. SQP) to improve the convergence of the obtained Pareto-optimal front. In order...... choices have been offered based on several process specific performance and cost related criteria....
A review on quantum search algorithms
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.
[Advanced online search techniques and dedicated search engines for physicians].
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.
Directory of Open Access Journals (Sweden)
Longquan Yong
2012-01-01
Full Text Available Harmony search (HS method is an emerging metaheuristic optimization algorithm. In this paper, an improved harmony search method based on differential mutation operator (IHSDE is proposed to deal with the optimization problems. Since the population diversity plays an important role in the behavior of evolution algorithm, the aim of this paper is to calculate the expected population mean and variance of IHSDE from theoretical viewpoint. Numerical results, compared with the HSDE, NGHS, show that the IHSDE method has good convergence property over a test-suite of well-known benchmark functions.
Quantum partial search for uneven distribution of multiple target items
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.
Composite Differential Search Algorithm
Directory of Open Access Journals (Sweden)
Bo Liu
2014-01-01
Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.
Sanyal, Amal
2000-01-01
The paper models the practice of charging bribes for faster delivery of essential services in third world countries. It then examines the possibility of curbing corruption by supervision, and secondly, by introducing competition among delivery agents. It is argued that a supervisory solution eludes the problem because no hard evidence of the reduction of corruption can be established for this type of offenses. It is also shown that using more than one supplier cannot eliminate the practice, a...
The long and the short of priming in visual search
Kruijne, W.; Meeter, M.
2015-01-01
Memory affects visual search, as is particularly evident from findings that when target features are repeated from one trial to the next, selection is faster. Two views have emerged on the nature of the memory representations and mechanisms that cause these intertrial priming effects: independent
Sequence heterogeneity accelerates protein search for targets on DNA
International Nuclear Information System (INIS)
Shvets, Alexey A.; Kolomeisky, Anatoly B.
2015-01-01
The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome
Sequence heterogeneity accelerates protein search for targets on DNA
Energy Technology Data Exchange (ETDEWEB)
Shvets, Alexey A.; Kolomeisky, Anatoly B., E-mail: tolya@rice.edu [Department of Chemistry and Center for Theoretical Biological Physics, Rice University, Houston, Texas 77005 (United States)
2015-12-28
The process of protein search for specific binding sites on DNA is fundamentally important since it marks the beginning of all major biological processes. We present a theoretical investigation that probes the role of DNA sequence symmetry, heterogeneity, and chemical composition in the protein search dynamics. Using a discrete-state stochastic approach with a first-passage events analysis, which takes into account the most relevant physical-chemical processes, a full analytical description of the search dynamics is obtained. It is found that, contrary to existing views, the protein search is generally faster on DNA with more heterogeneous sequences. In addition, the search dynamics might be affected by the chemical composition near the target site. The physical origins of these phenomena are discussed. Our results suggest that biological processes might be effectively regulated by modifying chemical composition, symmetry, and heterogeneity of a genome.
The faster-X effect: integrating theory and data.
Meisel, Richard P; Connallon, Tim
2013-09-01
Population genetics theory predicts that X (or Z) chromosomes could play disproportionate roles in speciation and evolutionary divergence, and recent genome-wide analyses have identified situations in which X or Z-linked divergence exceeds that on the autosomes (the so-called 'faster-X effect'). Here, we summarize the current state of both the theory and data surrounding the study of faster-X evolution. Our survey indicates that the faster-X effect is pervasive across a taxonomically diverse array of evolutionary lineages. These patterns could be informative of the dominance or recessivity of beneficial mutations and the nature of genetic variation acted upon by natural selection. We also identify several aspects of disagreement between these empirical results and the population genetic models used to interpret them. However, there are clearly delineated aspects of the problem for which additional modeling and collection of genomic data will address these discrepancies and provide novel insights into the population genetics of adaptation. Copyright © 2013 Elsevier Ltd. All rights reserved.
Multiple Signal Classification for Gravitational Wave Burst Search
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.
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)
Search features of digital libraries
Directory of Open Access Journals (Sweden)
Alastair G. Smith
2000-01-01
Full Text Available Traditional on-line search services such as Dialog, DataStar and Lexis provide a wide range of search features (boolean and proximity operators, truncation, etc. This paper discusses the use of these features for effective searching, and argues that these features are required, regardless of advances in search engine technology. The literature on on-line searching is reviewed, identifying features that searchers find desirable for effective searching. A selective survey of current digital libraries available on the Web was undertaken, identifying which search features are present. The survey indicates that current digital libraries do not implement a wide range of search features. For instance: under half of the examples included controlled vocabulary, under half had proximity searching, only one enabled browsing of term indexes, and none of the digital libraries enable searchers to refine an initial search. Suggestions are made for enhancing the search effectiveness of digital libraries, for instance by: providing a full range of search operators, enabling browsing of search terms, enhancement of records with controlled vocabulary, enabling the refining of initial searches, etc.
DEFF Research Database (Denmark)
Hadjidemetriou, Lenos; Kyriakides, Elias; Blaabjerg, Frede
2015-01-01
Interconnected renewable energy sources (RES) require fast and accurate fault ride through (FRT) operation, in order to support the power grid, when faults occur. This paper proposes an adaptive phase-locked loop (adaptive dαβPLL) algorithm, which can be used for a faster and more accurate response...
Real-time earthquake monitoring using a search engine method.
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.
Faster than Nyquist signaling algorithms to silicon
Dasalukunte, Deepak; Rusek, Fredrik; Anderson, John B
2014-01-01
This book addresses the challenges and design trade-offs arising during the hardware design of Faster-than-Nyquist (FTN) signaling transceivers. The authors describe how to design for coexistence between the FTN system described and Orthogonal frequency-division multiplexing (OFDM) systems, enabling readers to design FTN specific processing blocks as add-ons to the conventional transceiver chain. • Provides a comprehensive introduction to Faster-than-Nyquist (FTN) signaling transceivers, covering both theory and hardware implementation; • Enables readers to design systems that achieve bandwidth efficiency by making better use of the available spectrum resources; • Describes design techniques to achieve 2x improvement in bandwidth usage with similar performance as that of an OFDM system.
PubMed vs. HighWire Press: a head-to-head comparison of two medical literature search engines.
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.
Faster-X evolution: Theory and evidence from Drosophila.
Charlesworth, Brian; Campos, José L; Jackson, Benjamin C
2018-02-12
A faster rate of adaptive evolution of X-linked genes compared with autosomal genes can be caused by the fixation of recessive or partially recessive advantageous mutations, due to the full expression of X-linked mutations in hemizygous males. Other processes, including recombination rate and mutation rate differences between X chromosomes and autosomes, may also cause faster evolution of X-linked genes. We review population genetics theory concerning the expected relative values of variability and rates of evolution of X-linked and autosomal DNA sequences. The theoretical predictions are compared with data from population genomic studies of several species of Drosophila. We conclude that there is evidence for adaptive faster-X evolution of several classes of functionally significant nucleotides. We also find evidence for potential differences in mutation rates between X-linked and autosomal genes, due to differences in mutational bias towards GC to AT mutations. Many aspects of the data are consistent with the male hemizygosity model, although not all possible confounding factors can be excluded. © 2018 John Wiley & Sons Ltd.
Exposure to arousal-inducing sounds facilitates visual search.
Asutay, Erkin; Västfjäll, Daniel
2017-09-04
Exposure to affective stimuli could enhance perception and facilitate attention via increasing alertness, vigilance, and by decreasing attentional thresholds. However, evidence on the impact of affective sounds on perception and attention is scant. Here, a novel aspect of affective facilitation of attention is studied: whether arousal induced by task-irrelevant auditory stimuli could modulate attention in a visual search. In two experiments, participants performed a visual search task with and without auditory-cues that preceded the search. Participants were faster in locating high-salient targets compared to low-salient targets. Critically, search times and search slopes decreased with increasing auditory-induced arousal while searching for low-salient targets. Taken together, these findings suggest that arousal induced by sounds can facilitate attention in a subsequent visual search. This novel finding provides support for the alerting function of the auditory system by showing an auditory-phasic alerting effect in visual attention. The results also indicate that stimulus arousal modulates the alerting effect. Attention and perception are our everyday tools to navigate our surrounding world and the current findings showing that affective sounds could influence visual attention provide evidence that we make use of affective information during perceptual processing.
International Nuclear Information System (INIS)
Wu, Xia; Wu, Genhua
2014-01-01
Highlights: • A high efficient method for optimization of atomic clusters is developed. • Its performance is studied by optimizing Lennard-Jones clusters and Ag clusters. • The method is proved to be quite efficient. • A new Ag 61 cluster with stacking-fault face-centered cubic motif is found. - Abstract: Geometrical optimization of atomic clusters is performed by a development of adaptive immune optimization algorithm (AIOA) with dynamic lattice searching (DLS) operation (AIOA-DLS method). By a cycle of construction and searching of the dynamic lattice (DL), DLS algorithm rapidly makes the clusters more regular and greatly reduces the potential energy. DLS can thus be used as an operation acting on the new individuals after mutation operation in AIOA to improve the performance of the AIOA. The AIOA-DLS method combines the merit of evolutionary algorithm and idea of dynamic lattice. The performance of the proposed method is investigated in the optimization of Lennard-Jones clusters within 250 atoms and silver clusters described by many-body Gupta potential within 150 atoms. Results reported in the literature are reproduced, and the motif of Ag 61 cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron
Aurally Aided Visual Search Performance Comparing Virtual Audio Systems
DEFF Research Database (Denmark)
Larsen, Camilla Horne; Lauritsen, David Skødt; Larsen, Jacob Junker
2014-01-01
Due to increased computational power, reproducing binaural hearing in real-time applications, through usage of head-related transfer functions (HRTFs), is now possible. This paper addresses the differences in aurally-aided visual search performance between a HRTF enhanced audio system (3D) and an...... with white dots. The results indicate that 3D audio yields faster search latencies than panning audio, especially with larger amounts of distractors. The applications of this research could fit virtual environments such as video games or virtual simulations.......Due to increased computational power, reproducing binaural hearing in real-time applications, through usage of head-related transfer functions (HRTFs), is now possible. This paper addresses the differences in aurally-aided visual search performance between a HRTF enhanced audio system (3D...
Aurally Aided Visual Search Performance Comparing Virtual Audio Systems
DEFF Research Database (Denmark)
Larsen, Camilla Horne; Lauritsen, David Skødt; Larsen, Jacob Junker
2014-01-01
Due to increased computational power reproducing binaural hearing in real-time applications, through usage of head-related transfer functions (HRTFs), is now possible. This paper addresses the differences in aurally-aided visual search performance between an HRTF enhanced audio system (3D) and an...... with white dots. The results indicate that 3D audio yields faster search latencies than panning audio, especially with larger amounts of distractors. The applications of this research could fit virtual environments such as video games or virtual simulations.......Due to increased computational power reproducing binaural hearing in real-time applications, through usage of head-related transfer functions (HRTFs), is now possible. This paper addresses the differences in aurally-aided visual search performance between an HRTF enhanced audio system (3D...
Baber, C; Stanton, N A; Atkinson, J; McMaster, R; Houghton, R J
2013-01-01
The concept of common operational pictures (COPs) is explored through the application of social network analysis (SNA) and agent-based modelling to a generic search and rescue (SAR) scenario. Comparing the command structure that might arise from standard operating procedures with the sort of structure that might arise from examining information-in-common, using SNA, shows how one structure could be more amenable to 'command' with the other being more amenable to 'control' - which is potentially more suited to complex multi-agency operations. An agent-based model is developed to examine the impact of information sharing with different forms of COPs. It is shown that networks using common relevant operational pictures (which provide subsets of relevant information to groups of agents based on shared function) could result in better sharing of information and a more resilient structure than networks that use a COP. SNA and agent-based modelling are used to compare different forms of COPs for maritime SAR operations. Different forms of COP change the communications structures in the socio-technical systems in which they operate, which has implications for future design and development of a COP.
Energy Technology Data Exchange (ETDEWEB)
Kostryukov, M I; Tsarenko, P T
1981-01-01
Presented are the methodological characteristics of the use of materials from remote probes in oil and gas search operations within the central part of the western Siberian plain. Examined briefly are ways to increase the effectiveness of interpreting deep structures and the necessity for an amplification in the development of automated systems for interpretation is show.
Faster Increases in Human Life Expectancy Could Lead to Slower Population Aging
2015-01-01
Counterintuitively, faster increases in human life expectancy could lead to slower population aging. The conventional view that faster increases in human life expectancy would lead to faster population aging is based on the assumption that people become old at a fixed chronological age. A preferable alternative is to base measures of aging on people’s time left to death, because this is more closely related to the characteristics that are associated with old age. Using this alternative interpretation, we show that faster increases in life expectancy would lead to slower population aging. Among other things, this finding affects the assessment of the speed at which countries will age. PMID:25876033
Open Search Environments: The Free Alternative to Commercial Search Services
Directory of Open Access Journals (Sweden)
Adrian O'Riordan
2014-06-01
Full Text Available Open search systems present a free and less restricted alternative to commercial search services. This paper explores the space of open search technology looking in particular at the issue of interoperability. A description of current protocols and formats for engineering open search applications is presented. The suitability of these technologies and issues around their adoption and operation are discussed. This open search approach is especially proving a fitting choice in applications involving the harvesting of resources and information integration. Principal among the technological solutions are OpenSearch and SRU. OpenSearch and SRU implement a federated model to enable existing and new search engines and search clients communicate. Applications and instances where Opensearch and SRU can be combined are presented. Other relevant technologies such as OpenURL, Apache Solr, and OAI-PMH are also discussed. The deployment of these freely licensed open standards in digital library applications is now a genuine alternative to commercial or proprietary systems.
DEFF Research Database (Denmark)
Hadjidemetriou, Lenos; Kyriakides, Elias; Blaabjerg, Frede
2013-01-01
Interconnected renewable energy sources require fast and accurate fault ride through operation in order to support the power grid when faults occur. This paper proposes an adaptive Phase-Locked Loop (adaptive dαβPLL) algorithm, which can be used for a faster and more accurate response of the grid...... side converter control of a renewable energy source, especially under fault ride through operation. The adaptive dαβPLL is based on modifying the control parameters of the dαβPLL according to the type and voltage characteristic of the grid fault with the purpose of accelerating the performance...
Spencer, Stephan
2011-01-01
Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit
Detection of Emotional Faces: Salient Physical Features Guide Effective Visual Search
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,…
Characteristic sounds facilitate visual search.
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.
Adrenaline in cardiac arrest: Prefilled syringes are faster.
Helm, Claire; Gillett, Mark
2015-08-01
Standard ampoules and prefilled syringes of adrenaline are widely available in Australasian EDs for use in cardiac arrest. We hypothesise that prefilled syringes can be administered more rapidly and accurately when compared with the two available standard ampoules. This is a triple arm superiority study comparing the time to i.v. administration and accuracy of dosing of three currently available preparations of adrenaline. In their standard packaging, prefilled syringes were on average more than 12 s faster to administer than the 1 mL 1:1000 ampoules and more than 16 s faster than the 10 mL 1:10,000 ampoules (P adrenaline utilising a Minijet (CSL Limited, Parkville, Victoria, Australia) is faster than using adrenaline in glass ampoules presented in their plastic packaging. Removing the plastic packaging from the 1 mL (1 mg) ampoule might result in more rapid administration similar to the Minijet. Resuscitation personnel requiring rapid access to adrenaline should consider storing it as either Minijets or ampoules devoid of packaging. These results might be extrapolatable to other clinical scenarios, including pre-hospital and anaesthesia, where other drugs are required for rapid use. © 2015 Australasian College for Emergency Medicine and Australasian Society for Emergency Medicine.
Caroline Duc
2013-01-01
The MR-ToF-MS, a new ion trap, has been integrated into ISOLTRAP, the experiment that performs accurate mass measurements on short-lived nuclides produced at ISOLDE. When used as a mass separator and spectrometer, it extends ISOLTRAP’s experimental reach towards the limits of nuclear stability. Susanne Kreim, the ISOLTRAP local group leader at CERN in front of a part of the ISOLTRAP device. When mass measurement experiments like ISOLTRAP* are placed in an on-line radioactive ion-beam facility they face a major challenge: the efficient and fast transfer of the nuclide of interest to the location where the mass measurement is performed. The biggest yield of one selected nuclide, without contaminants, needs to be transferred to the set-up as quickly as possible in order to measure its mass with the greatest precision. Recently, the ISOLTRAP collaboration installed a new device that provides a faster separation of isobars.** It has significantly improved ISOLTRAP’s purificat...
Search techniques in intelligent classification systems
Savchenko, Andrey V
2016-01-01
A unified methodology for categorizing various complex objects is presented in this book. Through probability theory, novel asymptotically minimax criteria suitable for practical applications in imaging and data analysis are examined including the special cases such as the Jensen-Shannon divergence and the probabilistic neural network. An optimal approximate nearest neighbor search algorithm, which allows faster classification of databases is featured. Rough set theory, sequential analysis and granular computing are used to improve performance of the hierarchical classifiers. Practical examples in face identification (including deep neural networks), isolated commands recognition in voice control system and classification of visemes captured by the Kinect depth camera are included. This approach creates fast and accurate search procedures by using exact probability densities of applied dissimilarity measures. This book can be used as a guide for independent study and as supplementary material for a technicall...
The effect of query complexity on Web searching results
Directory of Open Access Journals (Sweden)
B.J. Jansen
2000-01-01
Full Text Available This paper presents findings from a study of the effects of query structure on retrieval by Web search services. Fifteen queries were selected from the transaction log of a major Web search service in simple query form with no advanced operators (e.g., Boolean operators, phrase operators, etc. and submitted to 5 major search engines - Alta Vista, Excite, FAST Search, Infoseek, and Northern Light. The results from these queries became the baseline data. The original 15 queries were then modified using the various search operators supported by each of the 5 search engines for a total of 210 queries. Each of these 210 queries was also submitted to the applicable search service. The results obtained were then compared to the baseline results. A total of 2,768 search results were returned by the set of all queries. In general, increasing the complexity of the queries had little effect on the results with a greater than 70% overlap in results, on average. Implications for the design of Web search services and directions for future research are discussed.
A fuzzy-match search engine for physician directories.
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.
Faster and timing-attack resistant AES-GCM
Käsper, E.; Schwabe, P.; Clavier, C.; Gaj, K.
2009-01-01
We present a bitsliced implementation of AES encryption in counter mode for 64-bit Intel processors. Running at 7.59 cycles/byte on a Core 2, it is up to 25% faster than previous implementations, while simultaneously offering protection against timing attacks. In particular, it is the only
Search Engine For Ebook Portal
Directory of Open Access Journals (Sweden)
Prashant Kanade
2017-05-01
Full Text Available The purpose of this paper is to establish the textual analytics involved in developing a search engine for an ebook portal. We have extracted our dataset from Project Gutenberg using a robot harvester. Textual Analytics is used for efficient search retrieval. The entire dataset is represented using Vector Space Model where each document is a vector in the vector space. Further for computational purposes we represent our dataset in the form of a Term Frequency- Inverse Document Frequency tf-idf matrix. The first step involves obtaining the most coherent sequence of words of the search query entered. The entered query is processed using Front End algorithms this includes-Spell Checker Text Segmentation and Language Modeling. Back End processing includes Similarity Modeling Clustering Indexing and Retrieval. The relationship between documents and words is established using cosine similarity measured between the documents and words in Vector Space. Clustering performed is used to suggest books that are similar to the search query entered by the user. Lastly the Lucene Based Elasticsearch engine is used for indexing on the documents. This allows faster retrieval of data. Elasticsearch returns a dictionary and creates a tf-idf matrix. The processed query is compared with the dictionary obtained and tf-idf matrix is used to calculate the score for each match to give most relevant result.
Directory of Open Access Journals (Sweden)
Muhammad Sulaiman
2018-01-01
Full Text Available This paper presents the solution of directional overcurrent relay (DOCR problems using Simulated Annealing based Symbiotic Organism Search (SASOS. The objective function of the problem is to minimize the sum of the operating times of all primary relays. The DOCR problem is nonlinear and highly constrained with two types of decision variables, namely, the time dial settings (TDS and plug setting (PS. In this paper, three models of the problem are considered, the IEEE 3-bus, 4-bus, and 6-bus, respectively. We have applied SASOS to solve the problem and the obtained results are compared with other algorithms available in the literature.
Faster than light, slower than time
International Nuclear Information System (INIS)
Rucker, R.
1981-01-01
The problem with faster-than-light travel is that, in the framework of Special Relativity, it is logically equivalent to time-travel. The problem with time-travel is that it leads to two types of paradoxes. The paradoxes, and the various means of skirting them, are all discussed here. Virtually all the examples are drawn from science-fiction novels, which are a large and neglected source of thought-experiments. (Auth.)
ZKBoo: Faster Zero-Knowledge for Boolean Circuits
DEFF Research Database (Denmark)
Giacomelli, Irene; Madsen, Jesper; Orlandi, Claudio
2016-01-01
variants of IKOS, which highlights their pros and cons for practically rele- vant soundness parameters; ◦ A generalization and simplification of their approach, which leads to faster Σ-protocols (that can be made non-interactive using the Fiat-Shamir heuristic) for state- ments of the form “I know x...
Faster and Energy-Efficient Signed Multipliers
Directory of Open Access Journals (Sweden)
B. Ramkumar
2013-01-01
Full Text Available We demonstrate faster and energy-efficient column compression multiplication with very small area overheads by using a combination of two techniques: partition of the partial products into two parts for independent parallel column compression and acceleration of the final addition using new hybrid adder structures proposed here. Based on the proposed techniques, 8-b, 16-b, 32-b, and 64-b Wallace (W, Dadda (D, and HPM (H reduction tree based Baugh-Wooley multipliers are developed and compared with the regular W, D, H based Baugh-Wooley multipliers. The performances of the proposed multipliers are analyzed by evaluating the delay, area, and power, with 65 nm process technologies on interconnect and layout using industry standard design and layout tools. The result analysis shows that the 64-bit proposed multipliers are as much as 29%, 27%, and 21% faster than the regular W, D, H based Baugh-Wooley multipliers, respectively, with a maximum of only 2.4% power overhead. Also, the power-delay products (energy consumption of the proposed 16-b, 32-b, and 64-b multipliers are significantly lower than those of the regular Baugh-Wooley multiplier. Applicability of the proposed techniques to the Booth-Encoded multipliers is also discussed.
Cortex Matures Faster in Youths With Highest IQ
... NIH Cortex Matures Faster in Youths With Highest IQ Past Issues / Summer 2006 Table of Contents For ... on. Photo: Getty image (StockDisc) Youths with superior IQ are distinguished by how fast the thinking part ...
Protein structural similarity search by Ramachandran codes
Directory of Open Access Journals (Sweden)
Chang Chih-Hung
2007-08-01
Full Text Available Abstract 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.
Rancang Bangun Document Management System Untuk Mengelola Dokumen Standart Operational Procedure
Directory of Open Access Journals (Sweden)
I Putu Susila Handika
2017-09-01
Standard Operational Procedure (SOP is one important document in a company because it is useful to improve the quality of the company. PT. Global Retailindo Pratama is one of the companies engaged in retail that using standard of quality management ISO 9001: 2008. Currently the management of SOP documents at PT. Global Retailindo Pratama still use manual way. Manual way cause some problems such as the search process and document distribution process takes quite a long time. This research aims to design and build Document Management System to manage SOP documents. The system development model used in this research is prototyping model. This application is built in web-based with PHP as programming language. Testing the application using Blak Box Testing and Usability Testing shows that the Document Management System can run in accordance with the needs and can be used easily so that the process of document management SOP becomes faster. Keywords: Document Management System, Standart Operational Procedure, Information System, PHP.
Fast Physics Testbed for the FASTER Project
Energy Technology Data Exchange (ETDEWEB)
Lin, W.; Liu, Y.; Hogan, R.; Neggers, R.; Jensen, M.; Fridlind, A.; Lin, Y.; Wolf, A.
2010-03-15
This poster describes the Fast Physics Testbed for the new FAst-physics System Testbed and Research (FASTER) project. The overall objective is to provide a convenient and comprehensive platform for fast turn-around model evaluation against ARM observations and to facilitate development of parameterizations for cloud-related fast processes represented in global climate models. The testbed features three major components: a single column model (SCM) testbed, an NWP-Testbed, and high-resolution modeling (HRM). The web-based SCM-Testbed features multiple SCMs from major climate modeling centers and aims to maximize the potential of SCM approach to enhance and accelerate the evaluation and improvement of fast physics parameterizations through continuous evaluation of existing and evolving models against historical as well as new/improved ARM and other complementary measurements. The NWP-Testbed aims to capitalize on the large pool of operational numerical weather prediction products. Continuous evaluations of NWP forecasts against observations at ARM sites are carried out to systematically identify the biases and skills of physical parameterizations under all weather conditions. The highresolution modeling (HRM) activities aim to simulate the fast processes at high resolution to aid in the understanding of the fast processes and their parameterizations. A four-tier HRM framework is established to augment the SCM- and NWP-Testbeds towards eventual improvement of the parameterizations.
Accelerated Profile HMM Searches.
Directory of Open Access Journals (Sweden)
Sean R Eddy
2011-10-01
Full Text Available 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.
Pigeons home faster through polluted air
Zhongqiu Li; Franck Courchamp; Daniel T. Blumstein
2016-01-01
Air pollution, especially haze pollution, is creating health issues for both humans and other animals. However, remarkably little is known about how animals behaviourally respond to air pollution. We used multiple linear regression to analyse 415 pigeon races in the North China Plain, an area with considerable air pollution, and found that while the proportion of pigeons successfully homed was not influenced by air pollution, pigeons homed faster when the air was especially polluted. Our resu...
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.
Wahn, Basil; Schwandt, Jessika; Krüger, Matti; Crafa, Daina; Nunnendorf, Vanessa; König, Peter
2016-06-01
In joint tasks, adjusting to the actions of others is critical for success. For joint visual search tasks, research has shown that when search partners visually receive information about each other's gaze, they use this information to adjust to each other's actions, resulting in faster search performance. The present study used a visual, a tactile and an auditory display, respectively, to provide search partners with information about each other's gaze. Results showed that search partners performed faster when the gaze information was received via a tactile or auditory display in comparison to receiving it via a visual display or receiving no gaze information. Findings demonstrate the effectiveness of tactile and auditory displays for receiving task-relevant information in joint tasks and are applicable to circumstances in which little or no visual information is available or the visual modality is already taxed with a demanding task such as air-traffic control. Practitioner Summary: The present study demonstrates that tactile and auditory displays are effective for receiving information about actions of others in joint tasks. Findings are either applicable to circumstances in which little or no visual information is available or when the visual modality is already taxed with a demanding task.
Thompson, Kate
2015-01-01
A book about programming, improving skill, and avoiding mistakes. The author spent two years researching every bug avoidance technique she could find. This book contains the best of them. If you want to program faster, with fewer bugs, and write more secure code, buy this book! "This is the best book I have ever read." - Anonymous reviewer "Four score and seven years ago this book helped me debug my server code." -Abraham Lincoln "Would my Javascript have memory leaks without this book? Would fishes fly without water?" -Socrates "This book is the greatest victory since the Spanish Armada, and the best about programming." -Queen Elizabeth
Size matters: bigger is faster.
Sereno, Sara C; O'Donnell, Patrick J; Sereno, Margaret E
2009-06-01
A largely unexplored aspect of lexical access in visual word recognition is "semantic size"--namely, the real-world size of an object to which a word refers. A total of 42 participants performed a lexical decision task on concrete nouns denoting either big or small objects (e.g., bookcase or teaspoon). Items were matched pairwise on relevant lexical dimensions. Participants' reaction times were reliably faster to semantically "big" versus "small" words. The results are discussed in terms of possible mechanisms, including more active representations for "big" words, due to the ecological importance attributed to large objects in the environment and the relative speed of neural responses to large objects.
GIGGLE: a search engine for large-scale integrated genome analysis.
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.
Directory of Open Access Journals (Sweden)
Alireza Isfandiyari Moghadam
2010-03-01
Full Text Available The present investigation concerns evaluation, comparison and analysis of search options existing within web-based meta-search engines. 64 meta-search engines were identified. 19 meta-search engines that were free, accessible and compatible with the objectives of the present study were selected. An author’s constructed check list was used for data collection. Findings indicated that all meta-search engines studied used the AND operator, phrase search, number of results displayed setting, previous search query storage and help tutorials. Nevertheless, none of them demonstrated any search options for hypertext searching and displaying the size of the pages searched. 94.7% support features such as truncation, keywords in title and URL search and text summary display. The checklist used in the study could serve as a model for investigating search options in search engines, digital libraries and other internet search tools.
Pedestrian crowd dynamics in merging sections: Revisiting the ;faster-is-slower; phenomenon
Shahhoseini, Zahra; Sarvi, Majid; Saberi, Meead
2018-02-01
The study of the discharge of active or self-driven matter in narrow passages has become of the growing interest in a variety of fields. The question has particularly important practical applications for the safety of pedestrian human flows notably in emergency scenarios. It has been suggested predominantly through simulation in some theoretical studies as well as through few experimentations that under certain circumstances, an elevated vigour to escape may exacerbate the outflow and cause further delay although the experimental evidence is rather mixed. The dimensions of this complex phenomenon known as the "faster-is slower" effect are of crucial importance to be understood owing to its potential practical implications for the emergency management. The contextual requirements of observing this phenomenon are yet to be identified. It is not clear whether a "do not speed up" policy is universally beneficial and advisable in an evacuation scenario. Here for the first time we experimentally examine this phenomenon in relation to the pedestrian flows at merging sections as a common geometric feature of crowd egress. Various merging angles and three different speed regimes were examined in high-density laboratory experiments. The measurements of flow interruptions and egress efficiency all indicated that the pedestrians were discharged faster when moving at elevated speed levels. We also observed clear dependencies between the discharge rate and the physical layout of the merging with certain designs clearly outperforming others. But regardless of the design, we observed faster throughput and greater avalanche sizes when we instructed pedestrians to run. Our results give the suggestion that observation of the faster-is-slower effect may necessitate certain critical conditions including passages being overly narrow relative to the size of participles (pedestrians) to create long-lasting blockages. The faster-is-slower assumption may not be universal and there may be
Dermatological image search engines on the Internet: do they work?
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.
International Nuclear Information System (INIS)
Pang, X.; Rybarcyk, L.J.
2014-01-01
Particle swarm optimization (PSO) and genetic algorithm (GA) are both nature-inspired population based optimization methods. Compared to GA, whose long history can trace back to 1975, PSO is a relatively new heuristic search method first proposed in 1995. Due to its fast convergence rate in single objective optimization domain, the PSO method has been extended to optimize multi-objective problems. In this paper, we will introduce the PSO method and its multi-objective extension, the MOPSO, apply it along with the MOGA (mainly the NSGA-II) to simulations of the LANSCE linac and operational set point optimizations. Our tests show that both methods can provide very similar Pareto fronts but the MOPSO converges faster
Energy Technology Data Exchange (ETDEWEB)
Pang, X., E-mail: xpang@lanl.gov; Rybarcyk, L.J.
2014-03-21
Particle swarm optimization (PSO) and genetic algorithm (GA) are both nature-inspired population based optimization methods. Compared to GA, whose long history can trace back to 1975, PSO is a relatively new heuristic search method first proposed in 1995. Due to its fast convergence rate in single objective optimization domain, the PSO method has been extended to optimize multi-objective problems. In this paper, we will introduce the PSO method and its multi-objective extension, the MOPSO, apply it along with the MOGA (mainly the NSGA-II) to simulations of the LANSCE linac and operational set point optimizations. Our tests show that both methods can provide very similar Pareto fronts but the MOPSO converges faster.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
Breaking the Myth That Relay Swimming Is Faster Than Individual Swimming.
Skorski, Sabrina; Etxebarria, Naroa; Thompson, Kevin G
2016-04-01
To investigate if swimming performance is better in a relay race than in the corresponding individual race. The authors analyzed 166 elite male swimmers from 15 nations in the same competition (downloaded from www.swimrankings.net). Of 778 observed races, 144 were Olympic Games performances (2000, 2004, 2012), with the remaining 634 performed in national or international competitions. The races were 100-m (n = 436) and 200-m (n = 342) freestyle events. Relay performance times for the 2nd-4th swimmers were adjusted (+ 0.73 s) to allow for the "flying start." Without any adjustment, mean individual relay performances were significantly faster for the first 50 m and overall time in the 100-m events. Furthermore, the first 100 m of the 200-m relay was significantly faster (P > .001). During relays, swimmers competing in 1st position did not show any difference compared with their corresponding individual performance (P > .16). However, swimmers competing in 2nd-4th relay-team positions demonstrated significantly faster times in the 100-m (P individual events (P team positions were adjusted for the flying start no differences were detected between relay and individual race performance for any event or split time (P > .17). Highly trained swimmers do not swim (or turn) faster in relay events than in their individual races. Relay exchange times account for the difference observed in individual vs relay performance.
GIGGLE: a search engine for large-scale integrated genome analysis
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
Energy Technology Data Exchange (ETDEWEB)
Flueck, Alex [Illinois Inst. of Technology, Chicago, IL (United States)
2017-07-14
The “High Fidelity, Faster than RealTime Simulator for Predicting Power System Dynamic Behavior” was designed and developed by Illinois Institute of Technology with critical contributions from Electrocon International, Argonne National Laboratory, Alstom Grid and McCoy Energy. Also essential to the project were our two utility partners: Commonwealth Edison and AltaLink. The project was a success due to several major breakthroughs in the area of largescale power system dynamics simulation, including (1) a validated faster than real time simulation of both stable and unstable transient dynamics in a largescale positive sequence transmission grid model, (2) a threephase unbalanced simulation platform for modeling new grid devices, such as independently controlled singlephase static var compensators (SVCs), (3) the world’s first high fidelity threephase unbalanced dynamics and protection simulator based on Electrocon’s CAPE program, and (4) a firstofits kind implementation of a singlephase induction motor model with stall capability. The simulator results will aid power grid operators in their true time of need, when there is a significant risk of cascading outages. The simulator will accelerate performance and enhance accuracy of dynamics simulations, enabling operators to maintain reliability and steer clear of blackouts. In the longterm, the simulator will form the backbone of the newly conceived hybrid realtime protection and control architecture that will coordinate local controls, widearea measurements, widearea controls and advanced realtime prediction capabilities. The nation’s citizens will benefit in several ways, including (1) less down time from power outages due to the fasterthanrealtime simulator’s predictive capability, (2) higher levels of reliability due to the detailed dynamics plus protection simulation capability, and (3) more resiliency due to the three phase unbalanced simulator’s ability to
Better Faster Noise with the GPU
DEFF Research Database (Denmark)
Wyvill, Geoff; Frisvad, Jeppe Revall
Filtered noise [Perlin 1985] has, for twenty years, been a fundamental tool for creating functional texture and it has many other applications; for example, animating water waves or the motion of grass waving in the wind. Perlin noise suffers from a number of defects and there have been many atte...... attempts to create better or faster noise but Perlin’s ‘Gradient Noise’ has consistently proved to be the best compromise between speed and quality. Our objective was to create a better noise cheaply by use of the GPU....
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.
Searching for the right word: Hybrid visual and memory search for words.
Boettcher, Sage E P; Wolfe, Jeremy M
2015-05-01
In "hybrid search" (Wolfe Psychological Science, 23(7), 698-703, 2012), observers search through visual space for any of multiple targets held in memory. With photorealistic objects as the stimuli, response times (RTs) increase linearly with the visual set size and logarithmically with the memory set size, even when over 100 items are committed to memory. It is well-established that pictures of objects are particularly easy to memorize (Brady, Konkle, Alvarez, & Oliva Proceedings of the National Academy of Sciences, 105, 14325-14329, 2008). Would hybrid-search performance be similar if the targets were words or phrases, in which word order can be important, so that the processes of memorization might be different? In Experiment 1, observers memorized 2, 4, 8, or 16 words in four different blocks. After passing a memory test, confirming their memorization of the list, the observers searched for these words in visual displays containing two to 16 words. Replicating Wolfe (Psychological Science, 23(7), 698-703, 2012), the RTs increased linearly with the visual set size and logarithmically with the length of the word list. The word lists of Experiment 1 were random. In Experiment 2, words were drawn from phrases that observers reported knowing by heart (e.g., "London Bridge is falling down"). Observers were asked to provide four phrases, ranging in length from two words to no less than 20 words (range 21-86). All words longer than two characters from the phrase, constituted the target list. Distractor words were matched for length and frequency. Even with these strongly ordered lists, the results again replicated the curvilinear function of memory set size seen in hybrid search. One might expect to find serial position effects, perhaps reducing the RTs for the first (primacy) and/or the last (recency) members of a list (Atkinson & Shiffrin, 1968; Murdock Journal of Experimental Psychology, 64, 482-488, 1962). Surprisingly, we showed no reliable effects of word order
Quantum mechanics and faster-than-light communication: methodological considerations
International Nuclear Information System (INIS)
Ghirardi, G.C.; Weber, T.
1983-06-01
A detailed quantum mechanical analysis of a recent proposal of faster than light communication through wave packet reduction is performed. The discussion allows us to focus on some methodological problems about critical investigations in physical theories. (author)
Uddin, Misbah; Skinner, Amy; Stadler, Rolf; Clemm, Alexander
2013-01-01
We developed a novel approach for management of networks/networked systems based on network search [4]. Network search provides a simple, uniform interface, through which human administrators and management applications can obtain network information, configuration or operational, without knowing its schema and location. We believe that the capability of network search will spur the development of new tools for human administrators and enable the rapid development of new classes of network co...
QERx- A Faster than Real-Time Emulator for Space Processors
Carvalho, B.; Pidgeon, A.; Robinson, P.
2012-08-01
Developing software for space systems is challenging. Especially because, in order to be sure it can cope with the harshness of the environment and the imperative requirements and constrains imposed by the platform were it will run, it needs to be tested exhaustively. Software Validation Facilities (SVF) are known to the industry and developers, and provide the means to run the On-Board Software (OBSW) in a realistic environment, allowing the development team to debug and test the software.But the challenge is to be able to keep up with the performance of the new processors (LEON2 and LEON3), which need to be emulated within the SVF. Such processor emulators are also used in Operational Simulators, used to support mission preparation and train mission operators. These simulators mimic the satellite and its behaviour, as realistically as possible. For test/operational efficiency reasons and because they will need to interact with external systems, both these uses cases require the processor emulators to provide real-time, or faster, performance.It is known to the industry that the performance of previously available emulators is not enough to cope with the performance of the new processors available in the market. SciSys approached this problem with dynamic translation technology trying to keep costs down by avoiding a hardware solution and keeping the integration flexibility of full software emulation.SciSys presented “QERx: A High Performance Emulator for Software Validation and Simulations” [1], in a previous DASIA event. Since then that idea has evolved and QERx has been successfully validated. SciSys is now presenting QERx as a product that can be tailored to fit different emulation needs. This paper will present QERx latest developments and current status.
Efficient privacy-preserving string search and an application in genomics.
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.
Electroencephalography epilepsy classifications using hybrid cuckoo search and neural network
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 %.
Introducing difference recurrence relations for faster semi-global alignment of long sequences.
Suzuki, Hajime; Kasahara, Masahiro
2018-02-19
The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba .
Online games: a novel approach to explore how partial information influences human random searches
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.
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.
Collective search by ants in microgravity
Directory of Open Access Journals (Sweden)
Stefanie M. Countryman
2015-03-01
Full Text Available The problem of collective search is a tradeoff between searching thoroughly and covering as much area as possible. This tradeoff depends on the density of searchers. Solutions to the problem of collective search are currently of much interest in robotics and in the study of distributed algorithms, for example to design ways that without central control robots can use local information to perform search and rescue operations. Ant colonies operate without central control. Because they can perceive only local, mostly chemical and tactile cues, they must search collectively to find resources and to monitor the colony's environment. Examining how ants in diverse environments solve the problem of collective search can elucidate how evolution has led to diverse forms of collective behavior. An experiment on the International Space Station in January 2014 examined how ants (Tetramorium caespitum perform collective search in microgravity. In the ISS experiment, the ants explored a small arena in which a barrier was lowered to increase the area and thus lower ant density. In microgravity, relative to ground controls, ants explored the area less thoroughly and took more convoluted paths. It appears that the difficulty of holding on to the surface interfered with the ants’ ability to search collectively. Ants frequently lost contact with the surface, but showed a remarkable ability to regain contact with the surface.
Adding a Visualization Feature to Web Search Engines: It’s Time
Energy Technology Data Exchange (ETDEWEB)
Wong, Pak C.
2008-11-11
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 help 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.
New analytical approaches for faster or greener phytochemical analyses
Shen, Y.
2015-01-01
Summary
Chapter 1 provides a short introduction into the constraints of phytochemical analysis. In order to make them faster, less laborious and greener, there is a clear scope for miniaturized and simplified sample preparation, solvent-free extractions
Increasing the Capital Income Tax Leads to Faster Growth
Uhlig, H.F.H.V.S.; Yanagawa, N.
1994-01-01
This paper shows that under rather mild conditions, higher capital income taxes lead to faster growth in an overlapping generations economy with endogenous growth. Government expenditures are financed with labor income taxes as well as capital income taxes. Since capital income accrues to the old,
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.
Searching PubMed during a pandemic.
Directory of Open Access Journals (Sweden)
Ole Norgaard
Full Text Available BACKGROUND: The 2009 influenza A(H1N1 pandemic has generated thousands of articles and news items. However, finding relevant scientific articles in such rapidly developing health crises is a major challenge which, in turn, can affect decision-makers' ability to utilise up-to-date findings and ultimately shape public health interventions. This study set out to show the impact that the inconsistent naming of the pandemic can have on retrieving relevant scientific articles in PubMed/MEDLINE. METHODOLOGY: We first formulated a PubMed search algorithm covering different names of the influenza pandemic and simulated the results that it would have retrieved from weekly searches for relevant new records during the first 10 weeks of the pandemic. To assess the impact of failing to include every term in this search, we then conducted the same searches but omitted in turn "h1n1," "swine," "influenza" and "flu" from the search string, and compared the results to those for the full string. PRINCIPAL FINDINGS: On average, our core search string identified 44.3 potentially relevant new records at the end of each week. Of these, we determined that an average of 27.8 records were relevant. When we excluded one term from the string, the percentage of records missed out of the total number of relevant records averaged 18.7% for omitting "h1n1," 13.6% for "swine," 17.5% for "influenza," and 20.6% for "flu." CONCLUSIONS: Due to inconsistent naming, while searching for scientific material about rapidly evolving situations such as the influenza A(H1N1 pandemic, there is a risk that one will miss relevant articles. To address this problem, the international scientific community should agree on nomenclature and the specific name to be used earlier, and the National Library of Medicine in the US could index potentially relevant materials faster and allow publishers to add alert tags to such materials.
GRAPES: a software for parallel searching on biological graphs targeting multi-core architectures.
Directory of Open Access Journals (Sweden)
Rosalba Giugno
Full Text Available Biological applications, from genomics to ecology, deal with graphs that represents the structure of interactions. Analyzing such data requires searching for subgraphs in collections of graphs. This task is computationally expensive. Even though multicore architectures, from commodity computers to more advanced symmetric multiprocessing (SMP, offer scalable computing power, currently published software implementations for indexing and graph matching are fundamentally sequential. As a consequence, such software implementations (i do not fully exploit available parallel computing power and (ii they do not scale with respect to the size of graphs in the database. We present GRAPES, software for parallel searching on databases of large biological graphs. GRAPES implements a parallel version of well-established graph searching algorithms, and introduces new strategies which naturally lead to a faster parallel searching system especially for large graphs. GRAPES decomposes graphs into subcomponents that can be efficiently searched in parallel. We show the performance of GRAPES on representative biological datasets containing antiviral chemical compounds, DNA, RNA, proteins, protein contact maps and protein interactions networks.
How to improve your PubMed/MEDLINE searches: 3. advanced searching, MeSH and My NCBI.
Fatehi, Farhad; Gray, Leonard C; Wootton, Richard
2014-03-01
Although the basic PubMed search is often helpful, the results may sometimes be non-specific. For more control over the search process you can use the Advanced Search Builder interface. This allows a targeted search in specific fields, with the convenience of being able to select the intended search field from a list. It also provides a history of your previous searches. The search history is useful to develop a complex search query by combining several previous searches using Boolean operators. For indexing the articles in MEDLINE, the NLM uses a controlled vocabulary system called MeSH. This standardised vocabulary solves the problem of authors, researchers and librarians who may use different terms for the same concept. To be efficient in a PubMed search, you should start by identifying the most appropriate MeSH terms and use them in your search where possible. My NCBI is a personal workspace facility available through PubMed and makes it possible to customise the PubMed interface. It provides various capabilities that can enhance your search performance.
Schlagbauer, B.; Mink, M.; Muller, Hermann J.; Geyer, T.
2017-01-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 tri...
Finger Search in the Implicit Model
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob
2012-01-01
We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no information is stored between operations, except the array of elements. We show that for any implicit dictionary supporting finger searches in q(t) = Ω(logt) time, the time to move...... the finger to another element is Ω(q− 1(logn)), where t is the rank distance between the query element and the finger. We present an optimal implicit static structure matching this lower bound. We furthermore present a near optimal implicit dynamic structure supporting search, change-finger, insert......, and delete in times $\\mathcal{O}(q(t))$, $\\mathcal{O}(q^{-1}(\\log n)\\log n)$, $\\mathcal{O}(\\log n)$, and $\\mathcal{O}(\\log n)$, respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element...
Withholding response to self-face is faster than to other-face.
Zhu, Min; Hu, Yinying; Tang, Xiaochen; Luo, Junlong; Gao, Xiangping
2015-01-01
Self-face advantage refers to adults' response to self-face is faster than that to other-face. A stop-signal task was used to explore how self-face advantage interacted with response inhibition. The results showed that reaction times of self-face were faster than that of other-face not in the go task but in the stop response trials. The novelty of the finding was that self-face has shorter stop-signal reaction time compared to other-face in the successful inhibition trials. These results indicated the processing mechanism of self-face may be characterized by a strong response tendency and a corresponding strong inhibition control.
Dedicated workspaces: Faster resumption times and reduced cognitive load in sequential multitasking
DEFF Research Database (Denmark)
Jeuris, Steven; Bardram, Jakob Eyvind
2016-01-01
Studies show that virtual desktops have become a widespread approach to window management within desktop environments. However, despite their success, there is no experimental evidence of their effect on multitasking. In this paper, we present an experimental study incorporating 16 participants...... to perform the same tasks. Results show that adopting virtual desktops as dedicated workspaces allows for faster task resumption (10 s faster on average) and reduced cognitive load during sequential multitasking. Within our experiment the majority of users already benefited from using dedicated workspaces...
Regulating Search Engines: Taking Stock And Looking Ahead
Gasser, Urs
2006-01-01
Since the creation of the first pre-Web Internet search engines in the early 1990s, search engines have become almost as important as email as a primary online activity. Arguably, search engines are among the most important gatekeepers in today's digitally networked environment. Thus, it does not come as a surprise that the evolution of search technology and the diffusion of search engines have been accompanied by a series of conflicts among stakeholders such as search operators, content crea...
[Operative treatment of degenerative diseases of the lumbar spine].
Czabanka, M; Thomé, C; Ringel, F; Meyer, B; Eicker, S-O; Rohde, V; Stoffel, M; Vajkoczy, P
2018-04-20
Degenerative diseases of the lumbar spine and associated lower back pain represent a major epidemiological and health-related economic challenge. A distinction is made between specific and unspecific lower back pain. In specific lower back pain lumbar disc herniation and spinal canal stenosis with or without associated segment instability are among the most frequent pathologies. Diverse conservative and operative strategies for treatment of these diseases are available. The aim of this article is to present an overview of current data and an evidence-based assessment of the possible forms of treatment. An extensive literature search was carried out via Medline plus an additional evaluation of the authors' personal experiences. Conservative and surgical treatment represent efficient treatment options for degenerative diseases of the lumbar spine. Surgical treatment of lumbar disc herniation shows slight advantages compared to conservative treatment consisting of faster recovery of neurological deficits and a faster restitution of pain control. Surgical decompression is superior to conservative measures for the treatment of spinal canal stenosis and degenerative spondylolisthesis. In this scenario conservative treatment represents an important supporting measure for surgical treatment in order to improve the mobility of patients and the outcome of surgical treatment. The treatment of specific lower back pain due to degenerative lumbar pathologies represents an interdisciplinary challenge, requiring both conservative and surgical treatment strategies in a synergistic treatment concept in order to achieve the best results for patients.
Intelligent Robot-assisted Humanitarian Search and Rescue System
Directory of Open Access Journals (Sweden)
Henry Y. K. Lau
2009-11-01
Full Text Available The unprecedented scale and number of natural and man-made disasters in the past decade has urged international emergency search and rescue communities to seek for novel technology to enhance operation efficiency. Tele-operated search and rescue robots that can navigate deep into rubble to search for victims and to transfer critical field data back to the control console has gained much interest among emergency response institutions. In response to this need, a low-cost autonomous mini robot equipped with thermal sensor, accelerometer, sonar, pin-hole camera, microphone, ultra-bright LED and wireless communication module is developed to study the control of a group of decentralized mini search and rescue robots. The robot can navigate autonomously between voids to look for living body heat and can send back audio and video information to allow the operator to determine if the found object is a living human. This paper introduces the design and control of a low-cost robotic search and rescue system based on an immuno control framework developed for controlling decentralized systems. Design and development of the physical prototype and the immunity-based control system are described in this paper.
Intelligent Robot-Assisted Humanitarian Search and Rescue System
Directory of Open Access Journals (Sweden)
Albert W. Y. Ko
2009-06-01
Full Text Available The unprecedented scale and number of natural and man-made disasters in the past decade has urged international emergency search and rescue communities to seek for novel technology to enhance operation efficiency. Tele-operated search and rescue robots that can navigate deep into rubble to search for victims and to transfer critical field data back to the control console has gained much interest among emergency response institutions. In response to this need, a low-cost autonomous mini robot equipped with thermal sensor, accelerometer, sonar, pin-hole camera, microphone, ultra-bright LED and wireless communication module is developed to study the control of a group of decentralized mini search and rescue robots. The robot can navigate autonomously between voids to look for living body heat and can send back audio and video information to allow the operator to determine if the found object is a living human. This paper introduces the design and control of a low-cost robotic search and rescue system based on an immuno control framework developed for controlling decentralized systems. Design and development of the physical prototype and the immunity-based control system are described in this paper.
BWR type reactor and its operating method
International Nuclear Information System (INIS)
Ootsuji, Niro.
1983-01-01
Purpose: To regulate the control rod extraction operation such that an assumed control rod drop accident, if should occur, may not lead to further serious accidents, as well as enable to improve the working life of the control rod. Method: A plurality of control rods disposed among a plurality of fuel assemblies constituting the reactor core for suppressing the reactor core reactivity are divided into two groups depending on the descending speed, and the number of rods with a faster descending speed is set to less than 1/4 of the total number of the control rods. Then, the control rods are arranged such that those rods of the faster descending speed may be set every one another in any of the vertical, lateral and orthogonal directions. Further, it is always judged as to the possibility of extracting the control rods with the faster descending speed by a fast control rod extraction judging circuit to issue a signal to a control rod extraction inhibition circuit, so that the extraction operation for the control rods with the faster descending speed is started after all of the control rods with the slow descending speed have been extracted. Accordingly, if a control rod dropping accident should occur, abrupt power change can be avoided to thereby minimize the development of the accident. (Horiuchi, T.)
Searches for Supersymmetry in ATLAS
Cervelli, Alberto; The ATLAS collaboration
2017-01-01
After the discovery of the Higgs boson in ATLAS first run of data taking, and due to the lack of observation of new physics, searches for new particles such as Supersymmetric states are one of the main area of interest for the general purpose detectors operating at LHC. In this talk we will present a review of the searches for Supersymmetric particles, performed by the ATLAS experiment
A dynamic lattice searching method with rotation operation for optimization of large clusters
International Nuclear Information System (INIS)
Wu Xia; Cai Wensheng; Shao Xueguang
2009-01-01
Global optimization of large clusters has been a difficult task, though much effort has been paid and many efficient methods have been proposed. During our works, a rotation operation (RO) is designed to realize the structural transformation from decahedra to icosahedra for the optimization of large clusters, by rotating the atoms below the center atom with a definite degree around the fivefold axis. Based on the RO, a development of the previous dynamic lattice searching with constructed core (DLSc), named as DLSc-RO, is presented. With an investigation of the method for the optimization of Lennard-Jones (LJ) clusters, i.e., LJ 500 , LJ 561 , LJ 600 , LJ 665-667 , LJ 670 , LJ 685 , and LJ 923 , Morse clusters, silver clusters by Gupta potential, and aluminum clusters by NP-B potential, it was found that both the global minima with icosahedral and decahedral motifs can be obtained, and the method is proved to be efficient and universal.
Directory of Open Access Journals (Sweden)
David Hook
2006-09-01
Full Text Available Objective – To examine the interactions between users and search engines, and how they have changed over time. Design – Comparative analysis of search engine transaction logs. Setting – Nine major analyses of search engine transaction logs. Subjects – Nine web search engine studies (4 European, 5 American over a seven‐year period, covering the search engines Excite, Fireball, AltaVista, BWIE and AllTheWeb. Methods – The results from individual studies are compared by year of study for percentages of single query sessions, one term queries, operator (and, or, not, etc. usage and single result page viewing. As well, the authors group the search queries into eleven different topical categories and compare how the breakdown has changed over time. Main Results – Based on the percentage of single query sessions, it does not appear that the complexity of interactions has changed significantly for either the U.S.‐based or the European‐based search engines. As well, there was little change observed in the percentage of one‐term queries over the years of study for either the U.S.‐based or the European‐based search engines. Few users (generally less than 20% use Boolean or other operators in their queries, and these percentages have remained relatively stable. One area of noticeable change is in the percentage of users viewing only one results page, which has increased over the years of study. Based on the studies of the U.S.‐based search engines, the topical categories of ‘People, Place or Things’ and ‘Commerce, Travel, Employment or Economy’ are becoming more popular, while the categories of ‘Sex and Pornography’ and ‘Entertainment or Recreation’ are declining. Conclusions – The percentage of users viewing only one results page increased during the years of the study, while the percentages of single query sessions, oneterm sessions and operator usage remained stable. The increase in single result page viewing
The Search for Extraterrestrial Intelligence (SETI)
Tarter, Jill
The search for evidence of extraterrestrial intelligence is placed in the broader astronomical context of the search for extrasolar planets and biomarkers of primitive life elsewhere in the universe. A decision tree of possible search strategies is presented as well as a brief history of the search for extraterrestrial intelligence (SETI) projects since 1960. The characteristics of 14 SETI projects currently operating on telescopes are discussed and compared using one of many possible figures of merit. Plans for SETI searches in the immediate and more distant future are outlined. Plans for success, the significance of null results, and some opinions on deliberate transmission of signals (as well as listening) are also included. SETI results to date are negative, but in reality, not much searching has yet been done.
Two Search Techniques within a Human Pedigree Database
Gersting, J. M.; Conneally, P. M.; Rogers, K.
1982-01-01
This paper presents the basic features of two search techniques from MEGADATS-2 (MEdical Genetics Acquisition and DAta Transfer System), a system for collecting, storing, retrieving and plotting human family pedigrees. The individual search provides a quick method for locating an individual in the pedigree database. This search uses a modified soundex coding and an inverted file structure based on a composite key. The navigational search uses a set of pedigree traversal operations (individual...
Negative emotional stimuli reduce contextual cueing but not response times in inefficient search.
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.
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.
A faster and more reliable data acquisition system for the full performance of the SciCRT
International Nuclear Information System (INIS)
Sasai, Y.; Matsubara, Y.; Itow, Y.; Sako, T.; Kawabata, T.; Lopez, D.; Hikimochi, R.; Tsuchiya, A.; Ikeno, M.; Uchida, T.; Tanaka, M.; Munakata, K.; Kato, C.; Nakamura, Y.; Oshima, T.; Koike, T.; Kozai, M.; Shibata, S.; Oshima, A.; Takamaru, H.
2017-01-01
The SciBar Cosmic Ray Telescope (SciCRT) is a massive scintillator tracker to observe cosmic rays at a very high-altitude environment in Mexico. The fully active tracker is based on the Scintillator Bar (SciBar) detector developed as a near detector for the KEK-to-Kamioka long-baseline neutrino oscillation experiment (K2K) in Japan. Since the data acquisition (DAQ) system was developed for the accelerator experiment, we determined to develop a new robust DAQ system to optimize it to our cosmic-ray experiment needs at the top of Mt. Sierra Negra (4600 m). One of our special requirements is to achieve a 10 times faster readout rate. We started to develop a new fast readout back-end board (BEB) based on 100 Mbps SiTCP, a hardware network processor developed for DAQ systems for high energy physics experiments. Then we developed the new BEB which has a potential of 20 times faster than the current one in the case of observing neutrons. Finally we installed the new DAQ system including the new BEBs to a part of the SciCRT in July 2015. The system has been operating since then. In this paper, we describe the development, the basic performance of the new BEB, the status after the installation in the SciCRT, and the future performance.
A faster and more reliable data acquisition system for the full performance of the SciCRT
Energy Technology Data Exchange (ETDEWEB)
Sasai, Y., E-mail: sasaiyoshinori@isee.nagoya-u.ac.jp [Institute for Space-Earth Environmental Research, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan); Matsubara, Y.; Itow, Y.; Sako, T.; Kawabata, T.; Lopez, D.; Hikimochi, R.; Tsuchiya, A. [Institute for Space-Earth Environmental Research, Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8601 (Japan); Ikeno, M.; Uchida, T.; Tanaka, M. [High Energy Accelerator Research Organization, KEK, 1-1 Oho, Tsukuba, Ibaraki 305-0801 (Japan); Munakata, K.; Kato, C.; Nakamura, Y.; Oshima, T.; Koike, T. [Department of Physics, Shinshu University, Asahi, Matsumoto 390-8621 (Japan); Kozai, M. [Institute of Space and Astronautical Science, Japan Aerospace Exploration Agency (ISAS/JAXA), Sagamihara, Kanagawa 252-5210 (Japan); Shibata, S.; Oshima, A.; Takamaru, H. [College of Engineering, Chubu University, Kasugai 487-8501 (Japan); and others
2017-06-11
The SciBar Cosmic Ray Telescope (SciCRT) is a massive scintillator tracker to observe cosmic rays at a very high-altitude environment in Mexico. The fully active tracker is based on the Scintillator Bar (SciBar) detector developed as a near detector for the KEK-to-Kamioka long-baseline neutrino oscillation experiment (K2K) in Japan. Since the data acquisition (DAQ) system was developed for the accelerator experiment, we determined to develop a new robust DAQ system to optimize it to our cosmic-ray experiment needs at the top of Mt. Sierra Negra (4600 m). One of our special requirements is to achieve a 10 times faster readout rate. We started to develop a new fast readout back-end board (BEB) based on 100 Mbps SiTCP, a hardware network processor developed for DAQ systems for high energy physics experiments. Then we developed the new BEB which has a potential of 20 times faster than the current one in the case of observing neutrons. Finally we installed the new DAQ system including the new BEBs to a part of the SciCRT in July 2015. The system has been operating since then. In this paper, we describe the development, the basic performance of the new BEB, the status after the installation in the SciCRT, and the future performance.
Willett, Christopher S
2008-06-01
Two different forces are thought to contribute to the rapid accumulation of hybrid male sterility that has been observed in many inter-specific crosses, namely the faster male and the dominance theories. For male heterogametic taxa, both faster male and dominance would work in the same direction to cause the rapid evolution of male sterility; however, for taxa lacking differentiated sex chromosomes only the faster male theory would explain the rapid evolution of male hybrid sterility. It is currently unknown what causes the faster evolution of male sterility, but increased sexual selection on males and the sensitivity of genes involved in male reproduction are two hypotheses that could explain the observation. Here, patterns of hybrid sterility in crosses of genetically divergent copepod populations are examined to test potential mechanisms of faster male evolution. The study species, Tigriopus californicus, lacks differentiated, hemizygous sex chromosomes and appears to have low levels of divergence caused by sexual selection acting upon males. Hybrid sterility does not accumulate more rapidly in males than females in these crosses suggesting that in this taxon male reproductive genes are not inherently more prone to disruption in hybrids.
The Faster, Better, Cheaper Approach to Space Missions: An Engineering Management Assessment
Hamaker, Joe
2000-01-01
This paper describes, in viewgraph form, the faster, better, cheaper approach to space missions. The topics include: 1) What drives "Faster, Better, Cheaper"? 2) Why Space Programs are Costly; 3) Background; 4) Aerospace Project Management (Old Culture); 5) Aerospace Project Management (New Culture); 6) Scope of Analysis Limited to Engineering Management Culture; 7) Qualitative Analysis; 8) Some Basic Principles of the New Culture; 9) Cause and Effect; 10) "New Ways of Doing Business" Survey Results; 11) Quantitative Analysis; 12) Recent Space System Cost Trends; 13) Spacecraft Dry Weight Trend; 14) Complexity Factor Trends; 15) Cost Normalization; 16) Cost Normalization Algorithm; 17) Unnormalized Cost vs. Normalized Cost; and 18) Concluding Observations.
Directory of Open Access Journals (Sweden)
Anongrit Kangrang
2018-01-01
Full Text Available Optimal rule curves are necessary guidelines in the reservoir operation that have been used to assess performance of any reservoir to satisfy water supply, irrigation, industrial, hydropower, and environmental conservation requirements. This study applied the conditional genetic algorithm (CGA and the conditional tabu search algorithm (CTSA technique to connect with the reservoir simulation model in order to search optimal reservoir rule curves. The Ubolrat Reservoir located in the northeast region of Thailand was an illustrative application including historic monthly inflow, future inflow generated by the SWAT hydrological model using 50-year future climate data from the PRECIS regional climate model in case of B2 emission scenario by IPCC SRES, water demand, hydrologic data, and physical reservoir data. The future and synthetic inflow data of reservoirs were used to simulate reservoir system for evaluating water situation. The situations of water shortage and excess water were shown in terms of frequency magnitude and duration. The results have shown that the optimal rule curves from CGA and CTSA connected with the simulation model can mitigate drought and flood situations than the existing rule curves. The optimal future rule curves were more suitable for future situations than the other rule curves.
Application of artificial intelligence to search ground-state geometry of clusters
International Nuclear Information System (INIS)
Lemes, Mauricio Ruv; Marim, L.R.; Dal Pino, A. Jr.
2002-01-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 Si 10 and Si 20 , 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
Simrank: Rapid and sensitive general-purpose k-mer search tool
Energy Technology Data Exchange (ETDEWEB)
DeSantis, T.Z.; Keller, K.; Karaoz, U.; Alekseyenko, A.V; Singh, N.N.S.; Brodie, E.L; Pei, Z.; Andersen, G.L; Larsen, N.
2011-04-01
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. 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. Simrank provides molecular ecologists with a high-throughput, open source choice for comparing large sequence sets to find similarity.
Modeling operators' emergency response time for chemical processing operations.
Murray, Susan L; Harputlu, Emrah; Mentzer, Ray A; Mannan, M Sam
2014-01-01
Operators have a crucial role during emergencies at a variety of facilities such as chemical processing plants. When an abnormality occurs in the production process, the operator often has limited time to either take corrective actions or evacuate before the situation becomes deadly. It is crucial that system designers and safety professionals can estimate the time required for a response before procedures and facilities are designed and operations are initiated. There are existing industrial engineering techniques to establish time standards for tasks performed at a normal working pace. However, it is reasonable to expect the time required to take action in emergency situations will be different than working at a normal production pace. It is possible that in an emergency, operators will act faster compared to a normal pace. It would be useful for system designers to be able to establish a time range for operators' response times for emergency situations. This article develops a modeling approach to estimate the time standard range for operators taking corrective actions or following evacuation procedures in emergency situations. This will aid engineers and managers in establishing time requirements for operators in emergency situations. The methodology used for this study combines a well-established industrial engineering technique for determining time requirements (predetermined time standard system) and adjustment coefficients for emergency situations developed by the authors. Numerous videos of workers performing well-established tasks at a maximum pace were studied. As an example, one of the tasks analyzed was pit crew workers changing tires as quickly as they could during a race. The operations in these videos were decomposed into basic, fundamental motions (such as walking, reaching for a tool, and bending over) by studying the videos frame by frame. A comparison analysis was then performed between the emergency pace and the normal working pace operations
Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.
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.
Fast parallel tandem mass spectral library searching using GPU hardware acceleration.
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.
Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search
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.
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.
Two-Stage Chaos Optimization Search Application in Maximum Power Point Tracking of PV Array
Directory of Open Access Journals (Sweden)
Lihua Wang
2014-01-01
Full Text Available In order to deliver the maximum available power to the load under the condition of varying solar irradiation and environment temperature, maximum power point tracking (MPPT technologies have been used widely in PV systems. Among all the MPPT schemes, the chaos method is one of the hot topics in recent years. In this paper, a novel two-stage chaos optimization method is presented which can make search faster and more effective. In the process of proposed chaos search, the improved logistic mapping with the better ergodic is used as the first carrier process. After finding the current optimal solution in a certain guarantee, the power function carrier as the secondary carrier process is used to reduce the search space of optimized variables and eventually find the maximum power point. Comparing with the traditional chaos search method, the proposed method can track the change quickly and accurately and also has better optimization results. The proposed method provides a new efficient way to track the maximum power point of PV array.
A Durable Flash Memory Search Tree
Clay III, James; Wortman, Kevin
2012-01-01
We consider the task of optimizing the B-tree data structure, used extensively in operating systems and databases, for sustainable usage on multi-level flash memory. Empirical evidence shows that this new flash memory tree, or FM Tree, extends the operational lifespan of each block of flash memory by a factor of roughly 27 to 70 times, while still supporting logarithmic-time search tree operations.
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.
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
Tao, Yufei
2010-07-01
Nearest Neighbor (NN) search in high-dimensional space is an important problem in many applications. From the database perspective, a good solution needs to have two properties: (i) it can be easily incorporated in a relational database, and (ii) its query cost should increase sublinearly with the dataset size, regardless of the data and query distributions. Locality-Sensitive Hashing (LSH) is a well-known methodology fulfilling both requirements, but its current implementations either incur expensive space and query cost, or abandon its theoretical guarantee on the quality of query results. Motivated by this, we improve LSH by proposing an access method called the Locality-Sensitive B-tree (LSB-tree) to enable fast, accurate, high-dimensional NN search in relational databases. The combination of several LSB-trees forms a LSB-forest that has strong quality guarantees, but improves dramatically the efficiency of the previous LSH implementation having the same guarantees. In practice, the LSB-tree itself is also an effective index which consumes linear space, supports efficient updates, and provides accurate query results. In our experiments, the LSB-tree was faster than: (i) iDistance (a famous technique for exact NN search) by two orders ofmagnitude, and (ii) MedRank (a recent approximate method with nontrivial quality guarantees) by one order of magnitude, and meanwhile returned much better results. As a second step, we extend our LSB technique to solve another classic problem, called Closest Pair (CP) search, in high-dimensional space. The long-term challenge for this problem has been to achieve subquadratic running time at very high dimensionalities, which fails most of the existing solutions. We show that, using a LSB-forest, CP search can be accomplished in (worst-case) time significantly lower than the quadratic complexity, yet still ensuring very good quality. In practice, accurate answers can be found using just two LSB-trees, thus giving a substantial
Advances in search and rescue at sea
Breivik, Øyvind; Allen, Arthur Addoms; Maisondieu, Christophe; Olagnon, Michel
2013-01-01
A topical collection on "Advances in Search and Rescue at Sea" has appeared in recent issues of Ocean Dynamics following the latest in a series of workshops on "Technologies for Search and Rescue and other Emergency Marine Operations" (2004, 2006, 2008, and 2011), hosted by IFREMER in Brest, France. Here, we give a brief overview of the history of search and rescue at sea before we summarize the main results of the papers that have appeared in the topical collection.
Real-time vehicle detection and tracking in video based on faster R-CNN
Zhang, Yongjie; Wang, Jian; Yang, Xin
2017-08-01
Vehicle detection and tracking is a significant part in auxiliary vehicle driving system. Using the traditional detection method based on image information has encountered enormous difficulties, especially in complex background. To solve this problem, a detection method based on deep learning, Faster R-CNN, which has very high detection accuracy and flexibility, is introduced. An algorithm of target tracking with the combination of Camshift and Kalman filter is proposed for vehicle tracking. The computation time of Faster R-CNN cannot achieve realtime detection. We use multi-thread technique to detect and track vehicle by parallel computation for real-time application.
Faster quantum chemistry simulation on fault-tolerant quantum computers
International Nuclear Information System (INIS)
Cody Jones, N; McMahon, Peter L; Yamamoto, Yoshihisa; Whitfield, James D; Yung, Man-Hong; Aspuru-Guzik, Alán; Van Meter, Rodney
2012-01-01
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on fault-tolerant quantum computers; these methods generalize readily to other quantum simulation problems. Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource. To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay–Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform. Comput. 6 81). For a given approximation error ϵ, arbitrary single-qubit gates can be produced fault-tolerantly and using a restricted set of gates in time which is O(log ϵ) or O(log log ϵ); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride. (paper)
DEFF Research Database (Denmark)
of the NGOs have a lot of international experience (mainly in Denmark and Germany) as partners in different co-operation projects. Almost all the NGOs have recognized the important role of the scientific information in their activity. NGOs also feel the need for an easy access to required information...... for transnational co-operation like: an investigation/project concerning the driving forces behind urban development,or a co-operation in the field of wastewater reuse and minimization of wastewater loads and discharge, or a service page (internet) to search for potential partners. The governmental institutions...... in order to improve transnational cooperation are identified to be: • Search for national/international project partners • Access to existent co-operation projects or networks • Develop in common project proposals on themes requested by community groups • Exchange information/good operational practices...
Final Report for the ADMX Phase 2a Project at the University of Washington
International Nuclear Information System (INIS)
Rosenberg, Leslie J.
2015-01-01
This is a final report of the ADMX (Axion Dark Matter eXperiment) Phase 2a program. This program is a project allowing for a sensitive axion dark-matter search at higher axion masses. The Phase 2a program also prepares the project for lower temperature anticipated in later operations. The Phase 2a program includes sensitive data-taking operations at two cavity modes, TM010 and TM020, allowing for faster data-taking operations and extending the search to higher and plausible dark-matter axion masses.
FASTERp: A Feature Array Search Tool for Estimating Resemblance of Protein Sequences
Energy Technology Data Exchange (ETDEWEB)
Macklin, Derek; Egan, Rob; Wang, Zhong
2014-03-14
Metagenome sequencing efforts have provided a large pool of billions of genes for identifying enzymes with desirable biochemical traits. However, homology search with billions of genes in a rapidly growing database has become increasingly computationally impractical. Here we present our pilot efforts to develop a novel alignment-free algorithm for homology search. Specifically, we represent individual proteins as feature vectors that denote the presence or absence of short kmers in the protein sequence. Similarity between feature vectors is then computed using the Tanimoto score, a distance metric that can be rapidly computed on bit string representations of feature vectors. Preliminary results indicate good correlation with optimal alignment algorithms (Spearman r of 0.87, ~;;1,000,000 proteins from Pfam), as well as with heuristic algorithms such as BLAST (Spearman r of 0.86, ~;;1,000,000 proteins). Furthermore, a prototype of FASTERp implemented in Python runs approximately four times faster than BLAST on a small scale dataset (~;;1000 proteins). We are optimizing and scaling to improve FASTERp to enable rapid homology searches against billion-protein databases, thereby enabling more comprehensive gene annotation efforts.
Operating the GridPix detector in dark matter search experiments
Schön, R.; Alfonsi, M.; Hemink, G.; Decowski, M.P.; van Bakel, N.; van der Graaf, H.
2013-01-01
The DARWIN (dark matter WIMP search with noble liquids) design study aims to use liquid argon and liquid xenon targets to look for nuclear recoils due to weakly interacting massive particles (WIMPs). To measure the recoil energy in dual-phase noble gas time projection chambers the combination of
Object Detection Based on Fast/Faster RCNN Employing Fully Convolutional Architectures
Directory of Open Access Journals (Sweden)
Yun Ren
2018-01-01
Full Text Available Modern object detectors always include two major parts: a feature extractor and a feature classifier as same as traditional object detectors. The deeper and wider convolutional architectures are adopted as the feature extractor at present. However, many notable object detection systems such as Fast/Faster RCNN only consider simple fully connected layers as the feature classifier. In this paper, we declare that it is beneficial for the detection performance to elaboratively design deep convolutional networks (ConvNets of various depths for feature classification, especially using the fully convolutional architectures. In addition, this paper also demonstrates how to employ the fully convolutional architectures in the Fast/Faster RCNN. Experimental results show that a classifier based on convolutional layer is more effective for object detection than that based on fully connected layer and that the better detection performance can be achieved by employing deeper ConvNets as the feature classifier.
Visual assistance system for cyclotron operation
International Nuclear Information System (INIS)
Okamura, Tetsuya; Tachikawa, Toshiki; Murakami, Tohru.
1994-01-01
A computer-based operation system for a cyclotron which assists operators has been developed. It is the operation assistance system depending on visual sense to indicate beam parameters to operators. First, the mental model of operators at the time of beam adjustment was analyzed, and it was presumed to be composed of five partial mental models, that is, beam behavior model, feasible setting region model, parameter sensitivity model, parameter interrelation model and status map model. Next, three visual interfaces were developed. Beam trajectory is rapidly calculated and graphically displayed whenever operators change parameters. Feasible setting regions (FSR) for parameters that satisfy the beam acceptance criteria of a cyclotron are indicated. The distribution of beam current values which are the quantity for evaluating adjustment is indicated as search history. Finally, for evaluating the system effectiveness, the search time required to reach the optimum conditions was measured. In addition, the system usability was evaluated by written questionnaires. The result of experiment showed the reduction of search time by about 65%. The written questionnaires survey showed the operators highly evaluate system usability. (K.I.)
Wang, Yan; Huang, Song; Ji, Zhicheng
2017-07-01
This paper presents a hybrid particle swarm optimization and gravitational search algorithm based on hybrid mutation strategy (HGSAPSO-M) to optimize economic dispatch (ED) including distributed generations (DGs) considering market-based energy pricing. A daily ED model was formulated and a hybrid mutation strategy was adopted in HGSAPSO-M. The hybrid mutation strategy includes two mutation operators, chaotic mutation, Gaussian mutation. The proposed algorithm was tested on IEEE-33 bus and results show that the approach is effective for this problem.
Information-Limited Parallel Processing in Difficult Heterogeneous Covert Visual Search
Dosher, Barbara Anne; Han, Songmei; Lu, Zhong-Lin
2010-01-01
Difficult visual search is often attributed to time-limited serial attention operations, although neural computations in the early visual system are parallel. Using probabilistic search models (Dosher, Han, & Lu, 2004) and a full time-course analysis of the dynamics of covert visual search, we distinguish unlimited capacity parallel versus serial…
Multi-level and Multi-component Bitmap Encoding for Efficient Search Operations
Directory of Open Access Journals (Sweden)
Madhu BHAN, Department of Computer Applications
2012-12-01
Full Text Available The growing interest in data warehousing for decision makers is becoming more and more crucial to make faster and efficient decisions. On-line decision needs short response times. Many indexing techniques have been created to achieve this goal in read only environments. Indexing technique that has attracted attention in multidimensional databases is Bitmap Indexing. The paper discusses the various existing bitmap indexing techniques along with their performance characteristics. The paper proposes two new bitmap indexing techniques in the class of multi-level and multi-component encoding schemes and prove that the two techniques have better space–time performance than some of the existing techniques used for range queries. We provide an analytical model for comparing the performance of our proposed encoding schemes with that of the existing ones.
A DE-Based Scatter Search for Global Optimization Problems
Directory of Open Access Journals (Sweden)
Kun Li
2015-01-01
Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.
Product Operations Status Summary Metrics
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.
Recoding between two types of STM representation revealed by the dynamics of memory search.
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.
Simulating a Direction-Finder Search for an ELT
Bream, Bruce
2005-01-01
A computer program simulates the operation of direction-finding equipment engaged in a search for an emergency locator transmitter (ELT) aboard an aircraft that has crashed. The simulated equipment is patterned after the equipment used by the Civil Air Patrol to search for missing aircraft. The program is designed to be used for training in radio direction-finding and/or searching for missing aircraft without incurring the expense and risk of using real aircraft and ground search resources. The program places a hidden ELT on a map and enables the user to search for the location of the ELT by moving a 14 NASA Tech Briefs, March 2005 small aircraft image around the map while observing signal-strength and direction readings on a simulated direction- finding locator instrument. As the simulated aircraft is turned and moved on the map, the program updates the readings on the direction-finding instrument to reflect the current position and heading of the aircraft relative to the location of the ELT. The software is distributed in a zip file that contains an installation program. The software runs on the Microsoft Windows 9x, NT, and XP operating systems.
these cooler months. Did you know your body can cool 25 times faster in water than in air? That water code at 13 or 20 words-per-minute will no longer be required to obtain amateur radio operating be found by contacting the ARRL or using an Internet search engine to search on such topics as "
Energy Technology Data Exchange (ETDEWEB)
Sheng, Zheng, E-mail: 19994035@sina.com [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Wang, Jun; Zhou, Bihua [National Defense Key Laboratory on Lightning Protection and Electromagnetic Camouflage, PLA University of Science and Technology, Nanjing 210007 (China); Zhou, Shudao [College of Meteorology and Oceanography, PLA University of Science and Technology, Nanjing 211101 (China); Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters, Nanjing University of Information Science and Technology, Nanjing 210044 (China)
2014-03-15
This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.
International Nuclear Information System (INIS)
Sheng, Zheng; Wang, Jun; Zhou, Bihua; Zhou, Shudao
2014-01-01
This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm
OPERATIONAL COSTS OF CANAL COMPANIES AND IRRIGATION DISTRICTS IN THE INTERMOUNTAIN REGION
Wilkins-Wells, John; Lagae, Hubert J.; Anderson, Raymond L.; Anwer, Muhammad Sarfraz
1999-01-01
This study reports on the trends of operational costs of farmer owned and operated irrigation enterprises (irrigation districts and canal companies) in five intermountain states. Administrative costs have risen faster then operation and maintenance costs. While salaries of employees have not risen significantly over time, legal costs have greatly escalated.
Airborne Radar Search for Diesel Submarines
National Research Council Canada - National Science Library
Pilnick, Steven E; Landa, Jose
2005-01-01
.... In this research, a detection rate model is developed to analyze the effectiveness of airborne radar search for a diesel submarine assumed to be intermittently operating with periscopes or masts...
Exploring Contextual Models in Chemical Patent Search
Urbain, Jay; Frieder, Ophir
We explore the development of probabilistic retrieval models for integrating term statistics with entity search using multiple levels of document context to improve the performance of chemical patent search. A distributed indexing model was developed to enable efficient named entity search and aggregation of term statistics at multiple levels of patent structure including individual words, sentences, claims, descriptions, abstracts, and titles. The system can be scaled to an arbitrary number of compute instances in a cloud computing environment to support concurrent indexing and query processing operations on large patent collections.
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.
Elastic coupling of limb joints enables faster bipedal walking
Dean, J.C.; Kuo, A.D.
2008-01-01
The passive dynamics of bipedal limbs alone are sufficient to produce a walking motion, without need for control. Humans augment these dynamics with muscles, actively coordinated to produce stable and economical walking. Present robots using passive dynamics walk much slower, perhaps because they lack elastic muscles that couple the joints. Elastic properties are well known to enhance running gaits, but their effect on walking has yet to be explored. Here we use a computational model of dynamic walking to show that elastic joint coupling can help to coordinate faster walking. In walking powered by trailing leg push-off, the model's speed is normally limited by a swing leg that moves too slowly to avoid stumbling. A uni-articular spring about the knee allows faster but uneconomical walking. A combination of uni-articular hip and knee springs can speed the legs for improved speed and economy, but not without the swing foot scuffing the ground. Bi-articular springs coupling the hips and knees can yield high economy and good ground clearance similar to humans. An important parameter is the knee-to-hip moment arm that greatly affects the existence and stability of gaits, and when selected appropriately can allow for a wide range of speeds. Elastic joint coupling may contribute to the economy and stability of human gait. PMID:18957360
Why do firms engage in forward-looking search?
DEFF Research Database (Denmark)
Jissink, Tymen; Rohrbeck, René; Huizingh, Eelko K.R.E.
firms with a low level of slack resources engage to a much lower extent into forward-looking search, if they operate in high-competitive-intensity environments. Our findings not only carry important implications for predicting a firm’s engagement in forward-looking search, but also potentially...... performed below aspirations are less likely to engage in forward-looking search, suggesting that forward-looking search is not a form of problemistic search. In contrast, firms that have abundant uncommitted (slack) resources as well as firms expecting to outperform in the near future are engaging more...... into forward-looking search. We also find interaction effect between performance feedback and environmental characteristics. Interestingly firms with a high level of slack resources are only surpassing their less rich peers in forward-looking search, if they are in technologically turbulent environments. Also...
Grover's quantum search algorithm for an arbitrary initial mixed state
International Nuclear Information System (INIS)
Biham, Eli; Kenigsberg, Dan
2002-01-01
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states (carrying high entropy), the generalized Grover algorithm is considerably faster than any classical algorithm
How to Elect a Leader Faster than a Tournament
Alistarh, Dan; Gelashvili, Rati; Vladu, Adrian
2014-01-01
The problem of electing a leader from among $n$ contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given $n$ processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a $\\Theta(\\log n...
An improved search for elementary particles with fractional electric charge
International Nuclear Information System (INIS)
Lee, E.R.
1996-08-01
The SLAC Quark Search Group has demonstrated successful operation of a low cost, high mass throughput Millikan apparatus designed to search for fractionally charged particles. About six million silicone oil drops were measured with no evidence of fractional charges. A second experiment is under construction with 100 times greater throughput which will utilize optimized search fluids
Searching via walking: How to find a marked clique of a complete graph using quantum walks
International Nuclear Information System (INIS)
Hillery, Mark; Reitzner, Daniel; Buzek, Vladimir
2010-01-01
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resources needed for a quantitative comparison of the efficiency of classical and quantum searches--the number of oracle calls.
The Higgs Boson Search and Discovery
Bernardi, Gregorio
2016-01-01
We present a brief account of the search for the Higgs boson at the three major colliders that have operated over the last three decades: LEP, the Tevatron, and the LHC. The experimental challenges encountered stemmed from the distinct event phenomenology as determined by the colliders energy and the possible values for the Higgs boson mass, and from the capability of these colliders to deliver as much collision data as possible to fully explore the mass spectrum within their reach. Focusing more on the hadron collider searches during the last decade, we discuss how the search for the Higgs boson was advanced through mastering the experimental signatures of standard theory backgrounds, through the comprehensive utilization of the features of the detectors involved in the searches, and by means of advanced data analysis techniques. The search culminated in 2012 with the discovery, by the ATLAS and CMS collaborations, of a Higgs-like particle with mass close to 125 GeV, confirmed more recently to have propertie...
Patient-Centered Tools for Medication Information Search.
Wilcox, Lauren; Feiner, Steven; Elhadad, Noémie; Vawdrey, David; Tran, Tran H
2014-05-20
Recent research focused on online health information seeking highlights a heavy reliance on general-purpose search engines. However, current general-purpose search interfaces do not necessarily provide adequate support for non-experts in identifying suitable sources of health information. Popular search engines have recently introduced search tools in their user interfaces for a range of topics. In this work, we explore how such tools can support non-expert, patient-centered health information search. Scoping the current work to medication-related search, we report on findings from a formative study focused on the design of patient-centered, medication-information search tools. Our study included qualitative interviews with patients, family members, and domain experts, as well as observations of their use of Remedy, a technology probe embodying a set of search tools. Post-operative cardiothoracic surgery patients and their visiting family members used the tools to find information about their hospital medications and were interviewed before and after their use. Domain experts conducted similar search tasks and provided qualitative feedback on their preferences and recommendations for designing these tools. Findings from our study suggest the importance of four valuation principles underlying our tools: credibility, readability, consumer perspective, and topical relevance.
Searching for the majority: algorithms of voluntary control.
Directory of Open Access Journals (Sweden)
Jin Fan
Full Text Available Voluntary control of information processing is crucial to allocate resources and prioritize the processes that are most important under a given situation; the algorithms underlying such control, however, are often not clear. We investigated possible algorithms of control for the performance of the majority function, in which participants searched for and identified one of two alternative categories (left or right pointing arrows as composing the majority in each stimulus set. We manipulated the amount (set size of 1, 3, and 5 and content (ratio of left and right pointing arrows within a set of the inputs to test competing hypotheses regarding mental operations for information processing. Using a novel measure based on computational load, we found that reaction time was best predicted by a grouping search algorithm as compared to alternative algorithms (i.e., exhaustive or self-terminating search. The grouping search algorithm involves sampling and resampling of the inputs before a decision is reached. These findings highlight the importance of investigating the implications of voluntary control via algorithms of mental operations.
Li, Quanfeng; Wang, Qi; Hou, Yubin; Lu, Qingyou
2012-04-01
We present a home-built 18/20 T high magnetic field scanning tunneling microscope (STM) featuring fully low voltage (lower than ±15 V) operability in low temperatures, large scale searching ability, and 20 fA high current resolution (measured by using a 100 GOhm dummy resistor to replace the tip-sample junction) with a bandwidth of 3.03 kHz. To accomplish low voltage operation which is important in achieving high precision, low noise, and low interference with the strong magnetic field, the coarse approach is implemented with an inertial slider driven by the lateral bending of a piezoelectric scanner tube (PST) whose inner electrode is axially split into two for enhanced bending per volt. The PST can also drive the same sliding piece to inertial slide in the other bending direction (along the sample surface) of the PST, which realizes the large area searching ability. The STM head is housed in a three segment tubular chamber, which is detachable near the STM head for the convenience of sample and tip changes. Atomic resolution images of a graphite sample taken under 17.6 T and 18.0001 T are presented to show its performance. © 2012 American Institute of Physics
International Nuclear Information System (INIS)
Spurgin, A.J.; Orvis, D.D.; Spurgin, J.P.; Luna, C.J.
1990-05-01
This report presents the results of a project sponsored by the Electric Power Research Institute (EPRI) and Taiwan Power Company (TPC) and conducted by APG and TPC to perform evaluation of the Emergency Operating Procedures Tracking System (EOPTS). The EOPTS is an expert system employing artificial intelligence techniques developed by EPRI for Boiling Water Reactor (BWR) plants based on emergency operating procedures (EOPs). EOPTS is a computerized decision aid used to assist plant operators in efficient and reliable use of EOPs. The main objective of this project was to evaluate the EOPTS and determine how an operator aid of this type could noticeably improve the response time and the reliability of control room crews to multi-failure scenarios. A secondary objective was to collect data on how crew performance was affected. Experiments results indicate that the EOPTS measurably improves crew performance over crews using the EOP flow charts. Time-comparison measurements indicate that crews using the EOPTS perform required actions more quickly than do those using the flowcharts. The results indicate that crews using the EOPTS are not only faster and more consistent in their actions but make fewer errors. In addition, they have a higher likelihood of recovering from the errors that they do make. Use of the EOPTS in the control room should result in faster termination and mitigation of accidents and reduced risk of power plant operations. Recommendations are made towards possible applications of the EOPTS to operator training and evaluation, and for the applicability of the evaluation methodology developed for this project to the evaluation of similar operator aides. 17 refs., 14 figs., 14 tabs
Faster magnet sorting with a threshold acceptance algorithm
International Nuclear Information System (INIS)
Lidia, S.; Carr, R.
1995-01-01
We introduce here a new technique for sorting magnets to minimize the field errors in permanent magnet insertion devices. Simulated annealing has been used in this role, but we find the technique of threshold acceptance produces results of equal quality in less computer time. Threshold accepting would be of special value in designing very long insertion devices, such as long free electron lasers (FELs). Our application of threshold acceptance to magnet sorting showed that it converged to equivalently low values of the cost function, but that it converged significantly faster. We present typical cases showing time to convergence for various error tolerances, magnet numbers, and temperature schedules
CSRtrack Faster Calculation of 3-D CSR Effects
Dohlus, Martin
2004-01-01
CSRtrack is a new code for the simulation of Coherent Synchrotron radiation effects on the beam dynamics of linear accelerators. It incorporates the physics of our previous code, TraFiC4, and adds new algorithms for the calculation of the CSR fields. A one-dimensional projected method allows quick estimates and a greens function method allows 3D calculations about ten times faster than with the `direct' method. The tracking code is written in standard FORTRAN77 and has its own parser for comfortable input of calculation parameters and geometry. Phase space input and the analysis of the traced particle distribution is done with MATLAB interface programs.
Faster magnet sorting with a threshold acceptance algorithm
International Nuclear Information System (INIS)
Lidia, S.
1994-08-01
The authors introduce here a new technique for sorting magnets to minimize the field errors in permanent magnet insertion devices. Simulated annealing has been used in this role, but they find the technique of threshold acceptance produces results of equal quality in less computer time. Threshold accepting would be of special value in designing very long insertion devices, such as long FEL's. Their application of threshold acceptance to magnet sorting showed that it converged to equivalently low values of the cost function, but that it converged significantly faster. They present typical cases showing time to convergence for various error tolerances, magnet numbers, and temperature schedules
The Mechanisms Underlying the ASD Advantage in Visual Search.
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.
Approximate search for Big Data with applications in information security – A survey
Directory of Open Access Journals (Sweden)
Slobodan Petrović
2015-04-01
Full Text Available This paper is a survey of approximate search techniques in very large data sets (so-called Big Data. After a short introduction, some techniques for speeding up approximate search in such data sets based on exploitation of inherent bit-parallelism in computers are described. It then reviews the applications in search related to information security problems (digital forensics, malware detection, intrusion detection are reviewed. Finally, the need for constraints in approximate search regarding the number of so-called elementary edit operations and the run lengths of particular elementary edit operations is explained and the status of on-going research on efficient implementation of approximate search algorithms with various constraints is given.
Phylogenetic search through partial tree mixing
2012-01-01
Background Recent advances in sequencing technology have created large data sets upon which phylogenetic inference can be performed. Current research is limited by the prohibitive time necessary to perform tree search on a reasonable number of individuals. This research develops new phylogenetic algorithms that can operate on tens of thousands of species in a reasonable amount of time through several innovative search techniques. Results When compared to popular phylogenetic search algorithms, better trees are found much more quickly for large data sets. These algorithms are incorporated in the PSODA application available at http://dna.cs.byu.edu/psoda Conclusions The use of Partial Tree Mixing in a partition based tree space allows the algorithm to quickly converge on near optimal tree regions. These regions can then be searched in a methodical way to determine the overall optimal phylogenetic solution. PMID:23320449
International Nuclear Information System (INIS)
Ellis, J.; Pauss, F.
1989-01-01
The CERN p bar p Collider has been the first accelerator to operate in a completely new energy domain, reaching center-of-mass energies an order of magnitude larger than those previously available with the intersecting Storage Rings (ISR) at CERN, or with the Positron-Electron Tandem Ring Accelerator (PETRA) at DESY and the Positron-Electron Project (PEP) at SLAC. Naturally there has been great interest in the searches for new physics in this virgin territory. Theorists have approached these searches from either or both of two rival points of view. Either they have had an a priori prejudice as to what new physics should be searched for, and what its signatures should be, or they have tried to interpret a posteriori some experimental observations. The basic building-blocks of new physics in the 100 GeV energy domain are jets j, charged leptons l, photons γ, and missing transverse energy E T . Therefore searches have been conducted in channels which are combinations of these elements. It also shows some of the main a priori theoretical prejudices which can be explored in each of these channels. The layout of the rest of this paper is as follows. There are sections discussing each of the major prejudices: the Standard Model supersymmetry; extra gauge degrees of freedom; composite models; and other possibilities. Each of these sections contains a description of the motivations and characteristics of the new physics to be searched for, followed by a review of the searches made up to now at the CERN p bar p Collider. Finally, it summarizes the lessons to be learnt so far from searches for new physics at the CERN p bar p Collider, and previews some of the prospects for the next rounds of collider searches at CERN and FNAL
Yang, Liqin; Sang, Nong; Gao, Changxin
2018-03-01
Vehicle parts detection plays an important role in public transportation safety and mobility. The detection of vehicle parts is to detect the position of each vehicle part. We propose a new approach by combining Faster RCNN and three level cascaded convolutional neural network (DCNN). The output of Faster RCNN is a series of bounding boxes with coordinate information, from which we can locate vehicle parts. DCNN can precisely predict feature point position, which is the center of vehicle part. We design an output strategy by combining these two results. There are two advantages for this. The quality of the bounding boxes are greatly improved, which means vehicle parts feature point position can be located more precise. Meanwhile we preserve the position relationship between vehicle parts and effectively improve the validity and reliability of the result. By using our algorithm, the performance of the vehicle parts detection improve obviously compared with Faster RCNN.
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.
A Study on Control System Design Based on ARM Sea Target Search System
Directory of Open Access Journals (Sweden)
Lin Xinwei
2015-01-01
Full Text Available The infrared detector is used for sea target search, which can assist humans in searching suspicious objects at night and under poor visibility conditions, and improving search efficiency. This paper applies for interrupt and stack technology to solve problems of data losses that may be caused by one-to-many multi-byte protocol communication. Meanwhile, this paper implements hardware and software design of the system based on industrial-grade ARM control chip and uC / OS-II embedded operating system. The control system in the sea target search system is an information exchange and control center of the whole system, which solves the problem of controlling over the shooting angle of the infrared detector in the process of target search. After testing, the control system operates stably and reliably, and realizes rotation and control functions of the pan/tilt platform during automatic search, manual search and track.
Enhancing the CDF's B physics program with a faster data acquisition system
International Nuclear Information System (INIS)
Maksimovic, Petar
2011-01-01
The physics program of Run II at the Tevatron includes precision electroweak measurements such as the determination of the top quark and W boson masses; bottom and charm physics including the determination of the B s and D 0 mixing parameters; studies of the strong interaction; and searches for the Higgs particle, supersymmetric particles, hidden space-time dimensions and quark substructure. All of these measurements benefit from a high-resolution tracking detector. Most of them rely heavily on the efficient identification of heavy flavored B hadrons by detection of displaced secondary vertices, and are enhanced by the capability to trigger on tracks not coming from the primary vertex. This is uniquely provided by CDF's finely-segmented silicon detectors surrounding the interaction region. Thus CDF experiment's physics potential critically depends on the performance of its silicon detectors. The CDF silicon detectors were designed to operate up to 2-3 fb -1 of accumulated pji collisions, with an upgrade planned thereafter. However, the upgrade project was canceled in 2003 and Run II has been extended through 2011, with an expected total delivered integrated luminosity of 12 fb -1 or more. Several preventive measures were taken to keep the original detector operational and maintain its performance. The most important of these are the decrease in the operating temperature of the detector, which reduces the impact of radiation exposure, and measures to minimize damage due to integrated radiation dose, thermal cycles, and wire bond resonance conditions. Despite these measures the detectors operating conditions continue to change with issues arising from radiation damage to the sensors, aging infrastructure and electronics. These, together with the basic challenges posed by the inaccessibility of the detector volume and large number (about 750 thousand) of readout channels, make the silicon detector operations the single most complex and high priority job in the CDF
International Nuclear Information System (INIS)
Özyön, Serdar; Aydin, Doğan
2013-01-01
Highlights: ► Prohibited operating zone economic dispatch problem has been solved by IABC-LS. ► The losses used in the solution of the problem have been computed by B-loss matrix. ► IABC-LS method has been applied to three test systems in literature. ► The values obtained by IABC and IABC-LS are better than the results in literature. - Abstract: In this study, prohibited operating zone economic power dispatch problem which considers ramp rate limit, has been solved by incremental artificial bee colony algorithm (IABC) and incremental artificial bee colony algorithm with local search (IABC-LS) methods. The transmission line losses used in the solution of the problem have been computed by B-loss matrix. IABC, IABC-LS methods have been applied to three different test systems in literature which consist of 6, 15 and 40 generators. The attained optimum solution values have been compared with the optimum results in literature and have been discussed.
Jaffe-Dax, Sagi; Frenkel, Or; Ahissar, Merav
2017-01-24
Dyslexia is a prevalent reading disability whose underlying mechanisms are still disputed. We studied the neural mechanisms underlying dyslexia using a simple frequency-discrimination task. Though participants were asked to compare the two tones in each trial, implicit memory of previous trials affected their responses. We hypothesized that implicit memory decays faster among dyslexics. We tested this by increasing the temporal intervals between consecutive trials, and by measuring the behavioral impact and ERP responses from the auditory cortex. Dyslexics showed a faster decay of implicit memory effects on both measures, with similar time constants. Finally, faster decay of implicit memory also characterized the impact of sound regularities in benefitting dyslexics' oral reading rate. Their benefit decreased faster as a function of the time interval from the previous reading of the same non-word. We propose that dyslexics' shorter neural adaptation paradoxically accounts for their longer reading times, since it reduces their temporal window of integration of past stimuli, resulting in noisier and less reliable predictions for both simple and complex stimuli. Less reliable predictions limit their acquisition of reading expertise.
Features of the search profiles in the INIS-RS service
International Nuclear Information System (INIS)
Komatsubara, Yasutoshi
1982-01-01
Report is presented on the INIS-RS service being performed for nuclear people in Japan from 1979. Brief information on the INIS database and the retrieval system is stated in the first place. Analyses are made on the 322 items to reveal the composition and characteristics of the search profiles processed at the JAERI. Results are shown on the executing ratios of preliminaly search and of ranking retrieval with weighted descriptors. Each number of search terms and of logical operators used in each query is described with correlation of the number between terms and AND(*) operators. Descriptions are also given on the relevance ratio of the retrieval and number of the documents retrieved. (author)
An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization
Directory of Open Access Journals (Sweden)
Lihong Guo
2013-01-01
Full Text Available 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.
Berkeley automated supernova search
Energy Technology Data Exchange (ETDEWEB)
Kare, J.T.; Pennypacker, C.R.; Muller, R.A.; Mast, T.S.; Crawford, F.S.; Burns, M.S.
1981-01-01
The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982.
Berkeley automated supernova search
International Nuclear Information System (INIS)
Kare, J.T.; Pennypacker, C.R.; Muller, R.A.; Mast, T.S.
1981-01-01
The Berkeley automated supernova search employs a computer controlled 36-inch telescope and charge coupled device (CCD) detector to image 2500 galaxies per night. A dedicated minicomputer compares each galaxy image with stored reference data to identify supernovae in real time. The threshold for detection is m/sub v/ = 18.8. We plan to monitor roughly 500 galaxies in Virgo and closer every night, and an additional 6000 galaxies out to 70 Mpc on a three night cycle. This should yield very early detection of several supernovae per year for detailed study, and reliable premaximum detection of roughly 100 supernovae per year for statistical studies. The search should be operational in mid-1982
Lawrence, David Wyndham; Richards, Doug; Comper, Paul; Hutchison, Michael G
2018-01-01
To determine whether earlier time to initiation of aerobic exercise following acute concussion is associated with time to full return to (1) sport and (2) school or work. A retrospective stratified propensity score survival analysis of acute (≤14 days) concussion was used to determine whether time (days) to initiation of aerobic exercise post-concussion was associated with, both, time (days) to full return to (1) sport and (2) school or work. A total of 253 acute concussions [median (IQR) age, 17.0 (15.0-20.0) years; 148 (58.5%) males] were included in this study. Multivariate Cox regression models identified that earlier time to aerobic exercise was associated with faster return to sport and school/work adjusting for other covariates, including quintile propensity strata. For each successive day in delay to initiation of aerobic exercise, individuals had a less favourable recovery trajectory. Initiating aerobic exercise at 3 and 7 days following injury was associated with a respective 36.5% (HR, 0.63; 95% CI, 0.53-0.76) and 73.2% (HR, 0.27; 95% CI, 0.16-0.45) reduced probability of faster full return to sport compared to within 1 day; and a respective 45.9% (HR, 0.54; 95% CI, 0.44-0.66) and 83.1% (HR, 0.17; 95% CI, 0.10-0.30) reduced probability of faster full return to school/work. Additionally, concussion history, symptom severity, LOC deleteriously influenced concussion recovery. Earlier initiation of aerobic exercise was associated with faster full return to sport and school or work. This study provides greater insight into the benefits and safety of aerobic exercise within the first week of the injury.
Improving PHENIX search with Solr, Nutch and Drupal
International Nuclear Information System (INIS)
Morrison, Dave; Sourikova, Irina
2012-01-01
During its 20 years of R and D, construction and operation the PHENIX experiment at the Relativistic Heavy Ion Collider (RHIC) has accumulated large amounts of proprietary collaboration data that is hosted on many servers around the world and is not open for commercial search engines for indexing and searching. The legacy search infrastructure did not scale well with the fast growing PHENIX document base and produced results inadequate in both precision and recall. After considering the possible alternatives that would provide an aggregated, fast, full text search of a variety of data sources and file formats we decided to use Nutch [1] as a web crawler and Solr [2] as a search engine. To present XML-based Solr search results in a user-friendly format we use Drupal [3] as a web interface to Solr. We describe the experience of building a federated search for a heterogeneous collection of 10 million PHENIX documents with Nutch, Solr and Drupal.
Improving PHENIX search with Solr, Nutch and Drupal.
Morrison, Dave; Sourikova, Irina
2012-12-01
During its 20 years of R&D, construction and operation the PHENIX experiment at the Relativistic Heavy Ion Collider (RHIC) has accumulated large amounts of proprietary collaboration data that is hosted on many servers around the world and is not open for commercial search engines for indexing and searching. The legacy search infrastructure did not scale well with the fast growing PHENIX document base and produced results inadequate in both precision and recall. After considering the possible alternatives that would provide an aggregated, fast, full text search of a variety of data sources and file formats we decided to use Nutch [1] as a web crawler and Solr [2] as a search engine. To present XML-based Solr search results in a user-friendly format we use Drupal [3] as a web interface to Solr. We describe the experience of building a federated search for a heterogeneous collection of 10 million PHENIX documents with Nutch, Solr and Drupal.
Stochastic search techniques for post-fault restoration of electrical ...
Indian Academy of Sciences (India)
Three stochastic search techniques have been used to find the optimal sequence of operations required to restore supply in an electrical distribution system on the occurrence of a fault. The three techniques are the genetic algorithm,simulated annealing and the tabu search. The performance of these techniques has been ...
A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles
Directory of Open Access Journals (Sweden)
Ricardo Soto
2015-01-01
Full Text Available The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n2 × n2 grid, composed of n columns, n rows, and n subgrids, each one containing distinct integers from 1 to n2. 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.
Expertise in complex decision making: the role of search in chess 70 years after de Groot.
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.
Black-Box Search by Unbiased Variation
DEFF Research Database (Denmark)
Lehre, Per Kristian; Witt, Carsten
2012-01-01
The complexity theory for black-box algorithms, introduced by Droste, Jansen, and Wegener (Theory Comput. Syst. 39:525–544, 2006), describes common limits on the efficiency of a broad class of randomised search heuristics. There is an obvious trade-off between the generality of the black-box model...... and the strength of the bounds that can be proven in such a model. In particular, the original black-box model provides for well-known benchmark problems relatively small lower bounds, which seem unrealistic in certain cases and are typically not met by popular search heuristics.In this paper, we introduce a more...... restricted black-box model for optimisation of pseudo-Boolean functions which we claim captures the working principles of many randomised search heuristics including simulated annealing, evolutionary algorithms, randomised local search, and others. The key concept worked out is an unbiased variation operator...
Directory of Open Access Journals (Sweden)
Kim HyungTae
2015-01-01
Full Text Available Automatic lighting (auto-lighting is a function that maximizes the image quality of a vision inspection system by adjusting the light intensity and color.In most inspection systems, a single color light source is used, and an equal step search is employed to determine the maximum image quality. However, when a mixed light source is used, the number of iterations becomes large, and therefore, a rapid search method must be applied to reduce their number. Derivative optimum search methods follow the tangential direction of a function and are usually faster than other methods. In this study, multi-dimensional forms of derivative optimum search methods are applied to obtain the maximum image quality considering a mixed-light source. The auto-lighting algorithms were derived from the steepest descent and conjugate gradient methods, which have N-size inputs of driving voltage and one output of image quality. Experiments in which the proposed algorithm was applied to semiconductor patterns showed that a reduced number of iterations is required to determine the locally maximized image quality.
Optimal Semi-Adaptive Search With False Targets
2017-12-01
Kress, K. Y. Lin, and R. Szechtman, “Optimal discrete search with imperfect specificity,” Math Meth Oper Res, vol. 68, pp. 539–549, 2008. [16] L. D...constraints on employment of physical search assets will involve discrete approximations to the continuous solutions given by these techniques. These...model assumes. We optimize in the continuous case, to be able then to make the best possible discrete approximations if needed, given the constraints of a
Detection of emotional faces: salient physical features guide effective visual search.
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).
Minimalist instruction for learning to search the World Wide Web
Lazonder, Adrianus W.
2001-01-01
This study examined the efficacy of minimalist instruction to develop self-regulatory skills involved in Web searching. Two versions of minimalist self-regulatory skill instruction were compared to a control group that was merely taught procedural skills to operate the search engine. Acquired skills
Search and nonsearch protocols for radiographic consultation
International Nuclear Information System (INIS)
Swensson, R.G.; Theodore, G.H.
1989-01-01
Six radiologists, acting as film reviewers, used two different consultation protocols to differentiate among 292 ambiguous findings on chest films: 120 simulated nodules and 172 normal findings (previous readers' false-positive reports of nodules). The non-search protocol identified each finding (by location), and reviewers rated its likelihood as a nodule. The search protocol, which asked reviewers to report and rate all locations regarded as possible nodules on each film, assigned a default negative rating to any unreported finding (nodule or normal). Receiver operator characteristic analyses demonstrated a significantly higher accuracy for each reviewer's search- protocol discriminations between these nodules and confusing normal findings
International Nuclear Information System (INIS)
Menhas, Muhammad Ilyas; Fei Minrui; Wang Ling; Qian Lin
2012-01-01
Highlights: ► We extend the concept of co-operation and co-evolution in some PSO variants. ► We use developed co-operative PSOs in multivariable PID controller design/tuning. ► We find that co-operative PSOs converge faster and give high quality solutions. ► Dividing the search space among swarms improves search efficiency. ► The proposed methods allow the practitioner for heterogeneous problem formulation. - Abstract: In this paper, multivariable PID controller design based on cooperative and coevolving multiple swarms is demonstrated. A simplified multi-variable MIMO process model of a ball mill pulverizing system with steady state decoupler is considered. In order to formulate computational models of cooperative and coevolving multiple swarms three different algorithms like real coded PSO, discrete binary PSO (DBPSO) and probability based discrete binary PSO (PBPSO) are employed. Simulations are carried out on three composite functions simultaneously considering multiple objectives. The cooperative and coevolving multiple swarms based results are compared with the results obtained through single swarm based methods like real coded particle swarm optimization (PSO), discrete binary PSO (DBPSO), and probability based discrete binary PSO (PBPSO) algorithms. The cooperative and coevolving swarms based techniques outperform the real coded PSO, PBPSO, and the standard discrete binary PSO (DBPSO) algorithm in escaping from local optima. Furthermore, statistical analysis of the simulation results is performed to calculate the comparative reliability of various techniques. All of the techniques employed are suitable for controller tuning, however, the multiple cooperative and coevolving swarms based results are considerably better in terms of mean fitness, variance of fitness, and success rate in finding a feasible solution in comparison to those obtained using single swarm based methods.
Airborne Radar Search for Diesel Submarines (ARSDS)
National Research Council Canada - National Science Library
Pilnick, Steven E; Landa, Jose
2005-01-01
.... In this research, a detection rate model is developed to analyze the effectiveness of an airborne radar search for a diesel submarine assumed to be intermittently operating with periscopes or masts...
CBP Customs Rulings Online Search System (CROSS)
Department of Homeland Security — CROSS is a searchable database of CBP rulings that can be retrieved based on simple or complex search characteristics using keywords and Boolean operators. CROSS has...
Search in the product market and the real business cycle
Mathä, Thomas Y.; Pierrard, Olivier
2009-01-01
Abstract Abstract Empirical evidence suggests that most firms operate in imperfectly competitive markets. We develop a search-matching model between wholesalers and retailers. Firms face search costs and form long-term relationships. Price bargain results in both wholesaler and retailer markups, which depend on firms? relative bargaining power. We simulate the general equilibrium model and explore the role of product market search frictions for business cycles. We conclu...
Avila, Irene; Lin, Shih-Chieh
2014-03-01
The survival of animals depends critically on prioritizing responses to motivationally salient stimuli. While it is generally believed that motivational salience increases decision speed, the quantitative relationship between motivational salience and decision speed, measured by reaction time (RT), remains unclear. Here we show that the neural correlate of motivational salience in the basal forebrain (BF), defined independently of RT, is coupled with faster and also more precise decision speed. In rats performing a reward-biased simple RT task, motivational salience was encoded by BF bursting response that occurred before RT. We found that faster RTs were tightly coupled with stronger BF motivational salience signals. Furthermore, the fraction of RT variability reflecting the contribution of intrinsic noise in the decision-making process was actively suppressed in faster RT distributions with stronger BF motivational salience signals. Artificially augmenting the BF motivational salience signal via electrical stimulation led to faster and more precise RTs and supports a causal relationship. Together, these results not only describe for the first time, to our knowledge, the quantitative relationship between motivational salience and faster decision speed, they also reveal the quantitative coupling relationship between motivational salience and more precise RT. Our results further establish the existence of an early and previously unrecognized step in the decision-making process that determines both the RT speed and variability of the entire decision-making process and suggest that this novel decision step is dictated largely by the BF motivational salience signal. Finally, our study raises the hypothesis that the dysregulation of decision speed in conditions such as depression, schizophrenia, and cognitive aging may result from the functional impairment of the motivational salience signal encoded by the poorly understood noncholinergic BF neurons.
PLAST: parallel local alignment search tool for database comparison
Directory of Open Access Journals (Sweden)
Lavenier Dominique
2009-10-01
Full Text Available Abstract Background Sequence similarity searching is an important and challenging task in molecular biology and next-generation sequencing should further strengthen the need for faster algorithms to process such vast amounts of data. At the same time, the internal architecture of current microprocessors is tending towards more parallelism, leading to the use of chips with two, four and more cores integrated on the same die. The main purpose of this work was to design an effective algorithm to fit with the parallel capabilities of modern microprocessors. Results A parallel algorithm for comparing large genomic banks and targeting middle-range computers has been developed and implemented in PLAST software. The algorithm exploits two key parallel features of existing and future microprocessors: the SIMD programming model (SSE instruction set and the multithreading concept (multicore. Compared to multithreaded BLAST software, tests performed on an 8-processor server have shown speedup ranging from 3 to 6 with a similar level of accuracy. Conclusion A parallel algorithmic approach driven by the knowledge of the internal microprocessor architecture allows significant speedup to be obtained while preserving standard sensitivity for similarity search problems.
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 cont...
Jordi, A; Ferrer, M I; Vizoso, G; Orfila, A; Basterretxea, G; Casas, B; Alvarez, A; Roig, D; Garau, B; Martínez, M; Fernández, V; Fornés, A; Ruiz, M; Fornós, J J; Balaguer, P; Duarte, C M; Rodríguez, I; Alvarez, E; Onken, R; Orfila, P; Tintoré, J
2006-01-01
The oil spill from Prestige tanker showed the importance of scientifically based protocols to minimize the impacts on the environment. In this work, we describe a new forecasting system to predict oil spill trajectories and their potential impacts on the coastal zone. The system is formed of three main interconnected modules that address different capabilities: (1) an operational circulation sub-system that includes nested models at different scales, data collection with near-real time assimilation, new tools for initialization or assimilation based on genetic algorithms and feature-oriented strategic sampling; (2) an oil spill coastal sub-system that allows simulation of the trajectories and fate of spilled oil together with evaluation of coastal zone vulnerability using environmental sensitivity indexes; (3) a risk management sub-system for decision support based on GIS technology. The system is applied to the Mediterranean Sea where surface currents are highly variable in space and time, and interactions between local, sub-basin and basin scale increase the non-linear interactions effects which need to be adequately resolved at each one of the intervening scales. Besides the Mediterranean Sea is a complex reduced scale ocean representing a real scientific and technological challenge for operational oceanography and particularly for oil spill response and search and rescue operations.
Faster than light motion does not imply time travel
International Nuclear Information System (INIS)
Andréka, Hajnal; Madarász, Judit X; Németi, István; Székely, Gergely; Stannett, Mike
2014-01-01
Seeing the many examples in the literature of causality violations based on faster than light (FTL) signals one naturally thinks that FTL motion leads inevitably to the possibility of time travel. We show that this logical inference is invalid by demonstrating a model, based on (3+1)-dimensional Minkowski spacetime, in which FTL motion is permitted (in every direction without any limitation on speed) yet which does not admit time travel. Moreover, the Principle of Relativity is true in this model in the sense that all observers are equivalent. In short, FTL motion does not imply time travel after all. (paper)
Directory of Open Access Journals (Sweden)
Fei Wang
2017-11-01
Full Text Available The optimal dispatching model for a stand-alone microgrid (MG is of great importance to its operation reliability and economy. This paper aims at addressing the difficulties in improving the operational economy and maintaining the power balance under uncertain load demand and renewable generation, which could be even worse in such abnormal conditions as storms or abnormally low or high temperatures. A new two-time scale multi-objective optimization model, including day-ahead cursory scheduling and real-time scheduling for finer adjustments, is proposed to optimize the operational cost, load shedding compensation and environmental benefit of stand-alone MG through controllable load (CL and multi-distributed generations (DGs. The main novelty of the proposed model is that the synergetic response of CL and energy storage system (ESS in real-time scheduling offset the operation uncertainty quickly. And the improved dispatch strategy for combined cooling-heating-power (CCHP enhanced the system economy while the comfort is guaranteed. An improved algorithm, Search Improvement Process-Chaotic Optimization-Particle Swarm Optimization-Elite Retention Strategy (SIP-CO-PSO-ERS algorithm with strong searching capability and fast convergence speed, was presented to deal with the problem brought by the increased errors between actual renewable generation and load and prior predictions. Four typical scenarios are designed according to the combinations of day types (work day or weekend and weather categories (sunny or rainy to verify the performance of the presented dispatch strategy. The simulation results show that the proposed two-time scale model and SIP-CO-PSO-ERS algorithm exhibit better performance in adaptability, convergence speed and search ability than conventional methods for the stand-alone MG’s operation.
A visual assistance environment for cyclotron operation
International Nuclear Information System (INIS)
Okamura, Tetsuya; Murakami, Tohru; Agematsu, Takashi; Okumura, Susumu; Arakawa, Kazuo.
1993-01-01
A computer-based operation system for a cyclotron which assists inexperienced operators has been developed. Cyclotron start-up operations require dozens of adjustable parameters to be finely tuned to maximize extracted beam current. The human interfaces of the system provide a visual environment designed to enhance beam parameter adjustments. First, the mental model of operators is analyzed. It is supposed to be composed of five partial mental models: beam behavior model, feasible setting regions model, parameter sensitivity model, parameter mutual relation model, and status map model. Next, based on these models, three visual interfaces are developed, i.e., (1) Beam trajectory is rapidly calculated and graphically displayed whenever the operators change the cyclotron parameters. (2) Feasible setting regions (FSR) of the parameters that satisfy the cyclotron's beam acceptance criteria are indicated. (3) Search traces, being a historical visual map of beam current values, are superimposed on the FSRs. Finally, to evaluate system effectiveness, the search time required to reach maximum beam current conditions was measured. In addition, system operability was evaluated using written questionnaires. Results of the experiment showed that the search time to reach specific beam conditions was reduced by approximately 65% using these interfaces. The written questionnaires survey showed the operators highly evaluate system operability. (author)
Faster recovery of a diatom from UV damage under ocean acidification.
Wu, Yaping; Campbell, Douglas A; Gao, Kunshan
2014-11-01
Diatoms are the most important group of primary producers in marine ecosystems. As oceanic pH declines and increased stratification leads to the upper mixing layer becoming shallower, diatoms are interactively affected by both lower pH and higher average exposures to solar ultraviolet radiation. The photochemical yields of a model diatom, Phaeodactylum tricornutum, were inhibited by ultraviolet radiation under both growth and excess light levels, while the functional absorbance cross sections of the remaining photosystem II increased. Cells grown under ocean acidification (OA) were less affected during UV exposure. The recovery of PSII under low photosynthetically active radiation was much faster than in the dark, indicating that photosynthetic processes were essential for the full recovery of photosystem II. This light dependent recovery required de novo synthesized protein. Cells grown under ocean acidification recovered faster, possibly attributable to higher CO₂ availability for the Calvin cycle producing more resources for repair. The lower UV inhibition combined with higher recovery rate under ocean acidification could benefit species such as P.tricornutum, and change their competitiveness in the future ocean. Copyright © 2014 Elsevier B.V. All rights reserved.
Attribute-based proxy re-encryption with keyword search.
Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo
2014-01-01
Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (ABRKS), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, ABRKS allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for ABRKS, and propose two concrete constructions for ABRKS: key-policy ABRKS and ciphertext-policy ABRKS. In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography.
Attribute-Based Proxy Re-Encryption with Keyword Search
Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo
2014-01-01
Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for , and propose two concrete constructions for : key-policy and ciphertext-policy . In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography. PMID:25549257
On the Right for Lawful Court in Investigation and Search Activities
Directory of Open Access Journals (Sweden)
Chechetin A. E.
2012-05-01
Full Text Available On the basis of the existing federal legislation and decisions of the Constitutional Court of the Russian Federation the author reveals and analyzes jurisdiction of the petition of the agency which conducts investigation and search operations, with the help of an example, i.e. conducting investigation and search operations concerning the judge of the Region Court in Rostov-on-Don with the purpose of verification the information about extortion of a bribe by him
78 FR 18479 - Drawbridge Operation Regulations; Pass Manchac, LA
2013-03-27
... governing the operation of the Canadian National (CN) Railroad automated bascule span drawbridge across Pass....gov . Type the docket number in the ``SEARCH'' box and click ``SEARCH.'' Click on Open Docket Folder... Operations, telephone 202-366-9826. SUPPLEMENTARY INFORMATION: The CN Railroad has requested a temporary...
Experimental study of electromagnetic radiation from a faster-than-light vacuum macroscopic source
Energy Technology Data Exchange (ETDEWEB)
Bessarab, A.V. [Russian Federal Nuclear Center-All-Russia Scientific Research Institute of Experimental Physics, Sarov, Nizhni Novgorod region, 607188 (Russian Federation); Martynenko, S.P. [Russian Federal Nuclear Center-All-Russia Scientific Research Institute of Experimental Physics, Sarov, Nizhni Novgorod region, 607188 (Russian Federation); Prudkoi, N.A. [Russian Federal Nuclear Center-All-Russia Scientific Research Institute of Experimental Physics, Sarov, Nizhni Novgorod region, 607188 (Russian Federation); Soldatov, A.V. [Russian Federal Nuclear Center-All-Russia Scientific Research Institute of Experimental Physics, Sarov, Nizhni Novgorod region, 607188 (Russian Federation)]. E-mail: soldatov@vniief.ru; Terekhin, V.A. [Russian Federal Nuclear Center-All-Russia Scientific Research Institute of Experimental Physics, Sarov, Nizhni Novgorod region, 607188 (Russian Federation)
2006-08-15
The effect which manifests itself in the form of directed electromagnetic pulses (EMP) initiated by an X-ray incident obliquely upon a conducting surface has been confirmed and investigated experimentally in detail. A planar accelerating diode comprising a metallic cathode and grid anode was initiated with an oblique short soft-X-ray pulse from a point laser-plasma source. Then a source of directed EMP-a current of accelerated photoelectrons-was formed whose boundary ran along the anode external surface with a faster-than-light velocity. The plasma was formed when short-pulse ({approx}0.3ns) laser radiation from ISKRA-5 facility was focused on a plane Au target. The amplitude-in-time and spatial characteristics of radiation emitted by the faster-than-light source have been measured. Parameters of the accelerated electron current have been measured too.
Automated Planning and Scheduling for Planetary Rover Distributed Operations
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.
Searching the PASCAL database - A user's perspective
Jack, Robert F.
1989-01-01
The operation of PASCAL, a bibliographic data base covering broad subject areas in science and technology, is discussed. The data base includes information from about 1973 to the present, including topics in engineering, chemistry, physics, earth science, environmental science, biology, psychology, and medicine. Data from 1986 to the present may be searched using DIALOG. The procedures and classification codes for searching PASCAL are presented. Examples of citations retrieved from the data base are given and suggestions are made concerning when to use PASCAL.
Distributed Kernelized Locality-Sensitive Hashing for Faster Image Based Navigation
2015-03-26
using MapReduce was described by Moise et al. in their paper, “Indexing and searching 100 million images with map-reduce” [9]. They modified the...D. Moise , D. Shestakov, G. Gudmundsson, and L. Amsaleg, “Indexing and Searching 100M Images with Map-Reduce,” in Proceedings of the 3rd ACM con
Lost in the supermarket: Quantifying the cost of partitioning memory sets in hybrid search.
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.
Directory of Open Access Journals (Sweden)
Sunxin Wang
2014-01-01
Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.
The Faster, Better, Cheaper Approach to Space Missions: An Engineering Management Assessment
Hamaker, Joseph W.
1999-01-01
NASA was chartered as an independent civilian space agency in 1958 following the Soviet Union's dramatic launch of the Sputnik 1 (1957). In his state of the union address in May of 1961, President Kennedy issued to the fledging organization his famous challenge for a manned lunar mission by the end of the decade. The Mercury, Gemini and Apollo programs that followed put the utmost value on high quality, low risk (as low as possible within the context of space flight), quick results, all with little regard for cost. These circumstances essentially melded NASAs culture as an organization capable of great technological achievement but at extremely high cost. The Space Shuttle project, the next major agency endeavor, was put under severe annual budget constraints in the 1970's. NASAs response was to hold to the high quality standards, low risk and annual cost and let schedule suffer. The result was a significant delay in the introduction of the Shuttle as well as overall total cost growth. By the early 1990's, because NASA's budget was declining, the number of projects was also declining. Holding the same cost and schedule productivity levels as before was essentially causing NASA to price itself out of business. In 1992, the helm of NASA was turned over to a new Administrator. Dan Goldin's mantra was "faster, better, cheaper" and his enthusiasm and determination to change the NASA culture was not to be ignored. This research paper documents the various implementations of "faster, better, cheaper" that have been attempted, analyzes their impact and compares the cost performance of these new projects to previous NASA benchmarks. Fundamentally, many elements of "faster, better, cheaper" are found to be working well, especially on smaller projects. Some of the initiatives are found to apply only to smaller or experimental projects however, so that extrapolation to "flagship" projects may be problematic.
DOE translation tool: Faster and better than ever
International Nuclear Information System (INIS)
El-Chakieh, T.; Vincent, C.
2006-01-01
CAE's constant push to advance power plant simulation practices involves continued investment in our technologies. This commitment has yielded many advances in our simulation technologies and tools to provide faster maintenance updates, easier process updates and higher fidelity models for power plant simulators. Through this quest, a comprehensive, self-contained and user-friendly DCS translation tool for plant control system emulation was created. The translation tool converts an ABB Advant AC160 and/or AC450 control system, used in both gas turbine-based, fossil and nuclear power plants, into Linux or Windows-based ROSE[reg] simulation schematics. The translation for a full combined-cycle gas turbine (CCGT) plant that comprises more than 5,300 function plans distributed over 15 nodes is processed in less than five hours on a dual 2.8Ghz Xeon Linux platform in comparison to the 12 hours required by CAE's previous translation tool. The translation process, using the plant configuration files, includes the parsing of the control algorithms, the databases, the graphic and the interconnection between nodes. A Linux or Windows API is then used to automatically populate the ROSE[reg] database. Without such a translation, tool or if ?stimulation? of real control system is not feasible or too costly, simulation of the DCS manually takes months of error prone manual coding. The translation can be performed for all the nodes constituting the configuration files of the whole plant DCS, or in order to provide faster maintenance updates and easier process updates, partial builds are possible at 3 levels: a. single schematic updates, b. multi-schematic updates and c. single node updates based on the user inputs into the Graphical User Interface. improvements including: - Process time reduction of over 60%; - All communication connections between nodes are fully automated; - New partial build for one schematic, a group of schematics or a single node; - Availability on PC
Faster and more accurate transport procedures for HZETRN
International Nuclear Information System (INIS)
Slaba, T.C.; Blattnig, S.R.; Badavi, F.F.
2010-01-01
The deterministic transport code HZETRN was developed for research scientists and design engineers studying the effects of space radiation on astronauts and instrumentation protected by various shielding materials and structures. In this work, several aspects of code verification are examined. First, a detailed derivation of the light particle (A ≤ 4) and heavy ion (A > 4) numerical marching algorithms used in HZETRN is given. References are given for components of the derivation that already exist in the literature, and discussions are given for details that may have been absent in the past. The present paper provides a complete description of the numerical methods currently used in the code and is identified as a key component of the verification process. Next, a new numerical method for light particle transport is presented, and improvements to the heavy ion transport algorithm are discussed. A summary of round-off error is also given, and the impact of this error on previously predicted exposure quantities is shown. Finally, a coupled convergence study is conducted by refining the discretization parameters (step-size and energy grid-size). From this study, it is shown that past efforts in quantifying the numerical error in HZETRN were hindered by single precision calculations and computational resources. It is determined that almost all of the discretization error in HZETRN is caused by the use of discretization parameters that violate a numerical convergence criterion related to charged target fragments below 50 AMeV. Total discretization errors are given for the old and new algorithms to 100 g/cm 2 in aluminum and water, and the improved accuracy of the new numerical methods is demonstrated. Run time comparisons between the old and new algorithms are given for one, two, and three layer slabs of 100 g/cm 2 of aluminum, polyethylene, and water. The new algorithms are found to be almost 100 times faster for solar particle event simulations and almost 10 times
They all like it hot: faster cleanup of contaminated soil and groundwater
Energy Technology Data Exchange (ETDEWEB)
Newmark, R., LLNL
1998-03-01
Clean up a greasy kitchen spill with cold water and the going is slow. Us hot water instead and progress improves markedly. So it makes sense that cleanup of greasy underground contaminants such as gasoline might go faster if hot water or steam were somehow added to the process. The Environmental Protection Agency named hundreds of sites to the Superfund list - sites that have been contaminated with petroleum products or petroleum products or solvents. Elsewhere across the country, thousands of properties not identified on federal cleanup lists are contaminated as well. Given that under current regulations, underground accumulations of solvent and hydrocarbon contaminants (the most serious cause of groundwater pollution) must be cleaned up, finding a rapid and effective method of removing them is imperative. In the early 1990`s, in collaboration with the School of Engineering at the University of California at Berkeley, Lawrence Livermore developed dynamic underground stripping. This method for treating underground contaminants with heat is much faster and more effective than traditional treatment methods.
Levy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments
International Nuclear Information System (INIS)
Pasternak, Zohar; Grasso, Frank W; Bartumeus, Frederic
2009-01-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 Levy-taxis that, under certain conditions, located odor plumes significantly faster and with a better success rate than other search strategies such as Levy 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, Levy-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 accommodates 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
Levy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments
Energy Technology Data Exchange (ETDEWEB)
Pasternak, Zohar; Grasso, Frank W [BioMimetic and Cognitive Robotics Laboratory, Department of Psychology, Brooklyn College, The City University of New York, 2900 Bedford Avenue, Brooklyn 11210, NY (United States); Bartumeus, Frederic [Department of Ecology and Evolutionary Biology and Princeton Environmental Institute, 106 Guyot Hall, Princeton University, Princeton 08544, NJ (United States)], E-mail: zpast@yahoo.com
2009-10-30
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 Levy-taxis that, under certain conditions, located odor plumes significantly faster and with a better success rate than other search strategies such as Levy 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, Levy-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 accommodates 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
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.
How social information affects information search and choice in probabilistic inferences.
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.
Evolution of a search: the use of dynamic twitter searches during superstorm sandy.
Harris Smith, Sara; Bennett, Kelly J; Livinski, Alicia A
2014-09-26
Twitter has emerged as a critical source of free and openly available information during emergency response operations, providing an unmatched level of on-the-ground situational awareness in real-time. Responders and survivors turn to Twitter to share information and resources within communities, conduct rumor control, and provide a "boots on the ground" understanding of the disaster. However, the ability to tune out background "noise" is essential to effectively utilizing Twitter to identify important and useful information during an emergency response. This article highlights a two-prong strategy in which the use of a Twitter list paired with subject specific Boolean searches provided increased situational awareness and early event detection during the United States Department of Health and Human Services (HHS), Office of the Assistant Secretary for Preparedness and Response (ASPR) response to Superstorm Sandy in 2012. To maximize the amount of relevant information that was retrieved, the Twitter list and Boolean searches were dynamic and responsive to real-time developments, evolving health threats, and the informational needs of decision-makers. The use of a Twitter list combined with Boolean searches led to enhanced situational awareness throughout the HHS response. The incorporation of a dynamic search strategy over the course of the HHS Sandy response, allowed for the ability to account for over-tweeted information, changes in event related conversation, and decreases in the return of relevant information.
Searching for heavy photons in the HPS Experiment
Energy Technology Data Exchange (ETDEWEB)
Uemura, Sho [SLAC National Accelerator Lab., Menlo Park, CA (United States)
2016-11-01
The Heavy Photon Search (HPS) is a new experiment at Jefferson Lab that searches for a massive U(1) vector boson (known as a heavy photon or A′) in the MeV-GeV mass range and coupling weakly to ordinary matter through a kinetic mixing interaction. The HPS experiment seeks to produce heavy photons by electron bremsstrahlung on a fixed target, is sensitive to heavy photon decays to e+e-, and targets the range in heavy photon mass m_A' ~ 20 - 600 MeV, and kinetic mixing strength epsilon^2 ~ 10^-5 - 10^−10. HPS searches for heavy photons using two signatures: a narrow mass resonance and displaced vertices. This dissertation presents the theoretical and experimental motivations for a heavy photon, the design and operation of the HPS experiment, and the displaced vertex search. The data used in this dissertation is the unblinded fraction of the 2015 HPS run, for the period of operation where the HPS silicon vertex tracker (SVT) was operated at its nominal position. This data was recorded from May 13 to May 18, 2015, at a beam energy of 1.056 GeV and a nominal beam current of 50 nA. The integrated luminosity is 119 nb^-1, which is equivalent to 0.172 days of ideal running at the nominal beam current. This dissertation presents results (signal significance and upper limits) from the displaced vertex search in the mass range m_A' ~ 20 - 60 MeV, and kinetic mixing strength epsilon^2 ~ 2 × 10^-8 - 10^-10. This search does not have sufficient sensitivity to exclude a canonical heavy photon at any combination of m_A' and epsilon^2. The strictest limit achieved in this analysis on the production of a particle that decays like a heavy photon is 115 times the expected production cross-section for a heavy photon. Factors limiting the sensitivity of this analysis are discussed. Projections of HPSperformance with the full 2015 data set, and with planned improvements to theanalysis, are presented. Comparisons are also made to earlier reach estimates.
Brief Report: Consistency of Search Engine Rankings for Autism Websites
Reichow, Brian; Naples, Adam; Steinhoff, Timothy; Halpern, Jason; Volkmar, Fred R.
2012-01-01
The World Wide Web is one of the most common methods used by parents to find information on autism spectrum disorders and most consumers find information through search engines such as Google or Bing. However, little is known about how the search engines operate or the consistency of the results that are returned over time. This study presents the…
Mohammadi, Roghayeh; Ershad, Navid; Rezayinejad, Marziyeh; Fatemi, Elham; Phadke, Chetan P
2017-09-01
To examine the functional effects of walking retraining at faster than self-selected speed (SSS). Ten individuals with chronic stroke participated in a 4-week training over a treadmill at walking speeds 40% faster than SSS, three times per week, 30 min/session. Outcome measures assessed before, after, and 2 months after the end of intervention were the Timed Up and Go, the 6-Minute Walk, the 10-Meter Walk test, the Modified Ashworth Scale, SSS, and fastest comfortable speed. After 4 weeks of training, all outcome measures showed clinically meaningful and statistically significant improvements (Ptraining. The results showed that a strategy of training at a speed 40% faster than SSS can improve functional activity in individuals with chronic stroke, with effects lasting up to 2 months after the intervention.
Russell-Rose, Tony; Chamberlain, Jon
2017-01-01
Background Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. Objective The aim of this study was to investigate the search behavior of healthcare inform...
Knowledge-Based operation planning system for boiling water reactors
International Nuclear Information System (INIS)
Tatsuya Iwamoto; Shungo Sakurai; Hitoshi Uematsu; Makoto Tsuiki
1987-01-01
A knowledge-Based Boiling Water Reactor operation planning system was developed to support core operators or core management engineers in making core operation plans, by automatically generating suboptimum core operation procedures. The procedures are obtained by searching a branching tree of the possible core status (nodes) and the elementary operations to change the core status (branches). A path that ends at the target node, and contains only operationally feasible nodes can be a candidate of the solution. The core eigenvalue, the power distribution and the thermal limit parameters at key points are calculated by running a three-dimensional (3-D) BWR core physics simulator to examine the feasibility of the nodes and the performance of candidates. To obtain a practically acceptable solution within a reasonable time rather than making a time-consuming effort to get the optimum one, the Depth-First-Search method, together with the heuristic branch-bounding, was used to search the branching tree. The system was applied to actual operation plannings with real plant data, and gave satisfactory results. It can be concluded that the system can be applied to generate core operation procedures as a substitute for core management experts
Investigating the Mpemba Effect: When Hot Water Freezes Faster than Cold Water
Ibekwe, R. T.; Cullerne, J. P.
2016-01-01
Under certain conditions a body of hot liquid may cool faster and freeze before a body of colder liquid, a phenomenon known as the Mpemba Effect. An initial difference in temperature of 3.2 °C enabled warmer water to reach 0 °C in 14% less time than colder water. Convection currents in the liquid generate a temperature gradient that causes more…
Directory of Open Access Journals (Sweden)
Andy M Reynolds
2007-04-01
Full Text Available During their trajectories in still air, fruit flies (Drosophila melanogaster explore their landscape using a series of straight flight paths punctuated by rapid 90 degrees body-saccades [1]. Some saccades are triggered by visual expansion associated with collision avoidance. Yet many saccades are not triggered by visual cues, but rather appear spontaneously. Our analysis reveals that the control of these visually independent saccades and the flight intervals between them constitute an optimal scale-free active searching strategy. Two characteristics of mathematical optimality that are apparent during free-flight in Drosophila are inter-saccade interval lengths distributed according to an inverse square law, which does not vary across landscape scale, and 90 degrees saccade angles, which increase the likelihood that territory will be revisited and thereby reduce the likelihood that near-by targets will be missed. We also show that searching is intermittent, such that active searching phases randomly alternate with relocation phases. Behaviorally, this intermittency is reflected in frequently occurring short, slow speed inter-saccade intervals randomly alternating with rarer, longer, faster inter-saccade intervals. Searching patterns that scale similarly across orders of magnitude of length (i.e., scale-free have been revealed in animals as diverse as microzooplankton, bumblebees, albatrosses, and spider monkeys, but these do not appear to be optimised with respect to turning angle, whereas Drosophila free-flight search does. Also, intermittent searching patterns, such as those reported here for Drosophila, have been observed in foragers such as planktivorous fish and ground foraging birds. Our results with freely flying Drosophila may constitute the first reported example of searching behaviour that is both scale-free and intermittent.
Directory of Open Access Journals (Sweden)
Salvator Abreu
2009-10-01
Full Text Available We explore the use of the Cell Broadband Engine (Cell/BE for short for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16 SPUs per blade. This algorithm was chosen because it fits very well the Cell/BE architecture and requires neither shared memory nor communication between processors, while retaining a compact memory footprint. We study the performance on several large optimization benchmarks and show that this achieves mostly linear time speedups, even sometimes super-linear. This is possible because the parallel implementation might explore simultaneously different parts of the search space and therefore converge faster towards the best sub-space and thus towards a solution. Besides getting speedups, the resulting times exhibit a much smaller variance, which benefits applications where a timely reply is critical.
The Search Performance Evaluation and Prediction in Exploratory Search
LIU, FEI
2016-01-01
The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...
Optimization of boiling water reactor control rod patterns using linear search
International Nuclear Information System (INIS)
Kiguchi, T.; Doi, K.; Fikuzaki, T.; Frogner, B.; Lin, C.; Long, A.B.
1984-01-01
A computer program for searching the optimal control rod pattern has been developed. The program is able to find a control rod pattern where the resulting power distribution is optimal in the sense that it is the closest to the desired power distribution, and it satisfies all operational constraints. The search procedure consists of iterative uses of two steps: sensitivity analyses of local power and thermal margins using a three-dimensional reactor simulator for a simplified prediction model; linear search for the optimal control rod pattern with the simplified model. The optimal control rod pattern is found along the direction where the performance index gradient is the steepest. This program has been verified to find the optimal control rod pattern through simulations using operational data from the Oyster Creek Reactor
Analysis of Operating Temperature of the Polycrystalline Solar Cell
Directory of Open Access Journals (Sweden)
Vladimír GÁLL
2017-12-01
Full Text Available This work deals with the solar cells with orientation on the calculation of operating temperature of the polycrystalline solar cell, which is under actual load. Operating conditions have a significant effect on the efficiency of solar cells. In the summer with increasing temperature, the efficiency decreases. In the winter, efficiency and output voltage are rising. The operating temperature is determined by intensity of solar radiation, the types of materials used by construction and operating condition. The aim of this work was simplify of the calculation of operating temperature of solar cells. The result of this work is a derived equation that allows a more accurate and faster calculation this temperature with using Matlab software.
Directory of Open Access Journals (Sweden)
Yu Liu
2015-01-01
Full Text Available The Smith-Waterman (SW algorithm has been widely utilized for searching biological sequence databases in bioinformatics. Recently, several works have adopted the graphic card with Graphic Processing Units (GPUs and their associated CUDA model to enhance the performance of SW computations. However, these works mainly focused on the protein database search by using the intertask parallelization technique, and only using the GPU capability to do the SW computations one by one. Hence, in this paper, we will propose an efficient SW alignment method, called CUDA-SWfr, for the protein database search by using the intratask parallelization technique based on a CPU-GPU collaborative system. Before doing the SW computations on GPU, a procedure is applied on CPU by using the frequency distance filtration scheme (FDFS to eliminate the unnecessary alignments. The experimental results indicate that CUDA-SWfr runs 9.6 times and 96 times faster than the CPU-based SW method without and with FDFS, respectively.
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.
A Search for Dark Matter with a continuously sensitive Bubble Chamber.
CERN. Geneva
2012-01-01
COUPP is a dark matter search experiment located underground at SNOLAB which exploits continuously sensitive room temperature heavy liquid bubble chambers as nuclear recoil detectors to search for dark matter. The theory of operation of a bubble chamber as a dark matter detector, recent results, and future plans will be discussed.
Directory of Open Access Journals (Sweden)
Tinggui Chen
2014-01-01
Full Text Available Artificial bee colony (ABC algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA, artificial colony optimization (ACO, and particle swarm optimization (PSO. However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments.
Radon-related Backgrounds in the LUX Dark Matter Search
Bradley, A.; Akerib, D. S.; Araújo, H. M.; Bai, X.; Bailey, A. J.; Balajthy, J.; Bernard, E.; Bernstein, A.; Byram, D.; Cahn, S. B.; Carmona-Benitez, M. C.; Chan, C.; Chapman, J. J.; Chiller, A. A.; Chiller, C.; Coffey, T.; Currie, A.; de Viveiros, L.; Dobi, A.; Dobson, J.; Druszkiewicz, E.; Edwards, B.; Faham, C. H.; Fiorucci, S.; Flores, C.; Gaitskell, R. J.; Gehman, V. M.; Ghag, C.; Gibson, K. R.; Gilchriese, M. G. D.; Hall, C.; Hertel, S. A.; Horn, M.; Huang, D. Q.; Ihm, M.; Jacobsen, R. G.; Kazkaz, K.; Knoche, R.; Larsen, N. A.; Lee, C.; Lindote, A.; Lopes, M. I.; Malling, D. C.; Mannino, R.; McKinsey, D. N.; Mei, D.-M.; Mock, J.; Moongweluwan, M.; Morad, J.; Murphy, A. St. J.; Nehrkorn, C.; Nelson, H.; Neves, F.; Ott, R. A.; Pangilinan, M.; Parker, P. D.; Pease, E. K.; Pech, K.; Phelps, P.; Reichhart, L.; Shutt, T.; Silva, C.; Solovov, V. N.; Sorensen, P.; O'Sullivan, K.; Sumner, T. J.; Szydagis, M.; Taylor, D.; Tennyson, B.; Tiedt, D. R.; Tripathi, M.; Uvarov, S.; Verbus, J. R.; Walsh, N.; Webb, R.; White, J. T.; Witherell, M. S.; Wolfs, F. L. H.; Woods, M.; Zhang, C.
The LUX detector is currently in operation at the Davis Campus at the 4850' level of the Sanford Underground Research Facility (SURF) in Lead, SD to directly search for WIMP dark matter. Knowing the type and rate of backgrounds is critical in a rare, low energy event search, and LUX was designed, constructed, and deployed to mitigate backgrounds, both internal and external. An important internal background are decays of radon and its daughters. These consist of alpha decays, which are easily tagged and are a tracer of certain backgrounds, and beta decays, some of which are not as readily tagged and present a background for the WIMP search. We report on studies of alpha decay and discuss implications for the WIMP search.
Semiconductor-based experiments for neutrinoless double beta decay search
International Nuclear Information System (INIS)
Barnabé Heider, Marik
2012-01-01
Three experiments are employing semiconductor detectors in the search for neutrinoless double beta (0νββ) decay: COBRA, Majorana and GERDA. COBRA is studying the prospects of using CdZnTe detectors in terms of achievable energy resolution and background suppression. These detectors contain several ββ emitters and the most promising for 0νββ-decay search is 116 Cd. Majorana and GERDA will use isotopically enriched high purity Ge detectors to search for 0νββ-decay of 76 Ge. Their aim is to achieve a background ⩽10 −3 counts/(kg⋅y⋅keV) at the Q improvement compared to the present state-of-art. Majorana will operate Ge detectors in electroformed-Cu vacuum cryostats. A first cryostat housing a natural-Ge detector array is currently under preparation. In contrast, GERDA is operating bare Ge detectors submerged in liquid argon. The construction of the GERDA experiment is completed and a commissioning run started in June 2010. A string of natural-Ge detectors is operated to test the complete experimental setup and to determine the background before submerging the detectors enriched in 76 Ge. An overview and a comparison of these three experiments will be presented together with the latest results and developments.
Command and Control : faster decisions
CSIR Research Space (South Africa)
Venter, C
2012-10-01
Full Text Available Decisions 4th Biennial Conference Presented by Cobus Venter 10 October 2012 ? CSIR 2012 Slide 2 Command and Control Planning TaskingControl Assessment Si tu at io n DPSS Objective Ends Increase the Defence Capability of South Africa Ways... Supported by SAAB THALES Global CommsDPSS DDSI ERGOTECH Cooperation to make it work Example 1: Future SA Army Strategy and Joint Operations Support Campus Experiment Example 1: Future SA Army Strategy and Joint Operations Support Campus Experiment...
Lévy-taxis: a novel search strategy for finding odor plumes in turbulent flow-dominated environments
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
Harmony Search for Balancing Two-sided Assembly Lines
Directory of Open Access Journals (Sweden)
Hindriyanto Dwi Purnomo
2012-01-01
Full Text Available Two-sided assembly lines balancing problems are important problem for large-sized products such as cars and buses, in which, tasks operations can be performed in the two sides of the line. In this paper, Harmony Search algorithm is proposed to solve two-sided assembly lines balancing problems type-I (TALBP-I. The proposed method adopts the COMSOAL heuristic and specific features of TALBP in the Harmony operators – the harmony memory consideration, random selection and pitch adjustment – in order to maintain the local and global search. The proposed method is evaluated based on 6 benchmark problems that are commonly used in TALBP. The experiment results show that the proposed method work well and produces better solution than the heuristic method and genetic algorithm.
An ultra-low-background detector for axion searches
International Nuclear Information System (INIS)
Aune, S; Ferrer Ribas, E; Giomataris, I; Mols, J P; Papaevangelou, T; Dafni, T; Lacarra, J Galan; Iguaz, F J; Irastorza, I G; Morales, J; Ruz, J; Tomas, A; Fanourakis, G; Geralis, T; Kousouris, K; Vafeiadis, T
2009-01-01
A low background Micromegas detector has been operating in the CAST experiment at CERN for the search of solar axions since the start of data taking in 2002. The detector, made out of low radioactivity materials, operated efficiently and achieved a very low level of background (5x10 -5 keV -1 -cm -2 -s -1 ) without any shielding. New manufacturing techniques (Bulk/Microbulk) have led to further improvement of the characteristics of the detector such as uniformity, stability and energy resolution. These characteristics, the implementation of passive shielding and the improvement of the analysis algorithms have dramatically reduced the background level (2x10 -7 keV -1 -cm -2 |s -1 ), improving thus the overall sensitivity of the experiment and opening new possibilities for future searches.
One visual search, many memory searches: An eye-tracking investigation of hybrid search.
Drew, Trafton; Boettcher, Sage E P; Wolfe, Jeremy M
2017-09-01
Suppose you go to the supermarket with a shopping list of 10 items held in memory. Your shopping expedition can be seen as a combination of visual search and memory search. This is known as "hybrid search." There is a growing interest in understanding how hybrid search tasks are accomplished. We used eye tracking to examine how manipulating the number of possible targets (the memory set size [MSS]) changes how observers (Os) search. We found that dwell time on each distractor increased with MSS, suggesting a memory search was being executed each time a new distractor was fixated. Meanwhile, although the rate of refixation increased with MSS, it was not nearly enough to suggest a strategy that involves repeatedly searching visual space for subgroups of the target set. These data provide a clear demonstration that hybrid search tasks are carried out via a "one visual search, many memory searches" heuristic in which Os examine items in the visual array once with a very low rate of refixations. For each item selected, Os activate a memory search that produces logarithmic response time increases with increased MSS. Furthermore, the percentage of distractors fixated was strongly modulated by the MSS: More items in the MSS led to a higher percentage of fixated distractors. Searching for more potential targets appears to significantly alter how Os approach the task, ultimately resulting in more eye movements and longer response times.
Specificity of Geotechnical Measurements and Practice of Polish Offshore Operations
Directory of Open Access Journals (Sweden)
Bogumil Laczynski
2015-12-01
Full Text Available As offshore market in Europe grows faster and faster, new sea areas are being managed and new ideas on how to use the sea potential are being developed. In North Sea, where offshore industry conducts intensive expansion since late 1960s, numerous wind farms, oil and gas platforms and pipelines have been put into operation following extensive research, including geotechnical measurement. Recently, a great number of similar projects is under development in Baltic Sea, inter alia in Polish EEZ, natural conditions of which vary from the North Sea significantly. In this paper, those differences are described together with some solutions to problems thereby arising.
Science in search and rescue in the aftermath of the massive February 2006 Philippine landslide
Lagmay, A. A.; Ong, J. T.; Rodolfo, R. S.; Tengonciang, A. P.; Soria, J. T.; Fernandez, D. D.; Lapus, M. R.; Baliatan, E. G.; Quimba, Z. P.; Uichanco, C. L.; Paguican, E. R.
2006-12-01
Technical advice by a team of geologists, geophysicists and meteorologists was provided during the search and rescue operations at ground zero of the February 2006 landslide in Southern Leyte, Philippines. An ad hoc geographic information system constructed from a cadastral plan, 1:50,000 topographic map, aerial imagery taken 7 days after the landslide, and a plot of the inventory of survivors, recovered bodies, personal articles and remnants of buildings, was used to narrow down the search in the large debris field. In particular, search parties were directed to transfer operations to an area where a community was believed to have been transported about 550 meters down slope of its original position. By the time rescuers concentrated their efforts to the new search site, the water table had risen, diminishing chances of finding survivors trapped under the water-drenched rubble. Improvised rain gauges placed around the debris field served as basis to call off search operations to prevent casualties among the ranks of rescue teams. The lessons learned from the Southern Leyte landslide may be applied in the construction of policies for disaster management. Because speed, accuracy and the maximum utilization of resources are required in handling search and rescue operations, a systematic and informed approach is imperative. Time is essential in such a critical situation; thus, following a standard rote of procedures can improve how civil authorities deal with large scale landslide calamities.
Even Faster Web Sites Performance Best Practices for Web Developers
Souders, Steve
2009-01-01
Performance is critical to the success of any web site, and yet today's web applications push browsers to their limits with increasing amounts of rich content and heavy use of Ajax. In this book, Steve Souders, web performance evangelist at Google and former Chief Performance Yahoo!, provides valuable techniques to help you optimize your site's performance. Souders' previous book, the bestselling High Performance Web Sites, shocked the web development world by revealing that 80% of the time it takes for a web page to load is on the client side. In Even Faster Web Sites, Souders and eight exp
Automated Search-Based Robustness Testing for Autonomous Vehicle Software
Directory of Open Access Journals (Sweden)
Kevin M. Betts
2016-01-01
Full Text Available Autonomous systems must successfully operate in complex time-varying spatial environments even when dealing with system faults that may occur during a mission. Consequently, evaluating the robustness, or ability to operate correctly under unexpected conditions, of autonomous vehicle control software is an increasingly important issue in software testing. New methods to automatically generate test cases for robustness testing of autonomous vehicle control software in closed-loop simulation are needed. Search-based testing techniques were used to automatically generate test cases, consisting of initial conditions and fault sequences, intended to challenge the control software more than test cases generated using current methods. Two different search-based testing methods, genetic algorithms and surrogate-based optimization, were used to generate test cases for a simulated unmanned aerial vehicle attempting to fly through an entryway. The effectiveness of the search-based methods in generating challenging test cases was compared to both a truth reference (full combinatorial testing and the method most commonly used today (Monte Carlo testing. The search-based testing techniques demonstrated better performance than Monte Carlo testing for both of the test case generation performance metrics: (1 finding the single most challenging test case and (2 finding the set of fifty test cases with the highest mean degree of challenge.
Modeling and prediction of human word search behavior in interactive machine translation
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.
SearchResultFinder: federated search made easy
Trieschnigg, Rudolf Berend; Tjin-Kam-Jet, Kien; Hiemstra, Djoerd
Building a federated search engine based on a large number existing web search engines is a challenge: implementing the programming interface (API) for each search engine is an exacting and time-consuming job. In this demonstration we present SearchResultFinder, a browser plugin which speeds up
Foerster, Rebecca M; Schneider, Werner X
2018-03-01
Many everyday tasks involve successive visual-search episodes with changing targets. Converging evidence suggests that these targets are retained in visual working memory (VWM) and bias attention from there. It is unknown whether all or only search-relevant features of a VWM template bias attention during search. Bias signals might be configured exclusively to task-relevant features so that only search-relevant features bias attention. Alternatively, VWM might maintain objects in the form of bound features. Then, all template features will bias attention in an object-based manner, so that biasing effects are ranked by feature relevance. Here, we investigated whether search-irrelevant VWM template features bias attention. Participants had to saccade to a target opposite a distractor. A colored cue depicted the target prior to each search trial. The target was predefined only by its identity, while its color was irrelevant. When target and cue matched not only in identity (search-relevant) but also in color (search-irrelevant), saccades went more often and faster directly to the target than without any color match (Experiment 1). When introducing a cue-distractor color match (Experiment 2), direct target saccades were most likely when target and cue matched in the search-irrelevant color and least likely in case of a cue-distractor color match. When cue and target were never colored the same (Experiment 3), cue-colored distractors still captured the eyes more often than different-colored distractors despite color being search-irrelevant. As participants were informed about the misleading color, the result argues against a strategical and voluntary usage of color. Instead, search-irrelevant features biased attention obligatorily arguing for involuntary top-down control by object-based VWM templates. Copyright © 2017 Elsevier B.V. All rights reserved.
Multipass Target Search in Natural Environments.
Kuhlman, Michael J; Otte, Michael W; Sofge, Donald; Gupta, Satyandra K
2017-11-02
Consider a disaster scenario where search and rescue workers must search difficult to access buildings during an earthquake or flood. Often, finding survivors a few hours sooner results in a dramatic increase in saved lives, suggesting the use of drones for expedient rescue operations. Entropy can be used to quantify the generation and resolution of uncertainty. When searching for targets, maximizing mutual information of future sensor observations will minimize expected target location uncertainty by minimizing the entropy of the future estimate. Motion planning for multi-target autonomous search requires planning over an area with an imperfect sensor and may require multiple passes, which is hindered by the submodularity property of mutual information. Further, mission duration constraints must be handled accordingly, requiring consideration of the vehicle's dynamics to generate feasible trajectories and must plan trajectories spanning the entire mission duration, something which most information gathering algorithms are incapable of doing. If unanticipated changes occur in an uncertain environment, new plans must be generated quickly. In addition, planning multipass trajectories requires evaluating path dependent rewards, requiring planning in the space of all previously selected actions, compounding the problem. We present an anytime algorithm for autonomous multipass target search in natural environments. The algorithm is capable of generating long duration dynamically feasible multipass coverage plans that maximize mutual information using a variety of techniques such as ϵ -admissible heuristics to speed up the search. To the authors' knowledge this is the first attempt at efficiently solving multipass target search problems of such long duration. The proposed algorithm is based on best first branch and bound and is benchmarked against state of the art algorithms adapted to the problem in natural Simplex environments, gathering the most information in the
Suprir - multibase system for retrospective search
International Nuclear Information System (INIS)
Lovisi, A.L.M.; Fernandes, C.C.
1986-01-01
SUPRIR - a Retrospective Search System developed at the Centro de Informacoes Nucleares (CIN) of the Comissao Nacional de Energia Nuclear (CNEN) is described. The multi-base software structure and the bibliographic data bases in operation under SUPRIR are presented. The utilization of the system, means of access and query formulation are shown. (Author) [pt
Directory of Open Access Journals (Sweden)
P. Hanappe
2011-09-01
Full Text Available We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations.
The modified algorithm runs more than 50 times faster on the CELL's Synergistic Processing Element than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60 % of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.
Monitoring and Information Fusion for Search and Rescue Operations in Large-Scale Disasters
National Research Council Canada - National Science Library
Nardi, Daniele
2002-01-01
... for information fusion with application to search-and-rescue and large scale disaster relief. The objective is to develop and to deploy tools to support the monitoring activities in an intervention caused by a large-scale disaster...
Search for gravitational wave bursts by the network of resonant detectors
Astone, P; Busby, D; Bassan, M; Blair, D G; Bonaldi, M; Bonifazi, P; Carelli, P; Cerdonio, M; Coccia, E; Conti, L; Cosmelli, C; D'Antonio, S; Fafone, V; Falferi, P; Fortini, P; Frasca, S; Hamilton, W O; Heng, I S; Ivanov, E N; Johnson, W W; Locke, C R; Marini, A; Mauceli, E; McHugh, M P; Mezzena, R; Minenkov, Y; Modena, I; Modestino, G; Moleti, A; Ortolan, A; Pallottino, G V; Pizzella, G; Prodi, G A; Quintieri, L; Rocchi, A; Rocco, E; Ronga, F; Salemi, F; Santostasi, G; Taffarello, L; Terenzi, R; Tobar, M E; Vedovato, G; Vinante, A; Visco, M; Vitale, S; Zendri, J P
2002-01-01
The groups operating cryogenic bar detectors of gravitational waves are performing a coordinated search for short signals within the International Gravitational Event Collaboration (IGEC). We review the most relevant aspects of the data analysis, based on a time-coincidence search among triggers from different detectors, and the properties of the data exchanged by each detector under a recently-upgraded agreement. The IGEC is currently analysing the observations from 1997 to 2000, when up to four detectors were operating simultaneously. 10% and 50% of this time period were covered by simultaneous observations, respectively, of at least three or at least two detectors. Typical signal search thresholds were in the range 2-6 10 sup - sup 2 sup 1 /Hz. The coincidences found are within the estimated background, hence improved upper limits on incoming GW (gravitational wave) bursts have been set.
Directory of Open Access Journals (Sweden)
Antonino Visalli
2018-02-01
Full Text Available 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.
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.
Directory of Open Access Journals (Sweden)
Timofeeva Maria
2012-03-01
Full Text Available A theoretical and experimental comparison of optimized search coils based magnetometers, operating either in the Flux mode or in the classical Lenz-Faraday mode, is presented. The improvements provided by the Flux mode in terms of bandwidth and measuring range of the sensor are detailed. Theory, SPICE model and measurements are in good agreement. The spatial resolution of the sensor is studied which is an important parameter for applications in non destructive evaluation. A general expression of the magnetic sensitivity of search coils sensors is derived. Solutions are proposed to design magnetometers with reduced weight and volume without degrading the magnetic sensitivity. An original differential search coil based magnetometer, made of coupled coils, operating in flux mode and connected to a differential transimpedance amplifier is proposed. It is shown that this structure is better in terms of volume occupancy than magnetometers using two separated coils without any degradation in magnetic sensitivity. Experimental results are in good agreement with calculations.
An ultra-low-background detector for axion searches
Energy Technology Data Exchange (ETDEWEB)
Aune, S; Ferrer Ribas, E; Giomataris, I; Mols, J P; Papaevangelou, T [IRFU, Centre d' Etudes de Saclay, Gif sur Yvette CEDEX (France); Dafni, T; Lacarra, J Galan; Iguaz, F J; Irastorza, I G; Morales, J; Ruz, J; Tomas, A [Instituto de Fisica Nuclear y Altas EnergIas, Zaragoza (Spain); Fanourakis, G; Geralis, T; Kousouris, K [Institute of Nuclear Physics, NCSR Demokritos, Athens (Greece); Vafeiadis, T, E-mail: Thomas.Papaevangelou@cern.c [Physics Department, Aristotle University, Thessaloniki (Greece)
2009-07-01
A low background Micromegas detector has been operating in the CAST experiment at CERN for the search of solar axions since the start of data taking in 2002. The detector, made out of low radioactivity materials, operated efficiently and achieved a very low level of background (5x10{sup -5} keV{sup -1}-cm{sup -2}-s{sup -1}) without any shielding. New manufacturing techniques (Bulk/Microbulk) have led to further improvement of the characteristics of the detector such as uniformity, stability and energy resolution. These characteristics, the implementation of passive shielding and the improvement of the analysis algorithms have dramatically reduced the background level (2x10{sup -7} keV{sup -1}-cm{sup -2}|s{sup -1}), improving thus the overall sensitivity of the experiment and opening new possibilities for future searches.
Improved Governing of Kaplan Turbine Hydropower Plants Operating Island Grids
Gustafsson, Martin
2013-01-01
To reduce the consequences of a major fault in the electric power grid, functioning parts of the grid can be divided into smaller grid islands. The grid islands are operated isolated from the power network, which places new demands on a faster frequency regulation. This thesis investigates a Kaplan turbine hydropower plant operating an island grid. The Kaplan turbine has two control signals, the wicket gate and the turbine blade positions, controlling the mechanical power. The inputs are comb...
Finger Search in the Implicit Model
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob
2012-01-01
, and delete in times $\\mathcal{O}(q(t))$, $\\mathcal{O}(q^{-1}(\\log n)\\log n)$, $\\mathcal{O}(\\log n)$, and $\\mathcal{O}(\\log n)$, respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element...
Open meta-search with OpenSearch: a case study
O'Riordan, Adrian P.
2007-01-01
The goal of this project was to demonstrate the possibilities of open source search engine and aggregation technology in a Web environment by building a meta-search engine which employs free open search engines and open protocols. In contrast many meta-search engines on the Internet use proprietary search systems. The search engines employed in this case study are all based on the OpenSearch protocol. OpenSearch-compliant systems support XML technologies such as RSS and Atom for aggregation a...
Pretraining Cortical Thickness Predicts Subsequent Perceptual Learning Rate in a Visual Search Task.
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.
Multilevel Thresholding Segmentation Based on Harmony Search Optimization
Directory of Open Access Journals (Sweden)
Diego Oliva
2013-01-01
Full Text Available In this paper, a multilevel thresholding (MT algorithm based on the harmony search algorithm (HSA is introduced. HSA is an evolutionary method which is inspired in musicians improvising new harmonies while playing. Different to other evolutionary algorithms, HSA exhibits interesting search capabilities still keeping a low computational overhead. The proposed algorithm encodes random samples from a feasible search space inside the image histogram as candidate solutions, whereas their quality is evaluated considering the objective functions that are employed by the Otsu’s or Kapur’s methods. Guided by these objective values, the set of candidate solutions are evolved through the HSA operators until an optimal solution is found. Experimental results demonstrate the high performance of the proposed method for the segmentation of digital images.
Decoherence in optimized quantum random-walk search algorithm
International Nuclear Information System (INIS)
Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun
2015-01-01
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. (paper)
Search route decision of environmental monitoring at emergency time
International Nuclear Information System (INIS)
Aoyama, Isao
1979-01-01
The search route decision method is reviewed, especially the adequate arrangement of monitors in view of time in the information-gathering activity by transferring the monitors on the horizontal space after the confirmation of the abnormal release of radioactive material. As for the field of the theory of search, the developmental history is explained, namely the experiences of the naval anti submarine operation in WW-2, the salvage activities and the search problem on the sea. The kinematics for search, the probability theory for detection and the optimum distribution for search are the most important contents of the application of theory of search relating to the environmental monitoring at emergency condition. The combination of a search model consists of the peculiarity of targets, the peculiarity of observers and the standard of optimality. The peculiarity of targets is divided into the space of search, the number of targets, the way of appearance of targets and the motion of targets. The peculiarity of observers is divided into the number of observers, the divisibility of efforts for search, the credibility of search information and the search process. The standard of optimality is divided into the maximum probability of detection, the minimum risk expected and the others. Each item written above of search model is explained. Concerning the formulation of the search model, the theoretical equations for detection probability, discovery potential and instantaneous detection probability, density are derived, and these equations are evaluated and explained. The future plan is to advance the search technology so as to evaluate the detection potential to decide the route of running a monitoring car for a nuclear power plant at accidental condition. (Nakai, Y.)
The impact of accelerating faster than exponential population growth on genetic variation.
Reppell, Mark; Boehnke, Michael; Zöllner, Sebastian
2014-03-01
Current human sequencing projects observe an abundance of extremely rare genetic variation, suggesting recent acceleration of population growth. To better understand the impact of such accelerating growth on the quantity and nature of genetic variation, we present a new class of models capable of incorporating faster than exponential growth in a coalescent framework. Our work shows that such accelerated growth affects only the population size in the recent past and thus large samples are required to detect the models' effects on patterns of variation. When we compare models with fixed initial growth rate, models with accelerating growth achieve very large current population sizes and large samples from these populations contain more variation than samples from populations with constant growth. This increase is driven almost entirely by an increase in singleton variation. Moreover, linkage disequilibrium decays faster in populations with accelerating growth. When we instead condition on current population size, models with accelerating growth result in less overall variation and slower linkage disequilibrium decay compared to models with exponential growth. We also find that pairwise linkage disequilibrium of very rare variants contains information about growth rates in the recent past. Finally, we demonstrate that models of accelerating growth may substantially change estimates of present-day effective population sizes and growth times.
Intelligent systems supporting the control room operators
International Nuclear Information System (INIS)
Berger, E.
1997-01-01
The operational experience obtained with the various applications of the systems discussed in this paper shows that more consequent use of the systems will make detection and management of disturbances still more efficient and faster. This holds true both for a low level of process automation and for power plants with a high level of automation. As for conventional power plants, the trend clearly is towards higher degrees of automation and consequent application of supporting systems. Thus, higher availability and rapid failure management are achieved, at low effects on normal operation. These systems are monitoring and process control systems, expert systems, and systems for optimal use of the equipment, or systems for post-incident analyses and computer-assisted on-shift protocols, or operating manuals. (orig./CB) [de
Dimensional testing for reverse k-nearest neighbor search
DEFF Research Database (Denmark)
Casanova, Guillaume; Englmeier, Elias; Houle, Michael E.
2017-01-01
Given a query object q, reverse k-nearest neighbor (RkNN) search aims to locate those objects of the database that have q among their k-nearest neighbors. In this paper, we propose an approximation method for solving RkNN queries, where the pruning operations and termination tests are guided...... by a characterization of the intrinsic dimensionality of the data. The method can accommodate any index structure supporting incremental (forward) nearest-neighbor search for the generation and verification of candidates, while avoiding impractically-high preprocessing costs. We also provide experimental evidence...
Searches for dark photons at the Mainz Microtron
Energy Technology Data Exchange (ETDEWEB)
Merkel, H.; Achenbach, P.; Gayoso, C. Ayerbe; Beranek, T.; Bernauer, J. C.; Böhm, R.; Correa, L.; Denig, A.; Distler, M. O.; Esser, A.; Gómez, M.; Kegel, S.; Kohl, Y.; Mihovilovič, M.; Middleton, D. G.; Müller, U.; Nungesser, L.; Pochodzalla, J.; Rohrbeck, M.; Majos, S. Sánchez [Institut für Kernphysik, Johannes Gutenberg-Universität, D-55099 Mainz (Germany); and others
2013-11-07
The A1 Collaboration at the Mainz Microtron (MAMI) operates high resolution spectrometers at very high luminosities for fixed target electron scattering experiments. The setup is well suited for the search for dark photons in the mass range between 50 MeV and 300 MeV. In these experiments, a possible dark photon would appear as a sharp peak in the mass spectrum of di-lepton electro-production. In this presentation the potential of the setup is presented and the possibilities for future experiments for dark photon searches at MAMI are discussed.
Quality and efficiency in high dimensional Nearest neighbor search
Tao, Yufei; Yi, Ke; Sheng, Cheng; Kalnis, Panos
2009-01-01
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational database, and (ii) its query cost should grow sub-linearly with the dataset size, regardless of the data and query distributions. Despite the bulk of NN literature, no solution fulfills both requirements, except locality sensitive hashing (LSH). The existing LSH implementations are either rigorous or adhoc. Rigorous-LSH ensures good quality of query results, but requires expensive space and query cost. Although adhoc-LSH is more efficient, it abandons quality control, i.e., the neighbor it outputs can be arbitrarily bad. As a result, currently no method is able to ensure both quality and efficiency simultaneously in practice. Motivated by this, we propose a new access method called the locality sensitive B-tree (LSB-tree) that enables fast highdimensional NN search with excellent quality. The combination of several LSB-trees leads to a structure called the LSB-forest that ensures the same result quality as rigorous-LSH, but reduces its space and query cost dramatically. The LSB-forest also outperforms adhoc-LSH, even though the latter has no quality guarantee. Besides its appealing theoretical properties, the LSB-tree itself also serves as an effective index that consumes linear space, and supports efficient updates. Our extensive experiments confirm that the LSB-tree is faster than (i) the state of the art of exact NN search by two orders of magnitude, and (ii) the best (linear-space) method of approximate retrieval by an order of magnitude, and at the same time, returns neighbors with much better quality. © 2009 ACM.
Optimal search filters for renal information in EMBASE.
Iansavichus, Arthur V; Haynes, R Brian; Shariff, Salimah Z; Weir, Matthew; Wilczynski, Nancy L; McKibbon, Ann; Rehman, Faisal; Garg, Amit X
2010-07-01
EMBASE is a popular database used to retrieve biomedical information. Our objective was to develop and test search filters to help clinicians and researchers efficiently retrieve articles with renal information in EMBASE. We used a diagnostic test assessment framework because filters operate similarly to screening tests. We divided a sample of 5,302 articles from 39 journals into development and validation sets of articles. Information retrieval properties were assessed by treating each search filter as a "diagnostic test" or screening procedure for the detection of relevant articles. We tested the performance of 1,936,799 search filters made of unique renal terms and their combinations. REFERENCE STANDARD & OUTCOME: The reference standard was manual review of each article. We calculated the sensitivity and specificity of each filter to identify articles with renal information. The best renal filters consisted of multiple search terms, such as "renal replacement therapy," "renal," "kidney disease," and "proteinuria," and the truncated terms "kidney," "dialy," "neph," "glomerul," and "hemodial." These filters achieved peak sensitivities of 98.7% (95% CI, 97.9-99.6) and specificities of 98.5% (95% CI, 98.0-99.0). The retrieval performance of these filters remained excellent in the validation set of independent articles. The retrieval performance of any search will vary depending on the quality of all search concepts used, not just renal terms. We empirically developed and validated high-performance renal search filters for EMBASE. These filters can be programmed into the search engine or used on their own to improve the efficiency of searching.
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.
Reward association facilitates distractor suppression in human visual search.
Gong, Mengyuan; Yang, Feitong; Li, Sheng
2016-04-01
Although valuable objects are attractive in nature, people often encounter situations where they would prefer to avoid such distraction while focusing on the task goal. Contrary to the typical effect of attentional capture by a reward-associated item, we provide evidence for a facilitation effect derived from the active suppression of a high reward-associated stimulus when cuing its identity as distractor before the display of search arrays. Selection of the target is shown to be significantly faster when the distractors were in high reward-associated colour than those in low reward-associated or non-rewarded colours. This behavioural reward effect was associated with two neural signatures before the onset of the search display: the increased frontal theta oscillation and the strengthened top-down modulation from frontal to anterior temporal regions. The former suggests an enhanced working memory representation for the reward-associated stimulus and the increased need for cognitive control to override Pavlovian bias, whereas the latter indicates that the boost of inhibitory control is realized through a frontal top-down mechanism. These results suggest a mechanism in which the enhanced working memory representation of a reward-associated feature is integrated with task demands to modify attentional priority during active distractor suppression and benefit behavioural performance. © 2016 Federation of European Neuroscience Societies and John Wiley & Sons Ltd.
Ball, Keira; Birch, Yan; Lane, Alison; Ellison, Amanda; Schenk, Thomas
2017-07-28
Frames of reference play a central role in perceiving an object's location and reaching to pick that object up. It is thought that the ventral stream, believed to subserve vision for perception, utilises allocentric coding, while the dorsal stream, argued to be responsible for vision for action, primarily uses an egocentric reference frame. We have previously shown that egocentric representations can survive a delay; however, it is possible that in comparison to allocentric information, egocentric information decays more rapidly. Here we directly compare the effect of delay on the availability of egocentric and allocentric representations. We used spatial priming in visual search and repeated the location of the target relative to either a landmark in the search array (allocentric condition) or the observer's body (egocentric condition). Three inter-trial intervals created minimum delays between two consecutive trials of 2, 4, or 8seconds. In both conditions, search times to primed locations were faster than search times to un-primed locations. In the egocentric condition the effects were driven by a reduction in search times when egocentric information was repeated, an effect that was observed at all three delays. In the allocentric condition while search times did not change when the allocentric information was repeated, search times to un-primed target locations became slower. We conclude that egocentric representations are not as transient as previously thought but instead this information is still available, and can influence behaviour, after lengthy periods of delay. We also discuss the possible origins of the differences between allocentric and egocentric priming effects. Copyright © 2017 Elsevier B.V. All rights reserved.
Morville, Peter
2010-01-01
What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont
AUTHOR|(SzGeCERN)749939
2015-01-01
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.
Human Detection and Classification of Landing Sites for Search and Rescue Drones
N. Martins, Felipe; de Groot, Marc; Stokkel, Xeryus; Wiering, Marco
2016-01-01
Search and rescue is often time and labour intensive. We present a system to be used in drones to make search and rescue operations more effective. The system uses a drone downward facing camera to detect people and to evaluate potential sites as being safe or not for the drone to land. Histogram of
Mastering Search Analytics Measuring SEO, SEM and Site Search
Chaters, Brent
2011-01-01
Many companies still approach Search Engine Optimization (SEO) and paid search as separate initiatives. This in-depth guide shows you how to use these programs as part of a comprehensive strategy-not just to improve your site's search rankings, but to attract the right people and increase your conversion rate. Learn how to measure, test, analyze, and interpret all of your search data with a wide array of analytic tools. Gain the knowledge you need to determine the strategy's return on investment. Ideal for search specialists, webmasters, and search marketing managers, Mastering Search Analyt
Koltunov, A.; Quayle, B.; Prins, E. M.; Ambrosia, V. G.; Ustin, S.
2014-12-01
Fire managers at various levels require near-real-time, low-cost, systematic, and reliable early detection capabilities with minimal latency to effectively respond to wildfire ignitions and minimize the risk of catastrophic development. The GOES satellite images collected for vast territories at high temporal frequencies provide a consistent and reliable source for operational active fire mapping realized by the WF-ABBA algorithm. However, their potential to provide early warning or rapid confirmation of initial fire ignition reports from conventional sources remains underutilized, partly because the operational wildfire detection has been successfully optimized for users and applications for which timeliness of initial detection is a low priority, contrasting to the needs of first responders. We present our progress in developing the GOES Early Fire Detection (GOES-EFD) system, a collaborative effort led by University of California-Davis and USDA Forest Service. The GOES-EFD specifically focuses on first detection timeliness for wildfire incidents. It is automatically trained for a monitored scene and capitalizes on multiyear cross-disciplinary algorithm research. Initial retrospective tests in Western US demonstrate significantly earlier identification detection of new ignitions than existing operational capabilities and a further improvement prospect. The GOES-EFD-β prototype will be initially deployed for the Western US region to process imagery from GOES-NOP and the rapid and 4 times higher spatial resolution imagery from GOES-R — the upcoming next generation of GOES satellites. These and other enhanced capabilities of GOES-R are expected to significantly improve the timeliness of fire ignition information from GOES-EFD.
Operational and real-time Business Intelligence
Directory of Open Access Journals (Sweden)
Daniela Ioana SANDU
2008-01-01
Full Text Available A key component of a company’s IT framework is a business intelligence (BI system. BI enables business users to report on, analyze and optimize business operations to reduce costs and increase revenues. Organizations use BI for strategic and tactical decision making where the decision-making cycle may span a time period of several weeks (e.g., campaign management or months (e.g., improving customer satisfaction.Competitive pressures coming from a very dynamic business environment are forcing companies to react faster to changing business conditions and customer requirements. As a result, there is now a need to use BI to help drive and optimize business operations on a daily basis, and, in some cases, even for intraday decision making. This type of BI is usually called operational business intelligence and real-time business intelligence.
Directory of Open Access Journals (Sweden)
Reza Hassanzadeh
2016-07-01
Full Text Available This paper presents the development of a spatial model for the allocation of the Urban Search and Rescue (USAR operation by computing the priority index of damaged areas (PI-USAR model. The relevant prioritization criteria were identified through a literature review and interviews with 30 disaster managers. The relative importance of these criteria was computed as weights using an analytic hierarchy process (AHP method; the criteria were combined based on AHP rules and spatial multi-criteria decision-making analysis in geographic information system (GIS. The PI-USAR model was applied in the case study area of the Bam city in Iran and a priority map was produced indicating four highly prioritized areas. The model was validated by comparing the obtained priority map with the actual priority map (APM using fuzzy inference system and relative operating characteristic methods. The result suggested a good fit between the APM and the model's output. Sensitivity analyses were performed using the map removal and the single parameter methods. With the uncertainties and complexities that are inherent to the spatial data, spatial modelling and the earthquake phenomenon itself, the PI-USAR model offers some utility to disaster managers in understanding the significance of each criterion in the decision-making process and in identifying the highly prioritized areas for the allocation of USAR operations. However, its utility is best exploited in conjunction with other complementary sources of field data based on the immediate post-disaster situation.
Visual search asymmetries within color-coded and intensity-coded displays.
Yamani, Yusuke; McCarley, Jason S
2010-06-01
Color and intensity coding provide perceptual cues to segregate categories of objects within a visual display, allowing operators to search more efficiently for needed information. Even within a perceptually distinct subset of display elements, however, it may often be useful to prioritize items representing urgent or task-critical information. The design of symbology to produce search asymmetries (Treisman & Souther, 1985) offers a potential technique for doing this, but it is not obvious from existing models of search that an asymmetry observed in the absence of extraneous visual stimuli will persist within a complex color- or intensity-coded display. To address this issue, in the current study we measured the strength of a visual search asymmetry within displays containing color- or intensity-coded extraneous items. The asymmetry persisted strongly in the presence of extraneous items that were drawn in a different color (Experiment 1) or a lower contrast (Experiment 2) than the search-relevant items, with the targets favored by the search asymmetry producing highly efficient search. The asymmetry was attenuated but not eliminated when extraneous items were drawn in a higher contrast than search-relevant items (Experiment 3). Results imply that the coding of symbology to exploit visual search asymmetries can facilitate visual search for high-priority items even within color- or intensity-coded displays. PsycINFO Database Record (c) 2010 APA, all rights reserved.
Directory of Open Access Journals (Sweden)
Jinggang Chu
2015-05-01
Full Text Available River basin simulation and multi-reservoir optimal operation have been critical for river basin management. Due to the intense interaction between human activities and river basin systems, the river basin model and multi-reservoir operation model are complicated with a large number of parameters. Therefore, fast and stable optimization algorithms are required for river basin management under the changing conditions of climate and current human activities. This study presents a new global optimization algorithm, named as heuristic dynamically dimensioned search with sensitivity information (HDDS-S, to effectively perform river basin simulation and multi-reservoir optimal operation during river basin management. The HDDS-S algorithm is built on the dynamically dimensioned search (DDS algorithm; and has an improved computational efficiency while maintaining its search capacity compared to the original DDS algorithm. This is mainly due to the non-uniform probability assigned to each decision variable on the basis of its changing sensitivity to the optimization objectives during the adaptive change from global to local search with dimensionality reduced. This study evaluates the new algorithm by comparing its performance with the DDS algorithm on a river basin model calibration problem and a multi-reservoir optimal operation problem. The results obtained indicate that the HDDS-S algorithm outperforms the DDS algorithm in terms of search ability and computational efficiency in the two specific problems. In addition; similar to the DDS algorithm; the HDDS-S algorithm is easy to use as it does not require any parameter tuning and automatically adjusts its search to find good solutions given an available computational budget.
Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.
Gordon, Lori E
2015-10-15
To establish types and rates of injuries and illnesses among search-and-recovery and search-and-rescue dogs deployed to Oso, Wash, following the March 22, 2014, State Route 530 landslide. Medical records review and cross-sectional survey. 25 Federal Emergency Management Agency-certified search dogs. On-site medical records and postdeployment laboratory test results were reviewed and an electronic survey was distributed to handlers within 8 days after demobilization. Dogs worked a total of 244 search shifts totaling 2,015 hours. Injuries and illnesses were reported in 21 (84%) dogs. Wounds (abrasions, pad wear, paw pad splits, and lacerations) were the most common injury, with an incidence rate of 28.3 wounds/1,000 hours worked. Dehydration was the most common illness, with an incidence rate of 10.4 cases of dehydration/1,000 hours worked. Total incidence rate for all health events was 66.5 events/1,000 hours worked. Two search dogs were removed from search operations for 2 days because of health issues. All others continued search operations while receiving treatment for their medical issues. All health issues were resolved during the deployment or within 2 weeks after demobilization. Results revealed that search dogs deployed to the Oso, Wash, landslide incurred injuries and illnesses similar to those reported following other disasters (dehydration, wounding, vomiting, and diarrhea) but also incurred medical issues not previously documented (acute caudal myopathy, cutaneous mass ruptures, and fever). The reported medical issues were minor; however, prompt veterinary care helped prevent them from developing into more serious conditions.
Installation of the Cryogenic Dark Matter Search (CDMS)
International Nuclear Information System (INIS)
Barnes, P.D. Jr.; California Univ., Berkeley; Da Silva, A.; British Columbia Univ., Vancouver, BC; Akerib, D.S.; California Univ., Berkeley
1996-01-01
We discuss the status of a cryogenic dark matter search beginning operation in the Stanford Underground Facility. The detectors will be cooled in a specially designed cryostat connected to a modified side access Oxford 400 dilution refrigerator. We discuss two detector designs and performance, the cryostat construction and operation, and the multi-level shield surrounding the cryostat. Finally, we will examine the limits which we will be able to set on WIMP dark matter with this experiment. (orig.)
Tales from the Field: Search Strategies Applied in Web Searching
Directory of Open Access Journals (Sweden)
Soohyung Joo
2010-08-01
Full Text Available In their web search processes users apply multiple types of search strategies, which consist of different search tactics. This paper identifies eight types of information search strategies with associated cases based on sequences of search tactics during the information search process. Thirty-one participants representing the general public were recruited for this study. Search logs and verbal protocols offered rich data for the identification of different types of search strategies. Based on the findings, the authors further discuss how to enhance web-based information retrieval (IR systems to support each type of search strategy.
Fatmaa El Zahraa Mohamed Abdou
2004-01-01
A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
Search for stellar gravitational collapses with the MACRO detector
Ambrosio, M; Baldini, A; Barbarino, G C; Barish, B C; Battistoni, G; Bellotti, R; Bemporad, C; Bernardini, P; Bilokon, H; Bloise, C; Bower, C; Brigida, M; Bussino, S; Cafagna, F; Campana, D; Carboni, M; Cecchini, S; Cei, F; Chiarella, V; Choudhary, B C; Coutu, S; Cozzi, M; De Cataldo, G; De Marzo, C; De Mitri, I; De Vincenzi, M; Dekhissi, H; Derkaoui, J; Di Credico, A; Favuzzi, C; Forti, C; Fusco, P; Giacomelli, G; Giannini, G; Giglietto, N; Giorgini, M; Grassi, M; Grillo, A; Gustavino, C; Habig, A; Hanson, K; Heinz, R; Iarocci, E; Katsavounidis, E; Katsavounidis, I; Kearns, E; Kim, H; Kyriazopoulou, S; Lamanna, E; Lane, C; Levin, D S; Lipari, P; Longley, N P; Longo, M J; Loparco, F; Maaroufi, F; Mancarella, G; Mandrioli, G; Margiotta, A; Marini, A; Martello, D; Marzari-Chiesa, A; Mazziotta, M N; Michael, D G; Monacelli, P; Montaruli, T; Monteno, M; Mufson, S; Musser, J; Nicolò, D; Nolty, R; Orth, C; Osteria, G; Palamara, O; Patera, V; Patrizii, L; Pazzi, R; Peck, C W; Perrone, L; Petrera, S; Popa, V; Raino, J A; Reynoldson, J; Ronga, F; Satriano, C; Scapparone, E; Scholberg, K; Sciubba, A; Sioli, M; Sirri, G; Sitta, M; Spinelli, P; Spinetti, M; Spurio, M; Steinberg, R; Stone, J L; Sulak, L R; Surdo, A; Tarle, G; Togo, V; Vakili, M; Walter, C W; Webb, R; 10.1140/epjc/s2004-01981-3
2004-01-01
We present the final results of the search for stellar gravitational collapses obtained by the MACRO experiment. The detector was active for a stellar collapse search for more than 11 years and it was sensitive to collapses occurring all over in our galaxy for 8.6 years. A real time system for a prompt recognition of neutrino bursts was developed and was operating on-line for almost the whole life of the experiment. No signal compatible with a neutrino burst from a galactic supernova was observed.
University Students' Online Information Searching Strategies in Different Search Contexts
Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung
2012-01-01
This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…
Enhancing the CDF's B physics program with a faster data acquisition system.
Energy Technology Data Exchange (ETDEWEB)
Dr. Petar Maksimovic
2011-03-02
The physics program of Run II at the Tevatron includes precision electroweak measurements such as the determination of the top quark and W boson masses; bottom and charm physics including the determination of the B{sub s} and D{sup 0} mixing parameters; studies of the strong interaction; and searches for the Higgs particle, supersymmetric particles, hidden space-time dimensions and quark substructure. All of these measurements benefit from a high-resolution tracking detector. Most of them rely heavily on the efficient identification of heavy flavored B hadrons by detection of displaced secondary vertices, and are enhanced by the capability to trigger on tracks not coming from the primary vertex. This is uniquely provided by CDF's finely-segmented silicon detectors surrounding the interaction region. Thus CDF experiment's physics potential critically depends on the performance of its silicon detectors. The CDF silicon detectors were designed to operate up to 2-3 fb{sup -1} of accumulated pji collisions, with an upgrade planned thereafter. However, the upgrade project was canceled in 2003 and Run II has been extended through 2011, with an expected total delivered integrated luminosity of 12 fb{sup -1} or more. Several preventive measures were taken to keep the original detector operational and maintain its performance. The most important of these are the decrease in the operating temperature of the detector, which reduces the impact of radiation exposure, and measures to minimize damage due to integrated radiation dose, thermal cycles, and wire bond resonance conditions. Despite these measures the detectors operating conditions continue to change with issues arising from radiation damage to the sensors, aging infrastructure and electronics. These, together with the basic challenges posed by the inaccessibility of the detector volume and large number (about 750 thousand) of readout channels, make the silicon detector operations the single most complex and
Definition and Evaluation of Bus and Truck Automation Operations Concepts: Final Report
Taso, H. S. Jacob; Botha, Jan L.
2003-01-01
Traffic congestion will continue to worsen and likely worsen at a faster rate than ever. People throughput and freight throughput have become critical issues for California and the rest of the nation. PATH has funded a research project entitled Definition And Evaluation of Bus And Truck Automation Operations Concepts, proposed by the authors. This report summarizes the major findings of the research project. During the one-year project, we reviewed literature and developed operating concepts ...
Two-ply channels for faster wicking in paper-based microfluidic devices.
Camplisson, Conor K; Schilling, Kevin M; Pedrotti, William L; Stone, Howard A; Martinez, Andres W
2015-12-07
This article describes the development of porous two-ply channels for paper-based microfluidic devices that wick fluids significantly faster than conventional, porous, single-ply channels. The two-ply channels were made by stacking two single-ply channels on top of each other and were fabricated entirely out of paper, wax and toner using two commercially available printers, a convection oven and a thermal laminator. The wicking in paper-based channels was studied and modeled using a modified Lucas-Washburn equation to account for the effect of evaporation, and a paper-based titration device incorporating two-ply channels was demonstrated.
Semantic Size Does Not Matter: “Bigger” Words Are Not Recognised Faster
Kang, Sean H.K.; Yap, Melvin J.; Tse, Chi-Shing; Kurby, Christopher A.
2011-01-01
Sereno, O’Donnell, and Sereno (2009) reported that words are recognised faster in a lexical decision task when their referents are physically large rather than small, suggesting that “semantic size” might be an important variable that should be considered in visual word recognition research and modelling. We sought to replicate their size effect, but failed to find a significant latency advantage in lexical decision for “big” words (cf. “small” words), even though we used the same word stimul...
Modified Parameters of Harmony Search Algorithm for Better Searching
Farraliza Mansor, Nur; Abal Abas, Zuraida; Samad Shibghatullah, Abdul; Rahman, Ahmad Fadzli Nizam Abdul
2017-08-01
The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. In this research, the integrated scheduling and rostering bus driver problems are defined as maximising the balance of the assignment of tasks in term of distribution of shifts and routes. It is essential to achieve is fairer among driver because this can bring to increase in driver levels of satisfaction. The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. In this respect, the three main operators in HS, namely the Harmony Memory Consideration Rate (HMCR), Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration. These parameters influence the overall performance of the HS algorithm, and therefore it is crucial to fine-tune them. The contributions to this research are the HMCR parameter using step function while the fret spacing concept on guitars that is associated with mathematical formulae is also applied in the BW parameter. The model of constant step function is introduced in the alteration of HMCR parameter. The experimental results revealed that our proposed approach is superior than parameter adaptive harmony search algorithm. In conclusion, this proposed approach managed to generate a fairer roster and was thus capable of maximising the balancing distribution of shifts and routes among drivers, which contributed to the lowering of illness, incidents, absenteeism and accidents.
Innovations for competitiveness: European views on "better-faster-cheaper"
Atzei, A.; Groepper, P.; Novara, M.; Pseiner, K.
1999-09-01
The paper elaborates on " lessons learned" from two recent ESA workshops, one focussing on the role of Innovation in the competitiveness of the space sector and the second on technology and engineering aspects conducive to better, faster and cheaper space programmes. The paper focuses primarily on four major aspects, namely: a) the adaptations of industrial and public organisations to the global market needs; b) the understanding of the bottleneck factors limiting competitiveness; c) the trends toward new system architectures and new engineering and production methods; d) the understanding of the role of new technology in the future applications. Under the pressure of market forces and the influence of many global and regional players, applications of space systems and technology are becoming more and more competitive. It is well recognised that without major effort for innovation in industrial practices, organisations, R&D, marketing and financial approaches the European space sector will stagnate and loose its competence as well as its competitiveness. It is also recognised that a programme run according to the "better, faster, cheaper" philosophy relies on much closer integration of system design, development and verification, and draws heavily on a robust and comprehensive programme of technology development, which must run in parallel and off-line with respect to flight programmes. A company's innovation capabilities will determine its future competitive advantage (in time, cost, performance or value) and overall growth potential. Innovation must be a process that can be counted on to provide repetitive, sustainable, long-term performance improvements. As such, it needs not depend on great breakthroughs in technology and concepts (which are accidental and rare). Rather, it could be based on bold evolution through the establishment of know-how, application of best practices, process effectiveness and high standards, performance measurement, and attention to
Hexagonal undersampling for faster MRI near metallic implants.
Sveinsson, Bragi; Worters, Pauline W; Gold, Garry E; Hargreaves, Brian A
2015-02-01
Slice encoding for metal artifact correction acquires a three-dimensional image of each excited slice with view-angle tilting to reduce slice and readout direction artifacts respectively, but requires additional imaging time. The purpose of this study was to provide a technique for faster imaging around metallic implants by undersampling k-space. Assuming that areas of slice distortion are localized, hexagonal sampling can reduce imaging time by 50% compared with conventional scans. This work demonstrates this technique by comparisons of fully sampled images with undersampled images, either from simulations from fully acquired data or from data actually undersampled during acquisition, in patients and phantoms. Hexagonal sampling is also shown to be compatible with parallel imaging and partial Fourier acquisitions. Image quality was evaluated using a structural similarity (SSIM) index. Images acquired with hexagonal undersampling had no visible difference in artifact suppression from fully sampled images. The SSIM index indicated high similarity to fully sampled images in all cases. The study demonstrates the ability to reduce scan time by undersampling without compromising image quality. © 2014 Wiley Periodicals, Inc.
Error tolerance in an NMR implementation of Grover's fixed-point quantum search algorithm
International Nuclear Information System (INIS)
Xiao Li; Jones, Jonathan A.
2005-01-01
We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored
Search for dark sectors in missing energy events
Enik, T; Rubbia, A; Depero, E; Krasnikov, N; Petukhov, O; Kuleshov, S; Volkov, P; Trifonov, A; Radics, B; Toropin, A; Dermenev, A; Ahmed, N; Peshekhonov, D; Peshekhonov, V; Kekelidze, G; Dusaev, R; Vasilishin, B; Crivelli, P; Tlisov, D; Karjavine, V; Donskov, S; Lyubovitsky, V; Zhukov, K; Kirsanov, M; Karneyeu, A; Matveev, V; Lysan, V; Samoylenko, V
The NA64 experiment (known as P348 at the proposal stage) is a fixed-target experiment at the CERN SPS combining the active beam dump and missing energy techniques to search for rare events. The experiment will build and operate a fully hermetic detector placed on the H4 beam line with the primary goal to search for light dark bosons (Z') from dark sector that are coupled to photons, e.g. dark photons (A'), or sub-GeV Z' coupled only to quarks. In some cases the Z' is coupled only to µ or tau, so we call the Z′ the dark leptonic gauge boson. The experiment is also capable to search for K_L -> invisible decay, which is complementary to K+ -> π+ + ν ν, and invisible decays of π0, η, η′, K_S mesons.
DEFF Research Database (Denmark)
Liapis, Antonios; Yannakakis, Georgios N.; Togelius, Julian
2013-01-01
pop genetic algorithm. These algorithms are applied to the problem of creating diverse and feasible game levels, representative of a large class of important problems in procedural content generation for games. Results show that the new algorithms under certain conditions can produce larger and more...... diverse sets of feasible strategy game maps than existing algorithms. However, the best algorithm is contingent on the particularities of the search space and the genetic operators used. It is also shown that the proposed enhancement of offspring boosting increases performance in all cases....
Fast dictionary generation and searching for magnetic resonance fingerprinting.
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.
Learning to Play in a Day: Faster Deep Reinforcement Learning by Optimality Tightening
He, Frank S.; Liu, Yang; Schwing, Alexander G.; Peng, Jian
2016-01-01
We propose a novel training algorithm for reinforcement learning which combines the strength of deep Q-learning with a constrained optimization approach to tighten optimality and encourage faster reward propagation. Our novel technique makes deep reinforcement learning more practical by drastically reducing the training time. We evaluate the performance of our approach on the 49 games of the challenging Arcade Learning Environment, and report significant improvements in both training time and...
A method of searching LDAP directories using XQuery
International Nuclear Information System (INIS)
Hesselroth, Ted
2011-01-01
A method by which an LDAP directory can be searched using XQuery is described. The strategy behind the tool consists of four steps. First the XQuery script is examined and relevant XPath expressions are extracted, determined to be sufficient to define all information needed to perform the query. Then the XPath expressions are converted into their equivalent LDAP search filters by use of the published LDAP schema of the service, and search requests are made to the LDAP host. The search results are then merged and converted to an XML document that conforms to the hierarchy of the LDAP schema. Finally, the XQuery script is executed on the working XML document by conventional means. Examples are given of application of the tool in the Open Science Grid, which for discovery purposes operates an LDAP server that contains Glue schema-based information on site configuration and authorization policies. The XQuery scripts compactly replace hundreds of lines of custom python code that relied on the unix ldapsearch utility. Installation of the tool is available through the Virtual Data Toolkit.
INTERFACING GOOGLE SEARCH ENGINE TO CAPTURE USER WEB SEARCH BEHAVIOR
Fadhilah Mat Yamin; T. Ramayah
2013-01-01
The behaviour of the searcher when using the search engine especially during the query formulation is crucial. Search engines capture users’ activities in the search log, which is stored at the search engine server. Due to the difficulty of obtaining this search log, this paper proposed and develops an interface framework to interface a Google search engine. This interface will capture users’ queries before redirect them to Google. The analysis of the search log will show that users are utili...
International Nuclear Information System (INIS)
Pothiya, Saravuth; Ngamroo, Issarachai; Kongprawechnon, Waree
2008-01-01
This paper presents a new optimization technique based on a multiple tabu search algorithm (MTS) to solve the dynamic economic dispatch (ED) problem with generator constraints. In the constrained dynamic ED problem, the load demand and spinning reserve capacity as well as some practical operation constraints of generators, such as ramp rate limits and prohibited operating zone are taken into consideration. The MTS algorithm introduces additional mechanisms such as initialization, adaptive searches, multiple searches, crossover and restarting process. To show its efficiency, the MTS algorithm is applied to solve constrained dynamic ED problems of power systems with 6 and 15 units. The results obtained from the MTS algorithm are compared to those achieved from the conventional approaches, such as simulated annealing (SA), genetic algorithm (GA), tabu search (TS) algorithm and particle swarm optimization (PSO). The experimental results show that the proposed MTS algorithm approaches is able to obtain higher quality solutions efficiently and with less computational time than the conventional approaches
Glass operational file. Operational models and integration calculations
International Nuclear Information System (INIS)
Ribet, I.
2004-01-01
This document presents the operational choices of dominating phenomena, hypotheses, equations and numerical data of the parameters used in the two operational models elaborated for the calculation of the glass source terms with respect to the waste packages considered: existing packages (R7T7, AVM and CEA glasses) and future ones (UOX2, UOX3, UMo, others). The overall operational choices are justified and demonstrated and a critical analysis of the approach is systematically proposed. The use of the operational model (OPM) V 0 → V r , realistic, conservative and robust, is recommended for glasses with a high thermal and radioactive load, which represent the main part of the vitrified wastes. The OPM V 0 S, much more overestimating but faster to parameterize, can be used for the long-term behaviour forecasting of glasses with low thermal and radioactive load, considering today's lack of knowledge for the parameterization of a V 0 → V r type OPM. Efficiency estimations have been made for R7T7 glasses (OPM V 0 → V r ) and AVM glasses (OPM V 0 S), which correspond to more than 99.9% of the vitrified waste packages activity. The very contrasted results obtained, illustrate the importance of the choice of operational models: in conditions representative of a geologic disposal, the estimation of R7T7-type package lifetime exceeds several hundred thousands years. Even if the estimated lifetime of AVM packages is much shorter (because of the overestimating character of the OPM V 0 S), the release potential radiotoxicity is of the same order as the one of R7T7 packages. (J.S.)
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).
Sisko, Andrea M; Keehan, Sean P; Cuckler, Gigi A; Madison, Andrew J; Smith, Sheila D; Wolfe, Christian J; Stone, Devin A; Lizonitz, Joseph M; Poisal, John A
2014-10-01
In 2013 health spending growth is expected to have remained slow, at 3.6 percent, as a result of the sluggish economic recovery, the effects of sequestration, and continued increases in private health insurance cost-sharing requirements. The combined effects of the Affordable Care Act's coverage expansions, faster economic growth, and population aging are expected to fuel health spending growth this year and thereafter (5.6 percent in 2014 and 6.0 percent per year for 2015-23). However, the average rate of increase through 2023 is projected to be slower than the 7.2 percent average growth experienced during 1990-2008. Because health spending is projected to grow 1.1 percentage points faster than the average economic growth during 2013-23, the health share of the gross domestic product is expected to rise from 17.2 percent in 2012 to 19.3 percent in 2023. Project HOPE—The People-to-People Health Foundation, Inc.
McElree, Brian; Carrasco, Marisa
2012-01-01
Feature and conjunction searches have been argued to delineate parallel and serial operations in visual processing. The authors evaluated this claim by examining the temporal dynamics of the detection of features and conjunctions. The 1st experiment used a reaction time (RT) task to replicate standard mean RT patterns and to examine the shapes of the RT distributions. The 2nd experiment used the response-signal speed–accuracy trade-off (SAT) procedure to measure discrimination (asymptotic detection accuracy) and detection speed (processing dynamics). Set size affected discrimination in both feature and conjunction searches but affected detection speed only in the latter. Fits of models to the SAT data that included a serial component overpredicted the magnitude of the observed dynamics differences. The authors concluded that both features and conjunctions are detected in parallel. Implications for the role of attention in visual processing are discussed. PMID:10641310
Children's Search Engines from an Information Search Process Perspective.
Broch, Elana
2000-01-01
Describes cognitive and affective characteristics of children and teenagers that may affect their Web searching behavior. Reviews literature on children's searching in online public access catalogs (OPACs) and using digital libraries. Profiles two Web search engines. Discusses some of the difficulties children have searching the Web, in the…
How Users Search the Library from a Single Search Box
Lown, Cory; Sierra, Tito; Boyer, Josh
2013-01-01
Academic libraries are turning increasingly to unified search solutions to simplify search and discovery of library resources. Unfortunately, very little research has been published on library user search behavior in single search box environments. This study examines how users search a large public university library using a prominent, single…
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.
International Nuclear Information System (INIS)
Shlesinger, Michael F
2009-01-01
There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.
Darroy, Jean Michel
1993-01-01
Current trends in the spacecraft mission operations area (spacecraft & mission complexity, project duration, required flexibility are requiring a breakthrough for what concerns philosophy, organization, and support tools. A major evolution is related to space operations 'informationalization', i.e adding to existing operations support & data processing systems a new generation of tools based on advanced information technologies (object-oriented programming, artificial intelligence, data bases, hypertext) that automate, at least partially, operations tasks that used be performed manually (mission & project planning/scheduling, operations procedures elaboration & execution, data analysis & failure diagnosis). All the major facets of this 'informationalization' are addressed at MATRA MARCONI SPACE, operational applications were fielded and generic products are becoming available. These various applications have generated a significant feedback from the users (at ESA, CNES, ARIANESPACE, MATRA MARCONI SPACE), which is now allowing us to precisely measure how the deployment of this new generation of tools, that we called OPSWARE, can 'reengineer' current spacecraft mission operations philosophy, how it can make space operations faster, better, and cheaper. This paper can be considered as an update of the keynote address 'Knowledge-Based Systems for Spacecraft Control' presented during the first 'Ground Data Systems for Spacecraft Control' conference in Darmstadt, June 1990, with a special emphasis on these last two years users feedback.
Lee, Sabrina S M; de Boef Miara, Maria; Arnold, Allison S; Biewener, Andrew A; Wakeling, James M
2013-01-15
Animals modulate the power output needed for different locomotor tasks by changing muscle forces and fascicle strain rates. To generate the necessary forces, appropriate motor units must be recruited. Faster motor units have faster activation-deactivation rates than slower motor units, and they contract at higher strain rates; therefore, recruitment of faster motor units may be advantageous for tasks that involve rapid movements or high rates of work. This study identified motor unit recruitment patterns in the gastrocnemii muscles of goats and examined whether faster motor units are recruited when locomotor speed is increased. The study also examined whether locomotor tasks that elicit faster (or slower) motor units are associated with increased (or decreased) in vivo tendon forces, force rise and relaxation rates, fascicle strains and/or strain rates. Electromyography (EMG), sonomicrometry and muscle-tendon force data were collected from the lateral and medial gastrocnemius muscles of goats during level walking, trotting and galloping and during inclined walking and trotting. EMG signals were analyzed using wavelet and principal component analyses to quantify changes in the EMG frequency spectra across the different locomotor conditions. Fascicle strain and strain rate were calculated from the sonomicrometric data, and force rise and relaxation rates were determined from the tendon force data. The results of this study showed that faster motor units were recruited as goats increased their locomotor speeds from level walking to galloping. Slow inclined walking elicited EMG intensities similar to those of fast level galloping but different EMG frequency spectra, indicating that recruitment of the different motor unit types depended, in part, on characteristics of the task. For the locomotor tasks and muscles analyzed here, recruitment patterns were generally associated with in vivo fascicle strain rates, EMG intensity and tendon force. Together, these data provide
Lee, Sabrina S. M.; de Boef Miara, Maria; Arnold, Allison S.; Biewener, Andrew A.; Wakeling, James M.
2013-01-01
SUMMARY Animals modulate the power output needed for different locomotor tasks by changing muscle forces and fascicle strain rates. To generate the necessary forces, appropriate motor units must be recruited. Faster motor units have faster activation–deactivation rates than slower motor units, and they contract at higher strain rates; therefore, recruitment of faster motor units may be advantageous for tasks that involve rapid movements or high rates of work. This study identified motor unit recruitment patterns in the gastrocnemii muscles of goats and examined whether faster motor units are recruited when locomotor speed is increased. The study also examined whether locomotor tasks that elicit faster (or slower) motor units are associated with increased (or decreased) in vivo tendon forces, force rise and relaxation rates, fascicle strains and/or strain rates. Electromyography (EMG), sonomicrometry and muscle-tendon force data were collected from the lateral and medial gastrocnemius muscles of goats during level walking, trotting and galloping and during inclined walking and trotting. EMG signals were analyzed using wavelet and principal component analyses to quantify changes in the EMG frequency spectra across the different locomotor conditions. Fascicle strain and strain rate were calculated from the sonomicrometric data, and force rise and relaxation rates were determined from the tendon force data. The results of this study showed that faster motor units were recruited as goats increased their locomotor speeds from level walking to galloping. Slow inclined walking elicited EMG intensities similar to those of fast level galloping but different EMG frequency spectra, indicating that recruitment of the different motor unit types depended, in part, on characteristics of the task. For the locomotor tasks and muscles analyzed here, recruitment patterns were generally associated with in vivo fascicle strain rates, EMG intensity and tendon force. Together, these
Faster self-paced rate of drinking for alcohol mixed with energy drinks versus alcohol alone.
Marczinski, Cecile A; Fillmore, Mark T; Maloney, Sarah F; Stamates, Amy L
2017-03-01
The consumption of alcohol mixed with energy drinks (AmED) has been associated with higher rates of binge drinking and impaired driving when compared with alcohol alone. However, it remains unclear why the risks of use of AmED are heightened compared with alcohol alone even when the doses of alcohol consumed are similar. Therefore, the purpose of this laboratory study was to investigate if the rate of self-paced beverage consumption was faster for a dose of AmED versus alcohol alone using a double-blind, within-subjects, placebo-controlled study design. Participants (n = 16) of equal gender who were social drinkers attended 4 separate test sessions that involved consumption of alcohol (1.97 ml/kg vodka) and energy drinks, alone and in combination. On each test day, the dose assigned was divided into 10 cups. Participants were informed that they would have a 2-h period to consume the 10 drinks. After the self-paced drinking period, participants completed a cued go/no-go reaction time (RT) task and subjective ratings of stimulation and sedation. The results indicated that participants consumed the AmED dose significantly faster (by ∼16 min) than the alcohol dose. For the performance task, participants' mean RTs were slower in the alcohol conditions and faster in the energy-drink conditions. In conclusion, alcohol consumers should be made aware that rapid drinking might occur for AmED beverages, thus heightening alcohol-related safety risks. The fast rate of drinking may be related to the generalized speeding of responses after energy-drink consumption. (PsycINFO Database Record (c) 2017 APA, all rights reserved).
The Permanent Magnet Operating Mechanism of Double Coil Parallel Driven at a High Speed
Directory of Open Access Journals (Sweden)
WEI Xau-Lao
2017-02-01
Full Text Available Abstract:Operating mechanism is the main part of breaker,and the quality of breaker will directly influence the safe operation of power system. Because of the continuous improvement requirements of switch,in order to mak this actuator faster and more powerful closing,this paper proposes a double coil parallel driven permanent magnet actuator at a high speed. This paper expounds the working principle of single and double coil parallel driven permanent magnet actuator. It uses Ansoft building model and contrasts test results. In prance we designed and produced the single and double coil parallel driven permanent magnet actuator for experimental study. The simulation and experiment results show that double coil parallel driven permanent magnet actuator,compared with single coil parallel driven permanent magnet actuator,has a better and faster action performance. Thus,the double coil parallel driven permanent magnet actuator achieves a kind of optimization.
Chinitz, David P
2016-05-31
Richard Saltman and Antonio Duran take up the challenging issue of governance in their article "Governance, Government and the Search for New Provider Models," and use two case studies of health policy changes in Sweden and Spain to shed light on the subject. In this commentary, I seek to link their conceptualization of governance, especially its interrelated roles at the macro, meso, and micro levels of health systems, with the case studies on which they report. While the case studies focus on the shifts in governance between the macro and meso levels and their impacts on achievement of desired policy outcomes, they also highlight the need to better integrate the dynamics of day to day operations within micro organizations into the overall governance picture. © 2016 by Kerman University of Medical Sciences.
Meadors, Grant David; Krishnan, Badri; Papa, Maria Alessandra; Whelan, John T.; Zhang, Yuanhao
2018-02-01
Continuous-wave (CW) gravitational waves (GWs) call for computationally-intensive methods. Low signal-to-noise ratio signals need templated searches with long coherent integration times and thus fine parameter-space resolution. Longer integration increases sensitivity. Low-mass x-ray binaries (LMXBs) such as Scorpius X-1 (Sco X-1) may emit accretion-driven CWs at strains reachable by current ground-based observatories. Binary orbital parameters induce phase modulation. This paper describes how resampling corrects binary and detector motion, yielding source-frame time series used for cross-correlation. Compared to the previous, detector-frame, templated cross-correlation method, used for Sco X-1 on data from the first Advanced LIGO observing run (O1), resampling is about 20 × faster in the costliest, most-sensitive frequency bands. Speed-up factors depend on integration time and search setup. The speed could be reinvested into longer integration with a forecast sensitivity gain, 20 to 125 Hz median, of approximately 51%, or from 20 to 250 Hz, 11%, given the same per-band cost and setup. This paper's timing model enables future setup optimization. Resampling scales well with longer integration, and at 10 × unoptimized cost could reach respectively 2.83 × and 2.75 × median sensitivities, limited by spin-wandering. Then an O1 search could yield a marginalized-polarization upper limit reaching torque-balance at 100 Hz. Frequencies from 40 to 140 Hz might be probed in equal observing time with 2 × improved detectors.
Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2
Directory of Open Access Journals (Sweden)
Ehrlich Hans-Christian
2012-07-01
Full Text Available Abstract Background Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software. The underlying algorithms, used over several decades, are designed for the application to general graphs. Applied on molecular graphs, little effort has been spend on characterizing their performance. Therefore, it is not clear how current substructure search algorithms behave on such special graphs. One of the main reasons why such an evaluation was not performed in the past was the absence of appropriate data sets. Results In this paper, we present a systematic evaluation of Ullmann’s and the VF2 subgraph isomorphism algorithms on molecular data. The benchmark set consists of a collection of 1235 SMARTS substructure expressions and selected molecules from the ZINC database. The benchmark evaluates substructures search times for complete database scans as well as individual substructure-molecule pairs. In detail, we focus on the influence of substructure formulation and size, the impact of molecule size, and the ability of both algorithms to be used on multiple cores. Conclusions The results show a clear superiority of the VF2 algorithm in all test scenarios. In general, both algorithms solve most instances in less than one millisecond, which we consider to be acceptable. Still, in direct comparison, the VF2 is most often several folds faster than Ullmann’s algorithm. Additionally, Ullmann’s algorithm shows a surprising number of run time outliers.
Faster algorithms for RNA-folding using the Four-Russians method.
Venkatachalam, Balaji; Gusfield, Dan; Frid, Yelena
2014-03-06
The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in O(n3) time using Nussinov's dynamic programming algorithm. The Four-Russians method is a technique that reduces the running time for certain dynamic programming algorithms by a multiplicative factor after a preprocessing step where solutions to all smaller subproblems of a fixed size are exhaustively enumerated and solved. Frid and Gusfield designed an O(n3logn) algorithm for RNA folding using the Four-Russians technique. In their algorithm the preprocessing is interleaved with the algorithm computation. We simplify the algorithm and the analysis by doing the preprocessing once prior to the algorithm computation. We call this the two-vector method. We also show variants where instead of exhaustive preprocessing, we only solve the subproblems encountered in the main algorithm once and memoize the results. We give a simple proof of correctness and explore the practical advantages over the earlier method.The Nussinov algorithm admits an O(n2) time parallel algorithm. We show a parallel algorithm using the two-vector idea that improves the time bound to O(n2logn). We have implemented the parallel algorithm on graphics processing units using the CUDA platform. We discuss the organization of the data structures to exploit coalesced memory access for fast running times. The ideas to organize the data structures also help in improving the running time of the serial algorithms. For sequences of length up to 6000 bases the parallel algorithm takes only about 2.5 seconds and the two-vector serial method takes about 57 seconds on a desktop and 15 seconds on a server. Among the serial algorithms, the two-vector and memoized versions are faster than the Frid-Gusfield algorithm by a factor of 3, and are faster than Nussinov by up to a factor of 20. The source-code for the algorithms is available at http://github.com/ijalabv/FourRussiansRNAFolding.
Russell-Rose, Tony; Chamberlain, Jon
2017-10-02
Healthcare information professionals play a key role in closing the knowledge gap between medical research and clinical practice. Their work involves meticulous searching of literature databases using complex search strategies that can consist of hundreds of keywords, operators, and ontology terms. This process is prone to error and can lead to inefficiency and bias if performed incorrectly. The aim of this study was to investigate the search behavior of healthcare information professionals, uncovering their needs, goals, and requirements for information retrieval systems. A survey was distributed to healthcare information professionals via professional association email discussion lists. It investigated the search tasks they undertake, their techniques for search strategy formulation, their approaches to evaluating search results, and their preferred functionality for searching library-style databases. The popular literature search system PubMed was then evaluated to determine the extent to which their needs were met. The 107 respondents indicated that their information retrieval process relied on the use of complex, repeatable, and transparent search strategies. On average it took 60 minutes to formulate a search strategy, with a search task taking 4 hours and consisting of 15 strategy lines. Respondents reviewed a median of 175 results per search task, far more than they would ideally like (100). The most desired features of a search system were merging search queries and combining search results. Healthcare information professionals routinely address some of the most challenging information retrieval problems of any profession. However, their needs are not fully supported by current literature search systems and there is demand for improved functionality, in particular regarding the development and management of search strategies. ©Tony Russell-Rose, Jon Chamberlain. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 02.10.2017.
Search times and probability of detection in time-limited search
Wilson, David; Devitt, Nicole; Maurer, Tana
2005-05-01
When modeling the search and target acquisition process, probability of detection as a function of time is important to war games and physical entity simulations. Recent US Army RDECOM CERDEC Night Vision and Electronics Sensor Directorate modeling of search and detection has focused on time-limited search. Developing the relationship between detection probability and time of search as a differential equation is explored. One of the parameters in the current formula for probability of detection in time-limited search corresponds to the mean time to detect in time-unlimited search. However, the mean time to detect in time-limited search is shorter than the mean time to detect in time-unlimited search and the relationship between them is a mathematical relationship between these two mean times. This simple relationship is derived.
Search Parameter Optimization for Discrete, Bayesian, and Continuous Search Algorithms
2017-09-01
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CONTINUOUS SEARCH ALGORITHMS by...to 09-22-2017 4. TITLE AND SUBTITLE SEARCH PARAMETER OPTIMIZATION FOR DISCRETE , BAYESIAN, AND CON- TINUOUS SEARCH ALGORITHMS 5. FUNDING NUMBERS 6...simple search and rescue acts to prosecuting aerial/surface/submersible targets on mission. This research looks at varying the known discrete and
Mac Giollabhui, Naoise; Nielsen, Johanna; Seidman, Sam; Olino, Thomas M; Abramson, Lyn Y; Alloy, Lauren B
2018-01-05
Hopelessness is implicated in multiple psychological disorders. Little is known, however, about the trajectory of hopelessness during adolescence or how emergent future orientation may influence its trajectory. Parallel process latent growth curve modelling tested whether (i) trajectories of future orientation and hopelessness and (ii) within-individual change in future orientation and hopelessness were related. The study was comprised of 472 adolescents [52% female, 47% Caucasian, 47% received free lunch] recruited at ages 12-13 who completed measures of future orientation and hopelessness at five annual assessments. The results indicate that a general decline in hopelessness across adolescence occurs quicker for those experiencing faster development of future orientation, when controlling for age, sex, low socio-economic status in addition to stressful life events in childhood and adolescence. Stressful childhood life events were associated with worse future orientation at baseline and negative life events experienced during adolescence were associated with both an increase in the trajectory of hopelessness as well as a decrease in the trajectory of future orientation. This study provides compelling evidence that the development of future orientation during adolescence is associated with a faster decline in hopelessness.
Directory of Open Access Journals (Sweden)
Yi Zhang
2017-04-01
Full Text Available Ear detection is an important step in ear recognition approaches. Most existing ear detection techniques are based on manually designing features or shallow learning algorithms. However, researchers found that the pose variation, occlusion, and imaging conditions provide a great challenge to the traditional ear detection methods under uncontrolled conditions. This paper proposes an efficient technique involving Multiple Scale Faster Region-based Convolutional Neural Networks (Faster R-CNN to detect ears from 2D profile images in natural images automatically. Firstly, three regions of different scales are detected to infer the information about the ear location context within the image. Then an ear region filtering approach is proposed to extract the correct ear region and eliminate the false positives automatically. In an experiment with a test set of 200 web images (with variable photographic conditions, 98% of ears were accurately detected. Experiments were likewise conducted on the Collection J2 of University of Notre Dame Biometrics Database (UND-J2 and University of Beira Interior Ear dataset (UBEAR, which contain large occlusion, scale, and pose variations. Detection rates of 100% and 98.22%, respectively, demonstrate the effectiveness of the proposed approach.
Evidence-based Medicine Search: a customizable federated search engine.
Bracke, Paul J; Howse, David K; Keim, Samuel M
2008-04-01
This paper reports on the development of a tool by the Arizona Health Sciences Library (AHSL) for searching clinical evidence that can be customized for different user groups. The AHSL provides services to the University of Arizona's (UA's) health sciences programs and to the University Medical Center. Librarians at AHSL collaborated with UA College of Medicine faculty to create an innovative search engine, Evidence-based Medicine (EBM) Search, that provides users with a simple search interface to EBM resources and presents results organized according to an evidence pyramid. EBM Search was developed with a web-based configuration component that allows the tool to be customized for different specialties. Informal and anecdotal feedback from physicians indicates that EBM Search is a useful tool with potential in teaching evidence-based decision making. While formal evaluation is still being planned, a tool such as EBM Search, which can be configured for specific user populations, may help lower barriers to information resources in an academic health sciences center.
Differential harmony search algorithm to optimize PWRs loading pattern
Energy Technology Data Exchange (ETDEWEB)
Poursalehi, N., E-mail: npsalehi@yahoo.com [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of); Zolfaghari, A.; Minuchehr, A. [Engineering Department, Shahid Beheshti University, G.C, P.O.Box: 1983963113, Tehran (Iran, Islamic Republic of)
2013-04-15
Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms.
Differential harmony search algorithm to optimize PWRs loading pattern
International Nuclear Information System (INIS)
Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.
2013-01-01
Highlights: ► Exploit of DHS algorithm in LP optimization reveals its flexibility, robustness and reliability. ► Upshot of our experiments with DHS shows that the search approach to optimal LP is quickly. ► On the average, the final band width of DHS fitness values is narrow relative to HS and GHS. -- Abstract: The objective of this work is to develop a core loading optimization technique using differential harmony search algorithm in the context of obtaining an optimal configuration of fuel assemblies in pressurized water reactors. To implement and evaluate the proposed technique, differential harmony search nodal expansion package for 2-D geometry, DHSNEP-2D, is developed. The package includes two modules; in the first modules differential harmony search (DHS) is implemented and nodal expansion code which solves two dimensional-multi group neutron diffusion equations using fourth degree flux expansion with one node per a fuel assembly is in the second module. For evaluation of DHS algorithm, classical harmony search (HS) and global-best harmony search (GHS) algorithms are also included in DHSNEP-2D in order to compare the outcome of techniques together. For this purpose, two PWR test cases have been investigated to demonstrate the DHS algorithm capability in obtaining near optimal loading pattern. Results show that the convergence rate of DHS and execution times are quite promising and also is reliable for the fuel management operation. Moreover, numerical results show the good performance of DHS relative to other competitive algorithms such as genetic algorithm (GA), classical harmony search (HS) and global-best harmony search (GHS) algorithms
International Nuclear Information System (INIS)
Al-Othman, A.K.; El-Naggar, K.M.
2008-01-01
Direct search methods are evolutionary algorithms used to solve optimization problems. (DS) methods do not require any information about the gradient of the objective function at hand while searching for an optimum solution. One of such methods is Pattern Search (PS) algorithm. This paper presents a new approach based on a constrained pattern search algorithm to solve a security constrained power system economic dispatch problem (SCED) with non-smooth cost function. Operation of power systems demands a high degree of security to keep the system satisfactorily operating when subjected to disturbances, while and at the same time it is required to pay attention to the economic aspects. Pattern recognition technique is used first to assess dynamic security. Linear classifiers that determine the stability of electric power system are presented and added to other system stability and operational constraints. The problem is formulated as a constrained optimization problem in a way that insures a secure-economic system operation. Pattern search method is then applied to solve the constrained optimization formulation. In particular, the method is tested using three different test systems. Simulation results of the proposed approach are compared with those reported in literature. The outcome is very encouraging and proves that pattern search (PS) is very applicable for solving security constrained power system economic dispatch problem (SCED). In addition, valve-point effect loading and total system losses are considered to further investigate the potential of the PS technique. Based on the results, it can be concluded that the PS has demonstrated ability in handling highly nonlinear discontinuous non-smooth cost function of the SCED. (author)
Stochastic local search foundations and applications
Hoos, Holger H; Stutzle, Thomas
2004-01-01
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics. Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful too...
Effective operators in SUSY, superfield constraints and searches for a UV completion
Dudas, E.
2015-01-01
We discuss the role of a class of higher dimensional operators in 4D N=1 supersymmetric effective theories. The Lagrangian in such theories is an expansion in momenta below the scale of "new physics" ($\\Lambda$) and contains the effective operators generated by integrating out the "heavy states" above $\\Lambda$ present in the UV complete theory. We go beyond the "traditional" leading order in this momentum expansion (in $\\partial/\\Lambda$). Keeping manifest supersymmetry and using superfield {\\it constraints} we show that the corresponding higher dimensional (derivative) operators in the sectors of chiral, linear and vector superfields of a Lagrangian can be "unfolded" into second-order operators. The "unfolded" formulation has only polynomial interactions and additional massive superfields, some of which are ghost-like if the effective operators were {\\it quadratic} in fields. Using this formulation, the UV theory emerges naturally and fixes the (otherwise unknown) coefficient and sign of the initial (higher...
Search for Invisible Axion Dark Matter with the Axion Dark Matter Experiment.
Du, N; Force, N; Khatiwada, R; Lentz, E; Ottens, R; Rosenberg, L J; Rybka, G; Carosi, G; Woollett, N; Bowring, D; Chou, A S; Sonnenschein, A; Wester, W; Boutan, C; Oblath, N S; Bradley, R; Daw, E J; Dixit, A V; Clarke, J; O'Kelley, S R; Crisosto, N; Gleason, J R; Jois, S; Sikivie, P; Stern, I; Sullivan, N S; Tanner, D B; Hilton, G C
2018-04-13
This Letter reports the results from a haloscope search for dark matter axions with masses between 2.66 and 2.81 μeV. The search excludes the range of axion-photon couplings predicted by plausible models of the invisible axion. This unprecedented sensitivity is achieved by operating a large-volume haloscope at subkelvin temperatures, thereby reducing thermal noise as well as the excess noise from the ultralow-noise superconducting quantum interference device amplifier used for the signal power readout. Ongoing searches will provide nearly definitive tests of the invisible axion model over a wide range of axion masses.
Search the Audio, Browse the Video—A Generic Paradigm for Video Collections
Directory of Open Access Journals (Sweden)
Efrat Alon
2003-01-01
Full Text Available The amount of digital video being shot, captured, and stored is growing at a rate faster than ever before. The large amount of stored video is not penetrable without efficient video indexing, retrieval, and browsing technology. Most prior work in the field can be roughly categorized into two classes. One class is based on image processing techniques, often called content-based image and video retrieval, in which video frames are indexed and searched for visual content. The other class is based on spoken document retrieval, which relies on automatic speech recognition and text queries. Both approaches have major limitations. In the first approach, semantic queries pose a great challenge, while the second, speech-based approach, does not support efficient video browsing. This paper describes a system where speech is used for efficient searching and visual data for efficient browsing, a combination that takes advantage of both approaches. A fully automatic indexing and retrieval system has been developed and tested. Automated speech recognition and phonetic speech indexing support text-to-speech queries. New browsable views are generated from the original video. A special synchronized browser allows instantaneous, context-preserving switching from one view to another. The system was successfully used to produce searchable-browsable video proceedings for three local conferences.
Accelerating Smith-Waterman Algorithm for Biological Database Search on CUDA-Compatible GPUs
Munekawa, Yuma; Ino, Fumihiko; Hagihara, Kenichi
This paper presents a fast method capable of accelerating the Smith-Waterman algorithm for biological database search on a cluster of graphics processing units (GPUs). Our method is implemented using compute unified device architecture (CUDA), which is available on the nVIDIA GPU. As compared with previous methods, our method has four major contributions. (1) The method efficiently uses on-chip shared memory to reduce the data amount being transferred between off-chip video memory and processing elements in the GPU. (2) It also reduces the number of data fetches by applying a data reuse technique to query and database sequences. (3) A pipelined method is also implemented to overlap GPU execution with database access. (4) Finally, a master/worker paradigm is employed to accelerate hundreds of database searches on a cluster system. In experiments, the peak performance on a GeForce GTX 280 card reaches 8.32 giga cell updates per second (GCUPS). We also find that our method reduces the amount of data fetches to 1/140, achieving approximately three times higher performance than a previous CUDA-based method. Our 32-node cluster version is approximately 28 times faster than a single GPU version. Furthermore, the effective performance reaches 75.6 giga instructions per second (GIPS) using 32 GeForce 8800 GTX cards.
Radar search and detection with the CASA 212 S43 aircraft
Landa Borges, José Manuel
2004-01-01
Approved for public release; distribution in unlimited. This research develops a detection rate model to analyze the effectiveness of the RDR 1500B search radar installed in the CASA 212 S43 aircraft belonging to Venezuelan Naval Aviation. The model is based on a search and detection mission to find a diesel submarine executing an incursion inside the Venezuelan Caribbean Sea area, assumed to be intermittently operating with periscopes or masts exposed above the sea surface. The analysis o...
User-assisted visual search and tracking across distributed multi-camera networks
Raja, Yogesh; Gong, Shaogang; Xiang, Tao
2011-11-01
Human CCTV operators face several challenges in their task which can lead to missed events, people or associations, including: (a) data overload in large distributed multi-camera environments; (b) short attention span; (c) limited knowledge of what to look for; and (d) lack of access to non-visual contextual intelligence to aid search. Developing a system to aid human operators and alleviate such burdens requires addressing the problem of automatic re-identification of people across disjoint camera views, a matching task made difficult by factors such as lighting, viewpoint and pose changes and for which absolute scoring approaches are not best suited. Accordingly, we describe a distributed multi-camera tracking (MCT) system to visually aid human operators in associating people and objects effectively over multiple disjoint camera views in a large public space. The system comprises three key novel components: (1) relative measures of ranking rather than absolute scoring to learn the best features for matching; (2) multi-camera behaviour profiling as higher-level knowledge to reduce the search space and increase the chance of finding correct matches; and (3) human-assisted data mining to interactively guide search and in the process recover missing detections and discover previously unknown associations. We provide an extensive evaluation of the greater effectiveness of the system as compared to existing approaches on industry-standard i-LIDS multi-camera data.
Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth
2015-01-01
Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063
McGreevy, Michael W.; Connors, Mary M. (Technical Monitor)
2001-01-01
To support Search Requests and Quick Responses at the Aviation Safety Reporting System (ASRS), four new QUORUM methods have been developed: keyword search, phrase search, phrase generation, and phrase discovery. These methods build upon the core QUORUM methods of text analysis, modeling, and relevance-ranking. QUORUM keyword search retrieves ASRS incident narratives that contain one or more user-specified keywords in typical or selected contexts, and ranks the narratives on their relevance to the keywords in context. QUORUM phrase search retrieves narratives that contain one or more user-specified phrases, and ranks the narratives on their relevance to the phrases. QUORUM phrase generation produces a list of phrases from the ASRS database that contain a user-specified word or phrase. QUORUM phrase discovery finds phrases that are related to topics of interest. Phrase generation and phrase discovery are particularly useful for finding query phrases for input to QUORUM phrase search. The presentation of the new QUORUM methods includes: a brief review of the underlying core QUORUM methods; an overview of the new methods; numerous, concrete examples of ASRS database searches using the new methods; discussion of related methods; and, in the appendices, detailed descriptions of the new methods.
A hybrid search algorithm for swarm robots searching in an unknown environment.
Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao
2014-01-01
This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.
Search for technetium in natural tin metallurgical residues
Energy Technology Data Exchange (ETDEWEB)
Parker, C.W.
1996-07-01
Possible instability of baryons inside the nuclei might result in accumulation of rare isotopes in natural ores. In this respect, isotopes of technetium have certain advantages that can be useful in the search for technetium in nonradioactive ores by chemical methods. In this paper, we review the history of technetium research and discuss a new approach to the search for natural technetium associated with tin ores which appears to offer a rare possibility of discovering a smelting operation by-product such as flue dust, in which the volatile technetium heptoxide (Tc{sub 2}O{sub 7}), like rhenium heptoxide (Re{sub 2}O{sub 7}), would be expected to concentrate. Our concept of a search for technetium in these materials would be based on the assumption that traces of rhenium could occur in the ore and could be traced most easily by neutron activation of small samples. Such a procedure would confirm that an enrichment from the ore to the flue dust actually occurs with the rhenium and therefore should occur with technetium. Furthermore, this occurrence should identify the best location to search for technetium.
Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates
Pearce, Roger
2014-11-01
© 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%
Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates
Pearce, Roger; Gokhale, Maya; Amato, Nancy M.
2014-01-01
© 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%
Top-k Keyword Search Over Graphs Based On Backward Search
Directory of Open Access Journals (Sweden)
Zeng Jia-Hui
2017-01-01
Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.
People searching for people: analysis of a people search engine log
Weerkamp, W.; Berendsen, R.; Kovachev, B.; Meij, E.; Balog, K.; de Rijke, M.
2011-01-01
Recent years show an increasing interest in vertical search: searching within a particular type of information. Understanding what people search for in these "verticals" gives direction to research and provides pointers for the search engines themselves. In this paper we analyze the search logs of
Elmer, Stefan; Greber, Marielle; Pushparaj, Arethy; Kühnis, Jürg; Jäncke, Lutz
2017-09-01
The ability to discriminate phonemes varying in spectral and temporal attributes constitutes one of the most basic intrinsic elements underlying language learning mechanisms. Since previous work has consistently shown that professional musicians are characterized by perceptual and cognitive advantages in a variety of language-related tasks, and since vowels can be considered musical sounds within the domain of speech, here we investigated the behavioral and electrophysiological correlates of native vowel discrimination learning in a sample of professional musicians and non-musicians. We evaluated the contribution of both the neurophysiological underpinnings of perceptual (i.e., N1/P2 complex) and mnemonic functions (i.e., N400 and P600 responses) while the participants were instructed to judge whether pairs of native consonant-vowel (CV) syllables manipulated in the first formant transition of the vowel (i.e., from /tu/ to /to/) were identical or not. Results clearly demonstrated faster learning in musicians, compared to non-musicians, as reflected by shorter reaction times and higher accuracy. Most notably, in terms of morphology, time course, and voltage strength, this steeper learning curve was accompanied by distinctive N400 and P600 manifestations between the two groups. In contrast, we did not reveal any group differences during the early stages of auditory processing (i.e., N1/P2 complex), suggesting that faster learning was mediated by an optimization of mnemonic but not perceptual functions. Based on a clear taxonomy of the mnemonic functions involved in the task, results are interpreted as pointing to a relationship between faster learning mechanisms in musicians and an optimization of echoic (i.e., N400 component) and working memory (i.e., P600 component) functions. Copyright © 2017 Elsevier Ltd. All rights reserved.
Contextual remapping in visual search after predictable target-location changes.
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.
Search for new ternary Al, Ga or In containing phases using information forecasting system
International Nuclear Information System (INIS)
Kiseleva, N.N.; Burkhanov, G.S.
1989-01-01
Automated system of search for regularities in the formation of crystal phases and forecasting of new compounds with required properties, comprising data base on the properties of ternary inorganic compounds and cybernetic forecasting system, has been developed. General principles of operation of the developed information-forecasting system are considered. Efficiency of the system operation is shown, using as an example the search for new ternary compounds with aluminium, gallium and indium, crystallized in ZrNiAl, TiNiSi, ThCr 2 Si 2 , CaAl 2 Si 2 structural types. Results of the above-mentioned phases forecasting are shown
Faster proton transfer dynamics of water on SnO2 compared to TiO2.
Kumar, Nitin; Kent, Paul R C; Bandura, Andrei V; Kubicki, James D; Wesolowski, David J; Cole, David R; Sofo, Jorge O
2011-01-28
Proton jump processes in the hydration layer on the iso-structural TiO(2) rutile (110) and SnO(2) cassiterite (110) surfaces were studied with density functional theory molecular dynamics. We find that the proton jump rate is more than three times faster on cassiterite compared with rutile. A local analysis based on the correlation between the stretching band of the O-H vibrations and the strength of H-bonds indicates that the faster proton jump activity on cassiterite is produced by a stronger H-bond formation between the surface and the hydration layer above the surface. The origin of the increased H-bond strength on cassiterite is a combined effect of stronger covalent bonding and stronger electrostatic interactions due to differences of its electronic structure. The bridging oxygens form the strongest H-bonds between the surface and the hydration layer. This higher proton jump rate is likely to affect reactivity and catalytic activity on the surface. A better understanding of its origins will enable methods to control these rates.
I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis
DEFF Research Database (Denmark)
Lauritsen, Thomas; Kolenda, Thomas
2002-01-01
We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....
Market Dominance and Search Quality in the Search Engine Market
Lianos, I.; Motchenkova, E.I.
2013-01-01
We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises
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.
Enhancing discovery in spatial data infrastructures using a search engine
Directory of Open Access Journals (Sweden)
Paolo Corti
2018-05-01
Full Text Available A spatial data infrastructure (SDI is a framework of geospatial data, metadata, users and tools intended to provide an efficient and flexible way to use spatial information. One of the key software components of an SDI is the catalogue service which is needed to discover, query and manage the metadata. Catalogue services in an SDI are typically based on the Open Geospatial Consortium (OGC Catalogue Service for the Web (CSW standard which defines common interfaces for accessing the metadata information. A search engine is a software system capable of supporting fast and reliable search, which may use ‘any means necessary’ to get users to the resources they need quickly and efficiently. These techniques may include full text search, natural language processing, weighted results, fuzzy tolerance results, faceting, hit highlighting, recommendations and many others. In this paper we present an example of a search engine being added to an SDI to improve search against large collections of geospatial datasets. The Centre for Geographic Analysis (CGA at Harvard University re-engineered the search component of its public domain SDI (Harvard WorldMap which is based on the GeoNode platform. A search engine was added to the SDI stack to enhance the CSW catalogue discovery abilities. It is now possible to discover spatial datasets from metadata by using the standard search operations of the catalogue and to take advantage of the new abilities of the search engine, to return relevant and reliable content to SDI users.
Method of Improving Personal Name Search in Academic Information Service
Directory of Open Access Journals (Sweden)
Heejun Han
2012-12-01
Full Text Available All academic information on the web or elsewhere has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most information is composed of a title, an author, and contents. An essay which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of personal names. It also describes a method for providing the results of searching co-authors and related researchers in searching personal names. This method can be effectively applied to providing accurate and additional search results in the academic information services.
Searching for Orphan radiation sources
International Nuclear Information System (INIS)
Bystrov, Evgenij; Antonau, Uladzimir; Gurinovich, Uladzimir; Kazhamiakin, Valery; Petrov, Vitaly; Shulhovich, Heorhi; Tischenko, Siarhei
2008-01-01
Full text: The problem of orphan sources cannot be left unaddressed due high probability of accidental exposure and use of sources for terrorism. Search of objects of this kind is complex particularly when search territory is large. This requires devices capable of detecting sources, identifying their radionuclide composition, and correlating scan results to geographical coordinates and displaying results on a map. Spectral radiation scanner AT6101C can fulfill the objective of search for gamma and neutron radiation sources, radionuclide composition identification, correlation results to geographical coordinates and displaying results on a map. The scanner consists of gamma radiation scintillation detection unit based on NaI(Tl) crystal, neutron detection unit based on two He 3 counters, GPS receiver and portable ruggedized computer. Built-in and application software automates entire scan process, saving all results to memory for further analysis with visual representation of results as spectral information diagrams, count rate profile and gamma radiation dose rates on a geographical map. The scanner informs operator with voice messages on detection of radiation sources, identification result and other events. Scanner detection units and accessories are packed in a backpack. Weighing 7 kg, the scanner is human portable and can be used for scan inside cars. The scanner can also be used for radiation mapping and inspections. (author)
International Nuclear Information System (INIS)
Helbren, Emma; Taylor, Stuart A.; Fanshawe, Thomas R.; Mallett, Susan; Phillips, Peter; Boone, Darren; Gale, Alastair; Altman, Douglas G.; Manning, David; Halligan, Steve
2015-01-01
We aimed to identify the effect of computer-aided detection (CAD) on visual search and performance in CT Colonography (CTC) of inexperienced and experienced readers. Fifteen endoluminal CTC examinations were recorded, each with one polyp, and two videos were generated, one with and one without a CAD mark. Forty-two readers (17 experienced, 25 inexperienced) interpreted the videos during infrared visual search recording. CAD markers and polyps were treated as regions of interest in data processing. This multi-reader, multi-case study was analysed using multilevel modelling. CAD drew readers' attention to polyps faster, accelerating identification times: median 'time to first pursuit' was 0.48 s (IQR 0.27 to 0.87 s) with CAD, versus 0.58 s (IQR 0.35 to 1.06 s) without. For inexperienced readers, CAD also held visual attention for longer. All visual search metrics used to assess visual gaze behaviour demonstrated statistically significant differences when ''with'' and ''without'' CAD were compared. A significant increase in the number of correct polyp identifications across all readers was seen with CAD (74 % without CAD, 87 % with CAD; p < 0.001). CAD significantly alters visual search and polyp identification in readers viewing three-dimensional endoluminal CTC. For polyp and CAD marker pursuit times, CAD generally exerted a larger effect on inexperienced readers. (orig.)
Energy Technology Data Exchange (ETDEWEB)
Helbren, Emma; Taylor, Stuart A. [University College London, Centre for Medical Imaging, London (United Kingdom); Fanshawe, Thomas R.; Mallett, Susan [University of Oxford, Nuffield Department of Primary Care Health Sciences, Oxford (United Kingdom); Phillips, Peter [University of Cumbria, Health and Medical Sciences Group, Lancaster (United Kingdom); Boone, Darren [Colchester Hospital University NHS Foundation Trust and Anglia University, Colchester (United Kingdom); Gale, Alastair [Loughborough University, Applied Vision Research Centre, Loughborough (United Kingdom); Altman, Douglas G. [University of Oxford, Centre for Statistics in Medicine, Oxford (United Kingdom); Manning, David [Lancaster University, Lancaster Medical School, Faculty of Health and Medicine, Lancaster (United Kingdom); Halligan, Steve [University College London, Centre for Medical Imaging, London (United Kingdom); University College Hospital, Gastrointestinal Radiology, University College London, Centre for Medical Imaging, Podium Level 2, London, NW1 2BU (United Kingdom)
2015-06-01
We aimed to identify the effect of computer-aided detection (CAD) on visual search and performance in CT Colonography (CTC) of inexperienced and experienced readers. Fifteen endoluminal CTC examinations were recorded, each with one polyp, and two videos were generated, one with and one without a CAD mark. Forty-two readers (17 experienced, 25 inexperienced) interpreted the videos during infrared visual search recording. CAD markers and polyps were treated as regions of interest in data processing. This multi-reader, multi-case study was analysed using multilevel modelling. CAD drew readers' attention to polyps faster, accelerating identification times: median 'time to first pursuit' was 0.48 s (IQR 0.27 to 0.87 s) with CAD, versus 0.58 s (IQR 0.35 to 1.06 s) without. For inexperienced readers, CAD also held visual attention for longer. All visual search metrics used to assess visual gaze behaviour demonstrated statistically significant differences when ''with'' and ''without'' CAD were compared. A significant increase in the number of correct polyp identifications across all readers was seen with CAD (74 % without CAD, 87 % with CAD; p < 0.001). CAD significantly alters visual search and polyp identification in readers viewing three-dimensional endoluminal CTC. For polyp and CAD marker pursuit times, CAD generally exerted a larger effect on inexperienced readers. (orig.)
International Nuclear Information System (INIS)
Mueller, Monika C.M.
2013-01-01
The documentation on the Loccum meeting 2013 includes contributions on the following topics: Public participation for the final repository search; Lessons learned from the past; Public participation: what is expected? Experiences of repository operators on public participation; The TRIPLEX concept; From Gorleben to the law on final repository search: a long and a short story; Public participation concerning radioactive waste storage; The public has to be informed on the radioactive waste problem and the possible solutions; After consensus is before consensus - German final repository conflict between legislation and simulated public participation; Political concept of public participation; A fast final repository law will not bring about social peace; Good public participation on final repository search - requirements, challenges, questions and approaches.
Middlemen: A Directed Search Equilibrium Approach
Makoto Watanabe
2012-01-01
This paper studies an intermediated market operated by middlemen with high inventory holdings. I present a directed search model in which middlemen are less likely to experience a stockout because they have the advantage of inventory capacity, relative to other sellers. The model explains why popular items are sold at a larger premium, and everyday items at a larger discount, by large-scaled intermediaries. The concentration of middlemen's market, i.e., few middlemen, each with large capacity...
DEFF Research Database (Denmark)
Pisinger, David; Røpke, Stefan
2010-01-01
Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...
Dyniqx: a novel meta-search engine for metadata based cross search
Zhu, Jianhan; Song, Dawei; Eisenstadt, Marc; Barladeanu, Cristi; Rüger, Stefan
2008-01-01
The effect of metadata in collection fusion has not been sufficiently studied. In response to this, we present a novel meta-search engine called Dyniqx for metadata based cross search. Dyniqx exploits the availability of metadata in academic search services such as PubMed and Google Scholar etc for fusing search results from heterogeneous search engines. In addition, metadata from these search engines are used for generating dynamic query controls such as sliders and tick boxes etc which are ...
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.
Electroweak scale physics & exotic searches at LHCb
Lupton, Olli
2018-01-01
The LHCb detector is a single-arm forward spectrometer covering the pseudorapidity range 2–5 that is principally designed for the study of b- and c-hadrons, but which is well-suited to a wide variety of electroweak scale measurements and exotic searches that are highly complementary to other experiments at the LHC and elsewhere. Several features of the detector that are crucial for the core flavour physics programme, such as excellent vertex and momentum resolution, and a powerful trigger system, contribute to excellent jet tagging performance and sensitivity to low mass exotic states. LHCb operates at a substantially lower instantaneous luminosity than the general purpose detectors at the LHC, ATLAS and CMS, which results in a clean, low pile-up environment in which to search for physics beyond the Standard Model (SM).
Directory of Open Access Journals (Sweden)
David P Chinitz
2016-09-01
Full Text Available Richard Saltman and Antonio Duran take up the challenging issue of governance in their article “Governance, Government and the Search for New Provider Models,” and use two case studies of health policy changes in Sweden and Spain to shed light on the subject. In this commentary, I seek to link their conceptualization of governance, especially its interrelated roles at the macro, meso, and micro levels of health systems, with the case studies on which they report. While the case studies focus on the shifts in governance between the macro and meso levels and their impacts on achievement of desired policy outcomes, they also highlight the need to better integrate the dynamics of day to day operations within micro organizations into the overall governance picture.
Garman, Nancy
1999-01-01
Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)
Tunkelang, Daniel
2009-01-01
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more
Beyond the search surface: visual search and attentional engagement.
Duncan, J; Humphreys, G
1992-05-01
Treisman (1991) described a series of visual search studies testing feature integration theory against an alternative (Duncan & Humphreys, 1989) in which feature and conjunction search are basically similar. Here the latter account is noted to have 2 distinct levels: (a) a summary of search findings in terms of stimulus similarities, and (b) a theory of how visual attention is brought to bear on relevant objects. Working at the 1st level, Treisman found that even when similarities were calibrated and controlled, conjunction search was much harder than feature search. The theory, however, can only really be tested at the 2nd level, because the 1st is an approximation. An account of the findings is developed at the 2nd level, based on the 2 processes of input-template matching and spreading suppression. New data show that, when both of these factors are controlled, feature and conjunction search are equally difficult. Possibilities for unification of the alternative views are considered.
Faster Simulation Methods for the Nonstationary Random Vibrations of Non-linear MDOF Systems
DEFF Research Database (Denmark)
Askar, A.; Köylüo, U.; Nielsen, Søren R.K.
1996-01-01
subject to nonstationary Gaussian white noise excitation, as an alternative to conventional direct simulation methods. These alternative simulation procedures rely on an assumption of local Gaussianity during each time step. This assumption is tantamount to various linearizations of the equations....... Such a treatment offers higher rates of convergence, faster speed and higher accuracy. These procedures are compared to the direct Monte Carlo simulation procedure, which uses a fourth order Runge-Kutta scheme with the white noise process approximated by a broad band Ruiz-Penzien broken line process...
Basu, Rajratan; Kinnamon, Daniel; Skaggs, Nicole; Womack, James
2016-05-01
The in-plane switching (IPS) for a nematic liquid crystal (LC) was found to be considerably faster when the LC was doped with dilute concentrations of monolayer graphene flakes. Additional studies revealed that the presence of graphene reduced the rotational viscosity of the LC, permitting the nematic director to respond quicker in IPS mode on turning the electric field on. The studies were carried out with several graphene concentrations in the LC, and the experimental results coherently suggest that there exists an optimal concentration of graphene, allowing a reduction in the IPS response time and rotational viscosity in the LC. Above this optimal graphene concentration, the rotational viscosity was found to increase, and consequently, the LC no longer switched faster in IPS mode. The presence of graphene suspension was also found to decrease the LC's pretilt angle significantly due to the π-π electron stacking between the LC molecules and graphene flakes. To understand the π-π stacking interaction, the anchoring mechanism of the LC on a CVD grown monolayer graphene film on copper substrate was studied by reflected crossed polarized microscopy. Optical microphotographs revealed that the LC alignment direction depended on monolayer graphene's hexagonal crystal structure and its orientation.
International Nuclear Information System (INIS)
Basu, Rajratan; Kinnamon, Daniel; Skaggs, Nicole; Womack, James
2016-01-01
The in-plane switching (IPS) for a nematic liquid crystal (LC) was found to be considerably faster when the LC was doped with dilute concentrations of monolayer graphene flakes. Additional studies revealed that the presence of graphene reduced the rotational viscosity of the LC, permitting the nematic director to respond quicker in IPS mode on turning the electric field on. The studies were carried out with several graphene concentrations in the LC, and the experimental results coherently suggest that there exists an optimal concentration of graphene, allowing a reduction in the IPS response time and rotational viscosity in the LC. Above this optimal graphene concentration, the rotational viscosity was found to increase, and consequently, the LC no longer switched faster in IPS mode. The presence of graphene suspension was also found to decrease the LC's pretilt angle significantly due to the π-π electron stacking between the LC molecules and graphene flakes. To understand the π-π stacking interaction, the anchoring mechanism of the LC on a CVD grown monolayer graphene film on copper substrate was studied by reflected crossed polarized microscopy. Optical microphotographs revealed that the LC alignment direction depended on monolayer graphene's hexagonal crystal structure and its orientation.
Energy Technology Data Exchange (ETDEWEB)
Basu, Rajratan, E-mail: basu@usna.edu; Kinnamon, Daniel; Skaggs, Nicole; Womack, James [Soft Matter and Nanomaterials Laboratory, Department of Physics, The United States Naval Academy, Annapolis, Maryland 21402 (United States)
2016-05-14
The in-plane switching (IPS) for a nematic liquid crystal (LC) was found to be considerably faster when the LC was doped with dilute concentrations of monolayer graphene flakes. Additional studies revealed that the presence of graphene reduced the rotational viscosity of the LC, permitting the nematic director to respond quicker in IPS mode on turning the electric field on. The studies were carried out with several graphene concentrations in the LC, and the experimental results coherently suggest that there exists an optimal concentration of graphene, allowing a reduction in the IPS response time and rotational viscosity in the LC. Above this optimal graphene concentration, the rotational viscosity was found to increase, and consequently, the LC no longer switched faster in IPS mode. The presence of graphene suspension was also found to decrease the LC's pretilt angle significantly due to the π-π electron stacking between the LC molecules and graphene flakes. To understand the π-π stacking interaction, the anchoring mechanism of the LC on a CVD grown monolayer graphene film on copper substrate was studied by reflected crossed polarized microscopy. Optical microphotographs revealed that the LC alignment direction depended on monolayer graphene's hexagonal crystal structure and its orientation.
Biobotic insect swarm based sensor networks for search and rescue
Bozkurt, Alper; Lobaton, Edgar; Sichitiu, Mihail; Hedrick, Tyson; Latif, Tahmid; Dirafzoon, Alireza; Whitmire, Eric; Verderber, Alexander; Marin, Juan; Xiong, Hong
2014-06-01
The potential benefits of distributed robotics systems in applications requiring situational awareness, such as search-and-rescue in emergency situations, are indisputable. The efficiency of such systems requires robotic agents capable of coping with uncertain and dynamic environmental conditions. For example, after an earthquake, a tremendous effort is spent for days to reach to surviving victims where robotic swarms or other distributed robotic systems might play a great role in achieving this faster. However, current technology falls short of offering centimeter scale mobile agents that can function effectively under such conditions. Insects, the inspiration of many robotic swarms, exhibit an unmatched ability to navigate through such environments while successfully maintaining control and stability. We have benefitted from recent developments in neural engineering and neuromuscular stimulation research to fuse the locomotory advantages of insects with the latest developments in wireless networking technologies to enable biobotic insect agents to function as search-and-rescue agents. Our research efforts towards this goal include development of biobot electronic backpack technologies, establishment of biobot tracking testbeds to evaluate locomotion control efficiency, investigation of biobotic control strategies with Gromphadorhina portentosa cockroaches and Manduca sexta moths, establishment of a localization and communication infrastructure, modeling and controlling collective motion by learning deterministic and stochastic motion models, topological motion modeling based on these models, and the development of a swarm robotic platform to be used as a testbed for our algorithms.
Learning Faster by Discovering and Exploiting Object Similarities
Directory of Open Access Journals (Sweden)
Tadej Janež
2013-03-01
Full Text Available In this paper we explore the question: “Is it possible to speed up the learning process of an autonomous agent by performing experiments in a more complex environment (i.e., an environment with a greater number of different objects?” To this end, we use a simple robotic domain, where the robot has to learn a qualitative model predicting the change in the robot's distance to an object. To quantify the environment's complexity, we defined cardinal complexity as the number of objects in the robot's world, and behavioural complexity as the number of objects' distinct behaviours. We propose Error reduction merging (ERM, a new learning method that automatically discovers similarities in the structure of the agent's environment. ERM identifies different types of objects solely from the data measured and merges the observations of objects that behave in the same or similar way in order to speed up the agent's learning. We performed a series of experiments in worlds of increasing complexity. The results in our simple domain indicate that ERM was capable of discovering structural similarities in the data which indeed made the learning faster, clearly superior to conventional learning. This observed trend occurred with various machine learning algorithms used inside the ERM method.
Search costs and efficiency : Do unemployed workers search enough?
Gautier, Pieter A.; Moraga González, José; Wolthoff, Ronald P.
Many labor market policies affect the marginal benefits and costs of job search. The impact and desirability of such policies depend on the distribution of search costs. In this paper, we provide an equilibrium framework for identifying the distribution of search costs and we apply it to the Dutch
National culture and operations management : a structured literature review
Boscari, Stefania; Bortolotti, Thomas; Netland, Torbjorn; Rich, Nicholas
2018-01-01
National culture has received a substantial amount of interest in the operations management literature. We present the first structured review of articles studying national culture in operations management. Our search returned 51 papers published in ten leading journals between 2000 and 2017. We
Hybrid Artificial Bee Colony Algorithm and Particle Swarm Search for Global Optimization
Directory of Open Access Journals (Sweden)
Wang Chun-Feng
2014-01-01
Full Text Available Artificial bee colony (ABC algorithm is one of the most recent swarm intelligence based algorithms, which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To overcome this problem, we propose a novel artificial bee colony algorithm based on particle swarm search mechanism. In this algorithm, for improving the convergence speed, the initial population is generated by using good point set theory rather than random selection firstly. Secondly, in order to enhance the exploitation ability, the employed bee, onlookers, and scouts utilize the mechanism of PSO to search new candidate solutions. Finally, for further improving the searching ability, the chaotic search operator is adopted in the best solution of the current iteration. Our algorithm is tested on some well-known benchmark functions and compared with other algorithms. Results show that our algorithm has good performance.
DEFF Research Database (Denmark)
Lykke, Marianne; Price, Susan; Delcambre, Lois
2012-01-01
Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...
Rajashekar, TB
1998-01-01
The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.
Knowledge in Artificial Intelligence Systems: Searching the Strategies for Application
Kornienko, Alla A.; Kornienko, Anatoly V.; Fofanov, Oleg B.; Chubik, Maxim P.
2015-01-01
The studies based on auto-epistemic logic are pointed out as an advanced direction for development of artificial intelligence (AI). Artificial intelligence is taken as a system that imitates the solution of complicated problems by human during the course of life. The structure of symbols and operations, by which intellectual solution is performed, as well as searching the strategic reference points for those solutions, which are caused by certain structures of symbols and operations, – are co...
2010-03-01
road barriers (e.g., dragon teeth) and searches vehicles for weapons and proper license plates. The rifleman also escorts VIPs after conveying the...Are there automated systems that know that in X scenario, operator Y would want to see Z , or is there an exhaustive list of options that the operator...directional) or a trackball (moves in any direction). Selection is made my depressing the wheel/ ball . • Keyboard – The size of the keyboard can
GeoSearch: A lightweight broking middleware for geospatial resources discovery
Gui, Z.; Yang, C.; Liu, K.; Xia, J.
2012-12-01
With petabytes of geodata, thousands of geospatial web services available over the Internet, it is critical to support geoscience research and applications by finding the best-fit geospatial resources from the massive and heterogeneous resources. Past decades' developments witnessed the operation of many service components to facilitate geospatial resource management and discovery. However, efficient and accurate geospatial resource discovery is still a big challenge due to the following reasons: 1)The entry barriers (also called "learning curves") hinder the usability of discovery services to end users. Different portals and catalogues always adopt various access protocols, metadata formats and GUI styles to organize, present and publish metadata. It is hard for end users to learn all these technical details and differences. 2)The cost for federating heterogeneous services is high. To provide sufficient resources and facilitate data discovery, many registries adopt periodic harvesting mechanism to retrieve metadata from other federated catalogues. These time-consuming processes lead to network and storage burdens, data redundancy, and also the overhead of maintaining data consistency. 3)The heterogeneous semantics issues in data discovery. Since the keyword matching is still the primary search method in many operational discovery services, the search accuracy (precision and recall) is hard to guarantee. Semantic technologies (such as semantic reasoning and similarity evaluation) offer a solution to solve these issues. However, integrating semantic technologies with existing service is challenging due to the expandability limitations on the service frameworks and metadata templates. 4)The capabilities to help users make final selection are inadequate. Most of the existing search portals lack intuitive and diverse information visualization methods and functions (sort, filter) to present, explore and analyze search results. Furthermore, the presentation of the value
Analysis of manning options for Visit, Board, Search, and Seizure teams
Newbold, Elizabeth A.
2015-01-01
Approved for public release; distribution is unlimited This research explores the viability of qualifying and manning Visit, Board, Search, and Seizure (VBSS) teams with Marine infantrymen from the Marine Expeditionary Unit (MEU) that are deployed with amphibious readiness groups. The VBSS element is an area that needs to be certified for surface combatants before deployment, and is required according to the Required Operational Capabilities, Projected Operational Environment, but it consu...
Nurse Scheduling by Cooperative GA with Effective Mutation Operator
Ohki, Makoto
In this paper, we propose an effective mutation operators for Cooperative Genetic Algorithm (CGA) to be applied to a practical Nurse Scheduling Problem (NSP). The nurse scheduling is a very difficult task, because NSP is a complex combinatorial optimizing problem for which many requirements must be considered. In real hospitals, the schedule changes frequently. The changes of the shift schedule yields various problems, for example, a fall in the nursing level. We describe a technique of the reoptimization of the nurse schedule in response to a change. The conventional CGA is superior in ability for local search by means of its crossover operator, but often stagnates at the unfavorable situation because it is inferior to ability for global search. When the optimization stagnates for long generation cycle, a searching point, population in this case, would be caught in a wide local minimum area. To escape such local minimum area, small change in a population should be required. Based on such consideration, we propose a mutation operator activated depending on the optimization speed. When the optimization stagnates, in other words, when the optimization speed decreases, the mutation yields small changes in the population. Then the population is able to escape from a local minimum area by means of the mutation. However, this mutation operator requires two well-defined parameters. This means that user have to consider the value of these parameters carefully. To solve this problem, we propose a periodic mutation operator which has only one parameter to define itself. This simplified mutation operator is effective over a wide range of the parameter value.
Search on a hypercubic lattice using a quantum random walk. II. d=2
International Nuclear Information System (INIS)
Patel, Apoorva; Raghunathan, K. S.; Rahaman, Md. Aminoor
2010-01-01
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d=2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article [A. Patel and M. A. Rahaman, Phys. Rev. A 82, 032330 (2010)] provides an O(√(N)lnN) algorithm, which is not optimal. The scaling behavior can be improved to O(√(NlnN)) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi [Phys. Rev. A 78, 012310 (2008)]. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.
Energy Technology Data Exchange (ETDEWEB)
Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)
2008-07-01
Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)
Future of double beta decay and dark matter searches - GENIUS
International Nuclear Information System (INIS)
Klapdor-Kleingrothaus, H. V.; Baudis, L.; Heusser, G.; Krivosheina, I. V.; Kolb, S.; Majorovits, B.; Nabi, J.-U.; Paes, H.
1999-01-01
The recent results from the HEIDELBERG-MOSCOW experiment have demonstrated the large potential of double beta decay to search for new physics beyond the standard model. To increase further by a major step the present sensitivity for double beta decay and dark matter searches, we describe here a project, proposed recently [1], which would operate one tonne of 'naked' enriched germanium-detectors in liquid nitrogen as shielding in an underground set-up (GENIUS). It improves the sensitivity of neutrino masses to 0.01 eV. A 10 tonne version would probe neutrino masses even down to 10 -3 eV
Future perspectives of double beta decay and dark matter search - GENIUS
International Nuclear Information System (INIS)
Klapdor-Kleingrothaus, H.V.; Hellmig, J.; Hirsch, M.
1998-01-01
The recent results from the HEIDELBERG-MOSCOW experiment have demonstrated the large potential of double beta decay to search for new physics beyond the standard model. To increase by a major step the present sensitivity for double beta decay and dark matter search, much bigger source strengths and much lower backgrounds are needed than used in experiments under operation at present or under construction. We describe here a project which would operate one tonne of 'naked' enriched germanium-detectors in liquid nitrogen as shielding in an underground set-up (GENIUS). It improves the sensitivity of neutrino masses to 0.01 eV. A 10 tonne version would probe neutrino masses even down to 10 -3 eV. The first version would allow us to test the atmospheric neutrino problem, the second at least part of the solar neutrino problem. Both versions would allow, in addition, significant contributions to testing several classes of GUT models. These are especially tests of R-parity breaking and conserving supersymmetry models - including sneutrino masses - leptoquark masses and mechanism and right-handed W-boson masses comparable with LHC. The second issue of the experiment is the search for dark matter in the universe. The full MSSM parameter space for the prediction of neutralinos as dark matter particles could be covered already in a first step of the full experiment using only 100 kg of 76 Ge or even of natural Ge making the experiment competitive with LHC in the search for supersymmetry. (author)
Armstrong, Mark
2016-01-01
The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...
Is searching full text more effective than searching abstracts?
Lin, Jimmy
2009-02-03
With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata) to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE abstracts, full-text articles, and spans (paragraphs) within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.
Is searching full text more effective than searching abstracts?
Directory of Open Access Journals (Sweden)
Lin Jimmy
2009-02-01
Full Text Available Abstract Background With the growing availability of full-text articles online, scientists and other consumers of the life sciences literature now have the ability to go beyond searching bibliographic records (title, abstract, metadata to directly access full-text content. Motivated by this emerging trend, I posed the following question: is searching full text more effective than searching abstracts? This question is answered by comparing text retrieval algorithms on MEDLINE® abstracts, full-text articles, and spans (paragraphs within full-text articles using data from the TREC 2007 genomics track evaluation. Two retrieval models are examined: bm25 and the ranking algorithm implemented in the open-source Lucene search engine. Results Experiments show that treating an entire article as an indexing unit does not consistently yield higher effectiveness compared to abstract-only search. However, retrieval based on spans, or paragraphs-sized segments of full-text articles, consistently outperforms abstract-only search. Results suggest that highest overall effectiveness may be achieved by combining evidence from spans and full articles. Conclusion Users searching full text are more likely to find relevant articles than searching only abstracts. This finding affirms the value of full text collections for text retrieval and provides a starting point for future work in exploring algorithms that take advantage of rapidly-growing digital archives. Experimental results also highlight the need to develop distributed text retrieval algorithms, since full-text articles are significantly longer than abstracts and may require the computational resources of multiple machines in a cluster. The MapReduce programming model provides a convenient framework for organizing such computations.
Faster gastric emptying of a liquid meal in rats after hypothalamic dorsomedial nucleus lesion
Directory of Open Access Journals (Sweden)
Denofre-Carvalho S.
1997-01-01
Full Text Available The effects of dorsomedial hypothalamic (DMH nucleus lesion on body weight, plasma glucose levels, and the gastric emptying of a liquid meal were investigated in male Wistar rats (170-250 g. DMH lesions were produced stereotaxically by delivering a 2.0-mA current for 20 s through nichrome electrodes (0.3-mm tip exposure. In a second set of experiments, the DMH and the ventromedial hypothalamic (VMH nucleus were lesioned with a 1.0-mA current for 10 s (0.1-mm tip exposure. The medial hypothalamus (MH was also lesioned separately using a nichrome electrode (0.3-mm tip exposure with a 2.0-mA current for 20 s. Gastric emptying was measured following the orogastric infusion of a liquid test meal consisting of physiological saline (0.9% NaCl, w/v plus phenol red dye (6 mg/dl as a marker. Plasma glucose levels were determined after an 18-h fast before the lesion and on the 7th and 15th postoperative day. Body weight was determined before lesioning and before sacrificing the rats. The DMH-lesioned rats showed a significantly faster (P<0.05 gastric emptying (24.7% gastric retention, N = 11 than control (33.0% gastric retention, N = 8 and sham-lesioned (33.5% gastric retention, N = 12 rats, with a transient hypoglycemia on the 7th postoperative day which returned to normal by the 15th postoperative day. In all cases, weight gain was slower among lesioned rats. Additional experiments using a smaller current to induce lesions confirmed that DMH-lesioned rats had a faster gastric emptying (25.1% gastric retention, N = 7 than control (33.4% gastric retention, N = 17 and VMH-lesioned (34.6% gastric retention, N = 7 rats. MH lesions resulted in an even slower gastric emptying (43.7% gastric retention, N = 7 than in the latter two groups. We conclude that although DMH lesions reduce weight gain, they do not produce consistent changes in plasma glucose levels. These lesions also promote faster gastric emptying of an inert liquid meal, thus suggesting a role for
A Direct Search Algorithm for Global Optimization
Directory of Open Access Journals (Sweden)
Enrique Baeyens
2016-06-01
Full Text Available A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm’s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.
Real-time Automatic Search for Multi-wavelength Counterparts of DWF Transients
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.
Computer science and operations research
Balci, Osman
1992-01-01
The interface of Operation Research and Computer Science - although elusive to a precise definition - has been a fertile area of both methodological and applied research. The papers in this book, written by experts in their respective fields, convey the current state-of-the-art in this interface across a broad spectrum of research domains which include optimization techniques, linear programming, interior point algorithms, networks, computer graphics in operations research, parallel algorithms and implementations, planning and scheduling, genetic algorithms, heuristic search techniques and dat
Faster dissolution of PuO2 in nitrous media by means of electrolytic oxidation
International Nuclear Information System (INIS)
Baumgaertner, F.; Kim, J.I.; Luckner, N.; Brueckl, N.; Lieberer, E.
1984-03-01
The contribution shows that the dissolution of PuO 2 in HNO 3 can be accelerated considerably by means of electrolytic oxidation. A glass apparatus has been developed which uses platinum electrodes providing for sufficient contact between electrodes and solids. Increase of temperature, acid concentration, and electrode current density, and a good contact between electrode and metal oxide will improve the dissolution kinetics. The reaction could be made even faster by addition of Ce 4+ . (orig.) [de
A search for excited fermions in electron-proton collisions at HERA
International Nuclear Information System (INIS)
Derrick, M.; Krakauer, D.; Magill, S.
1994-10-01
A search for excited states of the standard model fermions was performed using the ZEUS detector at the HERA electron-proton collider, operating at a centre of mass enery of 296 GeV. In a sample corresponding to an integrated luminosity of 0.55 pb -1 , no evidence was found for any resonant state decaying into final states composed of a fermion and a gauge boson. Limits on the coupling strength times branching ratio of excited fermions are presented for masses between 50 GeV and 250 GeV, extending previous search regions significantly. (orig.)
Optimization of Operations Resources via Discrete Event Simulation Modeling
Joshi, B.; Morris, D.; White, N.; Unal, R.
1996-01-01
The resource levels required for operation and support of reusable launch vehicles are typically defined through discrete event simulation modeling. Minimizing these resources constitutes an optimization problem involving discrete variables and simulation. Conventional approaches to solve such optimization problems involving integer valued decision variables are the pattern search and statistical methods. However, in a simulation environment that is characterized by search spaces of unknown topology and stochastic measures, these optimization approaches often prove inadequate. In this paper, we have explored the applicability of genetic algorithms to the simulation domain. Genetic algorithms provide a robust search strategy that does not require continuity and differentiability of the problem domain. The genetic algorithm successfully minimized the operation and support activities for a space vehicle, through a discrete event simulation model. The practical issues associated with simulation optimization, such as stochastic variables and constraints, were also taken into consideration.
Meta-Search Utilizing Evolitionary Recommendation: A Web Search Architecture Proposal
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Keyhanipour, A.; Krömer, P.; Moshiri, B.; Owais, S.; Snášel, V.
2008-01-01
Roč. 33, - (2008), s. 189-200 ISSN 1870-4069 Institutional research plan: CEZ:AV0Z10300504 Keywords : web search * meta-search engine * intelligent re-ranking * ordered weighted averaging * Boolean search queries optimizing Subject RIV: IN - Informatics, Computer Science
Calliste, Jabari; Wu, Gongting; Laganis, Philip E; Spronk, Derrek; Jafari, Houman; Olson, Kyle; Gao, Bo; Lee, Yueh Z; Zhou, Otto; Lu, Jianping
2017-09-01
The aim of this study was to characterize a new generation stationary digital breast tomosynthesis system with higher tube flux and increased angular span over a first generation system. The linear CNT x-ray source was designed, built, and evaluated to determine its performance parameters. The second generation system was then constructed using the CNT x-ray source and a Hologic gantry. Upon construction, test objects and phantoms were used to characterize system resolution as measured by the modulation transfer function (MTF), and artifact spread function (ASF). The results indicated that the linear CNT x-ray source was capable of stable operation at a tube potential of 49 kVp, and measured focal spot sizes showed source-to-source consistency with a nominal focal spot size of 1.1 mm. After construction, the second generation (Gen 2) system exhibited entrance surface air kerma rates two times greater the previous s-DBT system. System in-plane resolution as measured by the MTF is 7.7 cycles/mm, compared to 6.7 cycles/mm for the Gen 1 system. As expected, an increase in the z-axis depth resolution was observed, with a decrease in the ASF from 4.30 mm to 2.35 mm moving from the Gen 1 system to the Gen 2 system as result of an increased angular span. The results indicate that the Gen 2 stationary digital breast tomosynthesis system, which has a larger angular span, increased entrance surface air kerma, and faster image acquisition time over the Gen 1 s-DBT system, results in higher resolution images. With the detector operating at full resolution, the Gen 2 s-DBT system can achieve an in-plane resolution of 7.7 cycles per mm, which is better than the current commercial DBT systems today, and may potentially result in better patient diagnosis. © 2017 American Association of Physicists in Medicine.
Ant colony search algorithm for optimal reactive power optimization
Directory of Open Access Journals (Sweden)
Lenin K.
2006-01-01
Full Text Available The paper presents an (ACSA Ant colony search Algorithm for Optimal Reactive Power Optimization and voltage control of power systems. ACSA is a new co-operative agents’ approach, which is inspired by the observation of the behavior of real ant colonies on the topic of ant trial formation and foraging methods. Hence, in the ACSA a set of co-operative agents called "Ants" co-operates to find good solution for Reactive Power Optimization problem. The ACSA is applied for optimal reactive power optimization is evaluated on standard IEEE, 30, 57, 191 (practical test bus system. The proposed approach is tested and compared to genetic algorithm (GA, Adaptive Genetic Algorithm (AGA.
Characteristic sounds make you look at the targets faster in visual search
Iordanescu, L; Grabowecky, M; Franconeri, S; Theeuwes, J.
2010-01-01
When you are looking for an object, does hearing its characteristic sound make you find it more quickly? Our recent results supported this possibility by demonstrating that when a cat target, for example, was presented among other objects, a simultaneously presented "meow" sound (containing no
Benning, Tim M; Dellaert, Benedict G C
2013-05-01
Increased competition in the health care sector has led hospitals and other health care institutions to experiment with new access allocation policies that move away from traditional expert based allocation of care to price-based priority access (i.e., the option to pay more for faster care). To date, little is known about individuals' attitude toward price-based priority access and the evaluation process underlying this attitude. This paper addresses the role of individuals' evaluations of collective health outcomes as an important driver of their attitude toward (price-based) allocation policies in health care. The authors investigate how individuals evaluate price-based priority access by means of scenario-based survey data collected in a representative sample from the Dutch population (N = 1464). They find that (a) offering individuals the opportunity to pay for faster care negatively affects their evaluations of both the total and distributional collective health outcome achieved, (b) however, when health care supply is not restricted (i.e., when treatment can be offered outside versus within the regular working hours of the hospital) offering price-based priority access affects total collective health outcome evaluations positively instead of negatively, but it does not change distributional collective health outcome evaluations. Furthermore, (c) the type of health care treatment (i.e., life saving liver transplantation treatment vs. life improving cosmetic ear correction treatment - priced at the same level to the individual) moderates the effect of collective health outcome evaluations on individuals' attitude toward allocation policies. For policy makers and hospital managers the results presented in this article are helpful because they provide a better understanding of what drives individuals' preferences for health care allocation policies. In particular, the results show that policies based on the "paying more for faster care" principle are more
Clinical operations generation next… The age of technology and outsourcing
Directory of Open Access Journals (Sweden)
Priya Temkar
2015-01-01
Full Text Available 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.
Clinical operations generation next… The age of technology and outsourcing.
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.
Clinical operations generation next… The age of technology and outsourcing
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
The nature of chess expertise: knowledge or search?
Directory of Open Access Journals (Sweden)
Ekaterina E. Vasyukova
2012-01-01
Full Text Available In this article, we briefl y survey studies of the nature of expertise, and we presentthe results of research directed at evidence of the complicated nature of expertise,which is most eff ectively seen in experts’ use of a transfer mechanism. Thephenomenon of the transfer of verbalized operational senses (VOS is analyzedand is investigated on the basis of the sense theory of thinking, as proposed byTikhomirov (1969, 1984.It is shown that VOS transfer manifests itself in diverse forms. It seems to be dependenton the factors of chess position and the age and skill level of the player.Diverse forms of transferring are associated with a change in separate indices ofVOS volume, structure, depth, and degree of consciousness in a connected position.VOS transfer is found more in skilled than in unskilled chess players; skilledplayers demonstrate selectivity of search in a connected position. VOS transfer isassociated not simply with the repetition and copying of some forecasts, whichgive the direction of search, but also with using and transforming the results ofprevious verbal searches.
Search for neutrinoless double-electron capture of 156Dy
Finch, S. W.; Tornow, W.
2015-12-01
Background: Multiple large collaborations are currently searching for neutrinoless double-β decay, with the ultimate goal of differentiating the Majorana-Dirac nature of the neutrino. Purpose: Investigate the feasibility of resonant neutrinoless double-electron capture, an experimental alternative to neutrinoless double-β decay. Method: Two clover germanium detectors were operated underground in coincidence to search for the de-excitation γ rays of 156Gd following the neutrinoless double-electron capture of 156Dy. 231.95 d of data were collected at the Kimballton underground research facility with a 231.57 mg enriched 156Dy sample. Results: No counts were seen above background and half-life limits are set at O (1016-1018) yr for the various decay modes of 156Dy. Conclusion: Low background spectra were efficiently collected in the search for neutrinoless double-electron capture of 156Dy, although the low natural abundance and associated lack of large quantities of enriched samples hinders the experimental reach.
Oscillating feature subset search algorithm for text categorization
Czech Academy of Sciences Publication Activity Database
Novovičová, Jana; Somol, Petr; Pudil, Pavel
2006-01-01
Roč. 44, č. 4225 (2006), s. 578-587 ISSN 0302-9743 R&D Projects: GA AV ČR IAA2075302; GA MŠk 2C06019 EU Projects: European Commission(XE) 507752 - MUSCLE Institutional research plan: CEZ:AV0Z10750506 Keywords : text classification * feature selection * oscillating search algorithm * Bhattacharyya distance Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.402, year: 2005
Does linear separability really matter? Complex visual search is explained by simple search
Vighneshvel, T.; Arun, S. P.
2013-01-01
Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search. PMID:24029822
Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search.
Jay, Caroline; Harper, Simon; Dunlop, Ian; Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain
2016-01-14
Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these "experts." Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the "Google generation" than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is "Google-like," enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F1,19=37.3, Pnatural language search interfaces for variable search supporting in particular: query reformulation; data browsing; faceted search; surrogates; relevance
Freeman, Benjamin G; Montgomery, Graham A; Schluter, Dolph
2017-09-01
Plasticity is often thought to accelerate trait evolution and speciation. For example, plasticity in birdsong may partially explain why clades of song learners are more diverse than related clades with innate song. This "song learning" hypothesis predicts that (1) differences in song traits evolve faster in song learners, and (2) behavioral discrimination against allopatric song (a proxy for premating reproductive isolation) evolves faster in song learners. We tested these predictions by analyzing acoustic traits and conducting playback experiments in allopatric Central American sister pairs of song learning oscines (N = 42) and nonlearning suboscines (N = 27). We found that nonlearners evolved mean acoustic differences slightly faster than did leaners, and that the mean evolutionary rate of song discrimination was 4.3 times faster in nonlearners than in learners. These unexpected results may be a consequence of significantly greater variability in song traits in song learners (by 54-79%) that requires song-learning oscines to evolve greater absolute differences in song before achieving the same level of behavioral song discrimination as nonlearning suboscines. This points to "a downside of learning" for the evolution of species discrimination, and represents an important example of plasticity reducing the rate of evolution and diversification by increasing variability. © 2017 The Author(s). Evolution © 2017 The Society for the Study of Evolution.
Visual Representation Determines Search Difficulty: Explaining Visual Search Asymmetries
Directory of Open Access Journals (Sweden)
Neil eBruce
2011-07-01
Full Text Available In visual search experiments there exist a variety of experimental paradigms in which a symmetric set of experimental conditions yields asymmetric corresponding task performance. There are a variety of examples of this that currently lack a satisfactory explanation. In this paper, we demonstrate that distinct classes of asymmetries may be explained by virtue of a few simple conditions that are consistent with current thinking surrounding computational modeling of visual search and coding in the primate brain. This includes a detailed look at the role that stimulus familiarity plays in the determination of search performance. Overall, we demonstrate that all of these asymmetries have a common origin, namely, they are a consequence of the encoding that appears in the visual cortex. The analysis associated with these cases yields insight into the problem of visual search in general and predictions of novel search asymmetries.
evaluating search effectiveness of some selected search engines
African Journals Online (AJOL)
Precision, relative recall and response time were considered for this ... a total of 24 search queries were sampled based on information queries, .... searching process and results, although there are other ... Q3.2 Software prototype model.
Natural Language Search Interfaces: Health Data Needs Single-Field Variable Search
Smith, Sam; Sufi, Shoaib; Goble, Carole; Buchan, Iain
2016-01-01
Background Data discovery, particularly the discovery of key variables and their inter-relationships, is key to secondary data analysis, and in-turn, the evolving field of data science. Interface designers have presumed that their users are domain experts, and so they have provided complex interfaces to support these “experts.” Such interfaces hark back to a time when searches needed to be accurate first time as there was a high computational cost associated with each search. Our work is part of a governmental research initiative between the medical and social research funding bodies to improve the use of social data in medical research. Objective The cross-disciplinary nature of data science can make no assumptions regarding the domain expertise of a particular scientist, whose interests may intersect multiple domains. Here we consider the common requirement for scientists to seek archived data for secondary analysis. This has more in common with search needs of the “Google generation” than with their single-domain, single-tool forebears. Our study compares a Google-like interface with traditional ways of searching for noncomplex health data in a data archive. Methods Two user interfaces are evaluated for the same set of tasks in extracting data from surveys stored in the UK Data Archive (UKDA). One interface, Web search, is “Google-like,” enabling users to browse, search for, and view metadata about study variables, whereas the other, traditional search, has standard multioption user interface. Results Using a comprehensive set of tasks with 20 volunteers, we found that the Web search interface met data discovery needs and expectations better than the traditional search. A task × interface repeated measures analysis showed a main effect indicating that answers found through the Web search interface were more likely to be correct (F 1,19=37.3, Peffect of task (F 3,57=6.3, Pinterface (F 1,19=18.0, Peffect of task (F 2,38=4.1, P=.025, Greenhouse
Sterile Neutrino Search with the Double Chooz Experiment
Hellwig, D.; Matsubara, T.; Double Chooz Collaboration
2017-09-01
Double Chooz is a reactor antineutrino disappearance experiment located in Chooz, France. A far detector at a distance of about 1 km from reactor cores is operating since 2011; a near detector of identical design at a distance of about 400 m is operating since begin 2015. Beyond the precise measurement of θ 13, Double Chooz has a strong sensitivity to so called light sterile neutrinos. Sterile neutrinos are neutrino mass states not taking part in weak interactions, but may mix with known neutrino states. In this paper, we present an analysis method to search for sterile neutrinos and the expected sensitivity with the baselines of our detectors.
Non-operative management versus operative management in high-grade blunt hepatic injury.
Cirocchi, Roberto; Trastulli, Stefano; Pressi, Eleonora; Farinella, Eriberto; Avenia, Stefano; Morales Uribe, Carlos Hernando; Botero, Ana Maria; Barrera, Luis M
2015-08-24
Surgery used to be the treatment of choice in cases of blunt hepatic injury, but this approach gradually changed over the last two decades as increasing non-operative management (NOM) of splenic injury led to its use for hepatic injury. The improvement in critical care monitoring and computed tomographic scanning, as well as the more frequent use of interventional radiology techniques, has helped to bring about this change to non-operative management. Liver trauma ranges from a small capsular tear, without parenchymal laceration, to massive parenchymal injury with major hepatic vein/retrohepatic vena cava lesions. In 1994, the Organ Injury Scaling Committee of the American Association for the Surgery of Trauma (AAST) revised the Hepatic Injury Scale to have a range from grade I to VI. Minor injuries (grade I or II) are the most frequent liver injuries (80% to 90% of all cases); severe injuries are grade III-V lesions; grade VI lesions are frequently incompatible with survival. In the medical literature, the majority of patients who have undergone NOM have low-grade liver injuries. The safety of NOM in high-grade liver lesions, AAST grade IV and V, remains a subject of debate as a high incidence of liver and collateral extra-abdominal complications are still described. To assess the effects of non-operative management compared to operative management in high-grade (grade III-V) blunt hepatic injury. The search for studies was run on 14 April 2014. We searched the Cochrane Injuries Group's Specialised Register, The Cochrane Library, Ovid MEDLINE(R), Ovid MEDLINE(R) In-Process & Other Non-Indexed Citations, Ovid MEDLINE(R) Daily and Ovid OLDMEDLINE(R), Embase Classic+Embase (Ovid), PubMed, ISI WOS (SCI-EXPANDED, SSCI, CPCI-S & CPSI-SSH), clinical trials registries, conference proceedings, and we screened reference lists. All randomised trials that compare non-operative management versus operative management in high-grade blunt hepatic injury. Two authors independently
Cornière (de), Alexandre
2016-01-01
Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...
A faster sample preparation method for determination of polonium-210 in fish
International Nuclear Information System (INIS)
Sadi, B.B.; Jing Chen; Kochermin, Vera; Godwin Tung; Sorina Chiorean
2016-01-01
In order to facilitate Health Canada’s study on background radiation levels in country foods, an in-house radio-analytical method has been developed for determination of polonium-210 ( 210 Po) in fish samples. The method was validated by measurement of 210 Po in a certified reference material. It was also evaluated by comparing 210 Po concentrations in a number of fish samples by another method. The in-house method offers faster sample dissolution using an automated digestion system compared to currently used wet-ashing on a hot plate. It also utilizes pre-packed Sr-resin® cartridges for rapid and reproducible separation of 210 Po versus time-consuming manually packed Sr-resin® columns. (author)
A piece of paper falling faster than free fall
International Nuclear Information System (INIS)
Vera, F; Rivera, R
2011-01-01
We report a simple experiment that clearly demonstrates a common error in the explanation of the classic experiment where a small piece of paper is put over a book and the system is let fall. This classic demonstration is used in introductory physics courses to show that after eliminating the friction force with the air, the piece of paper falls with acceleration g. To test if the paper falls behind the book in a nearly free fall motion or if it is dragged by the book, we designed a version of this experiment that includes a ball and a piece of paper over a book that is forced to fall using elastic cords. We recorded a video of our experiment using a high-speed video camera at 300 frames per second that shows that the book and the paper fall faster than the ball, which falls well behind the book with an acceleration approximately equal to g. Our experiment shows that the piece of paper is dragged behind the book and therefore the paper and book demonstration should not be used to show that all objects fall with acceleration g independently of their mass.
Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers
Yoshino, Masayuki; Okeya, Katsuyuki; Vuillaume, Camille
This paper proposes novel algorithms for computing double-size modular multiplications with few modulus-dependent precomputations. Low-end devices such as smartcards are usually equipped with hardware Montgomery multipliers. However, due to progresses of mathematical attacks, security institutions such as NIST have steadily demanded longer bit-lengths for public-key cryptography, making the multipliers quickly obsolete. In an attempt to extend the lifespan of such multipliers, double-size techniques compute modular multiplications with twice the bit-length of the multipliers. Techniques are known for extending the bit-length of classical Euclidean multipliers, of Montgomery multipliers and the combination thereof, namely bipartite multipliers. However, unlike classical and bipartite multiplications, Montgomery multiplications involve modulus-dependent precomputations, which amount to a large part of an RSA encryption or signature verification. The proposed double-size technique simulates double-size multiplications based on single-size Montgomery multipliers, and yet precomputations are essentially free: in an 2048-bit RSA encryption or signature verification with public exponent e=216+1, the proposal with a 1024-bit Montgomery multiplier is at least 1.5 times faster than previous double-size Montgomery multiplications.
A piece of paper falling faster than free fall
Energy Technology Data Exchange (ETDEWEB)
Vera, F; Rivera, R, E-mail: fvera@ucv.cl [Instituto de Fisica, Pontificia Universidad Catolica de ValparaIso, Av. Universidad 330, Curauma, ValparaIso (Chile)
2011-09-15
We report a simple experiment that clearly demonstrates a common error in the explanation of the classic experiment where a small piece of paper is put over a book and the system is let fall. This classic demonstration is used in introductory physics courses to show that after eliminating the friction force with the air, the piece of paper falls with acceleration g. To test if the paper falls behind the book in a nearly free fall motion or if it is dragged by the book, we designed a version of this experiment that includes a ball and a piece of paper over a book that is forced to fall using elastic cords. We recorded a video of our experiment using a high-speed video camera at 300 frames per second that shows that the book and the paper fall faster than the ball, which falls well behind the book with an acceleration approximately equal to g. Our experiment shows that the piece of paper is dragged behind the book and therefore the paper and book demonstration should not be used to show that all objects fall with acceleration g independently of their mass.
Causal events enter awareness faster than non-causal events
Directory of Open Access Journals (Sweden)
Pieter Moors
2017-01-01
Full Text Available Philosophers have long argued that causality cannot be directly observed but requires a conscious inference (Hume, 1967. Albert Michotte however developed numerous visual phenomena in which people seemed to perceive causality akin to primary visual properties like colour or motion (Michotte, 1946. Michotte claimed that the perception of causality did not require a conscious, deliberate inference but, working over 70 years ago, he did not have access to the experimental methods to test this claim. Here we employ Continuous Flash Suppression (CFS—an interocular suppression technique to render stimuli invisible (Tsuchiya & Koch, 2005—to test whether causal events enter awareness faster than non-causal events. We presented observers with ‘causal’ and ‘non-causal’ events, and found consistent evidence that participants become aware of causal events more rapidly than non-causal events. Our results suggest that, whilst causality must be inferred from sensory evidence, this inference might be computed at low levels of perceptual processing, and does not depend on a deliberative conscious evaluation of the stimulus. This work therefore supports Michotte’s contention that, like colour or motion, causality is an immediate property of our perception of the world.
Directory of Open Access Journals (Sweden)
Etai Jacob
2013-04-01
Full Text Available Computational analysis of proteomes in all kingdoms of life reveals a strong tendency for N-terminal domains in two-domain proteins to have shorter sequences than their neighboring C-terminal domains. Given that folding rates are affected by chain length, we asked whether the tendency for N-terminal domains to be shorter than their neighboring C-terminal domains reflects selection for faster-folding N-terminal domains. Calculations of absolute contact order, another predictor of folding rate, provide additional evidence that N-terminal domains tend to fold faster than their neighboring C-terminal domains. A possible explanation for this bias, which is more pronounced in prokaryotes than in eukaryotes, is that faster folding of N-terminal domains reduces the risk for protein aggregation during folding by preventing formation of nonnative interdomain interactions. This explanation is supported by our finding that two-domain proteins with a shorter N-terminal domain are much more abundant than those with a shorter C-terminal domain.
78 FR 69139 - Physical Security-Design Certification and Operating Reactors
2013-11-18
... Operating Reactors AGENCY: Nuclear Regulatory Commission. ACTION: Standard review plan--draft section..., ``Physical Security--Design Certification and Operating Reactors.'' The public comment period was originally....regulations.gov and search for Docket ID NRC-2013-0225. Address questions about NRC dockets to Carol Gallagher...
Cyclotron operating mode determination based on intelligent methods
International Nuclear Information System (INIS)
Ouda, M.M.E.M.
2011-01-01
adjust the parameters of the operating mode from the acceleration- extraction- focusing and steering until end of the experiment. This process is tedious and also time consuming and these were the main reasons to search better, faster and efficient method to determine the parameters of a new operating mode. As a result the artificial neural networks as a basis for intelligent system have been used to determine new operating systems for the MGC-20 cyclotron.In this thesis; an intelligent system has been designed and developed to determine new operating systems for the MGC-20 cyclotron, Nuclear Research Center, Atomic Energy Authority. This system based on Feed Forward Back Propagation Neural Networks (FFBPNN). The system consists of five neural networks work in parallel. Every neural network consists of three layers, input, hidden, and output layers. The outputs of the five neural networks represent the normalized values (from 0 to 1 and from -1 to 0) of the 19 parameters of the new operating mode. The inputs for every neural network are the normalized values (from 0 to 1) of the particle name, the particle energy, the beam current intensity, and the duty factor. The outputs of the five neural networks must be calibrated to obtain the real values of the parameters of the new operating mode. These elements of the outputs are the magnetic lenses, the magnetic correctors, the concentric coils, and the harmonic coils. The FFBPNNs are learned by using the feed forward back propagation training algorithm. The learning has been done with different values of the learning factor , the momentum factor and also the number of the hidden layers. The best structure which needs the shortest time to learn and achieve the allowed maximum error has been used.
Beyond MEDLINE for literature searches.
Conn, Vicki S; Isaramalai, Sang-arun; Rath, Sabyasachi; Jantarakupt, Peeranuch; Wadhawan, Rohini; Dash, Yashodhara
2003-01-01
To describe strategies for a comprehensive literature search. MEDLINE searches result in limited numbers of studies that are often biased toward statistically significant findings. Diversified search strategies are needed. Empirical evidence about the recall and precision of diverse search strategies is presented. Challenges and strengths of each search strategy are identified. Search strategies vary in recall and precision. Often sensitivity and specificity are inversely related. Valuable search strategies include examination of multiple diverse computerized databases, ancestry searches, citation index searches, examination of research registries, journal hand searching, contact with the "invisible college," examination of abstracts, Internet searches, and contact with sources of synthesized information. Extending searches beyond MEDLINE enables researchers to conduct more systematic comprehensive searches.
Realization Of Algebraic Processor For XML Documents Processing
International Nuclear Information System (INIS)
Georgiev, Bozhidar; Georgieva, Adriana
2010-01-01
In this paper, are presented some possibilities concerning the implementation of an algebraic method for XML hierarchical data processing which makes faster the XML search mechanism. Here is offered a different point of view for creation of advanced algebraic processor (with all necessary software tools and programming modules respectively). Therefore, this nontraditional approach for fast XML navigation with the presented algebraic processor may help to build an easier user-friendly interface provided XML transformations, which can avoid the difficulties in the complicated language constructions of XSL, XSLT and XPath. This approach allows comparatively simple search of XML hierarchical data by means of the following types of functions: specification functions and so named build-in functions. The choice of programming language Java may appear strange at first, but it isn't when you consider that the applications can run on different kinds of computers. The specific search mechanism based on the linear algebra theory is faster in comparison with MSXML parsers (on the basis of the developed examples with about 30%). Actually, there exists the possibility for creating new software tools based on the linear algebra theory, which cover the whole navigation and search techniques characterizing XSLT/XPath. The proposed method is able to replace more complicated operations in other SOA components.
DEFF Research Database (Denmark)
Bogers, Toine; Petras, Vivien
2017-01-01
of information needs. In this paper, we present a large-scale empirical comparison of the effectiveness of book metadata elements for searching complex information needs. Using a test collection of over 2 million book records and over 330 real-world book search requests, we perform a highly controlled and in......-depth analysis of topical metadata, comparing controlled vocabularies with social tags. Tags perform better overall in this setting, but controlled vocabulary terms provide complementary information, which will improve a search. We analyze potential underlying factors that contribute to search performance......, such as the relevance aspect(s) mentioned in a request or the type of book. In addition, we investigate the possible causes of search failure. We conclude that neither tags nor controlled vocabularies are wholly suited to handling the complex information needs in book search, which means that different approaches...
Needle Custom Search: Recall-oriented search on the Web using semantic annotations
Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon; de Rijke, Maarten; Kenter, Tom; de Vries, A.P.; Zhai, Chen Xiang; de Jong, Franciska M.G.; Radinsky, Kira; Hofmann, Katja
Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency
Needle Custom Search : Recall-oriented search on the web using semantic annotations
Kaptein, Rianne; Koot, Gijs; Huis in 't Veld, Mirjam A.A.; van den Broek, Egon L.
2014-01-01
Web search engines are optimized for early precision, which makes it difficult to perform recall-oriented tasks using these search engines. In this article, we present our tool Needle Custom Search. This tool exploits semantic annotations of Web search results and, thereby, increase the efficiency
Faster Maliciously Secure Two-Party Computation Using the GPU
DEFF Research Database (Denmark)
Frederiksen, Tore Kasper; Jakobsen, Thomas Pelle; Nielsen, Jesper Buus
2014-01-01
operations appear to behave atomically. Disjointness is the abstraction that operations act on distinct data resource, with concurrent separation logics enabling reasoning about threads that appear to operate independently on disjoint resources. We present TaDA, a program logic that combines the benefits...
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
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.
Electricite de France: The search for excellence in the nuclear operator training process
International Nuclear Information System (INIS)
Tangy, N.
1991-01-01
Electricite de France (EdF) operates 51 pressurized water reactor units. The total staff of operators, operating and safety engineers, and supervisors who perform control room tasks today number about 2,000. During the last decade, EdF has had to recruit and train operating staff to handle the equivalent of four to six units reaching criticality every year. To meet this need, the company training department had to design and commission ∼10 full-scope simulators and 50 partial-task simulators, in synchrony with the various stages of unit design. Beyond the initial education and training of the newly recruited staff, EdF has adopted a retraining process in which every professional works with the simulator twice a year, five days at a time. The latest advances in the field of simulation are the 'steam generator tube break operation' simulator, based on an expert system self-training concept, and the SIPA simulator, based on a real-time contraction of the CATHARE thermohydraulic accident code. These training tools contribute to raising quality in human performance and are used for both training purposes and research and development (R and D). In 1987, the training department of the company started a national R and D program to improve operator evaluation as well as to assess the training scope and methods overall
Lazonder, Adrianus W.
2005-01-01
This study compared Pairs of students with Single students in web search tasks. The underlying hypothesis was that peer-to-peer collaboration encourages students to articulate their thoughts, which in turn has a facilitative effect on the regulation of the search process as well as search outcomes.
Operation guide device for nuclear power plants
International Nuclear Information System (INIS)
Araki, Tsuneyasu
1982-01-01
Purpose: To enable to maintain the soundness of nuclear fuels and each of equipments by compensating the effect of the xenon density on the reactor core thermal power resulted upon load following operation of a nuclear reactor. Constitution: The device comprises an instrumentation system for measuring the status of the nuclear reactor, a reactor core performance calculator for calculating the reactor core performance based on the output from the instrumentation system, a xenon density calculator for calculating the xenon density based on the output from the performance calculator, a memory unit for storing the output from the reactor core performance calculator and the xenon density calculator and for transferring the stored memory to a nuclear reactor status forecasting device and an alternative load pattern searching device for searching, in cooperation with the memory unit, an alternative load pattern which is within an operation restrictive condition and most closed to a demanded load pattern when a monitor for the deviation from the flowrate distribution detects the deviation from the operation restrictive conditions. (Yoshino, Y.)
Faster Simulation Methods for the Non-Stationary Random Vibrations of Non-Linear MDOF Systems
DEFF Research Database (Denmark)
Askar, A.; Köylüoglu, H. U.; Nielsen, Søren R. K.
subject to nonstationary Gaussian white noise excitation, as an alternative to conventional direct simulation methods. These alternative simulation procedures rely on an assumption of local Gaussianity during each time step. This assumption is tantamount to various linearizations of the equations....... Such a treatment offers higher rates of convergence, faster speed and higher accuracy. These procedures are compared to the direct Monte Carlo simulation procedure, which uses a fourth order Runge-Kutta scheme with the white noise process approximated by a broad band Ruiz-Penzien broken line process...
The role of statistics in operations research: Some personal re ections
African Journals Online (AJOL)
The role of statistics in operations research: Some personal re ections. ... AFRICAN JOURNALS ONLINE (AJOL) · Journals · Advanced Search · USING AJOL ... Statistics has a very important role to play in Operations Research (OR), yet many ...
Younger, Paula; Boddy, Kate
2009-06-01
The researchers involved in this study work at Exeter Health library and at the Complementary Medicine Unit, Peninsula School of Medicine and Dentistry (PCMD). Within this collaborative environment it is possible to access the electronic resources of three institutions. This includes access to AMED and other databases using different interfaces. The aim of this study was to investigate whether searching different interfaces to the AMED allied health and complementary medicine database produced the same results when using identical search terms. The following Internet-based AMED interfaces were searched: DIALOG DataStar; EBSCOhost and OVID SP_UI01.00.02. Search results from all three databases were saved in an endnote database to facilitate analysis. A checklist was also compiled comparing interface features. In our initial search, DIALOG returned 29 hits, OVID 14 and Ebsco 8. If we assume that DIALOG returned 100% of potential hits, OVID initially returned only 48% of hits and EBSCOhost only 28%. In our search, a researcher using the Ebsco interface to carry out a simple search on AMED would miss over 70% of possible search hits. Subsequent EBSCOhost searches on different subjects failed to find between 21 and 86% of the hits retrieved using the same keywords via DIALOG DataStar. In two cases, the simple EBSCOhost search failed to find any of the results found via DIALOG DataStar. Depending on the interface, the number of hits retrieved from the same database with the same simple search can vary dramatically. Some simple searches fail to retrieve a substantial percentage of citations. This may result in an uninformed literature review, research funding application or treatment intervention. In addition to ensuring that keywords, spelling and medical subject headings (MeSH) accurately reflect the nature of the search, database users should include wildcards and truncation and adapt their search strategy substantially to retrieve the maximum number of appropriate
A search engine for the engineering and equipment data management system (EDMS) at CERN
International Nuclear Information System (INIS)
Tsyganov, A; Amerigo, S M; Petit, S; Pettersson, T; Suwalska, A
2008-01-01
CERN, the European Laboratory for Particle Physics, located in Geneva -Switzerland, is currently building the LHC (Large Hadron Collider), a 27 km particle accelerator. The equipment life-cycle management of this project is provided by the Engineering and Equipment Data Management System (EDMS) Service. Using an Oracle database, it supports the management and follow-up of different kinds of documentation through the whole life cycle of the LHC project: design, manufacturing, installation, commissioning data etc... The equipment data collection phase is now slowing down and the project is getting closer to the 'As-Built' phase: the phase of the project consuming and exploring the large volumes of data stored since 1996. Searching through millions of items of information (documents, equipment parts, operations...) multiplied by dozens of points of view (operators, maintainers...) requires an efficient and flexible search engine. This paper describes the process followed by the team to implement the search engine for the LHC As-built project in the EDMS Service. The emphasis is put on the design decision to decouple the search engine from any user interface, potentially enabling other systems to also use it. Projections, algorithms, and the planned implementation are described in this paper. The implementation of the first version started in early 2007
Recent results on Higgs measurements and searches in ATLAS
CERN. Geneva
2016-01-01
The excellent operation of the LHC, and a fast processing and analysis, has enabled ATLAS to produce many new results during the last months with similar or better sensitivity than the one reached during Run 1 of the LHC. The seminar will give an overview of the Standard Model Higgs boson measurements and of searches for non-standard scalar states or decay modes.
Usability Testing of a Large, Multidisciplinary Library Database: Basic Search and Visual Search
Directory of Open Access Journals (Sweden)
Jody Condit Fagan
2006-09-01
Full Text Available Visual search interfaces have been shown by researchers to assist users with information search and retrieval. Recently, several major library vendors have added visual search interfaces or functions to their products. For public service librarians, perhaps the most critical area of interest is the extent to which visual search interfaces and text-based search interfaces support research. This study presents the results of eight full-scale usability tests of both the EBSCOhost Basic Search and Visual Search in the context of a large liberal arts university.
Definition and Evaluation of Bus and Truck Automation Operations Concepts
Tsao, H.-S. Jacob; Botha, Jan L.
2002-01-01
Traffic congestion will continue to worsen and likely worsen at a faster rate than ever. People throughput and freight throughput have become critical issues for California and the rest of the nation. PATH has been funding a one-year research project entitled "Definition and Evaluation of Bus and Truck Automation Operations Concepts," proposed by the authors. This report summarizes the results of the research project achieved during the first six months. During those six months, we reviewed l...
Social Work Literature Searching: Current Issues with Databases and Online Search Engines
McGinn, Tony; Taylor, Brian; McColgan, Mary; McQuilkan, Janice
2016-01-01
Objectives: To compare the performance of a range of search facilities; and to illustrate the execution of a comprehensive literature search for qualitative evidence in social work. Context: Developments in literature search methods and comparisons of search facilities help facilitate access to the best available evidence for social workers.…
WEB-server for search of a periodicity in amino acid and nucleotide sequences
E Frenkel, F.; Skryabin, K. G.; Korotkov, E. V.
2017-12-01
A new web server (http://victoria.biengi.ac.ru/splinter/login.php) was designed and developed to search for periodicity in nucleotide and amino acid sequences. The web server operation is based upon a new mathematical method of searching for multiple alignments, which is founded on the position weight matrices optimization, as well as on implementation of the two-dimensional dynamic programming. This approach allows the construction of multiple alignments of the indistinctly similar amino acid and nucleotide sequences that accumulated more than 1.5 substitutions per a single amino acid or a nucleotide without performing the sequences paired comparisons. The article examines the principles of the web server operation and two examples of studying amino acid and nucleotide sequences, as well as information that could be obtained using the web server.
Interest in Anesthesia as Reflected by Keyword Searches using Common Search Engines.
Liu, Renyu; García, Paul S; Fleisher, Lee A
2012-01-23
Since current general interest in anesthesia is unknown, we analyzed internet keyword searches to gauge general interest in anesthesia in comparison with surgery and pain. The trend of keyword searches from 2004 to 2010 related to anesthesia and anaesthesia was investigated using Google Insights for Search. The trend of number of peer reviewed articles on anesthesia cited on PubMed and Medline from 2004 to 2010 was investigated. The average cost on advertising on anesthesia, surgery and pain was estimated using Google AdWords. Searching results in other common search engines were also analyzed. Correlation between year and relative number of searches was determined with psearch engines may provide different total number of searching results (available posts), the ratios of searching results between some common keywords related to perioperative care are comparable, indicating similar trend. The peer reviewed manuscripts on "anesthesia" and the proportion of papers on "anesthesia and outcome" are trending up. Estimates for spending of advertising dollars are less for anesthesia-related terms when compared to that for pain or surgery due to relative smaller number of searching traffic. General interest in anesthesia (anaesthesia) as measured by internet searches appears to be decreasing. Pain, preanesthesia evaluation, anesthesia and outcome and side effects of anesthesia are the critical areas that anesthesiologists should focus on to address the increasing concerns.
Argo workstation: a key component of operational oceanography
Dong, Mingmei; Xu, Shanshan; Miao, Qingsheng; Yue, Xinyang; Lu, Jiawei; Yang, Yang
2018-02-01
Operational oceanography requires the quantity, quality, and availability of data set and the timeliness and effectiveness of data products. Without steady and strong operational system supporting, operational oceanography will never be proceeded far. In this paper we describe an integrated platform named Argo Workstation. It operates as a data processing and management system, capable of data collection, automatic data quality control, visualized data check, statistical data search and data service. After it is set up, Argo workstation provides global high quality Argo data to users every day timely and effectively. It has not only played a key role in operational oceanography but also set up an example for operational system.
Slutsky, S.; Swank, C. M.; Biswas, A.; Carr, R.; Escribano, J.; Filippone, B. W.; Griffith, W. C.; Mendenhall, M.; Nouri, N.; Osthelder, C.; Pérez Galván, A.; Picker, R.; Plaster, B.
2017-08-01
A magnetic coil operated at cryogenic temperatures is used to produce spatial, relative field gradients below 6 ppm/cm, stable for several hours. The apparatus is a prototype of the magnetic components for a neutron electric dipole moment (nEDM) search, which will take place at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory using ultra-cold neutrons (UCN). That search requires a uniform magnetic field to mitigate systematic effects and obtain long polarization lifetimes for neutron spin precession measurements. This paper details upgrades to a previously described apparatus [1], particularly the introduction of super-conducting magnetic shielding and the associated cryogenic apparatus. The magnetic gradients observed are sufficiently low for the nEDM search at SNS.
BioCarian: search engine for exploratory searches in heterogeneous biological databases.
Zaki, Nazar; Tennakoon, Chandana
2017-10-02
There are a large number of biological databases publicly available for scientists in the web. Also, there are many private databases generated in the course of research projects. These databases are in a wide variety of formats. Web standards have evolved in the recent times and semantic web technologies are now available to interconnect diverse and heterogeneous sources of data. Therefore, integration and querying of biological databases can be facilitated by techniques used in semantic web. Heterogeneous databases can be converted into Resource Description Format (RDF) and queried using SPARQL language. Searching for exact queries in these databases is trivial. However, exploratory searches need customized solutions, especially when multiple databases are involved. This process is cumbersome and time consuming for those without a sufficient background in computer science. In this context, a search engine facilitating exploratory searches of databases would be of great help to the scientific community. We present BioCarian, an efficient and user-friendly search engine for performing exploratory searches on biological databases. The search engine is an interface for SPARQL queries over RDF databases. We note that many of the databases can be converted to tabular form. We first convert the tabular databases to RDF. The search engine provides a graphical interface based on facets to explore the converted databases. The facet interface is more advanced than conventional facets. It allows complex queries to be constructed, and have additional features like ranking of facet values based on several criteria, visually indicating the relevance of a facet value and presenting the most important facet values when a large number of choices are available. For the advanced users, SPARQL queries can be run directly on the databases. Using this feature, users will be able to incorporate federated searches of SPARQL endpoints. We used the search engine to do an exploratory search
The Lisbon-Zaragoza-Paris dark matter search
International Nuclear Information System (INIS)
Girard, T.A.; Morales, A.; Waysand, G.; Collar, J.I.; Bruere-Dawson, R.; Bonnierballe, P.; Dubos, H.; Garcia, E.; Gomes, M.R.; Jeudy, V.; Limagne, D.; Morales, J.; Perrier, P.; Puimedon, J.; Saenz, C.; Salinas, A.; Sarsa, M.L.; Seco, J.; Ortiz de Solorzano, A.; Villar, J.; Yong, J.
1996-01-01
We describe an experiment to establish the feasibility of searching for evidence of cold dark matter with an intrinsic metastable superconducting detector. The experiment, based on a device composed of 100 g of Sn microspheres ≤20 micron in diameter, is to be placed at the 2400 mwe depth of the Canfranc Underground Laboratory. It is designed to operate at 100 mK, yielding an event spectrum ≤1.75 keV with a background rejection factor of 95%. (orig.)
International Nuclear Information System (INIS)
Perl, M.L.
1984-12-01
At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references
Ringed Seal Search for Global Optimization via a Sensitive Search Model.
Directory of Open Access Journals (Sweden)
Younes Saadi
Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be
Faster Fully-Dynamic minimum spanning forest
DEFF Research Database (Denmark)
Holm, Jacob; Rotenberg, Eva; Wulff-Nilsen, Christian
2015-01-01
We give a new data structure for the fully-dynamic minimum spanning forest problem in simple graphs. Edge updates are supported in O(log4 n/log logn) expected amortized time per operation, improving the O(log4 n) amortized bound of Holm et al. (STOC’98, JACM’01).We also provide a deterministic data...
Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.
Sharit, Joseph; Taha, Jessica; Berkowsky, Ronald W; Profita, Halley; Czaja, Sara J
2015-01-01
Although access to Internet health information can be beneficial, solving complex health-related problems online is challenging for many individuals. In this study, we investigated the performance of a sample of 60 adults ages 18 to 85 years in using the Internet to resolve a relatively complex health information problem. The impact of age, Internet experience, and cognitive abilities on measures of search time, amount of search, and search accuracy was examined, and a model of Internet information seeking was developed to guide the characterization of participants' search strategies. Internet experience was found to have no impact on performance measures. Older participants exhibited longer search times and lower amounts of search but similar search accuracy performance as their younger counterparts. Overall, greater search accuracy was related to an increased amount of search but not to increased search duration and was primarily attributable to higher cognitive abilities, such as processing speed, reasoning ability, and executive function. There was a tendency for those who were younger, had greater Internet experience, and had higher cognitive abilities to use a bottom-up (i.e., analytic) search strategy, although use of a top-down (i.e., browsing) strategy was not necessarily unsuccessful. Implications of the findings for future studies and design interventions are discussed.
An Efficient Method to Search Real-Time Bulk Data for an Information Processing System
International Nuclear Information System (INIS)
Kim, Seong Jin; Kim, Jong Myung; Suh, Yong Suk; Keum, Jong Yong; Park, Heui Youn
2005-01-01
The Man Machine Interface System (MMIS) of System-integrated Modular Advanced ReacTor (SMART) is designed with fully digitalized features. The Information Processing System (IPS) of the MMIS acquires and processes plant data from other systems. In addition, the IPS provides plant operation information to operators in the control room. The IPS is required to process bulky data in a real-time. So, it is necessary to consider a special processing method with regards to flexibility and performance because more than a few thousands of Plant Information converges on the IPS. Among other things, the processing time for searching for data from the bulk data consumes much more than other the processing times. Thus, this paper explores an efficient method for the search and examines its feasibility
Time Management in the Operating Room: An Analysis of the Dedicated Minimally Invasive Surgery Suite
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
Low-Mass Dark Matter Search Results and Radiogenic Backgrounds for the Cryogenic Dark Matter Search
Energy Technology Data Exchange (ETDEWEB)
Pepin, Mark David [Univ. of Minnesota, Minneapolis, MN (United States)
2016-12-01
An ever-increasing amount of evidence suggests that approximately one quarter of the energy in the universe is composed of some non-luminous, and hitherto unknown, “dark matter”. Physicists from numerous sub-fields have been working on and trying to solve the dark matter problem for decades. The common solution is the existence of some new type of elementary particle with particular focus on weakly interacting massive particles (WIMPs). One avenue of dark matter research is to create an extremely sensitive particle detector with the goal of directly observing the interaction of WIMPs with standard matter. The Cryogenic Dark Matter Search (CDMS) project operated at the Soudan Underground Laboratory from 2003–2015, under the CDMS II and SuperCDMS Soudan experiments, with this goal of directly detecting dark matter. The next installation, SuperCDMS SNOLAB, is planned for near-future operation. The reason the dark-matter particle has not yet been observed in traditional particle physics experiments is that it must have very small cross sections, thus making such interactions extremely rare. In order to identify these rare events in the presence of a background of known particles and interactions, direct detection experiments employ various types and amounts of shielding to prevent known backgrounds from reaching the instrumented detector(s). CDMS utilized various gamma and neutron shielding to such an effect that the shielding, and other experimental components, themselves were sources of background. These radiogenic backgrounds must be understood to have confidence in any WIMP-search result. For this dissertation, radiogenic background studies and estimates were performed for various analyses covering CDMS II, SuperCDMS Soudan, and SuperCDMS SNOLAB. Lower-mass dark matter t c2 inent in the past few years. The CDMS detectors can be operated in an alternative, higher-biased, mode v to decrease their energy thresholds and correspondingly increase their sensitivity
Support Vector Regression and Genetic Algorithm for HVAC Optimal Operation
Directory of Open Access Journals (Sweden)
Ching-Wei Chen
2016-01-01
Full Text Available This study covers records of various parameters affecting the power consumption of air-conditioning systems. Using the Support Vector Machine (SVM, the chiller power consumption model, secondary chilled water pump power consumption model, air handling unit fan power consumption model, and air handling unit load model were established. In addition, it was found that R2 of the models all reached 0.998, and the training time was far shorter than that of the neural network. Through genetic programming, a combination of operating parameters with the least power consumption of air conditioning operation was searched. Moreover, the air handling unit load in line with the air conditioning cooling load was predicted. The experimental results show that for the combination of operating parameters with the least power consumption in line with the cooling load obtained through genetic algorithm search, the power consumption of the air conditioning systems under said combination of operating parameters was reduced by 22% compared to the fixed operating parameters, thus indicating significant energy efficiency.
Searches for Fourth Generation, Vector-like Quarks and ttbar Resonances with the ATLAS Detector
Nektarijevic, S
2013-01-01
The LHC operation at the high center of mass energies has opened the insight into the potential production of exotic heavy particles. A summary of the searches for the heavy quarks and the heavy bosons decaying into the top-antitop pairs ($t\\bar{t}$ resonances) with $14.3~\\rm{fb^{-1}}$ of the ATLAS detector data at $\\sqrt{s} =8~\\rm{TeV}$ is presented here. The searches for heavy quarks are performed in frameworks of the chiral fourth generation and vector-like quarks. One of the searches is also sensitive to the production of four top quarks and positively-charged top quark pairs. The searches for the $t\\bar{t}$ resonances rely on the narrow width topcolor leptophobic $Z'$ and broad width Kaluza-Klein gluon as bench mark.