Job Search, Networks, and Labor Market Performance of Immigrants

OpenAIRE

Arceo-Gómez, Eva Olimpia

2012-01-01

We develop an on-the-job search model in which immigrants search for jobs through formal channels or networks, and the quality of job offers differs across search methods. The model predicts networks unambiguously lead to a larger share of network jobs in job-to-job transitions, whereas the effect is ambiguous in unemployment-to-job transitions.

Realistic searches on stretched exponential networks

Indian Academy of Sciences (India)

We consider navigation or search schemes on networks which have a degree distribution of the form () ∝ exp(−). In addition, the linking probability is taken to be dependent on social distances and is governed by a parameter . The searches are realistic in the sense that not all search chains can be completed.

Guided search for triple conjunctions.

Science.gov (United States)

Nordfang, Maria; Wolfe, Jeremy M

2014-08-01

A key tenet of feature integration theory and of related theories such as guided search (GS) is that the binding of basic features requires attention. This would seem to predict that conjunctions of features of objects that have not been attended should not influence search. However, Found (1998) reported that an irrelevant feature (size) improved the efficiency of search for a Color × Orientation conjunction if it was correlated with the other two features across the display, as compared to the case in which size was not correlated with color and orientation features. We examined this issue with somewhat different stimuli. We used triple conjunctions of color, orientation, and shape (e.g., search for a red, vertical, oval-shaped item). This allowed us to manipulate the number of features that each distractor shared with the target (sharing) and it allowed us to vary the total number of distractor types (and, thus, the number of groups of identical items: grouping). We found that these triple conjunction searches were generally very efficient--producing very shallow Reaction Time × Set Size slopes, consistent with strong guidance by basic features. Nevertheless, both of the variables, sharing and grouping, modulated performance. These influences were not predicted by previous accounts of GS; however, both can be accommodated in a GS framework. Alternatively, it is possible, though not necessary, to see these effects as evidence for "preattentive binding" of conjunctions.

Optimal Quantum Spatial Search on Random Temporal Networks

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Optimal Quantum Spatial Search on Random Temporal Networks.

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Search Engine Competition with Network Externalities

NARCIS (Netherlands)

Argenton, C.; Prüfer, J.

2011-01-01

The market for Internet search is not only economically and socially important, it is also highly concentrated. Is this a problem? We study the question whether "competition is only a free click away". We argue that the market for Internet search is characterized by indirect network externalities

CompTIA Network+ Review Guide Exam N10-005

CERN Document Server

Ferguson, Bill

2012-01-01

Fast, focused review for the latest CompTIA Network+ Exam N10-005 CompTIA's Network+ certification is the leading non-vendor networking certification in the world and has become the standard certification for networking professionals. Make sure you're ready for CompTIA's new Network+ certification (exam N10-005) with this new edition of Sybex's CompTIA Network+ Review Guide. This concise guide is efficiently organized by exam objectives and covers all five exam domains. The book also includes 50 chapter review questions, as well as access to two online practice exams, and much more. It's the p

Search engine competition with network externalities

NARCIS (Netherlands)

Argenton, C.; Prüfer, J.

2012-01-01

The market for Internet search is not only economically and socially important, it is also highly concentrated. Is this a problem? We study the question of whether “competition is only a free click away.” We argue that the market for Internet search is characterized by indirect network externalities

CompTIA Network+ Study Guide Exam N10-005

CERN Document Server

Lammle, Todd

2012-01-01

Todd Lammle's latest CompTIA Network+ Study Guide, now updated for the new exam! CompTIA's Network+ certification tells the world you have the skills to install, configure, and troubleshoot today's basic networking hardware peripherals and protocols. But first, you have to pass the exam! This detailed CompTIA Authorized study guide by networking guru Todd Lammle has everything you need to prepare for the CompTIA's new Network+Exam N10-005. All exam objectives are covered. He thoroughly explains key topics, offers plenty of practical examples, and draws upon his own invaluable 25+ years of netw

A penalty guided stochastic fractal search approach for system reliability optimization

International Nuclear Information System (INIS)

Mellal, Mohamed Arezki; Zio, Enrico

2016-01-01

Modern industry requires components and systems with high reliability levels. In this paper, we address the system reliability optimization problem. A penalty guided stochastic fractal search approach is developed for solving reliability allocation, redundancy allocation, and reliability–redundancy allocation problems. Numerical results of ten case studies are presented as benchmark problems for highlighting the superiority of the proposed approach compared to others from literature. - Highlights: • System reliability optimization is investigated. • A penalty guided stochastic fractal search approach is developed. • Results of ten case studies are compared with previously published methods. • Performance of the approach is demonstrated.

A Search Model with a Quasi-Network

DEFF Research Database (Denmark)

Ejarque, Joao Miguel

This paper adds a quasi-network to a search model of the labor market. Fitting the model to an average unemployment rate and to other moments in the data implies the presence of the network is not noticeable in the basic properties of the unemployment and job finding rates. However, the network...

EMPLOYING SENSOR NETWORK TO GUIDE FIREFIGHTERS IN DANGEROUS AREA

DEFF Research Database (Denmark)

Koohi, Hamidreza; Nadernejad, Ehsan; Fathi, Mahmoud

2010-01-01

In this paper, we intend to focus on the sensor network applications in firefighting. A distributed algorithm is developed for the sensor network to guide firefighters through a burning area. The sensor network models the danger of the area under coverage as obstacles, and has the property to adapt...... itself against possible changes. The protocol developed, will integrate the artificial potential field of the sensors with the information of the intended place of moving firefighter so that it guides the firefighter step by step through the sensor network by choosing the safest path in dangerous zones....... This protocol is simulated by Visual-Sense and the simulation results are available. Keyword: Firefighter, Sensor Network, Potential Field, Area’s Danger, Navigation...

The wireshark field guide analyzing and troubleshooting network traffic

CERN Document Server

Shimonski, Robert

2013-01-01

The Wireshark Field Guide provides hackers, pen testers, and network administrators with practical guidance on capturing and interactively browsing computer network traffic. Wireshark is the world's foremost network protocol analyzer, with a rich feature set that includes deep inspection of hundreds of protocols, live capture, offline analysis and many other features. The Wireshark Field Guide covers the installation, configuration and use of this powerful multi-platform tool. The book give readers the hands-on skills to be more productive with Wireshark as they drill

Microsoft Windows 2000 Network Architecture Guide

National Research Council Canada - National Science Library

Bartock, Paul

2000-01-01

The purpose of this guide is to inform the reader about the services that are available in the Microsoft Windows 2000 environment and how to integrate these services into their network architecture...

Mapping Self-Guided Learners' Searches for Video Tutorials on YouTube

Science.gov (United States)

Garrett, Nathan

2016-01-01

While YouTube has a wealth of educational videos, how self-guided learners use these resources has not been fully described. An analysis of search engine queries for help with the use of Microsoft Excel shows that few users search for specific features or functions but instead use very general terms. Because the same videos are returned in…

The Impact of Task Demands on Fixation-Related Brain Potentials during Guided Search.

Directory of Open Access Journals (Sweden)

Anthony J Ries

Full Text Available Recording synchronous data from EEG and eye-tracking provides a unique methodological approach for measuring the sensory and cognitive processes of overt visual search. Using this approach we obtained fixation related potentials (FRPs during a guided visual search task specifically focusing on the lambda and P3 components. An outstanding question is whether the lambda and P3 FRP components are influenced by concurrent task demands. We addressed this question by obtaining simultaneous eye-movement and electroencephalographic (EEG measures during a guided visual search task while parametrically modulating working memory load using an auditory N-back task. Participants performed the guided search task alone, while ignoring binaurally presented digits, or while using the auditory information in a 0, 1, or 2-back task. The results showed increased reaction time and decreased accuracy in both the visual search and N-back tasks as a function of auditory load. Moreover, high auditory task demands increased the P3 but not the lambda latency while the amplitude of both lambda and P3 was reduced during high auditory task demands. The results show that both early and late stages of visual processing indexed by FRPs are significantly affected by concurrent task demands imposed by auditory working memory.

CompTIA network+ study guide exam N10-006

CERN Document Server

Lammle, Todd

2015-01-01

All-star N10-006 prep, fully updated for the new exam The CompTIA Network+ Study Guide is your one-stop comprehensive resource in preparing for exam N10-006 Bestselling author and networking Guru Todd Lammle guides you through 100% of all exam objectives detailing the fundamental concepts you will need to know to prepare for the exam. Coverage includes network technologies, installation and configuration, media and topologies, security, and much more, plus practical examples drawn from real-world situations. You also gain access to practice exams and electronic flashcards that facilitate info

A Planning Guide for Instructional Networks, Part I.

Science.gov (United States)

Daly, Kevin F.

1994-01-01

Discusses three phases in implementing a master plan for a school-based local area network (LAN): (1) network software selection; (2) hardware selection, network topology, and site preparation; and (3) implementation time table. Sample planning and specification worksheets and a list of planning guides are included. (Contains six references.) (KRN)

A concept of volume rendering guided search process to analyze medical data set.

Science.gov (United States)

Zhou, Jianlong; Xiao, Chun; Wang, Zhiyan; Takatsuka, Masahiro

2008-03-01

This paper firstly presents an approach of parallel coordinates based parameter control panel (PCP). The PCP is used to control parameters of focal region-based volume rendering (FRVR) during data analysis. It uses a parallel coordinates style interface. Different rendering parameters represented with nodes on each axis, and renditions based on related parameters are connected using polylines to show dependencies between renditions and parameters. Based on the PCP, a concept of volume rendering guided search process is proposed. The search pipeline is divided into four phases. Different parameters of FRVR are recorded and modulated in the PCP during search phases. The concept shows that volume visualization could play the role of guiding a search process in the rendition space to help users to efficiently find local structures of interest. The usability of the proposed approach is evaluated to show its effectiveness.

Posterior α EEG Dynamics Dissociate Current from Future Goals in Working Memory-Guided Visual Search.

Science.gov (United States)

de Vries, Ingmar E J; van Driel, Joram; Olivers, Christian N L

2017-02-08

Current models of visual search assume that search is guided by an active visual working memory representation of what we are currently looking for. This attentional template for currently relevant stimuli can be dissociated from accessory memory representations that are only needed prospectively, for a future task, and that should be prevented from guiding current attention. However, it remains unclear what electrophysiological mechanisms dissociate currently relevant (serving upcoming selection) from prospectively relevant memories (serving future selection). We measured EEG of 20 human subjects while they performed two consecutive visual search tasks. Before the search tasks, a cue instructed observers which item to look for first (current template) and which second (prospective template). During the delay leading up to the first search display, we found clear suppression of α band (8-14 Hz) activity in regions contralateral to remembered items, comprising both local power and interregional phase synchronization within a posterior parietal network. Importantly, these lateralization effects were stronger when the memory item was currently relevant (i.e., for the first search) compared with when it was prospectively relevant (i.e., for the second search), consistent with current templates being prioritized over future templates. In contrast, event-related potential analysis revealed that the contralateral delay activity was similar for all conditions, suggesting no difference in storage. Together, these findings support the idea that posterior α oscillations represent a state of increased processing or excitability in task-relevant cortical regions, and reflect enhanced cortical prioritization of memory representations that serve as a current selection filter. SIGNIFICANCE STATEMENT Our days are filled with looking for relevant objects while ignoring irrelevant visual information. Such visual search activity is thought to be driven by current goals activated in

Cognitive Control Network Contributions to Memory-Guided Visual Attention.

Science.gov (United States)

Rosen, Maya L; Stern, Chantal E; Michalka, Samantha W; Devaney, Kathryn J; Somers, David C

2016-05-01

Visual attentional capacity is severely limited, but humans excel in familiar visual contexts, in part because long-term memories guide efficient deployment of attention. To investigate the neural substrates that support memory-guided visual attention, we performed a set of functional MRI experiments that contrast long-term, memory-guided visuospatial attention with stimulus-guided visuospatial attention in a change detection task. Whereas the dorsal attention network was activated for both forms of attention, the cognitive control network(CCN) was preferentially activated during memory-guided attention. Three posterior nodes in the CCN, posterior precuneus, posterior callosal sulcus/mid-cingulate, and lateral intraparietal sulcus exhibited the greatest specificity for memory-guided attention. These 3 regions exhibit functional connectivity at rest, and we propose that they form a subnetwork within the broader CCN. Based on the task activation patterns, we conclude that the nodes of this subnetwork are preferentially recruited for long-term memory guidance of visuospatial attention. Published by Oxford University Press 2015. This work is written by (a) US Government employee(s) and is in the public domain in the US.

An improved algorithm for searching all minimal cuts in modified networks

International Nuclear Information System (INIS)

Yeh, W.-C.

2008-01-01

A modified network is an updated network after inserting a branch string (a special path) between two nodes in the original network. Modifications are common for network expansion or reinforcement evaluation and planning. The problem of searching all minimal cuts (MCs) in a modified network is discussed and solved in this study. The existing best-known methods for solving this problem either needed extensive comparison and verification or failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method for searching all MCs without an extensive research procedure is proposed. In this study, we first develop an intuitive algorithm based upon the reformation of all MCs in the original network to search for all MCs in a modified network. Next, the correctness of the proposed algorithm will be analyzed and proven. The computational complexity of the proposed algorithm is analyzed and compared with the existing best-known methods. Finally, two examples illustrate how all MCs are generated in a modified network using the information of all of the MCs in the corresponding original network

Beyond scene gist: Objects guide search more than scene background.

Science.gov (United States)

Koehler, Kathryn; Eckstein, Miguel P

2017-06-01

Although the facilitation of visual search by contextual information is well established, there is little understanding of the independent contributions of different types of contextual cues in scenes. Here we manipulated 3 types of contextual information: object co-occurrence, multiple object configurations, and background category. We isolated the benefits of each contextual cue to target detectability, its impact on decision bias, confidence, and the guidance of eye movements. We find that object-based information guides eye movements and facilitates perceptual judgments more than scene background. The degree of guidance and facilitation of each contextual cue can be related to its inherent informativeness about the target spatial location as measured by human explicit judgments about likely target locations. Our results improve the understanding of the contributions of distinct contextual scene components to search and suggest that the brain's utilization of cues to guide eye movements is linked to the cue's informativeness about the target's location. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Image-guided, Laser-based Fabrication of Vascular-derived Microfluidic Networks

OpenAIRE

Heintz, Keely A.; Mayerich, David; Slater, John H.

2017-01-01

This detailed protocol outlines the implementation of image-guided, laser-based hydrogel degradation for the fabrication of vascular-derived microfluidic networks embedded in PEGDA hydrogels. Here, we describe the creation of virtual masks that allow for image-guided laser control; the photopolymerization of a micromolded PEGDA hydrogel, suitable for microfluidic network fabrication and pressure head-driven flow; the setup and use of a commercially available laser scanning confocal microscope...

Single-Molecule View of Small RNA-Guided Target Search and Recognition.

Science.gov (United States)

Globyte, Viktorija; Kim, Sung Hyun; Joo, Chirlmin

2018-05-20

Most everyday processes in life involve a necessity for an entity to locate its target. On a cellular level, many proteins have to find their target to perform their function. From gene-expression regulation to DNA repair to host defense, numerous nucleic acid-interacting proteins use distinct target search mechanisms. Several proteins achieve that with the help of short RNA strands known as guides. This review focuses on single-molecule advances studying the target search and recognition mechanism of Argonaute and CRISPR (clustered regularly interspaced short palindromic repeats) systems. We discuss different steps involved in search and recognition, from the initial complex prearrangement into the target-search competent state to the final proofreading steps. We focus on target search mechanisms that range from weak interactions, to one- and three-dimensional diffusion, to conformational proofreading. We compare the mechanisms of Argonaute and CRISPR with a well-studied target search system, RecA.

Practical guide to content delivery networks

CERN Document Server

Held, Gilbert

2005-01-01

With a practical and organized approach to learning and implementation, A Practical Guide to Content Delivery Networks presents a step-by-step process for building a highly available and highly scalable content delivery network (CDN). CDN refers to the infrastructure behind any service that provides utility or access to data to an end user. This book offers terminology, tactics, potential problems to avoid, and individual layers of design, providing clear understanding of the framework for CDNs using a structural and visual approach. The text emphasizes a best-of-breed strategy, allowing a tec

Social Networks in the Labour Market--The Sociology of Job Search.

Science.gov (United States)

Carson, Edgar

1989-01-01

Reviews literature on nature of social networks in labor market and their implications for job search strategies of dislocated workers. Suggests issues for further research: (1) how the job search changes as unemployment increases; (2) the role of social networks in the labor market; and (3) claims about security and conditions of jobs found…

Large-Scale Recurrent Neural Network Based Modelling of Gene Regulatory Network Using Cuckoo Search-Flower Pollination Algorithm.

Science.gov (United States)

Mandal, Sudip; Khan, Abhinandan; Saha, Goutam; Pal, Rajat K

2016-01-01

The accurate prediction of genetic networks using computational tools is one of the greatest challenges in the postgenomic era. Recurrent Neural Network is one of the most popular but simple approaches to model the network dynamics from time-series microarray data. To date, it has been successfully applied to computationally derive small-scale artificial and real-world genetic networks with high accuracy. However, they underperformed for large-scale genetic networks. Here, a new methodology has been proposed where a hybrid Cuckoo Search-Flower Pollination Algorithm has been implemented with Recurrent Neural Network. Cuckoo Search is used to search the best combination of regulators. Moreover, Flower Pollination Algorithm is applied to optimize the model parameters of the Recurrent Neural Network formalism. Initially, the proposed method is tested on a benchmark large-scale artificial network for both noiseless and noisy data. The results obtained show that the proposed methodology is capable of increasing the inference of correct regulations and decreasing false regulations to a high degree. Secondly, the proposed methodology has been validated against the real-world dataset of the DNA SOS repair network of Escherichia coli. However, the proposed method sacrifices computational time complexity in both cases due to the hybrid optimization process.

Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

Directory of Open Access Journals (Sweden)

Mohammad Taghi Ameli

2012-01-01

Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

Social Networks and their Importance in Job Searching of College Students

Directory of Open Access Journals (Sweden)

Marek Potkány

2015-03-01

Full Text Available At present, in every sphere of human activity, using modern ICT is considered as a matter of course. Several human resources management institutions are aware of the potential of social networks in estabilishing and building relationships with their target groups. It is a trend to create job portals in social networks. These are currently an integrated part of communication with target audience and therefore also an objects of attention and reflexions. It is also the topic of this paper. The goal of this research is to determine the level of use of social networks by college students in Slovakia. Part of the research is also to discover the effect of social networks on job searching of a selected sample of students. The research was conducted on a sample of 407 slovak students. A questioning method in form of an online questionnaire was used. The obtained results were processed using methods of descriptive and test statistics. We studied the significance of gender on the frequency of using the internet to search for job opportunities via social networks, as well as the ability to apprehend the importance of personal presentation on social networks. The statistical testing did not prove any significant difference between men and women in the question of frequency of using internet to search for job opportunities, nor in the ability to apprehend the importance of personal presentation on social networks. A statistically significant difference in gender was proven only in case of using social networks in job searching. Women tend to use social networks to find jobs more often than men. These statements are proved by the results of tests of significance of mean changes at the 5% significance level, which means that they are valid with 95% probability.

76 FR 25695 - Public Health Information Network (PHIN) Messaging Guide for Syndromic Surveillance

Science.gov (United States)

2011-05-05

.../library/2011/guides/Syndromic_Surveillance_Implementation_Guide_Release_1_4.pdf . Written comments... http://www.cdc.gov/phin/library/2011/guides/Syndromic_Surveillance_Implementation_Guide_Release_1_4.pdf...-2011-0004] Public Health Information Network (PHIN) Messaging Guide for Syndromic Surveillance AGENCY...

Posterior α EEG Dynamics Dissociate Current from Future Goals in Working Memory-Guided Visual Search

NARCIS (Netherlands)

de Vries, I.E.J.; van Driel, J.; Olivers, C.N.L.

2017-01-01

Current models of visual search assume that search is guided by an active visual working memory representation of what we are currently looking for. This attentional template for currently relevant stimuli can be dissociated from accessory memory representations that are only needed prospectively,

Electroencephalography epilepsy classifications using hybrid cuckoo search and neural network

Science.gov (United States)

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

Using a neural network in the search for the Higgs boson

International Nuclear Information System (INIS)

Hultqvist, K.; Jacobsson, R.; Johansson, K.E.

1995-01-01

The search for the Standard Model Higgs boson in high energy e + e - collisions requires analysis techniques which efficiently discriminate against the very large background. A classifier based on a feed-forward neural network has been extensively used in a search in the channel where the Higgs boson is produced in association with neutrinos. The method has significantly improved the sensitivity of the search. With a simple preselection based on event topology followed by a neural network we have obtained a combined background rejection factor of more than 29 000 and a selection efficiency for Higgs particle events of 54%, assuming a mass of 55 GeV/c 2 for the Higgs boson. We describe here the details of the analysis with emphasis on the neural network. (orig.)

Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection

Directory of Open Access Journals (Sweden)

Suman Saha

2016-03-01

Full Text Available The objective of this article is to bridge the gap between two important research directions: (1 nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2 complex network analysis, which deals with large real graphs but is generally studied via graph theoretic analysis or spectral analysis. In this article, we have studied the nearest neighbor search problem in a complex network by the development of a suitable notion of nearness. The computation of efficient nearest neighbor search among the nodes of a complex network using the metric tree and locality sensitive hashing (LSH are also studied and experimented. For evaluation of the proposed nearest neighbor search in a complex network, we applied it to a network community detection problem. Experiments are performed to verify the usefulness of nearness measures for the complex networks, the role of metric tree and LSH to compute fast and approximate node nearness and the the efficiency of community detection using nearest neighbor search. We observed that nearest neighbor between network nodes is a very efficient tool to explore better the community structure of the real networks. Several efficient approximation schemes are very useful for large networks, which hardly made any degradation of results, whereas they save lot of computational times, and nearest neighbor based community detection approach is very competitive in terms of efficiency and time.

Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags

Science.gov (United States)

Ohnishi, Kei; Yoshida, Kaori; Oie, Yuji

We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.

An Improved Harmony Search Algorithm for Power Distribution Network Planning

Directory of Open Access Journals (Sweden)

Wei Sun

2015-01-01

Full Text Available Distribution network planning because of involving many variables and constraints is a multiobjective, discrete, nonlinear, and large-scale optimization problem. Harmony search (HS algorithm is a metaheuristic algorithm inspired by the improvisation process of music players. HS algorithm has several impressive advantages, such as easy implementation, less adjustable parameters, and quick convergence. But HS algorithm still has some defects such as premature convergence and slow convergence speed. According to the defects of the standard algorithm and characteristics of distribution network planning, an improved harmony search (IHS algorithm is proposed in this paper. We set up a mathematical model of distribution network structure planning, whose optimal objective function is to get the minimum annual cost and constraint conditions are overload and radial network. IHS algorithm is applied to solve the complex optimization mathematical model. The empirical results strongly indicate that IHS algorithm can effectively provide better results for solving the distribution network planning problem compared to other optimization algorithms.

CompTIA Network+ Certification Study Guide, Exam N10-004

CERN Document Server

Shimonski, Robert

2009-01-01

CompTIA's Network+ certification is a globally-recognized, vendor neutral exam that has helped over 235,000 IT professionals reach further and higher in their careers. The 2009 Network+ exam (N10-004) is a major update with more focus on security and wireless aspects of networking. Our new study guide has been updated accordingly with focus on network, systems, and WAN security and complete coverage of today's wireless networking standards. As always this companion covers the core Network+ material including basic design principles, management and operation of a network infrastructure, and tes

Searching LOGIN, the Local Government Information Network.

Science.gov (United States)

Jack, Robert F.

1984-01-01

Describes a computer-based information retrieval and electronic messaging system produced by Control Data Corporation now being used by government agencies and other organizations. Background of Local Government Information Network (LOGIN), database structure, types of LOGIN units, searching LOGIN (intersect, display, and list commands), and how…

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

Directory of Open Access Journals (Sweden)

De-Xin Yu

2013-01-01

Full Text Available Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures.

Science.gov (United States)

Kentzoglanakis, Kyriakos; Poole, Matthew

2012-01-01

In this paper, we investigate the problem of reverse engineering the topology of gene regulatory networks from temporal gene expression data. We adopt a computational intelligence approach comprising swarm intelligence techniques, namely particle swarm optimization (PSO) and ant colony optimization (ACO). In addition, the recurrent neural network (RNN) formalism is employed for modeling the dynamical behavior of gene regulatory systems. More specifically, ACO is used for searching the discrete space of network architectures and PSO for searching the corresponding continuous space of RNN model parameters. We propose a novel solution construction process in the context of ACO for generating biologically plausible candidate architectures. The objective is to concentrate the search effort into areas of the structure space that contain architectures which are feasible in terms of their topological resemblance to real-world networks. The proposed framework is initially applied to the reconstruction of a small artificial network that has previously been studied in the context of gene network reverse engineering. Subsequently, we consider an artificial data set with added noise for reconstructing a subnetwork of the genetic interaction network of S. cerevisiae (yeast). Finally, the framework is applied to a real-world data set for reverse engineering the SOS response system of the bacterium Escherichia coli. Results demonstrate the relative advantage of utilizing problem-specific knowledge regarding biologically plausible structural properties of gene networks over conducting a problem-agnostic search in the vast space of network architectures.

The use of conflicts in searching Bayesian networks

OpenAIRE

Poole, David L.

2013-01-01

This paper discusses how conflicts (as used by the consistency-based diagnosis community) can be adapted to be used in a search-based algorithm for computing prior and posterior probabilities in discrete Bayesian Networks. This is an "anytime" algorithm, that at any stage can estimate the probabilities and give an error bound. Whereas the most popular Bayesian net algorithms exploit the structure of the network for efficiency, we exploit probability distributions for efficiency; this algorith...

An information search model for online social Networks - MOBIRSE

Directory of Open Access Journals (Sweden)

Miguel Angel Niño Zambrano

2015-09-01

Full Text Available Online Social Networks (OSNs have been gaining great importance among Internet users in recent years.  These are sites where it is possible to meet people, publish, and share content in a way that is both easy and free of charge. As a result, the volume of information contained in these websites has grown exponentially, and web search has consequently become an important tool for users to easily find information relevant to their social networking objectives. Making use of ontologies and user profiles can make these searches more effective. This article presents a model for Information Retrieval in OSNs (MOBIRSE based on user profile and ontologies which aims to improve the relevance of retrieved information on these websites. The social network Facebook was chosen for a case study and as the instance for the proposed model. The model was validated using measures such as At-k Precision and Kappa statistics, to assess its efficiency.

Mastering the game of Go with deep neural networks and tree search

Science.gov (United States)

Silver, David; Huang, Aja; Maddison, Chris J.; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis

2016-01-01

The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem

Directory of Open Access Journals (Sweden)

Mhand Hifi

2015-12-01

Full Text Available In this paper, we investigate the use of a hybrid guided neighborhood search for solving the disjunctively constrained knapsack problem. The studied problem may be viewed as a combination of two NP-hard combinatorial optimization problems: the weighted-independent set and the classical binary knapsack. The proposed algorithm is a hybrid approach that combines both deterministic and random local searches. The deterministic local search is based on a descent method, where both building and exploring procedures are alternatively used for improving the solution at hand. In order to escape from a local optima, a random local search strategy is introduced which is based on a modified ant colony optimization system. During the search process, the ant colony optimization system tries to diversify and to enhance the solutions using some informations collected from the previous iterations. Finally, the proposed algorithm is computationally analyzed on a set of benchmark instances available in the literature. The provided results are compared to those realized by both the Cplex solver and a recent algorithm of the literature. The computational part shows that the obtained results improve most existing solution values.

Application of Neural Networks to Higgs Boson Search

Czech Academy of Sciences Publication Activity Database

Hakl, František; Hlaváček, M.; Kalous, R.

2003-01-01

Roč. 502, - (2003), s. 489-491 ISSN 0168-9002 R&D Projects: GA MPO RP-4210/69/97 Institutional research plan: AV0Z1030915 Keywords : neural network s * Higgs search * genetic optimization Subject RIV: BA - General Mathematics Impact factor: 1.166, year: 2003

Technical guide to the connection of generation to the distribution network

Energy Technology Data Exchange (ETDEWEB)

Jarrett, K.; Hedgecock, J.; Gregory, R.; Warham, T.

2003-07-01

This guide provides a 'route map' of the processes of getting a generation scheme connected to the network and is intended to help developers of any form of distributed generation connected to the UK's local electricity networks, eg: renewable energy schemes; waste-to-energy schemes; on-site generation and combined heat and power (CHP) schemes; and peak lopping schemes using back-up generators. Where necessary, the guide distinguishes between arrangements that apply in Scotland and those that apply in England and Wales. The guide aims to: provide background information about the electricity industry; highlight common technical issues that arise during connection negotiation and their implications for distribution network operators (DNOs) and developers; examine the main factors affecting connection costs and timescales for achieving connections; and identify the different types of contracts relating to connection. The report considers the connection process, the connection application process and timescales, costs and charges, competition in connection, the structure of the UK electricity industry, the statutory framework, the effects of distributed generation of the distribution system, earthing and protection design, safety issues and DNO network information. It includes a glossary, checklists, useful contact details and information about standards and other useful documents.

A model-guided symbolic execution approach for network protocol implementations and vulnerability detection.

Science.gov (United States)

Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing

2017-01-01

Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM) model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.

Guided basin-hopping search of small boron clusters with density functional theory

Energy Technology Data Exchange (ETDEWEB)

Ng, Wei Chun; Yoon, Tiem Leong [School of Physics, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia); Lim, Thong Leng [Faculty of Engineering and Technology, Multimedia University, Melacca Campus, 75450 Melaka (Malaysia)

2015-04-24

The search for the ground state structures of Boron clusters has been a difficult computational task due to the unique metalloid nature of Boron atom. Previous research works had overcome the problem in the search of the Boron ground-state structures by adding symmetry constraints prior to the process of locating the local minima in the potential energy surface (PES) of the Boron clusters. In this work, we shown that, with the deployment of a novel computational approach that incorporates density functional theory (DFT) into a guided global optimization search algorithm based on basin-hopping, it is possible to directly locate the local minima of small Boron clusters in the PES at the DFT level. The ground-state structures search algorithm as proposed in this work is initiated randomly and needs not a priori symmetry constraint artificially imposed throughout the search process. Small sized Boron clusters so obtained compare well to the results obtained by similar calculations in the literature. The electronic properties of each structures obtained are calculated within the DFT framework.

Guided basin-hopping search of small boron clusters with density functional theory

International Nuclear Information System (INIS)

Ng, Wei Chun; Yoon, Tiem Leong; Lim, Thong Leng

2015-01-01

The search for the ground state structures of Boron clusters has been a difficult computational task due to the unique metalloid nature of Boron atom. Previous research works had overcome the problem in the search of the Boron ground-state structures by adding symmetry constraints prior to the process of locating the local minima in the potential energy surface (PES) of the Boron clusters. In this work, we shown that, with the deployment of a novel computational approach that incorporates density functional theory (DFT) into a guided global optimization search algorithm based on basin-hopping, it is possible to directly locate the local minima of small Boron clusters in the PES at the DFT level. The ground-state structures search algorithm as proposed in this work is initiated randomly and needs not a priori symmetry constraint artificially imposed throughout the search process. Small sized Boron clusters so obtained compare well to the results obtained by similar calculations in the literature. The electronic properties of each structures obtained are calculated within the DFT framework

Tensions in R&D networks : Implications for knowledge search and integration

NARCIS (Netherlands)

Ritala, Paavo; Huizingh, Eelko; Almpanopoulou, Argyro; Wijbenga, Paul

R&D Networks comprise different actors with various goals and motivations. Thus, such networks are filled with tensions that emerge from simultaneously existing, competing or contradictory organizing elements and demands. In this study, we examine the knowledge search and integration behaviour of

A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network

International Nuclear Information System (INIS)

Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth

2016-01-01

We propose a decision model aimed at increasing security in a utility network (e.g., electricity, gas, water or communication network). The network is modelled as a graph, the edges of which are unreliable. We assume that all edges (e.g., pipes, cables) have a certain, not necessarily equal, probability of failure, which can be reduced by selecting edge-specific security strategies. We develop a mathematical programming model and a metaheuristic approach that uses a greedy random adaptive search procedure to find an initial solution and uses tabu search hybridised with iterated local search and a variable neighbourhood descend heuristic to improve this solution. The main goal is to reduce the risk of service failure between an origin and a destination node by selecting the right combination of security measures for each network edge given a limited security budget. - Highlights: • A decision model aimed at increasing security in a utility network is proposed. • The goal is to reduce the risk of service failure given a limited security budget. • An exact approach and a variable neighbourhood tabu search heuristic are developed. • A generator for realistic networks is built and used to test the solution methods. • The hybridised heuristic reduces the total risk on average with 32%.

CompTIA Network+ Review Guide (Exam N10-004)

CERN Document Server

Ferguson, Bill

2009-01-01

Serving as a concise, focused study aid to help you prepare for the leading non-vendor-specific networking certification exam, this book features more review questions and study review features than any other guide, with over 120 review questions, two bonus exams, and electronic Flashcard, as well as a searchable Glossary of Terms database on CD-ROM. Fully updated for the first revision of the CompTIA Network+ exam since 2005, the book is organized by exam objectives and broken into six parts corresponding to the six domain areas of the Network+ exam: technologies, media and topologies, device

A model-guided symbolic execution approach for network protocol implementations and vulnerability detection.

Directory of Open Access Journals (Sweden)

Shameng Wen

Full Text Available Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.

Numerical Algorithms for Personalized Search in Self-organizing Information Networks

CERN Document Server

Kamvar, Sep

2010-01-01

This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. Representing much of the foundational research in this field, the book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Sep Kamvar focuses on eigenvector-based techniques in Web search, introducing a personalized variant of Google's PageRank algorithm, and he outlines algorithms--such as the now-famous quad

Nuclear expert web search and crawler algorithm

International Nuclear Information System (INIS)

Reis, Thiago; Barroso, Antonio C.O.; Baptista, Benedito Filho D.

2013-01-01

In this paper we present preliminary research on web search and crawling algorithm applied specifically to nuclear-related web information. We designed a web-based nuclear-oriented expert system guided by a web crawler algorithm and a neural network able to search and retrieve nuclear-related hyper textual web information in autonomous and massive fashion. Preliminary experimental results shows a retrieval precision of 80% for web pages related to any nuclear theme and a retrieval precision of 72% for web pages related only to nuclear power theme. (author)

Nuclear expert web search and crawler algorithm

Energy Technology Data Exchange (ETDEWEB)

Reis, Thiago; Barroso, Antonio C.O.; Baptista, Benedito Filho D., E-mail: thiagoreis@usp.br, E-mail: barroso@ipen.br, E-mail: bdbfilho@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

2013-07-01

In this paper we present preliminary research on web search and crawling algorithm applied specifically to nuclear-related web information. We designed a web-based nuclear-oriented expert system guided by a web crawler algorithm and a neural network able to search and retrieve nuclear-related hyper textual web information in autonomous and massive fashion. Preliminary experimental results shows a retrieval precision of 80% for web pages related to any nuclear theme and a retrieval precision of 72% for web pages related only to nuclear power theme. (author)

Learning Bayesian network classifiers for credit scoring using Markov Chain Monte Carlo search

NARCIS (Netherlands)

Baesens, B.; Egmont-Petersen, M.; Castelo, R.; Vanthienen, J.

2001-01-01

In this paper, we will evaluate the power and usefulness of Bayesian network classifiers for credit scoring. Various types of Bayesian network classifiers will be evaluated and contrasted including unrestricted Bayesian network classifiers learnt using Markov Chain Monte Carlo (MCMC) search.

Using neural networks to understand the information that guides behavior: a case study in visual navigation.

Science.gov (United States)

Philippides, Andrew; Graham, Paul; Baddeley, Bart; Husbands, Philip

2015-01-01

To behave in a robust and adaptive way, animals must extract task-relevant sensory information efficiently. One way to understand how they achieve this is to explore regularities within the information animals perceive during natural behavior. In this chapter, we describe how we have used artificial neural networks (ANNs) to explore efficiencies in vision and memory that might underpin visually guided route navigation in complex worlds. Specifically, we use three types of neural network to learn the regularities within a series of views encountered during a single route traversal (the training route), in such a way that the networks output the familiarity of novel views presented to them. The problem of navigation is then reframed in terms of a search for familiar views, that is, views similar to those associated with the route. This approach has two major benefits. First, the ANN provides a compact holistic representation of the data and is thus an efficient way to encode a large set of views. Second, as we do not store the training views, we are not limited in the number of training views we use and the agent does not need to decide which views to learn.

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

Directory of Open Access Journals (Sweden)

J A Marmolejo

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

Search techniques in intelligent classification systems

CERN Document Server

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

Feed-Forward Neural Networks and Minimal Search Space Learning

Czech Academy of Sciences Publication Activity Database

Neruda, Roman

2005-01-01

Roč. 4, č. 12 (2005), s. 1867-1872 ISSN 1109-2750 R&D Projects: GA ČR GA201/05/0557 Institutional research plan: CEZ:AV0Z10300504 Keywords : search space * feed-forward networks * genetic algorithm s Subject RIV: BA - General Mathematics

A Bayesian network approach to the database search problem in criminal proceedings

Science.gov (United States)

2012-01-01

Background The ‘database search problem’, that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions

Recurrent neural network-based modeling of gene regulatory network using elephant swarm water search algorithm.

Science.gov (United States)

Mandal, Sudip; Saha, Goutam; Pal, Rajat Kumar

2017-08-01

Correct inference of genetic regulations inside a cell from the biological database like time series microarray data is one of the greatest challenges in post genomic era for biologists and researchers. Recurrent Neural Network (RNN) is one of the most popular and simple approach to model the dynamics as well as to infer correct dependencies among genes. Inspired by the behavior of social elephants, we propose a new metaheuristic namely Elephant Swarm Water Search Algorithm (ESWSA) to infer Gene Regulatory Network (GRN). This algorithm is mainly based on the water search strategy of intelligent and social elephants during drought, utilizing the different types of communication techniques. Initially, the algorithm is tested against benchmark small and medium scale artificial genetic networks without and with presence of different noise levels and the efficiency was observed in term of parametric error, minimum fitness value, execution time, accuracy of prediction of true regulation, etc. Next, the proposed algorithm is tested against the real time gene expression data of Escherichia Coli SOS Network and results were also compared with others state of the art optimization methods. The experimental results suggest that ESWSA is very efficient for GRN inference problem and performs better than other methods in many ways.

Object-based target templates guide attention during visual search.

Science.gov (United States)

Berggren, Nick; Eimer, Martin

2018-05-03

During visual search, attention is believed to be controlled in a strictly feature-based fashion, without any guidance by object-based target representations. To challenge this received view, we measured electrophysiological markers of attentional selection (N2pc component) and working memory (sustained posterior contralateral negativity; SPCN) in search tasks where two possible targets were defined by feature conjunctions (e.g., blue circles and green squares). Critically, some search displays also contained nontargets with two target features (incorrect conjunction objects, e.g., blue squares). Because feature-based guidance cannot distinguish these objects from targets, any selective bias for targets will reflect object-based attentional control. In Experiment 1, where search displays always contained only one object with target-matching features, targets and incorrect conjunction objects elicited identical N2pc and SPCN components, demonstrating that attentional guidance was entirely feature-based. In Experiment 2, where targets and incorrect conjunction objects could appear in the same display, clear evidence for object-based attentional control was found. The target N2pc became larger than the N2pc to incorrect conjunction objects from 250 ms poststimulus, and only targets elicited SPCN components. This demonstrates that after an initial feature-based guidance phase, object-based templates are activated when they are required to distinguish target and nontarget objects. These templates modulate visual processing and control access to working memory, and their activation may coincide with the start of feature integration processes. Results also suggest that while multiple feature templates can be activated concurrently, only a single object-based target template can guide attention at any given time. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Eleventh Hour Network+ Exam N10-004 Study Guide

CERN Document Server

Alpern, Naomi

2009-01-01

The 11th Hour Network+ Study Guide is keyed to the N10-004 revision of the CompTIA Network+ exam. This book is streamlined to include only core certification information and is presented for ease of last-minute studying. Main objectives of the exam are covered with key concepts highlighted. ..: ..; Fast Facts quickly review fundamentals ..; Exam Warnings highlight particularly tough sections of the exam ..; Crunch Time sidebars point out key concepts to remember ..; Did You Know? sidebars cover sometimes forgotten details ..; Top Five Toughest Questions and answers help you to prepare ..

State criminal justice telecommunications (STACOM). Volume 4: Network design software user's guide

Science.gov (United States)

Lee, J. J.

1977-01-01

A user's guide to the network design program is presented. The program is written in FORTRAN V and implemented on a UNIVAC 1108 computer under the EXEC-8 operating system which enables the user to construct least-cost network topologies for criminal justice digital telecommunications networks. A complete description of program features, inputs, processing logic, and outputs is presented, and a sample run and a program listing are included.

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks.

Science.gov (United States)

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-10-27

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.

Contextual cueing of pop-out visual search: when context guides the deployment of attention.

Science.gov (United States)

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.

A versatile sensor network for urban search and rescue operations

Science.gov (United States)

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.

How Will Online Affiliate Marketing Networks Impact Search Engine Rankings?

OpenAIRE

Janssen, David; Heck, Eric

2007-01-01

textabstractIn online affiliate marketing networks advertising web sites offer their affiliates revenues based on provided web site traffic and associated leads and sales. Advertising web sites can have a network of thousands of affiliates providing them with web site traffic through hyperlinks on their web sites. Search engines such as Google, MSN, and Yahoo, consider hyperlinks as a proof of quality and/or reliability of the linked web sites, and therefore use them to determine the relevanc...

Minimizing Redundant Messages and Improving Search Efficiency under Highly Dynamic Mobile P2P Network

Directory of Open Access Journals (Sweden)

Ajay Arunachalam

2016-02-01

Full Text Available Resource Searching is one of the key functional tasks in large complex networks. With the P2P architecture, millions of peers connect together instantly building a communication pattern. Searching in mobile networks faces additional limitations and challenges. Flooding technique can cope up with the churn and searches aggressively by visiting almost all the nodes. But it exponentially increases the network traffic and thus does not scale well. Further the duplicated query messages consume extra battery power and network bandwidth. The blind flooding also suffers from long delay problem in P2P networks. In this paper, we propose optimal density based flooding resource discovery schemes. Our first model takes into account local graph topology information to supplement the resource discovery process while in our extended version we also consider the neighboring node topology information along with the local node information to further effectively use the mobile and network resources. Our proposed method reduces collision at the same time minimizes effect of redundant messages and failures. Overall the methods reduce network overhead, battery power consumption, query delay, routing load, MAC load and bandwidth usage while also achieving good success rate in comparison to the other techniques. We also perform a comprehensive analysis of the resource discovery schemes to verify the impact of varying node speed and different network conditions.

In Search of Inner Wisdom: Guided Mindfulness Meditation in the Context of Suicide

Directory of Open Access Journals (Sweden)

Liora Birnbaum

2004-01-01

Full Text Available Spiritual concerns are highly relevant, but often ignored, in psychotherapy in general and in suicide in particular. This article presents Internet data and clinical case material bearing on the topic, and describes an innovative therapeutic intervention administered in a group-workshop format with suicide survivors and mental health professionals. The technique incorporates relaxation and mindfulness meditation, with the addition of guided meditation in search of inner wisdom. Results of the group intervention are described and illustrated. Many participants reported a significant positive experience including connection to knowledge that was highly relevant to them in their current state of life. Whether such insights were experienced as coming from within (a deeper part of the self or from an external source (a guiding figure or presence, indications are that guided meditation can be a powerful resource for therapists and their clients, suicidal and otherwise. Possible applications in diverse populations and settings, as well as the need for further research, are discussed.

Gravitational wave searches using the DSN (Deep Space Network)

International Nuclear Information System (INIS)

Nelson, S.J.; Armstrong, J.W.

1988-01-01

The Deep Space Network Doppler spacecraft link is currently the only method available for broadband gravitational wave searches in the 0.01 to 0.001 Hz frequency range. The DSN's role in the worldwide search for gravitational waves is described by first summarizing from the literature current theoretical estimates of gravitational wave strengths and time scales from various astrophysical sources. Current and future detection schemes for ground based and space based detectors are then discussed. Past, present, and future planned or proposed gravitational wave experiments using DSN Doppler tracking are described. Lastly, some major technical challenges to improve gravitational wave sensitivities using the DSN are discussed

Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Veena Anand

2017-01-01

Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

Google Search Queries About Neurosurgical Topics: Are They a Suitable Guide for Neurosurgeons?

Science.gov (United States)

Lawson McLean, Anna C; Lawson McLean, Aaron; Kalff, Rolf; Walter, Jan

2016-06-01

Google is the most popular search engine, with about 100 billion searches per month. Google Trends is an integrated tool that allows users to obtain Google's search popularity statistics from the last decade. Our aim was to evaluate whether Google Trends is a useful tool to assess the public's interest in specific neurosurgical topics. We evaluated Google Trends statistics for the neurosurgical search topic areas "hydrocephalus," "spinal stenosis," "concussion," "vestibular schwannoma," and "cerebral arteriovenous malformation." We compared these with bibliometric data from PubMed and epidemiologic data from the German Federal Monitoring Agency. In addition, we assessed Google users' search behavior for the search terms "glioblastoma" and "meningioma." Over the last 10 years, there has been an increasing interest in the topic "concussion" from Internet users in general and scientists. "Spinal stenosis," "concussion," and "vestibular schwannoma" are topics that are of special interest in high-income countries (eg, Germany), whereas "hydrocephalus" is a popular topic in low- and middle-income countries. The Google-defined top searches within these topic areas revealed more detail about people's interests (eg, "normal pressure hydrocephalus" or "football concussion" ranked among the most popular search queries within the corresponding topics). There was a similar volume of queries for "glioblastoma" and "meningioma." Google Trends is a useful source to elicit information about general trends in peoples' health interests and the role of different diseases across the world. The Internet presence of neurosurgical units and surgeons can be guided by online users' interests to achieve high-quality, professional-endorsed patient education. Copyright © 2016 Elsevier Inc. All rights reserved.

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks †

Science.gov (United States)

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-01-01

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor’s mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay. PMID:29077017

A fault-tolerant small world topology control model in ad hoc networks for search and rescue

Science.gov (United States)

Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

2018-02-01

Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

Plans, Patterns, and Move Categories Guiding a Highly Selective Search

Science.gov (United States)

Trippen, Gerhard

In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move generation to moves in certain move categories to reduce the number of moves considered by the bot significantly. Arimaa is a modern board game that can be played with a standard Chess set. However, the rules of the game are not at all like those of Chess. Furthermore, Arimaa was designed to be as simple and intuitive as possible for humans, yet challenging for computers. While all established Arimaa bots use alpha-beta search with a variety of pruning techniques and other heuristics ending in an extensive positional leaf node evaluation, our new bot, Rat, starts with a positional evaluation of the current position. Based on features found in the current position - supported by pattern matching using a directed position graph - our bot Rat decides which of a given set of plans to follow. The plan then dictates what types of moves can be chosen. This is another major difference from bots that generate "all" possible moves for a particular position. Rat is only allowed to generate moves that belong to certain categories. Leaf nodes are evaluated only by a straightforward material evaluation to help avoid moves that lose material. This highly selective search looks, on average, at only 5 moves out of 5,000 to over 40,000 possible moves in a middle game position.

Fiber Orientation Estimation Guided by a Deep Network.

Science.gov (United States)

Ye, Chuyang; Prince, Jerry L

2017-09-01

Diffusion magnetic resonance imaging (dMRI) is currently the only tool for noninvasively imaging the brain's white matter tracts. The fiber orientation (FO) is a key feature computed from dMRI for tract reconstruction. Because the number of FOs in a voxel is usually small, dictionary-based sparse reconstruction has been used to estimate FOs. However, accurate estimation of complex FO configurations in the presence of noise can still be challenging. In this work we explore the use of a deep network for FO estimation in a dictionary-based framework and propose an algorithm named Fiber Orientation Reconstruction guided by a Deep Network (FORDN). FORDN consists of two steps. First, we use a smaller dictionary encoding coarse basis FOs to represent diffusion signals. To estimate the mixture fractions of the dictionary atoms, a deep network is designed to solve the sparse reconstruction problem. Second, the coarse FOs inform the final FO estimation, where a larger dictionary encoding a dense basis of FOs is used and a weighted ℓ 1 -norm regularized least squares problem is solved to encourage FOs that are consistent with the network output. FORDN was evaluated and compared with state-of-the-art algorithms that estimate FOs using sparse reconstruction on simulated and typical clinical dMRI data. The results demonstrate the benefit of using a deep network for FO estimation.

Path searching in switching networks using cellular algorithm

Energy Technology Data Exchange (ETDEWEB)

Koczy, L T; Langer, J; Legendi, T

1981-01-01

After a survey of the important statements in the paper A Mathematical Model of Path Searching in General Type Switching Networks (see IBID., vol.25, no.1, p.31-43, 1981) the authors consider the possible implementation for cellular automata of the algorithm introduced there. The cellular field used consists of 5 neighbour 8 state cells. Running times required by a traditional serial processor and by the cellular field, respectively, are compared. By parallel processing this running time can be reduced. 5 references.

Virtual Network Embedding via Monte Carlo Tree Search.

Science.gov (United States)

Haeri, Soroush; Trajkovic, Ljiljana

2018-02-01

Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

Distinct Hippocampal versus Frontoparietal Network Contributions to Retrieval and Memory-guided Exploration.

Science.gov (United States)

Bridge, Donna J; Cohen, Neal J; Voss, Joel L

2017-08-01

Memory can profoundly influence new learning, presumably because memory optimizes exploration of to-be-learned material. Although hippocampus and frontoparietal networks have been implicated in memory-guided exploration, their specific and interactive roles have not been identified. We examined eye movements during fMRI scanning to identify neural correlates of the influences of memory retrieval on exploration and learning. After retrieval of one object in a multiobject array, viewing was strategically directed away from the retrieved object toward nonretrieved objects, such that exploration was directed toward to-be-learned content. Retrieved objects later served as optimal reminder cues, indicating that exploration caused memory to become structured around the retrieved content. Hippocampal activity was associated with memory retrieval, whereas frontoparietal activity varied with strategic viewing patterns deployed after retrieval, thus providing spatiotemporal dissociation of memory retrieval from memory-guided learning strategies. Time-lagged fMRI connectivity analyses indicated that hippocampal activity predicted frontoparietal activity to a greater extent for a condition in which retrieval guided exploration occurred than for a passive control condition in which exploration was not influenced by retrieval. This demonstrates network-level interaction effects specific to influences of memory on strategic exploration. These findings show how memory guides behavior during learning and demonstrate distinct yet interactive hippocampal-frontoparietal roles in implementing strategic exploration behaviors that determine the fate of evolving memory representations.

Distinct hippocampal versus frontoparietal-network contributions to retrieval and memory-guided exploration

Science.gov (United States)

Bridge, Donna J.; Cohen, Neal J.; Voss, Joel L.

2017-01-01

Memory can profoundly influence new learning, presumably because memory optimizes exploration of to-be-learned material. Although hippocampus and frontoparietal networks have been implicated in memory-guided exploration, their specific and interactive roles have not been identified. We examined eye movements during fMRI scanning to identify neural correlates of the influences of memory retrieval on exploration and learning. Following retrieval of one object in a multi-object array, viewing was strategically directed away from the retrieved object toward non-retrieved objects, such that exploration was directed towards to-be-learned content. Retrieved objects later served as optimal reminder cues, indicating that exploration caused memory to become structured around the retrieved content. Hippocampal activity was associated with memory retrieval whereas frontoparietal activity varied with strategic viewing patterns deployed following retrieval, thus providing spatiotemporal dissociation of memory retrieval from memory-guided learning strategies. Time-lagged fMRI connectivity analyses indicated that hippocampal activity predicted frontoparietal activity to a greater extent for a condition in which retrieval guided exploration than for a passive control condition in which exploration was not influenced by retrieval. This demonstrates network-level interaction effects specific to influences of memory on strategic exploration. These findings show how memory guides behavior during learning and demonstrate distinct yet interactive hippocampal-frontoparietal roles in implementing strategic exploration behaviors that determine the fate of evolving memory representations. PMID:28471729

Energy Efficient Wireless Vehicular-Guided Actuator Network

KAUST Repository

Boudellioua, Imene

2013-06-09

In this paper, we present an energy-efficient vehicular guided system for environmental disaster management using wireless sensor/actuator networks. Sensor nodes within clusters are controlled by a master node that is dynamically selected. Actuators support mobility for every sensor node in the area of interest. The system maintains energy efficiency using statistical, correlation, and confidence for determining actuator actions and implements an adaptive energy scheme to prolong the system lifespan. Experimental results show that the system is capable of saving up to 2.7Watt for every 28KByte of data exchanged. We also show that actuator actions are correct with a 90% confidence.

Planning chemical syntheses with deep neural networks and symbolic AI

Science.gov (United States)

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

2018-03-01

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

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network.

Science.gov (United States)

Wei, Zhengxian; Song, Min; Yin, Guisheng; Song, Houbing; Wang, Hongbin; Ma, Xuefei; Cheng, Albert M K

2017-10-17

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption.

System network planning expansion using mathematical programming, genetic algorithms and tabu search

International Nuclear Information System (INIS)

Sadegheih, A.; Drake, P.R.

2008-01-01

In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used

A Network-Aware Approach for Searching As-You-Type in Social Media

OpenAIRE

Lagrée , Paul; Cautis , Bogdan; Vahabi , Hossein

2015-01-01

International audience; We present in this paper a novel approach for as-you-type top-k keyword search over social media. We adopt a natural "network-aware" interpretation for information relevance, by which information produced by users who are closer to the seeker is considered more relevant. In practice, this query model poses new challenges for effectiveness and efficiency in online search, even when a complete query is given as input in one keystroke. This is mainly because it requires a...

Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements

DEFF Research Database (Denmark)

Pedersen, Michael Berliner; Crainic, T.G.; Madsen, Oli B.G.

2009-01-01

This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as "design-balance constraints" and focus on the design-balanced capacitated multicommodity network...... design model, a generalization of the capacitated multicommodity network design model generally used in service network design applications. Both arc-and cycle-based formulations for the new model are presented. The paper also proposes a tabu search metaheuristic framework for the arc-based formulation....... Results on a wide range of network design problem instances from the literature indicate the proposed method behaves very well in terms of computational efficiency and solution quality....

Optimization of distribution piping network in district cooling system using genetic algorithm with local search

International Nuclear Information System (INIS)

Chan, Apple L.S.; Hanby, Vic I.; Chow, T.T.

2007-01-01

A district cooling system is a sustainable means of distribution of cooling energy through mass production. A cooling medium like chilled water is generated at a central refrigeration plant and supplied to serve a group of consumer buildings through a piping network. Because of the substantial capital investment involved, an optimal design of the distribution piping configuration is one of the crucial factors for successful implementation of the district cooling scheme. In the present study, genetic algorithm (GA) incorporated with local search techniques was developed to find the optimal/near optimal configuration of the piping network in a hypothetical site. The effect of local search, mutation rate and frequency of local search on the performance of the GA in terms of both solution quality and computation time were investigated and presented in this paper

Efficient and accurate Greedy Search Methods for mining functional modules in protein interaction networks.

Science.gov (United States)

He, Jieyue; Li, Chaojun; Ye, Baoliu; Zhong, Wei

2012-06-25

Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computationally expensive. However, recent analysis indicates that experimentally detected protein complexes generally contain Core/attachment structures. In this paper, a Greedy Search Method based on Core-Attachment structure (GSM-CA) is proposed. The GSM-CA method detects densely connected regions in large protein-protein interaction networks based on the edge weight and two criteria for determining core nodes and attachment nodes. The GSM-CA method improves the prediction accuracy compared to other similar module detection approaches, however it is computationally expensive. Many module detection approaches are based on the traditional hierarchical methods, which is also computationally inefficient because the hierarchical tree structure produced by these approaches cannot provide adequate information to identify whether a network belongs to a module structure or not. In order to speed up the computational process, the Greedy Search Method based on Fast Clustering (GSM-FC) is proposed in this work. The edge weight based GSM-FC method uses a greedy procedure to traverse all edges just once to separate the network into the suitable set of modules. The proposed methods are applied to the protein interaction network of S. cerevisiae. Experimental results indicate that many significant functional modules are detected, most of which match the known complexes. Results also demonstrate that the GSM-FC algorithm is faster and more accurate as compared to other competing algorithms. Based on the new edge weight definition, the proposed algorithm takes advantages of the greedy search procedure to separate the network into the suitable set of modules. Experimental analysis shows that the identified modules are statistically significant. The algorithm can reduce the

Network module detection: Affinity search technique with the multi-node topological overlap measure.

Science.gov (United States)

Li, Ai; Horvath, Steve

2009-07-20

Many clustering procedures only allow the user to input a pairwise dissimilarity or distance measure between objects. We propose a clustering method that can input a multi-point dissimilarity measure d(i1, i2, ..., iP) where the number of points P can be larger than 2. The work is motivated by gene network analysis where clusters correspond to modules of highly interconnected nodes. Here, we define modules as clusters of network nodes with high multi-node topological overlap. The topological overlap measure is a robust measure of interconnectedness which is based on shared network neighbors. In previous work, we have shown that the multi-node topological overlap measure yields biologically meaningful results when used as input of network neighborhood analysis. We adapt network neighborhood analysis for the use of module detection. We propose the Module Affinity Search Technique (MAST), which is a generalized version of the Cluster Affinity Search Technique (CAST). MAST can accommodate a multi-node dissimilarity measure. Clusters grow around user-defined or automatically chosen seeds (e.g. hub nodes). We propose both local and global cluster growth stopping rules. We use several simulations and a gene co-expression network application to argue that the MAST approach leads to biologically meaningful results. We compare MAST with hierarchical clustering and partitioning around medoid clustering. Our flexible module detection method is implemented in the MTOM software which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/MTOM/

Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning

Directory of Open Access Journals (Sweden)

Guangyi Liu

2014-01-01

Full Text Available Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues. Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper. We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network. Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.

Google Pocket Guide

CERN Document Server

Calishain, Tara; Adams, DJ

2003-01-01

Beneath its deceptively simple search form, Google is a remarkably powerful and flexible search engine that indexes billions of web pages, handling more than 150 million searches a day. You know that what you're looking for must be in there somewhere, but how do you make Google work for you? Crafted from our best-selling Google Hacks title, the Google Pocket Guide provides exactly the information you need to make your searches faster and more effective, right from the start. The Google Pocket Guide unleashes the power behind that blinking cursor by delivering: A thorough but concise tour o

Real-Time Search in Clouds

OpenAIRE

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

Metagenomic Taxonomy-Guided Database-Searching Strategy for Improving Metaproteomic Analysis.

Science.gov (United States)

Xiao, Jinqiu; Tanca, Alessandro; Jia, Ben; Yang, Runqing; Wang, Bo; Zhang, Yu; Li, Jing

2018-04-06

Metaproteomics provides a direct measure of the functional information by investigating all proteins expressed by a microbiota. However, due to the complexity and heterogeneity of microbial communities, it is very hard to construct a sequence database suitable for a metaproteomic study. Using a public database, researchers might not be able to identify proteins from poorly characterized microbial species, while a sequencing-based metagenomic database may not provide adequate coverage for all potentially expressed protein sequences. To address this challenge, we propose a metagenomic taxonomy-guided database-search strategy (MT), in which a merged database is employed, consisting of both taxonomy-guided reference protein sequences from public databases and proteins from metagenome assembly. By applying our MT strategy to a mock microbial mixture, about two times as many peptides were detected as with the metagenomic database only. According to the evaluation of the reliability of taxonomic attribution, the rate of misassignments was comparable to that obtained using an a priori matched database. We also evaluated the MT strategy with a human gut microbial sample, and we found 1.7 times as many peptides as using a standard metagenomic database. In conclusion, our MT strategy allows the construction of databases able to provide high sensitivity and precision in peptide identification in metaproteomic studies, enabling the detection of proteins from poorly characterized species within the microbiota.

Convergent transmission of RNAi guide-target mismatch information across Argonaute internal allosteric network.

Science.gov (United States)

Joseph, Thomas T; Osman, Roman

2012-01-01

In RNA interference, a guide strand derived from a short dsRNA such as a microRNA (miRNA) is loaded into Argonaute, the central protein in the RNA Induced Silencing Complex (RISC) that silences messenger RNAs on a sequence-specific basis. The positions of any mismatched base pairs in an miRNA determine which Argonaute subtype is used. Subsequently, the Argonaute-guide complex binds and silences complementary target mRNAs; certain Argonautes cleave the target. Mismatches between guide strand and the target mRNA decrease cleavage efficiency. Thus, loading and silencing both require that signals about the presence of a mismatched base pair are communicated from the mismatch site to effector sites. These effector sites include the active site, to prevent target cleavage; the binding groove, to modify nucleic acid binding affinity; and surface allosteric sites, to control recruitment of additional proteins to form the RISC. To examine how such signals may be propagated, we analyzed the network of internal allosteric pathways in Argonaute exhibited through correlations of residue-residue interactions. The emerging network can be described as a set of pathways emanating from the core of the protein near the active site, distributed into the bulk of the protein, and converging upon a distributed cluster of surface residues. Nucleotides in the guide strand "seed region" have a stronger relationship with the protein than other nucleotides, concordant with their importance in sequence selectivity. Finally, any of several seed region guide-target mismatches cause certain Argonaute residues to have modified correlations with the rest of the protein. This arises from the aggregation of relatively small interaction correlation changes distributed across a large subset of residues. These residues are in effector sites: the active site, binding groove, and surface, implying that direct functional consequences of guide-target mismatches are mediated through the cumulative effects of

Mastering Search Analytics Measuring SEO, SEM and Site Search

CERN Document Server

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

Hybrid fuzzy charged system search algorithm based state estimation in distribution networks

Directory of Open Access Journals (Sweden)

Sachidananda Prasad

2017-06-01

Full Text Available This paper proposes a new hybrid charged system search (CSS algorithm based state estimation in radial distribution networks in fuzzy framework. The objective of the optimization problem is to minimize the weighted square of the difference between the measured and the estimated quantity. The proposed method of state estimation considers bus voltage magnitude and phase angle as state variable along with some equality and inequality constraints for state estimation in distribution networks. A rule based fuzzy inference system has been designed to control the parameters of the CSS algorithm to achieve better balance between the exploration and exploitation capability of the algorithm. The efficiency of the proposed fuzzy adaptive charged system search (FACSS algorithm has been tested on standard IEEE 33-bus system and Indian 85-bus practical radial distribution system. The obtained results have been compared with the conventional CSS algorithm, weighted least square (WLS algorithm and particle swarm optimization (PSO for feasibility of the algorithm.

Search Patterns

CERN Document Server

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

A flow-first route-next heuristic for liner shipping network design

DEFF Research Database (Denmark)

Krogsgaard, Alexander; Pisinger, David; Thorsen, Jesper

2018-01-01

Having a well-designed liner shipping network is paramount to ensure competitive freight rates, adequate capacity on trade-lanes, and reasonable transportation times.The most successful algorithms for liner shipping network design make use of a two-phase approach, where they first design the routes...... different operators are used to modify the network. Since each iteration of the local search method involves solving a very complex multi-commodity flow problem to route the containers through the network, the flow problem is solved heuristically by use of a fast Lagrange heuristic. Although the Lagrange...... heuristic for flowing containers is 2–5% from the optimal solution, the solution quality is sufficiently good to guide the variable neighborhood search method in designing the network. Computational results are reported, showing that the developed heuristic is able to find improved solutions for large...

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

Science.gov (United States)

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

2015-10-01

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

Application of artificial neural network to search for gravitational-wave signals associated with short gamma-ray bursts

International Nuclear Information System (INIS)

Kim, Kyungmin; Lee, Hyun Kyu; Harry, Ian W; Hodge, Kari A; Kim, Young-Min; Lee, Chang-Hwan; Oh, John J; Oh, Sang Hoon; Son, Edwin J

2015-01-01

We apply a machine learning algorithm, the artificial neural network, to the search for gravitational-wave signals associated with short gamma-ray bursts (GRBs). The multi-dimensional samples consisting of data corresponding to the statistical and physical quantities from the coherent search pipeline are fed into the artificial neural network to distinguish simulated gravitational-wave signals from background noise artifacts. Our result shows that the data classification efficiency at a fixed false alarm probability (FAP) is improved by the artificial neural network in comparison to the conventional detection statistic. Specifically, the distance at 50% detection probability at a fixed false positive rate is increased about 8%–14% for the considered waveform models. We also evaluate a few seconds of the gravitational-wave data segment using the trained networks and obtain the FAP. We suggest that the artificial neural network can be a complementary method to the conventional detection statistic for identifying gravitational-wave signals related to the short GRBs. (paper)

Planning Optimization of the Distributed Antenna System in High-Speed Railway Communication Network Based on Improved Cuckoo Search

Directory of Open Access Journals (Sweden)

Zhaoyu Chen

2018-01-01

Full Text Available The network planning is a key factor that directly affects the performance of the wireless networks. Distributed antenna system (DAS is an effective strategy for the network planning. This paper investigates the antenna deployment in a DAS for the high-speed railway communication networks and formulates an optimization problem which is NP-hard for achieving the optimal deployment of the antennas in the DAS. To solve this problem, a scheme based on an improved cuckoo search based on dimension cells (ICSDC algorithm is proposed. ICSDC introduces the dimension cell mechanism to avoid the internal dimension interferences in order to improve the performance of the algorithm. Simulation results show that the proposed ICSDC-based scheme obtains a lower network cost compared with the uniform network planning method. Moreover, ICSDC algorithm has better performance in terms of the convergence rate and accuracy compared with the conventional cuckoo search algorithm, the particle swarm optimization, and the firefly algorithm.

Search of associative memory.

NARCIS (Netherlands)

Raaijmakers, J.G.W.; Shiffrin, R.M.

1981-01-01

Describes search of associative memory (SAM), a general theory of retrieval from long-term memory that combines features of associative network models and random search models. It posits cue-dependent probabilistic sampling and recovery from an associative network, but the network is specified as a

Towards Assisted Moderation in Online Healthcare Social Networks: Improving Trust in YouTube Searches.

Science.gov (United States)

Cañon, Daniel E; Lopez, Diego M; Blobel, Bernd

2014-01-01

Moderation of content in online Health Social Networks (HSN) is critical because information is not only published and produced by experts or health professionals, but also by users of that information. The objective of this paper is to propose a semi-automatic moderation Web Service for assessing the quality (trustworthiness) of health-related videos published on the YouTube social network. The service is relevant for moderators or community managers, who get enabled to control the quality of videos published on their online HSN sites. The HealthTrust metric was selected as the metric to be implemented in the service in order to support the assessment of trustworthiness of videos in Online HSN. The service is a RESTful service which can be integrated into open source Virtual Social Network Platforms, therefore improving trust in the process of searching and publishing content extracted from YouTube. A preliminary pilot evaluation in a simple use case demonstrated that the relevance of videos retrieved using the moderation service was higher compared to the relevance of the videos retrieved using the YouTube search engine.

Presidential Search: An Overview for Board Members

Science.gov (United States)

Association of Governing Boards of Universities and Colleges, 2012

2012-01-01

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

Convergent transmission of RNAi guide-target mismatch information across Argonaute internal allosteric network.

Directory of Open Access Journals (Sweden)

Thomas T Joseph

Full Text Available In RNA interference, a guide strand derived from a short dsRNA such as a microRNA (miRNA is loaded into Argonaute, the central protein in the RNA Induced Silencing Complex (RISC that silences messenger RNAs on a sequence-specific basis. The positions of any mismatched base pairs in an miRNA determine which Argonaute subtype is used. Subsequently, the Argonaute-guide complex binds and silences complementary target mRNAs; certain Argonautes cleave the target. Mismatches between guide strand and the target mRNA decrease cleavage efficiency. Thus, loading and silencing both require that signals about the presence of a mismatched base pair are communicated from the mismatch site to effector sites. These effector sites include the active site, to prevent target cleavage; the binding groove, to modify nucleic acid binding affinity; and surface allosteric sites, to control recruitment of additional proteins to form the RISC. To examine how such signals may be propagated, we analyzed the network of internal allosteric pathways in Argonaute exhibited through correlations of residue-residue interactions. The emerging network can be described as a set of pathways emanating from the core of the protein near the active site, distributed into the bulk of the protein, and converging upon a distributed cluster of surface residues. Nucleotides in the guide strand "seed region" have a stronger relationship with the protein than other nucleotides, concordant with their importance in sequence selectivity. Finally, any of several seed region guide-target mismatches cause certain Argonaute residues to have modified correlations with the rest of the protein. This arises from the aggregation of relatively small interaction correlation changes distributed across a large subset of residues. These residues are in effector sites: the active site, binding groove, and surface, implying that direct functional consequences of guide-target mismatches are mediated through the

Dynamic spatial coding within the dorsal frontoparietal network during a visual search task.

Directory of Open Access Journals (Sweden)

Wieland H Sommer

Full Text Available To what extent are the left and right visual hemifields spatially coded in the dorsal frontoparietal attention network? In many experiments with neglect patients, the left hemisphere shows a contralateral hemifield preference, whereas the right hemisphere represents both hemifields. This pattern of spatial coding is often used to explain the right-hemispheric dominance of lesions causing hemispatial neglect. However, pathophysiological mechanisms of hemispatial neglect are controversial because recent experiments on healthy subjects produced conflicting results regarding the spatial coding of visual hemifields. We used an fMRI paradigm that allowed us to distinguish two attentional subprocesses during a visual search task. Either within the left or right hemifield subjects first attended to stationary locations (spatial orienting and then shifted their attentional focus to search for a target line. Dynamic changes in spatial coding of the left and right hemifields were observed within subregions of the dorsal front-parietal network: During stationary spatial orienting, we found the well-known spatial pattern described above, with a bilateral hemifield representation in the right hemisphere and a contralateral preference in the left hemisphere. However, during search, the right hemisphere had a contralateral preference and the left hemisphere equally represented both hemifields. This finding leads to novel perspectives regarding models of visuospatial attention and hemispatial neglect.

Module discovery by exhaustive search for densely connected, co-expressed regions in biomolecular interaction networks.

Directory of Open Access Journals (Sweden)

Recep Colak

2010-10-01

Full Text Available Computational prediction of functionally related groups of genes (functional modules from large-scale data is an important issue in computational biology. Gene expression experiments and interaction networks are well studied large-scale data sources, available for many not yet exhaustively annotated organisms. It has been well established, when analyzing these two data sources jointly, modules are often reflected by highly interconnected (dense regions in the interaction networks whose participating genes are co-expressed. However, the tractability of the problem had remained unclear and methods by which to exhaustively search for such constellations had not been presented.We provide an algorithmic framework, referred to as Densely Connected Biclustering (DECOB, by which the aforementioned search problem becomes tractable. To benchmark the predictive power inherent to the approach, we computed all co-expressed, dense regions in physical protein and genetic interaction networks from human and yeast. An automatized filtering procedure reduces our output which results in smaller collections of modules, comparable to state-of-the-art approaches. Our results performed favorably in a fair benchmarking competition which adheres to standard criteria. We demonstrate the usefulness of an exhaustive module search, by using the unreduced output to more quickly perform GO term related function prediction tasks. We point out the advantages of our exhaustive output by predicting functional relationships using two examples.We demonstrate that the computation of all densely connected and co-expressed regions in interaction networks is an approach to module discovery of considerable value. Beyond confirming the well settled hypothesis that such co-expressed, densely connected interaction network regions reflect functional modules, we open up novel computational ways to comprehensively analyze the modular organization of an organism based on prevalent and largely

Module discovery by exhaustive search for densely connected, co-expressed regions in biomolecular interaction networks.

Science.gov (United States)

Colak, Recep; Moser, Flavia; Chu, Jeffrey Shih-Chieh; Schönhuth, Alexander; Chen, Nansheng; Ester, Martin

2010-10-25

Computational prediction of functionally related groups of genes (functional modules) from large-scale data is an important issue in computational biology. Gene expression experiments and interaction networks are well studied large-scale data sources, available for many not yet exhaustively annotated organisms. It has been well established, when analyzing these two data sources jointly, modules are often reflected by highly interconnected (dense) regions in the interaction networks whose participating genes are co-expressed. However, the tractability of the problem had remained unclear and methods by which to exhaustively search for such constellations had not been presented. We provide an algorithmic framework, referred to as Densely Connected Biclustering (DECOB), by which the aforementioned search problem becomes tractable. To benchmark the predictive power inherent to the approach, we computed all co-expressed, dense regions in physical protein and genetic interaction networks from human and yeast. An automatized filtering procedure reduces our output which results in smaller collections of modules, comparable to state-of-the-art approaches. Our results performed favorably in a fair benchmarking competition which adheres to standard criteria. We demonstrate the usefulness of an exhaustive module search, by using the unreduced output to more quickly perform GO term related function prediction tasks. We point out the advantages of our exhaustive output by predicting functional relationships using two examples. We demonstrate that the computation of all densely connected and co-expressed regions in interaction networks is an approach to module discovery of considerable value. Beyond confirming the well settled hypothesis that such co-expressed, densely connected interaction network regions reflect functional modules, we open up novel computational ways to comprehensively analyze the modular organization of an organism based on prevalent and largely available large

A Tourism e-Guide System Using Mobile Integration

Directory of Open Access Journals (Sweden)

Emad M. Abuelrub

2010-04-01

Full Text Available This paper presents a tourism e-guide system via mobile integration using offloading while enjoying mobility. A user can search for new mobile services available on the website to use either remotely on the server where the services resides, or locally after downloading them to his/her mobile device and work offline without a mobile connection. Jordan Tourism e-Guide System (JTeGS aims to help the user/tourist accessing the tourism information directly from his/her smart device, anytime and anywhere using offloading. JTeGS is a web-based electronic guide that provides the user with appropriate tourism information about Jordan and guides him/her to find the best places to party, eat out, and enjoy culture events. The system architecture and the main components of the proposed services were presented and discussed. The system has been prototyped and validated in a real-time mobile internet application scenario. The system also has been evaluated through simulations in mobile network environment. Both experimental and simulation results demonstrated the effectiveness and efficiency of the proposed system.

A Network-Aware Approach for Searching As-You-Type in Social Media (Extended Version)

OpenAIRE

Lagrée, Paul; Cautis, Bogdan; Vahabi, Hossein

2015-01-01

We present in this paper a novel approach for as-you-type top-$k$ keyword search over social media. We adopt a natural "network-aware" interpretation for information relevance, by which information produced by users who are closer to the seeker is considered more relevant. In practice, this query model poses new challenges for effectiveness and efficiency in online search, even when a complete query is given as input in one keystroke. This is mainly because it requires a joint exploration of ...

Guided Text Search Using Adaptive Visual Analytics

Energy Technology Data Exchange (ETDEWEB)

Steed, Chad A [ORNL; Symons, Christopher T [ORNL; Senter, James K [ORNL; DeNap, Frank A [ORNL

2012-10-01

This research demonstrates the promise of augmenting interactive visualizations with semi- supervised machine learning techniques to improve the discovery of significant associations and insights in the search and analysis of textual information. More specifically, we have developed a system called Gryffin that hosts a unique collection of techniques that facilitate individualized investigative search pertaining to an ever-changing set of analytical questions over an indexed collection of open-source documents related to critical national infrastructure. The Gryffin client hosts dynamic displays of the search results via focus+context record listings, temporal timelines, term-frequency views, and multiple coordinate views. Furthermore, as the analyst interacts with the display, the interactions are recorded and used to label the search records. These labeled records are then used to drive semi-supervised machine learning algorithms that re-rank the unlabeled search records such that potentially relevant records are moved to the top of the record listing. Gryffin is described in the context of the daily tasks encountered at the US Department of Homeland Security s Fusion Center, with whom we are collaborating in its development. The resulting system is capable of addressing the analysts information overload that can be directly attributed to the deluge of information that must be addressed in the search and investigative analysis of textual information.

Multi-dimensional design window search system using neural networks in reactor core design

International Nuclear Information System (INIS)

Kugo, Teruhiko; Nakagawa, Masayuki

2000-02-01

In the reactor core design, many parametric survey calculations should be carried out to decide an optimal set of basic design parameter values. They consume a large amount of computation time and labor in the conventional way. To support directly design work, we investigate a procedure to search efficiently a design window, which is defined as feasible design parameter ranges satisfying design criteria and requirements, in a multi-dimensional space composed of several basic design parameters. We apply the present method to the neutronics and thermal hydraulics fields and develop the multi-dimensional design window search system using it. The principle of the present method is to construct the multilayer neural network to simulate quickly a response of an analysis code through a training process, and to reduce computation time using the neural network without parametric study using analysis codes. The system works on an engineering workstation (EWS) with efficient man-machine interface for pre- and post-processing. This report describes the principle of the present method, the structure of the system, the guidance of the usages of the system, the guideline for the efficient training of neural networks, the instructions of the input data for analysis calculation and so on. (author)

Optimization of the graph model of the water conduit network, based on the approach of search space reducing

Science.gov (United States)

Korovin, Iakov S.; Tkachenko, Maxim G.

2018-03-01

In this paper we present a heuristic approach, improving the efficiency of methods, used for creation of efficient architecture of water distribution networks. The essence of the approach is a procedure of search space reduction the by limiting the range of available pipe diameters that can be used for each edge of the network graph. In order to proceed the reduction, two opposite boundary scenarios for the distribution of flows are analysed, after which the resulting range is further narrowed by applying a flow rate limitation for each edge of the network. The first boundary scenario provides the most uniform distribution of the flow in the network, the opposite scenario created the net with the highest possible flow level. The parameters of both distributions are calculated by optimizing systems of quadratic functions in a confined space, which can be effectively performed with small time costs. This approach was used to modify the genetic algorithm (GA). The proposed GA provides a variable number of variants of each gene, according to the number of diameters in list, taking into account flow restrictions. The proposed approach was implemented to the evaluation of a well-known test network - the Hanoi water distribution network [1], the results of research were compared with a classical GA with an unlimited search space. On the test data, the proposed trip significantly reduced the search space and provided faster and more obvious convergence in comparison with the classical version of GA.

Multiobjective Optimization of Water Distribution Networks Using Fuzzy Theory and Harmony Search

Directory of Open Access Journals (Sweden)

Zong Woo Geem

2015-07-01

Full Text Available Thus far, various phenomenon-mimicking algorithms, such as genetic algorithm, simulated annealing, tabu search, shuffled frog-leaping, ant colony optimization, harmony search, cross entropy, scatter search, and honey-bee mating, have been proposed to optimally design the water distribution networks with respect to design cost. However, flow velocity constraint, which is critical for structural robustness against water hammer or flow circulation against substance sedimentation, was seldom considered in the optimization formulation because of computational complexity. Thus, this study proposes a novel fuzzy-based velocity reliability index, which is to be maximized while the design cost is simultaneously minimized. The velocity reliability index is included in the existing cost optimization formulation and this extended multiobjective formulation is applied to two bench-mark problems. Results show that the model successfully found a Pareto set of multiobjective design solutions in terms of cost minimization and reliability maximization.

CCNA Wireless Study Guide

CERN Document Server

Lammle, Todd

2010-01-01

A complete guide to the CCNA Wireless exam by leading networking authority Todd Lammle. The CCNA Wireless certification is the most respected entry-level certification in this rapidly growing field. Todd Lammle is the undisputed authority on networking, and this book focuses exclusively on the skills covered in this Cisco certification exam. The CCNA Wireless Study Guide joins the popular Sybex study guide family and helps network administrators advance their careers with a highly desirable certification.: The CCNA Wireless certification is the most respected entry-level wireless certification

Evolution of an artificial neural network based autonomous land vehicle controller.

Science.gov (United States)

Baluja, S

1996-01-01

This paper presents an evolutionary method for creating an artificial neural network based autonomous land vehicle controller. The evolved controllers perform better in unseen situations than those trained with an error backpropagation learning algorithm designed for this task. In this paper, an overview of the previous connectionist based approaches to this task is given, and the evolutionary algorithms used in this study are described in detail. Methods for reducing the high computational costs of training artificial neural networks with evolutionary algorithms are explored. Error metrics specific to the task of autonomous vehicle control are introduced; the evolutionary algorithms guided by these error metrics reveal improved performance over those guided by the standard sum-squared error metric. Finally, techniques for integrating evolutionary search and error backpropagation are presented. The evolved networks are designed to control Carnegie Mellon University's NAVLAB vehicles in road following tasks.

Urban networks among Chinese cities along "the Belt and Road": A case of web search activity in cyberspace.

Science.gov (United States)

Zhang, Lu; Du, Hongru; Zhao, Yannan; Wu, Rongwei; Zhang, Xiaolei

2017-01-01

"The Belt and Road" initiative has been expected to facilitate interactions among numerous city centers. This initiative would generate a number of centers, both economic and political, which would facilitate greater interaction. To explore how information flows are merged and the specific opportunities that may be offered, Chinese cities along "the Belt and Road" are selected for a case study. Furthermore, urban networks in cyberspace have been characterized by their infrastructure orientation, which implies that there is a relative dearth of studies focusing on the investigation of urban hierarchies by capturing information flows between Chinese cities along "the Belt and Road". This paper employs Baidu, the main web search engine in China, to examine urban hierarchies. The results show that urban networks become more balanced, shifting from a polycentric to a homogenized pattern. Furthermore, cities in networks tend to have both a hierarchical system and a spatial concentration primarily in regions such as Beijing-Tianjin-Hebei, Yangtze River Delta and the Pearl River Delta region. Urban hierarchy based on web search activity does not follow the existing hierarchical system based on geospatial and economic development in all cases. Moreover, urban networks, under the framework of "the Belt and Road", show several significant corridors and more opportunities for more cities, particularly western cities. Furthermore, factors that may influence web search activity are explored. The results show that web search activity is significantly influenced by the economic gap, geographical proximity and administrative rank of the city.

Urban networks among Chinese cities along "the Belt and Road": A case of web search activity in cyberspace.

Directory of Open Access Journals (Sweden)

Lu Zhang

Full Text Available "The Belt and Road" initiative has been expected to facilitate interactions among numerous city centers. This initiative would generate a number of centers, both economic and political, which would facilitate greater interaction. To explore how information flows are merged and the specific opportunities that may be offered, Chinese cities along "the Belt and Road" are selected for a case study. Furthermore, urban networks in cyberspace have been characterized by their infrastructure orientation, which implies that there is a relative dearth of studies focusing on the investigation of urban hierarchies by capturing information flows between Chinese cities along "the Belt and Road". This paper employs Baidu, the main web search engine in China, to examine urban hierarchies. The results show that urban networks become more balanced, shifting from a polycentric to a homogenized pattern. Furthermore, cities in networks tend to have both a hierarchical system and a spatial concentration primarily in regions such as Beijing-Tianjin-Hebei, Yangtze River Delta and the Pearl River Delta region. Urban hierarchy based on web search activity does not follow the existing hierarchical system based on geospatial and economic development in all cases. Moreover, urban networks, under the framework of "the Belt and Road", show several significant corridors and more opportunities for more cities, particularly western cities. Furthermore, factors that may influence web search activity are explored. The results show that web search activity is significantly influenced by the economic gap, geographical proximity and administrative rank of the city.

Search for all MCs in networks with unreliable nodes and arcs

International Nuclear Information System (INIS)

Yeh, W.-C.

2003-01-01

A simple method is proposed to search for all minimal cutsets (MCs ) for imperfect networks reliability subject to both arc and node failures under the condition that all of the MCs in the network with perfect nodes are given in advance. The proposed method does not require re-enumeration for all of the MCs for additional node failure consideration. All of the MC candidates found in the proposed algorithm are actual MCs without any need for further verification. This algorithm is more effective than the existing algorithm in which every MC candidate is not verified as a MC. No identical MCs are found using the proposed algorithm, which does not duplicate MCs and is more efficient than the existing methods. Only simple concepts are used to implement the proposed algorithm, which makes it easier to understand and implement. With considering unreliable nodes, the proposed method is also more realistic and valuable for reliability analysis in an existing network. The correctness of the proposed algorithm will be analyzed and proven. One example is used to illustrate how all MCs are generated in a network with arc and node failures solved using the proposed algorithm

An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network.

Science.gov (United States)

Cheng, Jing; Xia, Linyuan

2016-08-31

Localization is an essential requirement in the increasing prevalence of wireless sensor network (WSN) applications. Reducing the computational complexity, communication overhead in WSN localization is of paramount importance in order to prolong the lifetime of the energy-limited sensor nodes and improve localization performance. This paper proposes an effective Cuckoo Search (CS) algorithm for node localization. Based on the modification of step size, this approach enables the population to approach global optimal solution rapidly, and the fitness of each solution is employed to build mutation probability for avoiding local convergence. Further, the approach restricts the population in the certain range so that it can prevent the energy consumption caused by insignificant search. Extensive experiments were conducted to study the effects of parameters like anchor density, node density and communication range on the proposed algorithm with respect to average localization error and localization success ratio. In addition, a comparative study was conducted to realize the same localization task using the same network deployment. Experimental results prove that the proposed CS algorithm can not only increase convergence rate but also reduce average localization error compared with standard CS algorithm and Particle Swarm Optimization (PSO) algorithm.

Locating Direction Finders in a Generalized Search and Rescue Network

Science.gov (United States)

1991-03-01

David A . Drake and Alfred B. Marsb. Conv-ersation at NationalI Security Agenc, 29 September 1990. 7. Daskin , Mark S. " A M-admum Fpeced Co-:efing...91 7 19 134 .flT/GORjEnSj9I-M LOCATING DIRECTION FIND’RS IN A GENERALIZED SEARCH AND RESCUE NETWORK THESIS Jean M. Steppe Captain, USAF AFIT/GOR/EN S...91-Mk-7 APPROVED FOR PUBLIC RELI ASE: DISTRIBUTION UNLIMITED. 1191-05734 .. 91.. .7 19 134 i i . nMIGOR4M.S/91-MI LOCATING DIRECTION FINDERS IW A

Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.

Science.gov (United States)

Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal

2016-03-01

Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.

Application of neural network to multi-dimensional design window search

International Nuclear Information System (INIS)

Kugo, T.; Nakagawa, M.

1996-01-01

In the reactor core design, many parametric survey calculations should be carried out to decide an optimal set of basic design parameter values. They consume a large amount of computation time and labor in the conventional way. To support directly such a work, we investigate a procedure to search efficiently a design window, which is defined as feasible design parameter ranges satisfying design criteria and requirements, in a multi-dimensional space composed of several basic design parameters. A principle of the present method is to construct the multilayer neural network to simulate quickly a response of an analysis code through a training process, and to reduce computation time using the neural network as a substitute of an analysis code. We apply the present method to a fuel pin design of high conversion light water reactors for the neutronics and thermal hydraulics fields to demonstrate performances of the method. (author)

User-assisted visual search and tracking across distributed multi-camera networks

Science.gov (United States)

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.

Decentralized cooperative unmanned aerial vehicles conflict resolution by neural network-based tree search method

Directory of Open Access Journals (Sweden)

Jian Yang

2016-09-01

Full Text Available In this article, a tree search algorithm is proposed to find the near optimal conflict avoidance solutions for unmanned aerial vehicles. In the dynamic environment, the unmodeled elements, such as wind, would make UAVs deviate from nominal traces. It brings about difficulties for conflict detection and resolution. The back propagation neural networks are utilized to approximate the unmodeled dynamics of the environment. To satisfy the online planning requirement, the search length of the tree search algorithm would be limited. Therefore, the algorithm may not be able to reach the goal states in search process. The midterm reward function for assessing each node is devised, with consideration given to two factors, namely, the safe separation requirement and the mission of each unmanned aerial vehicle. The simulation examples and the comparisons with previous approaches are provided to illustrate the smooth and convincing behaviours of the proposed algorithm.

Network meta-analyses could be improved by searching more sources and by involving a librarian.

Science.gov (United States)

Li, Lun; Tian, Jinhui; Tian, Hongliang; Moher, David; Liang, Fuxiang; Jiang, Tongxiao; Yao, Liang; Yang, Kehu

2014-09-01

Network meta-analyses (NMAs) aim to rank the benefits (or harms) of interventions, based on all available randomized controlled trials. Thus, the identification of relevant data is critical. We assessed the conduct of the literature searches in NMAs. Published NMAs were retrieved by searching electronic bibliographic databases and other sources. Two independent reviewers selected studies and five trained reviewers abstracted data regarding literature searches, in duplicate. Search method details were examined using descriptive statistics. Two hundred forty-nine NMAs were included. Eight used previous systematic reviews to identify primary studies without further searching, and five did not report any literature searches. In the 236 studies that used electronic databases to identify primary studies, the median number of databases was 3 (interquartile range: 3-5). MEDLINE, EMBASE, and Cochrane Central Register of Controlled Trials were the most commonly used databases. The most common supplemental search methods included reference lists of included studies (48%), reference lists of previous systematic reviews (40%), and clinical trial registries (32%). None of these supplemental methods was conducted in more than 50% of the NMAs. Literature searches in NMAs could be improved by searching more sources, and by involving a librarian or information specialist. Copyright © 2014 Elsevier Inc. All rights reserved.

A HYBRID HOPFIELD NEURAL NETWORK AND TABU SEARCH ALGORITHM TO SOLVE ROUTING PROBLEM IN COMMUNICATION NETWORK

Directory of Open Access Journals (Sweden)

MANAR Y. KASHMOLA

2012-06-01

Full Text Available The development of hybrid algorithms for solving complex optimization problems focuses on enhancing the strengths and compensating for the weakness of two or more complementary approaches. The goal is to intelligently combine the key elements of these approaches to find superior solutions to solve optimization problems. Optimal routing in communication network is considering a complex optimization problem. In this paper we propose a hybrid Hopfield Neural Network (HNN and Tabu Search (TS algorithm, this algorithm called hybrid HNN-TS algorithm. The paradigm of this hybridization is embedded. We embed the short-term memory and tabu restriction features from TS algorithm in the HNN model. The short-term memory and tabu restriction control the neuron selection process in the HNN model in order to get around the local minima problem and find an optimal solution using the HNN model to solve complex optimization problem. The proposed algorithm is intended to find the optimal path for packet transmission in the network which is fills in the field of routing problem. The optimal path that will be selected is depending on 4-tuples (delay, cost, reliability and capacity. Test results show that the propose algorithm can find path with optimal cost and a reasonable number of iterations. It also shows that the complexity of the network model won’t be a problem since the neuron selection is done heuristically.

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

Science.gov (United States)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Inferring Gene Regulatory Networks Using Conditional Regulation Pattern to Guide Candidate Genes.

Directory of Open Access Journals (Sweden)

Fei Xiao

Full Text Available Combining path consistency (PC algorithms with conditional mutual information (CMI are widely used in reconstruction of gene regulatory networks. CMI has many advantages over Pearson correlation coefficient in measuring non-linear dependence to infer gene regulatory networks. It can also discriminate the direct regulations from indirect ones. However, it is still a challenge to select the conditional genes in an optimal way, which affects the performance and computation complexity of the PC algorithm. In this study, we develop a novel conditional mutual information-based algorithm, namely RPNI (Regulation Pattern based Network Inference, to infer gene regulatory networks. For conditional gene selection, we define the co-regulation pattern, indirect-regulation pattern and mixture-regulation pattern as three candidate patterns to guide the selection of candidate genes. To demonstrate the potential of our algorithm, we apply it to gene expression data from DREAM challenge. Experimental results show that RPNI outperforms existing conditional mutual information-based methods in both accuracy and time complexity for different sizes of gene samples. Furthermore, the robustness of our algorithm is demonstrated by noisy interference analysis using different types of noise.

MyPlate Food Guide

Science.gov (United States)

... Safe Videos for Educators Search English Español MyPlate Food Guide KidsHealth / For Teens / MyPlate Food Guide What's ... and other sugary drinks. Avoid large portions . Five Food Groups Different food groups have different nutrients and ...

Optimization of Network Topology in Computer-Aided Detection Schemes Using Phased Searching with NEAT in a Time-Scaled Framework.

Science.gov (United States)

Tan, Maxine; Pu, Jiantao; Zheng, Bin

2014-01-01

In the field of computer-aided mammographic mass detection, many different features and classifiers have been tested. Frequently, the relevant features and optimal topology for the artificial neural network (ANN)-based approaches at the classification stage are unknown, and thus determined by trial-and-error experiments. In this study, we analyzed a classifier that evolves ANNs using genetic algorithms (GAs), which combines feature selection with the learning task. The classifier named "Phased Searching with NEAT in a Time-Scaled Framework" was analyzed using a dataset with 800 malignant and 800 normal tissue regions in a 10-fold cross-validation framework. The classification performance measured by the area under a receiver operating characteristic (ROC) curve was 0.856 ± 0.029. The result was also compared with four other well-established classifiers that include fixed-topology ANNs, support vector machines (SVMs), linear discriminant analysis (LDA), and bagged decision trees. The results show that Phased Searching outperformed the LDA and bagged decision tree classifiers, and was only significantly outperformed by SVM. Furthermore, the Phased Searching method required fewer features and discarded superfluous structure or topology, thus incurring a lower feature computational and training and validation time requirement. Analyses performed on the network complexities evolved by Phased Searching indicate that it can evolve optimal network topologies based on its complexification and simplification parameter selection process. From the results, the study also concluded that the three classifiers - SVM, fixed-topology ANN, and Phased Searching with NeuroEvolution of Augmenting Topologies (NEAT) in a Time-Scaled Framework - are performing comparably well in our mammographic mass detection scheme.

The innate responses of bumble bees to flower patterns: separating the nectar guide from the nectary changes bee movements and search time

Science.gov (United States)

Goodale, Eben; Kim, Edward; Nabors, Annika; Henrichon, Sara; Nieh, James C.

2014-06-01

Nectar guides can enhance pollinator efficiency and plant fitness by allowing pollinators to more rapidly find and remember the location of floral nectar. We tested if a radiating nectar guide around a nectary would enhance the ability of naïve bumble bee foragers to find nectar. Most experiments that test nectar guide efficacy, specifically radiating linear guides, have used guides positioned around the center of a radially symmetric flower, where nectaries are often found. However, the flower center may be intrinsically attractive. We therefore used an off-center guide and nectary and compared "conjunct" feeders with a nectar guide surrounding the nectary to "disjunct" feeders with a nectar guide separated from the nectary. We focused on the innate response of novice bee foragers that had never previously visited such feeders. We hypothesized that a disjunct nectar guide would conflict with the visual information provided by the nectary and negatively affect foraging. Approximately, equal numbers of bumble bees ( Bombus impatiens) found nectar on both feeder types. On disjunct feeders, however, unsuccessful foragers spent significantly more time (on average 1.6-fold longer) searching for nectar than any other forager group. Successful foragers on disjunct feeders approached these feeders from random directions unlike successful foragers on conjunct feeders, which preferentially approached the combined nectary and nectar guide. Thus, the nectary and a surrounding nectar guide can be considered a combination of two signals that attract naïve foragers even when not in the floral center.

A Global Network Alignment Method Using Discrete Particle Swarm Optimization.

Science.gov (United States)

Huang, Jiaxiang; Gong, Maoguo; Ma, Lijia

2016-10-19

Molecular interactions data increase exponentially with the advance of biotechnology. This makes it possible and necessary to comparatively analyse the different data at a network level. Global network alignment is an important network comparison approach to identify conserved subnetworks and get insight into evolutionary relationship across species. Network alignment which is analogous to subgraph isomorphism is known to be an NP-hard problem. In this paper, we introduce a novel heuristic Particle-Swarm-Optimization based Network Aligner (PSONA), which optimizes a weighted global alignment model considering both protein sequence similarity and interaction conservations. The particle statuses and status updating rules are redefined in a discrete form by using permutation. A seed-and-extend strategy is employed to guide the searching for the superior alignment. The proposed initialization method "seeds" matches with high sequence similarity into the alignment, which guarantees the functional coherence of the mapping nodes. A greedy local search method is designed as the "extension" procedure to iteratively optimize the edge conservations. PSONA is compared with several state-of-art methods on ten network pairs combined by five species. The experimental results demonstrate that the proposed aligner can map the proteins with high functional coherence and can be used as a booster to effectively refine the well-studied aligners.

Nutrition Guide for Toddlers

Science.gov (United States)

... Staying Safe Videos for Educators Search English Español Nutrition Guide for Toddlers KidsHealth / For Parents / Nutrition Guide ... español Guía de nutrición para sus hijos pequeños Nutrition Through Variety Growth slows somewhat during the toddler ...

ElasticSearch server

CERN Document Server

Rogozinski, Marek

2014-01-01

This book is a detailed, practical, hands-on guide packed with real-life scenarios and examples which will show you how to implement an ElasticSearch search engine on your own websites.If you are a web developer or a user who wants to learn more about ElasticSearch, then this is the book for you. You do not need to know anything about ElastiSeach, Java, or Apache Lucene in order to use this book, though basic knowledge about databases and queries is required.

Pathway Detection from Protein Interaction Networks and Gene Expression Data Using Color-Coding Methods and A* Search Algorithms

Directory of Open Access Journals (Sweden)

Cheng-Yu Yeh

2012-01-01

Full Text Available With the large availability of protein interaction networks and microarray data supported, to identify the linear paths that have biological significance in search of a potential pathway is a challenge issue. We proposed a color-coding method based on the characteristics of biological network topology and applied heuristic search to speed up color-coding method. In the experiments, we tested our methods by applying to two datasets: yeast and human prostate cancer networks and gene expression data set. The comparisons of our method with other existing methods on known yeast MAPK pathways in terms of precision and recall show that we can find maximum number of the proteins and perform comparably well. On the other hand, our method is more efficient than previous ones and detects the paths of length 10 within 40 seconds using CPU Intel 1.73GHz and 1GB main memory running under windows operating system.

Lexical-Semantic Search Under Different Covert Verbal Fluency Tasks: An fMRI Study

Directory of Open Access Journals (Sweden)

Yunqing Li

2017-08-01

Full Text Available Background: Verbal fluency is a measure of cognitive flexibility and word search strategies that is widely used to characterize impaired cognitive function. Despite the wealth of research on identifying and characterizing distinct aspects of verbal fluency, the anatomic and functional substrates of retrieval-related search and post-retrieval control processes still have not been fully elucidated.Methods: Twenty-one native English-speaking, healthy, right-handed, adult volunteers (mean age = 31 years; range = 21–45 years; 9 F took part in a block-design functional Magnetic Resonance Imaging (fMRI study of free recall, covert word generation tasks when guided by phonemic (P, semantic-category (C, and context-based fill-in–the-blank sentence completion (S cues. General linear model (GLM, Independent Component Analysis (ICA, and psychophysiological interaction (PPI were used to further characterize the neural substrate of verbal fluency as a function of retrieval cue type.Results: Common localized activations across P, C, and S tasks occurred in the bilateral superior and left inferior frontal gyrus, left anterior cingulate cortex, bilateral supplementary motor area (SMA, and left insula. Differential task activations were centered in the occipital, temporal and parietal regions as well as the thalamus and cerebellum. The context-based fluency task, i.e., the S task, elicited higher differential brain activity in a lateralized frontal-temporal network typically engaged in complex language processing. P and C tasks elicited activation in limited pathways mainly within the left frontal regions. ICA and PPI results of the S task suggested that brain regions distributed across both hemispheres, extending beyond classical language areas, are recruited for lexical-semantic access and retrieval during sentence completion.Conclusion: Study results support the hypothesis of overlapping, as well as distinct, neural networks for covert word generation when

Network user's guide

International Nuclear Information System (INIS)

McGrady, P.W.

1994-12-01

NETWORK is a FORTRAN code used to model process flow systems in the gaseous diffusion plants at Portsmouth, Ohio and Paducah, Kentucky, operated by the United States Enrichment Corporation. It can handle a wide range of components and several different types of controllers. NETWORK can be run in either a steady-state mode or a transient mode. In the transient mode many different types of perturbations may be modeled. It is currently being used to model taking a cell off-stream in a gaseous diffusion plant. A brief description of the code is given, and process equipment models and input data are discussed

Searching for What I Want

DEFF Research Database (Denmark)

Liu, Fei; Xiao, Bo Sophia; Lim, Eric

2016-01-01

Inefficiencies associated with online information search are amplifying in the current era of big data. Despite growing scholarly interest in studying Internet users’ information search behaviour, there is a paucity of theory-guided investigation in this regard. In this paper, we draw on the theory...

Searching for axion stars and Q-balls with a terrestrial magnetometer network

Energy Technology Data Exchange (ETDEWEB)

Jackson Kimball, D. F. [Cal State, East Bay; Budker, D. [UC, Berkeley; Eby, J. [Fermilab; Pospelov, M. [Perimeter Inst. Theor. Phys.; Pustelny, S. [Jagiellonian U.; Scholtes, T. [Fribourg U.; Stadnik, Y. V. [Helmholtz Inst., Mainz; Weis, A. [Fribourg U.; Wickenbrock, A. [Mainz U.

2017-10-11

Light (pseudo-)scalar fields are promising candidates to be the dark matter in the Universe. Under certain initial conditions in the early Universe and/or with certain types of self-interactions, they can form compact dark-matter objects such as axion stars or Q-balls. Direct encounters with such objects can be searched for by using a global network of atomic magnetometers. It is shown that for a range of masses and radii not ruled out by existing observations, the terrestrial encounter rate with axion stars or Q-balls can be sufficiently high (at least once per year) for a detection. Furthermore, it is shown that a global network of atomic magnetometers is sufficiently sensitive to pseudoscalar couplings to atomic spins so that a transit through an axion star or Q-ball could be detected over a broad range of unexplored parameter space.

GRASP (Greedy Randomized Adaptive Search Procedures) applied to optimization of petroleum products distribution in pipeline networks; GRASP (Greedy Randomized Adaptative Search Procedures) aplicado ao 'scheduling' de redes de distribuicao de petroleo e derivados

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)

How context information and target information guide the eyes from the first epoch of search in real-world scenes.

Science.gov (United States)

Spotorno, Sara; Malcolm, George L; Tatler, Benjamin W

2014-02-11

This study investigated how the visual system utilizes context and task information during the different phases of a visual search task. The specificity of the target template (the picture or the name of the target) and the plausibility of target position in real-world scenes were manipulated orthogonally. Our findings showed that both target template information and guidance of spatial context are utilized to guide eye movements from the beginning of scene inspection. In both search initiation and subsequent scene scanning, the availability of a specific visual template was particularly useful when the spatial context of the scene was misleading and the availability of a reliable scene context facilitated search mainly when the template was abstract. Target verification was affected principally by the level of detail of target template, and was quicker in the case of a picture cue. The results indicate that the visual system can utilize target template guidance and context guidance flexibly from the beginning of scene inspection, depending upon the amount and the quality of the available information supplied by either of these high-level sources. This allows for optimization of oculomotor behavior throughout the different phases of search within a real-world scene.

Handbook of fiber optic data communication a practical guide to optical networking

CERN Document Server

DeCusatis, Casimer

2008-01-01

The third edition of this Handbook provides a comprehensive, easy to use guide to the field of optical fiber data communications. Written by experts in the industry from major companies such as IBM, Cisco and Nortel, the Handbook is a key reference for optical fiber technology, networking, protocols, applications, manufacturing, and future directions. It includes chapters on all the major industry standards, written by the same experts who developed them.This edition contains new material on transceiver form factors (QSFP, SFP +, XFP, X2), manufacturing standards, including JEDEC and R

Searching for Communities in Bipartite Networks

OpenAIRE

Barber, Michael J.; Faria, Margarida; Streit, Ludwig; Strogan, Oleg

2008-01-01

Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applie...

Ordered Consumer Search

OpenAIRE

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

Online Patent Searching: Guided by an Expert System.

Science.gov (United States)

Ardis, Susan B.

1990-01-01

Describes the development of an expert system for online patent searching that uses menu driven software to interpret the user's knowledge level and the general nature of the search problem. The discussion covers the rationale for developing such a system, current system functions, cost effectiveness, user reactions, and plans for future…

Guide to Eating for Sports

Medline Plus

Full Text Available ... Fitness Diseases & Conditions Infections Drugs & Alcohol School & Jobs Sports Expert Answers (Q&A) Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A Guide to Eating for ...

Guide to Eating for Sports

Medline Plus

Full Text Available ... for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A Guide to ... can boost your performance even more by paying attention to the food you eat on game day. ...

Extending Coverage and Lifetime of K-coverage Wireless Sensor Networks Using Improved Harmony Search

Directory of Open Access Journals (Sweden)

Shohreh Ebrahimnezhad

2011-07-01

Full Text Available K-coverage wireless sensor networks try to provide facilities such that each hotspot region is covered by at least k sensors. Because, the fundamental evaluation metrics of such networks are coverage and lifetime, proposing an approach that extends both of them simultaneously has a lot of interests. In this article, it is supposed that two kinds of nodes are available: static and mobile. The proposed method, at first, tries to balance energy among sensor nodes using Improved Harmony Search (IHS algorithm in a k-coverage and connected wireless sensor network in order to achieve a sensor node deployment. Also, this method proposes a suitable place for a gateway node (Sink that collects data from all sensors. Second, in order to prolong the network lifetime, some of the high energy-consuming mobile nodes are moved to the closest positions of low energy-consuming ones and vice versa after a while. This leads increasing the lifetime of network while connectivity and k-coverage are preserved. Through computer simulations, experimental results verified that the proposed IHS-based algorithm found better solution compared to some related methods.

Weak Ties and Self-Regulation in Job Search: The Effects of Goal Orientation on Networking

Science.gov (United States)

Hatala, John-Paul; Yamkovenko, Bogdan

2016-01-01

The purpose of this study is to empirically investigate the relationship between the self-regulatory variable of goal orientation and the extent to which job seekers reach out to and use weak ties in their job search. Weak ties, as defined by Granovettor, are connections to densely knit networks outside the individual's direct contacts who could…

Training Feedforward Neural Networks Using Symbiotic Organisms Search Algorithm

Directory of Open Access Journals (Sweden)

Haizhou Wu

2016-01-01

Full Text Available Symbiotic organisms search (SOS is a new robust and powerful metaheuristic algorithm, which stimulates the symbiotic interaction strategies adopted by organisms to survive and propagate in the ecosystem. In the supervised learning area, it is a challenging task to present a satisfactory and efficient training algorithm for feedforward neural networks (FNNs. In this paper, SOS is employed as a new method for training FNNs. To investigate the performance of the aforementioned method, eight different datasets selected from the UCI machine learning repository are employed for experiment and the results are compared among seven metaheuristic algorithms. The results show that SOS performs better than other algorithms for training FNNs in terms of converging speed. It is also proven that an FNN trained by the method of SOS has better accuracy than most algorithms compared.

Overexpression of O-methyltransferase leads to improved vanillin production in baker's yeast only when complemented with model-guided network engineering.

Science.gov (United States)

Brochado, Ana Rita; Patil, Kiran R

2013-02-01

Overproduction of a desired metabolite is often achieved via manipulation of the pathway directly leading to the product or through engineering of distant nodes within the metabolic network. Empirical examples illustrating the combined effect of these local and global strategies have been so far limited in eukaryotic systems. In this study, we compared the effects of overexpressing a key gene in de novo vanillin biosynthesis (coding for O-methyltransferase, hsOMT) in two yeast strains, with and without model-guided global network modifications. Overexpression of hsOMT resulted in increased vanillin production only in the strain with model-guided modifications, exemplifying advantage of using a global strategy prior to local pathway manipulation. Copyright © 2012 Wiley Periodicals, Inc.

Sequence Coding and Search System for licensee event reports: user's guide. Volume 1, Revision 1

International Nuclear Information System (INIS)

Greene, N.M.; Mays, G.T.; Johnson, M.P.

1985-04-01

Operating experience data from nuclear power plants are essential for safety and reliability analyses, especially analyses of trends and patterns. The licensee event reports (LERs) that are submitted to the Nuclear Regulatory Commission (NRC) by the nuclear power plant utilities contain much of this data. The NRC's Office for Analysis and Evaluation of Operational Data (AEOD) has developed, under contract with NSIC, a system for codifying the events reported in the LERs. The primary objective of the Sequence Coding and Search System (SCSS) is to reduce the descriptive text of the LERs to coded sequences that are both computer-readable and computer-searchable. This system provides a structured format for detailed coding of component, system, and unit effects as well as personnel errors. The database contains all current LERs submitted by nuclear power plant utilities for events occurring since 1981 and is updated on a continual basis. This four volume report documents and describes SCSS in detail. Volume 1 is a User's Guide for searching the SCSS database. This volume contains updated material through February 1985 of the working version of ORNL/NSIC-223, Vol. 1

Citation networks of related trials are often disconnected: implications for bidirectional citation searches.

Science.gov (United States)

Robinson, Karen A; Dunn, Adam G; Tsafnat, Guy; Glasziou, Paul

2014-07-01

Reports of randomized controlled trials (RCTs) should set findings within the context of previous research. The resulting network of citations would also provide an alternative search method for clinicians, researchers, and systematic reviewers seeking to base decisions on all available evidence. We sought to determine the connectedness of citation networks of RCTs by examining direct (referenced trials) and indirect (through references of referenced trials, etc) citation of trials to one another. Meta-analyses were used to create citation networks of RCTs addressing the same clinical questions. The primary measure was the proportion of networks where following citation links between RCTs identifies the complete set of RCTs, forming a single connected citation group. Other measures included the number of disconnected groups (islands) within each network, the number of citations in the network relative to the maximum possible, and the maximum number of links in the path between two connected trials (a measure of indirectness of citations). We included 259 meta-analyses with a total of 2,413 and a median of seven RCTs each. For 46% (118 of 259) of networks, the RCTs formed a single connected citation group-one island. For the other 54% of networks, where at least one RCT group was not cited by others, 39% had two citation islands and 4% (10 of 257) had 10 or more islands. On average, the citation networks had 38% of the possible citations to other trials (if each trial had cited all earlier trials). The number of citation islands and the maximum number of citation links increased with increasing numbers of trials in the network. Available evidence to answer a clinical question may be identified by using network citations created with a small initial corpus of eligible trials. However, the number of islands means that citation networks cannot be relied on for evidence retrieval. Copyright © 2014 Elsevier Inc. All rights reserved.

Deep architecture neural network-based real-time image processing for image-guided radiotherapy.

Science.gov (United States)

Mori, Shinichiro

2017-08-01

To develop real-time image processing for image-guided radiotherapy, we evaluated several neural network models for use with different imaging modalities, including X-ray fluoroscopic image denoising. Setup images of prostate cancer patients were acquired with two oblique X-ray fluoroscopic units. Two types of residual network were designed: a convolutional autoencoder (rCAE) and a convolutional neural network (rCNN). We changed the convolutional kernel size and number of convolutional layers for both networks, and the number of pooling and upsampling layers for rCAE. The ground-truth image was applied to the contrast-limited adaptive histogram equalization (CLAHE) method of image processing. Network models were trained to keep the quality of the output image close to that of the ground-truth image from the input image without image processing. For image denoising evaluation, noisy input images were used for the training. More than 6 convolutional layers with convolutional kernels >5×5 improved image quality. However, this did not allow real-time imaging. After applying a pair of pooling and upsampling layers to both networks, rCAEs with >3 convolutions each and rCNNs with >12 convolutions with a pair of pooling and upsampling layers achieved real-time processing at 30 frames per second (fps) with acceptable image quality. Use of our suggested network achieved real-time image processing for contrast enhancement and image denoising by the use of a conventional modern personal computer. Copyright © 2017 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.

Quantify uncertain emergency search techniques (QUEST) -- Theory and user's guide

International Nuclear Information System (INIS)

Johnson, M.M.; Goldsby, M.E.; Plantenga, T.D.; Porter, T.L.; West, T.H.; Wilcox, W.B.; Hensley, W.K.

1998-01-01

As recent world events show, criminal and terrorist access to nuclear materials is a growing national concern. The national laboratories are taking the lead in developing technologies to counter these potential threats to the national security. Sandia National laboratories, with support from Pacific Northwest National Laboratory and the Bechtel Nevada, Remote Sensing Laboratory, has developed QUEST (a model to Quantify Uncertain Emergency Search Techniques), to enhance the performance of organizations in the search for lost or stolen nuclear material. In addition, QUEST supports a wide range of other applications, such as environmental monitoring, nuclear facilities inspections, and searcher training. QUEST simulates the search for nuclear materials and calculates detector response for various source types and locations. The probability of detecting a radioactive source during a search is a function of many different variables, including source type, search location and structure geometry (including shielding), search dynamics (path and speed), and detector type and size. Through calculation of dynamic detector response, QUEST makes possible quantitative comparisons of various sensor technologies and search patterns. The QUEST model can be used as a tool to examine the impact of new detector technologies, explore alternative search concepts, and provide interactive search/inspector training

Features Extraction of Flotation Froth Images and BP Neural Network Soft-Sensor Model of Concentrate Grade Optimized by Shuffled Cuckoo Searching Algorithm

Directory of Open Access Journals (Sweden)

Jie-sheng Wang

2014-01-01

Full Text Available For meeting the forecasting target of key technology indicators in the flotation process, a BP neural network soft-sensor model based on features extraction of flotation froth images and optimized by shuffled cuckoo search algorithm is proposed. Based on the digital image processing technique, the color features in HSI color space, the visual features based on the gray level cooccurrence matrix, and the shape characteristics based on the geometric theory of flotation froth images are extracted, respectively, as the input variables of the proposed soft-sensor model. Then the isometric mapping method is used to reduce the input dimension, the network size, and learning time of BP neural network. Finally, a shuffled cuckoo search algorithm is adopted to optimize the BP neural network soft-sensor model. Simulation results show that the model has better generalization results and prediction accuracy.

Nuclear reactors project optimization based on neural network and genetic algorithm

International Nuclear Information System (INIS)

Pereira, Claudio M.N.A.; Schirru, Roberto; Martinez, Aquilino S.

1997-01-01

This work presents a prototype of a system for nuclear reactor core design optimization based on genetic algorithms and artificial neural networks. A neural network is modeled and trained in order to predict the flux and the neutron multiplication factor values based in the enrichment, network pitch and cladding thickness, with average error less than 2%. The values predicted by the neural network are used by a genetic algorithm in this heuristic search, guided by an objective function that rewards the high flux values and penalizes multiplication factors far from the required value. Associating the quick prediction - that may substitute the reactor physics calculation code - with the global optimization capacity of the genetic algorithm, it was obtained a quick and effective system for nuclear reactor core design optimization. (author). 11 refs., 8 figs., 3 tabs

Object-based target templates guide attention during visual search

OpenAIRE

Berggren, Nick; Eimer, Martin

2018-01-01

During visual search, attention is believed to be controlled in a strictly feature-based fashion, without any guidance by object-based target representations. To challenge this received view, we measured electrophysiological markers of attentional selection (N2pc component) and working memory (SPCN) in search tasks where two possible targets were defined by feature conjunctions (e.g., blue circles and green squares). Critically, some search displays also contained nontargets with two target f...

Scholarly information discovery in the networked academic learning environment

CERN Document Server

Li, LiLi

2014-01-01

In the dynamic and interactive academic learning environment, students are required to have qualified information literacy competencies while critically reviewing print and electronic information. However, many undergraduates encounter difficulties in searching peer-reviewed information resources. Scholarly Information Discovery in the Networked Academic Learning Environment is a practical guide for students determined to improve their academic performance and career development in the digital age. Also written with academic instructors and librarians in mind who need to show their students how to access and search academic information resources and services, the book serves as a reference to promote information literacy instructions. This title consists of four parts, with chapters on the search for online and printed information via current academic information resources and services: part one examines understanding information and information literacy; part two looks at academic information delivery in the...

VOLTTRON 3.0: User Guide

Energy Technology Data Exchange (ETDEWEB)

Lutes, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Haack, Jereme N. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Katipamula, Srinivas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Monson, Kyle E. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Akyol, Bora A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Carpenter, Brandon J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

2015-11-30

This document is a user guide for the deployment of the transactional network platform and agent/application development within VOLTTRON. The intent of this user guide is to provide a description of the functionality of the transactional network platform. This document describes how to deploy the platform, including installation, use, guidance, and limitations. It also describes how additional features can be added to enhance its current functionality.

VOLTTRON 2.0: User Guide

Energy Technology Data Exchange (ETDEWEB)

Lutes, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Haack, Jereme N. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Katipamula, Srinivas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Monson, Kyle E. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Akyol, Bora A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Carpenter, Brandon J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Tenney, Nathan D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

2014-11-30

This document is a user guide for the deployment of the transactional network platform and agent/application development within VOLTTRON. The intent of this user guide is to provide a description of the functionality of the transactional network platform. This document describes how to deploy the platform, including installation, use, guidance, and limitations. It also describes how additional features can be added to enhance its current functionality.

Electricity price forecast using Combinatorial Neural Network trained by a new stochastic search method

International Nuclear Information System (INIS)

Abedinia, O.; Amjady, N.; Shafie-khah, M.; Catalão, J.P.S.

2015-01-01

Highlights: • Presenting a Combinatorial Neural Network. • Suggesting a new stochastic search method. • Adapting the suggested method as a training mechanism. • Proposing a new forecast strategy. • Testing the proposed strategy on real-world electricity markets. - Abstract: Electricity price forecast is key information for successful operation of electricity market participants. However, the time series of electricity price has nonlinear, non-stationary and volatile behaviour and so its forecast method should have high learning capability to extract the complex input/output mapping function of electricity price. In this paper, a Combinatorial Neural Network (CNN) based forecasting engine is proposed to predict the future values of price data. The CNN-based forecasting engine is equipped with a new training mechanism for optimizing the weights of the CNN. This training mechanism is based on an efficient stochastic search method, which is a modified version of chemical reaction optimization algorithm, giving high learning ability to the CNN. The proposed price forecast strategy is tested on the real-world electricity markets of Pennsylvania–New Jersey–Maryland (PJM) and mainland Spain and its obtained results are extensively compared with the results obtained from several other forecast methods. These comparisons illustrate effectiveness of the proposed strategy.

Guide to Eating for Sports

Medline Plus

Full Text Available ... para adolescentes Body Mind Sexual Health Food & Fitness Diseases & Conditions Infections Drugs & Alcohol School & Jobs Sports Expert Answers (Q&A) Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A Guide to ...

Medication Guide

Science.gov (United States)

... Size Small Text Medium Text Large Text Contrast Dark on Light Light on Dark Donate Search Menu Donate What is Glaucoma? Care ... Low Vision Resources Medication Guide Resources on the Web » See All Articles Where the Money Goes Have ...

Spatial Search, Position Papers

OpenAIRE

Center for Spatial Studies, UCSB

2014-01-01

The Spatial Search specialist meeting in Santa Barbara (December 2014) brought together 35 academic and industry representatives from computational, geospatial, and cognitive sciences with interest in focused discussions on the development of an interdisciplinary research agenda to advance spatial search from scientific and engineering viewpoints. The position papers from participants represent the shared expertise that guided discussions and the formulation of research questions about proces...

The Global Alzheimer's Association Interactive Network.

Science.gov (United States)

Toga, Arthur W; Neu, Scott C; Bhatt, Priya; Crawford, Karen L; Ashish, Naveen

2016-01-01

The Global Alzheimer's Association Interactive Network (GAAIN) is consolidating the efforts of independent Alzheimer's disease data repositories around the world with the goals of revealing more insights into the causes of Alzheimer's disease, improving treatments, and designing preventative measures that delay the onset of physical symptoms. We developed a system for federating these repositories that is reliant on the tenets that (1) its participants require incentives to join, (2) joining the network is not disruptive to existing repository systems, and (3) the data ownership rights of its members are protected. We are currently in various phases of recruitment with over 55 data repositories in North America, Europe, Asia, and Australia and can presently query >250,000 subjects using GAAIN's search interfaces. GAAIN's data sharing philosophy, which guided our architectural choices, is conducive to motivating membership in a voluntary data sharing network. Copyright © 2016 The Alzheimer's Association. Published by Elsevier Inc. All rights reserved.

Optimal Power Flow Using Gbest-Guided Cuckoo Search Algorithm with Feedback Control Strategy and Constraint Domination Rule

Directory of Open Access Journals (Sweden)

Gonggui Chen

2017-01-01

Full Text Available The optimal power flow (OPF is well-known as a significant optimization tool for the security and economic operation of power system, and OPF problem is a complex nonlinear, nondifferentiable programming problem. Thus this paper proposes a Gbest-guided cuckoo search algorithm with the feedback control strategy and constraint domination rule which is named as FCGCS algorithm for solving OPF problem and getting optimal solution. This FCGCS algorithm is guided by the global best solution for strengthening exploitation ability. Feedback control strategy is devised to dynamically regulate the control parameters according to actual and specific feedback value in the simulation process. And the constraint domination rule can efficiently handle inequality constraints on state variables, which is superior to traditional penalty function method. The performance of FCGCS algorithm is tested and validated on the IEEE 30-bus and IEEE 57-bus example systems, and simulation results are compared with different methods obtained from other literatures recently. The comparison results indicate that FCGCS algorithm can provide high-quality feasible solutions for different OPF problems.

Top-down contextual knowledge guides visual attention in infancy.

Science.gov (United States)

Tummeltshammer, Kristen; Amso, Dima

2017-10-26

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

Automated Patent Categorization and Guided Patent Search using IPC as Inspired by MeSH and PubMed.

Science.gov (United States)

Eisinger, Daniel; Tsatsaronis, George; Bundschus, Markus; Wieneke, Ulrich; Schroeder, Michael

2013-04-15

Document search on PubMed, the pre-eminent database for biomedical literature, relies on the annotation of its documents with relevant terms from the Medical Subject Headings ontology (MeSH) for improving recall through query expansion. Patent documents are another important information source, though they are considerably less accessible. One option to expand patent search beyond pure keywords is the inclusion of classification information: Since every patent is assigned at least one class code, it should be possible for these assignments to be automatically used in a similar way as the MeSH annotations in PubMed. In order to develop a system for this task, it is necessary to have a good understanding of the properties of both classification systems. This report describes our comparative analysis of MeSH and the main patent classification system, the International Patent Classification (IPC). We investigate the hierarchical structures as well as the properties of the terms/classes respectively, and we compare the assignment of IPC codes to patents with the annotation of PubMed documents with MeSH terms.Our analysis shows a strong structural similarity of the hierarchies, but significant differences of terms and annotations. The low number of IPC class assignments and the lack of occurrences of class labels in patent texts imply that current patent search is severely limited. To overcome these limits, we evaluate a method for the automated assignment of additional classes to patent documents, and we propose a system for guided patent search based on the use of class co-occurrence information and external resources.

Search for gravitational waves associated with γ-ray bursts detected by the interplanetary network.

Science.gov (United States)

Aasi, J; Abbott, B P; Abbott, R; Abbott, T; Abernathy, M R; Acernese, F; Ackley, K; Adams, C; Adams, T; Addesso, P; Adhikari, R X; Affeldt, C; Agathos, M; Aggarwal, N; Aguiar, O D; Ajith, P; Alemic, A; Allen, B; Allocca, A; Amariutei, D; Andersen, M; Anderson, R A; Anderson, S B; Anderson, W G; Arai, K; Araya, M C; Arceneaux, C; Areeda, J S; Ast, S; Aston, S M; Astone, P; Aufmuth, P; Augustus, H; Aulbert, C; Aylott, B E; Babak, S; Baker, P T; Ballardin, G; Ballmer, S W; Barayoga, J C; Barbet, M; Barish, B C; Barker, D; Barone, F; Barr, B; Barsotti, L; Barsuglia, M; Barton, M A; Bartos, I; Bassiri, R; Basti, A; Batch, J C; Bauchrowitz, J; Bauer, Th S; Baune, C; Bavigadda, V; Behnke, B; Bejger, M; Beker, M G; Belczynski, C; Bell, A S; Bell, C; Bergmann, G; Bersanetti, D; Bertolini, A; Betzwieser, J; Bilenko, I A; Billingsley, G; Birch, J; Biscans, S; Bitossi, M; Biwer, C; Bizouard, M A; Black, E; Blackburn, J K; Blackburn, L; Blair, D; Bloemen, S; Bock, O; Bodiya, T P; Boer, M; Bogaert, G; Bogan, C; Bond, C; Bondu, F; Bonelli, L; Bonnand, R; Bork, R; Born, M; Boschi, V; Bose, Sukanta; Bosi, L; Bradaschia, C; Brady, P R; Braginsky, V B; Branchesi, M; Brau, J E; Briant, T; Bridges, D O; Brillet, A; Brinkmann, M; Brisson, V; Brooks, A F; Brown, D A; Brown, D D; Brückner, F; Buchman, S; Buikema, A; Bulik, T; Bulten, H J; Buonanno, A; Burman, R; Buskulic, D; Buy, C; Cadonati, L; Cagnoli, G; Calderón Bustillo, J; Calloni, E; Camp, J B; Campsie, P; Cannon, K C; Canuel, B; Cao, J; Capano, C D; Carbognani, F; Carbone, L; Caride, S; Castaldi, G; Caudill, S; Cavaglià, M; Cavalier, F; Cavalieri, R; Celerier, C; Cella, G; Cepeda, C; Cesarini, E; Chakraborty, R; Chalermsongsak, T; Chamberlin, S J; Chao, S; Charlton, P; Chassande-Mottin, E; Chen, X; Chen, Y; Chincarini, A; Chiummo, A; Cho, H S; Cho, M; Chow, J H; Christensen, N; Chu, Q; Chua, S S Y; Chung, S; Ciani, G; Clara, F; Clark, D E; Clark, J A; Clayton, J H; Cleva, F; Coccia, E; Cohadon, P-F; Colla, A; Collette, C; Colombini, M; Cominsky, L; Constancio, M; Conte, A; Cook, D; Corbitt, T R; Cornish, N; Corsi, A; Costa, C A; Coughlin, M W; Coulon, J-P; Countryman, S; Couvares, P; Coward, D M; Cowart, M J; Coyne, D C; Coyne, R; Craig, K; Creighton, J D E; Croce, R P; Crowder, S G; Cumming, A; Cunningham, L; Cuoco, E; Cutler, C; Dahl, K; Dal Canton, T; Damjanic, M; Danilishin, S L; D'Antonio, S; Danzmann, K; Dattilo, V; Daveloza, H; Davier, M; Davies, G S; Daw, E J; Day, R; Dayanga, T; DeBra, D; Debreczeni, G; Degallaix, J; Deléglise, S; Del Pozzo, W; Denker, T; Dent, T; Dereli, H; Dergachev, V; De Rosa, R; DeRosa, R T; DeSalvo, R; Dhurandhar, S; Díaz, M; Dickson, J; Di Fiore, L; Di Lieto, A; Di Palma, I; Di Virgilio, A; Dolique, V; Dominguez, E; Donovan, F; Dooley, K L; Doravari, S; Douglas, R; Downes, T P; Drago, M; Drever, R W P; Driggers, J C; Du, Z; Ducrot, M; Dwyer, S; Eberle, T; Edo, T; Edwards, M; Effler, A; Eggenstein, H-B; Ehrens, P; Eichholz, J; Eikenberry, S S; Endrőczi, G; Essick, R; Etzel, T; Evans, M; Evans, T; Factourovich, M; Fafone, V; Fairhurst, S; Fan, X; Fang, Q; Farinon, S; Farr, B; Farr, W M; Favata, M; Fazi, D; Fehrmann, H; Fejer, M M; Feldbaum, D; Feroz, F; Ferrante, I; Ferreira, E C; Ferrini, F; Fidecaro, F; Finn, L S; Fiori, I; Fisher, R P; Flaminio, R; Fournier, J-D; Franco, S; Frasca, S; Frasconi, F; Frede, M; Frei, Z; Freise, A; Frey, R; Fricke, T T; Fritschel, P; Frolov, V V; Fulda, P; Fyffe, M; Gair, J R; Gammaitoni, L; Gaonkar, S; Garufi, F; Gehrels, N; Gemme, G; Gendre, B; Genin, E; Gennai, A; Ghosh, S; Giaime, J A; Giardina, K D; Giazotto, A; Gleason, J; Goetz, E; Goetz, R; Gondan, L; González, G; Gordon, N; Gorodetsky, M L; Gossan, S; Goßler, S; Gouaty, R; Gräf, C; Graff, P B; Granata, M; Grant, A; Gras, S; Gray, C; Greenhalgh, R J S; Gretarsson, A M; Groot, P; Grote, H; Grover, K; Grunewald, S; Guidi, G M; Guido, C J; Gushwa, K; Gustafson, E K; Gustafson, R; Ha, J; Hall, E D; Hamilton, W; Hammer, D; Hammond, G; Hanke, M; Hanks, J; Hanna, C; Hannam, M D; Hanson, J; Harms, J; Harry, G M; Harry, I W; Harstad, E D; Hart, M; Hartman, M T; Haster, C-J; Haughian, K; Heidmann, A; Heintze, M; Heitmann, H; Hello, P; Hemming, G; Hendry, M; Heng, I S; Heptonstall, A W; Heurs, M; Hewitson, M; Hild, S; Hoak, D; Hodge, K A; Hofman, D; Holt, K; Hopkins, P; Horrom, T; Hoske, D; Hosken, D J; Hough, J; Howell, E J; Hu, Y; Huerta, E; Hughey, B; Husa, S; Huttner, S H; Huynh, M; Huynh-Dinh, T; Idrisy, A; Ingram, D R; Inta, R; Islas, G; Isogai, T; Ivanov, A; Iyer, B R; Izumi, K; Jacobson, M; Jang, H; Jaranowski, P; Ji, Y; Jiménez-Forteza, F; Johnson, W W; Jones, D I; Jones, R; Jonker, R J G; Ju, L; Haris, K; Kalmus, P; Kalogera, V; Kandhasamy, S; Kang, G; Kanner, J B; Karlen, J; Kasprzack, M; Katsavounidis, E; Katzman, W; Kaufer, H; Kaufer, S; Kaur, T; Kawabe, K; Kawazoe, F; Kéfélian, F; Keiser, G M; Keitel, D; Kelley, D B; Kells, W; Keppel, D G; Khalaidovski, A; Khalili, F Y; Khazanov, E A; Kim, C; Kim, K; Kim, N G; Kim, N; Kim, S; Kim, Y-M; King, E J; King, P J; Kinzel, D L; Kissel, J S; Klimenko, S; Kline, J; Koehlenbeck, S; Kokeyama, K; Kondrashov, V; Koranda, S; Korth, W Z; Kowalska, I; Kozak, D B; Kringel, V; Krishnan, B; Królak, A; Kuehn, G; Kumar, A; Kumar, D Nanda; Kumar, P; Kumar, R; Kuo, L; Kutynia, A; Lam, P K; Landry, M; Lantz, B; Larson, S; Lasky, P D; Lazzarini, A; Lazzaro, C; Leaci, P; Leavey, S; Lebigot, E O; Lee, C H; Lee, H K; Lee, H M; Lee, J; Lee, P J; Leonardi, M; Leong, J R; Leonor, I; Le Roux, A; Leroy, N; Letendre, N; Levin, Y; Levine, B; Lewis, J; Li, T G F; Libbrecht, K; Libson, A; Lin, A C; Littenberg, T B; Lockerbie, N A; Lockett, V; Lodhia, D; Loew, K; Logue, J; Lombardi, A L; Lopez, E; Lorenzini, M; Loriette, V; Lormand, M; Losurdo, G; Lough, J; Lubinski, M J; Lück, H; Lundgren, A P; Ma, Y; Macdonald, E P; MacDonald, T; Machenschalk, B; MacInnis, M; Macleod, D M; Magaña-Sandoval, F; Magee, R; Mageswaran, M; Maglione, C; Mailand, K; Majorana, E; Maksimovic, I; Malvezzi, V; Man, N; Manca, G M; Mandel, I; Mandic, V; Mangano, V; Mangini, N M; Mansell, G; Mantovani, M; Marchesoni, F; Marion, F; Márka, S; Márka, Z; Markosyan, A; Maros, E; Marque, J; Martelli, F; Martin, I W; Martin, R M; Martinelli, L; Martynov, D; Marx, J N; Mason, K; Masserot, A; Massinger, T J; Matichard, F; Matone, L; Mavalvala, N; May, G; Mazumder, N; Mazzolo, G; McCarthy, R; McClelland, D E; McGuire, S C; McIntyre, G; McIver, J; McLin, K; Meacher, D; Meadors, G D; Mehmet, M; Meidam, J; Meinders, M; Melatos, A; Mendell, G; Mercer, R A; Meshkov, S; Messenger, C; Meyer, M S; Meyers, P M; Mezzani, F; Miao, H; Michel, C; Mikhailov, E E; Milano, L; Miller, J; Minenkov, Y; Mingarelli, C M F; Mishra, C; Mitra, S; Mitrofanov, V P; Mitselmakher, G; Mittleman, R; Moe, B; Moggi, A; Mohan, M; Mohapatra, S R P; Moraru, D; Moreno, G; Morgado, N; Morriss, S R; Mossavi, K; Mours, B; Mow-Lowry, C M; Mueller, C L; Mueller, G; Mukherjee, S; Mullavey, A; Munch, J; Murphy, D; Murray, P G; Mytidis, A; Nagy, M F; Nardecchia, I; Naticchioni, L; Nayak, R K; Necula, V; Nelemans, G; Neri, I; Neri, M; Newton, G; Nguyen, T; Nielsen, A B; Nissanke, S; Nitz, A H; Nocera, F; Nolting, D; Normandin, M E N; Nuttall, L K; Ochsner, E; O'Dell, J; Oelker, E; Oh, J J; Oh, S H; Ohme, F; Omar, S; Oppermann, P; Oram, R; O'Reilly, B; Ortega, W; O'Shaughnessy, R; Osthelder, C; Ottaway, D J; Ottens, R S; Overmier, H; Owen, B J; Padilla, C; Pai, A; Palashov, O; Palomba, C; Pan, H; Pan, Y; Pankow, C; Paoletti, F; Papa, M A; Paris, H; Pasqualetti, A; Passaquieti, R; Passuello, D; Pedraza, M; Pele, A; Penn, S; Perreca, A; Phelps, M; Pichot, M; Pickenpack, M; Piergiovanni, F; Pierro, V; Pinard, L; Pinto, I M; Pitkin, M; Poeld, J; Poggiani, R; Poteomkin, A; Powell, J; Prasad, J; Predoi, V; Premachandra, S; Prestegard, T; Price, L R; Prijatelj, M; Privitera, S; Prodi, G A; Prokhorov, L; Puncken, O; Punturo, M; Puppo, P; Pürrer, M; Qin, J; Quetschke, V; Quintero, E; Quitzow-James, R; Raab, F J; Rabeling, D S; Rácz, I; Radkins, H; Raffai, P; Raja, S; Rajalakshmi, G; Rakhmanov, M; Ramet, C; Ramirez, K; Rapagnani, P; Raymond, V; Razzano, M; Re, V; Recchia, S; Reed, C M; Regimbau, T; Reid, S; Reitze, D H; Reula, O; Rhoades, E; Ricci, F; Riesen, R; Riles, K; Robertson, N A; Robinet, F; Rocchi, A; Roddy, S B; Rolland, L; Rollins, J G; Romano, R; Romanov, G; Romie, J H; Rosińska, D; Rowan, S; Rüdiger, A; Ruggi, P; Ryan, K; Salemi, F; Sammut, L; Sandberg, V; Sanders, J R; Sankar, S; Sannibale, V; Santiago-Prieto, I; Saracco, E; Sassolas, B; Sathyaprakash, B S; Saulson, P R; Savage, R; Scheuer, J; Schilling, R; Schilman, M; Schmidt, P; Schnabel, R; Schofield, R M S; Schreiber, E; Schuette, D; Schutz, B F; Scott, J; Scott, S M; Sellers, D; Sengupta, A S; Sentenac, D; Sequino, V; Sergeev, A; Shaddock, D A; Shah, S; Shahriar, M S; Shaltev, M; Shao, Z; Shapiro, B; Shawhan, P; Shoemaker, D H; Sidery, T L; Siellez, K; Siemens, X; Sigg, D; Simakov, D; Singer, A; Singer, L; Singh, R; Sintes, A M; Slagmolen, B J J; Slutsky, J; Smith, J R; Smith, M R; Smith, R J E; Smith-Lefebvre, N D; Son, E J; Sorazu, B; Souradeep, T; Staley, A; Stebbins, J; Steinke, M; Steinlechner, J; Steinlechner, S; Stephens, B C; Steplewski, S; Stevenson, S; Stone, R; Stops, D; Strain, K A; Straniero, N; Strigin, S; Sturani, R; Stuver, A L; Summerscales, T Z; Susmithan, S; Sutton, P J; Swinkels, B; Tacca, M; Talukder, D; Tanner, D B; Tao, J; Tarabrin, S P; Taylor, R; Tellez, G; Thirugnanasambandam, M P; Thomas, M; Thomas, P; Thorne, K A; Thorne, K S; Thrane, E; Tiwari, V; Tokmakov, K V; Tomlinson, C; Tonelli, M; Torres, C V; Torrie, C I; Travasso, F; Traylor, G; Tse, M; Tshilumba, D; Tuennermann, H; Ugolini, D; Unnikrishnan, C S; Urban, A L; Usman, S A; Vahlbruch, H; Vajente, G; Valdes, G; Vallisneri, M; van Beuzekom, M; van den Brand, J F J; Van Den Broeck, C; van der Sluys, M V; van Heijningen, J; van Veggel, A A; Vass, S; Vasúth, M; Vaulin, R; Vecchio, A; Vedovato, G; Veitch, J; Veitch, P J; Venkateswara, K; Verkindt, D; Vetrano, F; Viceré, A; Vincent-Finley, R; Vinet, J-Y; Vitale, S; Vo, T; Vocca, H; Vorvick, C; Vousden, W D; Vyachanin, S P; Wade, A R; Wade, L; Wade, M; Walker, M; Wallace, L; Walsh, S; Wang, M; Wang, X; Ward, R L; Was, M; Weaver, B; Wei, L-W; Weinert, M; Weinstein, A J; Weiss, R; Welborn, T; Wen, L; Wessels, P; West, M; Westphal, T; Wette, K; Whelan, J T; White, D J; Whiting, B F; Wiesner, K; Wilkinson, C; Williams, K; Williams, L; Williams, R; Williams, T D; Williamson, A R; Willis, J L; Willke, B; Wimmer, M; Winkler, W; Wipf, C C; Wiseman, A G; Wittel, H; Woan, G; Wolovick, N; Worden, J; Wu, Y; Yablon, J; Yakushin, I; Yam, W; Yamamoto, H; Yancey, C C; Yang, H; Yoshida, S; Yvert, M; Zadrożny, A; Zanolin, M; Zendri, J-P; Zhang, Fan; Zhang, L; Zhao, C; Zhu, H; Zhu, X J; Zucker, M E; Zuraw, S; Zweizig, J; Aptekar, R L; Atteia, J L; Cline, T; Connaughton, V; Frederiks, D D; Golenetskii, S V; Hurley, K; Krimm, H A; Marisaldi, M; Pal'shin, V D; Palmer, D; Svinkin, D S; Terada, Y; von Kienlin, A

2014-07-04

We present the results of a search for gravitational waves associated with 223 γ-ray bursts (GRBs) detected by the InterPlanetary Network (IPN) in 2005-2010 during LIGO's fifth and sixth science runs and Virgo's first, second, and third science runs. The IPN satellites provide accurate times of the bursts and sky localizations that vary significantly from degree scale to hundreds of square degrees. We search for both a well-modeled binary coalescence signal, the favored progenitor model for short GRBs, and for generic, unmodeled gravitational wave bursts. Both searches use the event time and sky localization to improve the gravitational wave search sensitivity as compared to corresponding all-time, all-sky searches. We find no evidence of a gravitational wave signal associated with any of the IPN GRBs in the sample, nor do we find evidence for a population of weak gravitational wave signals associated with the GRBs. For all IPN-detected GRBs, for which a sufficient duration of quality gravitational wave data are available, we place lower bounds on the distance to the source in accordance with an optimistic assumption of gravitational wave emission energy of 10(-2)M⊙c(2) at 150 Hz, and find a median of 13 Mpc. For the 27 short-hard GRBs we place 90% confidence exclusion distances to two source models: a binary neutron star coalescence, with a median distance of 12 Mpc, or the coalescence of a neutron star and black hole, with a median distance of 22 Mpc. Finally, we combine this search with previously published results to provide a population statement for GRB searches in first-generation LIGO and Virgo gravitational wave detectors and a resulting examination of prospects for the advanced gravitational wave detectors.

Search for Gravitational Waves Associated with Gamma-Ray Bursts Detected by the Interplanetary Network

Science.gov (United States)

Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Acernese, F.; Blackbum, L.; Camp, J. B.; Gehrels, N.; Graff, P. B.;

A Hybrid Heuristic Optimization Approach for Leak Detection in Pipe Networks Using Ordinal Optimization Approach and the Symbiotic Organism Search

Directory of Open Access Journals (Sweden)

Chao-Chih Lin

2017-10-01

Full Text Available A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA and the symbiotic organism search (SOS to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS is first used to determine steady-state head distribution and pipe flow rates. The best transient generation point and its relevant valve operation parameters are optimized by maximizing the objective function of transient energy. The transient event is created at the chosen point, and the method of characteristics (MOC is used to analyze the transient flow. The OOA is applied to sift through the candidate pipes and the initial organisms with leak information. The SOS is employed to determine the leaks by minimizing the sum of differences between simulated and computed head at the observation points. Two synthetic leaking scenarios, a simple pipe network and a water distribution network (WDN, are chosen to test the performance of leak detection ordinal symbiotic organism search (LDOSOS. Leak information can be accurately identified by the proposed approach for both of the scenarios. The presented technique makes a remarkable contribution to the success of leak detection in the pipe networks.

ISIS Topside-Sounder Plasma-Wave Investigations as Guides to Desired Virtual Wave Observatory (VWO) Data Search Capabilities

Science.gov (United States)

Benson, Robert F.; Fung, Shing F.

2008-01-01

Many plasma-wave phenomena, observed by space-borne radio sounders, cannot be properly explained in terms of wave propagation in a cold plasma consisting of mobile electrons and infinitely massive positive ions. These phenomena include signals known as plasma resonances. The principal resonances at the harmonics of the electron cyclotron frequency, the plasma frequency, and the upper-hybrid frequency are well explained by the warm-plasma propagation of sounder-generated electrostatic waves, Other resonances have been attributed to sounder-stimulated plasma instability and non-linear effects, eigenmodes of cylindrical electromagnetic plasma oscillations, and plasma memory processes. Data from the topside sounders of the International Satellites for Ionospheric Studies (ISIS) program played a major role in these interpretations. A data transformation and preservation effort at the Goddard Space Flight Center has produced digital ISIS topside ionograms and a metadata search program that has enabled some recent discoveries pertaining to the physics of these plasma resonances. For example, data records were obtained that enabled the long-standing question (several decades) of the origin of the plasma resonance at the fundamental electron cyclotron frequency to be explained [Muldrew, Radio Sci., 2006]. These data-search capabilities, and the science enabled by them, will be presented as a guide to desired data search capabilities to be included in the Virtual Wave Observatory (VWO).

Guide to Eating for Sports

Medline Plus

Full Text Available ... Q&A) Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A Guide to Eating for Sports What's in this article? Eat Extra for Excellence Athletes and Dieting Eat a Variety of Foods Muscular Minerals and Vital Vitamins Protein ...

Forecasting Hoabinh Reservoir’s Incoming Flow: An Application of Neural Networks with the Cuckoo Search Algorithm

Directory of Open Access Journals (Sweden)

Jeng-Fung Chen

2014-11-01

Full Text Available The accuracy of reservoir flow forecasting has the most significant influence on the assurance of stability and annual operations of hydro-constructions. For instance, accurate forecasting on the ebb and flow of Vietnam’s Hoabinh Reservoir can aid in the preparation and prevention of lowland flooding and drought, as well as regulating electric energy. This raises the need to propose a model that accurately forecasts the incoming flow of the Hoabinh Reservoir. In this study, a solution to this problem based on neural network with the Cuckoo Search (CS algorithm is presented. In particular, we used hydrographic data and predicted total incoming flows of the Hoabinh Reservoir over a period of 10 days. The Cuckoo Search algorithm was utilized to train the feedforward neural network (FNN for prediction. The algorithm optimized the weights between layers and biases of the neuron network. Different forecasting models for the three scenarios were developed. The constructed models have shown high forecasting performance based on the performance indices calculated. These results were also compared with those obtained from the neural networks trained by the particle swarm optimization (PSO and back-propagation (BP, indicating that the proposed approach performed more effectively. Based on the experimental results, the scenario using the rainfall and the flow as input yielded the highest forecasting accuracy when compared with other scenarios. The performance criteria RMSE, MAPE, and R obtained by the CS-FNN in this scenario were calculated as 48.7161, 0.067268 and 0.8965, respectively. These results were highly correlated to actual values. It is expected that this work may be useful for hydrographic forecasting.

Leveraging Educational, Research and Facility Expertise to Improve Global Seismic Monitoring: Preparing a Guide on Sustainable Networks

Science.gov (United States)

Nybade, A.; Aster, R.; Beck, S.; Ekstrom, G.; Fischer, K.; Lerner-Lam, A.; Meltzer, A.; Sandvol, E.; Willemann, R. J.

2008-12-01

Building a sustainable earthquake monitoring system requires well-informed cooperation between commercial companies that manufacture components or deliver complete systems and the government or other agencies that will be responsible for operating them. Many nations or regions with significant earthquake hazard lack the financial, technical, and human resources to establish and sustain permanent observatory networks required to return the data needed for hazard mitigation. Government agencies may not be well- informed about the short-term and long-term challenges of managing technologically advanced monitoring systems, much less the details of how they are built and operated. On the relatively compressed time scale of disaster recovery efforts, it can be difficult to find a reliable, disinterested source of information, without which government agencies may be dependent on partial information. If system delivery fails to include sufficient development of indigenous expertise, the performance of local and regional networks may decline quickly, and even data collected during an early high-performance period may be degraded or lost. Drawing on unsurpassed educational capabilities of its members working in close cooperation with its facility staff, IRIS is well prepared to contribute to sustainability through a wide variety of training and service activities that further promote standards for network installation, data exchange protocols, and free and open access to data. Members of the Consortium and staff of its Core Programs together could write a guide on decisions about network design, installation and operation. The intended primary audience would be government officials seeking to understand system requirements, the acquisition and installation process, and the expertise needed operate a system. The guide would cover network design, procurement, set-up, data use and archiving. Chapters could include advice on network data processing, archiving data (including

Seasonal variation in Internet searches for vitamin D.

Science.gov (United States)

Moon, Rebecca J; Curtis, Elizabeth M; Davies, Justin H; Cooper, Cyrus; Harvey, Nicholas C

2017-12-01

Internet search rates for "vitamin D" were explored using Google Trends. Search rates increased from 2004 until 2010 and thereafter displayed a seasonal pattern peaking in late winter. This knowledge could help guide the timing of public health interventions aimed at managing vitamin D deficiency. The Internet is an important source of health information. Analysis of Internet search activity rates can provide information on disease epidemiology, health related behaviors and public interest. We explored Internet search rates for vitamin D to determine whether this reflects the increasing scientific interest in this topic. Google Trends is a publically available tool that provides data on Internet searches using Google. Search activity for the term "vitamin D" from 1st January 2004 until 31st October 2016 was obtained. Comparison was made to other bone and nutrition related terms. Worldwide, searches for "vitamin D" increased from 2004 until 2010 and thereafter a statistically significant (p Internet search activity, did increase from 2004 to 2010, likely reflecting the growing scientific interest, but now displays a seasonal pattern with peak interest during late winter. This information could be used to guide public health approaches to managing vitamin D deficiency.

Taking Conjunction Search to a Higher Dimension

Directory of Open Access Journals (Sweden)

Jeremy M. Wolfe

2011-05-01

Full Text Available In visual search for conjunctions, targets are defined by combinations of features. Thus, targets might be RED VERTICAL items among RED horizontal and green VERTICAL distractors. Guided Search and similar models argue that features are conjoined only once an object is attended. However, efficient conjunction search is possible because observers can guide attention toward red and toward vertical. Real-world objects may be defined by the conjunction of many features, with no one feature defining the target. Can attention be guided to higher order conjunctions? We created 6D conjunction stimuli and varied the number of features shared between targets and distractors and the number of distractor types. RT x set size slopes range from 1.4 msec/item when two distractor types each share three features with the target to 66 msec/item when six distractor types each share five features with the target. Using different 3D conjunctions, we held distributions of features constant (1/3 of each of three colors, shapes, and orientations. We varied the grouping of distractors in order to look for evidence of simultaneous guidance by multiple attributes versus sequential grouping of subsets (Find the odd orientation in this color subset. We find that guidance and grouping may both contribute to efficient conjunction search.

Priming and the guidance by visual and categorical templates in visual search

NARCIS (Netherlands)

Wilschut, A.M.; Theeuwes, J.; Olivers, C.N.L.

2014-01-01

Visual search is thought to be guided by top-down templates that are held in visual working memory. Previous studies have shown that a search-guiding template can be rapidly and strongly implemented from a visual cue, whereas templates are less effective when based on categorical cues. Direct visual

Visual working memory simultaneously guides facilitation and inhibition during visual search.

Science.gov (United States)

Dube, Blaire; Basciano, April; Emrich, Stephen M; Al-Aidroos, Naseem

2016-07-01

During visual search, visual working memory (VWM) supports the guidance of attention in two ways: It stores the identity of the search target, facilitating the selection of matching stimuli in the search array, and it maintains a record of the distractors processed during search so that they can be inhibited. In two experiments, we investigated whether the full contents of VWM can be used to support both of these abilities simultaneously. In Experiment 1, participants completed a preview search task in which (a) a subset of search distractors appeared before the remainder of the search items, affording participants the opportunity to inhibit them, and (b) the search target varied from trial to trial, requiring the search target template to be maintained in VWM. We observed the established signature of VWM-based inhibition-reduced ability to ignore previewed distractors when the number of distractors exceeds VWM's capacity-suggesting that VWM can serve this role while also representing the target template. In Experiment 2, we replicated Experiment 1, but added to the search displays a singleton distractor that sometimes matched the color (a task-irrelevant feature) of the search target, to evaluate capture. We again observed the signature of VWM-based preview inhibition along with attentional capture by (and, thus, facilitation of) singletons matching the target template. These findings indicate that more than one VWM representation can bias attention at a time, and that these representations can separately affect selection through either facilitation or inhibition, placing constraints on existing models of the VWM-based guidance of attention.

Overexpression of O‐methyltransferase leads to improved vanillin production in baker's yeast only when complemented with model‐guided network engineering

DEFF Research Database (Denmark)

Brochado, Ana Rita; Patil, Kiran R.

2013-01-01

limited in eukaryotic systems. In this study, we compared the effects of overexpressing a key gene in de novo vanillin biosynthesis (coding for O‐methyltransferase, hsOMT) in two yeast strains, with and without model‐guided global network modifications. Overexpression of hsOMT resulted in increased...... vanillin production only in the strain with model‐guided modifications, exemplifying advantage of using a global strategy prior to local pathway manipulation. Biotechnol. Bioeng. 2013; 110: 656–659. © 2012 Wiley Periodicals, Inc....

Constructing a clinical decision-making framework for image-guided radiotherapy using a Bayesian Network

International Nuclear Information System (INIS)

Hargrave, C; Deegan, T; Gibbs, A; Poulsen, M; Moores, M; Harden, F; Mengersen, K

2014-01-01

A decision-making framework for image-guided radiotherapy (IGRT) is being developed using a Bayesian Network (BN) to graphically describe, and probabilistically quantify, the many interacting factors that are involved in this complex clinical process. Outputs of the BN will provide decision-support for radiation therapists to assist them to make correct inferences relating to the likelihood of treatment delivery accuracy for a given image-guided set-up correction. The framework is being developed as a dynamic object-oriented BN, allowing for complex modelling with specific subregions, as well as representation of the sequential decision-making and belief updating associated with IGRT. A prototype graphic structure for the BN was developed by analysing IGRT practices at a local radiotherapy department and incorporating results obtained from a literature review. Clinical stakeholders reviewed the BN to validate its structure. The BN consists of a sub-network for evaluating the accuracy of IGRT practices and technology. The directed acyclic graph (DAG) contains nodes and directional arcs representing the causal relationship between the many interacting factors such as tumour site and its associated critical organs, technology and technique, and inter-user variability. The BN was extended to support on-line and off-line decision-making with respect to treatment plan compliance. Following conceptualisation of the framework, the BN will be quantified. It is anticipated that the finalised decision-making framework will provide a foundation to develop better decision-support strategies and automated correction algorithms for IGRT.

Constructing a clinical decision-making framework for image-guided radiotherapy using a Bayesian Network

Science.gov (United States)

Hargrave, C.; Moores, M.; Deegan, T.; Gibbs, A.; Poulsen, M.; Harden, F.; Mengersen, K.

2014-03-01

A decision-making framework for image-guided radiotherapy (IGRT) is being developed using a Bayesian Network (BN) to graphically describe, and probabilistically quantify, the many interacting factors that are involved in this complex clinical process. Outputs of the BN will provide decision-support for radiation therapists to assist them to make correct inferences relating to the likelihood of treatment delivery accuracy for a given image-guided set-up correction. The framework is being developed as a dynamic object-oriented BN, allowing for complex modelling with specific subregions, as well as representation of the sequential decision-making and belief updating associated with IGRT. A prototype graphic structure for the BN was developed by analysing IGRT practices at a local radiotherapy department and incorporating results obtained from a literature review. Clinical stakeholders reviewed the BN to validate its structure. The BN consists of a sub-network for evaluating the accuracy of IGRT practices and technology. The directed acyclic graph (DAG) contains nodes and directional arcs representing the causal relationship between the many interacting factors such as tumour site and its associated critical organs, technology and technique, and inter-user variability. The BN was extended to support on-line and off-line decision-making with respect to treatment plan compliance. Following conceptualisation of the framework, the BN will be quantified. It is anticipated that the finalised decision-making framework will provide a foundation to develop better decision-support strategies and automated correction algorithms for IGRT.

Search for transient ultralight dark matter signatures with networks of precision measurement devices using a Bayesian statistics method

Science.gov (United States)

Roberts, B. M.; Blewitt, G.; Dailey, C.; Derevianko, A.

2018-04-01

We analyze the prospects of employing a distributed global network of precision measurement devices as a dark matter and exotic physics observatory. In particular, we consider the atomic clocks of the global positioning system (GPS), consisting of a constellation of 32 medium-Earth orbit satellites equipped with either Cs or Rb microwave clocks and a number of Earth-based receiver stations, some of which employ highly-stable H-maser atomic clocks. High-accuracy timing data is available for almost two decades. By analyzing the satellite and terrestrial atomic clock data, it is possible to search for transient signatures of exotic physics, such as "clumpy" dark matter and dark energy, effectively transforming the GPS constellation into a 50 000 km aperture sensor array. Here we characterize the noise of the GPS satellite atomic clocks, describe the search method based on Bayesian statistics, and test the method using simulated clock data. We present the projected discovery reach using our method, and demonstrate that it can surpass the existing constrains by several order of magnitude for certain models. Our method is not limited in scope to GPS or atomic clock networks, and can also be applied to other networks of precision measurement devices.

Biobotic insect swarm based sensor networks for search and rescue

Science.gov (United States)

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.

A method of network topology optimization design considering application process characteristic

Science.gov (United States)

Wang, Chunlin; Huang, Ning; Bai, Yanan; Zhang, Shuo

2018-03-01

Communication networks are designed to meet the usage requirements of users for various network applications. The current studies of network topology optimization design mainly considered network traffic, which is the result of network application operation, but not a design element of communication networks. A network application is a procedure of the usage of services by users with some demanded performance requirements, and has obvious process characteristic. In this paper, we first propose a method to optimize the design of communication network topology considering the application process characteristic. Taking the minimum network delay as objective, and the cost of network design and network connective reliability as constraints, an optimization model of network topology design is formulated, and the optimal solution of network topology design is searched by Genetic Algorithm (GA). Furthermore, we investigate the influence of network topology parameter on network delay under the background of multiple process-oriented applications, which can guide the generation of initial population and then improve the efficiency of GA. Numerical simulations show the effectiveness and validity of our proposed method. Network topology optimization design considering applications can improve the reliability of applications, and provide guidance for network builders in the early stage of network design, which is of great significance in engineering practices.

"Multisensory brand search: How the meaning of sounds guides consumers' visual attention": Correction to Knoeferle et al. (2016).

Science.gov (United States)

2017-03-01

Reports an error in "Multisensory brand search: How the meaning of sounds guides consumers' visual attention" by Klemens M. Knoeferle, Pia Knoeferle, Carlos Velasco and Charles Spence ( Journal of Experimental Psychology: Applied , 2016[Jun], Vol 22[2], 196-210). In the article, under Experiment 2, Design and Stimuli, the set number of target products and visual distractors reported in the second paragraph should be 20 and 13, respectively: "On each trial, the 16 products shown in the display were randomly selected from a set of 20 products belonging to different categories. Out of the set of 20 products, seven were potential targets, whereas the other 13 were used as visual distractors only throughout the experiment (since they were not linked to specific usage or consumption sounds)." Consequently, Appendix A in the supplemental materials has been updated. (The following abstract of the original article appeared in record 2016-28876-002.) Building on models of crossmodal attention, the present research proposes that brand search is inherently multisensory, in that the consumers' visual search for a specific brand can be facilitated by semantically related stimuli that are presented in another sensory modality. A series of 5 experiments demonstrates that the presentation of spatially nonpredictive auditory stimuli associated with products (e.g., usage sounds or product-related jingles) can crossmodally facilitate consumers' visual search for, and selection of, products. Eye-tracking data (Experiment 2) revealed that the crossmodal effect of auditory cues on visual search manifested itself not only in RTs, but also in the earliest stages of visual attentional processing, thus suggesting that the semantic information embedded within sounds can modulate the perceptual saliency of the target products' visual representations. Crossmodal facilitation was even observed for newly learnt associations between unfamiliar brands and sonic logos, implicating multisensory short

Da "Search engines" a "Shop engines"

OpenAIRE

Lupi, Mauro

2001-01-01

The change occuring related to “search engines” is going towards e-commerce, transforming all the main search engines into information and commercial suggestion conveying means, basing their businnes on this activity. In a next future we will find two main series of search engines: from one side, the portals that will offer a general orientation guide being convoying means for services and to-buy products; from the other side, vertical portals able to offer information and products on specifi...

A student's guide to searching the literature using online databases

Science.gov (United States)

Miller, Casey W.; Belyea, Dustin; Chabot, Michelle; Messina, Troy

2012-02-01

A method is described to empower students to efficiently perform general and specific literature searches using online resources [Miller et al., Am. J. Phys. 77, 1112 (2009)]. The method was tested on multiple groups, including undergraduate and graduate students with varying backgrounds in scientific literature searches. Students involved in this study showed marked improvement in their awareness of how and where to find scientific information. Repeated exposure to literature searching methods appears worthwhile, starting early in the undergraduate career, and even in graduate school orientation.

Application of neural network to multi-dimensional design window search in reactor core design

International Nuclear Information System (INIS)

Kugo, Teruhiko; Nakagawa, Masayuki

1999-01-01

In the reactor core design, many parametric survey calculations should be carried out to decide an optimal set of basic design parameter values. They consume a large amount of computation time and labor in the conventional way. To support design work, we investigate a procedure to search efficiently a design window, which is defined as feasible design parameter ranges satisfying design criteria and requirements, in a multi-dimensional space composed of several basic design parameters. The present method is applied to the neutronics and thermal hydraulics fields. The principle of the present method is to construct the multilayer neural network to simulate quickly a response of an analysis code through a training process, and to reduce computation time using the neural network without parametric study using analysis codes. To verify the applicability of the present method to the neutronics and the thermal hydraulics design, we have applied it to high conversion water reactors and examined effects of the structure of the neural network and the number of teaching patterns on the accuracy of the design window estimated by the neural network. From the results of the applications, a guideline to apply the present method is proposed and the present method can predict an appropriate design window in a reasonable computation time by following the guideline. (author)

Microsoft Windows 2000 Router Configuration Guide

National Research Council Canada - National Science Library

Richburg, Florence

2001-01-01

The purpose of this guide is to provide technical guidance to network administrators of small to medium size networks in the configuration and integration of Microsoft Windows 2000 Server Router features...

CCNA Cisco Certified Network Associate Deluxe Study Guide

CERN Document Server

Lammle, Todd

2011-01-01

Deluxe Edition of Best-Selling CCNA Study GuideThis comprehensive, enhanced version of the Sybex CCNA Study Guide provides certification candidates with the additional tools they need to prepare for this popular exam. With additional bonus exams and flashcards, as well as the exclusive CCNA Virtual Lab, Platinum Edition, this comprehensive guide has been completely updated to reflect the latest CCNA 640-802 exam. Written by Cisco Authority Todd Lammle, whose straightforward style provides lively examples, hands-on and written labs, easy-to-understand analogies, and real-world scenarios that wi

Using the biological literature a practical guide

CERN Document Server

Schmidt, Diane

2014-01-01

IntroductionSearching the Biological LiteratureGeneral SourcesAssociationsBibliographiesClassification, Nomenclature, and SystematicsDictionaries and EncyclopediasDirectoriesField GuidesSeriesFull-Text SourcesGeneral WorksGuides for young ScientistsGuides to the LiteratureHandbooksHistoriesMathematics and StatisticsMethods and TechniquesTextbooks and TreatisesWriting GuidesPeriodicalsReviews of the LiteratureAbstracts and IndexesBiochemistry and BiophysicsMolecular and Cellular BiologyGenetics, Biotechnology, and Developmental BiologyMicrobiology and ImmunologyEcology, Evolution, and Animal BehaviorPlant BiologyAnatomy and PhysiologyEntomologyZoologyIndex.

Bayesian Networks and Influence Diagrams

DEFF Research Database (Denmark)

Kjærulff, Uffe Bro; Madsen, Anders Læsø

Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis, Second Edition, provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. This new edition contains six new...

Thin Watts-Strogatz networks.

Science.gov (United States)

de Moura, Alessandro P S

2006-01-01

A modified version of the Watts-Strogatz (WS) network model is proposed, in which the number of shortcuts scales with the network size N as Nalpha, with alpha infinity, whereas in the original WS model, this ratio is constant. We call such networks "thin Watts-Strogatz networks." We show that even though the fraction of shortcuts becomes vanishingly small for large networks, they still cause a kind of small-world effect, in the sense that the length L of the network increases sublinearly with the size. We develop a mean-field theory for these networks, which predicts that the length scales as N1-alpha ln N for large N. We also study how a search using only local information works in thin WS networks. We find that the search performance is enhanced compared to the regular network, and we predict that the search time tau scales as N1-alpha/2. These theoretical results are tested using numerical simulations. We comment on the possible relevance of thin WS networks for the design of high-performance low-cost communication networks.

Using Social Media, Online Social Networks, and Internet Search as Platforms for Public Health Interventions: A Pilot Study.

Science.gov (United States)

Huesch, Marco D; Galstyan, Aram; Ong, Michael K; Doctor, Jason N

2016-06-01

To pilot public health interventions at women potentially interested in maternity care via campaigns on social media (Twitter), social networks (Facebook), and online search engines (Google Search). Primary data from Twitter, Facebook, and Google Search on users of these platforms in Los Angeles between March and July 2014. Observational study measuring the responses of targeted users of Twitter, Facebook, and Google Search exposed to our sponsored messages soliciting them to start an engagement process by clicking through to a study website containing information on maternity care quality information for the Los Angeles market. Campaigns reached a little more than 140,000 consumers each day across the three platforms, with a little more than 400 engagements each day. Facebook and Google search had broader reach, better engagement rates, and lower costs than Twitter. Costs to reach 1,000 targeted users were approximately in the same range as less well-targeted radio and TV advertisements, while initial engagements-a user clicking through an advertisement-cost less than $1 each. Our results suggest that commercially available online advertising platforms in wide use by other industries could play a role in targeted public health interventions. © Health Research and Educational Trust.

AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Farzad Kiani

2016-01-01

Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles.

Science.gov (United States)

Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

2016-01-01

Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words.

A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles

Science.gov (United States)

Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

2016-01-01

Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words. PMID:27313605

A Novel Method Using Abstract Convex Underestimation in Ab-Initio Protein Structure Prediction for Guiding Search in Conformational Feature Space.

Science.gov (United States)

Hao, Xiao-Hu; Zhang, Gui-Jun; Zhou, Xiao-Gen; Yu, Xu-Feng

2016-01-01

To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more

Online Information Search Performance and Search Strategies in a Health Problem-Solving Scenario.

Science.gov (United States)

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.

Guidance of visual search by memory and knowledge.

Science.gov (United States)

Hollingworth, Andrew

2012-01-01

To behave intelligently in the world, humans must be able to find objects efficiently within the complex environments they inhabit. A growing proportion of the literature on visual search is devoted to understanding this type of natural search. In the present chapter, I review the literature on visual search through natural scenes, focusing on the role of memory and knowledge in guiding attention to task-relevant objects.

Bayesian Networks and Influence Diagrams

DEFF Research Database (Denmark)

Kjærulff, Uffe Bro; Madsen, Anders Læsø

 Probabilistic networks, also known as Bayesian networks and influence diagrams, have become one of the most promising technologies in the area of applied artificial intelligence, offering intuitive, efficient, and reliable methods for diagnosis, prediction, decision making, classification......, troubleshooting, and data mining under uncertainty. Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. Intended...

Kids Guide to Shots

Science.gov (United States)

... First Aid & Safety Doctors & Hospitals Videos Recipes for Kids Kids site Sitio para niños How the Body ... Safe Videos for Educators Search English Español A Kid's Guide to Shots KidsHealth / For Kids / A Kid's ...

Guide to cleaner coal technology-related web sites

Energy Technology Data Exchange (ETDEWEB)

Davidson, R; Jenkins, N; Zhang, X [IEA Coal Research - The Clean Coal Centre, London (United Kingdom)

2001-07-01

The 'Guide to Cleaner Coal Technology-Related Web Sites' is a guide to web sites that contain important information on cleaner coal technologies (CCT). It contains a short introduction to the World Wide Web and gives advice on how to search for information using directories and search engines. The core section of the Guide is a collection of factsheets summarising the information available on over 65 major web sites selected from organizations worldwide (except those promoting companies). These sites contain a wealth of information on CCT research and development, technology transfer, financing and markets. The factsheets are organised in the following categories. Associations, research centres and programmes; Climate change and sustainable development; Cooperative ventures; Electronic journals; Financial institutions; International organizations; National government information; and Statistical information. A full subject index is provided. The Guide concludes with some general comments on the quality of the sites reviewed.

Handbook of networking & connectivity

CERN Document Server

McClain, Gary R

1994-01-01

Handbook of Networking & Connectivity focuses on connectivity standards in use, including hardware and software options. The book serves as a guide for solving specific problems that arise in designing and maintaining organizational networks.The selection first tackles open systems interconnection, guide to digital communications, and implementing TCP/IP in an SNA environment. Discussions focus on elimination of the SNA backbone, routing SNA over internets, connectionless versus connection-oriented networks, internet concepts, application program interfaces, basic principles of layering, proto

Job Search as Goal-Directed Behavior: Objectives and Methods

Science.gov (United States)

Van Hoye, Greet; Saks, Alan M.

2008-01-01

This study investigated the relationship between job search objectives (finding a new job/turnover, staying aware of job alternatives, developing a professional network, and obtaining leverage against an employer) and job search methods (looking at job ads, visiting job sites, networking, contacting employment agencies, contacting employers, and…

Reducing the network load and optimization of the economic efficiency of CHP plants by forecast-guided control; Verringerung der Netzbelastung und Optimierung der Wirtschaftlichkeit von KWK-Anlagen durch prognosegefuehrte Steuerung

Energy Technology Data Exchange (ETDEWEB)

Glaser, Daniel; Adelhardt, Stefan [Erlangen-Nuernberg Univ., Erlangen (Germany). Lehrstuhl fuer Sensorik; beECO GmbH, Erlangen (Germany)

2012-07-01

Heat-guided combined heat and power (CHP) plants often cause large compensation energy amounts, additional costs to the operator respectively and another burden on the parent network. The balance energy is caused by errors in the production forecast whose quality heavily depends on the heat load performance. This paper identifies the forecasting problems with heat-guided CHP and reveals how the accompanying cost and the network burden can be reduced. This is achieved by an improvement of the forecast in conjunction with a forecast-guided control without affecting the heat supply. In addition, an outlook on further measures to the earnings with the system is presented. (orig.)

Visual search of Mooney faces

Directory of Open Access Journals (Sweden)

Jessica Emeline Goold

2016-02-01

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

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks.

Science.gov (United States)

Han, Yongkoo; Park, Kisung; Hong, Jihye; Ulamin, Noor; Lee, Young-Koo

2015-07-27

The κ-Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors (l-κNN) query, which finds the κ sensor nodes nearest to a query point that are also at or greater distance from each other. The query results indicate the objects nearest to the area of interest that are scattered from each other by at least distance l. The l-κNN query can be used in most κNN applications for the case of well distributed query results. To process an l-κNN query, we must discover all sets of κNN sensor nodes and then find all pairs of sensor nodes in each set that are separated by at least a distance l. Given the limited battery and computing power of sensor nodes, this l-κNN query processing is problematically expensive in terms of energy consumption. In this paper, we propose a greedy approach for l-κNN query processing in mobile sensor networks. The key idea of the proposed approach is to divide the search space into subspaces whose all sides are l. By selecting κ sensor nodes from the other subspaces near the query point, we guarantee accurate query results for l-κNN. In our experiments, we show that the proposed method exhibits superior performance compared with a post-processing based method using the κNN query in terms of energy efficiency, query latency, and accuracy.

Neural Network Control-Based Drive Design of Servomotor and Its Application to Automatic Guided Vehicle

Directory of Open Access Journals (Sweden)

Ming-Shyan Wang

2015-01-01

Full Text Available An automatic guided vehicle (AGV is extensively used for productions in a flexible manufacture system with high efficiency and high flexibility. A servomotor-based AGV is designed and implemented in this paper. In order to steer the AGV to go along a predefined path with corner or arc, the conventional proportional-integral-derivative (PID control is used in the system. However, it is difficult to tune PID gains at various conditions. As a result, the neural network (NN control is considered to assist the PID control for gain tuning. The experimental results are first provided to verify the correctness of the neural network plus PID control for 400 W-motor control system. Secondly, the AGV includes two sets of the designed motor systems and CAN BUS transmission so that it can move along the straight line and curve paths shown in the taped videos.

Optimal Aide Security Information Search (OASIS)

National Research Council Canada - National Science Library

Kapadia, Chetna

2005-01-01

The purpose of the Optimal AIDE Security Information Search (OASIS) effort was to investigate and prototype a tool that can assist the network security analyst in collecting useful information to defend the networks they manage...

The development of organized visual search

Science.gov (United States)

Woods, Adam J.; Goksun, Tilbe; Chatterjee, Anjan; Zelonis, Sarah; Mehta, Anika; Smith, Sabrina E.

2013-01-01

Visual search plays an important role in guiding behavior. Children have more difficulty performing conjunction search tasks than adults. The present research evaluates whether developmental differences in children's ability to organize serial visual search (i.e., search organization skills) contribute to performance limitations in a typical conjunction search task. We evaluated 134 children between the ages of 2 and 17 on separate tasks measuring search for targets defined by a conjunction of features or by distinct features. Our results demonstrated that children organize their visual search better as they get older. As children's skills at organizing visual search improve they become more accurate at locating targets with conjunction of features amongst distractors, but not for targets with distinct features. Developmental limitations in children's abilities to organize their visual search of the environment are an important component of poor conjunction search in young children. In addition, our findings provide preliminary evidence that, like other visuospatial tasks, exposure to reading may influence children's spatial orientation to the visual environment when performing a visual search. PMID:23584560

802.11 Wireless Networks The Definitive Guide

CERN Document Server

Gast, Matthew S

2005-01-01

As we all know by now, wireless networks offer many advantages over fixed (or wired) networks. Foremost on that list is mobility, since going wireless frees you from the tether of an Ethernet cable at a desk. But that's just the tip of the cable-free iceberg. Wireless networks are also more flexible, faster and easier for you to use, and more affordable to deploy and maintain. The de facto standard for wireless networking is the 802.11 protocol, which includes Wi-Fi (the wireless standard known as 802.11b) and its faster cousin, 802.11g. With easy-to-install 802.11 network hardware avail

Diversity-Guided Evolutionary Algorithms

DEFF Research Database (Denmark)

Ursem, Rasmus Kjær

2002-01-01

Population diversity is undoubtably a key issue in the performance of evolutionary algorithms. A common hypothesis is that high diversity is important to avoid premature convergence and to escape local optima. Various diversity measures have been used to analyze algorithms, but so far few...... algorithms have used a measure to guide the search. The diversity-guided evolutionary algorithm (DGEA) uses the wellknown distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection). The DGEA showed remarkable results...

Short guide to SDI profiling at ORNL

Energy Technology Data Exchange (ETDEWEB)

Pomerance, H.S.

1976-06-01

ORNL has machine-searchable data bases that correspond to printed indexes and abstracts. This guide describes the peculiarities of those several data bases and the conventions of the ORNL search system so that users can write their own queries or search profiles and can interpret the part of the output that is encoded.

The job-search grind: perceived progress, self-reactions, and self-regulation of search effort

NARCIS (Netherlands)

Wanberg, C.; Zhu, J.; van Hooft, E.A.J.

2010-01-01

Guided by theory and research on self-regulation and goal pursuit, we offer a framework for studying the dynamics of unemployed individuals’ job search. A daily survey over three weeks demonstrated vacillation in job seeker affect and, to a lesser extent, "reemployment efficacy." Daily perceived job

Penentuan Posisi Hiposenter Gempabumi dengan Menggunakan Metoda Guided Grid Search dan Model Struktur Kecepatan Tiga Dimensi

Directory of Open Access Journals (Sweden)

Hendro Nugroho

2014-04-01

Full Text Available Salah satu penelitian ilmu kebumian yang perlu dilakukan untuk membantu upaya mitigasi bencana gempabumi adalah menentukan pusat gempa dengan presisi tinggi. Dalam hal ini ketelitian sangat diperlukan oleh karena adanya heterogenitas materi bumi yang dilewati gelombang gempa dari hiposenter ke stasiun pencatat. Oleh karena itu dengan bantuan model geotomografi (model struktur 3D kecepatan rambat gelombang gempa diharapkan akan dapat diperoleh posisi sumber gempa yang lebih baik. Untuk studi ini daerah penelitian yang diambil adalah Jawa dan sekitarnya, yaitu : 7° LS - 11° LS dan 105° BT - 114° BT. Data yang digunakan adalah waktu tiba gelombang P dari seismogram yang direkam pada seismograf broadband di Indonesia. Penentuan hiposenter menggunakan metoda guided grid search dengan model kecepatan 3D untuk busur Sunda. Hasil penentuan hiposenter gempa dengan pendekatan ini memberikan tingkat kesalahan yang lebih kecil dibandingkan dengan jika digunakan model kecepatan 1D.

Self-regulation during job search: the opposing effects of employment self-efficacy and job search behavior self-efficacy.

Science.gov (United States)

Liu, Songqi; Wang, Mo; Liao, Hui; Shi, Junqi

2014-11-01

Adopting a self-regulatory perspective, the current study examined the within-person relationships among job search cognitions, job search behaviors, and job search success (i.e., number of job offers received). Specifically, conceptualizing job search behaviors as guided by a hierarchy of means-end (i.e., job search behavior-employment) goal structure, we differentiated employment self-efficacy from job search behavior self-efficacy. Our results showed that higher levels of perceived job search progress could lead to more frequent job search behaviors through enhancing job search behavior self-efficacy. However, higher levels of perceived job search progress could also lead to less frequent job search behaviors through elevating employment self-efficacy. In addition, the relationships between perceived job search progress and efficacy beliefs were moderated by job seekers' level of internal attribution of their progress. Finally, we found that at the within-person level, frequency of job search behaviors was positively related to number of job offers received. These findings were discussed in terms of their theoretical and practical implications. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Learning search-driven application development with SharePoint 2013

CERN Document Server

Tordgeman, Johnny

2013-01-01

A fast paced, practical guide, filled with code examples and demonstrations of enterprise search using SharePoint 2013.This book is written for SharePoint and JavaScript developers who want to get started with SharePoint search and create search-driven applications. The book assumes working knowledge with previous versions of SharePoint and some experience with JavaScript and client side development

Optimal search strategies on complex networks

OpenAIRE

Di Patti, Francesca; Fanelli, Duccio; Piazza, Francesco

2014-01-01

Complex networks are ubiquitous in nature and play a role of paramount importance in many contexts. Internet and the cyberworld, which permeate our everyday life, are self-organized hierarchical graphs. Urban traffic flows on intricate road networks, which impact both transportation design and epidemic control. In the brain, neurons are cabled through heterogeneous connections, which support the propagation of electric signals. In all these cases, the true challenge is to unveil the mechanism...

Search guidance is proportional to the categorical specificity of a target cue.

Science.gov (United States)

Schmidt, Joseph; Zelinsky, Gregory J

2009-10-01

Visual search studies typically assume the availability of precise target information to guide search, often a picture of the exact target. However, search targets in the real world are often defined categorically and with varying degrees of visual specificity. In five target preview conditions we manipulated the availability of target visual information in a search task for common real-world objects. Previews were: a picture of the target, an abstract textual description of the target, a precise textual description, an abstract + colour textual description, or a precise + colour textual description. Guidance generally increased as information was added to the target preview. We conclude that the information used for search guidance need not be limited to a picture of the target. Although generally less precise, to the extent that visual information can be extracted from a target label and loaded into working memory, this information too can be used to guide search.

The Search for Stable, Massive, Elementary Particles

International Nuclear Information System (INIS)

Kim, Peter C.

2001-01-01

In this paper we review the experimental and observational searches for stable, massive, elementary particles other than the electron and proton. The particles may be neutral, may have unit charge or may have fractional charge. They may interact through the strong, electromagnetic, weak or gravitational forces or through some unknown force. The purpose of this review is to provide a guide for future searches--what is known, what is not known, and what appear to be the most fruitful areas for new searches. A variety of experimental and observational methods such as accelerator experiments, cosmic ray studies, searches for exotic particles in bulk matter and searches using astrophysical observations is included in this review

Online Searching at 9600 Baud.

Science.gov (United States)

Scott, Ralph Lee; Scott, Nancy Sue Schell

1991-01-01

Discusses online searching with the new 9600 baud rate and describes test searches on the BRS, Data-Star, LEXIS, and Dow Jones databases through three packet-switching networks: US Sprint, MEADNET, and TYMNET. Hardware and software are described, data communications equipment standards are discussed, and the impact of higher baud rates on pricing…

MS/MS fragmentation-guided search of TMG-chitooligomycins and their structure-activity relationship in specific β-N-acetylglucosaminidase inhibition.

Science.gov (United States)

Usuki, Hirokazu; Yamamoto, Yukihiro; Kumagai, Yuya; Nitoda, Teruhiko; Kanzaki, Hiroshi; Hatanaka, Tadashi

2011-04-21

The reducing tetrasaccharide TMG-chitotriomycin (1) is an inhibitor of β-N-acetylglucosaminidase (GlcNAcase), produced by the actinomycete Streptomyces anulatus NBRC13369. The inhibitor shows a unique inhibitory spectrum, that is, selectivity toward enzymes from chitin-containing organisms such as insects and fungi. Nevertheless, its structure-selectivity relationship remains to be clarified. In this study, we conducted a structure-guided search of analogues of 1 in order to obtain diverse N,N,N-trimethylglucosaminium (TMG)-containing chitooligosaccharides. In this approach, the specific fragmentation profile of 1 on ESI-MS/MS analysis was used for the selective detection of desired compounds. As a result, two new analogues, named TMG-chitomonomycin (3) and TMG-chitobiomycin (2), were obtained from a culture filtrate of 1-producing Streptomyces. Their enzyme-inhibiting activity revealed that the potency and selectivity depended on the degree of polymerization of the reducing end GlcNAc units. Furthermore, a computational modeling study inspired the inhibitory mechanism of TMG-related compounds as a mimic of the substrate in the Michaelis complex of the GH20 enzyme. This study is an example of the successful application of a MS/MS experiment for structure-guided isolation of natural products.

Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

Science.gov (United States)

Zhao, Wei; Tang, Zhenmin; Yang, Yuwang; Wang, Lei; Lan, Shaohua

2014-01-01

This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes' moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties. PMID:24741341

Cooperative Search and Rescue with Artificial Fishes Based on Fish-Swarm Algorithm for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Wei Zhao

2014-01-01

Full Text Available This paper presents a searching control approach for cooperating mobile sensor networks. We use a density function to represent the frequency of distress signals issued by victims. The mobile nodes’ moving in mission space is similar to the behaviors of fish-swarm in water. So, we take the mobile node as artificial fish node and define its operations by a probabilistic model over a limited range. A fish-swarm based algorithm is designed requiring local information at each fish node and maximizing the joint detection probabilities of distress signals. Optimization of formation is also considered for the searching control approach and is optimized by fish-swarm algorithm. Simulation results include two schemes: preset route and random walks, and it is showed that the control scheme has adaptive and effective properties.

Comparison of multiobjective harmony search, cuckoo search and bat-inspired algorithms for renewable distributed generation placement

Directory of Open Access Journals (Sweden)

John E. Candelo-Becerra

2015-07-01

Full Text Available Electric power losses have a significant impact on the total costs of distribution networks. The use of renewable energy sources is a major alternative to improve power losses and costs, although other important issues are also enhanced such as voltage magnitudes and network congestion. However, determining the best location and size of renewable energy generators can be sometimes a challenging task due to a large number of possible combinations in the search space. Furthermore, the multiobjective functions increase the complexity of the problem and metaheuristics are preferred to find solutions in a relatively short time. This paper evaluates the performance of the cuckoo search (CS, harmony search (HS, and bat-inspired (BA algorithms for the location and size of renewable distributed generation (RDG in radial distribution networks using a multiobjective function defined as minimizing the energy losses and the RDG costs. The metaheuristic algorithms were programmed in Matlab and tested using the 33-node radial distribution network. The three algorithms obtained similar results for the two objectives evaluated, finding points close to the best solutions in the Pareto front. Comparisons showed that the CS obtained the minimum results for most points evaluated, but the BA and the HS were close to the best solution.

Welcome to NNIN | National Nanotechnology Infrastructure Network

Science.gov (United States)

Skip to main content National Nanotechnology Infrastructure Network National Nanotechnology Infrastructure Network Serving Nanoscale Science, Engineering & Technology Search form Search Search Home facilities feature over 1100 modern nanotechnology instruments such as these Reactive Ion Etch systems at the

Cryogenic dark matter search (CDMS II): Application of neural networks and wavelets to event analysis

Energy Technology Data Exchange (ETDEWEB)

Attisha, Michael J. [Brown U.

2006-01-01

The Cryogenic Dark Matter Search (CDMS) experiment is designed to search for dark matter in the form of Weakly Interacting Massive Particles (WIMPs) via their elastic scattering interactions with nuclei. This dissertation presents the CDMS detector technology and the commissioning of two towers of detectors at the deep underground site in Soudan, Minnesota. CDMS detectors comprise crystals of Ge and Si at temperatures of 20 mK which provide ~keV energy resolution and the ability to perform particle identification on an event by event basis. Event identification is performed via a two-fold interaction signature; an ionization response and an athermal phonon response. Phonons and charged particles result in electron recoils in the crystal, while neutrons and WIMPs result in nuclear recoils. Since the ionization response is quenched by a factor ~ 3(2) in Ge(Si) for nuclear recoils compared to electron recoils, the relative amplitude of the two detector responses allows discrimination between recoil types. The primary source of background events in CDMS arises from electron recoils in the outer 50 µm of the detector surface which have a reduced ionization response. We develop a quantitative model of this ‘dead layer’ effect and successfully apply the model to Monte Carlo simulation of CDMS calibration data. Analysis of data from the two tower run March-August 2004 is performed, resulting in the world’s most sensitive limits on the spin-independent WIMP-nucleon cross-section, with a 90% C.L. upper limit of 1.6 × 10^-43 cm² on Ge for a 60 GeV WIMP. An approach to performing surface event discrimination using neural networks and wavelets is developed. A Bayesian methodology to classifying surface events using neural networks is found to provide an optimized method based on minimization of the expected dark matter limit. The discrete wavelet analysis of CDMS phonon pulses improves surface event discrimination in conjunction with the neural

HOW DO RADIOLOGISTS USE THE HUMAN SEARCH ENGINE?

Science.gov (United States)

Wolfe, Jeremy M.; Evans, Karla K.; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-01-01

Radiologists perform many ‘visual search tasks’ in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human ‘search engine’ works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? PMID:26656078

How do radiologists use the human search engine?

International Nuclear Information System (INIS)

Wolfe, Jeremy M.; Evans, Karla K.; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-01-01

Radiologists perform many 'visual search tasks' in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human 'search engine' works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? (authors)

Fingerprinting Keywords in Search Queries over Tor

Directory of Open Access Journals (Sweden)

Oh Se Eun

2017-10-01

Full Text Available Search engine queries contain a great deal of private and potentially compromising information about users. One technique to prevent search engines from identifying the source of a query, and Internet service providers (ISPs from identifying the contents of queries is to query the search engine over an anonymous network such as Tor.

Ten guiding principles for youth mental health services.

Science.gov (United States)

Hughes, Frank; Hebel, Lisa; Badcock, Paul; Parker, Alexandra G

2018-06-01

Guiding principles are arguably central to the development of any health service. The aim of this article is to report on the outcomes of a youth mental health (YMH) community of practice (CoP), which identified a range of guiding principles that provide a clear point of comparison for the only other set of principles for YMH service delivery proposed to date. A YMH CoP was established in 2010 as part of the Victorian State Government approach to improving YMH care. An initial literature search was undertaken to locate articles on YMH service delivery. A number of common themes were identified, which the YMH community of practice (YMHCoP) members then elaborated upon by drawing from their collective experience of the YMH sector. The resultant themes were then refined through subsequent group discussions to derive a definitive set of guiding principles. These principles were then augmented by a second literature search conducted in July 2015. Fifteen key themes were derived from the initial literature search and YMH CoP discussions. These were refined by the YMH CoP to produce 10 guiding principles for YMH service development. These are discussed through reference to the relevant literature, using the only other article on principles of YMH service delivery as a notable point of comparison. The 10 principles identified may be useful for quality improvement and are likely to have international relevance. We suggest the timely pursuit of an international consensus on guiding principles for service delivery under the auspices of a peak body for YMH. © 2017 John Wiley & Sons Australia, Ltd.

Guide to Eating for Sports

Medline Plus

Full Text Available ... Answers (Q&A) Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports ... Nondiscrimination Visit the Nemours Web site. Note: All information on TeensHealth® is for educational purposes only. For ...

Guide to Eating for Sports

Medline Plus

Full Text Available ... Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A ... is that eating to reach your peak performance level likely doesn't require a special diet or ...

Interactions of visual odometry and landmark guidance during food search in honeybees

NARCIS (Netherlands)

Vladusich, T; Hemmi, JM; Srinivasan, MV; Zeil, J

How do honeybees use visual odometry and goal-defining landmarks to guide food search? In one experiment, bees were trained to forage in an optic-flow-rich tunnel with a landmark positioned directly above the feeder. Subsequent food-search tests indicated that bees searched much more accurately when

Searching Information Sources in Networks

Science.gov (United States)

2017-06-14

with partial observations,” in AAAI Conference on Artificial Intelligence , 2017. [6] D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small...critical infrastructure of our society. The failure of the power grid network will have catastrophic impacts on water supplies, transportation

A step-by-step guide to systematically identify all relevant animal studies

Science.gov (United States)

Leenaars, Marlies; Hooijmans, Carlijn R; van Veggel, Nieky; ter Riet, Gerben; Leeflang, Mariska; Hooft, Lotty; van der Wilt, Gert Jan; Tillema, Alice; Ritskes-Hoitinga, Merel

2012-01-01

Before starting a new animal experiment, thorough analysis of previously performed experiments is essential from a scientific as well as from an ethical point of view. The method that is most suitable to carry out such a thorough analysis of the literature is a systematic review (SR). An essential first step in an SR is to search and find all potentially relevant studies. It is important to include all available evidence in an SR to minimize bias and reduce hampered interpretation of experimental outcomes. Despite the recent development of search filters to find animal studies in PubMed and EMBASE, searching for all available animal studies remains a challenge. Available guidelines from the clinical field cannot be copied directly to the situation within animal research, and although there are plenty of books and courses on searching the literature, there is no compact guide available to search and find relevant animal studies. Therefore, in order to facilitate a structured, thorough and transparent search for animal studies (in both preclinical and fundamental science), an easy-to-use, step-by-step guide was prepared and optimized using feedback from scientists in the field of animal experimentation. The step-by-step guide will assist scientists in performing a comprehensive literature search and, consequently, improve the scientific quality of the resulting review and prevent unnecessary animal use in the future. PMID:22037056

Classifier-Guided Sampling for Complex Energy System Optimization

Energy Technology Data Exchange (ETDEWEB)

Backlund, Peter B. [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States); Eddy, John P. [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

2015-09-01

This report documents the results of a Laboratory Directed Research and Development (LDRD) effort enti tled "Classifier - Guided Sampling for Complex Energy System Optimization" that was conducted during FY 2014 and FY 2015. The goal of this proj ect was to develop, implement, and test major improvements to the classifier - guided sampling (CGS) algorithm. CGS is type of evolutionary algorithm for perform ing search and optimization over a set of discrete design variables in the face of one or more objective functions. E xisting evolutionary algorithms, such as genetic algorithms , may require a large number of o bjecti ve function evaluations to identify optimal or near - optimal solutions . Reducing the number of evaluations can result in significant time savings, especially if the objective function is computationally expensive. CGS reduce s the evaluation count by us ing a Bayesian network classifier to filter out non - promising candidate designs , prior to evaluation, based on their posterior probabilit ies . In this project, b oth the single - objective and multi - objective version s of the CGS are developed and tested on a set of benchm ark problems. As a domain - specific case study, CGS is used to design a microgrid for use in islanded mode during an extended bulk power grid outage.

Network Partitioning Domain Knowledge Multiobjective Application Mapping for Large-Scale Network-on-Chip

Directory of Open Access Journals (Sweden)

Yin Zhen Tei

2014-01-01

Full Text Available This paper proposes a multiobjective application mapping technique targeted for large-scale network-on-chip (NoC. As the number of intellectual property (IP cores in multiprocessor system-on-chip (MPSoC increases, NoC application mapping to find optimum core-to-topology mapping becomes more challenging. Besides, the conflicting cost and performance trade-off makes multiobjective application mapping techniques even more complex. This paper proposes an application mapping technique that incorporates domain knowledge into genetic algorithm (GA. The initial population of GA is initialized with network partitioning (NP while the crossover operator is guided with knowledge on communication demands. NP reduces the large-scale application mapping complexity and provides GA with a potential mapping search space. The proposed genetic operator is compared with state-of-the-art genetic operators in terms of solution quality. In this work, multiobjective optimization of energy and thermal-balance is considered. Through simulation, knowledge-based initial mapping shows significant improvement in Pareto front compared to random initial mapping that is widely used. The proposed knowledge-based crossover also shows better Pareto front compared to state-of-the-art knowledge-based crossover.

Regulating Search Engines: Taking Stock And Looking Ahead

OpenAIRE

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

Guide to Eating for Sports

Medline Plus

Full Text Available ... Expert Answers (Q&A) Staying Safe Videos for Educators Search English Español A Guide to Eating for ... side effects mentioned above. If a coach, gym teacher, or ... for protecting against stress fractures — is found in dairy foods, such as ...

Fuzzing and Vulnerabilities Search

OpenAIRE

Stanislav Evgenyevich Kirillov; Nikolai Petrovich Lavrentiev

2013-01-01

Fuzzing for vulnerabilities can be very effective if we know the input data format. This work contains description of network message format recovery algorithm and the usage of restored data model in fuzzing and vulnerabilities search.

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

Science.gov (United States)

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

INVESTIGATION OF NEURAL NETWORK ALGORITHM FOR DETECTION OF NETWORK HOST ANOMALIES IN THE AUTOMATED SEARCH FOR XSS VULNERABILITIES AND SQL INJECTIONS

Directory of Open Access Journals (Sweden)

Y. D. Shabalin

2016-03-01

Full Text Available A problem of aberrant behavior detection for network communicating computer is discussed. A novel approach based on dynamic response of computer is introduced. The computer is suggested as a multiple-input multiple-output (MIMO plant. To characterize dynamic response of the computer on incoming requests a correlation between input data rate and observed output response (outgoing data rate and performance metrics is used. To distinguish normal and aberrant behavior of the computer one-class neural network classifieris used. General idea of the algorithm is shortly described. Configuration of network testbed for experiments with real attacks and their detection is presented (the automated search for XSS and SQL injections. Real found-XSS and SQL injection attack software was used to model the intrusion scenario. It would be expectable that aberrant behavior of the server will reveal itself by some instantaneous correlation response which will be significantly different from any of normal ones. It is evident that correlation picture of attacks from different malware running, the site homepage overriding on the server (so called defacing, hardware and software failures will differ from correlation picture of normal functioning. Intrusion detection algorithm is investigated to estimate false positive and false negative rates in relation to algorithm parameters. The importance of correlation width value and threshold value selection was emphasized. False positive rate was estimated along the time series of experimental data. Some ideas about enhancement of the algorithm quality and robustness were mentioned.

On the network-based emulation of human visual search

NARCIS (Netherlands)

Gerrissen, J.F.

1991-01-01

We describe the design of a computer emulator of human visual search. The emulator mechanism is eventually meant to support ergonomic assessment of the effect of display structure and protocol on search performance. As regards target identification and localization, it mimics a number of

Children's sequential information search is sensitive to environmental probabilities.

Science.gov (United States)

Nelson, Jonathan D; Divjak, Bojana; Gudmundsdottir, Gudny; Martignon, Laura F; Meder, Björn

2014-01-01

We investigated 4th-grade children's search strategies on sequential search tasks in which the goal is to identify an unknown target object by asking yes-no questions about its features. We used exhaustive search to identify the most efficient question strategies and evaluated the usefulness of children's questions accordingly. Results show that children have good intuitions regarding questions' usefulness and search adaptively, relative to the statistical structure of the task environment. Search was especially efficient in a task environment that was representative of real-world experiences. This suggests that children may use their knowledge of real-world environmental statistics to guide their search behavior. We also compared different related search tasks. We found positive transfer effects from first doing a number search task on a later person search task. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

CCNA Security Study Guide, Exam 640-553

CERN Document Server

Boyles, Tim

2010-01-01

A complete study guide for the new CCNA Security certification exam. In keeping with its status as the leading publisher of CCNA study guides, Sybex introduces the complete guide to the new CCNA security exam. The CCNA Security certification is the first step towards Cisco's new Cisco Certified Security Professional (CCSP) and Cisco Certified Internetworking Engineer-Security. With a foreword by CCNA networking authority Todd Lammle, CCNA Security Study Guide fully covers every exam objective. The companion CD includes the Sybex Test Engine, flashcards, and a PDF of the book.: The CCNA Securit

Guide to Eating for Sports

Medline Plus

Full Text Available ... A) Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For ... Ditch Dehydration Caffeine Game-Day Eats Print en español Guía de alimentación para deportistas Eat Extra for ...

Eye movements, visual search and scene memory, in an immersive virtual environment.

Directory of Open Access Journals (Sweden)

Dmitry Kit

Full Text Available Visual memory has been demonstrated to play a role in both visual search and attentional prioritization in natural scenes. However, it has been studied predominantly in experimental paradigms using multiple two-dimensional images. Natural experience, however, entails prolonged immersion in a limited number of three-dimensional environments. The goal of the present experiment was to recreate circumstances comparable to natural visual experience in order to evaluate the role of scene memory in guiding eye movements in a natural environment. Subjects performed a continuous visual-search task within an immersive virtual-reality environment over three days. We found that, similar to two-dimensional contexts, viewers rapidly learn the location of objects in the environment over time, and use spatial memory to guide search. Incidental fixations did not provide obvious benefit to subsequent search, suggesting that semantic contextual cues may often be just as efficient, or that many incidentally fixated items are not held in memory in the absence of a specific task. On the third day of the experience in the environment, previous search items changed in color. These items were fixated upon with increased probability relative to control objects, suggesting that memory-guided prioritization (or Surprise may be a robust mechanisms for attracting gaze to novel features of natural environments, in addition to task factors and simple spatial saliency.

Eye movements, visual search and scene memory, in an immersive virtual environment.

Science.gov (United States)

Kit, Dmitry; Katz, Leor; Sullivan, Brian; Snyder, Kat; Ballard, Dana; Hayhoe, Mary

2014-01-01

Visual memory has been demonstrated to play a role in both visual search and attentional prioritization in natural scenes. However, it has been studied predominantly in experimental paradigms using multiple two-dimensional images. Natural experience, however, entails prolonged immersion in a limited number of three-dimensional environments. The goal of the present experiment was to recreate circumstances comparable to natural visual experience in order to evaluate the role of scene memory in guiding eye movements in a natural environment. Subjects performed a continuous visual-search task within an immersive virtual-reality environment over three days. We found that, similar to two-dimensional contexts, viewers rapidly learn the location of objects in the environment over time, and use spatial memory to guide search. Incidental fixations did not provide obvious benefit to subsequent search, suggesting that semantic contextual cues may often be just as efficient, or that many incidentally fixated items are not held in memory in the absence of a specific task. On the third day of the experience in the environment, previous search items changed in color. These items were fixated upon with increased probability relative to control objects, suggesting that memory-guided prioritization (or Surprise) may be a robust mechanisms for attracting gaze to novel features of natural environments, in addition to task factors and simple spatial saliency.

Use of Cognitive and Metacognitive Strategies in Online Search: An Eye-Tracking Study

Science.gov (United States)

Zhou, Mingming; Ren, Jing

2016-01-01

This study used eye-tracking technology to track students' eye movements while searching information on the web. The research question guiding this study was "Do students with different search performance levels have different visual attention distributions while searching information online? If yes, what are the patterns for high and low…

Routine development of objectively derived search strategies

Directory of Open Access Journals (Sweden)

Hausner Elke

2012-02-01

Full Text Available Abstract Background Over the past few years, information retrieval has become more and more professionalized, and information specialists are considered full members of a research team conducting systematic reviews. Research groups preparing systematic reviews and clinical practice guidelines have been the driving force in the development of search strategies, but open questions remain regarding the transparency of the development process and the available resources. An empirically guided approach to the development of a search strategy provides a way to increase transparency and efficiency. Methods Our aim in this paper is to describe the empirically guided development process for search strategies as applied by the German Institute for Quality and Efficiency in Health Care (Institut für Qualität und Wirtschaftlichkeit im Gesundheitswesen, or "IQWiG". This strategy consists of the following steps: generation of a test set, as well as the development, validation and standardized documentation of the search strategy. Results We illustrate our approach by means of an example, that is, a search for literature on brachytherapy in patients with prostate cancer. For this purpose, a test set was generated, including a total of 38 references from 3 systematic reviews. The development set for the generation of the strategy included 25 references. After application of textual analytic procedures, a strategy was developed that included all references in the development set. To test the search strategy on an independent set of references, the remaining 13 references in the test set (the validation set were used. The validation set was also completely identified. Discussion Our conclusion is that an objectively derived approach similar to that used in search filter development is a feasible way to develop and validate reliable search strategies. Besides creating high-quality strategies, the widespread application of this approach will result in a

HOW DO RADIOLOGISTS USE THE HUMAN SEARCH ENGINE?

Science.gov (United States)

Wolfe, Jeremy M; Evans, Karla K; Drew, Trafton; Aizenman, Avigael; Josephs, Emilie

2016-06-01

Radiologists perform many 'visual search tasks' in which they look for one or more instances of one or more types of target item in a medical image (e.g. cancer screening). To understand and improve how radiologists do such tasks, it must be understood how the human 'search engine' works. This article briefly reviews some of the relevant work into this aspect of medical image perception. Questions include how attention and the eyes are guided in radiologic search? How is global (image-wide) information used in search? How might properties of human vision and human cognition lead to errors in radiologic search? © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Fuzzing and Vulnerabilities Search

Directory of Open Access Journals (Sweden)

Stanislav Evgenyevich Kirillov

2013-02-01

Full Text Available Fuzzing for vulnerabilities can be very effective if we know the input data format. This work contains description of network message format recovery algorithm and the usage of restored data model in fuzzing and vulnerabilities search.

Does Contextual Cueing Guide the Deployment of Attention?

OpenAIRE

Kunar, Melina A.; Flusberg, Stephen; Horowitz, Todd S.; Wolfe, Jeremy M.

2007-01-01

Contextual cueing experiments show that when displays are repeated, reaction times (RTs) to find a target decrease over time even when observers are not aware of the repetition. It has been thought that the context of the display guides attention to the target. We tested this hypothesis by comparing the effects of guidance in a standard search task to the effects of contextual cueing. Firstly, in standard search, an improvement in guidance causes search slopes (derived from RT × Set Size func...

Using the Dual-Target Cost to Explore the Nature of Search Target Representations

Science.gov (United States)

Stroud, Michael J.; Menneer, Tamaryn; Cave, Kyle R.; Donnelly, Nick

2012-01-01

Eye movements were monitored to examine search efficiency and infer how color is mentally represented to guide search for multiple targets. Observers located a single color target very efficiently by fixating colors similar to the target. However, simultaneous search for 2 colors produced a dual-target cost. In addition, as the similarity between…

Multisensory brand search: How the meaning of sounds guides consumers' visual attention.

Science.gov (United States)

Knoeferle, Klemens M; Knoeferle, Pia; Velasco, Carlos; Spence, Charles

2016-06-01

Building on models of crossmodal attention, the present research proposes that brand search is inherently multisensory, in that the consumers' visual search for a specific brand can be facilitated by semantically related stimuli that are presented in another sensory modality. A series of 5 experiments demonstrates that the presentation of spatially nonpredictive auditory stimuli associated with products (e.g., usage sounds or product-related jingles) can crossmodally facilitate consumers' visual search for, and selection of, products. Eye-tracking data (Experiment 2) revealed that the crossmodal effect of auditory cues on visual search manifested itself not only in RTs, but also in the earliest stages of visual attentional processing, thus suggesting that the semantic information embedded within sounds can modulate the perceptual saliency of the target products' visual representations. Crossmodal facilitation was even observed for newly learnt associations between unfamiliar brands and sonic logos, implicating multisensory short-term learning in establishing audiovisual semantic associations. The facilitation effect was stronger when searching complex rather than simple visual displays, thus suggesting a modulatory role of perceptual load. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Cisco Networking All-in-One For Dummies

CERN Document Server

Tetz, Edward

2011-01-01

A helpful guide on all things Cisco Do you wish that the complex topics of routers, switches, and networking could be presented in a simple, understandable presentation? With Cisco Networking All-in-One For Dummies, they are! This expansive reference is packed with all the information you need to learn to use Cisco routers and switches to develop and manage secure Cisco networks. This straightforward-by-fun guide offers expansive coverage of Cisco and breaks down intricate subjects such as networking, virtualization, and database technologies into easily digestible pieces. Drills down complex

CCENT study guide exam 100-101 (ICND1)

CERN Document Server

Lammle, Todd

2013-01-01

The latest offering from Cisco Expert Todd Lammle for the New CCENT Certification Written by industry expert and Cisco networking guru, Todd Lammle, CCENT Study Guide improves on the popular Sybex Study Guide approach by providing 100 percent coverage of the ICND1 (#100-101) exam objectives. The book contains detailed information and examples on crucial Cisco networking topics, and provides practical examples and insights drawn from Todd's almost 30 years of real-world experience. You'll also have access to dozens of hands-on labs to get the necessary experience needed to pass

Predicting consumer behavior with Web search.

Science.gov (United States)

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

2010-10-12

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

Visual search in scenes involves selective and non-selective pathways

Science.gov (United States)

Wolfe, Jeremy M; Vo, Melissa L-H; Evans, Karla K; Greene, Michelle R

2010-01-01

How do we find objects in scenes? For decades, visual search models have been built on experiments in which observers search for targets, presented among distractor items, isolated and randomly arranged on blank backgrounds. Are these models relevant to search in continuous scenes? This paper argues that the mechanisms that govern artificial, laboratory search tasks do play a role in visual search in scenes. However, scene-based information is used to guide search in ways that had no place in earlier models. Search in scenes may be best explained by a dual-path model: A “selective” path in which candidate objects must be individually selected for recognition and a “non-selective” path in which information can be extracted from global / statistical information. PMID:21227734

Packet Tracer network simulator

CERN Document Server

Jesin, A

2014-01-01

A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.

In Search of a Network Organization for TNC’s Innovation

DEFF Research Database (Denmark)

Hu, Yimei; Sørensen, Olav Jull

organization among many kinds of innovation networks based on review of relative literatures. Then this paper moves one step further to introduce a network perspective, i.e. network is the context of firms as well as TNCs, and market and hierarchy can be analyzed from a network approach. Further on, this paper......During the past three decades, there are massive researches on innovation networks and network organizations. However, researchers are holding different understandings, some of which even conflict with each other, thus this paper makes an inductive conceptual analysis to clarify what is a network...... discusses the theoretical foundation of network organization, and proposes that since a focal firm has different strength of power in different levels of network, it will have different roles and may not always have the power to “manage” an innovation network....

Nuclear reactors project optimization based on neural network and genetic algorithm; Otimizacao em projetos de reatores nucleares baseada em rede neural e algoritmo genetico

Energy Technology Data Exchange (ETDEWEB)

Pereira, Claudio M.N.A. [Instituto de Engenharia Nuclear (IEN), Rio de Janeiro, RJ (Brazil); Schirru, Roberto; Martinez, Aquilino S. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia

1997-12-01

This work presents a prototype of a system for nuclear reactor core design optimization based on genetic algorithms and artificial neural networks. A neural network is modeled and trained in order to predict the flux and the neutron multiplication factor values based in the enrichment, network pitch and cladding thickness, with average error less than 2%. The values predicted by the neural network are used by a genetic algorithm in this heuristic search, guided by an objective function that rewards the high flux values and penalizes multiplication factors far from the required value. Associating the quick prediction - that may substitute the reactor physics calculation code - with the global optimization capacity of the genetic algorithm, it was obtained a quick and effective system for nuclear reactor core design optimization. (author). 11 refs., 8 figs., 3 tabs.

Combinatorial search from algorithms to systems

CERN Document Server

Hamadi, Youssef

2013-01-01

This book details key techniques in constraint networks, dealing in particular with constraint satisfaction, search, satisfiability, and applications in machine learning and constraint programming. Includes case studies.

Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks

Science.gov (United States)

Akram, Vahid Khalilpour; Dagdeviren, Orhan

2013-01-01

Wireless sensor networks (WSNs) are promising technologies for exploring harsh environments, such as oceans, wild forests, volcanic regions and outer space. Since sensor nodes may have limited transmission range, application packets may be transmitted by multi-hop communication. Thus, connectivity is a very important issue. A bridge is a critical edge whose removal breaks the connectivity of the network. Hence, it is crucial to detect bridges and take preventions. Since sensor nodes are battery-powered, services running on nodes should consume low energy. In this paper, we propose energy-efficient and distributed bridge detection algorithms for WSNs. Our algorithms run single phase and they are integrated with the Breadth-First Search (BFS) algorithm, which is a popular routing algorithm. Our first algorithm is an extended version of Milic's algorithm, which is designed to reduce the message length. Our second algorithm is novel and uses ancestral knowledge to detect bridges. We explain the operation of the algorithms, analyze their proof of correctness, message, time, space and computational complexities. To evaluate practical importance, we provide testbed experiments and extensive simulations. We show that our proposed algorithms provide less resource consumption, and the energy savings of our algorithms are up by 5.5-times. PMID:23845930

Windows 2012 Server network security securing your Windows network systems and infrastructure

CERN Document Server

Rountree, Derrick

2013-01-01

Windows 2012 Server Network Security provides the most in-depth guide to deploying and maintaining a secure Windows network. The book drills down into all the new features of Windows 2012 and provides practical, hands-on methods for securing your Windows systems networks, including: Secure remote access Network vulnerabilities and mitigations DHCP installations configuration MAC filtering DNS server security WINS installation configuration Securing wired and wireless connections Windows personal firewall

A genetic algorithm for optimization of neural network capable of learning to search for food in a maze

Science.gov (United States)

Budilova, E. V.; Terekhin, A. T.; Chepurnov, S. A.

1994-09-01

A hypothetical neural scheme is proposed that ensures efficient decision making by an animal searching for food in a maze. Only the general structure of the network is fixed; its quantitative characteristics are found by numerical optimization that simulates the process of natural selection. Selection is aimed at maximization of the expected number of descendants, which is directly related to the energy stored during the reproductive cycle. The main parameters to be optimized are the increments of the interneuronal links and the working-memory constants.

Home Networking Do-It-Yourself For Dummies

CERN Document Server

Miller, Lawrence C

2011-01-01

Step by step guide to connecting all your electronic devices into one network A home network allows you to share Internet connections, photos, video, music, game consoles, printers, and other electronic gadgets. This do-it-yourself guide shows you step by step how to create a wired or wireless network in your home. In the For Dummies tradition of making technology less intimidating, Home Networking Do-It-Yourself For Dummies breaks down the process into easy steps with clear instructions.Increasing broadband speeds, cellular technology, the explosive growth of iPhone sales, and the new Home Gr

CNN Newsroom Classroom Guides. September 1-30, 1994.

Science.gov (United States)

Cable News Network, Atlanta, GA.

These classroom guides for the daily CNN (Cable News Network) Newsroom broadcasts for the month of August provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Topics covered by the guides include: (1) truce in Northern Ireland, school censorship, scientific method, burial…

The spatially global control of attentional target selection in visual search

OpenAIRE

Berggren, Nick; Jenkins, M.; McCants, C.W.; Eimer, Martin

2017-01-01

Glyn Humphreys and his co-workers have made numerous important theoretical and empirical contributions to research on visual search. They have introduced the concept of attentional target templates and investigated the nature of these templates and how they are involved in the control of search performance. In the experiments reported here, we investigated whether feature-specific search template for particular colours can guide target selection independently for different regions of visual s...

A review of parameters and heuristics for guiding metabolic pathfinding.

Science.gov (United States)

Kim, Sarah M; Peña, Matthew I; Moll, Mark; Bennett, George N; Kavraki, Lydia E

2017-09-15

Recent developments in metabolic engineering have led to the successful biosynthesis of valuable products, such as the precursor of the antimalarial compound, artemisinin, and opioid precursor, thebaine. Synthesizing these traditionally plant-derived compounds in genetically modified yeast cells introduces the possibility of significantly reducing the total time and resources required for their production, and in turn, allows these valuable compounds to become cheaper and more readily available. Most biosynthesis pathways used in metabolic engineering applications have been discovered manually, requiring a tedious search of existing literature and metabolic databases. However, the recent rapid development of available metabolic information has enabled the development of automated approaches for identifying novel pathways. Computer-assisted pathfinding has the potential to save biochemists time in the initial discovery steps of metabolic engineering. In this paper, we review the parameters and heuristics used to guide the search in recent pathfinding algorithms. These parameters and heuristics capture information on the metabolic network structure, compound structures, reaction features, and organism-specificity of pathways. No one metabolic pathfinding algorithm or search parameter stands out as the best to use broadly for solving the pathfinding problem, as each method and parameter has its own strengths and shortcomings. As assisted pathfinding approaches continue to become more sophisticated, the development of better methods for visualizing pathway results and integrating these results into existing metabolic engineering practices is also important for encouraging wider use of these pathfinding methods.

Can mental health interventions change social networks? A systematic review.

Science.gov (United States)

Anderson, Kimberley; Laxhman, Neelam; Priebe, Stefan

2015-11-21

Social networks of patients with psychosis can provide social support, and improve health and social outcomes, including quality of life. However, patients with psychosis often live rather isolated with very limited social networks. Evidence for interventions targeting symptoms or social skills, are largely unsuccessful at improving social networks indirectly. As an alternative, interventions may directly focus on expanding networks. In this systematic review, we assessed what interventions have previously been tested for this and to what extent they have been effective. A systematic review was conducted of randomised controlled trials, testing psychosocial interventions designed to directly increase the social networks of patients with psychosis. Searches of five online databases (PsycINFO, CINAHL, Cochrane Database, MEDLINE, Embase), hand searching of grey literature, and both forward and backward snowballing of key papers were conducted and completed on 12 December 2014. Trial reports were included if they were written in English, the social network size was the primary outcome, participants were ≥ 18 years old and diagnosed with a psychotic disorder. Five studies (n = 631 patients) met the complete inclusion criteria. Studies were from different countries and published since 2008. Four trials had significant positive results, i.e. an observable increase in patients' social network size at the end of the intervention. The interventions included: guided peer support, a volunteer partner scheme, supported engagement in social activity, dog-assisted integrative psychological therapy and psychosocial skills training. Other important elements featured were the presence of a professional, and a focus on friendships and peers outside of services and the immediate family. Despite the small number and heterogeneity of included studies, the results suggest that interventions directly targeting social isolation can be effective and achieve a meaningful increase

Packet Guide to Routing and Switching

CERN Document Server

Hartpence, Bruce

2011-01-01

Go beyond layer 2 broadcast domains with this in-depth tour of advanced link and internetwork layer protocols, and learn how they enable you to expand to larger topologies. An ideal follow-up to Packet Guide to Core Network Protocols, this concise guide dissects several of these protocols to explain their structure and operation. This isn't a book on packet theory. Author Bruce Hartpence built topologies in a lab as he wrote this guide, and each chapter includes several packet captures. You'll learn about protocol classification, static vs. dynamic topologies, and reasons for installing a pa

Utilizing scale-free networks to support the search for scientific publications

NARCIS (Netherlands)

Hauff, C.; Nürnberger, Andreas; de Jong, Franciska M.G.; Kraaij, W.

2006-01-01

When searching for scienti﬿c publications, users today often rely on search engines such as Yahoo.com. Whereas searching for publications whose titles are known is considered to be an easy task, users who are looking for important publications in research ﬿elds they are unfamiliar with face greater

CNN Newsroom Classroom Guides. June 1-30, 1994.

Science.gov (United States)

Cable News Network, Atlanta, GA.

These classroom guides for the daily CNN (Cable News Network) Newsroom broadcasts for the month of June provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Topics covered by the guides include: (1) Congressman Dan Rostenkowski, D-Day, cars and Singapore, Rodney King civil…

Scattering quantum random-walk search with errors

International Nuclear Information System (INIS)

Gabris, A.; Kiss, T.; Jex, I.

2007-01-01

We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value

Nuclear routing networks span between nuclear pore complexes and genomic DNA to guide nucleoplasmic trafficking of biomolecules

Science.gov (United States)

Malecki, Marek; Malecki, Bianca

2012-01-01

In health and disease, biomolecules, which are involved in gene expression, recombination, or reprogramming have to traffic through the nucleoplasm, between nuclear pore complexes (NPCs) and genomic DNA (gDNA). This trafficking is guided by the recently revealed nuclear routing networks (NRNs). In this study, we aimed to investigate, if the NRNs have established associations with the genomic DNA in situ and if the NRNs have capabilities to bind the DNA de novo. Moreover, we aimed to study further, if nucleoplasmic trafficking of the histones, rRNA, and transgenes’ vectors, between the NPCs and gDNA, is guided by the NRNs. We used Xenopus laevis oocytes as the model system. We engineered the transgenes’ DNA vectors equipped with the SV40 LTA nuclear localization signals (NLS) and/or HIV Rev nuclear export signals (NES). We purified histones, 5S rRNA, and gDNA. We rendered all these molecules superparamagnetic and fluorescent for detection with nuclear magnetic resonance (NMR), total reflection x-ray fluorescence (TXRF), energy dispersive x-ray spectroscopy (EDXS), and electron energy loss spectroscopy (EELS). The NRNs span between the NPCs and genomic DNA. They form firm bonds with the gDNA in situ. After complete digestion of the nucleic acids with the RNases and DNases, the newly added DNA - modified with the dNTP analogs, bonds firmly to the NRNs. Moreover, the NRNs guide the trafficking of the DNA transgenes’ vectors - modified with the SV40 LTA NLS, following their import into the nuclei through the NPCs. The pathway is identical to that of histones. The NRNs also guide the trafficking of the DNA transgenes’ vectors, modified with the HIV Rev NES, to the NPCs, followed by their export out of the nuclei. Ribosomal RNAs follow the same pathway. To summarize, the NRNs are the structures connecting the NPCs and the gDNA. They guide the trafficking of the biomolecules between the NPCs and the gDNA. PMID:23275893

Finding electronic information for health policy advocacy: a guide to improving search results.

Science.gov (United States)

Olsan, Tobie H; Bianchi, Carolanne; White, Pamela; Glessner, Theresa; Mapstone, Pamela L

2011-12-01

The success of advanced practice registered nurses' (APRNs') health policy advocacy depends on staying well informed about key issues. Searching for high-quality health policy information, however, can be frustrating and time consuming. Busy clinicians need strategies and tips to reduce information overload and to access synthesized research for evidence-based health policy. This article therefore offers APRNs practical guidelines and resources for searching electronic health policy information. Scholarly databases and Internet sites. Electronic health policy information is generated by a wide variety of public and private organizations and disseminated in hundreds of journals and Web pages. Specialty search tools are needed to retrieve the unindexed gray literature, which includes government documents, agency reports, fact sheets, standards, and statistics not produced by commercial publishers. Further, Internet users need to examine search results with a critical eye for information quality. Expertise in searching electronic health policy information is a prerequisite for developing APRNs' leadership in political arenas to influence health policy and the delivery of healthcare services. ©2011 The Author(s) Journal compilation ©2011 American Academy of Nurse Practitioners.

Search for all d-MPs for all d levels in multistate two-terminal networks

International Nuclear Information System (INIS)

Bai, Guanghan; Zuo, Ming J.; Tian, Zhigang

2015-01-01

A general method for reliability evaluation of multistate network is using minimal path vectors. A minimal path (MP) vector to system state d is called a d-MP. Most reported works on generating d-MPs are for a particular d value. However, if all d-MPs for all possible integer d values are required, we need to call such methods multiple times with respect to all d values. A more efficient method is desirable to generate all d-MPs. In this paper, we develop a recursive algorithm based on breadth-first search to search for all the d-MPs for all possible d values. The relationships among d-MPs for different d levels are revealed. Each d-MP candidate can be generated by a combination of one (d-1)-MP and the vector form of one binary minimal path. Thus, we can use binary MPs as building blocks to generate 2-MP candidates, and use 2-MPs and binary MPs as building blocks to generate 3-MP candidates … and so forth. When the d-MPs with respect to the maximum d value have been found, all the d-MPs for all possible d values are obtained. A heuristic for pre-processing the MPs is proposed to improve the efficiency of the algorithm. Through computational experiments, it is found that the proposed algorithm is more efficient than existing algorithms for finding all d-MPs for all possible d values. In addition, we show that the proposed algorithm can also be used to generate a subset of d-MPs for all or some d values given a subset of MPs. The generated subset of d-MPs can be used for lower reliability bound evaluation. - Highlights: • The relationships among d-MPs for different d levels are revealed. • An efficient algorithm is developed to search for all d-MPs for all d levels. • A heuristic for pre-processing the MPs is proposed to improve the efficiency. • The computational efficiency of the algorithm is investigated. • A method to search for subsets of d-MPs is proposed for reliability bounding

In Search of a Sustainable Economic Development Agenda in ...

African Journals Online (AJOL)

In Search of a Sustainable Economic Development Agenda in Ghana since ... for a sustainable economic development agenda to better the lives of her citizens. ... that could surpass all interests to guide the country‟s development course.

Navigation by anomalous random walks on complex networks.

Science.gov (United States)

Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

2016-11-23

Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.

Navigation by anomalous random walks on complex networks

Science.gov (United States)

Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

2016-11-01

Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.

Gold Wire-networks: Particle Array Guided Evaporation Lithograpy

KAUST Repository

Lone, Saifullah

2015-06-29

We exploited the combination of dry deposition of monolayer of 2D (two dimensional) templates, lift-up transfer of 2D template onto flat surfaces and evaporation lithography [1] to fabricate gold micro- and submicron size wire networks. The approach relies upon the defect free dry deposition of 2D monolayer of latex particles [2] on patterned silicon template and flat PDMS-substrate to create square centered and honey-comb wire networks respectively. The process is followed by lift-up transfer of 2D latex crystal on glass substrate. Subsequently, a small amount of AuNP-suspension is doped on top of the transferred crystal; the suspension is allowed to spread instantaneously and dried at low temperature. The liquid evaporates uniformly to the direction perpendicular to glass substrate. During evaporation, AuNPs are de-wetted along with the movement of liquid to self-assemble in-between the inter-particle spaces and therefore, giving rise to liquid-bridge networks which upon delayed evaporation, transforms into wire networks. The approach is used to fabricate both micro- and submicron wire-networks by simply changing the template dimensions. One of the prime motives behind this study is to down-scale the existing particle array template-based evaporation lithography process to fabricate connected gold wire networks at both micro- and submicron scale. Secondly, the idea of combining the patterned silicon wafer with lifted latex particle template creates an opportunity to clean and res-use the patterned wafer more often and thereby, saving fabrication time and resources. Finally, we illustrated the validity of this approach by creating an easy and high-speed approach to develop gold wire networks on a flexible substrate with a thin deposited adhesive. These advances will not only serve as a platform to scale up the production, but also demonstrated that the fabrication method can produce metallic wire networks of different scale and onto a variety of substrates.

Searching of fuel recharges by means of genetic algorithms and neural networks in BWRs

International Nuclear Information System (INIS)

Ortiz S, J.J.; Montes T, J.L.; Castillo M, J.A.; Perusquia del C, R.

2004-01-01

In this work improvements to the systems RENOR and RECOPIA are presented, that were developed to optimize fuel recharges in boiling water reactors. The RENOR system is based on a Multi state recurrent neural network while RECOPIA is based on a Genetic Algorithm. In the new versions of these systems there is incorporate the execution of the Turned off Margin in Cold and the Excess of Reactivity in Hot. The new systems were applied to an operation cycle of the Unit 1 of the Nuclear Power station of Laguna Verde. The recharges of fuel obtained by both methods are compared among if being observed that RENOR has better performance that RECOPIA, due to the nature of its search process. RECOPIA requires of approximately 1.4 times more time that RENOR to find a satisfactory recharge of fuel. (Author)

Monterey Bay Aquarium Volunteer Guide Scheduling Analysis

Science.gov (United States)

2014-12-01

TERMS 15. NUMBER OF Monterey Bay Aquarium, linear programing, network design, multi commodity flow, resilience PAGES 17. SECURITY 18. SECURITY...Volunteers fill many roles that include Aquarium guides, information desk attendants, divers, and animal caregivers . Julie Packard, Executive Director of...further analyze the resiliency of the shifts to changes in staffing levels caused by no-shows or drop-ins. 3 While the guide program managers have

Beam angle optimization for intensity-modulated radiation therapy using a guided pattern search method

International Nuclear Information System (INIS)

Rocha, Humberto; Dias, Joana M; Ferreira, Brígida C; Lopes, Maria C

2013-01-01

Generally, the inverse planning of radiation therapy consists mainly of the fluence optimization. The beam angle optimization (BAO) in intensity-modulated radiation therapy (IMRT) consists of selecting appropriate radiation incidence directions and may influence the quality of the IMRT plans, both to enhance better organ sparing and to improve tumor coverage. However, in clinical practice, most of the time, beam directions continue to be manually selected by the treatment planner without objective and rigorous criteria. The goal of this paper is to introduce a novel approach that uses beam’s-eye-view dose ray tracing metrics within a pattern search method framework in the optimization of the highly non-convex BAO problem. Pattern search methods are derivative-free optimization methods that require a few function evaluations to progress and converge and have the ability to better avoid local entrapment. The pattern search method framework is composed of a search step and a poll step at each iteration. The poll step performs a local search in a mesh neighborhood and ensures the convergence to a local minimizer or stationary point. The search step provides the flexibility for a global search since it allows searches away from the neighborhood of the current iterate. Beam’s-eye-view dose metrics assign a score to each radiation beam direction and can be used within the pattern search framework furnishing a priori knowledge of the problem so that directions with larger dosimetric scores are tested first. A set of clinical cases of head-and-neck tumors treated at the Portuguese Institute of Oncology of Coimbra is used to discuss the potential of this approach in the optimization of the BAO problem. (paper)

PubData: search engine for bioinformatics databases worldwide

OpenAIRE

Vand, Kasra; Wahlestedt, Thor; Khomtchouk, Kelly; Sayed, Mohammed; Wahlestedt, Claes; Khomtchouk, Bohdan

2016-01-01

We propose a search engine and file retrieval system for all bioinformatics databases worldwide. PubData searches biomedical data in a user-friendly fashion similar to how PubMed searches biomedical literature. PubData is built on novel network programming, natural language processing, and artificial intelligence algorithms that can patch into the file transfer protocol servers of any user-specified bioinformatics database, query its contents, retrieve files for download, and adapt to the use...

Wireless sensor network topology control

OpenAIRE

Zuk, Olexandr; Romanjuk, Valeriy; Sova, Oleg

2010-01-01

Topology control process for the wireless sensor network is considered. In this article the use of rule base for making decision on the search of optimum network topology is offered for the realization of different aims of network management.

Histopathological Breast Cancer Image Classification by Deep Neural Network Techniques Guided by Local Clustering.

Science.gov (United States)

Nahid, Abdullah-Al; Mehrabi, Mohamad Ali; Kong, Yinan

2018-01-01

Breast Cancer is a serious threat and one of the largest causes of death of women throughout the world. The identification of cancer largely depends on digital biomedical photography analysis such as histopathological images by doctors and physicians. Analyzing histopathological images is a nontrivial task, and decisions from investigation of these kinds of images always require specialised knowledge. However, Computer Aided Diagnosis (CAD) techniques can help the doctor make more reliable decisions. The state-of-the-art Deep Neural Network (DNN) has been recently introduced for biomedical image analysis. Normally each image contains structural and statistical information. This paper classifies a set of biomedical breast cancer images (BreakHis dataset) using novel DNN techniques guided by structural and statistical information derived from the images. Specifically a Convolutional Neural Network (CNN), a Long-Short-Term-Memory (LSTM), and a combination of CNN and LSTM are proposed for breast cancer image classification. Softmax and Support Vector Machine (SVM) layers have been used for the decision-making stage after extracting features utilising the proposed novel DNN models. In this experiment the best Accuracy value of 91.00% is achieved on the 200x dataset, the best Precision value 96.00% is achieved on the 40x dataset, and the best F -Measure value is achieved on both the 40x and 100x datasets.

Memory and visual search in naturalistic 2D and 3D environments.

Science.gov (United States)

Li, Chia-Ling; Aivar, M Pilar; Kit, Dmitry M; Tong, Matthew H; Hayhoe, Mary M

2016-06-01

The role of memory in guiding attention allocation in daily behaviors is not well understood. In experiments with two-dimensional (2D) images, there is mixed evidence about the importance of memory. Because the stimulus context in laboratory experiments and daily behaviors differs extensively, we investigated the role of memory in visual search, in both two-dimensional (2D) and three-dimensional (3D) environments. A 3D immersive virtual apartment composed of two rooms was created, and a parallel 2D visual search experiment composed of snapshots from the 3D environment was developed. Eye movements were tracked in both experiments. Repeated searches for geometric objects were performed to assess the role of spatial memory. Subsequently, subjects searched for realistic context objects to test for incidental learning. Our results show that subjects learned the room-target associations in 3D but less so in 2D. Gaze was increasingly restricted to relevant regions of the room with experience in both settings. Search for local contextual objects, however, was not facilitated by early experience. Incidental fixations to context objects do not necessarily benefit search performance. Together, these results demonstrate that memory for global aspects of the environment guides search by restricting allocation of attention to likely regions, whereas task relevance determines what is learned from the active search experience. Behaviors in 2D and 3D environments are comparable, although there is greater use of memory in 3D.

Developing a Grid-based search and categorization tool

CERN Document Server

Haya, Glenn; Vigen, Jens

2003-01-01

Grid technology has the potential to improve the accessibility of digital libraries. The participants in Project GRACE (Grid Search And Categorization Engine) are in the process of developing a search engine that will allow users to search through heterogeneous resources stored in geographically distributed digital collections. What differentiates this project from current search tools is that GRACE will be run on the European Data Grid, a large distributed network, and will not have a single centralized index as current web search engines do. In some cases, the distributed approach offers advantages over the centralized approach since it is more scalable, can be used on otherwise inaccessible material, and can provide advanced search options customized for each data source.

Optimal Fungal Space Searching Algorithms.

Science.gov (United States)

Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V

2016-10-01

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

Networking CD-ROMs: The Decision Maker's Guide to Local Area Network Solutions.

Science.gov (United States)

Elshami, Ahmed M.

In an era when patrons want access to CD-ROM resources but few libraries can afford to buy multiple copies, CD-ROM local area networks (LANs) are emerging as a cost-effective way to provide shared access. To help librarians make informed decisions, this manual offers information on: (1) the basics of LANs, a "local area network primer";…

Hippocampal gamma-band Synchrony and pupillary responses index memory during visual search.

Science.gov (United States)

Montefusco-Siegmund, Rodrigo; Leonard, Timothy K; Hoffman, Kari L

2017-04-01

Memory for scenes is supported by the hippocampus, among other interconnected structures, but the neural mechanisms related to this process are not well understood. To assess the role of the hippocampus in memory-guided scene search, we recorded local field potentials and multiunit activity from the hippocampus of macaques as they performed goal-directed search tasks using natural scenes. We additionally measured pupil size during scene presentation, which in humans is modulated by recognition memory. We found that both pupil dilation and search efficiency accompanied scene repetition, thereby indicating memory for scenes. Neural correlates included a brief increase in hippocampal multiunit activity and a sustained synchronization of unit activity to gamma band oscillations (50-70 Hz). The repetition effects on hippocampal gamma synchronization occurred when pupils were most dilated, suggesting an interaction between aroused, attentive processing and hippocampal correlates of recognition memory. These results suggest that the hippocampus may support memory-guided visual search through enhanced local gamma synchrony. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

The roles of non-retinotopic motions in visual search

Directory of Open Access Journals (Sweden)

Ryohei eNakayama

2016-06-01

Full Text Available In visual search, a moving target among stationary distracters is detected more rapidly and more efficiently than a static target among moving distracters. Here we examined how this search asymmetry depends on motion signals from three distinct coordinate system – retinal, relative, and spatiotopic (head/body-centered. Our search display consisted of a target element, distracters elements, and a fixation point tracked by observers. Each element was composed of a spatial carrier grating windowed by a Gaussian envelope, and the motions of carriers, windows, and fixation were manipulated independently and used in various combinations to decouple the respective effects of motion coordinates systems on visual search asymmetry. We found that retinal motion hardly contributes to reaction times and search slopes but that relative and spatiotopic motions contribute to them substantially. Results highlight the important roles of non-retinotopic motions for guiding observer attention in visual search.

Action Search: Learning to Search for Human Activities in Untrimmed Videos

KAUST Repository

Alwassel, Humam

2017-06-13

Traditional approaches for action detection use trimmed data to learn sophisticated action detector models. Although these methods have achieved great success at detecting human actions, we argue that huge information is discarded when ignoring the process, through which this trimmed data is obtained. In this paper, we propose Action Search, a novel approach that mimics the way people annotate activities in video sequences. Using a Recurrent Neural Network, Action Search can efficiently explore a video and determine the time boundaries during which an action occurs. Experiments on the THUMOS14 dataset reveal that our model is not only able to explore the video efficiently but also accurately find human activities, outperforming state-of-the-art methods.

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

Science.gov (United States)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

Elevated Body Mass Index is Associated with Increased Integration and Reduced Cohesion of Sensory-Driven and Internally Guided Resting-State Functional Brain Networks.

Science.gov (United States)

Doucet, Gaelle E; Rasgon, Natalie; McEwen, Bruce S; Micali, Nadia; Frangou, Sophia

2018-03-01

Elevated body mass index (BMI) is associated with increased multi-morbidity and mortality. The investigation of the relationship between BMI and brain organization has the potential to provide new insights relevant to clinical and policy strategies for weight control. Here, we quantified the association between increasing BMI and the functional organization of resting-state brain networks in a sample of 496 healthy individuals that were studied as part of the Human Connectome Project. We demonstrated that higher BMI was associated with changes in the functional connectivity of the default-mode network (DMN), central executive network (CEN), sensorimotor network (SMN), visual network (VN), and their constituent modules. In siblings discordant for obesity, we showed that person-specific factors contributing to obesity are linked to reduced cohesiveness of the sensory networks (SMN and VN). We conclude that higher BMI is associated with widespread alterations in brain networks that balance sensory-driven (SMN, VN) and internally guided (DMN, CEN) states which may augment sensory-driven behavior leading to overeating and subsequent weight gain. Our results provide a neurobiological context for understanding the association between BMI and brain functional organization while accounting for familial and person-specific influences. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Realistic searches on stretched exponential networks

Indian Academy of Sciences (India)

simulations on real networks [7–9] have been made also. In these studies, one is interested in the length of the dynamic paths, i.e., the number of steps actually taken to transmit a message or signal to another node. In the real experiments, this is done by fixing a target node and randomly selecting source nodes. The.

Active Path Planning for Drones in Object Search

OpenAIRE

Wang, Zeyangyi

2017-01-01

Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...

Evidence for negative feature guidance in visual search is explained by spatial recoding.

Science.gov (United States)

Beck, Valerie M; Hollingworth, Andrew

2015-10-01

Theories of attention and visual search explain how attention is guided toward objects with known target features. But can attention be directed away from objects with a feature known to be associated only with distractors? Most studies have found that the demand to maintain the to-be-avoided feature in visual working memory biases attention toward matching objects rather than away from them. In contrast, Arita, Carlisle, and Woodman (2012) claimed that attention can be configured to selectively avoid objects that match a cued distractor color, and they reported evidence that this type of negative cue generates search benefits. However, the colors of the search array items in Arita et al. (2012) were segregated by hemifield (e.g., blue items on the left, red on the right), which allowed for a strategy of translating the feature-cue information into a simple spatial template (e.g., avoid right, or attend left). In the present study, we replicated the negative cue benefit using the Arita et al. (2012), method (albeit within a subset of participants who reliably used the color cues to guide attention). Then, we eliminated the benefit by using search arrays that could not be grouped by hemifield. Our results suggest that feature-guided avoidance is implemented only indirectly, in this case by translating feature-cue information into a spatial template. (c) 2015 APA, all rights reserved).

Effects of Pre-Purchase Search Motivation on User Attitudes toward Online Social Network Advertising: A Case of University Students

Directory of Open Access Journals (Sweden)

Imran A Mir

2014-06-01

Full Text Available Since last few years, social media have profoundly changed the ways of social and business communication. Particularly, social network sites (SNSs have rapidly grown in popularity and number of users globally. They have become the main place for social interaction, discussion and communication. Today, businesses of various types use SNSs for commercial communication. Banner advertising is one of the common methods of commercial communication on SNSs. Advertising is a key source of revenue for many SNSs firms such as Facebook. In fact, the existence of many SNSs owners and advertisers is contingent upon the success of social network advertising (SNA. Users demand free SNS services which makes SNA crucial for SNSs firms. SNA can be effective only if it is aligned with user motivations. Marketing literature identifies pre-purchase search as a primary consumer motivation for using media. The current study aims to identify the effects of pre-purchase search motivation (PSM on user attitudes toward SNA. It also assesses the association between the attitudes toward SNA and users’ banner ad-clicking behavior on SNSs. Data was gathered from 200 university students in Islamabad using offline survey. Results show positive effects of PSM on user attitudes toward SNA. They also show positive association between user attitudes toward SNA and their SNS banner ad-clicking behavior. The firms which promote their products through SNSs to the young South Asian consumers may benefit from the findings of the current study.

Searching for Heavy Photons with Detached Verices in the Heavy Photon Search Experiment

Energy Technology Data Exchange (ETDEWEB)

Szumila-Vance, Holly [Old Dominion Univ., Norfolk, VA (United States); Thomas Jefferson National Accelerator Facility (TJNAF), Newport News, VA (United States)

2017-08-01

The Jefferson Lab Heavy Photon Search (HPS) experiment is searching for a hypothetical massive particle called the heavy photon which could mediate a dark electromagnetic-type force. If heavy photons kinetically mix with Standard Model photons, they may be radiated by electrons scattering from a heavy nucleus and then decay to e+e- pairs. HPS uniquely searches for heavy photons that either decay at the target or a measurable distance after. The experiment utilizes a silicon vertex tracker (SVT) for momentum and vertex reconstruction, together with an electromagnetic calorimeter for measuring particle energies and triggering events. The HPS experiment took its first data during the spring 2015 engineering run using a 1 GeV electron beam incident on a tungsten target and its second data in the spring of 2016 at a beam energy of 2.3 GeV. The 2015 run obtained two days of production data that was used for the first physics results. The analysis of the data was conducted as a blinded analysis by tuning cuts on 10% of the data. This dissertation discusses the displaced vertex search for heavy photons in the 2015 engineering run. It describes the theoretical motivation for looking for heavy photons and provides an overview of the HPS experimental design and performance. The performance details of the experiment are primarily derived from the 2015 engineering run with some discussion from the higher energy running in 2016. This dissertation further discusses the cuts used to optimize the displaced vertex search and the results of the search. The displaced vertex search did not set a limit on the heavy photon but did validate the methodology for conducting the search. Finally, we used the full data set to make projections and guide future analyses.

A Tourism e-Guide System Using Mobile Integration

OpenAIRE

Emad M. Abuelrub; Hanan M. Solaiman

2010-01-01

This paper presents a tourism e-guide system via mobile integration using offloading while enjoying mobility. A user can search for new mobile services available on the website to use either remotely on the server where the services resides, or locally after downloading them to his/her mobile device and work offline without a mobile connection. Jordan Tourism e-Guide System (JTeGS) aims to help the user/tourist accessing the tourism information directly from his/her smart device, anytime and ...

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

Efficient Bandwidth Management for Ethernet Passive Optical Networks

KAUST Repository

Elrasad, Amr

2016-01-01

The increasing bandwidth demands in access networks motivates network operators, networking devices manufacturers, and standardization institutions to search for new approaches for access networks. These approaches should support higher bandwidth

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

Energy Technology Data Exchange (ETDEWEB)

2016-11-04

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components are written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.

A stochastic learning algorithm for layered neural networks

International Nuclear Information System (INIS)

Bartlett, E.B.; Uhrig, R.E.

1992-01-01

The random optimization method typically uses a Gaussian probability density function (PDF) to generate a random search vector. In this paper the random search technique is applied to the neural network training problem and is modified to dynamically seek out the optimal probability density function (OPDF) from which to select the search vector. The dynamic OPDF search process, combined with an auto-adaptive stratified sampling technique and a dynamic node architecture (DNA) learning scheme, completes the modifications of the basic method. The DNA technique determines the appropriate number of hidden nodes needed for a given training problem. By using DNA, researchers do not have to set the neural network architectures before training is initiated. The approach is applied to networks of generalized, fully interconnected, continuous perceptions. Computer simulation results are given

ROS-IGTL-Bridge: an open network interface for image-guided therapy using the ROS environment.

Science.gov (United States)

Frank, Tobias; Krieger, Axel; Leonard, Simon; Patel, Niravkumar A; Tokuda, Junichi

2017-08-01

With the growing interest in advanced image-guidance for surgical robot systems, rapid integration and testing of robotic devices and medical image computing software are becoming essential in the research and development. Maximizing the use of existing engineering resources built on widely accepted platforms in different fields, such as robot operating system (ROS) in robotics and 3D Slicer in medical image computing could simplify these tasks. We propose a new open network bridge interface integrated in ROS to ensure seamless cross-platform data sharing. A ROS node named ROS-IGTL-Bridge was implemented. It establishes a TCP/IP network connection between the ROS environment and external medical image computing software using the OpenIGTLink protocol. The node exports ROS messages to the external software over the network and vice versa simultaneously, allowing seamless and transparent data sharing between the ROS-based devices and the medical image computing platforms. Performance tests demonstrated that the bridge could stream transforms, strings, points, and images at 30 fps in both directions successfully. The data transfer latency was bridge could achieve 900 fps for transforms. Additionally, the bridge was demonstrated in two representative systems: a mock image-guided surgical robot setup consisting of 3D slicer, and Lego Mindstorms with ROS as a prototyping and educational platform for IGT research; and the smart tissue autonomous robot surgical setup with 3D Slicer. The study demonstrated that the bridge enabled cross-platform data sharing between ROS and medical image computing software. This will allow rapid and seamless integration of advanced image-based planning/navigation offered by the medical image computing software such as 3D Slicer into ROS-based surgical robot systems.

Processing system of jaws tomograms for pathology identification and surgical guide modeling

Energy Technology Data Exchange (ETDEWEB)

Putrik, M. B., E-mail: pmb-88@mail.ru; Ivanov, V. Yu. [Ural Federal University named after the first President of Russia B.N. Yeltsin, Yekaterinburg (Russian Federation); Lavrentyeva, Yu. E. [Private dental clinic «Uraldent», Yekaterinburg (Russian Federation)

2015-11-17

The aim of the study is to create an image processing system, which allows dentists to find pathological resorption and to build surgical guide surface automatically. X-rays images of jaws from cone beam tomography or spiral computed tomography are the initial data for processing. One patient’s examination always includes up to 600 images (or tomograms), that’s why the development of processing system for fast automation search of pathologies is necessary. X-rays images can be useful not for only illness diagnostic but for treatment planning too. We have studied the case of dental implantation – for successful surgical manipulations surgical guides are used. We have created a processing system that automatically builds jaw and teeth boundaries on the x-ray image. After this step, obtained teeth boundaries used for surgical guide surface modeling and jaw boundaries limit the area for further pathologies search. Criterion for the presence of pathological resorption zones inside the limited area is based on statistical investigation. After described actions, it is possible to manufacture surgical guide using 3D printer and apply it in surgical operation.

Processing system of jaws tomograms for pathology identification and surgical guide modeling

International Nuclear Information System (INIS)

Putrik, M. B.; Ivanov, V. Yu.; Lavrentyeva, Yu. E.

2015-01-01

The aim of the study is to create an image processing system, which allows dentists to find pathological resorption and to build surgical guide surface automatically. X-rays images of jaws from cone beam tomography or spiral computed tomography are the initial data for processing. One patient’s examination always includes up to 600 images (or tomograms), that’s why the development of processing system for fast automation search of pathologies is necessary. X-rays images can be useful not for only illness diagnostic but for treatment planning too. We have studied the case of dental implantation – for successful surgical manipulations surgical guides are used. We have created a processing system that automatically builds jaw and teeth boundaries on the x-ray image. After this step, obtained teeth boundaries used for surgical guide surface modeling and jaw boundaries limit the area for further pathologies search. Criterion for the presence of pathological resorption zones inside the limited area is based on statistical investigation. After described actions, it is possible to manufacture surgical guide using 3D printer and apply it in surgical operation

A Lifelog Browser for Visualization and Search of Mobile Everyday-Life

Directory of Open Access Journals (Sweden)

Keum-Sung Hwang

2014-01-01

Full Text Available Mobile devices can now handle a great deal of information thanks to the convergence of diverse functionalities. Mobile environments have already shown great potential in terms of providing customized service to users because they can record meaningful and private information continually for long periods of time. The research for understanding, searching and summarizing the everyday-life of human has received increasing attention in recent years due to the digital convergence. In this paper, we propose a mobile life browser, which visualizes and searches human's mobile life based on the contents and context of lifelog data. The mobile life browser is for searching the personal information effectively collected on his/her mobile device and for supporting the concept-based searching method by using concept networks and Bayesian networks. In the experiments, we collected the real mobile log data from three users for a month and visualized the mobile lives of the users with the mobile life browser developed. Some tests on searching tasks confirmed that the result using the proposed concept-based searching method is promising.

Site-dependent effects of tDCS uncover dissociations in the communication network underlying the processing of visual search.

Science.gov (United States)

Ball, Keira; Lane, Alison R; Smith, Daniel T; Ellison, Amanda

2013-11-01

The right posterior parietal cortex (rPPC) and the right frontal eye field (rFEF) form part of a network of brain areas involved in orienting spatial attention. Previous studies using transcranial magnetic stimulation (TMS) have demonstrated that both areas are critically involved in the processing of conjunction visual search tasks, since stimulation of these sites disrupts performance. This study investigated the effects of long term neuronal modulation to rPPC and rFEF using transcranial direct current stimulation (tDCS) with the aim of uncovering sharing of these resources in the processing of conjunction visual search tasks. Participants completed four blocks of conjunction search trials over the course of 45 min. Following the first block they received 15 min of either cathodal or anodal stimulation to rPPC or rFEF, or sham stimulation. A significant interaction between block and stimulation condition was found, indicating that tDCS caused different effects according to the site (rPPC or rFEF) and type of stimulation (cathodal, anodal, or sham). Practice resulted in a significant reduction in reaction time across the four blocks in all conditions except when cathodal tDCS was applied to rPPC. The effects of cathodal tDCS over rPPC are subtler than those seen with TMS, and no effect of tDCS was evident at rFEF. This suggests that rFEF has a more transient role than rPPC in the processing of conjunction visual search and is robust to longer-term methods of neuro-disruption. Our results may be explained within the framework of functional connectivity between these, and other, areas. Copyright © 2013 Elsevier Inc. All rights reserved.

Visual search in barn owls: Task difficulty and saccadic behavior.

Science.gov (United States)

Orlowski, Julius; Ben-Shahar, Ohad; Wagner, Hermann

2018-01-01

How do we find what we are looking for? A target can be in plain view, but it may be detected only after extensive search. During a search we make directed attentional deployments like saccades to segment the scene until we detect the target. Depending on difficulty, the search may be fast with few attentional deployments or slow with many, shorter deployments. Here we study visual search in barn owls by tracking their overt attentional deployments-that is, their head movements-with a camera. We conducted a low-contrast feature search, a high-contrast orientation conjunction search, and a low-contrast orientation conjunction search, each with set sizes varying from 16 to 64 items. The barn owls were able to learn all of these tasks and showed serial search behavior. In a subsequent step, we analyzed how search behavior of owls changes with search complexity. We compared the search mechanisms in these three serial searches with results from pop-out searches our group had reported earlier. Saccade amplitude shortened and fixation duration increased in difficult searches. Also, in conjunction search saccades were guided toward items with shared target features. These data suggest that during visual search, barn owls utilize mechanisms similar to those that humans use.

Heuristic Artificial Bee Colony Algorithm for Uncovering Community in Complex Networks

Directory of Open Access Journals (Sweden)

Yuquan Guo

2017-01-01

Full Text Available Community structure is important for us to understand the functions and structure of the complex networks. In this paper, Heuristic Artificial Bee Colony (HABC algorithm based on swarm intelligence is proposed for uncovering community. The proposed HABC includes initialization, employed bee searching, onlooker searching, and scout bee searching. In initialization stage, the nectar sources with simple community structure are generated through network dynamic algorithm associated with complete subgraph. In employed bee searching and onlooker searching stages, the searching function is redefined to address the community problem. The efficiency of searching progress can be improved by a heuristic function which is an average agglomerate probability of two neighbor communities. Experiments are carried out on artificial and real world networks, and the results demonstrate that HABC will have better performance in terms of comparing with the state-of-the-art algorithms.

[Systematic literature search in PubMed : A short introduction].

Science.gov (United States)

Blümle, A; Lagrèze, W A; Motschall, E

2018-03-01

In order to identify current (and relevant) evidence for a specific clinical question within the unmanageable amount of information available, solid skills in performing a systematic literature search are essential. An efficient approach is to search a biomedical database containing relevant literature citations of study reports. The best known database is MEDLINE, which is searchable for free via the PubMed interface. In this article, we explain step by step how to perform a systematic literature search via PubMed by means of an example research question in the field of ophthalmology. First, we demonstrate how to translate the clinical problem into a well-framed and searchable research question, how to identify relevant search terms and how to conduct a text word search and a search with keywords in medical subject headings (MeSH) terms. We then show how to limit the number of search results if the search yields too many irrelevant hits and how to increase the number in the case of too few citations. Finally, we summarize all essential principles that guide a literature search via PubMed.

Cover times of random searches

Science.gov (United States)

Chupeau, Marie; Bénichou, Olivier; Voituriez, Raphaël

2015-10-01

How long must one undertake a random search to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not only the discovery of a single target. Examples range from immune-system cells chasing pathogens to animals harvesting resources, from robotic exploration for cleaning or demining to the task of improving search algorithms. Despite its broad relevance, the cover time has remained elusive and so far explicit results have been scarce and mostly limited to regular random walks. Here we determine the full distribution of the cover time for a broad range of random search processes, including Lévy strategies, intermittent strategies, persistent random walks and random walks on complex networks, and reveal its universal features. We show that for all these examples the mean cover time can be minimized, and that the corresponding optimal strategies also minimize the mean search time for a single target, unambiguously pointing towards their robustness.

The Interplay of Episodic and Semantic Memory in Guiding Repeated Search in Scenes

Science.gov (United States)

Vo, Melissa L.-H.; Wolfe, Jeremy M.

2013-01-01

It seems intuitive to think that previous exposure or interaction with an environment should make it easier to search through it and, no doubt, this is true in many real-world situations. However, in a recent study, we demonstrated that previous exposure to a scene does not necessarily speed search within that scene. For instance, when observers…

Network Warrior

CERN Document Server

Donahue, Gary

2011-01-01

Pick up where certification exams leave off. With this practical, in-depth guide to the entire network infrastructure, you'll learn how to deal with real Cisco networks, rather than the hypothetical situations presented on exams like the CCNA. Network Warrior takes you step by step through the world of routers, switches, firewalls, and other technologies based on the author's extensive field experience. You'll find new content for MPLS, IPv6, VoIP, and wireless in this completely revised second edition, along with examples of Cisco Nexus 5000 and 7000 switches throughout. Topics include: An

Synapse:neural network for predict power consumption: users guide

Energy Technology Data Exchange (ETDEWEB)

Muller, C; Mangeas, M; Perrot, N

1994-08-01

SYNAPSE is forecasting tool designed to predict power consumption in metropolitan France on the half hour time scale. Some characteristics distinguish this forecasting model from those which already exist. In particular, it is composed of numerous neural networks. The idea for using many neural networks arises from past tests. These tests showed us that a single neural network is not able to solve the problem correctly. From this result, we decided to perform unsupervised classification of the 24 consumption curves. From this classification, six classes appeared, linked with the weekdays: Mondays, Tuesdays, Wednesdays, Thursdays, Fridays, Saturdays, Sundays, holidays and bridge days. For each class and for each half hour, two multilayer perceptrons are built. The two of them forecast the power for one particular half hour, and for a day including one of the determined class. The input of these two network are different: the first one (short time forecasting) includes the powers for the most recent half hour and relative power of the previous day; the second (medium time forecasting) includes only the relative power of the previous day. A process connects the results of every networks and allows one to forecast more than one half-hour in advance. In this process, short time forecasting networks and medium time forecasting networks are used differently. The first kind of neural networks gives good results on the scale of one day. The second one gives good forecasts for the next predicted powers. In this note, the organization of the SYNAPSE program is detailed, and the user`s menu is described. This first version of synapse works and should allow the APC group to evaluate its utility. (authors). 6 refs., 2 appends.

Interpreting social network metrics in healthcare organisations: a review and guide to validating small networks.

Science.gov (United States)

Dunn, Adam G; Westbrook, Johanna I

2011-04-01

Social network analysis is an increasingly popular sociological method used to describe and understand the social aspects of communication patterns in the health care sector. The networks studied in this area are special because they are small, and for these sizes, the metrics calculated during analysis are sensitive to the number of people in the network and the density of observed communication. Validation is of particular value in controlling for these factors and in assisting in the accurate interpretation of network findings, yet such approaches are rarely applied. Our aim in this paper was to bring together published case studies to demonstrate how a proposed validation technique provides a basis for standardised comparison of networks within and across studies. A validation is performed for three network studies comprising ten networks, where the results are compared within and across the studies in relation to a standard baseline. The results confirm that hierarchy, centralisation and clustering metrics are highly sensitive to changes in size or density. Amongst the three case studies, we found support for some conclusions and contrary evidence for others. This validation approach is a tool for identifying additional features and verifying the conclusions reached in observational studies of small networks. We provide a methodological basis from which to perform intra-study and inter-study comparisons, for the purpose of introducing greater rigour to the use of social network analysis in health care applications. Copyright © 2011 Elsevier Ltd. All rights reserved.

Search theory a game theoretic perspective

CERN Document Server

2014-01-01

The first book focusing on search and rendezvous that will appeal to the computer science, mathematics and biology communities as well as non-experts Most chapters include case studies or surveys Includes a chapter on mobility in governed social networks

The role of memory for visual search in scenes.

Science.gov (United States)

Le-Hoa Võ, Melissa; Wolfe, Jeremy M

2015-03-01

Many daily activities involve looking for something. The ease with which these searches are performed often allows one to forget that searching represents complex interactions between visual attention and memory. Although a clear understanding exists of how search efficiency will be influenced by visual features of targets and their surrounding distractors or by the number of items in the display, the role of memory in search is less well understood. Contextual cueing studies have shown that implicit memory for repeated item configurations can facilitate search in artificial displays. When searching more naturalistic environments, other forms of memory come into play. For instance, semantic memory provides useful information about which objects are typically found where within a scene, and episodic scene memory provides information about where a particular object was seen the last time a particular scene was viewed. In this paper, we will review work on these topics, with special emphasis on the role of memory in guiding search in organized, real-world scenes. © 2015 New York Academy of Sciences.

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.

Global Social Media Directory: A Resource Guide

Energy Technology Data Exchange (ETDEWEB)

Noonan, Christine F.; Piatt, Andrew W.

2014-10-23

The Global Social Media Directory is a resource guide providing information on social networking services around the globe. This information changes rapidly, therefore, this document will be updated on a regular basis and as funding permits.

Toward two-dimensional search engines

International Nuclear Information System (INIS)

Ermann, L; Shepelyansky, D L; Chepelianskii, A D

2012-01-01

We study the statistical properties of various directed networks using ranking of their nodes based on the dominant vectors of the Google matrix known as PageRank and CheiRank. On average PageRank orders nodes proportionally to a number of ingoing links, while CheiRank orders nodes proportionally to a number of outgoing links. In this way, the ranking of nodes becomes two dimensional which paves the way for the development of two-dimensional search engines of a new type. Statistical properties of information flow on the PageRank–CheiRank plane are analyzed for networks of British, French and Italian universities, Wikipedia, Linux Kernel, gene regulation and other networks. A special emphasis is done for British universities networks using the large database publicly available in the UK. Methods of spam links control are also analyzed. (paper)

Cut set-based risk and reliability analysis for arbitrarily interconnected networks

Science.gov (United States)

Wyss, Gregory D.

2000-01-01

Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

Increasing Scalability of Researcher Network Extraction from the Web

Science.gov (United States)

Asada, Yohei; Matsuo, Yutaka; Ishizuka, Mitsuru

Social networks, which describe relations among people or organizations as a network, have recently attracted attention. With the help of a social network, we can analyze the structure of a community and thereby promote efficient communications within it. We investigate the problem of extracting a network of researchers from the Web, to assist efficient cooperation among researchers. Our method uses a search engine to get the cooccurences of names of two researchers and calculates the streangth of the relation between them. Then we label the relation by analyzing the Web pages in which these two names cooccur. Research on social network extraction using search engines as ours, is attracting attention in Japan as well as abroad. However, the former approaches issue too many queries to search engines to extract a large-scale network. In this paper, we propose a method to filter superfluous queries and facilitates the extraction of large-scale networks. By this method we are able to extract a network of around 3000-nodes. Our experimental results show that the proposed method reduces the number of queries significantly while preserving the quality of the network as compared to former methods.

Top-Down Activation of Spatiotopic Sensory Codes in Perceptual and Working Memory Search.

Science.gov (United States)

Kuo, Bo-Cheng; Nobre, Anna Christina; Scerif, Gaia; Astle, Duncan E

2016-07-01

A critical requirement of an efficient cognitive system is the selection and prioritization of relevant information. This occurs when selecting specific items from our sensory inputs, which then receive preferential status at subsequent levels of processing. Many everyday tasks also require us to select internal representations, such as a relevant item from memory. We show that both of these types of search are underpinned by the spatiotopic activation of sensory codes, using both fMRI and MEG data. When individuals searched for perceived and remembered targets, the MEG data highlighted a sensor level electrophysiological effect that reflects the contralateral organization of the visual system-namely, the N2pc. The fMRI data were used to identify a network of frontoparietal areas common to both types of search, as well as the early visual areas activated by the search display. We then combined fMRI and MEG data to explore the temporal dynamics of functional connections between the frontoparietal network and the early visual areas. Searching for a target item resulted in significantly enhanced phase-phase coupling between the frontoparietal network and the visual areas contralateral to the perceived or remembered location of that target. This enhancement of spatially specific phase-phase coupling occurred before the N2pc effect and was significantly associated with it on a trial-by-trial basis. The combination of these two imaging modalities suggests that perceptual and working memory search are underpinned by the synchronization of a frontoparietal network and the relevant sensory cortices.

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

Directory of Open Access Journals (Sweden)

Dongshuang Li

2018-05-01

Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

Resilient In-Network Aggregation for Vehicular Networks

NARCIS (Netherlands)

Dietzel, Stefan

2015-01-01

Applications for vehicular ad hoc networks (VANETs) are an active field of re- search with the potential to significantly contribute to driver safety, traffic efficiency, and comfort. Messages are typically exchanged and forwarded between vehicles using wireless communication, thereby creating a

基于用户意图理解的社交网络跨媒体搜索与挖掘%Social network cross-media searching and mining based on user intention

Institute of Scientific and Technical Information of China (English)

崔婉秋; 杜军平; 周南; 梁美玉

2017-01-01

With the popularity of online social networks, users not only have higher requirements for speed and real-time performance of information acquisition but also increased demand for personalized and accurate searching. To improve the quality of the search engine and accuracy of the result list, it is necessary to deeply mine the search intentions of the users. This paper summarizes the current situation in precise cross-media searching and mining based on user search in-tentions. We focus on multi-modal information perceptions based on an online social network knowledge graph, deep semantic learning and analysis of cross-media data for user search intention matching, and precise online social network searching and mining based on users' search intentions. Finally, future research problems and possible challenges are discussed.%随着在线社交网络的盛行,网络用户不仅对信息资讯的获取速度和实时性提出了更高的要求,对个性化和精确化的搜索需求日益增长.为了提升搜索引擎的质量以及其结果列表的准确性,需要深层次地挖掘用户搜索意图.本文分析了用户搜索意图理解在线社交网络跨媒体进行精准搜索与挖掘的研究现状,包括知识图谱在线社交网络多模态信息感知、面向用户搜索意图匹配的跨媒体大数据深度语义学习方面的应用,以及用户搜索意图理解的在线社交网络精准搜索与挖掘的应用等.最后,对未来研究存在的问题和可能面临的挑战进行了展望.

Guided self-organization inception

CERN Document Server

2014-01-01

Is it possible to guide the process of self-organisation towards specific patterns and outcomes?  Wouldn’t this be self-contradictory?   After all, a self-organising process assumes a transition into a more organised form, or towards a more structured functionality, in the absence of centralised control.  Then how can we place the guiding elements so that they do not override rich choices potentially discoverable by an uncontrolled process?  This book presents different approaches to resolving this paradox.  In doing so, the presented studies address a broad range of phenomena, ranging from autopoietic systems to morphological computation, and from small-world networks to information cascades in swarms.  A large variety of methods is employed, from spontaneous symmetry breaking to information dynamics to evolutionary algorithms, creating a rich spectrum reflecting this emerging field. Demonstrating several foundational theories and frameworks, as well as innovative practical implementations, Guided S...

Design of a search and rescue terminal based on the dual-mode satellite and CDMA network

Science.gov (United States)

Zhao, Junping; Zhang, Xuan; Zheng, Bing; Zhou, Yubin; Song, Hao; Song, Wei; Zhang, Meikui; Liu, Tongze; Zhou, Li

2010-12-01

The current goal is to create a set of portable terminals with GPS/BD2 dual-mode satellite positioning, vital signs monitoring and wireless transmission functions. The terminal depends on an ARM processor to collect and combine data related to vital signs and GPS/BD2 location information, and sends the message to headquarters through the military CDMA network. It integrates multiple functions as a whole. The satellite positioning and wireless transmission capabilities are integrated into the motherboard, and the vital signs sensors used in the form of belts communicate with the board through Bluetooth. It can be adjusted according to the headquarters' instructions. This kind of device is of great practical significance for operations during disaster relief, search and rescue of the wounded in wartime, non-war military operations and other special circumstances.

Priming and the guidance by visual and categorical templates in visual search

Directory of Open Access Journals (Sweden)

Anna eWilschut

2014-02-01

Full Text Available Visual search is thought to be guided by top-down templates that are held in visual working memory. Previous studies have shown that a search-guiding template can be rapidly and strongly implemented from a visual cue, whereas templates are less effective when based on categorical cues. Direct visual priming from cue to target may underlie this difference. In two experiments we first asked observers to remember two possible target colors. A postcue then indicated which of the two would be the relevant color. The task was to locate a briefly presented and masked target of the cued color among irrelevant distractor items. Experiment 1 showed that overall search accuracy improved more rapidly on the basis of a direct visual postcue that carried the target color, compared to a neutral postcue that pointed to the memorized color. However, selectivity towards the target feature, i.e. the extent to which observers searched selectively among items of the cued versus uncued color, was found to be relatively unaffected by the presence of the visual signal. In Experiment 2 we compared search that was based on either visual or categorical information, but now controlled for direct visual priming. This resulted in no differences in overall performance nor selectivity. Altogether the results suggest that perceptual processing of visual search targets is facilitated by priming from visual cues, whereas attentional selectivity is enhanced by a working memory template that can formed from both visual and categorical input. Furthermore, if the priming is controlled for, categorical- and visual-based templates similarly enhance search guidance.

Priming and the guidance by visual and categorical templates in visual search.

Science.gov (United States)

Wilschut, Anna; Theeuwes, Jan; Olivers, Christian N L

2014-01-01

Visual search is thought to be guided by top-down templates that are held in visual working memory. Previous studies have shown that a search-guiding template can be rapidly and strongly implemented from a visual cue, whereas templates are less effective when based on categorical cues. Direct visual priming from cue to target may underlie this difference. In two experiments we first asked observers to remember two possible target colors. A postcue then indicated which of the two would be the relevant color. The task was to locate a briefly presented and masked target of the cued color among irrelevant distractor items. Experiment 1 showed that overall search accuracy improved more rapidly on the basis of a direct visual postcue that carried the target color, compared to a neutral postcue that pointed to the memorized color. However, selectivity toward the target feature, i.e., the extent to which observers searched selectively among items of the cued vs. uncued color, was found to be relatively unaffected by the presence of the visual signal. In Experiment 2 we compared search that was based on either visual or categorical information, but now controlled for direct visual priming. This resulted in no differences in overall performance nor selectivity. Altogether the results suggest that perceptual processing of visual search targets is facilitated by priming from visual cues, whereas attentional selectivity is enhanced by a working memory template that can formed from both visual and categorical input. Furthermore, if the priming is controlled for, categorical- and visual-based templates similarly enhance search guidance.

The guidance of spatial attention during visual search for colour combinations and colour configurations

OpenAIRE

Berggren, Nick; Eimer, Martin

2016-01-01

Representations of target-defining features (attentional templates) guide the selection of target objects in visual search. We used behavioural and electrophysiological measures to investigate how such search templates control the allocation of attention in search tasks where targets are defined by the combination of two colours or by a specific spatial configuration of these colours. Target displays were preceded by spatially uninformative cue displays that contained items in one or both tar...

Investigation on the use of artificial neural networks to overcome the effects of environmental and operational changes on guided waves monitoring

Science.gov (United States)

El Mountassir, M.; Yaacoubi, S.; Dahmene, F.

2015-07-01

Intelligent feature extraction and advanced signal processing techniques are necessary for a better interpretation of ultrasonic guided waves signals either in structural health monitoring (SHM) or in nondestructive testing (NDT). Such signals are characterized by at least multi-modal and dispersive components. In addition, in SHM, these signals are closely vulnerable to environmental and operational conditions (EOCs), and can be severely affected. In this paper we investigate the use of Artificial Neural Network (ANN) to overcome these effects and to provide a reliable damage detection method with a minimal of false indications. An experimental case of study (full scale pipe) is presented. Damages sizes have been increased and their shapes modified in different steps. Various parameters such as the number of inputs and the number of hidden neurons were studied to find the optimal configuration of the neural network.

Job Search Methods: Consequences for Gender-based Earnings Inequality.

Science.gov (United States)

Huffman, Matt L.; Torres, Lisa

2001-01-01

Data from adults in Atlanta, Boston, and Los Angeles (n=1,942) who searched for work using formal (ads, agencies) or informal (networks) methods indicated that type of method used did not contribute to the gender gap in earnings. Results do not support formal job search as a way to reduce gender inequality. (Contains 55 references.) (SK)

Exploration Opportunity Search of Near-earth Objects Based on Analytical Gradients

Science.gov (United States)

Ren, Yuan; Cui, Ping-Yuan; Luan, En-Jie

2008-07-01

The problem of search of opportunity for the exploration of near-earth minor objects is investigated. For rendezvous missions, the analytical gradients of the performance index with respect to the free parameters are derived using the variational calculus and the theory of state-transition matrix. After generating randomly some initial guesses in the search space, the performance index is optimized, guided by the analytical gradients, leading to the local minimum points representing the potential launch opportunities. This method not only keeps the global-search property of the traditional method, but also avoids the blindness in the latter, thereby increasing greatly the computing speed. Furthermore, with this method, the searching precision could be controlled effectively.

Maximal network reliability for a stochastic power transmission network

International Nuclear Information System (INIS)

Lin, Yi-Kuei; Yeh, Cheng-Ta

2011-01-01

Many studies regarded a power transmission network as a binary-state network and constructed it with several arcs and vertices to evaluate network reliability. In practice, the power transmission network should be stochastic because each arc (transmission line) combined with several physical lines is multistate. Network reliability is the probability that the network can transmit d units of electric power from a power plant (source) to a high voltage substation at a specific area (sink). This study focuses on searching for the optimal transmission line assignment to the power transmission network such that network reliability is maximized. A genetic algorithm based method integrating the minimal paths and the Recursive Sum of Disjoint Products is developed to solve this assignment problem. A real power transmission network is adopted to demonstrate the computational efficiency of the proposed method while comparing with the random solution generation approach.

A Study on Guide Sign Validity in Driving Simulator

Directory of Open Access Journals (Sweden)

Wei Zhonghua

2011-12-01

Full Text Available The role of guide sign to inform road user about the information of network is important. How to design and locate guide sign to increase traffic operation efficiency is a key point for traffic engineers. Driving simulator is useful devised to study guide sign in the process and system control. For the purpose of studying guide signs using the tool of driving simulator, guide sign's validity in driving simulator was studied. Results of this experiment are the foundation of further study on guide sign. Simulator calibration procedure for guide sign was set up in this study. Legibility distance as measure of performance was used to evaluate the validity of guide sign in driving simulator. Thirty two participants were recruited. Results indicated legibility distance and speed were inversely related with the method of data mining. Legibility distance and text height of guide sign were positive related. When speed is 20km/h, 30km/h, 40km/h, magnifying power of text height is 4.3, 4.1, 3.8, while guide signs are absolute validity in driving simulator.

SANSparallel: interactive homology search against Uniprot.

Science.gov (United States)

Somervuo, Panu; Holm, Liisa

2015-07-01

Proteins evolve by mutations and natural selection. The network of sequence similarities is a rich source for mining homologous relationships that inform on protein structure and function. There are many servers available to browse the network of homology relationships but one has to wait up to a minute for results. The SANSparallel webserver provides protein sequence database searches with immediate response and professional alignment visualization by third-party software. The output is a list, pairwise alignment or stacked alignment of sequence-similar proteins from Uniprot, UniRef90/50, Swissprot or Protein Data Bank. The stacked alignments are viewed in Jalview or as sequence logos. The database search uses the suffix array neighborhood search (SANS) method, which has been re-implemented as a client-server, improved and parallelized. The method is extremely fast and as sensitive as BLAST above 50% sequence identity. Benchmarks show that the method is highly competitive compared to previously published fast database search programs: UBLAST, DIAMOND, LAST, LAMBDA, RAPSEARCH2 and BLAT. The web server can be accessed interactively or programmatically at http://ekhidna2.biocenter.helsinki.fi/cgi-bin/sans/sans.cgi. It can be used to make protein functional annotation pipelines more efficient, and it is useful in interactive exploration of the detailed evidence supporting the annotation of particular proteins of interest. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Win the game of Googleopoly unlocking the secret strategy of search engines

CERN Document Server

Bradley, Sean V

2015-01-01

Rank higher in search results with this guide to SEO and content building supremacy Google is not only the number one search engine in the world, it is also the number one website in the world. Only 5 percent of site visitors search past the first page of Google, so if you're not in those top ten results, you are essentially invisible. Winning the Game of Googleopoly is the ultimate roadmap to Page One Domination. The POD strategy is what gets you on that super-critical first page of Google results by increasing your page views. You'll learn how to shape your online presence for Search Engine

[Drug susceptibility test guided therapy and novel empirical quadruple therapy for Helicobacter pylori infection: a network Meta-analysis].

Science.gov (United States)

Gou, Q Y; Yu, R B; Shi, R H

2017-05-10

Objective: To compare the efficacy and the risk of adverse effect of drug susceptibility test guided therapy and novel empirical quadruple therapy for Helicobacter ( H .) pylori infection. Methods: Literature retrieval was conducted by using major databases. Related papers published up to June 2015 were considered eligible if they were randomized control trials comparing different pharmacological formulations for H. pylori infection and used in a network Meta-analysis and a single rate Meta-analysis to evaluate the relative and absolute rates of H. pylori eradication and the risk of adverse effect. The Jadad score was used to evaluate the methodological quality. Funnel plot was constructed to evaluate the risk of publication bias. Begg's rank correlation test or Egger's regression intercept test was done for the asymmetry of funnel plot. Results: Twenty randomized control trials for the treatment of 6 753 initial treated patients with H. pylori infection were included. Drug susceptibility test guided therapy was significantly superior to concomitant therapy, hybrid therapy, sequential therapy and bismuth quadruple therapy. The culture-based therapy had the highest likelihood of improving clinical efficacy, with lowest risk of adverse effect. Concomitant therapy had the highest probability of causing adverse effect despite its effectiveness. Hybrid therapy and bismuth quadruple therapy were associated with lower risk of adverse effect and higher effectiveness. Conclusion: Drug susceptibility test guided therapy showed superiority to other 4 interventions for H. pylori eradication mentioned above. Hybrid therapy and bismuth quadruple therapy might be applied in the settings where the culture-based strategy is not available.

Retrieval Search and Strength Evoke Dissociable Brain Activity during Episodic Memory Recall

Science.gov (United States)

Reas, Emilie T.; Brewer, James B.

2014-01-01

Neuroimaging studies of episodic memory retrieval have revealed activations in the human frontal, parietal, and medial-temporal lobes that are associated with memory strength. However, it remains unclear whether these brain responses are veritable signals of memory strength or are instead regulated by concomitant subcomponents of retrieval such as retrieval effort or mental search. This study used event-related fMRI during cued recall of previously memorized word-pair associates to dissociate brain responses modulated by memory search from those modulated by the strength of a recalled memory. Search-related deactivations, dissociated from activity due to memory strength, were observed in regions of the default network, whereas distinctly strength-dependent activations were present in superior and inferior parietal and dorsolateral PFC. Both search and strength regulated activity in dorsal anterior cingulate and anterior insula. These findings suggest that, although highly correlated and partially subserved by overlapping cognitive control mechanisms, search and memory strength engage dissociable regions of frontoparietal attention and default networks. PMID:23190328

Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

Science.gov (United States)

Song, Kai; Liu, Qi; Wang, Qi

2011-01-01

Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE) and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN). Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability. PMID:22319401

Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

Directory of Open Access Journals (Sweden)

Qi Wang

2011-02-01

Full Text Available Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN. Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability.

Integrated Markov-neural reliability computation method: A case for multiple automated guided vehicle system

International Nuclear Information System (INIS)

Fazlollahtabar, Hamed; Saidi-Mehrabad, Mohammad; Balakrishnan, Jaydeep

2015-01-01

This paper proposes an integrated Markovian and back propagation neural network approaches to compute reliability of a system. While states of failure occurrences are significant elements for accurate reliability computation, Markovian based reliability assessment method is designed. Due to drawbacks shown by Markovian model for steady state reliability computations and neural network for initial training pattern, integration being called Markov-neural is developed and evaluated. To show efficiency of the proposed approach comparative analyses are performed. Also, for managerial implication purpose an application case for multiple automated guided vehicles (AGVs) in manufacturing networks is conducted. - Highlights: • Integrated Markovian and back propagation neural network approach to compute reliability. • Markovian based reliability assessment method. • Managerial implication is shown in an application case for multiple automated guided vehicles (AGVs) in manufacturing networks

Search Results | Page 776 | IDRC - International Development ...

International Development Research Centre (IDRC) Digital Library (Canada)

Results 7751 - 7760 of 9175 ... Enhancing food production in semi arid coastal lowlands Kenya through ... nonlocal search trajectories, and ties with service intermediaries ... the role of social networks is identified as one of the research frontiers ...

The guidance of visual search by shape features and shape configurations.

Science.gov (United States)

McCants, Cody W; Berggren, Nick; Eimer, Martin

2018-03-01

Representations of target features (attentional templates) guide attentional object selection during visual search. In many search tasks, targets objects are defined not by a single feature but by the spatial configuration of their component shapes. We used electrophysiological markers of attentional selection processes to determine whether the guidance of shape configuration search is entirely part-based or sensitive to the spatial relationship between shape features. Participants searched for targets defined by the spatial arrangement of two shape components (e.g., hourglass above circle). N2pc components were triggered not only by targets but also by partially matching distractors with one target shape (e.g., hourglass above hexagon) and by distractors that contained both target shapes in the reverse arrangement (e.g., circle above hourglass), in line with part-based attentional control. Target N2pc components were delayed when a reverse distractor was present on the opposite side of the same display, suggesting that early shape-specific attentional guidance processes could not distinguish between targets and reverse distractors. The control of attention then became sensitive to spatial configuration, which resulted in a stronger attentional bias for target objects relative to reverse and partially matching distractors. Results demonstrate that search for target objects defined by the spatial arrangement of their component shapes is initially controlled in a feature-based fashion but can later be guided by templates for spatial configurations. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

CCNA routing and switching study guide exams 100-101, 200-101, and 200-120

CERN Document Server

Lammle, Todd

2013-01-01

Prepare for the new CCNA exams with this Todd Lammle study guide Cisco author, speaker, and trainer Todd Lammle is considered the authority on all things networking, and his books have sold almost a million copies worldwide. This all-purpose CCNA study guide methodically covers all the objectives of the ICND1 (100-101) and ICND2 (200-101) exams as well as providing additional insight for those taking CCNA Composite (200-120) exam. It thoroughly examines operation of IP data networks, LAN switching technologies, IP addressing (IPv4/IPv6), IP routing technologies, IP services, network device s

Knowing How Good Our Searches Are: An Approach Derived from Search Filter Development Methodology

Directory of Open Access Journals (Sweden)

Sarah Hayman

2015-12-01

Full Text Available Objective – Effective literature searching is of paramount importance in supporting evidence based practice, research, and policy. Missed references can have adverse effects on outcomes. This paper reports on the development and evaluation of an online learning resource, designed for librarians and other interested searchers, presenting an evidence based approach to enhancing and testing literature searches. Methods – We developed and evaluated the set of free online learning modules for librarians called Smart Searching, suggesting the use of techniques derived from search filter development undertaken by the CareSearch Palliative Care Knowledge Network and its associated project Flinders Filters. The searching module content has been informed by the processes and principles used in search filter development. The self-paced modules are intended to help librarians and other interested searchers test the effectiveness of their literature searches, provide evidence of search performance that can be used to improve searches, as well as to evaluate and promote searching expertise. Each module covers one of four techniques, or core principles, employed in search filter development: (1 collaboration with subject experts; (2 use of a reference sample set; (3 term identification through frequency analysis; and (4 iterative testing. Evaluation of the resource comprised ongoing monitoring of web analytics to determine factors such as numbers of users and geographic origin; a user survey conducted online elicited qualitative information about the usefulness of the resource. Results – The resource was launched in May 2014. Web analytics show over 6,000 unique users from 101 countries (at 9 August 2015. Responses to the survey (n=50 indicated that 80% would recommend the resource to a colleague. Conclusions – An evidence based approach to searching, derived from search filter development methodology, has been shown to have value as an online learning

IPv6 Network Administration

CERN Document Server

Murphy, Niall Richard

2009-01-01

This essential guide explains what works, what doesn't, and most of all, what's practical about IPv6--the next-generation Internet standard. A must-have for network administrators everywhere looking to fix their network's scalability and management problems. Also covers other IPv6 benefits, such as routing, integrated auto-configuration, quality-of-services (QoS), enhanced mobility, and end-to-end security.

Ultrasound-guided injection for plantar fasciitis: A brief review

Directory of Open Access Journals (Sweden)

A S Nair

2016-01-01

Full Text Available Plantar fasciitis (PF is a distressing condition experienced by many patients. Although self-limiting, it tends to become a chronic ailment if the precipitating factors are not addressed. One of the modality of treating PF is intra-lesional corticosteroid injection. This was done using palpation technique earlier but nowadays many specialists use ultrasound (US imaging as a guide to give injection accurately instead of inadvertently damaging the plantar fascia or injecting into surrounding soft tissue, both of which can have serious implications. We did a literature search in Medline, Scopus, and Embase databases to find out articles describing US-guided corticosteroid injection for treating PF and whether guided injection was effective than injection given by palpation.

On the Use of Local Search in the Evolution of Neural Networks for the Diagnosis of Breast Cancer

Directory of Open Access Journals (Sweden)

Agam Gupta

2015-07-01

Full Text Available With the advancement in the field of Artificial Intelligence, there have been considerable efforts to develop technologies for pattern recognition related to medical diagnosis. Artificial Neural Networks (ANNs, a significant piece of Artificial Intelligence forms the base for most of the marvels in the former field. However, ANNs face the problem of premature convergence at a local minimum and inability to set hyper-parameters (like the number of neurons, learning rate, etc. while using Back Propagation Algorithm (BPA. In this paper, we have used the Genetic Algorithm (GA for the evolution of the ANN, which overcomes the limitations of the BPA. Since GA alone cannot fit for a high-dimensional, complex and multi-modal optimization landscape of the ANN, BPA is used as a local search algorithm to aid the evolution. The contributions of GA and BPA in the resultant approach are adjudged to determine the magnitude of local search necessary for optimization, striking a clear balance between exploration and exploitation in the evolution. The algorithm was applied to deal with the problem of Breast Cancer diagnosis. Results showed that under optimal settings, hybrid algorithm performs better than BPA or GA alone.

Remembered but unused: the accessory items in working memory that do not guide attention

NARCIS (Netherlands)

Peters, Judith C.; Goebel, Rainer; Roelfsema, Pieter R.

2009-01-01

If we search for an item, a representation of this item in our working memory guides attention to matching items in the visual scene. We can hold multiple items in working memory. Do all these items guide attention in parallel? We asked participants to detect a target object in a stream of objects

Psychological and social factors affecting Internet searches on suicide in Korea: a big data analysis of Google search trends.

Science.gov (United States)

Song, Tae Min; Song, Juyoung; An, Ji-Young; Hayman, Laura L; Woo, Jong-Min

2014-01-01

The average mortality rate for death by suicide among OECD countries is 12.8 per 100000, and 33.5 for Korea. The present study analyzed big data extracted from Google to identify factors related to searches on suicide in Korea. Google search trends for the search words of suicide, stress, exercise, and drinking were obtained for 2004-2010. Analyzing data by month, the relationship between the actual number of suicides and search words per year was examined using multi-level models. Both suicide rates and Google searches on suicide in Korea increased since 2007. An unconditional slope model indicated stress and suicide-related searches were positively related. A conditional model showed that factors associated with suicide by year directly affected suicide-related searches. The interaction between stress-related searches and the actual number of suicides was significant. A positive relationship between stress- and suicide-related searches further confirmed that stress affects suicide. Taken together and viewed in context of the big data analysis, our results point to the need for a tailored prevention program. Real-time big data can be of use in indicating increases in suicidality when search words such as stress and suicide generate greater numbers of hits on portals and social network sites.

Mapping and characterization of LCA networks

DEFF Research Database (Denmark)

Bjørn, Anders; Owsianiak, Mikolaj; Laurent, Alexis

2013-01-01

Purpose: The aims of this study were to provide an up-todate overview of global, regional and local networks supporting life cycle thinking and to characterize them according to their structure and activities. Methods: Following a tentative life cycle assessment (LCA) network definition, a mapping......: The provided list of LCA networks is currently the most comprehensive, publicly available mapping. We believe that the results of this mapping can serve as a basis for deciding where priorities should be set to increase the dissemination and development of LCA worldwide. In this aim, we also advocate...... was performed based on (1) a literature search, (2) a web search and (3) an inquiry to stakeholders distributed via the two largest LCA fora. Networks were characterized based on responses from a survey. Results and discussion: We identified 100 networks, of which 29 fulfilled all six criteria composing our...

TCP/IP Network Administration

CERN Document Server

Hunt, Craig

2002-01-01

This complete guide to setting up and running a TCP/IP network is essential for network administrators, and invaluable for users of home systems that access the Internet. The book starts with the fundamentals -- what protocols do and how they work, how addresses and routing are used to move data through the network, how to set up your network connection -- and then covers, in detail, everything you need to know to exchange information via the Internet. Included are discussions on advanced routing protocols (RIPv2, OSPF, and BGP) and the gated software package that implements them, a tutorial

Federal Smart Cities and Communities Programs Resource Guide

Data.gov (United States)

Networking and Information Technology Research and Development, Executive Office of the President — The Federal Smart Cities and Communities Task Force created the " Federal Smart Cities and Communities Programs Resource Guide " to facilitate collaboration and...

AN OVERVIEW OF SEARCHING AND DISCOVERING WEB BASED INFORMATION RESOURCES

Directory of Open Access Journals (Sweden)

Cezar VASILESCU

2010-01-01

Full Text Available The Internet becomes for most of us a daily used instrument, for professional or personal reasons. We even do not remember the times when a computer and a broadband connection were luxury items. More and more people are relying on the complicated web network to find the needed information.This paper presents an overview of Internet search related issues, upon search engines and describes the parties and the basic mechanism that is embedded in a search for web based information resources. Also presents ways to increase the efficiency of web searches, through a better understanding of what search engines ignore at websites content.

Cross-layer combining of information-guided transmission withnetwork coding relaying for multiuser cognitive radio systems

KAUST Repository

Yang, Yuli; Aï ssa, Sonia

2013-01-01

For a cognitive radio relaying network, we propose a cross-layer design by combining information-guided transmission at the physical layer and network coding at the network layer. With this design, a common relay is exploited to help

The Role of Search Speed in the Contextual Cueing of Children's Attention.

Science.gov (United States)

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2014-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information.

Behavior and neural basis of near-optimal visual search

Science.gov (United States)

Ma, Wei Ji; Navalpakkam, Vidhya; Beck, Jeffrey M; van den Berg, Ronald; Pouget, Alexandre

2013-01-01

The ability to search efficiently for a target in a cluttered environment is one of the most remarkable functions of the nervous system. This task is difficult under natural circumstances, as the reliability of sensory information can vary greatly across space and time and is typically a priori unknown to the observer. In contrast, visual-search experiments commonly use stimuli of equal and known reliability. In a target detection task, we randomly assigned high or low reliability to each item on a trial-by-trial basis. An optimal observer would weight the observations by their trial-to-trial reliability and combine them using a specific nonlinear integration rule. We found that humans were near-optimal, regardless of whether distractors were homogeneous or heterogeneous and whether reliability was manipulated through contrast or shape. We present a neural-network implementation of near-optimal visual search based on probabilistic population coding. The network matched human performance. PMID:21552276

Comparison of PubMed and Google Scholar literature searches.

Science.gov (United States)

Anders, Michael E; Evans, Dennis P

2010-05-01

Literature searches are essential to evidence-based respiratory care. To conduct literature searches, respiratory therapists rely on search engines to retrieve information, but there is a dearth of literature on the comparative efficiencies of search engines for researching clinical questions in respiratory care. To compare PubMed and Google Scholar search results for clinical topics in respiratory care to that of a benchmark. We performed literature searches with PubMed and Google Scholar, on 3 clinical topics. In PubMed we used the Clinical Queries search filter. In Google Scholar we used the search filters in the Advanced Scholar Search option. We used the reference list of a related Cochrane Collaboration evidence-based systematic review as the benchmark for each of the search results. We calculated recall (sensitivity) and precision (positive predictive value) with 2 x 2 contingency tables. We compared the results with the chi-square test of independence and Fisher's exact test. PubMed and Google Scholar had similar recall for both overall search results (71% vs 69%) and full-text results (43% vs 51%). PubMed had better precision than Google Scholar for both overall search results (13% vs 0.07%, P PubMed searches with the Clinical Queries filter are more precise than with the Advanced Scholar Search in Google Scholar for respiratory care topics. PubMed appears to be more practical to conduct efficient, valid searches for informing evidence-based patient-care protocols, for guiding the care of individual patients, and for educational purposes.

Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST

Directory of Open Access Journals (Sweden)

Oliver Melvin J

2005-04-01

Full Text Available Abstract Background BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST, which enhances the BLAST utility by improving usability, fault recovery, and scalability in a Windows desktop environment. Our goal was to develop an easy to use, fault tolerant, high-throughput BLAST solution that incorporates a comprehensive BLAST result viewer with curation and annotation functionality. Results W.ND-BLAST is a comprehensive Windows-based software toolkit that targets researchers, including those with minimal computer skills, and provides the ability increase the performance of BLAST by distributing BLAST queries to any number of Windows based machines across local area networks (LAN. W.ND-BLAST provides intuitive Graphic User Interfaces (GUI for BLAST database creation, BLAST execution, BLAST output evaluation and BLAST result exportation. This software also provides several layers of fault tolerance and fault recovery to prevent loss of data if nodes or master machines fail. This paper lays out the functionality of W.ND-BLAST. W.ND-BLAST displays close to 100% performance efficiency when distributing tasks to 12 remote computers of the same performance class. A high throughput BLAST job which took 662.68 minutes (11 hours on one average machine was completed in 44.97 minutes when distributed to 17 nodes, which included lower performance class machines. Finally, there is a comprehensive high-throughput BLAST Output Viewer (BOV and Annotation Engine components, which provides comprehensive exportation of BLAST hits to text files, annotated fasta files, tables, or association files. Conclusion W.ND-BLAST provides an interactive tool that allows scientists to easily utilizing their available computing resources for high throughput and comprehensive sequence analyses. The install package for W.ND-BLAST is

EEA core set of indicators. Guide

Energy Technology Data Exchange (ETDEWEB)

NONE

2005-07-01

This guide provides information on the quality of the 37 indicators in the EEA core set. Its primary role is to support improved implementation of the core set in the EEA, European topic centres and the European environment information and observation network (Eionet). In parallel, it is aimed at helping users outside the EEA/Eionet system make best use of the indicators in their own work. It is hoped that the guide will promote cooperation on improving indicator methodologies and data quality as part of the wider process to streamline and improve environmental reporting in the European Union and beyond. (au)

A Social Network Analysis of Occupational Segregation

DEFF Research Database (Denmark)

Buhai, Ioan Sebastian; van der Leij, Marco

We develop a social network model of occupational segregation between different social groups, generated by the existence of positive inbreeding bias among individuals from the same group. If network referrals are important for job search, then expected homophily in the contact network structure...

Guided Seismic Waves: Possible Diagnostics for Hot Plumes in the Mantle

Science.gov (United States)

Evans, J. R.; Julian, B. R.; Foulger, G. R.

2005-12-01

particular epicentral distances. A failure to find such guided waves experimentally could mean either that the waveguides (plumes) do not exist or that the excitation mechanisms and/or seismometer networks are inadequate. Distinguishing these two possibilities would require careful analysis. Anticipated major improvements in seismic instrumentation, such as the EarthScope initiative, make this a propitious time to undertake a search for plume-guided waves in the mantle.

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

Science.gov (United States)

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

CNN Newsroom Classroom Guides, October 2000.

Science.gov (United States)

Turner Educational Services, Inc., Newtown, PA.

These classroom guides, designed to accompany the daily CNN (Cable News Network) Newsroom broadcasts for the month of October 2000, provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Top stories include: Chinese authorities detain Falun Gong protesters on Tiananmen Square…

Medicinal plants growing in the Judea region: network approach for searching potential therapeutic targets

Directory of Open Access Journals (Sweden)

Arie Budovsky

2012-09-01

Full Text Available Plants growing in the Judea region are widely used in traditional medicine of the Levant region. Nevertheless, they have not so far been sufficiently analyzed and their medicinal potential has not been evaluated. This study is the first attempt to fill the gap in the knowledge of the plants growing in the region. Comprehensive data mining of online botanical databases and peer-reviewed scientific literature including ethno-pharmacological surveys from the Levant region was applied to compile a full list of plants growing in the Judea region, with the focus on their medicinal applications. Around 1300 plants growing in the Judea region were identified. Of them, 25% have medicinal applications which were analyzed in this study. Screening for chemical-protein interactions, together with the network-based analysis of potential targets, will facilitate discovery and therapeutic applications of the Judea region plants. Such an approach could also be applied as an integrative platform for further searching the potential therapeutic targets of plants growing in other regions of the world.

Cortical Dynamics of Contextually Cued Attentive Visual Learning and Search: Spatial and Object Evidence Accumulation

Science.gov (United States)

Huang, Tsung-Ren; Grossberg, Stephen

2010-01-01

How do humans use target-predictive contextual information to facilitate visual search? How are consistently paired scenic objects and positions learned and used to more efficiently guide search in familiar scenes? For example, humans can learn that a certain combination of objects may define a context for a kitchen and trigger a more efficient…

Wireless rechargeable sensor networks

CERN Document Server

Yang, Yuanyuan

2015-01-01

This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability

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

Science.gov (United States)

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

2011-01-01

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

Logistic control in automated transportation networks

NARCIS (Netherlands)

Ebben, Mark

2001-01-01

Increasing congestion problems lead to a search for alternative transportation systems. Automated transportation networks, possibly underground, are an option. Logistic control systems are essential for future implementations of such automated transportation networks. This book contributes to the

Short-term economic environmental hydrothermal scheduling using improved multi-objective gravitational search algorithm

International Nuclear Information System (INIS)

Li, Chunlong; Zhou, Jianzhong; Lu, Peng; Wang, Chao

2015-01-01

Highlights: • Improved multi-objective gravitational search algorithm. • An elite archive set is proposed to guide evolutionary process. • Neighborhood searching mechanism to improve local search ability. • Adopt chaotic mutation for avoiding premature convergence. • Propose feasible space method to handle hydro plant constrains. - Abstract: With growing concerns about energy and environment, short-term economic environmental hydrothermal scheduling (SEEHS) plays a more and more important role in power system. Because of the two objectives and various constraints, SEEHS is a complex multi-objective optimization problem (MOOP). In order to solve the problem, we propose an improved multi-objective gravitational search algorithm (IMOGSA) in this paper. In IMOGSA, the mass of the agent is redefined by multiple objectives to make it suitable for MOOP. An elite archive set is proposed to keep Pareto optimal solutions and guide evolutionary process. For balancing exploration and exploitation, a neighborhood searching mechanism is presented to cooperate with chaotic mutation. Moreover, a novel method based on feasible space is proposed to handle hydro plant constraints during SEEHS, and a violation adjustment method is adopted to handle power balance constraint. For verifying its effectiveness, the proposed IMOGSA is applied to a hydrothermal system in two different case studies. The simulation results show that IMOGSA has a competitive performance in SEEHS when compared with other established algorithms

Data Collision Prevention with Overflow Hashing Technique in Closed Hash Searching Process

Science.gov (United States)

Rahim, Robbi; Nurjamiyah; Rafika Dewi, Arie

2017-12-01

Hash search is a method that can be used for various search processes such as search engines, sorting, machine learning, neural network and so on, in the search process the possibility of collision data can happen and to prevent the occurrence of collision can be done in several ways one of them is to use Overflow technique, the use of this technique perform with varying length of data and this technique can prevent the occurrence of data collisions.

An Intelligent Pinger Network for Solid Glacier Environments

Science.gov (United States)

Schönitz, S.; Reuter, S.; Henke, C.; Jeschke, S.; Ewert, D.; Eliseev, D.; Heinen, D.; Linder, P.; Scholz, F.; Weinstock, L.; Wickmann, S.; Wiebusch, C.; Zierke, S.

2016-12-01

This talk presents a novel approach for an intelligent, agent-based pinger network in an extraterrestrial glacier environment. Because of recent findings of the Cassini spacecraft, a mission to Saturn's moon Enceladus is planned in order search for extraterrestrial life within the ocean beneath Enceladus' ice crust. Therefore, a maneuverable melting probe, the EnEx probe, was developed to melt into Enceladus' ice and take liquid samples from water-filled crevasses. Hence, the probe collecting the samples has to be able to navigate in ice which is a hard problem, because neither visual nor gravitational methods can be used. To enhance the navigability of the probe, a network of autonomous pinger units (APU) is in development that is able to extract a map of the ice environment via ultrasonic soundwaves. A network of these APUs will be deployed on the surface of Enceladus, melt into the ice and form a network to help guide the probe safely to its destination. The APU network is able to form itself fully autonomously and to compensate system failures of individual APUs. The agents controlling the single APU are realized by rule-based expert systems implemented in CLIPS. The rule-based expert system evaluates available information of the environment, decides for actions to take to achieve the desired goal (e.g. a specific network topology), and executes and monitors such actions. In general, it encodes certain situations that are evaluated whenever an APU is currently idle, and then decides for a next action to take. It bases this decision on its internal world model that is shared with the other APUs. The optimal network topology that defines each agents position is iteratively determined by mixed-integer nonlinear programming. Extensive simulations studies show that the proposed agent design enables the APUs to form a robust network topology that is suited to create a reliable 3D map of the ice environment.

Network Coding Applications and Implementations on Mobile Devices

DEFF Research Database (Denmark)

Fitzek, Frank; Pedersen, Morten Videbæk; Heide, Janus

2010-01-01

Network coding has attracted a lot of attention lately. The goal of this paper is to demonstrate that the implementation of network coding is feasible on mobile platforms. The paper will guide the reader through some examples and demonstrate uses for network coding. Furthermore the paper will also...... show that the implementation of network coding is feasible today on commercial mobile platforms....

Social Networks and Collective Intelligence: A Return to the Agora

DEFF Research Database (Denmark)

Mazzara, Manuel; Biselli, Luca; Greco, Pier Paolo

2013-01-01

backgrounds and institutes with significantly different agendas. Polidoxa aims at offering: 1) a trust-based search engine algorithm, which exploits stigmergic behaviours of users? network, 2) a trust-based social network, where the notion of trust derives from network activity and 3) a holonic system...... for bottom-up self-protection and social privacy. By presenting the Polidoxa solution, this work also describes the current state of traditional media as well as newer ones, providing an accurate analysis of major search engines such as Google and social network (e.g., Facebook). The advantages that Polidoxa...

Mastering Windows Server 2008 Networking Foundations

CERN Document Server

Minasi, Mark; Mueller, John Paul

2011-01-01

Find in-depth coverage of general networking concepts and basic instruction on Windows Server 2008 installation and management including active directory, DNS, Windows storage, and TCP/IP and IPv4 networking basics in Mastering Windows Server 2008 Networking Foundations. One of three new books by best-selling author Mark Minasi, this guide explains what servers do, how basic networking works (IP basics and DNS/WINS basics), and the fundamentals of the under-the-hood technologies that support staff must understand. Learn how to install Windows Server 2008 and build a simple network, security co

The future of network governance research

DEFF Research Database (Denmark)

Lewis, Jenny

2011-01-01

that comprises it. The main theoretical and empirical approaches that have been used to guide it to date are then briefly described, emphasizing recent debates about interpretivism and decentring. Next, it suggests that a robust and interesting future for network governance requires diversity, rather than...... adherence to a single approach. It is argued that more sophisticated approaches for examining network governance are fashioned through a synthesis of ideas and methods to create an analysis of networks as networks. This is especially the case where some formal analysis of network structure is used...

How Will Online Affiliate Marketing Networks Impact Search Engine Rankings?

NARCIS (Netherlands)

D. Janssen (David); H.W.G.M. van Heck (Eric)

2007-01-01

textabstractIn online affiliate marketing networks advertising web sites offer their affiliates revenues based on provided web site traffic and associated leads and sales. Advertising web sites can have a network of thousands of affiliates providing them with web site traffic through hyperlinks on

Prior knowledge of category size impacts visual search.

Science.gov (United States)

Wu, Rachel; McGee, Brianna; Echiverri, Chelsea; Zinszer, Benjamin D

2018-03-30

Prior research has shown that category search can be similar to one-item search (as measured by the N2pc ERP marker of attentional selection) for highly familiar, smaller categories (e.g., letters and numbers) because the finite set of items in a category can be grouped into one unit to guide search. Other studies have shown that larger, more broadly defined categories (e.g., healthy food) also can elicit N2pc components during category search, but the amplitude of these components is typically attenuated. Two experiments investigated whether the perceived size of a familiar category impacts category and exemplar search. We presented participants with 16 familiar company logos: 8 from a smaller category (social media companies) and 8 from a larger category (entertainment/recreation manufacturing companies). The ERP results from Experiment 1 revealed that, in a two-item search array, search was more efficient for the smaller category of logos compared to the larger category. In a four-item search array (Experiment 2), where two of the four items were placeholders, search was largely similar between the category types, but there was more attentional capture by nontarget members from the same category as the target for smaller rather than larger categories. These results support a growing literature on how prior knowledge of categories affects attentional selection and capture during visual search. We discuss the implications of these findings in relation to assessing cognitive abilities across the lifespan, given that prior knowledge typically increases with age. © 2018 Society for Psychophysiological Research.

A Diversity-Guided Particle Swarm Optimizer - the ARPSO

DEFF Research Database (Denmark)

Vesterstrøm, Jacob Svaneborg; Riget, Jacques

2002-01-01

The particle swarm optimization (PSO) algorithm is a new population based search strat- egy, which has exhibited good performance on well-known numerical test problems. How- ever, on strongly multi-modal test problems the PSO tends to suffer from premature convergence. This is due to a decrease...... that the ARPSO prevents premature convergence to a high degree, but still keeps a rapid convergence like the basic PSO. Thus, it clearly outperforms the basic PSO as well as the implemented GA in multi-modal optimization. Keywords Particle Swarm Optimization, Diversity-Guided Search 1 Introduction The PSO model...

Alcatel-Lucent Service Routing Architect (SRA) self-study guide preparing for the BGP, VPRN and Multicast exams

CERN Document Server

Warnock, Glenn; Shaheen, Ghassan

2015-01-01

A comprehensive resource for professionals preparing for Alcatel-Lucent Service Routing Architect (SRA) certification Networking professionals are taking note of Alcatel-Lucent and its quick ascent in the networking and telecom industries. IP networking professionals looking for a comprehensive guide to obtaining the Alcatel-Lucent Service Routing Architect (SRA) certification will be pleased to learn of this new publication, Alcatel-Lucent Service Routing Architect (SRA) Self-Study Guide: Preparing for the BGP, VPRN and Multicast Exams. The book comprises approximately 2,600 pages of print a

Bioassay-guided studies on the cytotoxic and in vitro trypanocidal ...

African Journals Online (AJOL)

This paper reports a bioassay-guided study to search for possible biological activity (cytotoxic and trypanocidal) in two Ugandan medicinal plants. The methodology adopted was the so-called ping-pong approach, involving phytochemical purification (column chromatography and preparative thin layer chromatography), ...

The safety of endothelin receptor antagonists in the treatment of pulmonary arterial hypertension: Protocol for a systemic review and network meta-analysis.

Science.gov (United States)

Gu, Zhi-Chun; Zhang, Yi-Jing; Pan, Mang-Mang; Zhang, Chi; Liu, Xiao-Yan; Wei, An-Hua; Su, Ying-Jie

2018-03-01

Pulmonary arterial hypertension (PAH) is a progressive disease and ultimately leads to right heart failure. Endothelin receptor antagonists (ERAs) have been demonstrated to significantly improve prognosis in PAH. However, ERAs-induced side effects can result in poor patient tolerance. Thus, we aim to evaluate current safety evidence of ERAs in PAH. An electronic search will be performed for randomized controlled trials (RCTs) that reported the interested safety data (abnormal liver function, peripheral edema, and anemia) of ERAs in PAH. Risk ratios (RRs) with their confidence intervals (CIs) and the surface under the cumulative ranking curve (SUCRA) will be calculated using a network analysis. This study will provide the safety evidence of ERAs in PAH by combining the results of individual studies based on direct- and network comparison, and to rank ERAs in the evidence network. The results will supplement missing evidence of head-to-head comparisons between different ERAs and guide both clinical decision-making and future research.

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

Science.gov (United States)

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

Guide to the Durham-Rutherford high energy physics databases

International Nuclear Information System (INIS)

Gault, F.D.; Lotts, A.P.; Read, B.J.; Crawford, R.L.; Roberts, R.G.

1979-12-01

New databases and graphics facilities are added in this edition of the guide. It explains, with examples, how to retrieve tabulated experimental scattering data from databases on the Rutherford Laboratory computer network. (author)

Search for gravitational wave bursts by the network of resonant detectors

CERN Document Server

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.

Creating collaboration opportunities for marine research across the Arctic: The SEARCH-ACCESS partnership and an emerging sea ice prediction research network

Science.gov (United States)

Eicken, H.; Bitz, C. M.; Gascard, J.; Kaminski, T.; Karcher, M. J.; Kauker, F.; Overland, J. E.; Stroeve, J. C.; Wiggins, H. V.

2013-12-01

Rapid Arctic environmental and socio-economic change presents major challenges and opportunities to Arctic residents, government agencies and the private sector. The Arctic Ocean and its ice cover, in particular, are in the midst of transformative change, ranging from declines in sea-ice thickness and summer ice extent to threats to coastal communities and increases in maritime traffic and offshore resource development. The US interagency Study of Environmental Arctic Change (SEARCH) and the European Arctic Climate Change, Economy and Society (ACCESS) project are addressing both scientific research needs and stakeholder information priorities to improve understanding and responses to Arctic change. Capacity building, coordination and integration of activities at the international level and across sectors and stakeholder groups are major challenges that have to be met. ACCESS and SEARCH build on long-standing collaborations with a focus on environmental change in the Arctic ocean-ice-atmosphere system and the most pressing research needs to inform marine policy, resource management and threats to Arctic coastal communities. To illustrate the approach, key results and major conclusions from this international coordination and collaboration effort, we focus on a nascent sea-ice prediction research network. This activity builds on the Arctic Sea Ice Outlook that was initiated by SEARCH and the European DAMOCLES project (a precursor to ACCESS) and has now grown into an international community of practice that synthesizes, evaluates and discusses sea-ice predictions on seasonal to interannual scales. Key goals of the effort which is now entering into a new phase include the comparative evaluation of different prediction approaches, including the combination of different techniques, the compilation of reference datasets and model output, guidance on the design and implementation of observing system efforts to improve predictions and information transfer into private

Wh-filler-gap dependency formation guides reflexive antecedent search

Directory of Open Access Journals (Sweden)

Michael eFrazier

2015-10-01

Full Text Available Prior studies on online sentence processing have shown that the parser can resolve non-local dependencies rapidly and accurately. This study investigates the interaction between the processing of two such non-local dependencies: wh-filler-gap dependencies (WhFGD and reflexive-antecedent dependencies. We show that reflexive-antecedent dependency resolution is sensitive to the presence of a WhFGD, and argue that the filler-gap dependency established by WhFGD resolution is selected online as the antecedent of a reflexive dependency. We investigate the processing of constructions like (1, where two NPs might be possible antecedents for the reflexive, namely which cowgirl and Mary. Even though Mary is linearly closer to the reflexive, the only grammatically licit antecedent for the reflexive is the more distant wh-NP, which cowgirl. 1. Which cowgirl did Mary expect to have injured herself due to negligence?Four eye-tracking text-reading experiments were conducted on examples like (1, differing in whether the embedded clause was non-finite (1 and 3 or finite (2 and 4, and in whether the tail of the wh-dependency intervened between the reflexive and its closest overt antecedent (1 and 2 or the wh-dependency was associated with a position earlier in the sentence (3 and 4.The results of Experiments 1 and 2 indicate the parser accesses the result of WhFGD formation during reflexive antecedent search. The resolution of a wh-dependency alters the representation that reflexive antecedent search operates over, allowing the grammatical but linearly distant antecedent to be accessed rapidly. In the absence of a long-distance WhFGD (Exp. 3 and 4, wh-NPs were not found to impact reading times of the reflexive, indicating that the parser's ability to select distant wh-NPs as reflexive antecedents crucially involves syntactic structure.

Mobile ad hoc networking

CERN Document Server

John Wiley & Sons

2004-01-01

"Assimilating the most up-to-date information on research and development activities in this rapidly growing area, Mobile Ad Hoc Networking covers physical, data link, network, and transport layers, as well as application, security, simulation, and power management issues in sensor, local area, personal, and mobile ad hoc networks. Each of the book's sixteen chapters has been written by a top expert and discusses in-depth the most important topics in the field. Mobile Ad Hoc Networking is an excellent reference and guide for professionals seeking an in-depth examination of topics that also provides a comprehensive overview of the current state-of-the-art."--Jacket.

XMPP The Definitive Guide

CERN Document Server

Saint-Andre, Peter; Smith, Kevin

2009-01-01

This practical book provides everything you need to know about the Extensible Messaging and Presence Protocol (XMPP) -- the open technology for real-time communication used in instant messaging, Voice over IP, real-time collaboration, social networking, microblogging, lightweight middleware, cloud computing, and more. XMPP: The Definitive Guide walks you through the thought processes and design decisions involved in building a complete XMPP-enabled application, and adding real-time interfaces to existing applications.

Complexities of social networks: A Physicist's perspective

OpenAIRE

Sen, Parongama

2006-01-01

The review is a survey of the present status of research in social networks highlighting the topics of small world property, degree distributions, community structure, assortativity, modelling, dynamics and searching in social networks.

A guide to wireless networking by light

Science.gov (United States)

Haas, Harald; Chen, Cheng; O'Brien, Dominic

2017-09-01

The lack of wireless spectrum in the radio frequency bands has led to a rapid growth in research in wireless networking using light, known as LiFi (light fidelity). In this paper an overview of the subsystems, challenges and techniques required to achieve this is presented.

Social network in patient safety: Social media visibility

Directory of Open Access Journals (Sweden)

Azucena Santillán García

2011-11-01

Full Text Available Internet social network (social media is a powerful communication tool, and its use is expanding significantly. This paper seeks to know the current state of visibility in online social networks of active citizen talking about patient safety. This is an observational cross-sectional study whose target population is the websites Facebook, Twitter and Tuenti in Spain. By three consecutive cuts social profiles were found using the searching terms “seguridad+paciente” and “safety+patient”. There were found 5 profiles on Facebook that met the search criteria, 6 on Twitter and none were found on Tuenti. It is concluded that although there is evidence of the rise of social networking, citizen network involved in patient safety appears not to be significantly represented within the social networks examined.

Virtual File System Mounting amp Searching With Network JVM For LAN

Directory of Open Access Journals (Sweden)

Nikita Kamble

2015-08-01

Full Text Available Computer technology has rapidly grown over past decades. Most of this can be attributed to the Internet as many computers now have a need to be networked together to establish an online connection. A local area network is a group of computers and associated devices that share a common communication line or wireless link to the service. Typically a LAN compasses computers and peripherals connected to a secure server within a small geographic area such as an office building or home computer and other mobile devices that share resources such as printer or network storage. A LAN is contrasted in principle to a wide area networkWANwhich covers a larger geographic distance and may involve leased telecom circuits while the media for LANs are locally managed. Ethernet are twisted pair cabling amp Wi-Fi are the two most common transmission technologies in use for LAN. The rise of virtualization has fueled the development of virtual LANWLANwhich allows network administrator to logically group network nodes amp partition their networks without the need for major infrastructure changes. In some situations a wireless LAN or Wi-Fi maybe preferable to a wired LAN because of its flexibility amp cost. Companies are asserting WLANs as a replacement for their wired infrastructure as the number of smart phones tablets amp other mobile devices proliferates.

A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

Directory of Open Access Journals (Sweden)

Leilei Cao

2016-01-01

Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

Visual search elicits the electrophysiological marker of visual working memory.

Directory of Open Access Journals (Sweden)

Stephen M Emrich

Full Text Available BACKGROUND: Although limited in capacity, visual working memory (VWM plays an important role in many aspects of visually-guided behavior. Recent experiments have demonstrated an electrophysiological marker of VWM encoding and maintenance, the contralateral delay activity (CDA, which has been shown in multiple tasks that have both explicit and implicit memory demands. Here, we investigate whether the CDA is evident during visual search, a thoroughly-researched task that is a hallmark of visual attention but has no explicit memory requirements. METHODOLOGY/PRINCIPAL FINDINGS: The results demonstrate that the CDA is present during a lateralized search task, and that it is similar in amplitude to the CDA observed in a change-detection task, but peaks slightly later. The changes in CDA amplitude during search were strongly correlated with VWM capacity, as well as with search efficiency. These results were paralleled by behavioral findings showing a strong correlation between VWM capacity and search efficiency. CONCLUSIONS/SIGNIFICANCE: We conclude that the activity observed during visual search was generated by the same neural resources that subserve VWM, and that this activity reflects the maintenance of previously searched distractors.

The Role of Search Speed in the Contextual Cueing of Children’s Attention

Science.gov (United States)

Darby, Kevin; Burling, Joseph; Yoshida, Hanako

2013-01-01

The contextual cueing effect is a robust phenomenon in which repeated exposure to the same arrangement of random elements guides attention to relevant information by constraining search. The effect is measured using an object search task in which a target (e.g., the letter T) is located within repeated or nonrepeated visual contexts (e.g., configurations of the letter L). Decreasing response times for the repeated configurations indicates that contextual information has facilitated search. Although the effect is robust among adult participants, recent attempts to document the effect in children have yielded mixed results. We examined the effect of search speed on contextual cueing with school-aged children, comparing three types of stimuli that promote different search times in order to observe how speed modulates this effect. Reliable effects of search time were found, suggesting that visual search speed uniquely constrains the role of attention toward contextually cued information. PMID:24505167

More than Just Finding Color: Strategy in Global Visual Search Is Shaped by Learned Target Probabilities

Science.gov (United States)

Williams, Carrick C.; Pollatsek, Alexander; Cave, Kyle R.; Stroud, Michael J.

2009-01-01

In 2 experiments, eye movements were examined during searches in which elements were grouped into four 9-item clusters. The target (a red or blue "T") was known in advance, and each cluster contained different numbers of target-color elements. Rather than color composition of a cluster invariantly guiding the order of search though…

Comparative performance of some popular artificial neural network ...

Indian Academy of Sciences (India)

tificial neural network domain (viz., local search algorithms, global search ... branches of astronomy for automated data analysis and other applications like ...... such as standard backpropagation, fuzzy logic, genetic algorithms, fractals etc.,.

Design alternatives for wavelength routing networks

Science.gov (United States)

Miliotis, K.; Papadimitriou, G. I.; Pomportsis, A. S.

2003-03-01

This paper attempts to provide a high level overview of many of the technologies employed in optical networks with a focus on wavelength-routing networks. Optical networks involve a number of technologies from the physics of light through protocols and networks architectures. In fact there is so much technology and know-how that most people involved with optical networks only have a full understanding of the narrow area they deal with. We start first examining the principles that govern light and its use as a wave guide, and then turn our focus to the various components that constitute an optical network and conclude with the description of all optical networks and wavelength-routed networks in greater detail.

From Quisqueya: In Search of New Horizons. Dominican Cultural Heritage Resource Guide.

Science.gov (United States)

Alcantara, Anibal; Aquino, Jaime; Lantigua, Juan A.; Rodriguez, Digna; Soto, Alejandro

This cultural heritage resource guide has been prepared as a tool for teachers to help them understand the cultural heritage of Dominican students and their communities. The Dominican Republic, which occupies two-thirds of the island of Hispaniola, has a long history dominated by the struggle for independence. In their efforts to create a better…

Remembered but Unused: The Accessory Items in Working Memory that Do Not Guide Attention

Science.gov (United States)

Peters, Judith C.; Goebel, Rainer; Roelfsema, Pieter R.

2009-01-01

If we search for an item, a representation of this item in our working memory guides attention to matching items in the visual scene. We can hold multiple items in working memory. Do all these items guide attention in parallel? We asked participants to detect a target object in a stream of objects while they maintained a second item in memory for…

Visual search in the real world: Color vision deficiency affects peripheral guidance, but leaves foveal verification largely unaffected

Directory of Open Access Journals (Sweden)

Günter eKugler

2015-12-01

Full Text Available Background: People with color vision deficiencies report numerous limitations in daily life. However, they use basic color terms systematically and in a similar manner as people with people with normal color vision. We hypothesize that a possible explanation for this discrepancy between color perception and behavioral consequences might be found in the gaze behavior of people with color vision deficiency.Methods: A group of participants with color vision deficiencies and a control group performed several search tasks in a naturalistic setting on a lawn.Results: Search performance was similar in both groups in a color-unrelated search task as well as in a search for yellow targets. While searching for red targets, color vision deficient participants exhibited a strongly degraded performance. This was closely matched by the number of fixations on red objects shown by the two groups. Importantly, once they fixated a target, participants with color vision deficiencies exhibited only few identification errors. Conclusions: Participants with color vision deficiencies are not able to enhance their search for red targets on a (green lawn by an efficient guiding mechanism. The data indicate that the impaired guiding is the main influence on search performance, while foveal identification (verification largely unaffected.

Conceptualizing of Social Networking Sites