WorldWideScience

Sample records for network guided search

  1. Networked innovations in guided tours

    DEFF Research Database (Denmark)

    Meged, Jane Widtfeldt; Zillinger, Malin

    The paper investigates how network innovations take place within the sharing economy based on a casestudy of free guided tour Companies in Copenhagen......The paper investigates how network innovations take place within the sharing economy based on a casestudy of free guided tour Companies in Copenhagen...

  2. GNS3 network simulation guide

    CERN Document Server

    Welsh, Chris

    2013-01-01

    GNS3 Network Simulation Guide is an easy-to-follow yet comprehensive guide which is written in a tutorial format helping you grasp all the things you need for accomplishing your certification or simulation goal. If you are a networking professional who wants to learn how to simulate networks using GNS3, this book is ideal for you. The introductory examples within the book only require minimal networking knowledge, but as the book progresses onto more advanced topics, users will require knowledge of TCP/IP and routing.

  3. Networked innovations in guided tours

    DEFF Research Database (Denmark)

    Meged, Jane Widtfeldt; Zillinger, Malin

    This presentation is about a case study being done on networked innovation that is taking place within the scene of free guided tours in Copenhagen. Data has been collected on interactions between actors within the network of peers. In this way, both the own organisation and the actual market is ...

  4. Race Guides Attention in Visual Search.

    Directory of Open Access Journals (Sweden)

    Marte Otten

    Full Text Available It is known that faces are rapidly and even unconsciously categorized into social groups (black vs. white, male vs. female. Here, I test whether preferences for specific social groups guide attention, using a visual search paradigm. In Experiment 1 participants searched displays of neutral faces for an angry or frightened target face. Black target faces were detected more efficiently than white targets, indicating that black faces attracted more attention. Experiment 2 showed that attention differences between black and white faces were correlated with individual differences in automatic race preference. In Experiment 3, using happy target faces, the attentional preference for black over white faces was eliminated. Taken together, these results suggest that automatic preferences for social groups guide attention to individuals from negatively valenced groups, when people are searching for a negative emotion such as anger or fear.

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

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

  7. Search in spatial scale-free networks

    International Nuclear Information System (INIS)

    Thadakamalla, H P; Albert, R; Kumara, S R T

    2007-01-01

    We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms

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

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

  10. Comparison tomography relocation hypocenter grid search and guided grid search method in Java island

    International Nuclear Information System (INIS)

    Nurdian, S. W.; Adu, N.; Palupi, I. R.; Raharjo, W.

    2016-01-01

    The main data in this research is earthquake data recorded from 1952 to 2012 with 9162 P wave and 2426 events are recorded by 30 stations located around Java island. Relocation hypocenter processed using grid search and guidded grid search method. Then the result of relocation hypocenter become input for tomography pseudo bending inversion process. It can be used to identification the velocity distribution in subsurface. The result of relocation hypocenter by grid search and guided grid search method after tomography process shown in locally and globally. In locally area grid search method result is better than guided grid search according to geological reseach area. But in globally area the result of guided grid search method is better for a broad area because the velocity variation is more diverse than the other one and in accordance with local geological research conditions. (paper)

  11. User Interactive Guided Search Design Environment, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Phoenix Integration's vision is to create an intuitive human-in-the-loop engineering design environment called Guided Search that leverages recent advances in...

  12. CCNA Cisco Certified Network Associate Study Guide

    CERN Document Server

    Lammle, Todd

    2011-01-01

    Learn from the Best - Cisco Networking Authority Todd LammleWritten by Cisco networking authority Todd Lammle, this comprehensive guide has been completely updated to reflect the latest CCNA 640-802 exam. Todd's straightforward style provides lively examples, hands on and written labs, easy-to-understand analogies, and real-world scenarios that will not only help you prepare for the exam, but also give you a solid foundation as a Cisco networking professional.This Study Guide teaches you how toDescribe how a network worksConfigure, verify and troubleshoot a switch with VLANs and interswitch co

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

  14. Searching social networks for subgraph patterns

    Science.gov (United States)

    Ogaard, Kirk; Kase, Sue; Roy, Heather; Nagi, Rakesh; Sambhoos, Kedar; Sudit, Moises

    2013-06-01

    Software tools for Social Network Analysis (SNA) are being developed which support various types of analysis of social networks extracted from social media websites (e.g., Twitter). Once extracted and stored in a database such social networks are amenable to analysis by SNA software. This data analysis often involves searching for occurrences of various subgraph patterns (i.e., graphical representations of entities and relationships). The authors have developed the Graph Matching Toolkit (GMT) which provides an intuitive Graphical User Interface (GUI) for a heuristic graph matching algorithm called the Truncated Search Tree (TruST) algorithm. GMT is a visual interface for graph matching algorithms processing large social networks. GMT enables an analyst to draw a subgraph pattern by using a mouse to select categories and labels for nodes and links from drop-down menus. GMT then executes the TruST algorithm to find the top five occurrences of the subgraph pattern within the social network stored in the database. GMT was tested using a simulated counter-insurgency dataset consisting of cellular phone communications within a populated area of operations in Iraq. The results indicated GMT (when executing the TruST graph matching algorithm) is a time-efficient approach to searching large social networks. GMT's visual interface to a graph matching algorithm enables intelligence analysts to quickly analyze and summarize the large amounts of data necessary to produce actionable intelligence.

  15. Realistic searches on stretched exponential networks

    Indian Academy of Sciences (India)

    www.ias.ac.in/article/fulltext/pram/071/02/0313-0317. Keywords. Small world effect; dynamic paths; social distances. Abstract. We consider navigation or search schemes on networks which have a degree distribution of the form () ∝ exp(−).

  16. Realistic searches on stretched exponential networks

    Indian Academy of Sciences (India)

    Vol. 71, No. 2. — journal of. August 2008 physics pp. 313–317. Realistic searches on stretched exponential networks. PARONGAMA SEN. Department of Physics, University of Calcutta, 92 Acharya Prafulla Chandra Road,. Kolkata 700 009, India .... [4] S Milgram, Psychology Today 1, 60 (1967). J Travers and S Milgram, ...

  17. Neural field model of memory-guided search.

    Science.gov (United States)

    Kilpatrick, Zachary P; Poll, Daniel B

    2017-12-01

    Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

  18. Neural field model of memory-guided search

    Science.gov (United States)

    Kilpatrick, Zachary P.; Poll, Daniel B.

    2017-12-01

    Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

  19. Tabu search algorithms for water network optimization

    OpenAIRE

    Cunha, Maria da Conceição; Ribeiro, Luísa

    2004-01-01

    In this paper we propose a tabu search algorithm to find the least-cost design of looped water distribution networks. The mathematical nature of this optimization problem, a nonlinear mixed integer problem, is at the origin of a multitude of contributions to the literature in the last 25 years. In fact, exact optimization methods have not been found for this type of problem, and, in the past, classical optimization methods, like linear and nonlinear programming, were tried at the cost of dras...

  20. Web Feet Guide to Search Engines: Finding It on the Net.

    Science.gov (United States)

    Web Feet, 2001

    2001-01-01

    This guide to search engines for the World Wide Web discusses selecting the right search engine; interpreting search results; major search engines; online tutorials and guides; search engines for kids; specialized search tools for various subjects; and other specialized engines and gateways. (LRW)

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

  2. Cytoscape ESP: simple search of complex biological networks.

    Science.gov (United States)

    Ashkenazi, Maital; Bader, Gary D; Kuchinsky, Allan; Moshelion, Menachem; States, David J

    2008-06-15

    Cytoscape enhanced search plugin (ESP) enables searching complex biological networks on multiple attribute fields using logical operators and wildcards. Queries use an intuitive syntax and simple search line interface. ESP is implemented as a Cytoscape plugin and complements existing search functions in the Cytoscape network visualization and analysis software, allowing users to easily identify nodes, edges and subgraphs of interest, even for very large networks. Availabiity: http://chianti.ucsd.edu/cyto_web/plugins/ ashkenaz@agri.huji.ac.il.

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

  4. Improved Degree Search Algorithms in Unstructured P2P Networks

    Directory of Open Access Journals (Sweden)

    Guole Liu

    2012-01-01

    Full Text Available Searching and retrieving the demanded correct information is one important problem in networks; especially, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer (P2P networks. Breadth-first search (BFS and depth-first search (DFS are the current two typical search methods. BFS-based algorithms show the perfect performance in the aspect of search success rate of network resources, while bringing the huge search messages. On the contrary, DFS-based algorithms reduce the search message quantity and also cause the dropping of search success ratio. To address the problem that only one of performances is excellent, we propose two memory function degree search algorithms: memory function maximum degree algorithm (MD and memory function preference degree algorithm (PD. We study their performance including the search success rate and the search message quantity in different networks, which are scale-free networks, random graph networks, and small-world networks. Simulations show that the two performances are both excellent at the same time, and the performances are improved at least 10 times.

  5. CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks

    Directory of Open Access Journals (Sweden)

    Hongyan Mei

    2014-01-01

    Full Text Available Efficient searching for resources has become a challenging task with less network bandwidth consumption in unstructured peer-to-peer (P2P networks. Heuristic search mechanism is an effective method which depends on the previous searches to guide future ones. In the proposed methods, searching for high-repetition resources is more effective. However, the performances of the searches for nonrepetition or low-repetition or rare resources need to be improved. As for this problem, considering the similarity between social networks and unstructured P2P networks, we present a credibility search algorithm based on different queries according to the trust production principle in sociology and psychology. In this method, queries are divided into familiar queries and unfamiliar queries. For different queries, we adopt different ways to get the credibility of node to its each neighbor. And then queries should be forwarded by the neighbor nodes with higher credibility. Experimental results show that our method can improve query hit rate and reduce search delay with low bandwidth consumption in three different network topologies under static and dynamic network environments.

  6. Comptia Network+ review guide exam N10-006

    CERN Document Server

    Ferguson, Bill

    2015-01-01

    Be prepared for the Network+ exam CompTIA Network+ Review Guide is your ideal study companion for preparing for the CompTIA Network+ exam (N10-006). This concise review is the perfect companion to the CompTIA Network+ Study Guide and the CompTIA Network+ Deluxe Study Guide, with full exam coverage organized by objective for quick review and reinforcement of key topics. Each of the book's five parts is devoted to a specific domain area of the exam, providing a focused review to bolster areas of weak understanding. You get access to the Sybex test engine, which includes two bonus practice tests

  7. Underwater Sensor Network Redeployment Algorithm Based on Wolf Search.

    Science.gov (United States)

    Jiang, Peng; Feng, Yang; Wu, Feng

    2016-10-21

    This study addresses the optimization of node redeployment coverage in underwater wireless sensor networks. Given that nodes could easily become invalid under a poor environment and the large scale of underwater wireless sensor networks, an underwater sensor network redeployment algorithm was developed based on wolf search. This study is to apply the wolf search algorithm combined with crowded degree control in the deployment of underwater wireless sensor networks. The proposed algorithm uses nodes to ensure coverage of the events, and it avoids the prematurity of the nodes. The algorithm has good coverage effects. In addition, considering that obstacles exist in the underwater environment, nodes are prevented from being invalid by imitating the mechanism of avoiding predators. Thus, the energy consumption of the network is reduced. Comparative analysis shows that the algorithm is simple and effective in wireless sensor network deployment. Compared with the optimized artificial fish swarm algorithm, the proposed algorithm exhibits advantages in network coverage, energy conservation, and obstacle avoidance.

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

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

  10. 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...... creates downward sloping reemployment hazards which the basic model does not, and under increasing network returns these hazards are significantly convex as we see in the data. Going into more detail we find that the network gets partially destroyed in periods of high unemployment and generates less job...

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

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

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

  14. Optical networking standards a comprehensive guide for professionals

    CERN Document Server

    2006-01-01

    Optical Networking Standards: A Comprehensive Guide for Professionals provides a single source reference of over a hundred standards and industry technical specifications for optical networks at all levels: from components to networking systems through global networks, as well as coverage of networks management and services. This book focuses on the recently approved, adopted and implemented standards that have fueled the development of versatile switches, routers and multi-service provisioning platforms. These networking elements have enabled the service-providers world-wide to offer flexible yet customized bundled-services based on IP, MPLS and Carrier-Grade Ethernet.

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

  16. A user’s guide to network analysis in R

    CERN Document Server

    Luke, Douglas

    2015-01-01

    Presenting a comprehensive resource for the mastery of network analysis in R, the goal of Network Analysis with R is to introduce modern network analysis techniques in R to social, physical, and health scientists. The mathematical foundations of network analysis are emphasized in an accessible way and readers are guided through the basic steps of network studies: network conceptualization, data collection and management, network description, visualization, and building and testing statistical models of networks. As with all of the books in the Use R! series, each chapter contains extensive R code and detailed visualizations of datasets. Appendices will describe the R network packages and the datasets used in the book. An R package developed specifically for the book, available to readers on GitHub, contains relevant code and real-world network datasets as well.

  17. Understanding crowd-powered search groups: a social network perspective.

    Directory of Open Access Journals (Sweden)

    Qingpeng Zhang

    Full Text Available Crowd-powered search is a new form of search and problem solving scheme that involves collaboration among a potentially large number of voluntary Web users. Human flesh search (HFS, a particular form of crowd-powered search originated in China, has seen tremendous growth since its inception in 2001. HFS presents a valuable test-bed for scientists to validate existing and new theories in social computing, sociology, behavioral sciences, and so forth.In this research, we construct an aggregated HFS group, consisting of the participants and their relationships in a comprehensive set of identified HFS episodes. We study the topological properties and the evolution of the aggregated network and different sub-groups in the network. We also identify the key HFS participants according to a variety of measures.We found that, as compared with other online social networks, HFS participant network shares the power-law degree distribution and small-world property, but with a looser and more distributed organizational structure, leading to the diversity, decentralization, and independence of HFS participants. In addition, the HFS group has been becoming increasingly decentralized. The comparisons of different HFS sub-groups reveal that HFS participants collaborated more often when they conducted the searches in local platforms or the searches requiring a certain level of professional knowledge background. On the contrary, HFS participants did not collaborate much when they performed the search task in national platforms or the searches with general topics that did not require specific information and learning. We also observed that the key HFS information contributors, carriers, and transmitters came from different groups of HFS participants.

  18. How Will Online Affiliate Marketing Networks Impact Search Engine Rankings?

    OpenAIRE

    Janssen, D.; van Heck, H.W.G.M.

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

  19. SAGA: a hybrid search algorithm for Bayesian Network structure learning of transcriptional regulatory networks.

    Science.gov (United States)

    Adabor, Emmanuel S; Acquaah-Mensah, George K; Oduro, Francis T

    2015-02-01

    Bayesian Networks have been used for the inference of transcriptional regulatory relationships among genes, and are valuable for obtaining biological insights. However, finding optimal Bayesian Network (BN) is NP-hard. Thus, heuristic approaches have sought to effectively solve this problem. In this work, we develop a hybrid search method combining Simulated Annealing with a Greedy Algorithm (SAGA). SAGA explores most of the search space by undergoing a two-phase search: first with a Simulated Annealing search and then with a Greedy search. Three sets of background-corrected and normalized microarray datasets were used to test the algorithm. BN structure learning was also conducted using the datasets, and other established search methods as implemented in BANJO (Bayesian Network Inference with Java Objects). The Bayesian Dirichlet Equivalence (BDe) metric was used to score the networks produced with SAGA. SAGA predicted transcriptional regulatory relationships among genes in networks that evaluated to higher BDe scores with high sensitivities and specificities. Thus, the proposed method competes well with existing search algorithms for Bayesian Network structure learning of transcriptional regulatory networks. Copyright © 2014 Elsevier Inc. All rights reserved.

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

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

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

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

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

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

  6. Transportation research methods : a guide to searching for funding opportunities.

    Science.gov (United States)

    2017-03-01

    This project developed a training methodology focused on external funding. This hands-on training presented the basics of external funding identification, teambuilding and collaborative partners, and proposal element design. Real-time searches and tu...

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

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

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

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

  11. QNAP 1263U Network Attached Storage (NAS)/ Storage Area Network (SAN) Device Users Guide

    Science.gov (United States)

    2016-11-01

    ARL-TN-0804 ● NOV 2016 US Army Research Laboratory QNAP 1263U Network Attached Storage ( NAS )/ Storage Area Network ( SAN ) Device...2016 US Army Research Laboratory QNAP 1263U Network Attached Storage ( NAS )/ Storage Area Network ( SAN ) Device User’s Guide by Benjamin...locking, the NAS will transfer data at a file level. A SAN uses the iSCSI transfer protocol to open the disks to the computer as local hard drives. As

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

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

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

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

  16. Customer Targeting: A Neural Network Approach Guided by Genetic Algorithms

    OpenAIRE

    YongSeog Kim; W. Nick Street; Gary J. Russell; Filippo Menczer

    2005-01-01

    One of the key problems in database marketing is the identification and profiling of households that are most likely to be interested in a particular product or service. Principal component analysis (PCA) of customer background information followed by logistic regression analysis of response behavior is commonly used by database marketers. In this paper, we propose a new approach that uses artificial neural networks (ANNs) guided by genetic algorithms (GAs) to target households. We show that ...

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

  18. PCA-Guided Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Gong Chen

    2012-01-01

    Full Text Available An important performance concern for wireless sensor networks (WSNs is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA by exploring the principal component analysis (PCA approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimal K-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

  19. Training Feedforward Neural Networks Using Symbiotic Organisms Search Algorithm.

    Science.gov (United States)

    Wu, Haizhou; Zhou, Yongquan; Luo, Qifang; Basset, Mohamed Abdel

    2016-01-01

    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.

  20. Gaze in Visual Search Is Guided More Efficiently by Positive Cues than by Negative Cues.

    Science.gov (United States)

    Kugler, Günter; 't Hart, Bernard Marius; Kohlbecher, Stefan; Einhäuser, Wolfgang; Schneider, Erich

    2015-01-01

    Visual search can be accelerated when properties of the target are known. Such knowledge allows the searcher to direct attention to items sharing these properties. Recent work indicates that information about properties of non-targets (i.e., negative cues) can also guide search. In the present study, we examine whether negative cues lead to different search behavior compared to positive cues. We asked observers to search for a target defined by a certain shape singleton (broken line among solid lines). Each line was embedded in a colored disk. In "positive cue" blocks, participants were informed about possible colors of the target item. In "negative cue" blocks, the participants were informed about colors that could not contain the target. Search displays were designed such that with both the positive and negative cues, the same number of items could potentially contain the broken line ("relevant items"). Thus, both cues were equally informative. We measured response times and eye movements. Participants exhibited longer response times when provided with negative cues compared to positive cues. Although negative cues did guide the eyes to relevant items, there were marked differences in eye movements. Negative cues resulted in smaller proportions of fixations on relevant items, longer duration of fixations and in higher rates of fixations per item as compared to positive cues. The effectiveness of both cue types, as measured by fixations on relevant items, increased over the course of each search. In sum, a negative color cue can guide attention to relevant items, but it is less efficient than a positive cue of the same informational value.

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

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

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

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

  5. Guided search for hybrid systems based on coarse-grained space abstractions.

    Science.gov (United States)

    Bogomolov, Sergiy; Donzé, Alexandre; Frehse, Goran; Grosu, Radu; Johnson, Taylor T; Ladan, Hamed; Podelski, Andreas; Wehrle, Martin

    Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space ). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search . Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential.

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

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

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

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

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

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

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

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

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

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

  16. Oriented multicast routing algorithm applied to network-level agent search

    Directory of Open Access Journals (Sweden)

    Damien Magoni

    2001-12-01

    Full Text Available Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a searching technique based on an algorithm called expanding rings search. This algorithm searches for nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To enable this broadcast restriction, we propose an oriented multicast routing algorithm. The algorithm's principle is to direct the multicast of packets towards a special node, involved in the communication, in order to search only in a limited area. The area must be as small as possible to reduce network flooding but still has to contain many nodes satisfying the search criteria. This new algorithm is the core part of a network-level node search framework also defined herein. A search protocol based on this framework could provide a network-level agent discovery service to current protocols. We have simulated an agent search with our algorithm on one side and with the expanding rings' algorithm on the other side and we give comparative results.

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

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

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

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

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

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

  3. 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-02-26

    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.

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

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

  6. A Search for top quark using artificial neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Amidi, Erfan [Northeastern Univ., Boston, MA (United States)

    1996-02-01

    The neural networks method has been applied to 75 pb-1 of data collected by the D0 detector at Fermilab during the 1993-1995 p$\\bar{p}$ collider run at √s = 1.8 TeV, to isolate the top quark in the e+jets+ET channel.

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

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

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

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

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

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

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

  14. Precise localizations and counterpart searches of GRBs from the 2nd interplanetary network

    International Nuclear Information System (INIS)

    Hack, F.; Hurley, K.; Atteia, J.; Barat, C.; Niel, M.; Cline, T.; Dennis, B.; Kouveliotou, C.; Klebesadel, R.; Laros, J.; Kurt, V.; Kuznetsov, A.; Zenchenko, V.

    1994-01-01

    The second interplanetary network of GRB detectors operated between 1981 and 1984. It consisted of the Venera 13 and V14 spacecraft (SIGNE detectors), PVO, ICE, and SMM (HXRBS detector). Many of the approximately 90 cosmic GRBs it detected can be localized to a high accuracy. Such localizations will make a better estimate of the burster recurrence time possible and contribute to the search for quiescent counterparts. We will present a number of localizations to illustrate the potential of this network, discuss the techniques we use to perform multi-wavelength counterpart searches, and compare present and promising future localization techniques

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

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

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

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

  19. Targeting Neuronal Networks with Combined Drug and Stimulation Paradigms Guided by Neuroimaging to Treat Brain Disorders.

    Science.gov (United States)

    Faingold, Carl L; Blumenfeld, Hal

    2015-10-01

    Improved therapy of brain disorders can be achieved by focusing on neuronal networks, utilizing combined pharmacological and stimulation paradigms guided by neuroimaging. Neuronal networks that mediate normal brain functions, such as hearing, interact with other networks, which is important but commonly neglected. Network interaction changes often underlie brain disorders, including epilepsy. "Conditional multireceptive" (CMR) brain areas (e.g., brainstem reticular formation and amygdala) are critical in mediating neuroplastic changes that facilitate network interactions. CMR neurons receive multiple inputs but exhibit extensive response variability due to milieu and behavioral state changes and are exquisitely sensitive to agents that increase or inhibit GABA-mediated inhibition. Enhanced CMR neuronal responsiveness leads to expression of emergent properties--nonlinear events--resulting from network self-organization. Determining brain disorder mechanisms requires animals that model behaviors and neuroanatomical substrates of human disorders identified by neuroimaging. However, not all sites activated during network operation are requisite for that operation. Other active sites are ancillary, because their blockade does not alter network function. Requisite network sites exhibit emergent properties that are critical targets for pharmacological and stimulation therapies. Improved treatment of brain disorders should involve combined pharmacological and stimulation therapies, guided by neuroimaging, to correct network malfunctions by targeting specific network neurons. © The Author(s) 2015.

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

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

  2. In search of a network theory of innovations: relations, positions, and perspectives

    NARCIS (Netherlands)

    Leydesdorff, L.; Ahrweiler, P.

    2014-01-01

    As a complement to Nelson and Winter's (1977) article titled "In Search of a Useful Theory of Innovation," a sociological perspective on innovation networks can be elaborated using Luhmann's social systems theory, on the one hand, and Latour's "sociology of translations," on the other. Because of a

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

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

  5. PISA: Federated Search in P2P Networks with Uncooperative Peers

    Science.gov (United States)

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

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

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

  7. Stacking the invisibles: A guided search for low-luminosity Milky Way satellites

    Energy Technology Data Exchange (ETDEWEB)

    Sesar, Branimir; Banholzer, Sophianna R.; Cohen, Judith G.; Levitan, David; Kulkarni, Shrinivas R.; Prince, Thomas A. [Division of Physics, Mathematics and Astronomy, California Institute of Technology, Pasadena, CA 91125 (United States); Martin, Nicolas F.; Rix, Hans-Walter [Max Planck Institute for Astronomy, Königstuhl 17, D-69117 Heidelberg (Germany); Grillmair, Carl J.; Laher, Russ R.; Surace, Jason A. [Spitzer Science Center, California Institute of Technology, Pasadena, CA 91125 (United States); Ofek, Eran O., E-mail: bsesar@mpia.de [Benoziyo Center for Astrophysics, Weizmann Institute of Science, 76100 Rehovot (Israel)

    2014-10-01

    Almost every known low-luminosity Milky Way dwarf spheroidal (dSph) satellite galaxy contains at least one RR Lyrae star. Assuming that a fraction of distant (60 < d {sub helio} < 100 kpc) Galactic halo RR Lyrae stars are members of yet to be discovered low-luminosity dSph galaxies, we perform a guided search for these low-luminosity dSph galaxies. In order to detect the presence of dSph galaxies, we combine stars selected from more than 123 sightlines centered on RR Lyrae stars identified by the Palomar Transient Factory. We find that this method is sensitive enough to detect the presence of Segue 1-like galaxies (M{sub V}=−1.5{sub −0.8}{sup +0.6}, r{sub h} = 30 pc) even if only ∼20 sightlines were occupied by such dSph galaxies. Yet, when our method is applied to the Sloan Digital Sky Survey Data Release 10 imaging catalog, no signal is detected. An application of our method to sightlines occupied by pairs of close (<200 pc) horizontal branch stars, also did not yield a detection. Thus, we place upper limits on the number of low-luminosity dSph galaxies with half-light radii from 30 pc to 120 pc, and in the probed volume of the halo. Stronger constraints on the luminosity function may be obtained by applying our method to sightlines centered on RR Lyrae stars selected from the Pan-STARRS1 survey, and eventually, from the Large Synoptic Survey Telescope. In Appendix A, we present spectroscopic observations of an RRab star in the Boötes 3 dSph and a light curve of an RRab star near the Boötes 2 dSph.

  8. Tabu search methods for multicommodity capcitated fixed charge network design problem

    Energy Technology Data Exchange (ETDEWEB)

    Crainic, T.; Farvolden, J.; Gendreau, M.; Soriano, P.

    1994-12-31

    We address the fixed charge capacitated multicommodity network flow problem with linear costs and no additional side constraints, and present two solution approaches based on the tabu search metaheuristic. In the first case, the search is conducted by exploring the space of the design (integer) variables, while neighbors are evaluated and moves are selected via a capacitated multicommodity minimum cost network flow subproblem. The second approach integrates simplex pivoting rules into a tabu search framework. Here, the search explores the space of flow path variables when all design arcs are open, by using column generation to obtain new variables, and pivoting to determine and evaluate the neighbors of any given solution. Adapting this idea within our tabu search framework represents an interesting challenge, since several of the standard assumptions upon which column generation schemes are based are no longer verified. In particular, the monotonic decrease of the objective function value is no longer ensured, and both variable and fixed costs characterize arcs. On the other hand, the precise definition and generation of the tabu search neighborhoods in a column generation context poses an additional challenge, linked particularly to the description and identification of path variables. We describe the various components, implementation challenges and behaviour of each of the two algorithms, and compare their computational and solution quality performance. Comparisons with known bounding procedures will be presented as well.

  9. The Poor Man's Guide to Computer Networks and their Applications

    DEFF Research Database (Denmark)

    Sharp, Robin

    2003-01-01

    These notes for DTU course 02220, Concurrent Programming, give an introduction to computer networks, with focus on the modern Internet. Basic Internet protocols such as IP, TCP and UDP are presented, and two Internet application protocols, SMTP and HTTP, are described in some detail. Techniques f...... for network programming are described, with concrete examples in Java. Techniques considered include simple socket programming, RMI, Corba, and Web services with SOAP....

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

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

    Science.gov (United States)

    Biedermann, Alex; Vuille, Joëlle; Taroni, Franco

    2012-08-01

    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. 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. 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. 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. The method's graphical environment, along

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

  13. Average Precision: Good Guide or False Friend to Multimedia Search Effectiveness?

    NARCIS (Netherlands)

    Aly, Robin; Trieschnigg, Rudolf Berend; McGuinness, Kevin; O' Connor, Noel E.; de Jong, Franciska M.G.

    Approaches to multimedia search often evolve from existing approaches with strong average precision. However, work on search evaluation shows that average precision does not always capture effectiveness in terms of satisfying user needs because it ignores the diversity of search results. This paper

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

  15. SEARCH

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

    Chaitali Sinha

    Anexo B: Lista de verificación para presentar una nota conceptual en el marco de IDRC-SEARCH ....... 17 .... incluir investigación primaria y/o síntesis de estudios existentes, para generar nuevo conocimiento. Los .... de datos entre grupos diferentes de usuarios (trabajadores de la salud comunitaria, funcionarios de salud.

  16. Design and Implementation of Sound Searching Robots in Wireless Sensor Networks.

    Science.gov (United States)

    Han, Lianfu; Shen, Zhengguang; Fu, Changfeng; Liu, Chao

    2016-09-21

    A sound target-searching robot system which includes a 4-channel microphone array for sound collection, magneto-resistive sensor for declination measurement, and a wireless sensor networks (WSN) for exchanging information is described. It has an embedded sound signal enhancement, recognition and location method, and a sound searching strategy based on a digital signal processor (DSP). As the wireless network nodes, three robots comprise the WSN a personal computer (PC) in order to search the three different sound targets in task-oriented collaboration. The improved spectral subtraction method is used for noise reduction. As the feature of audio signal, Mel-frequency cepstral coefficient (MFCC) is extracted. Based on the K-nearest neighbor classification method, we match the trained feature template to recognize sound signal type. This paper utilizes the improved generalized cross correlation method to estimate time delay of arrival (TDOA), and then employs spherical-interpolation for sound location according to the TDOA and the geometrical position of the microphone array. A new mapping has been proposed to direct the motor to search sound targets flexibly. As the sink node, the PC receives and displays the result processed in the WSN, and it also has the ultimate power to make decision on the received results in order to improve their accuracy. The experiment results show that the designed three-robot system implements sound target searching function without collisions and performs well.

  17. Design and Implementation of Sound Searching Robots in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Lianfu Han

    2016-09-01

    Full Text Available A sound target-searching robot system which includes a 4-channel microphone array for sound collection, magneto-resistive sensor for declination measurement, and a wireless sensor networks (WSN for exchanging information is described. It has an embedded sound signal enhancement, recognition and location method, and a sound searching strategy based on a digital signal processor (DSP. As the wireless network nodes, three robots comprise the WSN a personal computer (PC in order to search the three different sound targets in task-oriented collaboration. The improved spectral subtraction method is used for noise reduction. As the feature of audio signal, Mel-frequency cepstral coefficient (MFCC is extracted. Based on the K-nearest neighbor classification method, we match the trained feature template to recognize sound signal type. This paper utilizes the improved generalized cross correlation method to estimate time delay of arrival (TDOA, and then employs spherical-interpolation for sound location according to the TDOA and the geometrical position of the microphone array. A new mapping has been proposed to direct the motor to search sound targets flexibly. As the sink node, the PC receives and displays the result processed in the WSN, and it also has the ultimate power to make decision on the received results in order to improve their accuracy. The experiment results show that the designed three-robot system implements sound target searching function without collisions and performs well.

  18. A guide to integrating transcriptional regulatory and metabolic networks using PROM (probabilistic regulation of metabolism).

    Science.gov (United States)

    Simeonidis, Evangelos; Chandrasekaran, Sriram; Price, Nathan D

    2013-01-01

    The integration of transcriptional regulatory and metabolic networks is a crucial step in the process of predicting metabolic behaviors that emerge from either genetic or environmental changes. Here, we present a guide to PROM (probabilistic regulation of metabolism), an automated method for the construction and simulation of integrated metabolic and transcriptional regulatory networks that enables large-scale phenotypic predictions for a wide range of model organisms.

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

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

  1. DDN (Defence Data Network) Protocol Implementations and Vendors Guide

    Science.gov (United States)

    1988-08-01

    Artificial Intelligence Laboratory Room NE43-723 545 Technology Square Cambridge, MA 02139 (617) 253-8843 S John Wroclawski, (JTW@AI.AJ.MIT.EDU...Massachusetts Institute of Technology Artificial Intelligence Laboratory Room NE43-743 545 Technology Square 0 Cambridge, MA 02139 (617) 253-7885 ORDERING...TCP/IP Network Software for PC-DOS Systems CPU: IBM-PC/XT/AT/compatible in conjunction with EXOS 205 Inteligent Ethernet Controller for PCbus 0/s

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

    Science.gov (United States)

    2011-05-05

    ...-2011-0004] Public Health Information Network (PHIN) Messaging Guide for Syndromic Surveillance AGENCY... the Department of Health and Human Services (HHS) is requesting public comment on the draft PHIN... address: Public Health Informatics and Technology Program Office, Centers for Disease Control and...

  3. Quantify uncertain emergency search techniques (QUEST) -- Theory and user`s guide

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, M.M.; Goldsby, M.E.; Plantenga, T.D.; Porter, T.L.; West, T.H.; Wilcox, W.B. [Sandia National Labs., Livermore, CA (United States). Systems Studies Dept.; Hensley, W.K. [Pacific Northwest National Lab., Richland, WA (United States). Nuclear Chemistry Section

    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.

  4. Network Method Critical Path as a Search Problem Solvers Critical Path

    OpenAIRE

    Fachrudin Fachrudin

    2005-01-01

    Activity is a lot of work takes time, energy and capital. Many companies do a lot of unplanned activities with a working method so that his workers are not finished just because time. This is much work other jobs to do and finished at the same time while a job with another job different in kind. Of the things mentioned above then the writing will be presented a solution that can solve problems with a method, the method known as Network or Network Method, The Critical Path Method as a search p...

  5. Network-analysis-guided synthesis of weisaconitine D and liljestrandinine

    Science.gov (United States)

    Marth, C. J.; Gallego, G. M.; Lee, J. C.; Lebold, T. P.; Kulyk, S.; Kou, K. G. M.; Qin, J.; Lilien, R.; Sarpong, R.

    2015-12-01

    General strategies for the chemical synthesis of organic compounds, especially of architecturally complex natural products, are not easily identified. Here we present a method to establish a strategy for such syntheses, which uses network analysis. This approach has led to the identification of a versatile synthetic intermediate that facilitated syntheses of the diterpenoid alkaloids weisaconitine D and liljestrandinine, and the core of gomandonine. We also developed a web-based graphing program that allows network analysis to be easily performed on molecules with complex frameworks. The diterpenoid alkaloids comprise some of the most architecturally complex and functional-group-dense secondary metabolites isolated. Consequently, they present a substantial challenge for chemical synthesis. The synthesis approach described here is a notable departure from other single-target-focused strategies adopted for the syntheses of related structures. Specifically, it affords not only the targeted natural products, but also intermediates and derivatives in the three subfamilies of diterpenoid alkaloids (C-18, C-19 and C-20), and so provides a unified synthetic strategy for these natural products. This work validates the utility of network analysis as a starting point for identifying strategies for the syntheses of architecturally complex secondary metabolites.

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

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

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

  9. Developing a feasible neighbourhood search for solving hub location problem in a communication network

    Science.gov (United States)

    Rakhmawati, Fibri; Mawengkang, Herman; Buulolo, F.; Mardiningsih

    2018-01-01

    The hub location with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. This paper discusses how to model the polyhedral properties of the problems and develop a feasible neighbourhood search method to solve the model.

  10. Searching for High Proper Motion Sources Towards the Galactic Center using Convolution Neural Networks

    Science.gov (United States)

    Giongo Fernandes, Alexandre; Benjamin, Robert A.; Babler, Brian

    2018-01-01

    Two sets of infrared images of the Galactic Center region (|L| 100 mas/year). The two image sets come from GALCEN observations in 2005 and GLIMPSE proper observations in 2015 with matched observation modes. We use three different methods to search for these objects in extremely crowded fields: (1) comparing matched point source lists, (2) crowd sourcing by several college introductory astronomy classes in the state of Wisconsin (700 volunteers), and (3) convolutional neural networks trained using objects from the previous two methods. Before our search six high proper objects were known, four of which were found by the VVV near-infrared Galactic plane survey. We compare and describe our methods for this search, and present a preliminary catalog of high proper motions objects.

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

  12. World-Wide Standardized Seismograph Network: a data users guide

    Science.gov (United States)

    Peterson, Jon R.; Hutt, Charles R.

    2014-01-01

    The purpose of this report, which is based on an unpublished draft prepared in the 1970s, is to provide seismologists with the information they may need to use the WWSSN data set as it becomes available in a more easily accessible and convenient format on the Internet. The report includes a description of the WWSSN network, station facilities, operations and instrumentation, a derivation of the instrument transfer functions, tables of transfer functions, a description of calibration techniques, and a description of a method used to determine important instrument constants using recorded calibration data.

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

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

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

  16. 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.; hide

    2014-01-01

    We present the results of a search for gravitational waves associated with 223 gamma 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(exp-2) solar mass c(exp 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.

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Sadegheih, A. [Department of Industrial Engineering, University of Yazd, P.O. Box 89195-741, Yazd (Iran); Drake, P.R. [E-Business and Operations Management Division, University of Liverpool Management School, University of Liverpool, Liverpool (United Kingdom)

    2008-06-15

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

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

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

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

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

  3. Object Affordances Potentiate Responses but Do Not Guide Attentional Prioritization in a Visual Search Task

    Directory of Open Access Journals (Sweden)

    Yusuke eYamani

    2016-01-01

    Full Text Available Handled objects automatically activate afforded responses. The current experiment examined whether objects that afford a response are also prioritized for attentional processing in visual search. Targets were pictures of coffee cups with handles oriented either to the right or the left. Subjects searched for a target, a right-handled vs. left-handled coffee cup, among a varying number of distractor cups oriented in the opposite direction. Responses were faster when the direction of target handle and the key press were spatially matched than mismatched (stimulus-response compatibility effect, but object affordance did not moderate slopes of the search functions, indicating the absence of attentional prioritization effect. These findings imply that handled objects prime afforded responses without influencing attentional prioritization.

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

  5. Searching the MEDLINE literature database through PubMed: a short guide.

    Science.gov (United States)

    Motschall, Edith; Falck-Ytter, Yngve

    2005-10-01

    The Medline database from the National Library of Medicine (NLM) contains more than 12 million bibliographic citations from over 4,600 international biomedical journals. One of the interfaces for searching Medline is PubMed, provided by the NLM for free access via the Internet (www.pubmed.gov). Also searchable with the PubMed interface are non-Medline citations, i.e. articles supplied by publishers to the NLM. Direct access to an electronic full text version is also possible if the article is available from a publisher or institution participating in Linkout (www.ncbi.nlm.nih.gov/entrez/linkout/). Some publishers provide free access to their journals. Other journals require an online license and are fee based. The following example demonstrates some of the most important search functions in PubMed. We will start out with a fast and simple approach without the use of specific searching techniques and then continue with a more sophisticated search that requires the knowledge of Medline search functions. This example will show how the application of Medline search tools and how the use of the controlled vocabulary of 'Medical Subject Headings' (MeSH) will influence the results in comparison with the fast and simple approach. Let's try to find the best evidence to answer the following question: Is a 30-year-old man with typical acid reflux symptoms for many years (gastroesophageal reflux disease, GERD) more likely to develop esophageal cancer than people without reflux symptoms? This question can be split into several components: -a patient with reflux symptoms (GERD), -esophageal cancer: etiology, risk, -study design for etiology studies: cohort studies, case-control studies.

  6. Equilibria of iterative softmax and critical temperatures for intermittent search in self-organizing neural networks.

    Science.gov (United States)

    Tino, Peter

    2007-04-01

    Kwok and Smith (2005) recently proposed a new kind of optimization dynamics using self-organizing neural networks (SONN) driven by softmax weight renormalization. Such dynamics is capable of powerful intermittent search for high-quality solutions in difficult assignment optimization problems. However, the search is sensitive to temperature setting in the softmax renormalization step. It has been hypothesized that the optimal temperature setting corresponds to the symmetry-breaking bifurcation of equilibria of the renormalization step, when viewed as an autonomous dynamical system called iterative softmax (ISM). We rigorously analyze equilibria of ISM by determining their number, position, and stability types. It is shown that most fixed points exist in the neighborhood of the maximum entropy equilibrium w= (N(-1), N(-1), ..., N(-1)), where N is the ISM dimensionality. We calculate the exact rate of decrease in the number of ISM equilibria as one moves away from w. Bounds on temperatures guaranteeing different stability types of ISM equilibria are also derived. Moreover, we offer analytical approximations to the critical symmetry-breaking bifurcation temperatures that are in good agreement with those found by numerical investigations. So far, the critical temperatures have been determined only by trial-and-error numerical simulations. On a set of N-queens problems for a wide range of problem sizes N, the analytically determined critical temperatures predict the optimal working temperatures for SONN intermittent search very well. It is also shown that no intermittent search can exist in SONN for temperatures greater than one-half.

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

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

  9. Genetic Networks of Complex Disorders: from a Novel Search Engine for PubMed Article Database.

    Science.gov (United States)

    Jung, Jae-Yoon; Wall, Dennis Paul

    2013-01-01

    Finding genetic risk factors of complex disorders may involve reviewing hundreds of genes or thousands of research articles iteratively, but few tools have been available to facilitate this procedure. In this work, we built a novel publication search engine that can identify target-disorder specific, genetics-oriented research articles and extract the genes with significant results. Preliminary test results showed that the output of this engine has better coverage in terms of genes or publications, than other existing applications. We consider it as an essential tool for understanding genetic networks of complex disorders.

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

    Science.gov (United States)

    Jackson Kimball, D. F.; Budker, D.; Eby, J.; Pospelov, M.; Pustelny, S.; Scholtes, T.; Stadnik, Y. V.; Weis, A.; Wickenbrock, A.

    2018-02-01

    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.

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

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

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

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

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

    Science.gov (United States)

    2013-01-01

    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. PMID:23734562

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

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

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

    Science.gov (United States)

    Wei, Zhengxian; Song, Min; Yin, Guisheng; Wang, Hongbin; Cheng, Albert M. K.

    2017-01-01

    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. PMID:29039757

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

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

  1. The Nursing & Allied Health (CINAHL) data base: a guide to effective searching.

    Science.gov (United States)

    Fishel, C C

    1985-01-01

    The Cumulative Index to Nursing & Allied Health Literature is now available online through both BRS and DIALOG. Known as the NURSING & ALLIED HEALTH (CINAHL) file, it is the data base of choice for professionals in these fields. Unlike the National Library of Medicine's Medical Subject Headings (MeSH), CINAHL has a strong nursing orientation and a specific, current nursing vocabulary. Search techniques are similar to those used on MEDLINE since CINAHL has adopted the powerful MeSH tree structure format. The arrival of this data base is a significant advance for the nursing profession.

  2. Automated Spectroscopic Analysis Using the Particle Swarm Optimization Algorithm: Implementing a Guided Search Algorithm to Autofit

    Science.gov (United States)

    Ervin, Katherine; Shipman, Steven

    2017-06-01

    While rotational spectra can be rapidly collected, their analysis (especially for complex systems) is seldom straightforward, leading to a bottleneck. The AUTOFIT program was designed to serve that need by quickly matching rotational constants to spectra with little user input and supervision. This program can potentially be improved by incorporating an optimization algorithm in the search for a solution. The Particle Swarm Optimization Algorithm (PSO) was chosen for implementation. PSO is part of a family of optimization algorithms called heuristic algorithms, which seek approximate best answers. This is ideal for rotational spectra, where an exact match will not be found without incorporating distortion constants, etc., which would otherwise greatly increase the size of the search space. PSO was tested for robustness against five standard fitness functions and then applied to a custom fitness function created for rotational spectra. This talk will explain the Particle Swarm Optimization algorithm and how it works, describe how Autofit was modified to use PSO, discuss the fitness function developed to work with spectroscopic data, and show our current results. Seifert, N.A., Finneran, I.A., Perez, C., Zaleski, D.P., Neill, J.L., Steber, A.L., Suenram, R.D., Lesarri, A., Shipman, S.T., Pate, B.H., J. Mol. Spec. 312, 13-21 (2015)

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

  4. Deploying the ODISEES Ontology-guided Search in the NASA Earth Exchange (NEX)

    Science.gov (United States)

    Huffer, E.; Gleason, J. L.; Cotnoir, M.; Spaulding, R.; Deardorff, G.

    2016-12-01

    Robust, semantically rich metadata can support data discovery and access, and facilitate machine-to-machine transactions with services such as data subsetting, regridding, and reformatting. Despite this, for users not already familiar with the data in a given archive, most metadata is insufficient to help them find appropriate data for their projects. With this in mind, the Ontology-driven Interactive Search Environment (ODISEES) Data Discovery Portal was developed to enable users to find and download data variables that satisfy precise, parameter-level criteria, even when they know little or nothing about the naming conventions employed by data providers, or where suitable data might be archived. ODISEES relies on an Earth science ontology and metadata repository that provide an ontological framework for describing NASA data holdings with enough detail and fidelity to enable researchers to find, compare and evaluate individual data variables. Users can search for data by indicating the specific parameters desired, and comparing the results in a table that lets them quickly determine which data is most suitable. ODISEES and OLYMPUS, a tool for generating the semantically enhanced metadata used by ODISEES, are being developed in collaboration with the NASA Earth Exchange (NEX) project at the NASA Ames Research Center to prototype a robust data discovery and access service that could be made available to NEX users. NEX is a collaborative platform that provides researchers with access to TB to PB-scale datasets and analysis tools to operate on those data. By integrating ODISEES into the NEX Web Portal we hope to enable NEX users to locate datasets relevant to their research and download them directly into the NAS environment, where they can run applications using those datasets on the NAS supercomputers. This poster will describe the prototype integration of ODISEES into the NEX portal development environment, the mechanism implemented to use NASA APIs to retrieve

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

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

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

  8. Sequence coding and search system for licensee event reports. User's guide

    International Nuclear Information System (INIS)

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

    1984-08-01

    The Nuclear Regulatory Commission's Office for Analysis and Evaluation of Operational Data has developed, through the Nuclear Operations Analysis Center (NOAC) at Oak Ridge National Laboratory (ORNL), a system to aid in the evaluation of the Licensee Event Reports (LERs) submitted by the nuclear power plant utilities. The primary objective of the Sequence Coding and Search System (SCSS) is to reduce the descriptive text of the incident reports to a coded sequence that is 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 the nuclear power plant utilities after January 1, 1981, and is updated on a continual basis with new LERs, as they are submitted. The database is maintained by NOAC on the IBM-3033 computer system at ORNL. Following a description of SCSS and structure of the database, a tutorial section is provided to acquaint the first-time user with logon procedures and the necessary commands to retrieve, display, and analyze LERs

  9. Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces.

    Science.gov (United States)

    Malan, Katherine M; Moser, I

    2018-03-12

    The notion and characterisation of fitness landscapes has helped understand the performance of heuristic algorithms on complex optimisation problems. Many practical problems, however, are constrained, and when significant areas of the search space are infeasible, researchers have intuitively resorted to a variety of constraint-handling techniques intended to help the algorithm manoeuvre through infeasible areas and towards feasible regions of better fitness. It is clear that providing constraint-related feedback to the algorithm to influence its choice of solutions overlays the violation landscape with the fitness landscape in unpredictable ways whose effects on the algorithm cannot be directly measured. In this work we apply metrics of violation landscapes to continuous and combinatorial problems to characterise them. We relate this information to the relative performance of six well-known constraint-handling techniques to demonstrate how some properties of constrained landscapes favour particular constraint-handling approaches. For the problems with sampled feasible solutions, a bi-objective approach was the best performing approach overall, but other techniques performed better on problems with the most disjoint feasible areas. For the problems with no measurable feasibility, a feasibility ranking approach was the best performing approach overall, but other techniques performed better when the correlation between fitness values and the level of constraint violation was high.

  10. Bayesian networks for evaluating forensic DNA profiling evidence: a review and guide to literature.

    Science.gov (United States)

    Biedermann, A; Taroni, F

    2012-03-01

    Almost 30 years ago, Bayesian networks (BNs) were developed in the field of artificial intelligence as a framework that should assist researchers and practitioners in applying the theory of probability to inference problems of more substantive size and, thus, to more realistic and practical problems. Since the late 1980s, Bayesian networks have also attracted researchers in forensic science and this tendency has considerably intensified throughout the last decade. This review article provides an overview of the scientific literature that describes research on Bayesian networks as a tool that can be used to study, develop and implement probabilistic procedures for evaluating the probative value of particular items of scientific evidence in forensic science. Primary attention is drawn here to evaluative issues that pertain to forensic DNA profiling evidence because this is one of the main categories of evidence whose assessment has been studied through Bayesian networks. The scope of topics is large and includes almost any aspect that relates to forensic DNA profiling. Typical examples are inference of source (or, 'criminal identification'), relatedness testing, database searching and special trace evidence evaluation (such as mixed DNA stains or stains with low quantities of DNA). The perspective of the review presented here is not exclusively restricted to DNA evidence, but also includes relevant references and discussion on both, the concept of Bayesian networks as well as its general usage in legal sciences as one among several different graphical approaches to evidence evaluation. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

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

  12. Search for long distance correlations between extensive air showers detected by the EEE network

    Science.gov (United States)

    Abbrescia, M.; Baldini, L.; Baldini Ferroli, R.; Batignani, G.; Battaglieri, M.; Boi, S.; Bossini, E.; Carnesecchi, F.; Chiavassa, A.; Cicalo, C.; Cifarelli, L.; Coccetti, F.; Coccia, E.; De Gruttola, D.; De Pasquale, S.; Fabbri, F. L.; Frolov, V.; Galeotti, P.; Garbini, M.; Gemme, G.; Gnesi, I.; Grazzi, S.; Gustavino, C.; Hatzifotiadou, D.; La Rocca, P.; Mandaglio, G.; Maragoto Rodriguez, O.; Maron, G.; Mazziotta, M. N.; Miozzi, S.; Nania, R.; Noferini, F.; Nozzoli, F.; Palmonari, F.; Panareo, M.; Panetta, M. P.; Paoletti, R.; Park, W.; Perasso, L.; Pilo, F.; Piragino, G.; Pisano, S.; Riggi, F.; Righini, G. C.; Ripoli, C.; Sartorelli, G.; Scapparone, E.; Schioppa, M.; Scribano, A.; Selvi, M.; Serci, S.; Squarcia, S.; Taiuti, M.; Terreni, G.; Trifirò, A.; Trimarchi, M.; Vistoli, M. C.; Votano, L.; Williams, M. C. S.; Zheng, L.; Zichichi, A.; Zuyeuski, R.

    2018-02-01

    A search for long distance correlations between individual Extensive Air Showers (EAS) detected by pairs of MRPC telescopes of the Extreme Energy Events (EEE) network was carried out. The search for an anomaly in these events is the purpose of our work. A dataset obtained by all the possible 45 pairs between 10 EEE cluster sites (hosting at least two telescopes), located at relative distances between 86 and 1200km, was analyzed, corresponding to an overall period of 3968 days time exposure. To estimate the possible event excess with respect to the spurious rate, the number of coincidence events was extracted as a function of the time difference between the arrival of the showers in the two sites, from ± 10 s to the smallest time interval where events are still observed. The analysis was done taking into account both the time and orientation correlation between the showers detected by the telescope pairs. A few candidate events with unusually small time difference and angular distance were observed, with a p-value sensibly smaller than a confidence level of 0.05.

  13. Recent misconceptions about the 'database search problem': a probabilistic analysis using Bayesian networks.

    Science.gov (United States)

    Biedermann, A; Gittelson, S; Taroni, F

    2011-10-10

    This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  14. Staff Perceptions of Key Factors Guiding Nursing Home Search and Selection Within the Veterans Health Administration.

    Science.gov (United States)

    Miller, Edward Alan; Gidmark, Stefanie; Gadbois, Emily; Rudolph, James L; Intrator, Orna

    2017-06-21

    Veterans enter nursing homes (NHs) for short-term postacute, rehabilitation, respite, or end-of-life care. They also enter NHs on a long-term basis due to frailty, disability, functional deficits, and cognitive impairment. Little is known about how a particular NH is chosen once the decision to enter a NH has been made. This study identified VA staff perceptions of the key factors influencing the search and selection of NHs within the Veterans Health Administration (VHA). Data derived from 35 semistructured interviews with discharge planning and contracting staff from 12 Veterans Affairs Medical Centers (VAMCs). VA staff placed a premium on Veteran and family preferences in the NH selection process, though VA staff knowledge and familiarity with placement options established the general parameters within which NH placement decisions were made. Geographic proximity to Veterans' homes and families was a major factor in NH choice. Other key considerations included Veterans' specialty care needs (psychiatric, postacute, ventilator) and Veteran/facility demographics (age, race/ethnicity, Veteran status). VA staff tried to remain neutral in NH selection, thus instructing families to visit facilities and review publicly available quality data. VA staff report that amenities (private rooms, activities, smoking) and aesthetics (cleanliness, smell, layout, décor) often outweighed objective quality indicators in Veteran and family decision making. Findings suggest that VAMCs facilitate Veteran and family decision making around NH selection. They also suggest that VAMCs endeavor to identify and recruit a broader array of higher quality NHs to better match the specific needs of Veterans and families to the choice set available. © The Author 2017. Published by Oxford University Press on behalf of The Gerontological Society of America. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  15. Tracking people's hands and feet using mixed network AND/OR search.

    Science.gov (United States)

    Morariu, Vlad I; Harwood, David; Davis, Larry S

    2013-05-01

    We describe a framework that leverages mixed probabilistic and deterministic networks and their AND/OR search space to efficiently find and track the hands and feet of multiple interacting humans in 2D from a single camera view. Our framework detects and tracks multiple people's heads, hands, and feet through partial or full occlusion; requires few constraints (does not require multiple views, high image resolution, knowledge of performed activities, or large training sets); and makes use of constraints and AND/OR Branch-and-Bound with lazy evaluation and carefully computed bounds to efficiently solve the complex network that results from the consideration of interperson occlusion. Our main contributions are: 1) a multiperson part-based formulation that emphasizes extremities and allows for the globally optimal solution to be obtained in each frame, and 2) an efficient and exact optimization scheme that relies on AND/OR Branch-and-Bound, lazy factor evaluation, and factor cost sensitive bound computation. We demonstrate our approach on three datasets: the public single person HumanEva dataset, outdoor sequences where multiple people interact in a group meeting scenario, and outdoor one-on-one basketball videos. The first dataset demonstrates that our framework achieves state-of-the-art performance in the single person setting, while the last two demonstrate robustness in the presence of partial and full occlusion and fast nontrivial motion.

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

  17. Records of our Early Biosphere Illuminate our Origins and Guide our Search for Life Beyond Earth

    Science.gov (United States)

    DesMarais, David J.

    2003-01-01

    equilibration to a globally dominant agent that created and sustained widespread chemical disequilibria in the environment and shallow crust. Major biogeochemical perturbations ca. 2.3 to 2.0 Ga, 1.3 Ga, and also 0.8 to 0.6 Ga, contributed to the irreversible oxidation of the global environment and perhaps also triggered evolutionary innovations (e.g., the development of multi-cellular biota) that became the foundations of our modern biosphere. Understanding the nature and timing of this ascent of life is crucial for discerning our o m beginnings. This understanding also empowers OUT search for the origins, evolution and distribution of life elsewhere in our solar system and beyond.

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

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

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

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

  2. Scatter search based met heuristic for robust optimization of the deploying of "DWDM" technology on optical networks with survivability

    Directory of Open Access Journals (Sweden)

    Moreno-Pérez José A.

    2005-01-01

    Full Text Available In this paper we discuss the application of a met heuristic approach based on the Scatter Search to deal with robust optimization of the planning problem in the deploying of the Dense Wavelength Division Multiplexing (DWDM technology on an existing optical fiber network taking into account, in addition to the forecasted demands, the uncertainty in the survivability requirements.

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

  4. Multitype Network-Guided Target Controllability in Phenotypically Characterized Osteosarcoma: Role of Tumor Microenvironment

    Directory of Open Access Journals (Sweden)

    Ankush Sharma

    2017-07-01

    Full Text Available This study highlights the relevance of network-guided controllability analysis as a precision oncology tool. Target controllability through networks is potentially relevant to cancer research for the identification of therapeutic targets. With reference to a recent study on multiple phenotypes from 22 osteosarcoma (OS cell lines characterized both in vitro and in vivo, we found that a variety of critical proteins in OS regulation circuits were in part phenotype specific and in part shared. To generalize our inference approach and match cancer phenotypic heterogeneity, we employed multitype networks and identified targets in correspondence with protein sub-complexes. Therefore, we established the relevance for diagnostic and therapeutic purposes of inspecting interactive targets, namely those enriched by significant connectivity patterns in protein sub-complexes. Emerging targets appeared with reference to the OS microenvironment, and relatively to small leucine-rich proteoglycan members and D-type cyclins, among other collagen, laminin, and keratin proteins. These described were evidences shared across all phenotypes; instead, specific evidences were provided by critical proteins including IGFBP7 and PDGFRA in the invasive phenotype, and FGFR3 and THBS1 in the colony forming phenotype.

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

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

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

  8. Search for supersymmetry in events with a single lepton, jets, and missing transverse momentum using a neural network

    CERN Document Server

    Chatterjee, Avishek

    A search for supersymmetry in proton-proton collisions at $\\sqrt{s} = 7$ TeV is presented, focusing on events with a single isolated lepton, energetic jets, and large missing transverse momentum. The analyzed data corresponds to a total integrated luminosity of 4.98 fb$^{−1}$ recorded by the CMS experiment. The search uses an artificial neural network to suppress Standard Model backgrounds, and estimates residual backgrounds using a fully data-driven method. The analysis is performed in both the muon and electron channels, and the combined result is interpreted in terms of limits on the CMSSM parameter space, as well as a simplified model.

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

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

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

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

  13. Genome-scale metabolic network guided engineering of Streptomyces tsukubaensis for FK506 production improvement.

    Science.gov (United States)

    Huang, Di; Li, Shanshan; Xia, Menglei; Wen, Jianping; Jia, Xiaoqiang

    2013-05-24

    FK506 is an important immunosuppressant, which can be produced by Streptomyces tsukubaensis. However, the production capacity of the strain is very low. Hereby, a computational guided engineering approach was proposed in order to improve the intracellular precursor and cofactor availability of FK506 in S. tsukubaensis. First, a genome-scale metabolic model of S. tsukubaensis was constructed based on its annotated genome and biochemical information. Subsequently, several potential genetic targets (knockout or overexpression) that guaranteed an improved yield of FK506 were identified by the recently developed methodology. To validate the model predictions, each target gene was manipulated in the parent strain D852, respectively. All the engineered strains showed a higher FK506 production, compared with D852. Furthermore, the combined effect of the genetic modifications was evaluated. Results showed that the strain HT-ΔGDH-DAZ with gdhA-deletion and dahp-, accA2-, zwf2-overexpression enhanced FK506 concentration up to 398.9 mg/L, compared with 143.5 mg/L of the parent strain D852. Finally, fed-batch fermentations of HT-ΔGDH-DAZ were carried out, which led to the FK506 production of 435.9 mg/L, 1.47-fold higher than the parent strain D852 (158.7 mg/L). Results confirmed that the promising targets led to an increase in FK506 titer. The present work is the first attempt to engineer the primary precursor pathways to improve FK506 production in S. tsukubaensis with genome-scale metabolic network guided metabolic engineering. The relationship between model prediction and experimental results demonstrates the rationality and validity of this approach for target identification. This strategy can also be applied to the improvement of other important secondary metabolites.

  14. Finding Multi-step Attacks in Computer Networks using Heuristic Search and Mobile Ambients

    NARCIS (Netherlands)

    Nunes Leal Franqueira, V.

    2009-01-01

    An important aspect of IT security governance is the proactive and continuous identification of possible attacks in computer networks. This is complicated due to the complexity and size of networks, and due to the fact that usually network attacks are performed in several steps. This thesis proposes

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

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

  17. Joint Craniomaxillofacial Bone Segmentation and Landmark Digitization by Context-Guided Fully Convolutional Networks.

    Science.gov (United States)

    Zhang, Jun; Liu, Mingxia; Wang, Li; Chen, Si; Yuan, Peng; Li, Jianfu; Shen, Steve Guo-Fang; Tang, Zhen; Chen, Ken-Chung; Xia, James J; Shen, Dinggang

    2017-09-01

    Generating accurate 3D models from cone-beam computed tomography (CBCT) images is an important step in developing treatment plans for patients with craniomaxillofacial (CMF) deformities. This process often involves bone segmentation and landmark digitization. Since anatomical landmarks generally lie on the boundaries of segmented bone regions, the tasks of bone segmentation and landmark digitization could be highly correlated. However, most existing methods simply treat them as two standalone tasks, without considering their inherent association. In addition, these methods usually ignore the spatial context information ( i.e. , displacements from voxels to landmarks) in CBCT images. To this end, we propose a context-guided fully convolutional network (FCN) for joint bone segmentation and landmark digitization. Specifically, we first train an FCN to learn the displacement maps to capture the spatial context information in CBCT images. Using the learned displacement maps as guidance information, we further develop a multi-task FCN to jointly perform bone segmentation and landmark digitization. Our method has been evaluated on 107 subjects from two centers, and the experimental results show that our method is superior to the state-of-the-art methods in both bone segmentation and landmark digitization.

  18. Social Network Analysis of yahoo web-search engine query logs

    OpenAIRE

    Aboeleinen, Mohamed; Islam, A H M Forhadul

    2017-01-01

    Web is now the undisputed warehouse for information. It can now provide most of the answers for modern problems. Search engines do a great job by combining and ranking the best results when the users try to search for any particular information. However, as we know 'with great power comes great responsibility', it is not an easy task for data analysts to find the most relevant information for the queries. One major challenge is that web search engines face difficulties in recognizing users' s...

  19. Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds

    National Research Council Canada - National Science Library

    MacDonald, Jason E

    2007-01-01

    The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources...

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

  1. Special issue on searching and mining the web and social networks

    NARCIS (Netherlands)

    Litvak, Nelli; Vigna, Sebastiano

    2014-01-01

    The past few decades have seen the rise of online social networks as a worldwide phenomenon with a high impact on our society. Beyond the obvious exposure phenomena, with obvious implications on security and privacy, people have started to become acquainted—even married!—in online social networks.

  2. A peer-to-peer file search and download protocol for wireless ad-hoc networks

    NARCIS (Netherlands)

    Sözer, Hasan; Tekkalmaz, M.; Korpeoglu, I.

    Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their immediate neighborhood. In this

  3. Multi-objective transportation network design: Accelerating search by applying ε-NSGAII

    NARCIS (Netherlands)

    Brands, Ties; Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Coello, C.C.

    2014-01-01

    The optimization of infrastructure planning in a multimodal passenger transportation network is formulated as a multi-objective network design problem, with accessibility, use of urban space by parking, operating deficit and climate impact as objectives. Decision variables are the location of park

  4. Bioactivity-Based Molecular Networking for the Discovery of Drug Leads in Natural Product Bioassay-Guided Fractionation.

    Science.gov (United States)

    Nothias, Louis-Félix; Nothias-Esposito, Mélissa; da Silva, Ricardo; Wang, Mingxun; Protsyuk, Ivan; Zhang, Zheng; Sarvepalli, Abi; Leyssen, Pieter; Touboul, David; Costa, Jean; Paolini, Julien; Alexandrov, Theodore; Litaudon, Marc; Dorrestein, Pieter C

    2018-03-02

    It is a common problem in natural product therapeutic lead discovery programs that despite good bioassay results in the initial extract, the active compound(s) may not be isolated during subsequent bioassay-guided purification. Herein, we present the concept of bioactive molecular networking to find candidate active molecules directly from fractionated bioactive extracts. By employing tandem mass spectrometry, it is possible to accelerate the dereplication of molecules using molecular networking prior to subsequent isolation of the compounds, and it is also possible to expose potentially bioactive molecules using bioactivity score prediction. Indeed, bioactivity score prediction can be calculated with the relative abundance of a molecule in fractions and the bioactivity level of each fraction. For that reason, we have developed a bioinformatic workflow able to map bioactivity score in molecular networks and applied it for discovery of antiviral compounds from a previously investigated extract of Euphorbia dendroides where the bioactive candidate molecules were not discovered following a classical bioassay-guided fractionation procedure. It can be expected that this approach will be implemented as a systematic strategy, not only in current and future bioactive lead discovery from natural extract collections but also for the reinvestigation of the untapped reservoir of bioactive analogues in previous bioassay-guided fractionation efforts.

  5. Graph Analysis and Modularity of Brain Functional Connectivity Networks: Searching for the Optimal Threshold

    Directory of Open Access Journals (Sweden)

    Cécile Bordier

    2017-08-01

    Full Text Available Neuroimaging data can be represented as networks of nodes and edges that capture the topological organization of the brain connectivity. Graph theory provides a general and powerful framework to study these networks and their structure at various scales. By way of example, community detection methods have been widely applied to investigate the modular structure of many natural networks, including brain functional connectivity networks. Sparsification procedures are often applied to remove the weakest edges, which are the most affected by experimental noise, and to reduce the density of the graph, thus making it theoretically and computationally more tractable. However, weak links may also contain significant structural information, and procedures to identify the optimal tradeoff are the subject of active research. Here, we explore the use of percolation analysis, a method grounded in statistical physics, to identify the optimal sparsification threshold for community detection in brain connectivity networks. By using synthetic networks endowed with a ground-truth modular structure and realistic topological features typical of human brain functional connectivity networks, we show that percolation analysis can be applied to identify the optimal sparsification threshold that maximizes information on the networks' community structure. We validate this approach using three different community detection methods widely applied to the analysis of brain connectivity networks: Newman's modularity, InfoMap and Asymptotical Surprise. Importantly, we test the effects of noise and data variability, which are critical factors to determine the optimal threshold. This data-driven method should prove particularly useful in the analysis of the community structure of brain networks in populations characterized by different connectivity strengths, such as patients and controls.

  6. Developing Generic Image Search Strategies for Large Astronomical Data Sets and Archives using Convolutional Neural Networks and Transfer Learning

    Science.gov (United States)

    Peek, Joshua E. G.; Hargis, Jonathan R.; Jones, Craig R.

    2018-01-01

    Astronomical instruments produce petabytes of images every year, vastly more than can be inspected by a member of the astronomical community in search of a specific population of structures. Fortunately, the sky is mostly black and source extraction algorithms have been developed to provide searchable catalogs of unconfused sources like stars and galaxies. These tools often fail for studies of more diffuse structures like the interstellar medium and unresolved stellar structures in nearby galaxies, leaving astronomers interested in observations of photodissociation regions, stellar clusters, diffuse interstellar clouds without the crucial ability to search. In this work we present a new path forward for finding structures in large data sets similar to an input structure using convolutional neural networks, transfer learning, and machine learning clustering techniques. We show applications to archival data in the Mikulski Archive for Space Telescopes (MAST).

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

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

  9. A note on 'A simple approach to search for all d-MCs of a limited-flow network'

    International Nuclear Information System (INIS)

    Salehi Fathabadi, H.; Forghani-elahabadi, M.

    2009-01-01

    Many real-world systems are multi-state systems composed of multi-state components in which the reliability can be computed in terms of the lower bound points of level d, called d-Mincuts (d-MCs). Such systems (electric power, transportation, etc.) may be considered as network flows whose arcs have independent and discrete random capacities. In this comment, we investigate the algorithm proposed by Yeh [A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering and System Safety 2001;71(1):15-19]. We show that the algorithm misses some real d-MCs, and then pinpoint the algorithm's failure and suggest the correcting point.

  10. Communication Delays in the Cooperative Control of Wide Area Search Munitions Via Iterative Network Flow

    National Research Council Canada - National Science Library

    Mitchell, Jason

    2003-01-01

    .... This model is used to study the effect of communication delays on the performance of an iteractive network flow optimization model that results in a sequence of linear programs for the optimal...

  11. Lithic raw material procurement in the Moravian Neolithic: the search for extra-regional networks

    Directory of Open Access Journals (Sweden)

    Martin Kuča

    2009-12-01

    Full Text Available The study of lithic raw material procurement can contribute to the study of ancient networks. Petrographic analysis combined with systematic mapping of raw material outcrops has been conducted in Moravia and adjacent territories by A. Přichystal over a period of more than three decades. Combined with well excavated (including wet-screening and 14C (radiometric dated sites,allows us to study changes in the distribution networks of raw materials during the Mesolithic and Neolithic periods.

  12. Proximity, network formation and inventive performance: in search of the proximity paradox

    OpenAIRE

    Cassi, Lorenzo; Plunket, Anne

    2013-01-01

    This paper investigates how network relations, proximity and their interplay affect collaboration and their inventive performance. Using patent citations as a proxy for patent quality, we investigate how the network and proximity characteristics of co-inventors enable them to access different sources of knowledge, in different geographical and organizational contexts, and finally affect the quality of inventive collaboration. Our findings enable to address the proximity paradox, which states ...

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

  14. Connection Setup Signaling Scheme with Flooding-Based Path Searching for Diverse-Metric Network

    Science.gov (United States)

    Kikuta, Ko; Ishii, Daisuke; Okamoto, Satoru; Oki, Eiji; Yamanaka, Naoaki

    Connection setup on various computer networks is now achieved by GMPLS. This technology is based on the source-routing approach, which requires the source node to store metric information of the entire network prior to computing a route. Thus all metric information must be distributed to all network nodes and kept up-to-date. However, as metric information become more diverse and generalized, it is hard to update all information due to the huge update overhead. Emerging network services and applications require the network to support diverse metrics for achieving various communication qualities. Increasing the number of metrics supported by the network causes excessive processing of metric update messages. To reduce the number of metric update messages, another scheme is required. This paper proposes a connection setup scheme that uses flooding-based signaling rather than the distribution of metric information. The proposed scheme requires only flooding of signaling messages with requested metric information, no routing protocol is required. Evaluations confirm that the proposed scheme achieves connection establishment without excessive overhead. Our analysis shows that the proposed scheme greatly reduces the number of control messages compared to the conventional scheme, while their blocking probabilities are comparable.

  15. Integrating network ecology with applied conservation: a synthesis and guide to implementation

    OpenAIRE

    Kaiser-Bunbury, Christopher N.; Blüthgen, Nico

    2015-01-01

    Ecological networks are a useful tool to study the complexity of biotic interactions at a community level. Advances in the understanding of network patterns encourage the application of a network approach in other disciplines than theoretical ecology, such as biodiversity conservation. So far, however, practical applications have been meagre. Here we present a framework for network analysis to be harnessed to advance conservation management by using plant–pollinator networks and islands as mo...

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

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

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

  19. Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks

    OpenAIRE

    Krynicki, Kamil Krzysztof

    2016-01-01

    [EN] The long-lasting trend in the field of computation of stress and resource distribution has found its way into computer networks via the concept of peer-to-peer (P2P) connectivity. P2P is a symmetrical model, where each network node is enabled a comparable range of capacities and resources. It stands in a stark contrast to the classical, strongly asymmetrical client-server approach. P2P, originally considered only a complimentary, server-side structure to the straightforward client-server...

  20. Searching for the structure of early American psychology: Networking Psychological Review, 1909-1923.

    Science.gov (United States)

    Green, Christopher D; Feinerer, Ingo; Burman, Jeremy T

    2015-05-01

    This study continues a previous investigation of the intellectual structure of early American psychology by presenting and analyzing 3 networks that collectively include every substantive article published in Psychological Review during the 15-year period from 1909 to 1923. The networks were laid out such that articles (represented by the network's nodes) that possessed strongly correlated vocabularies were positioned closer to each other spatially than articles with weakly correlated vocabularies. We identified distinct research communities within the networks by locating and interpreting the clusters of lexically similar articles. We found that the Psychological Review was in some turmoil during this period compared with its first 15 years attributable, first, to Baldwin's unexpected departure in 1910; second, to the pressures placed on the discipline by United States entry into World War I; and, third, to the emergence of specialty psychology journals catering to research communities that had once published in the Review. The journal emerged from these challenges, however, with a better-defined mission: to serve as the chief repository of theoretical psychology in the United States. (c) 2015 APA, all rights reserved).

  1. Lithic raw material procurement in the Moravian Neolithic. The search for extra-regional networks

    Czech Academy of Sciences Publication Activity Database

    Kuča, M.; Přichystal, A.; Schenk, Z.; Škrdla, Petr; Vokáč, M.

    2009-01-01

    Roč. 36, - (2009), s. 313-326 ISSN 1408-967X R&D Projects: GA AV ČR IAA800010801 Institutional research plan: CEZ:AV0Z80010507 Keywords : Moravia * Neolithic * raw materials * networks * 14C chronology Subject RIV: AC - Archeology, Anthropology, Ethnology

  2. A Local Search Algorithm for Clustering in Software as a Service Networks

    NARCIS (Netherlands)

    J.P. van der Gaast (Jelmer); C.A. Rietveld (Niels); A.F. Gabor (Adriana); Y. Zhang (Yingqian)

    2011-01-01

    textabstractIn this paper we present and analyze a model for clustering in networks that offer Software as a Service (SaaS). In this problem, organizations requesting a set of applications have to be assigned to clusters such that the costs of opening clusters and installing the necessary

  3. A Wave-guide Model for Packetized Media Streaming in Lossless Networks

    NARCIS (Netherlands)

    Konstantas, D.; Widya, I.A.

    2002-01-01

    Optimal operation of network based multimedia applications requires a precise specification of the network parameters. Different models have been used in the past in calculating the behavior of the network and defining parameters like throughput and delays of packets, using among others fluid

  4. Computer and Network Security in Small Libraries: A Guide for Planning.

    Science.gov (United States)

    Williams, Robert L.

    This manual is intended to provide a free resource on essential network security concepts for non-technical managers of small libraries. Managers of other small nonprofit or community organizations will also benefit from it. An introduction defines network security; outlines three goals of network security; discusses why a library should be…

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

  6. A search for the minimum number of stations needed for seismic networking on Mars

    Science.gov (United States)

    Mocquet, A.

    1999-04-01

    The efficiency of a seismic network in providing information on the rate of seismicity, and on the inner structure of Mars, is estimated through a statistical analysis which takes into account the possible existence of a liquid core, the expected low rate of seismicity of Mars when compared to the Earths, and the attenuating properties of the mantle. The tests are performed for two frequency ranges (0.1-1.0 Hz and 0.5-2.5 Hz), for three instrumental noise amplitude densities ranging from 5 to 500×10-10 m s-2 Hz-1/2, and for three network configurations consisting of 4, 12 and 16 stations. Travel time tables are computed for P, S, PcP, ScS, and PKP phases using a simplified three layer model. Present-day estimates of liquid core radius induce a 25° wide shadow zone beginning at epicentral distances larger than 110°. Consequently, the best detection efficiency which can be expected from any network is of the order of 60% for mantle body waves. The detection efficiency is primarily controlled by the instrumental noise level. Since the amplitude of mantle body waves rapidly decreases with epicentral distance, high noise level instruments can only detect local events. Therefore, the detection score attained by 4 highly sensitive stations can be up to 30 and 7 times better than the score attained by 12 high noise level sensors, for mantle P and S waves, respectively. If crustal scattering is negligible, the record of mantle P waves on a network consisting of four low noise level instruments would permit to sample Mars mantle down to the core-mantle boundary. Conversely, the deepest penetration of rays recorded by a network of 12 high noise level sensors would hardly reach 300 km. In fact, strong crustal scattering might be the most important difficulty to be encountered in a seismic exploration of Mars. A possibility to deal with this problem would be to associate each of the four low noise instruments with three medium noise level sensors. This network strategy might

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

  8. The Citizens and Remote Sensing Observational Network (CARSON) Guide: Merging NASA Remote Sensing Data with Local Environmental Awareness

    Science.gov (United States)

    Acker, James; Riebeek, Holli; Ledley, Tamara Shapiro; Herring, David; Lloyd, Steven

    2008-01-01

    "Citizen science" generally refers to observatoinal research and data collection conducted by non-professionals, commonly as volunteers. In the environmental science field, citizen scientists may be involved with local nad regional issues such as bird and wildlife populations, weather, urban sprawl, natural hazards, wetlands, lakes and rivers, estuaries, and a spectrum of public health concerns. Some citizen scientists may be primarily motivated by the intellectual challenge of scientific observations. Citizen scientists may now examine and utilize remote-sensing data related to their particular topics of interest with the easy-to-use NASA Web-based tools Giovanni and NEO, which allow exploration and investigation of a wide variety of Earth remote sensing data sets. The CARSON (Citizens and Remote Sensing Observational Network) Guide will be an online resource consisting of chapters each demonstrating how to utilize Giovanni and NEO to access and analyze specific remote-sensing data. Integrated in each chapter will be descriptions of methods that citizen scientists can employ to collect, monitor, analyze, and share data related to the chapter topic which pertain to environmental and ecological conditions in their local region. A workshop held in August 2008 initiated the development of prototype chapters on water quality, air quality, and precipitation. These will be the initial chapters in the first release of the CARSON Guide, which will be used in a pilot project at the Maryland Science Center in spring 2009. The goal of the CARSON Guide is to augment and enhance citizen scientist environmental research with NASA satellite data by creating a participatory network consisting of motivated individuals, environmental groups and organizations, and science-focused institutions such as museuma and nature centers. Members of the network could potentially interact with government programs, academic research projects, and not-for-profit organizations focused on

  9. Energy Aware Swarm Optimization with Intercluster Search for Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Shanmugasundaram Thilagavathi

    2015-01-01

    Full Text Available Wireless sensor networks (WSNs are emerging as a low cost popular solution for many real-world challenges. The low cost ensures deployment of large sensor arrays to perform military and civilian tasks. Generally, WSNs are power constrained due to their unique deployment method which makes replacement of battery source difficult. Challenges in WSN include a well-organized communication platform for the network with negligible power utilization. In this work, an improved binary particle swarm optimization (PSO algorithm with modified connected dominating set (CDS based on residual energy is proposed for discovery of optimal number of clusters and cluster head (CH. Simulations show that the proposed BPSO-T and BPSO-EADS perform better than LEACH- and PSO-based system in terms of energy savings and QOS.

  10. Searching for the Mecca of finance: Islamic financial services and the world city network

    OpenAIRE

    Bassens, David; Derudder, Ben; Witlox, Frank

    2010-01-01

    This paper presents an analysis of the geography of the booming 'Islamic financial services' (IFS) sector, which provides a host of financial services based on Islamic religious grounds. The relevance of such an analysis is discussed against the conceptual backdrop of the world city network literature. It is argued that a focus on the globalisation of the IFS sector may provide an alternative to hegemonic geographical imaginations of world city-formation through its focus on other forms of gl...

  11. Thirty years of European Collaboration in R&D: a Search for Key Network Indicators

    Energy Technology Data Exchange (ETDEWEB)

    Caloghirou, Y.; Protogerou, A.; Siokas, E.

    2016-07-01

    The purpose of this session is to present a coherent set of papers offering useful insights on research priority setting processes/activities and indicators used to measure the impact of research and technology development programmes in Europe and Emerging Economies (Brazil, Chile, Peru and Russia). In particular, the first paper focuses on the research collaborative networks funded by the European Union during the past three decades and offers a comprehensive picture of science-industry collaboration in Europe by using network indicators and providing data on the characteristics and the innovative performance of young firms participating in these networks. The second paper presents three cases of non-traditional indicators for R&D funding agencies from emerging economies and aims at contributing to the discussions on the importance of employing suitable indicators that can complement classic STI indicators. The third paper seeks to provide a critical overview of the recent exercise in the evaluation of public research institutions in Russia. The session aims at bringing together researchers from both developed and emerging countries as well as policy makers and will be divided into two parts . The first part will be devoted in papers’ presentation and the second one in papers’ discussion by invited policy experts and officials. (Author)

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

  13. Integrating network ecology with applied conservation: a synthesis and guide to implementation.

    Science.gov (United States)

    Kaiser-Bunbury, Christopher N; Blüthgen, Nico

    2015-07-10

    Ecological networks are a useful tool to study the complexity of biotic interactions at a community level. Advances in the understanding of network patterns encourage the application of a network approach in other disciplines than theoretical ecology, such as biodiversity conservation. So far, however, practical applications have been meagre. Here we present a framework for network analysis to be harnessed to advance conservation management by using plant-pollinator networks and islands as model systems. Conservation practitioners require indicators to monitor and assess management effectiveness and validate overall conservation goals. By distinguishing between two network attributes, the 'diversity' and 'distribution' of interactions, on three hierarchical levels (species, guild/group and network) we identify seven quantitative metrics to describe changes in network patterns that have implications for conservation. Diversity metrics are partner diversity, vulnerability/generality, interaction diversity and interaction evenness, and distribution metrics are the specialization indices d' and [Formula: see text] and modularity. Distribution metrics account for sampling bias and may therefore be suitable indicators to detect human-induced changes to plant-pollinator communities, thus indirectly assessing the structural and functional robustness and integrity of ecosystems. We propose an implementation pathway that outlines the stages that are required to successfully embed a network approach in biodiversity conservation. Most importantly, only if conservation action and study design are aligned by practitioners and ecologists through joint experiments, are the findings of a conservation network approach equally beneficial for advancing adaptive management and ecological network theory. We list potential obstacles to the framework, highlight the shortfall in empirical, mostly experimental, network data and discuss possible solutions. Published by Oxford University

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

  15. Search for supersymmetry in events with opposite-sign dileptons and missing transverse energy using an artificial neural network

    CERN Document Server

    Chatrchyan, Serguei; Sirunyan, Albert M; Tumasyan, Armen; Adam, Wolfgang; Aguilo, Ernest; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Fabjan, Christian; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Pernicka, Manfred; Rabady, Dinyar; Rahbaran, Babak; Rohringer, Christine; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Taurok, Anton; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Bansal, Monika; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Luyckx, Sten; Mucibello, Luca; Ochesanu, Silvia; Roland, Benoit; Rougny, Romain; Selvaggi, Michele; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Gonzalez Suarez, Rebeca; Kalogeropoulos, Alexis; Maes, Michael; Olbrechts, Annik; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Clerbaux, Barbara; De Lentdecker, Gilles; Dero, Vincent; Gay, Arnaud; Hreus, Tomas; Léonard, Alexandre; Marage, Pierre Edouard; Mohammadi, Abdollah; Reis, Thomas; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Adler, Volker; Beernaert, Kelly; Cimmino, Anna; Costantini, Silvia; Garcia, Guillaume; Grunewald, Martin; Klein, Benjamin; Lellouch, Jérémie; Marinov, Andrey; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Walsh, Sinead; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Bruno, Giacomo; Castello, Roberto; Ceard, Ludivine; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Lemaitre, Vincent; Liao, Junhui; Militaru, Otilia; Nuttens, Claude; Pagano, Davide; Pin, Arnaud; Piotrzkowski, Krzysztof; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Alves, Gilvan; Correa Martins Junior, Marcos; Martins, Thiago; Pol, Maria Elena; Henrique Gomes E Souza, Moacyr; Aldá Júnior, Walter Luiz; Carvalho, Wagner; Custódio, Analu; Melo Da Costa, Eliza; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Malbouisson, Helena; Malek, Magdalena; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Soares Jorge, Luana; Sznajder, Andre; Vilela Pereira, Antonio; Souza Dos Anjos, Tiago; Bernardes, Cesar Augusto; De Almeida Dias, Flavia; Tomei, Thiago; De Moraes Gregores, Eduardo; Lagana, Caio; Da Cunha Marinho, Franciole; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Genchev, Vladimir; Iaydjiev, Plamen; Piperov, Stefan; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Tcholakov, Vanio; Trayanov, Rumen; Vutova, Mariana; Dimitrov, Anton; Hadjiiska, Roumyana; Kozhuharov, Venelin; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Jiang, Chun-Hua; Liang, Dong; Liang, Song; Meng, Xiangwei; Tao, Junquan; Wang, Jian; Wang, Xianyou; Wang, Zheng; Xiao, Hong; Xu, Ming; Zang, Jingjing; Zhang, Zhen; Asawatangtrakuldee, Chayanit; Ban, Yong; Guo, Yifei; Li, Wenbo; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Teng, Haiyun; Wang, Dayong; Zhang, Linlin; Zou, Wei; Avila, Carlos; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Osorio Oliveros, Andres Felipe; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Plestina, Roko; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Duric, Senka; Kadija, Kreso; Luetic, Jelena; Mekterovic, Darko; Morovic, Srecko; Attikis, Alexandros; Galanti, Mario; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Elgammal, Sherif; Ellithi Kamel, Ali; Mahmoud, Mohammed; Mahrous, Ayman; Radi, Amr; Kadastik, Mario; Müntel, Mait; Murumaa, Marion; Raidal, Martti; Rebane, Liis; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Heikkinen, Mika Aatos; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Ungaro, Donatella; Wendland, Lauri; Banzuzi, Kukka; Karjalainen, Ahti; Korpela, Arja; Tuuva, Tuure; Besancon, Marc; Choudhury, Somnath; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Ferri, Federico; Ganjour, Serguei; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Locci, Elizabeth; Malcles, Julie; Millischer, Laurent; Nayak, Aruna; Rander, John; Rosowsky, André; Titov, Maksym; Baffioni, Stephanie; Beaudette, Florian; Benhabib, Lamia; Bianchini, Lorenzo; Bluj, Michal; Busson, Philippe; Charlot, Claude; Daci, Nadir; Dahms, Torsten; Dalchenko, Mykhailo; Dobrzynski, Ludwik; Florent, Alice; Granier de Cassagnac, Raphael; Haguenauer, Maurice; Miné, Philippe; Mironov, Camelia; Naranjo, Ivo Nicolas; Nguyen, Matthew; Ochando, Christophe; Paganini, Pascal; Sabes, David; Salerno, Roberto; Sirois, Yves; Veelken, Christian; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Bloch, Daniel; Bodin, David; Brom, Jean-Marie; Cardaci, Marco; Chabert, Eric Christian; Collard, Caroline; Conte, Eric; Drouhin, Frédéric; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Juillot, Pierre; Le Bihan, Anne-Catherine; Van Hove, Pierre; Fassi, Farida; Mercier, Damien; Beauceron, Stephanie; Beaupere, Nicolas; Bondu, Olivier; Boudoul, Gaelle; Brochet, Sébastien; Chasserat, Julien; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Ille, Bernard; Kurca, Tibor; Lethuillier, Morgan; Mirabito, Laurent; Perries, Stephane; Sgandurra, Louis; Sordini, Viola; Tschudi, Yohann; Verdier, Patrice; Viret, Sébastien; Tsamalaidze, Zviad; Autermann, Christian; Beranek, Sarah; Calpas, Betty; Edelhoff, Matthias; Feld, Lutz; Heracleous, Natalie; Hindrichs, Otto; Jussen, Ruediger; Klein, Katja; Merz, Jennifer; Ostapchuk, Andrey; Perieanu, Adrian; Raupach, Frank; Sammet, Jan; Schael, Stefan; Sprenger, Daniel; Weber, Hendrik; Wittmer, Bruno; Zhukov, Valery; Ata, Metin; Caudron, Julien; Dietz-Laursonn, Erik; Duchardt, Deborah; Erdmann, Martin; Fischer, Robert; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Klingebiel, Dennis; Kreuzer, Peter; Merschmeyer, Markus; Meyer, Arnd; Olschewski, Mark; Papacz, Paul; Pieta, Holger; Reithler, Hans; Schmitz, Stefan Antonius; Sonnenschein, Lars; Steggemann, Jan; Teyssier, Daniel; Thüer, Sebastian; Weber, Martin; Bontenackels, Michael; Cherepanov, Vladimir; Erdogan, Yusuf; Flügge, Günter; Geenen, Heiko; Geisler, Matthias; Haj Ahmad, Wael; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Kuessel, Yvonne; Lingemann, Joschka; Nowack, Andreas; Perchalla, Lars; Pooth, Oliver; Sauerland, Philip; Stahl, Achim; Aldaya Martin, Maria; Behr, Joerg; Behrenhoff, Wolf; Behrens, Ulf; Bergholz, Matthias; Bethani, Agni; Borras, Kerstin; Burgmeier, Armin; Cakir, Altan; Calligaris, Luigi; Campbell, Alan; Castro, Elena; Costanza, Francesco; Dammann, Dirk; Diez Pardos, Carmen; Eckerlin, Guenter; Eckstein, Doris; Flucke, Gero; Geiser, Achim; Glushkov, Ivan; Gunnellini, Paolo; Habib, Shiraz; Hauk, Johannes; Hellwig, Gregor; Jung, Hannes; Kasemann, Matthias; Katsas, Panagiotis; Kleinwort, Claus; Kluge, Hannelies; Knutsson, Albert; Krämer, Mira; Krücker, Dirk; Kuznetsova, Ekaterina; Lange, Wolfgang; Leonard, Jessica; Lohmann, Wolfgang; Lutz, Benjamin; Mankel, Rainer; Marfin, Ihar; Marienfeld, Markus; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mnich, Joachim; Mussgiller, Andreas; Naumann-Emme, Sebastian; Novgorodova, Olga; Olzem, Jan; Perrey, Hanno; Petrukhin, Alexey; Pitzl, Daniel; Raspereza, Alexei; Ribeiro Cipriano, Pedro M; Riedl, Caroline; Ron, Elias; Rosin, Michele; Salfeld-Nebgen, Jakob; Schmidt, Ringo; Schoerner-Sadenius, Thomas; Sen, Niladri; Spiridonov, Alexander; Stein, Matthias; Walsh, Roberval; Wissing, Christoph; Blobel, Volker; Enderle, Holger; Erfle, Joachim; Gebbert, Ulla; Görner, Martin; Gosselink, Martijn; Haller, Johannes; Hermanns, Thomas; Höing, Rebekka Sophie; Kaschube, Kolja; Kaussen, Gordon; Kirschenmann, Henning; Klanner, Robert; Lange, Jörn; Nowak, Friederike; Peiffer, Thomas; Pietsch, Niklas; Rathjens, Denis; Sander, Christian; Schettler, Hannes; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Schröder, Matthias; Schum, Torben; Seidel, Markus; Sibille, Jennifer; Sola, Valentina; Stadie, Hartmut; Steinbrück, Georg; Thomsen, Jan; Vanelderen, Lukas; Barth, Christian; Berger, Joram; Böser, Christian; Chwalek, Thorsten; De Boer, Wim; Descroix, Alexis; Dierlamm, Alexander; Feindt, Michael; Guthoff, Moritz; Hackstein, Christoph; Hartmann, Frank; Hauth, Thomas; Heinrich, Michael; Held, Hauke; Hoffmann, Karl-Heinz; Husemann, Ulrich; Katkov, Igor; Komaragiri, Jyothsna Rani; Lobelle Pardo, Patricia; Martschei, Daniel; Mueller, Steffen; Müller, Thomas; Niegel, Martin; Nürnberg, Andreas; Oberst, Oliver; Oehler, Andreas; Ott, Jochen; Quast, Gunter; Rabbertz, Klaus; Ratnikov, Fedor; Ratnikova, Natalia; Röcker, Steffen; Schilling, Frank-Peter; Schott, Gregory; Simonis, Hans-Jürgen; Stober, Fred-Markus Helmut; Troendle, Daniel; Ulrich, Ralf; Wagner-Kuhr, Jeannine; Wayand, Stefan; Weiler, Thomas; Zeise, Manuel; Anagnostou, Georgios; Daskalakis, Georgios; Geralis, Theodoros; Kesisoglou, Stilianos; Kyriakis, Aristotelis; Loukas, Demetrios; Manolakos, Ioannis; Markou, Athanasios; Markou, Christos; Ntomari, Eleni; Gouskos, Loukas; Mertzimekis, Theodoros; Panagiotou, Apostolos; Saoulidou, Niki; Evangelou, Ioannis; Foudas, Costas; Kokkas, Panagiotis; Manthos, Nikolaos; Papadopoulos, Ioannis; Patras, Vaios; Bencze, Gyorgy; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Beni, Noemi; Czellar, Sandor; Molnar, Jozsef; Palinkas, Jozsef; Szillasi, Zoltan; Karancsi, János; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Beri, Suman Bala; Bhatnagar, Vipin; Dhingra, Nitish; Gupta, Ruchi; Kaur, Manjit; Mehta, Manuk Zubin; Nishu, Nishu; Saini, Lovedeep Kaur; Sharma, Archana; Singh, Jasbir; Kumar, Ashok; Kumar, Arun; Ahuja, Sudha; Bhardwaj, Ashutosh; Choudhary, Brajesh C; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Varun; Shivpuri, Ram Krishen; Banerjee, Sunanda; Bhattacharya, Satyaki; Dutta, Suchandra; Gomber, Bhawna; Jain, Sandhya; Jain, Shilpi; Khurana, Raman; Sarkar, Subir; Sharan, Manoj; Abdulsalam, Abdulla; Dutta, Dipanwita; Kailas, Swaminathan; Kumar, Vineet; Mohanty, Ajit Kumar; Pant, Lalit Mohan; Shukla, Prashant; Aziz, Tariq; Ganguly, Sanmay; Guchait, Monoranjan; Gurtu, Atul; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Mohanty, Gagan Bihari; Parida, Bibhuti; Sudhakar, Katta; Wickramage, Nadeesha; Banerjee, Sudeshna; Dugad, Shashikant; Arfaei, Hessamaddin; Bakhshiansohi, Hamed; Etesami, Seyed Mohsen; Fahim, Ali; Hashemi, Majid; Hesari, Hoda; Jafari, Abideh; Khakzad, Mohsen; Mohammadi Najafabadi, Mojtaba; Paktinat Mehdiabadi, Saeid; Safarzadeh, Batool; Zeinali, Maryam; Abbrescia, Marcello; Barbone, Lucia; Calabria, Cesare; Chhibra, Simranjit Singh; Colaleo, Anna; Creanza, Donato; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Maggi, Giorgio; Maggi, Marcello; Marangelli, Bartolomeo; My, Salvatore; Nuzzo, Salvatore; Pacifico, Nicola; Pompili, Alexis; Pugliese, Gabriella; Selvaggi, Giovanna; Silvestris, Lucia; Singh, Gurpreet; Venditti, Rosamaria; Verwilligen, Piet; Zito, Giuseppe; Abbiendi, Giovanni; Benvenuti, Alberto; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Guiducci, Luigi; Marcellini, Stefano; Masetti, Gianni; Meneghelli, Marco; Montanari, Alessandro; Navarria, Francesco; Odorici, Fabrizio; Perrotta, Andrea; Primavera, Federica; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gian Piero; Tosi, Nicolò; Travaglini, Riccardo; Albergo, Sebastiano; Cappello, Gigi; Chiorboli, Massimiliano; Costa, Salvatore; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Frosali, Simone; Gallo, Elisabetta; Gonzi, Sandro; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Tropiano, Antonio; Benussi, Luigi; Bianco, Stefano; Colafranceschi, Stefano; Fabbri, Franco; Piccolo, Davide; Fabbricatore, Pasquale; Musenich, Riccardo; Tosi, Silvano; Benaglia, Andrea; De Guio, Federico; Di Matteo, Leonardo; Fiorendi, Sara; Gennai, Simone; Ghezzi, Alessio; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Martelli, Arabella; Massironi, Andrea; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Ragazzi, Stefano; Redaelli, Nicola; Sala, Silvano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Carrillo Montoya, Camilo Andres; Cavallo, Nicola; De Cosa, Annapaola; Dogangun, Oktay; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lista, Luca; Meola, Sabino; Merola, Mario; Paolucci, Pierluigi; Azzi, Patrizia; Bacchetta, Nicola; Bisello, Dario; Branca, Antonio; Carlin, Roberto; Checchia, Paolo; Dorigo, Tommaso; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Kanishchev, Konstantin; Lacaprara, Stefano; Lazzizzera, Ignazio; Margoni, Martino; Meneguzzo, Anna Teresa; Pazzini, Jacopo; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Vanini, Sara; Zotto, Pierluigi; Zucchetta, Alberto; Zumerle, Gianni; Gabusi, Michele; Ratti, Sergio P; Riccardi, Cristina; Torre, Paola; Vitulo, Paolo; Biasini, Maurizio; Bilei, Gian Mario; Fanò, Livio; Lariccia, Paolo; Mantovani, Giancarlo; Menichelli, Mauro; Nappi, Aniello; Romeo, Francesco; Saha, Anirban; Santocchia, Attilio; Spiezia, Aniello; Taroni, Silvia; Azzurri, Paolo; Bagliesi, Giuseppe; Bernardini, Jacopo; Boccali, Tommaso; Broccolo, Giuseppe; Castaldi, Rino; D'Agnolo, Raffaele Tito; Dell'Orso, Roberto; Fiori, Francesco; Foà, Lorenzo; Giassi, Alessandro; Kraan, Aafke; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Palla, Fabrizio; Rizzi, Andrea; Serban, Alin Titus; Spagnolo, Paolo; Squillacioti, Paola; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Barone, Luciano; Cavallari, Francesca; Del Re, Daniele; Diemoz, Marcella; Fanelli, Cristiano; Grassi, Marco; Longo, Egidio; Meridiani, Paolo; Micheli, Francesco; Nourbakhsh, Shervin; Organtini, Giovanni; Paramatti, Riccardo; Rahatlou, Shahram; Sigamani, Michael; Soffi, Livia; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Biino, Cristina; Cartiglia, Nicolo; Casasso, Stefano; Costa, Marco; Demaria, Natale; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Musich, Marco; Obertino, Maria Margherita; Pastrone, Nadia; Pelliccioni, Mario; Potenza, Alberto; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Solano, Ada; Staiano, Amedeo; Belforte, Stefano; Candelise, Vieri; Casarsa, Massimo; Cossutti, Fabio; Della Ricca, Giuseppe; Gobbo, Benigno; Marone, Matteo; Montanino, Damiana; Penzo, Aldo; Schizzi, Andrea; Kim, Tae Yeon; Nam, Soon-Kwon; Chang, Sunghyun; Kim, Dong Hee; Kim, Gui Nyun; Kong, Dae Jung; Park, Hyangkyu; Son, Dong-Chul; Son, Taejin; Kim, Jae Yool; Kim, Zero Jaeho; Song, Sanghyeon; Choi, Suyong; Gyun, Dooyeon; Hong, Byung-Sik; Jo, Mihee; Kim, Hyunchul; Kim, Tae Jeong; Lee, Kyong Sei; Moon, Dong Ho; Park, Sung Keun; Roh, Youn; Choi, Minkyoo; Kim, Ji Hyun; Park, Chawon; Park, Inkyu; Park, Sangnam; Ryu, Geonmo; Choi, Young-Il; Choi, Young Kyu; Goh, Junghwan; Kim, Min Suk; Kwon, Eunhyang; Lee, Byounghoon; Lee, Jongseok; Lee, Sungeun; Seo, Hyunkwan; Yu, Intae; Bilinskas, Mykolas Jurgis; Grigelionis, Ignas; Janulis, Mindaugas; Juodagalvis, Andrius; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-de La Cruz, Ivan; Lopez-Fernandez, Ricardo; Martínez-Ortega, Jorge; Sánchez Hernández, Alberto; Villasenor-Cendejas, Luis Manuel; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Salazar Ibarguen, Humberto Antonio; Casimiro Linares, Edgar; Morelos Pineda, Antonio; Reyes-Santos, Marco A; Krofcheck, David; Bell, Alan James; Butler, Philip H; Doesburg, Robert; Reucroft, Steve; Silverwood, Hamish; Ahmad, Muhammad; Asghar, Muhammad Irfan; Butt, Jamila; Hoorani, Hafeez R; Khalid, Shoaib; Khan, Wajid Ali; Khurshid, Taimoor; Qazi, Shamona; Shah, Mehar Ali; Shoaib, Muhammad; Bialkowska, Helena; Boimska, Bozena; Frueboes, Tomasz; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Wrochna, Grzegorz; Zalewski, Piotr; Brona, Grzegorz; Bunkowski, Karol; Cwiok, Mikolaj; Dominik, Wojciech; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Misiura, Maciej; Almeida, Nuno; Bargassa, Pedrame; David Tinoco Mendes, Andre; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Seixas, Joao; Varela, Joao; Vischia, Pietro; Belotelov, Ivan; Bunin, Pavel; Golutvin, Igor; Gorbunov, Ilya; Kamenev, Alexey; Karjavin, Vladimir; Kozlov, Guennady; Lanev, Alexander; Malakhov, Alexander; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Savina, Maria; Shmatov, Sergey; Smirnov, Vitaly; Volodko, Anton; Zarubin, Anatoli; Evstyukhin, Sergey; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; Vorobyev, Alexey; Vorobyev, Andrey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Kirsanov, Mikhail; Krasnikov, Nikolai; Matveev, Viktor; Pashenkov, Anatoli; Tlisov, Danila; Toropin, Alexander; Epshteyn, Vladimir; Erofeeva, Maria; Gavrilov, Vladimir; Kossov, Mikhail; Lychkovskaya, Natalia; Popov, Vladimir; Safronov, Grigory; Semenov, Sergey; Shreyber, Irina; Stolin, Viatcheslav; Vlasov, Evgueni; Zhokin, Alexander; Belyaev, Andrey; Boos, Edouard; Dubinin, Mikhail; Dudko, Lev; Ershov, Alexander; Gribushin, Andrey; Klyukhin, Vyacheslav; Kodolova, Olga; Lokhtin, Igor; Markina, Anastasia; Obraztsov, Stepan; Perfilov, Maxim; Petrushanko, Sergey; Popov, Andrey; Sarycheva, Ludmila; Savrin, Viktor; Snigirev, Alexander; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Mesyats, Gennady; Rusakov, Sergey V; Vinogradov, Alexey; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Grishin, Viatcheslav; Kachanov, Vassili; Konstantinov, Dmitri; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Tourtchanovitch, Leonid; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Djordjevic, Milos; Ekmedzic, Marko; Krpic, Dragomir; Milosevic, Jovan; Aguilar-Benitez, Manuel; Alcaraz Maestre, Juan; Arce, Pedro; Battilana, Carlo; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Domínguez Vázquez, Daniel; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Ferrando, Antonio; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Merino, Gonzalo; Puerta Pelayo, Jesus; Quintario Olmeda, Adrián; Redondo, Ignacio; Romero, Luciano; Santaolalla, Javier; Senghi Soares, Mara; Willmott, Carlos; Albajar, Carmen; Codispoti, Giuseppe; de Trocóniz, Jorge F; Brun, Hugues; Cuevas, Javier; Fernandez Menendez, Javier; Folgueras, Santiago; Gonzalez Caballero, Isidro; Lloret Iglesias, Lara; Piedra Gomez, Jonatan; Brochero Cifuentes, Javier Andres; Cabrillo, Iban Jose; Calderon, Alicia; Chuang, Shan-Huei; Duarte Campderros, Jordi; Felcini, Marta; Fernandez, Marcos; Gomez, Gervasio; Gonzalez Sanchez, Javier; Graziano, Alberto; Jorda, Clara; Lopez Virto, Amparo; Marco, Jesus; Marco, Rafael; Martinez Rivero, Celso; Matorras, Francisco; Munoz Sanchez, Francisca Javiela; Rodrigo, Teresa; Rodríguez-Marrero, Ana Yaiza; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Bachtis, Michail; Baillon, Paul; Ball, Austin; Barney, David; Benitez, Jose F; Bernet, Colin; Bianchi, Giovanni; Bloch, Philippe; Bocci, Andrea; Bonato, Alessio; Botta, Cristina; Breuker, Horst; Camporesi, Tiziano; Cerminara, Gianluca; Christiansen, Tim; Coarasa Perez, Jose Antonio; D'Enterria, David; Dabrowski, Anne; De Roeck, Albert; Di Guida, Salvatore; Dobson, Marc; Dupont-Sagorin, Niels; Elliott-Peisert, Anna; Frisch, Benjamin; Funk, Wolfgang; Georgiou, Georgios; Giffels, Manuel; Gigi, Dominique; Gill, Karl; Giordano, Domenico; Girone, Maria; Giunta, Marina; Glege, Frank; Gomez-Reino Garrido, Robert; Govoni, Pietro; Gowdy, Stephen; Guida, Roberto; Gundacker, Stefan; Hammer, Josef; Hansen, Magnus; Harris, Philip; Hartl, Christian; Harvey, John; Hegner, Benedikt; Hinzmann, Andreas; Innocente, Vincenzo; Janot, Patrick; Kaadze, Ketino; Karavakis, Edward; Kousouris, Konstantinos; Lecoq, Paul; Lee, Yen-Jie; Lenzi, Piergiulio; Lourenco, Carlos; Magini, Nicolo; Maki, Tuula; Malberti, Martina; Malgeri, Luca; Mannelli, Marcello; Masetti, Lorenzo; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moser, Roland; Mozer, Matthias Ulrich; Mulders, Martijn; Musella, Pasquale; Nesvold, Erik; Orsini, Luciano; Palencia Cortezon, Enrique; Perez, Emmanuelle; Perrozzi, Luca; Petrilli, Achille; Pfeiffer, Andreas; Pierini, Maurizio; Pimiä, Martti; Piparo, Danilo; Polese, Giovanni; Quertenmont, Loic; Racz, Attila; Reece, William; Rodrigues Antunes, Joao; Rolandi, Gigi; Rovelli, Chiara; Rovere, Marco; Sakulin, Hannes; Santanastasio, Francesco; Schäfer, Christoph; Schwick, Christoph; Segoni, Ilaria; Sekmen, Sezen; Sharma, Archana; Siegrist, Patrice; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Spiga, Daniele; Tsirou, Andromachi; Veres, Gabor Istvan; Vlimant, Jean-Roch; Wöhri, Hermine Katharina; Worm, Steven; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Gabathuler, Kurt; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; König, Stefan; Kotlinski, Danek; Langenegger, Urs; Meier, Frank; Renker, Dieter; Rohe, Tilman; Bäni, Lukas; Bortignon, Pierluigi; Buchmann, Marco-Andrea; Casal, Bruno; Chanon, Nicolas; Deisher, Amanda; Dissertori, Günther; Dittmar, Michael; Donegà, Mauro; Dünser, Marc; Eller, Philipp; Eugster, Jürg; Freudenreich, Klaus; Grab, Christoph; Hits, Dmitry; Lecomte, Pierre; Lustermann, Werner; Marini, Andrea Carlo; Martinez Ruiz del Arbol, Pablo; Mohr, Niklas; Moortgat, Filip; Nägeli, Christoph; Nef, Pascal; Nessi-Tedaldi, Francesca; Pandolfi, Francesco; Pape, Luc; Pauss, Felicitas; Peruzzi, Marco; Ronga, Frederic Jean; Rossini, Marco; Sala, Leonardo; Sanchez, Ann - Karin; Starodumov, Andrei; Stieger, Benjamin; Takahashi, Maiko; Tauscher, Ludwig; Thea, Alessandro; Theofilatos, Konstantinos; Treille, Daniel; Urscheler, Christina; Wallny, Rainer; Weber, Hannsjoerg Artur; Wehrli, Lukas; Amsler, Claude; Chiochia, Vincenzo; De Visscher, Simon; Favaro, Carlotta; Ivova Rikova, Mirena; Kilminster, Benjamin; Millan Mejias, Barbara; Otiougova, Polina; Robmann, Peter; Snoek, Hella; Tupputi, Salvatore; Verzetti, Mauro; Chang, Yuan-Hann; Chen, Kuan-Hsin; Ferro, Cristina; Kuo, Chia-Ming; Li, Syue-Wei; Lin, Willis; Lu, Yun-Ju; Singh, Anil; Volpe, Roberta; Yu, Shin-Shan; Bartalini, Paolo; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Dietz, Charles; Grundler, Ulysses; Hou, George Wei-Shu; Hsiung, Yee; Kao, Kai-Yi; Lei, Yeong-Jyi; Lu, Rong-Shyang; Majumder, Devdatta; Petrakou, Eleni; Shi, Xin; Shiu, Jing-Ge; Tzeng, Yeng-Ming; Wan, Xia; Wang, Minzu; Asavapibhop, Burin; Srimanobhas, Norraphat; Adiguzel, Aytul; Bakirci, Mustafa Numan; Cerci, Salim; Dozen, Candan; Dumanoglu, Isa; Eskut, Eda; Girgis, Semiray; Gokbulut, Gul; Gurpinar, Emine; Hos, Ilknur; Kangal, Evrim Ersin; Karaman, Turker; Karapinar, Guler; Kayis Topaksu, Aysel; Onengut, Gulsen; Ozdemir, Kadri; Ozturk, Sertac; Polatoz, Ayse; Sogut, Kenan; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Vergili, Latife Nukhet; Vergili, Mehmet; Akin, Ilina Vasileva; Aliev, Takhmasib; Bilin, Bugra; Bilmis, Selcuk; Deniz, Muhammed; Gamsizkan, Halil; Guler, Ali Murat; Ocalan, Kadir; Ozpineci, Altug; Serin, Meltem; Sever, Ramazan; Surat, Ugur Emrah; Yalvac, Metin; Yildirim, Eda; Zeyrek, Mehmet; Gülmez, Erhan; Isildak, Bora; Kaya, Mithat; Kaya, Ozlem; Ozkorucuklu, Suat; Sonmez, Nasuf; Cankocak, Kerem; Levchuk, Leonid; Brooke, James John; Clement, Emyr; Cussans, David; Flacher, Henning; Frazier, Robert; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Kreczko, Lukasz; Metson, Simon; Newbold, Dave M; Nirunpong, Kachanon; Poll, Anthony; Senkin, Sergey; Smith, Vincent J; Williams, Thomas; Basso, Lorenzo; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Jackson, James; Kennedy, Bruce W; Olaiya, Emmanuel; Petyt, David; Radburn-Smith, Benjamin Charles; Shepherd-Themistocleous, Claire; Tomalin, Ian R; Womersley, William John; Bainbridge, Robert; Ball, Gordon; Beuselinck, Raymond; Buchmuller, Oliver; Colling, David; Cripps, Nicholas; Cutajar, Michael; Dauncey, Paul; Davies, Gavin; Della Negra, Michel; Ferguson, William; Fulcher, Jonathan; Futyan, David; Gilbert, Andrew; Guneratne Bryer, Arlo; Hall, Geoffrey; Hatherell, Zoe; Hays, Jonathan; Iles, Gregory; Jarvis, Martyn; Karapostoli, Georgia; Lyons, Louis; Magnan, Anne-Marie; Marrouche, Jad; Mathias, Bryn; Nandi, Robin; Nash, Jordan; Nikitenko, Alexander; Pela, Joao; Pesaresi, Mark; Petridis, Konstantinos; Pioppi, Michele; Raymond, David Mark; Rogerson, Samuel; Rose, Andrew; Ryan, Matthew John; Seez, Christopher; Sharp, Peter; Sparrow, Alex; Stoye, Markus; Tapper, Alexander; Vazquez Acosta, Monica; Virdee, Tejinder; Wakefield, Stuart; Wardle, Nicholas; Whyntie, Tom; Chadwick, Matthew; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leggat, Duncan; Leslie, Dawn; Martin, William; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Hatakeyama, Kenichi; Liu, Hongxuan; Scarborough, Tara; Charaf, Otman; Henderson, Conor; Rumerio, Paolo; Avetisyan, Aram; Bose, Tulika; Fantasia, Cory; Heister, Arno; St John, Jason; Lawson, Philip; Lazic, Dragoslav; Rohlf, James; Sperka, David; Sulak, Lawrence; Alimena, Juliette; Bhattacharya, Saptaparna; Christopher, Grant; Cutts, David; Demiragli, Zeynep; Ferapontov, Alexey; Garabedian, Alex; Heintz, Ulrich; Jabeen, Shabnam; Kukartsev, Gennadiy; Laird, Edward; Landsberg, Greg; Luk, Michael; Narain, Meenakshi; Nguyen, Duong; Segala, Michael; Sinthuprasith, Tutanon; Speer, Thomas; Breedon, Richard; Breto, Guillermo; Calderon De La Barca Sanchez, Manuel; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Dolen, James; Erbacher, Robin; Gardner, Michael; Houtz, Rachel; Ko, Winston; Kopecky, Alexandra; Lander, Richard; Mall, Orpheus; Miceli, Tia; Pellett, Dave; Ricci-Tam, Francesca; Rutherford, Britney; Searle, Matthew; Smith, John; Squires, Michael; Tripathi, Mani; Vasquez Sierra, Ricardo; Yohay, Rachel; Andreev, Valeri; Cline, David; Cousins, Robert; Duris, Joseph; Erhan, Samim; Everaerts, Pieter; Farrell, Chris; Hauser, Jay; Ignatenko, Mikhail; Jarvis, Chad; Rakness, Gregory; Schlein, Peter; Traczyk, Piotr; Valuev, Vyacheslav; Weber, Matthias; Babb, John; Clare, Robert; Dinardo, Mauro Emanuele; Ellison, John Anthony; Gary, J William; Giordano, Ferdinando; Hanson, Gail; Liu, Hongliang; Long, Owen Rosser; Luthra, Arun; Nguyen, Harold; Paramesvaran, Sudarshan; Sturdy, Jared; Sumowidagdo, Suharyo; Wilken, Rachel; Wimpenny, Stephen; Andrews, Warren; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; Evans, David; Holzner, André; Kelley, Ryan; Lebourgeois, Matthew; Letts, James; Macneill, Ian; Mangano, Boris; Padhi, Sanjay; Palmer, Christopher; Petrucciani, Giovanni; Pieri, Marco; Sani, Matteo; Sharma, Vivek; Simon, Sean; Sudano, Elizabeth; Tadel, Matevz; Tu, Yanjun; Vartak, Adish; Wasserbaech, Steven; Würthwein, Frank; Yagil, Avraham; Yoo, Jaehyeok; Barge, Derek; Bellan, Riccardo; Campagnari, Claudio; D'Alfonso, Mariarosaria; Danielson, Thomas; Flowers, Kristen; Geffert, Paul; Golf, Frank; Incandela, Joe; Justus, Christopher; Kalavase, Puneeth; Kovalskyi, Dmytro; Krutelyov, Vyacheslav; Lowette, Steven; Magaña Villalba, Ricardo; Mccoll, Nickolas; Pavlunin, Viktor; Ribnik, Jacob; Richman, Jeffrey; Rossin, Roberto; Stuart, David; To, Wing; West, Christopher; Apresyan, Artur; Bornheim, Adolf; Chen, Yi; Di Marco, Emanuele; Duarte, Javier; Gataullin, Marat; Ma, Yousi; Mott, Alexander; Newman, Harvey B; Rogan, Christopher; Spiropulu, Maria; Timciuc, Vladlen; Veverka, Jan; Wilkinson, Richard; Xie, Si; Yang, Yong; Zhu, Ren-Yuan; Azzolini, Virginia; Calamba, Aristotle; Carroll, Ryan; Ferguson, Thomas; Iiyama, Yutaro; Jang, Dong Wook; Liu, Yueh-Feng; Paulini, Manfred; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Drell, Brian Robert; Ford, William T; Gaz, Alessandro; Luiggi Lopez, Eduardo; Smith, James; Stenson, Kevin; Ulmer, Keith; Wagner, Stephen Robert; Alexander, James; Chatterjee, Avishek; Eggert, Nicholas; Gibbons, Lawrence Kent; Heltsley, Brian; Hopkins, Walter; Khukhunaishvili, Aleko; Kreis, Benjamin; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Ryd, Anders; Salvati, Emmanuele; Sun, Werner; Teo, Wee Don; Thom, Julia; Thompson, Joshua; Tucker, Jordan; Vaughan, Jennifer; Weng, Yao; Winstrom, Lucas; Wittich, Peter; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Anderson, Jacob; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Burkett, Kevin; Butler, Joel Nathan; Chetluru, Vasundhara; Cheung, Harry; Chlebana, Frank; Elvira, Victor Daniel; Fisk, Ian; Freeman, Jim; Gao, Yanyan; Green, Dan; Gutsche, Oliver; Hanlon, Jim; Harris, Robert M; Hirschauer, James; Hooberman, Benjamin; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kunori, Shuichi; Kwan, Simon; Leonidopoulos, Christos; Linacre, Jacob; Lincoln, Don; Lipton, Ron; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Maruyama, Sho; Mason, David; McBride, Patricia; Mishra, Kalanand; Mrenna, Stephen; Musienko, Yuri; Newman-Holmes, Catherine; O'Dell, Vivian; Prokofyev, Oleg; Sexton-Kennedy, Elizabeth; Sharma, Seema; Spalding, William J; Spiegel, Leonard; Taylor, Lucas; Tkaczyk, Slawek; Tran, Nhan Viet; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vidal, Richard; Whitmore, Juliana; Wu, Weimin; Yang, Fan; Yun, Jae Chul; Acosta, Darin; Avery, Paul; Bourilkov, Dimitri; Chen, Mingshui; Cheng, Tongguang; Das, Souvik; De Gruttola, Michele; Di Giovanni, Gian Piero; Dobur, Didar; Drozdetskiy, Alexey; Field, Richard D; Fisher, Matthew; Fu, Yu; Furic, Ivan-Kresimir; Gartner, Joseph; Hugon, Justin; Kim, Bockjoo; Konigsberg, Jacobo; Korytov, Andrey; Kropivnitskaya, Anna; Kypreos, Theodore; Low, Jia Fu; Matchev, Konstantin; Milenovic, Predrag; Mitselmakher, Guenakh; Muniz, Lana; Park, Myeonghun; Remington, Ronald; Rinkevicius, Aurelijus; Sellers, Paul; Skhirtladze, Nikoloz; Snowball, Matthew; Yelton, John; Zakaria, Mohammed; Gaultney, Vanessa; Hewamanage, Samantha; Lebolo, Luis Miguel; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Adams, Todd; Askew, Andrew; Bochenek, Joseph; Chen, Jie; Diamond, Brendan; Gleyzer, Sergei V; Haas, Jeff; Hagopian, Sharon; Hagopian, Vasken; Jenkins, Merrill; Johnson, Kurtis F; Prosper, Harrison; Veeraraghavan, Venkatesh; Weinberg, Marc; Baarmand, Marc M; Dorney, Brian; Hohlmann, Marcus; Kalakhety, Himali; Vodopiyanov, Igor; Yumiceva, Francisco; Adams, Mark Raymond; Anghel, Ioana Maria; Apanasevich, Leonard; Bai, Yuting; Bazterra, Victor Eduardo; Betts, Russell Richard; Bucinskaite, Inga; Callner, Jeremy; Cavanaugh, Richard; Evdokimov, Olga; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Khalatyan, Samvel; Lacroix, Florent; O'Brien, Christine; Silkworth, Christopher; Strom, Derek; Turner, Paul; Varelas, Nikos; Akgun, Ugur; Albayrak, Elif Asli; Bilki, Burak; Clarida, Warren; Duru, Firdevs; Griffiths, Scott; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Newsom, Charles Ray; Norbeck, Edwin; Onel, Yasar; Ozok, Ferhat; Sen, Sercan; Tan, Ping; Tiras, Emrah; Wetzel, James; Yetkin, Taylan; Yi, Kai; Barnett, Bruce Arnold; Blumenfeld, Barry; Bolognesi, Sara; Fehling, David; Giurgiu, Gavril; Gritsan, Andrei; Guo, Zijin; Hu, Guofan; Maksimovic, Petar; Swartz, Morris; Whitbeck, Andrew; Baringer, Philip; Bean, Alice; Benelli, Gabriele; Kenny Iii, Raymond Patrick; Murray, Michael; Noonan, Daniel; Sanders, Stephen; Stringer, Robert; Tinti, Gemma; Wood, Jeffrey Scott; Barfuss, Anne-Fleur; Bolton, Tim; Chakaberia, Irakli; Ivanov, Andrew; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Shrestha, Shruti; Svintradze, Irakli; Gronberg, Jeffrey; Lange, David; Rebassoo, Finn; Wright, Douglas; Baden, Drew; Calvert, Brian; Eno, Sarah Catherine; Gomez, Jaime; Hadley, Nicholas John; Kellogg, Richard G; Kirn, Malina; Kolberg, Ted; Lu, Ying; Marionneau, Matthieu; Mignerey, Alice; Pedro, Kevin; Peterman, Alison; Skuja, Andris; Temple, Jeffrey; Tonjes, Marguerite; Tonwar, Suresh C; Apyan, Aram; Bauer, Gerry; Bendavid, Joshua; Busza, Wit; Butz, Erik; Cali, Ivan Amos; Chan, Matthew; Dutta, Valentina; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Kim, Yongsun; Klute, Markus; Krajczar, Krisztian; Levin, Andrew; Luckey, Paul David; Ma, Teng; Nahn, Steve; Paus, Christoph; Ralph, Duncan; Roland, Christof; Roland, Gunther; Rudolph, Matthew; Stephans, George; Stöckli, Fabian; Sumorok, Konstanty; Sung, Kevin; Velicanu, Dragos; Wenger, Edward Allen; Wolf, Roger; Wyslouch, Bolek; Yang, Mingming; Yilmaz, Yetkin; Yoon, Sungho; Zanetti, Marco; Zhukova, Victoria; Cooper, Seth; Dahmes, Bryan; De Benedetti, Abraham; Franzoni, Giovanni; Gude, Alexander; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Mans, Jeremy; Pastika, Nathaniel; Rusack, Roger; Sasseville, Michael; Singovsky, Alexander; Tambe, Norbert; Turkewitz, Jared; Cremaldi, Lucien Marcus; Kroeger, Rob; Perera, Lalith; Rahmat, Rahmat; Sanders, David A; Avdeeva, Ekaterina; Bloom, Kenneth; Bose, Suvadeep; Claes, Daniel R; Dominguez, Aaron; Eads, Michael; Keller, Jason; Kravchenko, Ilya; Lazo-Flores, Jose; Malik, Sudhir; Snow, Gregory R; Godshalk, Andrew; Iashvili, Ia; Jain, Supriya; Kharchilava, Avto; Kumar, Ashish; Rappoccio, Salvatore; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Haley, Joseph; Nash, David; Orimoto, Toyoko; Trocino, Daniele; Wood, Darien; Zhang, Jinzhong; Anastassov, Anton; Hahn, Kristan Allan; Kubik, Andrew; Lusito, Letizia; Mucia, Nicholas; Odell, Nathaniel; Ofierzynski, Radoslaw Adrian; Pollack, Brian; Pozdnyakov, Andrey; Schmitt, Michael Henry; Stoynev, Stoyan; Velasco, Mayda; Won, Steven; Antonelli, Louis; Berry, Douglas; Brinkerhoff, Andrew; Chan, Kwok Ming; Hildreth, Michael; Jessop, Colin; Karmgard, Daniel John; Kolb, Jeff; Lannon, Kevin; Luo, Wuming; Lynch, Sean; Marinelli, Nancy; Morse, David Michael; Pearson, Tessa; Planer, Michael; Ruchti, Randy; Slaunwhite, Jason; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Bylsma, Ben; Durkin, Lloyd Stanley; Hill, Christopher; Hughes, Richard; Kotov, Khristian; Ling, Ta-Yung; Puigh, Darren; Rodenburg, Marissa; Vuosalo, Carl; Williams, Grayson; Winer, Brian L; Berry, Edmund; Elmer, Peter; Halyo, Valerie; Hebda, Philip; Hegeman, Jeroen; Hunt, Adam; Jindal, Pratima; Koay, Sue Ann; Lopes Pegna, David; Lujan, Paul; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Piroué, Pierre; Quan, Xiaohang; Raval, Amita; Saka, Halil; Stickland, David; Tully, Christopher; Werner, Jeremy Scott; Zuranski, Andrzej; Brownson, Eric; Lopez, Angel; Mendez, Hector; Ramirez Vargas, Juan Eduardo; Alagoz, Enver; Barnes, Virgil E; Benedetti, Daniele; Bolla, Gino; Bortoletto, Daniela; De Mattia, Marco; Everett, Adam; Hu, Zhen; Jones, Matthew; Koybasi, Ozhan; Kress, Matthew; Laasanen, Alvin T; Leonardo, Nuno; Maroussov, Vassili; Merkel, Petra; Miller, David Harry; Neumeister, Norbert; Shipsey, Ian; Silvers, David; Svyatkovskiy, Alexey; Vidal Marono, Miguel; Yoo, Hwi Dong; Zablocki, Jakub; Zheng, Yu; Guragain, Samir; Parashar, Neeti; Adair, Antony; Akgun, Bora; Boulahouache, Chaouki; Ecklund, Karl Matthew; Geurts, Frank JM; Li, Wei; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Zabel, James; Betchart, Burton; Bodek, Arie; Chung, Yeon Sei; Covarelli, Roberto; de Barbaro, Pawel; Demina, Regina; Eshaq, Yossof; Ferbel, Thomas; Garcia-Bellido, Aran; Goldenzweig, Pablo; Han, Jiyeon; Harel, Amnon; Miner, Daniel Carl; Vishnevskiy, Dmitry; Zielinski, Marek; Bhatti, Anwar; Ciesielski, Robert; Demortier, Luc; Goulianos, Konstantin; Lungu, Gheorghe; Malik, Sarah; Mesropian, Christina; Arora, Sanjay; Barker, Anthony; Chou, John Paul; Contreras-Campana, Christian; Contreras-Campana, Emmanuel; Duggan, Daniel; Ferencek, Dinko; Gershtein, Yuri; Gray, Richard; Halkiadakis, Eva; Hidas, Dean; Lath, Amitabh; Panwalkar, Shruti; Park, Michael; Patel, Rishi; Rekovic, Vladimir; Robles, Jorge; Rose, Keith; Salur, Sevil; Schnetzer, Steve; Seitz, Claudia; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Walker, Matthew; Cerizza, Giordano; Hollingsworth, Matthew; Spanier, Stefan; Yang, Zong-Chang; York, Andrew; Eusebi, Ricardo; Flanagan, Will; Gilmore, Jason; Kamon, Teruki; Khotilovich, Vadim; Montalvo, Roy; Osipenkov, Ilya; Pakhotin, Yuriy; Perloff, Alexx; Roe, Jeffrey; Safonov, Alexei; Sakuma, Tai; Sengupta, Sinjini; Suarez, Indara; Tatarinov, Aysen; Toback, David; Akchurin, Nural; Damgov, Jordan; Dragoiu, Cosmin; Dudero, Phillip Russell; Jeong, Chiyoung; Kovitanggoon, Kittikul; Lee, Sung Won; Libeiro, Terence; Volobouev, Igor; Appelt, Eric; Delannoy, Andrés G; Florez, Carlos; Greene, Senta; Gurrola, Alfredo; Johns, Willard; Kurt, Pelin; Maguire, Charles; Melo, Andrew; Sharma, Monika; Sheldon, Paul; Snook, Benjamin; Tuo, Shengquan; Velkovska, Julia; Arenton, Michael Wayne; Balazs, Michael; Boutle, Sarah; Cox, Bradley; Francis, Brian; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Lin, Chuanzhe; Neu, Christopher; Wood, John; Gollapinni, Sowjanya; Harr, Robert; Karchin, Paul Edmund; Kottachchi Kankanamge Don, Chamath; Lamichhane, Pramod; Sakharov, Alexandre; Anderson, Michael; Belknap, Donald; Borrello, Laura; Carlsmith, Duncan; Cepeda, Maria; Dasu, Sridhara; Friis, Evan; Gray, Lindsey; Grogg, Kira Suzanne; Grothe, Monika; Hall-Wilton, Richard; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Klukas, Jeffrey; Lanaro, Armando; Lazaridis, Christos; Loveless, Richard; Mohapatra, Ajit; Ojalvo, Isabel; Palmonari, Francesco; Pierro, Giuseppe Antonio; Ross, Ian; Savin, Alexander; Smith, Wesley H; Swanson, Joshua

    2013-04-02

    In this paper, a search for supersymmetry (SUSY) is presented in events with two opposite-sign isolated leptons in the final state, accompanied by hadronic jets and missing transverse energy. An artificial neural network is employed to discriminate possible SUSY signals from standard model background. The analysis uses a data sample collected with the CMS detector during the 2011 LHC run, corresponding to an integrated luminosity of 4.98 inverse femtobarns of proton-proton collisions at the center of mass energy of 7 TeV. Compared to other CMS analyses, this one uses relaxed criteria on missing transverse energy (missing ET > 40 GeV) and total hadronic transverse energy (HT > 120 GeV), thus probing different regions of parameter space. Agreement is found between standard model expectation and observation, yielding limits in the context of the constrained mininal supersymmetric standard model and on a set of simplified models.

  16. Simultaneous tDCS-fMRI Identifies Resting State Networks Correlated with Visual Search Enhancement

    Directory of Open Access Journals (Sweden)

    Daniel eCallan

    2016-03-01

    Full Text Available This study uses simultaneous transcranial direct current stimulation tDCS and fMRI to investigate tDCS modulation of resting state activity and connectivity that underlies enhancement in behavioral performance. The experiment consisted of three sessions within the fMRI scanner in which participants conducted a visual search task: Session 1. Pre-training (no performance feedback, Session 2. Training (performance feedback given, Session 3. Post-training (no performance feedback. Resting state activity was recorded during the last five minutes of each session. During the 2nd session one group of participants underwent 1mA tDCS stimulation and another underwent sham stimulation over the right posterior parietal cortex. Resting state spontaneous activity, as measured by fractional amplitude of low frequency fluctuations, for session 2 showed significant differences between the tDCS stim and sham groups in the precuneus. Resting state functional connectivity from the precuneus to the substantia nigra, a subcortical dopaminergic region, was found to correlate with future improvement in visual search task performance for the stim over the sham group during active stimulation in session 2. The after-effect of stimulation on resting state functional connectivity was measured following a post-training experimental session (session 3. The left cerebellum Lobule VIIa Crus I showed performance related enhancement in resting state functional connectivity for the tDCS stim over the sham group. The ability to determine the relationship that the relative strength of resting state functional connectivity for an individual undergoing tDCS has on future enhancement in behavioral performance has wide ranging implications for neuroergonomic as well as therapeutic, and rehabilitative applications.

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

  18. Cacti beginner's guide leverage Cacti to design a robust network operations center

    CERN Document Server

    Urban, Thomas

    2017-01-01

    The book is designed in such a way that you can explore it chapter-by-chapter or skip any chapter without missing a beat. If you are a network operator and want to use Cacti for implementing performance measurement for trending, troubleshooting, and reporting purposes, then this book is for you. You only need to know the basics of network ...

  19. Network-Based Leadership Development: A Guiding Framework and Resources for Management Educators

    Science.gov (United States)

    Cullen-Lester, Kristin L.; Woehler, Meredith L.; Willburn, Phil

    2016-01-01

    Management education and leadership development has traditionally focused on improving human capital (i.e., knowledge, skills, and abilities). Social capital, networks, and networking skills have received less attention. When this content has been incorporated into learning and development experiences, it has often been more ad hoc and has…

  20. Practical network design techniques a complete guide for WANs and LANs

    CERN Document Server

    Held, Gilbert

    2004-01-01

    This new edition has two parts. The first part focuses on wide area networks; the second, which is entirely new, focuses on local area networks. Because Ethernet emerged victorious in the LAN war, the second section pays particular attention to Ethernet design and performance characteristics.

  1. Cacti beginner's guide leverage cacti to design a robust network operations center

    CERN Document Server

    Urban, Thomas

    2017-01-01

    The book is designed in such a way that you can explore it chapter-by-chapter or skip any chapter without missing a beat. If you are a network operator and want to use Cacti for implementing performance measurement for trending, troubleshooting, and reporting purposes, then this book is for you. You only need to know the basics of network ...

  2. In Search of a Network Organization for Innovation: A Multilevel Analysis on Transnational Corporations' Global Innovation

    DEFF Research Database (Denmark)

    Hu, Yimei

    2013-01-01

    in the existing literature, and its definition is highly debatable, especially when it refers to companies’ internal organizational design. This PhD dissertation is an exploratory study on network organization for innovation, aiming to investigate the following two research questions: • How do transnational...... on the description and analysis of the Danish triple helix’s innovation activities in China, Paper 2 proposes a stage-model of the internationalization of the triple helix, consisting of three stages, i.e. pioneering, exploration and integration stage. In the pioneering stage, we see the establishment of each...... of the three helix spheres abroad, i.e. internationalization of companies, universities and governments; in the exploration stage, the three spheres start to interact abroad and collaborate with counterparts in the host country; and finally, in the integration stage, helix to helix collaboration emerges. Paper...

  3. Informatics in Radiology: What Can You See in a Single Glance and How Might This Guide Visual Search in Medical Images?

    Science.gov (United States)

    Evans, Karla; Võ, Melissa L. -H.; Jacobson, Francine L.; Wolfe, Jeremy M.

    2013-01-01

    Diagnostic accuracy for radiologists is above that expected by chance when they are exposed to a chest radiograph for only one-fifth of a second, a period too brief for more than a single voluntary eye movement. How do radiologists glean information from a first glance at an image? It is thought that this expert impression of the gestalt of an image is related to the everyday, immediate visual understanding of the gist of a scene. Several high-speed mechanisms guide our search of complex images. Guidance by basic features (such as color) requires no learning, whereas guidance by complex scene properties is learned. It is probable that both hardwired guidance by basic features and learned guidance by scene structure become part of radiologists’ expertise. Search in scenes may be best explained by a two-pathway model: Object recognition is performed via a selective pathway in which candidate targets must be individually selected for recognition. A second, nonselective pathway extracts information from global or statistical information without selecting specific objects. An appreciation of the role of nonselective processing may be particularly useful for understanding what separates novice from expert radiologists and could help establish new methods of physician training based on medical image perception. © RSNA, 2012 PMID:23104971

  4. Searching for optimal setting conditions in technological processes using parametric estimation models and neural network mapping approach: a tutorial.

    Science.gov (United States)

    Fjodorova, Natalja; Novič, Marjana

    2015-09-03

    Engineering optimization is an actual goal in manufacturing and service industries. In the tutorial we represented the concept of traditional parametric estimation models (Factorial Design (FD) and Central Composite Design (CCD)) for searching optimal setting parameters of technological processes. Then the 2D mapping method based on Auto Associative Neural Networks (ANN) (particularly, the Feed Forward Bottle Neck Neural Network (FFBN NN)) was described in comparison with traditional methods. The FFBN NN mapping technique enables visualization of all optimal solutions in considered processes due to the projection of input as well as output parameters in the same coordinates of 2D map. This phenomenon supports the more efficient way of improving the performance of existing systems. Comparison of two methods was performed on the bases of optimization of solder paste printing processes as well as optimization of properties of cheese. Application of both methods enables the double check. This increases the reliability of selected optima or specification limits. Copyright © 2015 Elsevier B.V. All rights reserved.

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

  6. CCNA Cisco Certified Network Associate Study Guide: Exam 640-801

    CERN Document Server

    Lammle, Todd

    2006-01-01

    Here's the book you need to prepare for Cisco's revised CCNA exam, 640-801. This new edition of the best-selling CCNA Study Guide provides in-depth coverage of every CCNA exam objective, practical information on Cisco internetworking solutions and hundreds of challenging review questions.

  7. Consumer's Guide to Radon Reduction

    Science.gov (United States)

    ... Protection Agency Search Search Radon Contact Us Share Consumer's Guide to Radon Reduction: How to Fix Your ... See EPA’s About PDF page to learn more. Consumer's Guide to Radon Reduction: How to Fix Your ...

  8. Emotion regulation in bereavement: searching for and finding emotional support in social network sites

    Science.gov (United States)

    Döveling, Katrin

    2015-04-01

    In an age of rising impact of online communication in social network sites (SNS), emotional interaction is neither limited nor restricted by time or space. Bereavement extends to the anonymity of cyberspace. What role does virtual interaction play in SNS in dealing with the basic human emotion of grief caused by the loss of a beloved person? The analysis laid out in this article provides answers in light of an interdisciplinary perspective on online bereavement. Relevant lines of research are scrutinized. After laying out the theoretical spectrum for the study, hypotheses based on a prior in-depth qualitative content analysis of 179 postings in three different German online bereavement platforms are proposed and scrutinized in a quantitative content analysis (2127 postings from 318 users). Emotion regulation patterns in SNS and similarities as well as differences in online bereavement of children, adolescents and adults are revealed. Large-scale quantitative findings into central motives, patterns, and restorative effects of online shared bereavement in regulating distress, fostering personal empowerment, and engendering meaning are presented. The article closes with implications for further analysis in memorialization practices.

  9. Searching for collective behavior in a large network of sensory neurons.

    Directory of Open Access Journals (Sweden)

    Gašper Tkačik

    2014-01-01

    Full Text Available Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such "K-pairwise" models--being systematic extensions of the previously used pairwise Ising models--provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1 estimating its entropy, which constrains the population's capacity to represent visual information; 2 classifying activity patterns into a small set of metastable collective modes; 3 showing that the neural codeword ensembles are extremely inhomogenous; 4 demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction.

  10. A regulatory network modeled from wild-type gene expression data guides functional predictions in Caenorhabditis elegans development

    Directory of Open Access Journals (Sweden)

    Stigler Brandilyn

    2012-06-01

    tbx-8 and tbx-9. Conclusions This work provides a strong example for a mathematical modeling approach that solely uses wild-type data to predict an underlying gene regulatory network. The modeling approach complements traditional methods of data analysis, suggesting non-intuitive network relationships and guiding future experiments.

  11. The use of quantum molecular calculations to guide a genetic algorithm: a way to search for new chemistry.

    Science.gov (United States)

    Durrant, Marcus C

    2007-01-01

    The process of gene-based molecular evolution has been simulated in silico by using massively parallel density functional theory quantum calculations, coupled with a genetic algorithm, to test for fitness with respect to a target chemical reaction in populations of genetically encoded molecules. The goal of this study was the identification of transition-metal complexes capable of mediating a known reaction, namely the cleavage of N(2) to give the metal nitride. Each complex within the search space was uniquely specified by a nanogene consisting of an eight-digit number. Propagation of an individual nanogene into successive generations was determined by the fitness of its phenotypic molecule to perform the target reaction and new generations were created by recombination and mutation of surviving nanogenes. In its simplest implementation, the quantum-directed genetic algorithm (QDGA) quickly located a local minimum on the evolutionary fitness hypersurface, but proved incapable of progressing towards the global minimum. A strategy for progressing beyond local minima consistent with the Darwinian paradigm by the use of environmental variations coupled with mass extinctions was therefore developed. This allowed for the identification of nitriding complexes that are very closely related to known examples from the chemical literature. Examples of mutations that appear to be beneficial at the genetic level but prove to be harmful at the phenotypic level are described. As well as revealing fundamental aspects of molecular evolution, QDGA appears to be a powerful tool for the identification of lead compounds capable of carrying out a target chemical reaction.

  12. The complete guide to using Google in libraries research, user applications, and networking

    CERN Document Server

    Smallwood, Carol

    2015-01-01

    Google has now developed services far beyond text search. Google software will translate languages and support collaborative writing. The chapters in this book look at many Google services, from music to finance, and describe how they can be used by students and other library users.

  13. Construction and evaluation of yeast expression networks by database-guided predictions

    Directory of Open Access Journals (Sweden)

    Katharina Papsdorf

    2016-05-01

    Full Text Available DNA-Microarrays are powerful tools to obtain expression data on the genome-wide scale. We performed microarray experiments to elucidate the transcriptional networks, which are up- or down-regulated in response to the expression of toxic polyglutamine proteins in yeast. Such experiments initially generate hit lists containing differentially expressed genes. To look into transcriptional responses, we constructed networks from these genes. We therefore developed an algorithm, which is capable of dealing with very small numbers of microarrays by clustering the hits based on co-regulatory relationships obtained from the SPELL database. Here, we evaluate this algorithm according to several criteria and further develop its statistical capabilities. Initially, we define how the number of SPELL-derived co-regulated genes and the number of input hits influences the quality of the networks. We then show the ability of our networks to accurately predict further differentially expressed genes. Including these predicted genes into the networks improves the network quality and allows quantifying the predictive strength of the networks based on a newly implemented scoring method. We find that this approach is useful for our own experimental data sets and also for many other data sets which we tested from the SPELL microarray database. Furthermore, the clusters obtained by the described algorithm greatly improve the assignment to biological processes and transcription factors for the individual clusters. Thus, the described clustering approach, which will be available through the ClusterEx web interface, and the evaluation parameters derived from it represent valuable tools for the fast and informative analysis of yeast microarray data.

  14. Network-Guided Key Gene Discovery for a Given Cellular Process

    DEFF Research Database (Denmark)

    He, Feng Q; Ollert, Markus

    2018-01-01

    and the following-up network analysis, opens up new avenues to predict key genes driving a given biological process or cellular function. Here we review and compare the current approaches in predicting key genes, which have no chances to stand out by classic differential expression analysis, from gene......Identification of key genes for a given physiological or pathological process is an essential but still very challenging task for the entire biomedical research community. Statistics-based approaches, such as genome-wide association study (GWAS)- or quantitative trait locus (QTL)-related analysis...... have already made enormous contributions to identifying key genes associated with a given disease or phenotype, the success of which is however very much dependent on a huge number of samples. Recent advances in network biology, especially network inference directly from genome-scale data...

  15. A Multilayer Network Approach for Guiding Drug Repositioning in Neglected Diseases.

    Directory of Open Access Journals (Sweden)

    Ariel José Berenstein

    2016-01-01

    Full Text Available Drug development for neglected diseases has been historically hampered due to lack of market incentives. The advent of public domain resources containing chemical information from high throughput screenings is changing the landscape of drug discovery for these diseases. In this work we took advantage of data from extensively studied organisms like human, mouse, E. coli and yeast, among others, to develop a novel integrative network model to prioritize and identify candidate drug targets in neglected pathogen proteomes, and bioactive drug-like molecules. We modeled genomic (proteins and chemical (bioactive compounds data as a multilayer weighted network graph that takes advantage of bioactivity data across 221 species, chemical similarities between 1.7 105 compounds and several functional relations among 1.67 105 proteins. These relations comprised orthology, sharing of protein domains, and shared participation in defined biochemical pathways. We showcase the application of this network graph to the problem of prioritization of new candidate targets, based on the information available in the graph for known compound-target associations. We validated this strategy by performing a cross validation procedure for known mouse and Trypanosoma cruzi targets and showed that our approach outperforms classic alignment-based approaches. Moreover, our model provides additional flexibility as two different network definitions could be considered, finding in both cases qualitatively different but sensible candidate targets. We also showcase the application of the network to suggest targets for orphan compounds that are active against Plasmodium falciparum in high-throughput screens. In this case our approach provided a reduced prioritization list of target proteins for the query molecules and showed the ability to propose new testable hypotheses for each compound. Moreover, we found that some predictions highlighted by our network model were supported by

  16. A Multilayer Network Approach for Guiding Drug Repositioning in Neglected Diseases.

    Science.gov (United States)

    Berenstein, Ariel José; Magariños, María Paula; Chernomoretz, Ariel; Agüero, Fernán

    2016-01-01

    Drug development for neglected diseases has been historically hampered due to lack of market incentives. The advent of public domain resources containing chemical information from high throughput screenings is changing the landscape of drug discovery for these diseases. In this work we took advantage of data from extensively studied organisms like human, mouse, E. coli and yeast, among others, to develop a novel integrative network model to prioritize and identify candidate drug targets in neglected pathogen proteomes, and bioactive drug-like molecules. We modeled genomic (proteins) and chemical (bioactive compounds) data as a multilayer weighted network graph that takes advantage of bioactivity data across 221 species, chemical similarities between 1.7 105 compounds and several functional relations among 1.67 105 proteins. These relations comprised orthology, sharing of protein domains, and shared participation in defined biochemical pathways. We showcase the application of this network graph to the problem of prioritization of new candidate targets, based on the information available in the graph for known compound-target associations. We validated this strategy by performing a cross validation procedure for known mouse and Trypanosoma cruzi targets and showed that our approach outperforms classic alignment-based approaches. Moreover, our model provides additional flexibility as two different network definitions could be considered, finding in both cases qualitatively different but sensible candidate targets. We also showcase the application of the network to suggest targets for orphan compounds that are active against Plasmodium falciparum in high-throughput screens. In this case our approach provided a reduced prioritization list of target proteins for the query molecules and showed the ability to propose new testable hypotheses for each compound. Moreover, we found that some predictions highlighted by our network model were supported by independent

  17. Network intrusion detector: NID user`s guide V 1.0

    Energy Technology Data Exchange (ETDEWEB)

    Palasek, R. [ed.

    1994-04-01

    The NID suite of software tools was developed to help detect and analyze intrusive behavior over networks. NID combines and uses three techniques of intrusion detection: attack signature recognition, anomaly detection, and a vulnerability risk model. The authors have found from experience that the signature recognition component has been the most effective in detecting network based attacks. The underlying assumption of NID is that there is a security domain that you are interested in protecting. NID monitors traffic that crosses the boundary of that domain, looking for signs of intrusion and abnormal activity.

  18. Phase accumulation tracking algorithm for effective index retrieval of fishnet metamaterials and other resonant guided wave networks

    Science.gov (United States)

    Feigenbaum, Eyal; Hiszpanski, Anna M.

    2017-07-01

    A phase accumulation tracking (PAT) algorithm is proposed and demonstrated for the retrieval of the effective index of fishnet metamaterials (FMMs) in order to avoid the multi-branch uncertainty problem. This algorithm tracks the phase and amplitude of the dominant propagation mode across the FMM slab. The suggested PAT algorithm applies to resonant guided wave networks having only one mode that carries the light between the two slab ends, where the FMM is one example of this metamaterials sub-class. The effective index is a net effect of positive and negative accumulated phase in the alternating FMM metal and dielectric layers, with a negative effective index occurring when negative phase accumulation dominates.

  19. A guide to distribution network operator connection and use of system methodologies and charging

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2006-05-04

    This report aims to help those developing or planning to develop power generation schemes connected to local electricity distribution systems (distributed generation) to understand the various regional network charging schemes in the UK. It is also intended to act as a route map to understand distribution charges as they are currently applied; further changes in charging arrangements between 2005 and 2010 are indicated and signposts to sources of further information are provided. The report explains the structure of distribution networks, the outcome of the regulatory review of distribution pricing undertaken by the Office of Gas and Electricity Markets (Ofgem) applicable from 1 April 2005 and how this affects distribution network operators (DNOs) and their distribution charges. The report considers: the energy policy framework in the UK; the commercial and regulatory framework that applies to distributed generators; DNOs and their regulatory framework; network charging methodologies and principles; charging statements; and areas of likely future changes. Individual schedules and contact details are given in an appendix for each DNO.

  20. MS/MS networking guided analysis of molecule and gene cluster families

    Science.gov (United States)

    Nguyen, Don Duy; Wu, Cheng-Hsuan; Moree, Wilna J.; Lamsa, Anne; Medema, Marnix H.; Zhao, Xiling; Gavilan, Ronnie G.; Aparicio, Marystella; Atencio, Librada; Jackson, Chanaye; Ballesteros, Javier; Sanchez, Joel; Watrous, Jeramie D.; Phelan, Vanessa V.; van de Wiel, Corine; Kersten, Roland D.; Mehnaz, Samina; De Mot, René; Shank, Elizabeth A.; Charusanti, Pep; Nagarajan, Harish; Duggan, Brendan M.; Moore, Bradley S.; Bandeira, Nuno; Palsson, Bernhard Ø.; Pogliano, Kit; Gutiérrez, Marcelino; Dorrestein, Pieter C.

    2013-01-01

    The ability to correlate the production of specialized metabolites to the genetic capacity of the organism that produces such molecules has become an invaluable tool in aiding the discovery of biotechnologically applicable molecules. Here, we accomplish this task by matching molecular families with gene cluster families, making these correlations to 60 microbes at one time instead of connecting one molecule to one organism at a time, such as how it is traditionally done. We can correlate these families through the use of nanospray desorption electrospray ionization MS/MS, an ambient pressure MS technique, in conjunction with MS/MS networking and peptidogenomics. We matched the molecular families of peptide natural products produced by 42 bacilli and 18 pseudomonads through the generation of amino acid sequence tags from MS/MS data of specific clusters found in the MS/MS network. These sequence tags were then linked to biosynthetic gene clusters in publicly accessible genomes, providing us with the ability to link particular molecules with the genes that produced them. As an example of its use, this approach was applied to two unsequenced Pseudoalteromonas species, leading to the discovery of the gene cluster for a molecular family, the bromoalterochromides, in the previously sequenced strain P. piscicida JCM 20779T. The approach itself is not limited to 60 related strains, because spectral networking can be readily adopted to look at molecular family–gene cluster families of hundreds or more diverse organisms in one single MS/MS network. PMID:23798442

  1. Latex particle template lift-up guided gold wire-networks via evaporation lithography

    KAUST Repository

    Lone, Saifullah

    2014-01-01

    We describe a hybrid methodology that combines a two dimensional (2D) monolayer of latex particles (with a pitch size down to 1 μm) prepared by horizontal dry deposition, lift-up of a 2D template onto flat surfaces and evaporation lithography to fabricate metal micro- and nano wire-networks. This journal is

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

  3. Global Warming: Predicting OPEC Carbon Dioxide Emissions from Petroleum Consumption Using Neural Network and Hybrid Cuckoo Search Algorithm.

    Science.gov (United States)

    Chiroma, Haruna; Abdul-kareem, Sameem; Khan, Abdullah; Nawi, Nazri Mohd; Gital, Abdulsalam Ya'u; Shuib, Liyana; Abubakar, Adamu I; Rahman, Muhammad Zubair; Herawan, Tutut

    2015-01-01

    Global warming is attracting attention from policy makers due to its impacts such as floods, extreme weather, increases in temperature by 0.7°C, heat waves, storms, etc. These disasters result in loss of human life and billions of dollars in property. Global warming is believed to be caused by the emissions of greenhouse gases due to human activities including the emissions of carbon dioxide (CO2) from petroleum consumption. Limitations of the previous methods of predicting CO2 emissions and lack of work on the prediction of the Organization of the Petroleum Exporting Countries (OPEC) CO2 emissions from petroleum consumption have motivated this research. The OPEC CO2 emissions data were collected from the Energy Information Administration. Artificial Neural Network (ANN) adaptability and performance motivated its choice for this study. To improve effectiveness of the ANN, the cuckoo search algorithm was hybridised with accelerated particle swarm optimisation for training the ANN to build a model for the prediction of OPEC CO2 emissions. The proposed model predicts OPEC CO2 emissions for 3, 6, 9, 12 and 16 years with an improved accuracy and speed over the state-of-the-art methods. An accurate prediction of OPEC CO2 emissions can serve as a reference point for propagating the reorganisation of economic development in OPEC member countries with the view of reducing CO2 emissions to Kyoto benchmarks--hence, reducing global warming. The policy implications are discussed in the paper.

  4. A novel cooperative localization algorithm using enhanced particle filter technique in maritime search and rescue wireless sensor network.

    Science.gov (United States)

    Wu, Huafeng; Mei, Xiaojun; Chen, Xinqiang; Li, Junjun; Wang, Jun; Mohapatra, Prasant

    2017-09-29

    Maritime search and rescue (MSR) play a significant role in Safety of Life at Sea (SOLAS). However, it suffers from scenarios that the measurement information is inaccurate due to wave shadow effect when utilizing wireless Sensor Network (WSN) technology in MSR. In this paper, we develop a Novel Cooperative Localization Algorithm (NCLA) in MSR by using an enhanced particle filter method to reduce measurement errors on observation model caused by wave shadow effect. First, we take into account the mobility of nodes at sea to develop a motion model-Lagrangian model. Furthermore, we introduce both state model and observation model to constitute a system model for particle filter (PF). To address the impact of the wave shadow effect on the observation model, we develop an optimal parameter derived by Kullback-Leibler divergence (KLD) to mitigate the error. After the optimal parameter is acquired, an improved likelihood function is presented. Finally, the estimated position is acquired. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  5. Global Warming: Predicting OPEC Carbon Dioxide Emissions from Petroleum Consumption Using Neural Network and Hybrid Cuckoo Search Algorithm.

    Directory of Open Access Journals (Sweden)

    Haruna Chiroma

    Full Text Available Global warming is attracting attention from policy makers due to its impacts such as floods, extreme weather, increases in temperature by 0.7°C, heat waves, storms, etc. These disasters result in loss of human life and billions of dollars in property. Global warming is believed to be caused by the emissions of greenhouse gases due to human activities including the emissions of carbon dioxide (CO2 from petroleum consumption. Limitations of the previous methods of predicting CO2 emissions and lack of work on the prediction of the Organization of the Petroleum Exporting Countries (OPEC CO2 emissions from petroleum consumption have motivated this research.The OPEC CO2 emissions data were collected from the Energy Information Administration. Artificial Neural Network (ANN adaptability and performance motivated its choice for this study. To improve effectiveness of the ANN, the cuckoo search algorithm was hybridised with accelerated particle swarm optimisation for training the ANN to build a model for the prediction of OPEC CO2 emissions. The proposed model predicts OPEC CO2 emissions for 3, 6, 9, 12 and 16 years with an improved accuracy and speed over the state-of-the-art methods.An accurate prediction of OPEC CO2 emissions can serve as a reference point for propagating the reorganisation of economic development in OPEC member countries with the view of reducing CO2 emissions to Kyoto benchmarks--hence, reducing global warming. The policy implications are discussed in the paper.

  6. Global Warming: Predicting OPEC Carbon Dioxide Emissions from Petroleum Consumption Using Neural Network and Hybrid Cuckoo Search Algorithm

    Science.gov (United States)

    Chiroma, Haruna; Abdul-kareem, Sameem; Khan, Abdullah; Nawi, Nazri Mohd.; Gital, Abdulsalam Ya’u; Shuib, Liyana; Abubakar, Adamu I.; Rahman, Muhammad Zubair; Herawan, Tutut

    2015-01-01

    Background Global warming is attracting attention from policy makers due to its impacts such as floods, extreme weather, increases in temperature by 0.7°C, heat waves, storms, etc. These disasters result in loss of human life and billions of dollars in property. Global warming is believed to be caused by the emissions of greenhouse gases due to human activities including the emissions of carbon dioxide (CO2) from petroleum consumption. Limitations of the previous methods of predicting CO2 emissions and lack of work on the prediction of the Organization of the Petroleum Exporting Countries (OPEC) CO2 emissions from petroleum consumption have motivated this research. Methods/Findings The OPEC CO2 emissions data were collected from the Energy Information Administration. Artificial Neural Network (ANN) adaptability and performance motivated its choice for this study. To improve effectiveness of the ANN, the cuckoo search algorithm was hybridised with accelerated particle swarm optimisation for training the ANN to build a model for the prediction of OPEC CO2 emissions. The proposed model predicts OPEC CO2 emissions for 3, 6, 9, 12 and 16 years with an improved accuracy and speed over the state-of-the-art methods. Conclusion An accurate prediction of OPEC CO2 emissions can serve as a reference point for propagating the reorganisation of economic development in OPEC member countries with the view of reducing CO2 emissions to Kyoto benchmarks—hence, reducing global warming. The policy implications are discussed in the paper. PMID:26305483

  7. Distinct neural networks for target feature versus dimension changes in visual search, as revealed by EEG and fMRI.

    Science.gov (United States)

    Becker, Stefanie I; Grubert, Anna; Dux, Paul E

    2014-11-15

    In visual search, responses are slowed, from one trial to the next, both when the target dimension changes (e.g., from a color target to a size target) and when the target feature changes (e.g., from a red target to a green target) relative to being repeated across trials. The present study examined whether such feature and dimension switch costs can be attributed to the same underlying mechanism(s). Contrary to this contention, an EEG study showed that feature changes influenced visual selection of the target (i.e., delayed N2pc onset), whereas dimension changes influenced the later process of response selection (i.e., delayed s-LRP onset). An fMRI study provided convergent evidence for the two-system view: Compared with repetitions, feature changes led to increased activation in the occipital cortex, and superior and inferior parietal lobules, which have been implicated in spatial attention. By contrast, dimension changes led to activation of a fronto-posterior network that is primarily linked with response selection (i.e., pre-motor cortex, supplementary motor area and frontal areas). Taken together, the results suggest that feature and dimension switch costs are based on different processes. Specifically, whereas target feature changes delay attention shifts to the target, target dimension changes interfere with later response selection operations. Crown Copyright © 2014. Published by Elsevier Inc. All rights reserved.

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

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

  10. Distant from input: Evidence of regions within the default mode network supporting perceptually-decoupled and conceptually-guided cognition.

    Science.gov (United States)

    Murphy, Charlotte; Jefferies, Elizabeth; Rueschemeyer, Shirley-Ann; Sormaz, Mladen; Wang, Hao-Ting; Margulies, Daniel S; Smallwood, Jonathan

    2018-05-01

    The default mode network supports a variety of mental operations such as semantic processing, episodic memory retrieval, mental time travel and mind-wandering, yet the commonalities between these functions remains unclear. One possibility is that this system supports cognition that is independent of the immediate environment; alternatively or additionally, it might support higher-order conceptual representations that draw together multiple features. We tested these accounts using a novel paradigm that separately manipulated the availability of perceptual information to guide decision-making and the representational complexity of this information. Using task based imaging we established regions that respond when cognition combines both stimulus independence with multi-modal information. These included left and right angular gyri and the left middle temporal gyrus. Although these sites were within the default mode network, they showed a stronger response to demanding memory judgements than to an easier perceptual task, contrary to the view that they support automatic aspects of cognition. In a subsequent analysis, we showed that these regions were located at the extreme end of a macroscale gradient, which describes gradual transitions from sensorimotor to transmodal cortex. This shift in the focus of neural activity towards transmodal, default mode, regions might reflect a process of where the functional distance from specific sensory enables conceptually rich and detailed cognitive states to be generated in the absence of input. Copyright © 2018 The Authors. Published by Elsevier Inc. All rights reserved.

  11. How social network analysis can be used to monitor online collaborative learning and guide an informed intervention.

    Science.gov (United States)

    Saqr, Mohammed; Fors, Uno; Tedre, Matti; Nouri, Jalal

    2018-01-01

    To ensure online collaborative learning meets the intended pedagogical goals (is actually collaborative and stimulates learning), mechanisms are needed for monitoring the efficiency of online collaboration. Various studies have indicated that social network analysis can be particularly effective in studying students' interactions in online collaboration. However, research in education has only focused on the theoretical potential of using SNA, not on the actual benefits they achieved. This study investigated how social network analysis can be used to monitor online collaborative learning, find aspects in need of improvement, guide an informed intervention, and assess the efficacy of intervention using an experimental, observational repeated-measurement design in three courses over a full-term duration. Using a combination of SNA-based visual and quantitative analysis, we monitored three SNA constructs for each participant: the level of interactivity, the role, and position in information exchange, and the role played by each participant in the collaboration. On the group level, we monitored interactivity and group cohesion indicators. Our monitoring uncovered a non-collaborative teacher-centered pattern of interactions in the three studied courses as well as very few interactions among students, limited information exchange or negotiation, and very limited student networks dominated by the teacher. An intervention based on SNA-generated insights was designed. The intervention was structured into five actions: increasing awareness, promoting collaboration, improving the content, preparing teachers, and finally practicing with feedback. Evaluation of the intervention revealed that it has significantly enhanced student-student interactions and teacher-student interactions, as well as produced a collaborative pattern of interactions among most students and teachers. Since efficient and communicative activities are essential prerequisites for successful content

  12. Developing a culturally competent health network: a planning framework and guide.

    Science.gov (United States)

    Gertner, Eric J; Sabino, Judith N; Mahady, Erica; Deitrich, Lynn M; Patton, Jarret R; Grim, Mary Kay; Geiger, James F; Salas-Lopez, Debbie

    2010-01-01

    The number of cultural competency initiatives in healthcare is increasing due to many factors, including changing demographics, quality improvement and regulatory requirements, equitable care missions, and accreditation standards. To facilitate organization-wide transformation, a hospital or healthcare system must establish strategic goals, objectives, and implementation tasks for culturally competent provision of care. This article reports the largely successful results of a cultural competency program instituted at a large system in eastern Pennsylvania. Prior to the development of its cultural competency initiative, Lehigh Valley Health Network, Allentown, Pennsylvania, saw isolated activities producing innovative solutions to diversity and culture issues in the provision of equitable care. But it took a transformational event to support an organization-wide program in cultural competency by strengthening leadership buy-in and providing a sense of urgency, excitement, and shared vision among multiple stakeholders. A multidisciplinary task force, including senior leaders and a diverse group of employees, was created with the authority and responsibility to enact changes. Through a well-organized strategic planning process, existing patient and community demographic data were reviewed to describe existing disparities, a baseline assessment was completed, a mission statement was created, and clear metrics were developed. The strategic plan, which focused on five key areas (demographics, language-appropriate services, employees, training, and education/communication), was approved by the network's chief executive officer and senior managers to demonstrate commitment prior to implementation. Strategic plan implementation proceeded through a project structure consisting of subproject teams charged with achieving the following specific objectives: develop a cultural material repository, enhance employee recruitment/retention, establish a baseline assessment

  13. The Earth Science Women's Network: The Principles That Guide Our Mentoring

    Science.gov (United States)

    Adams, M. S.; Steiner, A. L.; Wiedinmyer, C.

    2015-12-01

    The Earth Science Women's Network (ESWN) began informally in 2002 as a way for six early career female atmospheric chemists to stay in contact and support each other. Twelve years later (2014), the ESWN formally became a non-profit organization with over 2000 members. The ESWN includes scientists from all disciplines of the geosciences with members located in over 50 countries. The ESWN is dedicated to career development, peer mentoring and community building for women in the geosciences. The mentoring philosophy of ESWN has evolved to include five main principles: 1.) Support community-driven mentoring, 2.) Encourage diverse mentoring approaches for diverse individuals, 3.) Facilitate mentoring across career phases, 4.) Promote combined personal and professional mentoring, 5.) Champion effective mentoring in a safe space. Surveys of ESWN members report gains in areas that are often considered barriers to career advancement, including recognition that they are not alone, new understanding of obstacles faced by women in science, and access to professional resources.

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

  15. Metabolic network model guided engineering ethylmalonyl-CoA pathway to improve ascomycin production in Streptomyces hygroscopicus var. ascomyceticus.

    Science.gov (United States)

    Wang, Junhua; Wang, Cheng; Song, Kejing; Wen, Jianping

    2017-10-03

    Ascomycin is a 23-membered polyketide macrolide with high immunosuppressant and antifungal activity. As the lower production in bio-fermentation, global metabolic analysis is required to further explore its biosynthetic network and determine the key limiting steps for rationally engineering. To achieve this goal, an engineering approach guided by a metabolic network model was implemented to better understand ascomycin biosynthesis and improve its production. The metabolic conservation of Streptomyces species was first investigated by comparing the metabolic enzymes of Streptomyces coelicolor A3(2) with those of 31 Streptomyces strains, the results showed that more than 72% of the examined proteins had high sequence similarity with counterparts in every surveyed strain. And it was found that metabolic reactions are more highly conserved than the enzymes themselves because of its lower diversity of metabolic functions than that of genes. The main source of the observed metabolic differences was from the diversity of secondary metabolism. According to the high conservation of primary metabolic reactions in Streptomyces species, the metabolic network model of Streptomyces hygroscopicus var. ascomyceticus was constructed based on the latest reported metabolic model of S. coelicolor A3(2) and validated experimentally. By coupling with flux balance analysis and using minimization of metabolic adjustment algorithm, potential targets for ascomycin overproduction were predicted. Since several of the preferred targets were highly associated with ethylmalonyl-CoA biosynthesis, two target genes hcd (encoding 3-hydroxybutyryl-CoA dehydrogenase) and ccr (encoding crotonyl-CoA carboxylase/reductase) were selected for overexpression in S. hygroscopicus var. ascomyceticus FS35. Both the mutants HA-Hcd and HA-Ccr showed higher ascomycin titer, which was consistent with the model predictions. Furthermore, the combined effects of the two genes were evaluated and the strain HA

  16. Rational drug repositioning guided by an integrated pharmacological network of protein, disease and drug

    Directory of Open Access Journals (Sweden)

    Lee Hee

    2012-07-01

    Full Text Available Abstract Background The process of drug discovery and development is time-consuming and costly, and the probability of success is low. Therefore, there is rising interest in repositioning existing drugs for new medical indications. When successful, this process reduces the risk of failure and costs associated with de novo drug development. However, in many cases, new indications of existing drugs have been found serendipitously. Thus there is a clear need for establishment of rational methods for drug repositioning. Results In this study, we have established a database we call “PharmDB” which integrates data associated with disease indications, drug development, and associated proteins, and known interactions extracted from various established databases. To explore linkages of known drugs to diseases of interest from within PharmDB, we designed the Shared Neighborhood Scoring (SNS algorithm. And to facilitate exploration of tripartite (Drug-Protein-Disease network, we developed a graphical data visualization software program called phExplorer, which allows us to browse PharmDB data in an interactive and dynamic manner. We validated this knowledge-based tool kit, by identifying a potential application of a hypertension drug, benzthiazide (TBZT, to induce lung cancer cell death. Conclusions By combining PharmDB, an integrated tripartite database, with Shared Neighborhood Scoring (SNS algorithm, we developed a knowledge platform to rationally identify new indications for known FDA approved drugs, which can be customized to specific projects using manual curation. The data in PharmDB is open access and can be easily explored with phExplorer and accessed via BioMart web service (http://www.i-pharm.org/, http://biomart.i-pharm.org/.

  17. Rational drug repositioning guided by an integrated pharmacological network of protein, disease and drug.

    Science.gov (United States)

    Lee, Hee Sook; Bae, Taejeong; Lee, Ji-Hyun; Kim, Dae Gyu; Oh, Young Sun; Jang, Yeongjun; Kim, Ji-Tea; Lee, Jong-Jun; Innocenti, Alessio; Supuran, Claudiu T; Chen, Luonan; Rho, Kyoohyoung; Kim, Sunghoon

    2012-07-02

    The process of drug discovery and development is time-consuming and costly, and the probability of success is low. Therefore, there is rising interest in repositioning existing drugs for new medical indications. When successful, this process reduces the risk of failure and costs associated with de novo drug development. However, in many cases, new indications of existing drugs have been found serendipitously. Thus there is a clear need for establishment of rational methods for drug repositioning. In this study, we have established a database we call "PharmDB" which integrates data associated with disease indications, drug development, and associated proteins, and known interactions extracted from various established databases. To explore linkages of known drugs to diseases of interest from within PharmDB, we designed the Shared Neighborhood Scoring (SNS) algorithm. And to facilitate exploration of tripartite (Drug-Protein-Disease) network, we developed a graphical data visualization software program called phExplorer, which allows us to browse PharmDB data in an interactive and dynamic manner. We validated this knowledge-based tool kit, by identifying a potential application of a hypertension drug, benzthiazide (TBZT), to induce lung cancer cell death. By combining PharmDB, an integrated tripartite database, with Shared Neighborhood Scoring (SNS) algorithm, we developed a knowledge platform to rationally identify new indications for known FDA approved drugs, which can be customized to specific projects using manual curation. The data in PharmDB is open access and can be easily explored with phExplorer and accessed via BioMart web service (http://www.i-pharm.org/, http://biomart.i-pharm.org/).

  18. Intersection Recognition and Guide-Path Selection for a Vision-Based AGV in a Bidirectional Flow Network

    Directory of Open Access Journals (Sweden)

    Wu Xing

    2014-03-01

    Full Text Available Vision recognition and RFID perception are used to develop a smart AGV travelling on fixed paths while retaining low-cost, simplicity and reliability. Visible landmarks can describe features of shapes and geometric dimensions of lines and intersections, and RFID tags can directly record global locations on pathways and the local topological relations of crossroads. A topological map is convenient for building and editing without the need for accurate poses when establishing a priori knowledge of a workplace. To obtain the flexibility of bidirectional movement along guide-paths, a camera placed in the centre of the AGV looks downward vertically at landmarks on the floor. A small visual field presents many difficulties for vision guidance, especially for real-time, correct and reliable recognition of multi-branch crossroads. First, the region projection and contour scanning methods are both used to extract the features of shapes. Then LDA is used to reduce the number of the features' dimensions. Third, a hierarchical SVM classifier is proposed to classify their multi-branch patterns once the features of the shapes are complete. Our experiments in landmark recognition and navigation show that low-cost vision systems are insusceptible to visual noises, image breakages and floor changes, and a vision-based AGV can locate itself precisely on its paths, recognize different crossroads intelligently by verifying the conformance of vision and RFID information, and select its next pathway efficiently in a bidirectional flow network.

  19. Knowledge-guided golf course detection using a convolutional neural network fine-tuned on temporally augmented data

    Science.gov (United States)

    Chen, Jingbo; Wang, Chengyi; Yue, Anzhi; Chen, Jiansheng; He, Dongxu; Zhang, Xiuyan

    2017-10-01

    The tremendous success of deep learning models such as convolutional neural networks (CNNs) in computer vision provides a method for similar problems in the field of remote sensing. Although research on repurposing pretrained CNN to remote sensing tasks is emerging, the scarcity of labeled samples and the complexity of remote sensing imagery still pose challenges. We developed a knowledge-guided golf course detection approach using a CNN fine-tuned on temporally augmented data. The proposed approach is a combination of knowledge-driven region proposal, data-driven detection based on CNN, and knowledge-driven postprocessing. To confront data complexity, knowledge-derived cooccurrence, composition, and area-based rules are applied sequentially to propose candidate golf regions. To confront sample scarcity, we employed data augmentation in the temporal domain, which extracts samples from multitemporal images. The augmented samples were then used to fine-tune a pretrained CNN for golf detection. Finally, commission error was further suppressed by postprocessing. Experiments conducted on GF-1 imagery prove the effectiveness of the proposed approach.

  20. How social network analysis can be used to monitor online collaborative learning and guide an informed intervention

    Science.gov (United States)

    Fors, Uno; Tedre, Matti; Nouri, Jalal

    2018-01-01

    To ensure online collaborative learning meets the intended pedagogical goals (is actually collaborative and stimulates learning), mechanisms are needed for monitoring the efficiency of online collaboration. Various studies have indicated that social network analysis can be particularly effective in studying students’ interactions in online collaboration. However, research in education has only focused on the theoretical potential of using SNA, not on the actual benefits they achieved. This study investigated how social network analysis can be used to monitor online collaborative learning, find aspects in need of improvement, guide an informed intervention, and assess the efficacy of intervention using an experimental, observational repeated-measurement design in three courses over a full-term duration. Using a combination of SNA-based visual and quantitative analysis, we monitored three SNA constructs for each participant: the level of interactivity, the role, and position in information exchange, and the role played by each participant in the collaboration. On the group level, we monitored interactivity and group cohesion indicators. Our monitoring uncovered a non-collaborative teacher-centered pattern of interactions in the three studied courses as well as very few interactions among students, limited information exchange or negotiation, and very limited student networks dominated by the teacher. An intervention based on SNA-generated insights was designed. The intervention was structured into five actions: increasing awareness, promoting collaboration, improving the content, preparing teachers, and finally practicing with feedback. Evaluation of the intervention revealed that it has significantly enhanced student-student interactions and teacher-student interactions, as well as produced a collaborative pattern of interactions among most students and teachers. Since efficient and communicative activities are essential prerequisites for successful content

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

  2. A user equilibrium, traffic assignment model of network route and parking lot choice, with search circuits and cruising flows

    OpenAIRE

    LEURENT, Fabien; BOUJNAH, Houda

    2014-01-01

    The paper provides a novel network model of parking and route choice. Parking supply is represented by parking type, management strategy including the fare, capacity and occupancy rate of parking lot, and network location, in relation to access routes along the roadway network. Trip demand is segmented according to origin-destination pair, the disposal of private parking facilities and the individual preferences for parking quality of service. Each traveller is assumed to make a two stage cho...

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

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

  5. Probabilistic atlases of default mode, executive control and salience network white matter tracts: an fMRI-guided diffusion tensor imaging and tractography study.

    Science.gov (United States)

    Figley, Teresa D; Bhullar, Navdeep; Courtney, Susan M; Figley, Chase R

    2015-01-01

    Diffusion tensor imaging (DTI) is a powerful MRI technique that can be used to estimate both the microstructural integrity and the trajectories of white matter pathways throughout the central nervous system. This fiber tracking (aka, "tractography") approach is often carried out using anatomically-defined seed points to identify white matter tracts that pass through one or more structures, but can also be performed using functionally-defined regions of interest (ROIs) that have been determined using functional MRI (fMRI) or other methods. In this study, we performed fMRI-guided DTI tractography between all of the previously defined nodes within each of six common resting-state brain networks, including the: dorsal Default Mode Network (dDMN), ventral Default Mode Network (vDMN), left Executive Control Network (lECN), right Executive Control Network (rECN), anterior Salience Network (aSN), and posterior Salience Network (pSN). By normalizing the data from 32 healthy control subjects to a standard template-using high-dimensional, non-linear warping methods-we were able to create probabilistic white matter atlases for each tract in stereotaxic coordinates. By investigating all 198 ROI-to-ROI combinations within the aforementioned resting-state networks (for a total of 6336 independent DTI tractography analyses), the resulting probabilistic atlases represent a comprehensive cohort of functionally-defined white matter regions that can be used in future brain imaging studies to: (1) ascribe DTI or other white matter changes to particular functional brain networks, and (2) compliment resting state fMRI or other functional connectivity analyses.

  6. Academic Game Changers: A Study of the Social Networking Strategies of Leaders Guiding Disruptive Innovations in Higher Education

    Science.gov (United States)

    Langteau, Paula T.

    2017-01-01

    This study examines the internal and external networking strategies of leaders furthering potentially disruptive innovations in higher education. The goal of the research was to understand specifically what types of networks they develop, activate, and leverage; the functions of those networks; and the ways they engage them to further their…

  7. The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.

    Science.gov (United States)

    Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

    2013-01-01

    Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

  8. The index-based subgraph matching algorithm (ISMA: fast subgraph enumeration in large networks using optimized search trees.

    Directory of Open Access Journals (Sweden)

    Sofie Demeyer

    Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

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

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

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

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

  12. Factors Affecting Customers Online Search Intention and Online Purchase Intention Using Social Networks: Case Study of Online Shop on Instagram

    OpenAIRE

    Putri, Jessica Wongso

    2015-01-01

    As the internet USAge in Indonesia keep growing rapidly, it creates big opportunities for apparel online shops owner to market their products through many popular online media, especially Instagram. However, many online shop owners have no clue how to market their apparel product effectively via Instagram. Therefore, this research created to analyze the factors that can influence the customers' purchase intention. Those factors are Utilitarian Value of Internet Information Search, Hedonic Va...

  13. The European VLF/LF radio network to search for earthquake precursors: setting up and natural/man-made disturbances

    Directory of Open Access Journals (Sweden)

    P. F. Biagi

    2011-02-01

    Full Text Available In the last years disturbances in VLF/LF radio signals related to seismic activity have been presented. The radio data were collected by receivers located on the ground or on satellites. The ground-based research implies systematic data collection by a network of receivers. Since 2000 the "Pacific VLF network", conducted by Japanese researchers, has been in operation. During 2008 a radio receiver was developed by the Italian factory Elettronika (Palo del Colle, Bari. The receiver is equipment working in VLF and LF bands. It can monitor 10 frequencies distributed in these bands and, for each of them, it saves the power level. At the beginning of 2009, five receivers were made for the realization of the "European VLF/LF Network"; two were planned for Italy and one for Greece, Turkey and Romania, respectively. In 2010 the network was enlarged to include a new receiver installed in Portugal. In this work, first the receiver and its setting up in the different places are described. Then, several disturbances in the radio signals related to the transmitters, receivers, meteorological/geomagnetic conditions are presented and described.

  14. Asset sustainability index : quick guide : proposed metrics for the long-term financial sustainability of highway networks.

    Science.gov (United States)

    2013-04-01

    "This report provides a Quick Guide to the concept of asset sustainability metrics. Such metrics address the long-term performance of highway assets based upon expected expenditure levels. : It examines how such metrics are used in Australia, Britain...

  15. Network-guided analysis of genes with altered somatic copy number and gene expression reveals pathways commonly perturbed in metastatic melanoma.

    Directory of Open Access Journals (Sweden)

    Armand Valsesia

    2011-04-01

    Full Text Available Cancer genomes frequently contain somatic copy number alterations (SCNA that can significantly perturb the expression level of affected genes and thus disrupt pathways controlling normal growth. In melanoma, many studies have focussed on the copy number and gene expression levels of the BRAF, PTEN and MITF genes, but little has been done to identify new genes using these parameters at the genome-wide scale. Using karyotyping, SNP and CGH arrays, and RNA-seq, we have identified SCNA affecting gene expression ('SCNA-genes' in seven human metastatic melanoma cell lines. We showed that the combination of these techniques is useful to identify candidate genes potentially involved in tumorigenesis. Since few of these alterations were recurrent across our samples, we used a protein network-guided approach to determine whether any pathways were enriched in SCNA-genes in one or more samples. From this unbiased genome-wide analysis, we identified 28 significantly enriched pathway modules. Comparison with two large, independent melanoma SCNA datasets showed less than 10% overlap at the individual gene level, but network-guided analysis revealed 66% shared pathways, including all but three of the pathways identified in our data. Frequently altered pathways included WNT, cadherin signalling, angiogenesis and melanogenesis. Additionally, our results emphasize the potential of the EPHA3 and FRS2 gene products, involved in angiogenesis and migration, as possible therapeutic targets in melanoma. Our study demonstrates the utility of network-guided approaches, for both large and small datasets, to identify pathways recurrently perturbed in cancer.

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

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

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

  19. Using social network analysis and agent-based modelling to explore information flow using common operational pictures for maritime search and rescue operations.

    Science.gov (United States)

    Baber, C; Stanton, N A; Atkinson, J; McMaster, R; Houghton, R J

    2013-01-01

    The concept of common operational pictures (COPs) is explored through the application of social network analysis (SNA) and agent-based modelling to a generic search and rescue (SAR) scenario. Comparing the command structure that might arise from standard operating procedures with the sort of structure that might arise from examining information-in-common, using SNA, shows how one structure could be more amenable to 'command' with the other being more amenable to 'control' - which is potentially more suited to complex multi-agency operations. An agent-based model is developed to examine the impact of information sharing with different forms of COPs. It is shown that networks using common relevant operational pictures (which provide subsets of relevant information to groups of agents based on shared function) could result in better sharing of information and a more resilient structure than networks that use a COP. SNA and agent-based modelling are used to compare different forms of COPs for maritime SAR operations. Different forms of COP change the communications structures in the socio-technical systems in which they operate, which has implications for future design and development of a COP.

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

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

  2. Kid's Guide to Fever

    Science.gov (United States)

    ... Educators Search English Español A Kid's Guide to Fever KidsHealth / For Kids / A Kid's Guide to Fever ... change into some lighter-weight pajamas. Fighting a Fever For almost all kids, fevers aren't a ...

  3. A Multi Time Scale Wind Power Forecasting Model of a Chaotic Echo State Network Based on a Hybrid Algorithm of Particle Swarm Optimization and Tabu Search

    Directory of Open Access Journals (Sweden)

    Xiaomin Xu

    2015-11-01

    Full Text Available The uncertainty and regularity of wind power generation are caused by wind resources’ intermittent and randomness. Such volatility brings severe challenges to the wind power grid. The requirements for ultrashort-term and short-term wind power forecasting with high prediction accuracy of the model used, have great significance for reducing the phenomenon of abandoned wind power , optimizing the conventional power generation plan, adjusting the maintenance schedule and developing real-time monitoring systems. Therefore, accurate forecasting of wind power generation is important in electric load forecasting. The echo state network (ESN is a new recurrent neural network composed of input, hidden layer and output layers. It can approximate well the nonlinear system and achieves great results in nonlinear chaotic time series forecasting. Besides, the ESN is simpler and less computationally demanding than the traditional neural network training, which provides more accurate training results. Aiming at addressing the disadvantages of standard ESN, this paper has made some improvements. Combined with the complementary advantages of particle swarm optimization and tabu search, the generalization of ESN is improved. To verify the validity and applicability of this method, case studies of multitime scale forecasting of wind power output are carried out to reconstruct the chaotic time series of the actual wind power generation data in a certain region to predict wind power generation. Meanwhile, the influence of seasonal factors on wind power is taken into consideration. Compared with the classical ESN and the conventional Back Propagation (BP neural network, the results verify the superiority of the proposed method.

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

  5. The search for underlying principles of health impact assessment: progress and prospects: Comment on "Investigating underlying principles to guide health impact assessment".

    Science.gov (United States)

    Winkler, Mirko S; Utzinger, Jürg

    2014-07-01

    Health Impact Assessment (HIA) is a relatively young field of endeavour, and hence, future progress will depend on the planning, implementation and rigorous evaluation of additional HIAs of projects, programmes and policies the world over. In the June 2014 issue of the International Journal of Health Policy and Management, Fakhri and colleagues investigated underlying principles of HIA through a comprehensive review of the literature and expert consultation. With an emphasis on the Islamic Republic of Iran, the authors identified multiple issues that are relevant for guiding HIA practice. At the same time, the study unravelled current shortcomings in the understanding and definition of HIA principles and best practice at national, regional, and global levels. In this commentary we scrutinise the research presented, highlight strengths and limitations, and discuss the findings in the context of other recent attempts to guide HIA.

  6. The Search for Underlying Principles of Health Impact Assessment: Progress and Prospects; Comment on “Investigating Underlying Principles to Guide Health Impact Assessment”

    Directory of Open Access Journals (Sweden)

    Mirko S. Winkler

    2014-07-01

    Full Text Available Health Impact Assessment (HIA is a relatively young field of endeavour, and hence, future progress will depend on the planning, implementation and rigorous evaluation of additional HIAs of projects, programmes and policies the world over. In the June 2014 issue of the International Journal of Health Policy and Management, Fakhri and colleagues investigated underlying principles of HIA through a comprehensive review of the literature and expert consultation. With an emphasis on the Islamic Republic of Iran, the authors identified multiple issues that are relevant for guiding HIA practice. At the same time, the study unravelled current shortcomings in the understanding and definition of HIA principles and best practice at national, regional, and global levels. In this commentary we scrutinise the research presented, highlight strengths and limitations, and discuss the findings in the context of other recent attempts to guide HIA.

  7. Search Help

    Science.gov (United States)

    Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

  8. Efficient Extraction of Drainage Networks from Massive, Radar-Based Elevation Models with Least Cost Path Search

    Science.gov (United States)

    2011-02-25

    modifications to a minimum. To evaluate the impact of resampling on stream extraction accuracy (see e.g. Valeriano et al., 2006) and to generate data for...from 90 m SRTM (Hancock et al., 2006; Valeriano et al., 2006). When comparing SRTM and IFSARE DEMs at the same resolution of 30 m, the drainage networks...relatively flat areas. As shown in previ- ous studies (Hancock et al., 2006; Valeriano et al., 2006), the SRTM DEM close to its native resolution of 3 arc

  9. Search on Rugged Landscapes

    DEFF Research Database (Denmark)

    Billinger, Stephan; Stieglitz, Nils; Schumacher, Terry

    2014-01-01

    This paper presents findings from a laboratory experiment on human decision-making in a complex combinatorial task. We find strong evidence for a behavioral model of adaptive search. Success narrows down search to the neighborhood of the status quo, while failure promotes gradually more explorative...... search. Task complexity does not have a direct effect on behavior, but systematically affects the feedback conditions that guide success-induced exploitation and failure-induced exploration. The analysis also shows that human participants were prone to over-exploration, since they broke off the search...... for local improvements too early. We derive stylized decision rules that generate the search behavior observed in the experiment and discuss the implications of our findings for individual decision-making and organizational search....

  10. Feed-Forward Neural Network Soft-Sensor Modeling of Flotation Process Based on Particle Swarm Optimization and Gravitational Search Algorithm

    Directory of Open Access Journals (Sweden)

    Jie-Sheng Wang

    2015-01-01

    Full Text Available For predicting the key technology indicators (concentrate grade and tailings recovery rate of flotation process, a feed-forward neural network (FNN based soft-sensor model optimized by the hybrid algorithm combining particle swarm optimization (PSO algorithm and gravitational search algorithm (GSA is proposed. Although GSA has better optimization capability, it has slow convergence velocity and is easy to fall into local optimum. So in this paper, the velocity vector and position vector of GSA are adjusted by PSO algorithm in order to improve its convergence speed and prediction accuracy. Finally, the proposed hybrid algorithm is adopted to optimize the parameters of FNN soft-sensor model. Simulation results show that the model has better generalization and prediction accuracy for the concentrate grade and tailings recovery rate to meet the online soft-sensor requirements of the real-time control in the flotation process.

  11. Searching of fuel recharges by means of genetic algorithms and neural networks in BWRs; Busqueda de recargas de combustible mediante algoritmos geneticos y redes neuronales en BWRs

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz S, J.J.; Montes T, J.L.; Castillo M, J.A.; Perusquia del C, R. [ININ, Carretera Mexico-Toluca Km. 36.5, 52045 Estado de Mexico (Mexico)

    2004-07-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)

  12. A neural-network based estimator to search for primordial non-Gaussianity in Planck CMB maps

    Energy Technology Data Exchange (ETDEWEB)

    Novaes, C.P.; Bernui, A. [Observatório Nacional, Rua General José Cristino 77, São Cristóvão, 20921-400, Rio de Janeiro, RJ (Brazil); Ferreira, I.S. [Instituto de Física, Universidade de Brasília, Campus Universitário Darcy Ribeiro, Asa Norte, 70919-970, Brasília, DF (Brazil); Wuensche, C.A., E-mail: camilapnovaes@gmail.com, E-mail: bernui@on.br, E-mail: ivan@fis.unb.br, E-mail: ca.wuensche@inpe.br [Divisão de Astrofísica, Instituto Nacional de Pesquisas Espaciais, Av. dos Astronautas 1758, São José dos Campos, 12227-010, SP (Brazil)

    2015-09-01

    We present an upgraded combined estimator, based on Minkowski Functionals and Neural Networks, with excellent performance in detecting primordial non-Gaussianity in simulated maps that also contain a weighted mixture of Galactic contaminations, besides real pixel's noise from Planck cosmic microwave background radiation data. We rigorously test the efficiency of our estimator considering several plausible scenarios for residual non-Gaussianities in the foreground-cleaned Planck maps, with the intuition to optimize the training procedure of the Neural Network to discriminate between contaminations with primordial and secondary non-Gaussian signatures. We look for constraints of primordial local non-Gaussianity at large angular scales in the foreground-cleaned Planck maps. For the SMICA map we found f{sub NL} = 33 ± 23, at 1σ confidence level, in excellent agreement with the WMAP-9yr and Planck results. In addition, for the other three Planck maps we obtain similar constraints with values in the interval f{sub NL}  element of  [33, 41], concomitant with the fact that these maps manifest distinct features in reported analyses, like having different pixel's noise intensities.

  13. Alcatel-Lucent Network Routing Specialist II (NRS II) Self-Study Guide Preparing for the NRS II Certification Exams

    CERN Document Server

    Warnock, Glenn

    2011-01-01

    The definitive resource for the NRS II exams—three complete courses in a book Alcatel-Lucent is a world leader in designing and developing scalable systems for service providers. If you are a network designer or operator who uses Alcatel-Lucent's 7750 family of service routers, prepare for certification as an A-L network routing specialist with this complete self-study course. You'll get thorough preparation for the NRS II exams while you learn to build state-of-the-art, scalable IP/MPLS-based service networks. The book provides you with an in-depth understanding of the protocols and tec

  14. Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

    Science.gov (United States)

    Cocco, Alex P.; Nakajo, Arata; Chiu, Wilson K. S.

    2017-12-01

    We present a fully analytical, heuristic model - the "Analytical Transport Network Model" - for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a microstructural network's topology and the morphology of its channels to an effective material transport coefficient (a general term meant to encompass, e.g., conductivity or diffusion coefficient). The model's transport coefficient predictions agree well with those from electrochemical fin (ECF) theory and finite element analysis (FEA), but are computed 0.5-1.5 and 5-6 orders of magnitude faster, respectively. In addition, the theory explicitly relates a number of morphological and topological parameters directly to the transport coefficient, whereby the distributions that characterize the structure are readily available for further analysis. Furthermore, ATN's explicit development provides insight into the nature of the tortuosity factor and offers the potential to apply theory from network science and to consider the optimization of a network's effective resistance in a mathematically rigorous manner. The ATN model's speed and relative ease-of-use offer the potential to aid in accelerating the design (with respect to transport), and thus reducing the cost, of energy materials.

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

  16. VOLTTRON: User Guide

    Energy Technology Data Exchange (ETDEWEB)

    Lutes, Robert G.; Katipamula, Srinivas; Akyol, Bora A.; Tenney, Nathan D.; Haack, Jereme N.; Monson, Kyle E.; Carpenter, Brandon J.

    2014-04-24

    This document is a user guide for the deployment of the Transactional Network platform and agent/application development within the 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.

  17. Ultimate guide to link building how to build backlinks, authority and credibility for your website, and increase click traffic and search ranking

    CERN Document Server

    Ward, Eric

    2013-01-01

    The web today is comprised of trillions of links: links between websites, links within social media venues like Facebook and Twitter, and even links in email inboxes. Who links to a site and how they link to it is one of the most important factors that search engines rely on when ranking results. But how do marketers control this? Link building expert Eric Ward provides the answers.Sharing little-known techniques for link building via social media platforms, blogs, partnerships, public relations, articles, and more, Ward teaches marketers which link-building techniques will maximi

  18. Implementing statistical learning methods through Bayesian networks. Part 1: a guide to Bayesian parameter estimation using forensic science data.

    Science.gov (United States)

    Biedermann, A; Taroni, F; Bozza, S

    2009-12-15

    As a thorough aggregation of probability and graph theory, Bayesian networks currently enjoy widespread interest as a means for studying factors that affect the coherent evaluation of scientific evidence in forensic science. Paper I of this series of papers intends to contribute to the discussion of Bayesian networks as a framework that is helpful for both illustrating and implementing statistical procedures that are commonly employed for the study of uncertainties (e.g. the estimation of unknown quantities). While the respective statistical procedures are widely described in literature, the primary aim of this paper is to offer an essentially non-technical introduction on how interested readers may use these analytical approaches--with the help of Bayesian networks--for processing their own forensic science data. Attention is mainly drawn to the structure and underlying rationale of a series of basic and context-independent network fragments that users may incorporate as building blocs while constructing larger inference models. As an example of how this may be done, the proposed concepts will be used in a second paper (Part II) for specifying graphical probability networks whose purpose is to assist forensic scientists in the evaluation of scientific evidence encountered in the context of forensic document examination (i.e. results of the analysis of black toners present on printed or copied documents).

  19. Controlled Vocabularies Boost International Participation and Normalization of Searches

    Science.gov (United States)

    Olsen, Lola M.

    2006-01-01

    The Global Change Master Directory's (GCMD) science staff set out to document Earth science data and provide a mechanism for it's discovery in fulfillment of a commitment to NASA's Earth Science progam and to the Committee on Earth Observation Satellites' (CEOS) International Directory Network (IDN.) At the time, whether to offer a controlled vocabulary search or a free-text search was resolved with a decision to support both. The feedback from the user community indicated that being asked to independently determine the appropriate 'English" words through a free-text search would be very difficult. The preference was to be 'prompted' for relevant keywords through the use of a hierarchy of well-designed science keywords. The controlled keywords serve to 'normalize' the search through knowledgeable input by metadata providers. Earth science keyword taxonomies were developed, rules for additions, deletions, and modifications were created. Secondary sets of controlled vocabularies for related descriptors such as projects, data centers, instruments, platforms, related data set link types, and locations, along with free-text searches assist users in further refining their search results. Through this robust 'search and refine' capability in the GCMD users are directed to the data and services they seek. The next step in guiding users more directly to the resources they desire is to build a 'reasoning' capability for search through the use of ontologies. Incorporating twelve sets of Earth science keyword taxonomies has boosted the GCMD S ability to help users define and more directly retrieve data of choice.

  20. Detail-Preserving Restoration of Impulse Noise Corrupted Images by a Switching Median Filter Guided by a Simple Neuro-Fuzzy Network

    Directory of Open Access Journals (Sweden)

    Beşdok Erkan

    2004-01-01

    Full Text Available A new operator for the restoration of digital images corrupted by impulse noise is presented. The proposed operator is a simple recursive switching median filter guided by a neuro-fuzzy network functioning as an impulse detector. The internal parameters of the neuro-fuzzy impulse detector are adaptively optimized by training. The training is easily accomplished by using simple artificial images that can be generated in a computer. The most distinctive feature of the proposed operator over other operators is that it offers excellent detail- and texture-preservation performance, while effectively removing noise from the input image. Extensive experiments show that the proposed operator may be used for efficient restoration of digital images corrupted by impulse noise without distorting the useful information in the image.

  1. When Push Comes to Shove: A Hype-Free Guide to Evaluating Technical Solutions to Copyright Infringement on Campus Networks

    Science.gov (United States)

    Electronic Frontier Foundation, 2006

    2006-01-01

    This paper is intended to help institutions of higher education critically evaluate the principal technological tools and policies being used to enforce copyright on campus networks. It first explores where the goals of copyright holders and universities overlap and where they conflict. It then discusses the pros and cons of the major solutions…

  2. Networking

    OpenAIRE

    Rauno Lindholm, Daniel; Boisen Devantier, Lykke; Nyborg, Karoline Lykke; Høgsbro, Andreas; Fries, de; Skovlund, Louise

    2016-01-01

    The purpose of this project was to examine what influencing factor that has had an impact on the presumed increasement of the use of networking among academics on the labour market and how it is expressed. On the basis of the influence from globalization on the labour market it can be concluded that the globalization has transformed the labour market into a market based on the organization of networks. In this new organization there is a greater emphasis on employees having social qualificati...

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

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

    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.

  5. Context-specific metabolic network reconstruction of a naphthalene-degrading bacterial community guided by metaproteomic data.

    Science.gov (United States)

    Tobalina, Luis; Bargiela, Rafael; Pey, Jon; Herbst, Florian-Alexander; Lores, Iván; Rojo, David; Barbas, Coral; Peláez, Ana I; Sánchez, Jesús; von Bergen, Martin; Seifert, Jana; Ferrer, Manuel; Planes, Francisco J

    2015-06-01

    With the advent of meta-'omics' data, the use of metabolic networks for the functional analysis of microbial communities became possible. However, while network-based methods are widely developed for single organisms, their application to bacterial communities is currently limited. Herein, we provide a novel, context-specific reconstruction procedure based on metaproteomic and taxonomic data. Without previous knowledge of a high-quality, genome-scale metabolic networks for each different member in a bacterial community, we propose a meta-network approach, where the expression levels and taxonomic assignments of proteins are used as the most relevant clues for inferring an active set of reactions. Our approach was applied to draft the context-specific metabolic networks of two different naphthalene-enriched communities derived from an anthropogenically influenced, polyaromatic hydrocarbon contaminated soil, with (CN2) or without (CN1) bio-stimulation. We were able to capture the overall functional differences between the two conditions at the metabolic level and predict an important activity for the fluorobenzoate degradation pathway in CN1 and for geraniol metabolism in CN2. Experimental validation was conducted, and good agreement with our computational predictions was observed. We also hypothesize different pathway organizations at the organismal level, which is relevant to disentangle the role of each member in the communities. The approach presented here can be easily transferred to the analysis of genomic, transcriptomic and metabolomic data. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  6. Selective Search for Object Recognition

    NARCIS (Netherlands)

    Uijlings, J.R.; van de Sande, K.E.A.; Gevers, T.; Smeulders, A.W.M.

    This paper addresses the problem of generating possible object locations for use in object recognition. We introduce selective search which combines the strength of both an exhaustive search and segmentation. Like segmentation, we use the image structure to guide our sampling process. Like

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

  8. Random searching

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2009-01-01

    There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

  9. Multidisciplinary team approach for the management of patients with locally advanced non-small cell lung cancer: Searching the evidence to guide the decision

    Energy Technology Data Exchange (ETDEWEB)

    Oh, In Jae; Ahn, Sung Ja [Chonnam National University Hwasun Hospital, Hwasun (Korea, Republic of)

    2017-03-15

    Locally advanced non-small cell lung cancer (LA-NSCLC) is composed of heterogeneous subgroups that require a multidisciplinary team approach in order to ensure optimal therapy for each patient. Since 2010, the National Comprehensive Cancer Network has recommended chemoradiation therapy (CRT) for bulky mediastinal disease and surgical combination for those patients with single-station N2 involvement who respond to neoadjuvant therapy. According to lung cancer tumor boards, thoracic surgeons make a decision on the resectability of the tumor, if it is determined to be unresectable, concurrent CRT (CCRT) is considered the next choice. However, the survival benefit of CCRT over sequential CRT or radiotherapy alone carries the risk of additional toxicity. Considering severe adverse events that may lead to death, fit patients who are able to tolerate CCRT must be identified by multidisciplinary tumor board. Decelerated approaches, such as sequential CRT or high-dose radiation alone may be a valuable alternative for patients who are not eligible for CCRT. As a new treatment strategy, investigators are interested in the application of the innovative radiation techniques, trimodality therapy combining surgery after high-dose definitive CCRT, and the combination of radiation with targeted or immunotherapy agents. The updated results and on-going studies are thoroughly reviewed in this article.

  10. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  11. Guide to Eating for Sports

    Medline Plus

    Full Text Available ... 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 / ...

  12. Development of a first-contact protocol to guide assessment of adult patients in rehabilitation services networks

    Science.gov (United States)

    Souza, Mariana A. P.; Ferreira, Fabiane R.; César, Cibele C.; Furtado, Sheyla R. C.; Coster, Wendy J.; Mancini, Marisa C.; Sampaio, Rosana F.

    2016-01-01

    Objective: This paper describes the development of the Protocol for Identification of Problems for Rehabilitation (PLPR), a tool to standardize collection of functional information based on the International Classification of Functioning, Disability and Health (ICF). Development of the protocol: The PLPR was developed for use during the initial contact with adult patients within a public network of rehabilitation services. Steps to develop the protocol included: survey of the ICF codes most used by clinical professionals; compilation of data from functional instruments; development and pilot testing of a preliminary version in the service settings; discussion with professionals and development of the final version. The final version includes: user identification; social and health information; brief functional description (BFD); summary of the BFD; and PLPR results. Further testing of the final version will be conducted. Conclusions: The protocol standardizes the first contact between the user and the rehabilitation service. Systematic use of the protocol could also help to create a functional database that would allow comparisons between rehabilitation services and countries over time. PMID:26786075

  13. Evaluation of Current Approaches to Stream Classification and a Heuristic Guide to Developing Classifications of Integrated Aquatic Networks

    Science.gov (United States)

    Melles, S. J.; Jones, N. E.; Schmidt, B. J.

    2014-03-01

    Conservation and management of fresh flowing waters involves evaluating and managing effects of cumulative impacts on the aquatic environment from disturbances such as: land use change, point and nonpoint source pollution, the creation of dams and reservoirs, mining, and fishing. To assess effects of these changes on associated biotic communities it is necessary to monitor and report on the status of lotic ecosystems. A variety of stream classification methods are available to assist with these tasks, and such methods attempt to provide a systematic approach to modeling and understanding complex aquatic systems at various spatial and temporal scales. Of the vast number of approaches that exist, it is useful to group them into three main types. The first involves modeling longitudinal species turnover patterns within large drainage basins and relating these patterns to environmental predictors collected at reach and upstream catchment scales; the second uses regionalized hierarchical classification to create multi-scale, spatially homogenous aquatic ecoregions by grouping adjacent catchments together based on environmental similarities; and the third approach groups sites together on the basis of similarities in their environmental conditions both within and between catchments, independent of their geographic location. We review the literature with a focus on more recent classifications to examine the strengths and weaknesses of the different approaches. We identify gaps or problems with the current approaches, and we propose an eight-step heuristic process that may assist with development of more flexible and integrated aquatic classifications based on the current understanding, network thinking, and theoretical underpinnings.

  14. Artificial neural network based gynaecological image-guided adaptive brachytherapy treatment planning correction of intra-fractional organs at risk dose variation

    Directory of Open Access Journals (Sweden)

    Ramin Jaberi

    2017-12-01

    Full Text Available Purpose : Intra-fractional organs at risk (OARs deformations can lead to dose variation during image-guided adaptive brachytherapy (IGABT. The aim of this study was to modify the final accepted brachytherapy treatment plan to dosimetrically compensate for these intra-fractional organs-applicators position variations and, at the same time, fulfilling the dosimetric criteria. Material and methods : Thirty patients with locally advanced cervical cancer, after external beam radiotherapy (EBRT of 45-50 Gy over five to six weeks with concomitant weekly chemotherapy, and qualified for intracavitary high-dose-rate (HDR brachytherapy with tandem-ovoid applicators were selected for this study. Second computed tomography scan was done for each patient after finishing brachytherapy treatment with applicators in situ. Artificial neural networks (ANNs based models were used to predict intra-fractional OARs dose-volume histogram parameters variations and propose a new final plan. Results : A model was developed to estimate the intra-fractional organs dose variations during gynaecological intracavitary brachytherapy. Also, ANNs were used to modify the final brachytherapy treatment plan to compensate dosimetrically for changes in ‘organs-applicators’, while maintaining target dose at the original level. Conclusions : There are semi-automatic and fast responding models that can be used in the routine clinical workflow to reduce individually IGABT uncertainties. These models can be more validated by more patients’ plans to be able to serve as a clinical tool.

  15. In Search of Practitioner-Based Social Capital: A Social Network Analysis Tool for Understanding and Facilitating Teacher Collaboration in a US-Based STEM Professional Development Program

    Science.gov (United States)

    Baker-Doyle, Kira J.; Yoon, Susan A.

    2011-01-01

    This paper presents the first in a series of studies on the informal advice networks of a community of teachers in an in-service professional development program. The aim of the research was to use Social Network Analysis as a methodological tool to reveal the social networks developed by the teachers, and to examine whether these networks…

  16. Guide to Eating for Sports

    Medline Plus

    Full Text Available ... More for Teens Teens site Sitio 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 ...

  17. Guide to Eating for Sports

    Medline Plus

    Full Text Available ... Teens site Sitio 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 ...

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

  19. Guide to Eating for Sports

    Medline Plus

    Full Text Available ... Search English Español A Guide to Eating for Sports KidsHealth / For Teens / A Guide to Eating for ... including increased risk for fractures and other injuries. Athletes and Dieting Since teen athletes need extra fuel, ...

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

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

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

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

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

  5. SPIRES I: on-line search guide

    International Nuclear Information System (INIS)

    Addis, L.

    1975-06-01

    SPIRES I is the first generation of the on-line Stanford Public Information Retrieval System. Designed as a prototype system, SPIRES I was later moved to the SLAC computing facility where it has been routinely available to SLAC users in the field of high-energy physics. The scope and use of the SPIRES I system are described in this manual

  6. Faceted Search

    CERN Document Server

    Tunkelang, Daniel

    2009-01-01

    We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more

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

  8. Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  9. VNS (Variable Neighbourhood Search) applied to batch sequencing in operational scheduling of pipeline network; VNS (Variable Neighbourhood Search) aplicado ao sequenciamento de bateladas do 'scheduling' de operacoes de uma malha dutoviaria

    Energy Technology Data Exchange (ETDEWEB)

    Yamamoto, Lia; Arruda, Lucia Valeria Ramos de; Libert, Nikolas [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)

    2008-07-01

    This work presents the VNS heuristic technique applied on batches ordering in a real network of petroleum derivatives distribution. These ordering have great influence in operational scheduling of a pipeline network. The operational scheduling purposes the efficient utilization of the resources, resulting on a better performance. Due to the great complexity of the real network problem and the necessity of its resolution in little computational time, it was adopted a problem subdivision in assignment of resources, sequencing and timing. In the resources assignment stage, it is considered the production/consumption functions and the products tankages to determine the total batches, including its volume, flow rate and the time-windows to satisfy the demand. These data are used in the sequencing stage, where a VNS based model determines the batches ordering. In a final step, the last block, realize the temporisation considering the network operational constraints. This work shows the results from the optimization of the sequencing stage which aims the improvement of the solution quality of scheduling. (author)

  10. Autonomous search

    CERN Document Server

    Hamadi, Youssef; Saubion, Frédéric

    2012-01-01

    Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

  11. B-jet and c-jet identification with Neural Networks as well as combination of multivariate analyses for the search for of multivariate analyses for the search for single top-quark production

    Energy Technology Data Exchange (ETDEWEB)

    Renz, Manuel; /Karlsruhe U., EKP

    2008-06-01

    In the first part of this diploma thesis, the current version of the KIT Flavor Separator, a neural network which is able to distinguish between tagged b-quark jets and tagged c/light-quark jets, is presented. In comparison with previous versions four new input variables are utilized and new Monte Carlo samples with a larger number of simulated events are used for the training of the neural network. It is illustrated that the output of the neural network is continuously distributed between 1 and -1, whereas b-quark jets accumulate at 1, however, c-quark jets and light-quark jets have outputs next to -1. To ensure that the network output describes observed events correctly, the shapes of all input variables are compared in simulation and data. Thus the mismodelling of any input variable is excluded. Moreover, the b jet and light jet output distributions are compared with the output of samples of observed events, which are enhanced in the particular flavor. In contrast to previous versions, no b-jet output correction function has to be calculated, because the agreement between simulation and collision data is excellent for b-quark jets. For the light-jet output, correction functions are developed. Different applications of the KIT Flavor Separator are mentioned. For example it provides a precious input to all three CDF single top quark analyses. Furthermore, it is shown that the KIT Flavor Separator is a universal tool, which can be used in every high-p{sub T} analysis that requires the identification of b-quark jets with high efficiency. As it is pointed out, a further application is the estimation of the flavor composition of a given sample of observed events. In addition a neural network, which is able to separate c-quark jets from light-quark jets, is trained. It is shown, that all three flavors can be separated in the c-net-Flavor Separator plane. As a result, the uncertainties on the estimation of the flavor composition in events with one tagged jet are cut

  12. B-jet and c-jet identification with Neural Networks as well as combination of multivariate analyses for the search for of multivariate analyses for the search for single top-quark production

    International Nuclear Information System (INIS)

    Renz, Manuel

    2008-01-01

    In the first part of this diploma thesis, the current version of the KIT Flavor Separator, a neural network which is able to distinguish between tagged b-quark jets and tagged c/light-quark jets, is presented. In comparison with previous versions four new input variables are utilized and new Monte Carlo samples with a larger number of simulated events are used for the training of the neural network. It is illustrated that the output of the neural network is continuously distributed between 1 and -1, whereas b-quark jets accumulate at 1, however, c-quark jets and light-quark jets have outputs next to -1. To ensure that the network output describes observed events correctly, the shapes of all input variables are compared in simulation and data. Thus the mismodelling of any input variable is excluded. Moreover, the b jet and light jet output distributions are compared with the output of samples of observed events, which are enhanced in the particular flavor. In contrast to previous versions, no b-jet output correction function has to be calculated, because the agreement between simulation and collision data is excellent for b-quark jets. For the light-jet output, correction functions are developed. Different applications of the KIT Flavor Separator are mentioned. For example it provides a precious input to all three CDF single top quark analyses. Furthermore, it is shown that the KIT Flavor Separator is a universal tool, which can be used in every high-p T analysis that requires the identification of b-quark jets with high efficiency. As it is pointed out, a further application is the estimation of the flavor composition of a given sample of observed events. In addition a neural network, which is able to separate c-quark jets from light-quark jets, is trained. It is shown, that all three flavors can be separated in the c-net-Flavor Separator plane. As a result, the uncertainties on the estimation of the flavor composition in events with one tagged jet are cut into

  13. FCJ-157 Still ‘Searching for Safety Online’: collective strategies and discursive resistance to trolling and harassment in a feminist network

    Directory of Open Access Journals (Sweden)

    Frances Shaw

    2013-12-01

    Full Text Available This paper examines the discursive responses that participants in a network of feminist blogs developed to handle trolling in their community. Internet communities develop strategies to deal with trolls in their networks. In particular, participants provide instructions and guidance to support each other to deal with trolls and harassment, and engage in intra-community discussion about the significance or insignificance of trolls. My paper explores the practices that feminist bloggers engage in to resist silencing practices, and the ways in which the silencing of female voices does not work in these contexts. I argue that trolling and discursive responses to trolls are collectively developed and enforced. Using a case study from my research into Australian feminist blogging networks, I argue that these networks have developed particular collective responses to trolls.

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

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

  16. Neutron guide

    Science.gov (United States)

    Greene, Geoffrey L.

    1999-01-01

    A neutron guide in which lengths of cylindrical glass tubing have rectangular glass plates properly dimensioned to allow insertion into the cylindrical glass tubing so that a sealed geometrically precise polygonal cross-section is formed in the cylindrical glass tubing. The neutron guide provides easier alignment between adjacent sections than do the neutron guides of the prior art.

  17. Social Tagging for Personalized Web Search

    Science.gov (United States)

    Biancalana, Claudio

    Social networks and collaborative tagging systems are rapidly gaining popularity as primary means for sorting and sharing data: users tag their bookmarks in order to simplify information dissemination and later lookup. Social Bookmarking services are useful in two important respects: first, they can allow an individual to remember the visited URLs, and second, tags can be made by the community to guide users towards valuable content. In this paper we focus on the latter use: we present a novel approach for personalized web search using query expansion. We further extend the family of well-known co-occurence matrix technique models by using a new way of exploring social tagging services. Our approach shows its strength particularly in the case of disambiguation of word contexts. We show how to design and implement such a system in practice and conduct several experiments. To the best of our knowledge this is the first study centered on using social bookmarking and tagging techniques for personalization of web search and its evaluation in a real-world scenario.

  18. Principles for designing web searching instruction

    NARCIS (Netherlands)

    Lazonder, Adrianus W.

    2003-01-01

    Web searching is a timely topic which importance is recognized by researchers, educators and instructional designers. This paper aims to guide these practitioners in developing instructional materials for learning to search the Web. It does so by articulating ten design principles that attend to the

  19. Search for non-strange dibaryons

    Indian Academy of Sciences (India)

    Abstract. Inspite of tremendous interest there has been sporadic searches for dibaryon resonances in the past few decades. The main hurdle one faces in this search is their identi- fication, their signature and practically no guide to their location. With the identification of the pentaquark-θ+ resonance one is encouraged to ...

  20. Analysis, Design and Implementation of a Networking Proof-of-Concept Prototype to Support Maritime Visit, Board, Search and Seizure Teams

    Science.gov (United States)

    2014-03-01

    large vehicles . It is comprised completely of metal, and over 694 feet in length. The interior is an open bay concept with sloping ramps connecting...Radio Router setup o ATAK x 2 + charging cord x 1 (Brandon has these) o Laptop x 4 + power cord x 2 o Accessories o Charger base o Radio batteries x...38. Retrieved from http://search.proquest.com/docview/1032950116?accountid=12702 Institute of Electrical and Electronics Engineers, IEEE 802. (2012

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

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

  3. USE OF HOTELS NETWORKS DATA IN GEOGRAPHICAL SEARCH: A CASE STUDY ON THE TWIN CITIES OF BRASILÉIA, EPITACIOLÂNDIA AND COBIJA

    Directory of Open Access Journals (Sweden)

    Leonardo Luiz Silveira da Silva

    2016-12-01

    Full Text Available This article aims to present the possibilities and challenges of the use of the hotel network data for geographic research and perhaps in related areas. The presentation takes place through the use of hotel data in a doctoral thesis about the twin cities of Brasiléia, Epitaciolândia and Cobija. The article shows the strength of such data for research in sub-disciplines of Urban Geography and Regional Geography. The hotels data allow the establishment of inferences as urban functions, mapping flows of various typologies, the regional, national or international influence of the cities, the dependence and interdependence relations between cities and finally, their role in urban networks. The article shows how the information was used in the doctoral thesis and presents the difficulties encountered, pretending to be useful for those who want to investigate urban and regional questions.

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

  5. Internet Search Engines

    OpenAIRE

    Fatmaa El Zahraa Mohamed Abdou

    2004-01-01

    A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.

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

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

  8. Guided labworks

    DEFF Research Database (Denmark)

    Jacobsen, Lærke Bang

    For the last 40 years physics education research has shown poor learning outcomes of guided labs. Still this is found to be a very used teaching method in the upper secodary schools. This study explains the teacher's choice of guided labs throught the concept of redesign as obstacle dislodgement...

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

  10. The Global Network of Optical Magnetometers for Exotic physics (GNOME): A novel scheme to search for physics beyond the Standard Model

    International Nuclear Information System (INIS)

    Pustelny, Szymon; Jackson Kimball, Derek F.; Pankow, Chris; Ledbetter, Micah P.; Wlodarczyk, Przemyslaw; Wcislo, Piotr; Pospelov, Maxim; Smith, Joshua R.; Read, Jocelyn; Gawlik, Wojciech; Budker, Dmitry

    2013-01-01

    A novel experimental scheme enabling the investigation of transient exotic spin couplings is discussed. The scheme is based on synchronous measurements of optical-magnetometer signals from several devices operating in magnetically shielded environments in distant locations (>or similar 100 km). Although signatures of such exotic couplings may be present in the signal from a single magnetometer, it would be challenging to distinguish them from noise. By analyzing the correlation between signals from multiple, geographically separated magnetometers, it is not only possible to identify the exotic transient but also to investigate its nature. The ability of the network to probe presently unconstrained physics beyond the Standard Model is examined by considering the spin coupling to stable topological defects (e.g., domain walls) of axion-like fields. In the spirit of this research, a brief (∝2 hours) demonstration experiment involving two magnetometers located in Krakow and Berkeley (∝9000 km separation) is presented and discussion of the data-analysis approaches that may allow identification of transient signals is provided. The prospects of the network are outlined in the last part of the paper. (copyright 2013 by WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

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

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

  13. Guide to Eating for Sports

    Medline Plus

    Full Text Available ... Staying Safe Videos for Educators Search English Español A Guide to Eating for Sports KidsHealth / For Teens / ... perform your best while also losing weight. Eat a Variety of Foods You may have heard about " ...

  14. HBR guides

    CERN Document Server

    Duarte, Nancy; Dillon, Karen

    2015-01-01

    Master your most pressing professional challenges with this seven-volume set that collects the smartest best practices from leading experts all in one place. "HBR Guide to Better Business Writing" and "HBR Guide to Persuasive Presentations" help you perfect your communication skills; "HBR Guide to Managing Up and Across" and "HBR Guide to Office Politics" show you how to build the best professional relationships; "HBR Guide to Finance Basics for Managers" is the one book you'll ever need to teach you about the numbers; "HBR Guide to Project Management" addresses tough questions such as how to manage stakeholder expectations and how to manage uncertainty in a complex project; and "HBR Guide to Getting the Right Work Done" goes beyond basic productivity tips to teach you how to prioritize and focus on your work. This specially priced set of the most popular books in the series makes a perfect gift for aspiring leaders looking for trusted advice. Arm yourself with the advice you need to succeed on the job, from ...

  15. Strategies for searching and managing evidence-based practice resources.

    Science.gov (United States)

    Robb, Meigan; Shellenbarger, Teresa

    2014-10-01

    Evidence-based nursing practice requires the use of effective search strategies to locate relevant resources to guide practice change. Continuing education and staff development professionals can assist nurses to conduct effective literature searches. This article provides suggestions for strategies to aid in identifying search terms. Strategies also are recommended for refining searches by using controlled vocabulary, truncation, Boolean operators, PICOT (Population/Patient Problem, Intervention, Comparison, Outcome, Time) searching, and search limits. Suggestions for methods of managing resources also are identified. Using these approaches will assist in more effective literature searches and may help evidence-based practice decisions. Copyright 2014, SLACK Incorporated.

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

  17. EFDC1D - A ONE DIMENSIONAL HYDRODYNAMIC AND SEDIMENT TRANSPORT MODEL FOR RIVER AND STREAM NETWORKS: MODEL THEORY AND USERS GUIDE

    Science.gov (United States)

    This technical report describes the new one-dimensional (1D) hydrodynamic and sediment transport model EFDC1D. This model that can be applied to stream networks. The model code and two sample data sets are included on the distribution CD. EFDC1D can simulate bi-directional unstea...

  18. Interrupted Visual Searches Reveal Volatile Search Memory

    Science.gov (United States)

    Shen, Y. Jeremy; Jiang, Yuhong V.

    2006-01-01

    This study investigated memory from interrupted visual searches. Participants conducted a change detection search task on polygons overlaid on scenes. Search was interrupted by various disruptions, including unfilled delay, passive viewing of other scenes, and additional search on new displays. Results showed that performance was unaffected by…

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

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

  1. PREFACE: The random search problem: trends and perspectives The random search problem: trends and perspectives

    Science.gov (United States)

    da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.

    2009-10-01

    aircraft, a given web site). Regarding the nature of the searching drive, in certain instances, it can be guided almost entirely by external cues, either by the cognitive (memory) or detective (olfaction, vision, etc) skills of the searcher. However, in many situations the movement is non-oriented, being in essence a stochastic process. Therefore, in such cases (and even when a small deterministic component in the locomotion exists) a random search effectively defines the final rates of encounters. Hence, one reason underlying the richness of the random search problem relates just to the `ignorance' of the locations of the randomly located targets. Contrary to conventional wisdom, the lack of complete information does not necessarily lead to greater complexity. As an illustrative example, let us consider the case of complete information. If the positions of all target sites are known in advance, then the question of what sequential order to visit the sites so to reduce the energy costs of locomotion itself becomes a rather challenging problem: the famous `travelling salesman' optimization query, belonging to the NP-complete class of problems. The ignorance of the target site locations, however, considerably modifies the problem and renders it not amenable to be treated by purely deterministic computational methods. In fact, as expected, the random search problem is not particularly suited to search algorithms that do not use elements of randomness. So, only a statistical approach to the search problem can adequately deal with the element of ignorance. In other words, the incomplete information renders the search under-determined, i.e., it is not possible to find the `best' solution to the problem because all the information is not given. Instead, one must guess and probabilistic or stochastic strategies become unavoidable. Also, the random search problem bears a relation to reaction-diffusion processes, because the search involves a diffusive aspect, movement, as well as a

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

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

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

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

  6. Parcellating cortical functional networks in individuals.

    Science.gov (United States)

    Wang, Danhong; Buckner, Randy L; Fox, Michael D; Holt, Daphne J; Holmes, Avram J; Stoecklein, Sophia; Langs, Georg; Pan, Ruiqi; Qian, Tianyi; Li, Kuncheng; Baker, Justin T; Stufflebeam, Steven M; Wang, Kai; Wang, Xiaomin; Hong, Bo; Liu, Hesheng

    2015-12-01

    The capacity to identify the unique functional architecture of an individual's brain is a crucial step toward personalized medicine and understanding the neural basis of variation in human cognition and behavior. Here we developed a cortical parcellation approach to accurately map functional organization at the individual level using resting-state functional magnetic resonance imaging (fMRI). A population-based functional atlas and a map of inter-individual variability were employed to guide the iterative search for functional networks in individual subjects. Functional networks mapped by this approach were highly reproducible within subjects and effectively captured the variability across subjects, including individual differences in brain lateralization. The algorithm performed well across different subject populations and data types, including task fMRI data. The approach was then validated by invasive cortical stimulation mapping in surgical patients, suggesting potential for use in clinical applications.

  7. Guide device

    International Nuclear Information System (INIS)

    Brammer, C.M. Jr.

    1977-01-01

    Disclosed is a fuel handling guide tube centering device for use in nuclear reactors during fuel assembly handling operations. The device comprises an outer ring secured to the flange of a nuclear reactor pressure vessel, a rotatable table rotatably coupled to the outer ring, and a plurality of openings through the table. Truncated locating cones are positioned in each of the openings in the table, and the locating cones center the guide tube during fuel handling operations. The openings in the table are located such that each fuel assembly in the nuclear core may be aligned with one of the openings by a suitable rotation of the table. The locating cones thereby provide alignment between the fuel handling mechanism located in the guide tube and the individual fuel assemblies of the cone. The need for a device to provide alignment is especially critical for floating nuclear power plants, where wave motion may exist during fuel handling operations. 5 claims, 4 figures

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

  9. Unix Application Migration Guide

    CERN Document Server

    Microsoft. Redmond

    2003-01-01

    Drawing on the experience of Microsoft consultants working in the field, as well as external organizations that have migrated from UNIX to Microsoft® Windows®, this guide offers practical, prescriptive guidance on the issues you are likely to face when porting existing UNIX applications to the Windows operating system environment. Senior IT decision makers, network managers, and operations managers will get real-world guidance and best practices on planning and implementation issues to understand the different methods through which migration or co-existence can be accomplished. Also detailing

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

  11. Prediction of CO2 Emission in China’s Power Generation Industry with Gauss Optimized Cuckoo Search Algorithm and Wavelet Neural Network Based on STIRPAT model with Ridge Regression

    Directory of Open Access Journals (Sweden)

    Weibo Zhao

    2017-12-01

    Full Text Available Power generation industry is the key industry of carbon dioxide (CO2 emission in China. Assessing its future CO2 emissions is of great significance to the formulation and implementation of energy saving and emission reduction policies. Based on the Stochastic Impacts by Regression on Population, Affluence and Technology model (STIRPAT, the influencing factors analysis model of CO2 emission of power generation industry is established. The ridge regression (RR method is used to estimate the historical data. In addition, a wavelet neural network (WNN prediction model based on Cuckoo Search algorithm optimized by Gauss (GCS is put forward to predict the factors in the STIRPAT model. Then, the predicted values are substituted into the regression model, and the CO2 emission estimation values of the power generation industry in China are obtained. It’s concluded that population, per capita Gross Domestic Product (GDP, standard coal consumption and thermal power specific gravity are the key factors affecting the CO2 emission from the power generation industry. Besides, the GCS-WNN prediction model has higher prediction accuracy, comparing with other models. Moreover, with the development of science and technology in the future, the CO2 emission growth in the power generation industry will gradually slow down according to the prediction results.

  12. Technological Networks

    Science.gov (United States)

    Mitra, Bivas

    The study of networks in the form of mathematical graph theory is one of the fundamental pillars of discrete mathematics. However, recent years have witnessed a substantial new movement in network research. The focus of the research is shifting away from the analysis of small graphs and the properties of individual vertices or edges to consideration of statistical properties of large scale networks. This new approach has been driven largely by the availability of technological networks like the Internet [12], World Wide Web network [2], etc. that allow us to gather and analyze data on a scale far larger than previously possible. At the same time, technological networks have evolved as a socio-technological system, as the concepts of social systems that are based on self-organization theory have become unified in technological networks [13]. In today’s society, we have a simple and universal access to great amounts of information and services. These information services are based upon the infrastructure of the Internet and the World Wide Web. The Internet is the system composed of ‘computers’ connected by cables or some other form of physical connections. Over this physical network, it is possible to exchange e-mails, transfer files, etc. On the other hand, the World Wide Web (commonly shortened to the Web) is a system of interlinked hypertext documents accessed via the Internet where nodes represent web pages and links represent hyperlinks between the pages. Peer-to-peer (P2P) networks [26] also have recently become a popular medium through which huge amounts of data can be shared. P2P file sharing systems, where files are searched and downloaded among peers without the help of central servers, have emerged as a major component of Internet traffic. An important advantage in P2P networks is that all clients provide resources, including bandwidth, storage space, and computing power. In this chapter, we discuss these technological networks in detail. The review

  13. Collaborative search in electronic health records

    Science.gov (United States)

    Mei, Qiaozhu; Hanauer, David A

    2011-01-01

    Objective A full-text search engine can be a useful tool for augmenting the reuse value of unstructured narrative data stored in electronic health records (EHR). A prominent barrier to the effective utilization of such tools originates from users' lack of search expertise and/or medical-domain knowledge. To mitigate the issue, the authors experimented with a ‘collaborative search’ feature through a homegrown EHR search engine that allows users to preserve their search knowledge and share it with others. This feature was inspired by the success of many social information-foraging techniques used on the web that leverage users' collective wisdom to improve the quality and efficiency of information retrieval. Design The authors conducted an empirical evaluation study over a 4-year period. The user sample consisted of 451 academic researchers, medical practitioners, and hospital administrators. The data were analyzed using a social-network analysis to delineate the structure of the user collaboration networks that mediated the diffusion of knowledge of search. Results The users embraced the concept with considerable enthusiasm. About half of the EHR searches processed by the system (0.44 million) were based on stored search knowledge; 0.16 million utilized shared knowledge made available by other users. The social-network analysis results also suggest that the user-collaboration networks engendered by the collaborative search feature played an instrumental role in enabling the transfer of search knowledge across people and domains. Conclusion Applying collaborative search, a social information-foraging technique popularly used on the web, may provide the potential to improve the quality and efficiency of information retrieval in healthcare. PMID:21486887

  14. Ontology-based Vaccine and Drug Adverse Event Representation and Theory-guided Systematic Causal Network Analysis toward Integrative Pharmacovigilance Research.

    Science.gov (United States)

    He, Yongqun

    2016-06-01

    Compared with controlled terminologies ( e.g. , MedDRA, CTCAE, and WHO-ART), the community-based Ontology of AEs (OAE) has many advantages in adverse event (AE) classifications. The OAE-derived Ontology of Vaccine AEs (OVAE) and Ontology of Drug Neuropathy AEs (ODNAE) serve as AE knowledge bases and support data integration and analysis. The Immune Response Gene Network Theory explains molecular mechanisms of vaccine-related AEs. The OneNet Theory of Life treats the whole process of a life of an organism as a single complex and dynamic network ( i.e. , OneNet). A new "OneNet effectiveness" tenet is proposed here to expand the OneNet theory. Derived from the OneNet theory, the author hypothesizes that one human uses one single genotype-rooted mechanism to respond to different vaccinations and drug treatments, and experimentally identified mechanisms are manifestations of the OneNet blueprint mechanism under specific conditions. The theories and ontologies interact together as semantic frameworks to support integrative pharmacovigilance research.

  15. Nine steps to proteomic wisdom: A practical guide to using protein-protein interaction networks and molecular pathways as a framework for interpreting disease proteomic profiles.

    Science.gov (United States)

    Isserlin, Ruth; Emili, Andrew

    2007-09-01

    A major aim of proteomic profiling of disease is to uncover the mechanistic basis of a given pathology. High-throughput experimental techniques continue to advance rapidly, but are still plagued by high rates of false negatives, false positives, and other spurious findings. By reducing a disease profile to a subset of differentially expressed proteins and determining functional over-representation, one can often make a reasonable first-pass assessment as to what might be happening in disease. Integrating mRNA expression patterns together with prior knowledge of protein-protein interaction networks and biological pathway information goes a step further, providing clues into the core processes that are aberrant in the disease state, and indicating which cellular functions are activated or repressed as a maladaptive pathophysiological response. This multi-step framework allows one to hypothesize as to possible cause and effect of pathology, and highlights potentially instructive pathways or sub-networks for subsequent experimental validation. Indeed, efficiently exploiting data regarding the myriad of physical and genetic interactions among expressed gene products, in parallel with the systematic sampling of genetic variation among diverse human populations, promises to revolutionize our current understanding of disease action at a deeper molecular level. Copyright © 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  16. Condition Assessment of Foundation Piles and Utility Poles Based on Guided Wave Propagation Using a Network of Tactile Transducers and Support Vector Machines.

    Science.gov (United States)

    Dackermann, Ulrike; Yu, Yang; Niederleithinger, Ernst; Li, Jianchun; Wiggenhauser, Herbert

    2017-12-18

    This paper presents a novel non-destructive testing and health monitoring system using a network of tactile transducers and accelerometers for the condition assessment and damage classification of foundation piles and utility poles. While in traditional pile integrity testing an impact hammer with broadband frequency excitation is typically used, the proposed testing system utilizes an innovative excitation system based on a network of tactile transducers to induce controlled narrow-band frequency stress waves. Thereby, the simultaneous excitation of multiple stress wave types and modes is avoided (or at least reduced), and targeted wave forms can be generated. The new testing system enables the testing and monitoring of foundation piles and utility poles where the top is inaccessible, making the new testing system suitable, for example, for the condition assessment of pile structures with obstructed heads and of poles with live wires. For system validation, the new system was experimentally tested on nine timber and concrete poles that were inflicted with several types of damage. The tactile transducers were excited with continuous sine wave signals of 1 kHz frequency. Support vector machines were employed together with advanced signal processing algorithms to distinguish recorded stress wave signals from pole structures with different types of damage. The results show that using fast Fourier transform signals, combined with principal component analysis as the input feature vector for support vector machine (SVM) classifiers with different kernel functions, can achieve damage classification with accuracies of 92.5% ± 7.5%.

  17. Condition Assessment of Foundation Piles and Utility Poles Based on Guided Wave Propagation Using a Network of Tactile Transducers and Support Vector Machines

    Directory of Open Access Journals (Sweden)

    Ulrike Dackermann

    2017-12-01

    Full Text Available This paper presents a novel non-destructive testing and health monitoring system using a network of tactile transducers and accelerometers for the condition assessment and damage classification of foundation piles and utility poles. While in traditional pile integrity testing an impact hammer with broadband frequency excitation is typically used, the proposed testing system utilizes an innovative excitation system based on a network of tactile transducers to induce controlled narrow-band frequency stress waves. Thereby, the simultaneous excitation of multiple stress wave types and modes is avoided (or at least reduced, and targeted wave forms can be generated. The new testing system enables the testing and monitoring of foundation piles and utility poles where the top is inaccessible, making the new testing system suitable, for example, for the condition assessment of pile structures with obstructed heads and of poles with live wires. For system validation, the new system was experimentally tested on nine timber and concrete poles that were inflicted with several types of damage. The tactile transducers were excited with continuous sine wave signals of 1 kHz frequency. Support vector machines were employed together with advanced signal processing algorithms to distinguish recorded stress wave signals from pole structures with different types of damage. The results show that using fast Fourier transform signals, combined with principal component analysis as the input feature vector for support vector machine (SVM classifiers with different kernel functions, can achieve damage classification with accuracies of 92.5% ± 7.5%.

  18. Improved cuckoo search with particle swarm optimization for ...

    Indian Academy of Sciences (India)

    Content based image retrieval (CBIR); image compression; partial recurrent neural network (PRNN); particle swarm optimization (PSO); HAARwavelet; Cuckoo Search ... are NP hard, a hybrid Particle Swarm Optimization (PSO) – Cuckoo Search algorithm (CS) is proposed to optimize the learning rate of the neural network.

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

  20. Redes centinela sanitarias en España: Consenso para una guía de principios y métodos Health sentinel networks in Spain: Consensus for a guide of principles and methods

    Directory of Open Access Journals (Sweden)

    Agustín Tomás Vega Alonso

    2006-12-01

    Full Text Available Las redes centinela sanitarias han estado activas en nuestro país desde la década de los años ochenta, con variados objetivos, metodología y diferente grado de desarrollo en las comunidades autónomas donde se han implantado. La necesidad de normalizar el funcionamiento y de armonizar los indicadores ha propiciado un proyecto de investigación de redes centinela sanitarias españolas, uno de cuyos objetivos es establecer una guía de principios y métodos de trabajo. Se ha procedido a realizar un estudio con el método Delphi, en el que un panel de 23 expertos ha consensuado, en 3 fases consecutivas, la definición de red centinela, los objetivos, los principios que deben regirlas y otros aspectos relacionados con la organización y funcionamiento. En conjunto se plantearon 41 cuestiones sobre la base de un primer borrador, las cuales necesitaban un 80% de consenso en una primera fase y un 70% en la segunda. Todos los expertos participaron en la primera fase, 22 en la segunda y 20 en la tercera. Se alcanzó un consenso en 36 cuestiones en la primera fase y en 4 de las 5 restantes en la segunda. En la tercera fase se dio forma definitiva al documento de la guía. El método de consenso Delphi ha resultado extremadamente útil en la resolución de discrepancias y divergencias, obteniéndose una guía válida para redes centinela. Los expertos ajenos a los sistemas centinela del panel seleccionado aportaron una visión más extensa sobre los objetivos y la aplicabilidad de las redes centinela sanitarias en España.Since the eighties, health sentinel networks have been active in our country, but with a variety of objectives, methods and different development levels in the autonomous communities. The necessity of standardising the management and harmonising the indicators has concluded in a research project on the Spanish health sentinel networks, one of whose objectives is to establish a guide for work principles and methods. A panel of 23

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

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

  3. Interhemispheric integration in visual search.

    Science.gov (United States)

    Shipp, Stewart

    2011-07-01

    response time, with individual subjects capable of opposite hemifield biases. The results are interpretable by a guided search model of spatial attention - a first, parallel stage guiding selection by a second, serial stage - with the proviso that the first stage is relatively insular within each hemisphere. The bilateral advantage in search efficiency can then be attributed to a relative gain in target weight within the initial parallel stage, owing to a reduction in distractor competition mediated specifically by intrahemispheric circuitry. In the absence of a target there is no effective guidance, and hence no basis for a bilateral advantage to enhance search efficiency; the equivalence of scanning speed for the two display modes (bilateral and unilateral) implies a unitary second-stage process mediated via efficient interhemispheric integration. Copyright © 2011 Elsevier Ltd. All rights reserved.

  4. Search Term Reports

    Science.gov (United States)

    Learn what search terms brought users to choose your page in their search results, and what terms they entered in the EPA search box after visiting your page. Use this information to improve links and content on the page.

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

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

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

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

  9. Neural network design with combined backpropagation and creeping random search learning algorithms applied to the determination of retained austenite in TRIP steels; Diseno de redes neuronales con aprendizaje combinado de retropropagacion y busqueda aleatoria progresiva aplicado a la determinacion de austenita retenida en aceros TRIP

    Energy Technology Data Exchange (ETDEWEB)

    Toda-Caraballo, I.; Garcia-Mateo, C.; Capdevila, C.

    2010-07-01

    At the beginning of the decade of the nineties, the industrial interest for TRIP steels leads to a significant increase of the investigation and application in this field. In this work, the flexibility of neural networks for the modelling of complex properties is used to tackle the problem of determining the retained austenite content in TRIP-steel. Applying a combination of two learning algorithms (backpropagation and creeping-random-search) for the neural network, a model has been created that enables the prediction of retained austenite in low-Si / low-Al multiphase steels as a function of processing parameters. (Author). 34 refs.

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

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

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

  13. submitter Searches at LEP

    CERN Document Server

    Kawagoe, Kiyotomo

    2001-01-01

    Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.

  14. Web Search Engines

    OpenAIRE

    Rajashekar, TB

    1998-01-01

    The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.

  15. Sound Search Engine Concept

    DEFF Research Database (Denmark)

    2006-01-01

    Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...

  16. How doctors search

    DEFF Research Database (Denmark)

    Lykke, Marianne; Price, Susan; Delcambre, Lois

    2012-01-01

    Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search...

  17. Large Neighborhood Search

    DEFF Research Database (Denmark)

    Pisinger, David; Røpke, Stefan

    2010-01-01

    Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better...... candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method,we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood...... search....

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

  19. Search Results | Page 765 | IDRC - International Development ...

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

    Results 7641 - 7650 of 8490 ... We have developed an organizational performance assessment framework, including a guide for self-assessment. ... Networking Support Programme (APC WNSP) developed GEM and GEM-related resources to facilitate learning about using information and communication technologies (ICTs) ...

  20. Myanmar Language Search Engine

    OpenAIRE

    Pann Yu Mon; Yoshiki Mikami

    2011-01-01

    With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly n...

  1. Bioinformatics: searching the Net.

    Science.gov (United States)

    Kastin, S; Wexler, J

    1998-04-01

    During the past 30 years, there has been an explosion in the volume of published medical information. As this volume has increased, so has the need for efficient methods for searching the data. MEDLINE, the primary medical database, is currently limited to abstracts of the medical literature. MEDLINE searches use AND/OR/NOT logical searching for keywords that have been assigned to each article and for textwords included in article abstracts. Recently, the complete text of some scientific journals, including figures and tables, has become accessible electronically. Keyword and textword searches can provide an overwhelming number of results. Search engines that use phrase searching, or searches that limit the number of words between two finds, improve the precision of search engines. The development of the Internet as a vehicle for worldwide communication, and the emergence of the World Wide Web (WWW) as a common vehicle for communication have made instantaneous access to much of the entire body of medical information an exciting possibility. There is more than one way to search the WWW for information. At the present time, two broad strategies have emerged for cataloging the WWW: directories and search engines. These allow more efficient searching of the WWW. Directories catalog WWW information by creating categories and subcategories of information and then publishing pointers to information within the category listings. Directories are analogous to yellow pages of the phone book. Search engines make no attempt to categorize information. They automatically scour the WWW looking for words and then automatically create an index of those words. When a specific search engine is used, its index is searched for a particular word. Usually, search engines are nonspecific and produce voluminous results. Use of AND/OR/NOT and "near" and "adjacent" search refinements greatly improve the results of a search. Search engines that limit their scope to specific sites, and

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

  3. Learning conditional Gaussian networks

    DEFF Research Database (Denmark)

    Bøttcher, Susanne Gammelgaard

    This paper considers conditional Gaussian networks. The parameters in the network are learned by using conjugate Bayesian analysis. As conjugate local priors, we apply the Dirichlet distribution for discrete variables and the Gaussian-inverse gamma distribution for continuous variables, given...... a configuration of the discrete parents. We assume parameter independence and complete data. Further, to learn the structure of the network, the network score is deduced. We then develop a local master prior procedure, for deriving parameter priors in these networks. This procedure satisfies parameter...... independence, parameter modularity and likelihood equivalence. Bayes factors to be used in model search are introduced. Finally the methods derived are illustrated by a simple example....

  4. To Search or Not to Search!

    Science.gov (United States)

    Taylor, J. Rodney

    Constitutional guarantees, as provided by the Bill of Rights, are enjoyed by all citizens. This principle applies no less to students with respect to their college or university domicile. Case law on this subject suggests that three questions must be answered to determine the reasonableness of residence searching: (1) by whom the search is…

  5. The Search Performance Evaluation and Prediction in Exploratory Search

    OpenAIRE

    LIU, FEI

    2016-01-01

    The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

  6. Cube search, revisited

    Science.gov (United States)

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

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

  8. Network Monitoring with Nagios

    CERN Document Server

    Dondich, Taylor

    2006-01-01

    Network monitoring can be a complex task to implement and maintain in your IT infrastructure. Nagios, an open-source host, service and network monitoring program can help you streamline your network monitoring tasks and reduce the cost of operation.With this shortcut guide, we'll go over how Nagios fits in the overall network monitoring puzzle. We'll also cover installation and basic usage. Finally, we'll show you how to extend Nagios with other tools to extend functionality.

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

  10. Curriculum Guide: Life Skills Course for Corrections.

    Science.gov (United States)

    Mardell, E. A.

    This curriculum guide outlines modifications to the life skills lessons contained in the Life Skills Coaching Manual prepared by Saskatchewan NewStart. The course changes are based on adult education experience at a penitentiary, a literature search, and interviews with inmates and staff at a correctional institution. As with the correctional…

  11. CCNA Voice Study Guide, Exam 640-460

    CERN Document Server

    Froehlich, Andrew

    2010-01-01

    The ultimate guide to the new CCNA voice network administrator certification exam. The new CCNA Voice exam tests candidates on their ability to implement a Cisco VoIP solution. Network administrators of voice systems will appreciate that the CCNA Voice Study Guide focuses completely on the information required by the exam. Along with hands-on labs and an objective map showing where each objective is covered, this guide includes a CD with the Sybex Test Engine, flashcards, and entire book in PDF format.: The new CCNA Voice certification will be valuable for administrators of voice network syste

  12. Bayesian networks in overlay recipe optimization

    Science.gov (United States)

    Binns, Lewis A.; Reynolds, Greg; Rigden, Timothy C.; Watkins, Stephen; Soroka, Andrew

    2005-05-01

    Currently, overlay measurements are characterized by "recipe", which defines both physical parameters such as focus, illumination et cetera, and also the software parameters such as algorithm to be used and regions of interest. Setting up these recipes requires both engineering time and wafer availability on an overlay tool, so reducing these requirements will result in higher tool productivity. One of the significant challenges to automating this process is that the parameters are highly and complexly correlated. At the same time, a high level of traceability and transparency is required in the recipe creation process, so a technique that maintains its decisions in terms of well defined physical parameters is desirable. Running time should be short, given the system (automatic recipe creation) is being implemented to reduce overheads. Finally, a failure of the system to determine acceptable parameters should be obvious, so a certainty metric is also desirable. The complex, nonlinear interactions make solution by an expert system difficult at best, especially in the verification of the resulting decision network. The transparency requirements tend to preclude classical neural networks and similar techniques. Genetic algorithms and other "global minimization" techniques require too much computational power (given system footprint and cost requirements). A Bayesian network, however, provides a solution to these requirements. Such a network, with appropriate priors, can be used during recipe creation / optimization not just to select a good set of parameters, but also to guide the direction of search, by evaluating the network state while only incomplete information is available. As a Bayesian network maintains an estimate of the probability distribution of nodal values, a maximum-entropy approach can be utilized to obtain a working recipe in a minimum or near-minimum number of steps. In this paper we discuss the potential use of a Bayesian network in such a capacity

  13. COATING ALTERNATIVES GUIDE (CAGE) USER'S GUIDE

    Science.gov (United States)

    The guide provides instructions for using the Coating Alternatives GuidE (CAGE) software program, version 1.0. It assumes that the user is familiar with the fundamentals of operating an IBM-compatible personal computer (PC) under the Microsoft disk operating system (MS-DOS). CAGE...

  14. Integrated vs. Federated Search

    DEFF Research Database (Denmark)

    Løvschall, Kasper

    2009-01-01

    Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009.......Oplæg om forskelle og ligheder mellem integrated og federated search i bibliotekskontekst. Holdt ved temadag om "Integrated Search - samsøgning i alle kilder" på Danmarks Biblioteksskole den 22. januar 2009....

  15. Dimensionality reduction in translational noninvariant wave guides

    Science.gov (United States)

    Voo, Khee-Kyun

    2009-01-01

    A scheme to reduce translational noninvariant quasi-one-dimensional wave guides into singly or multiply connected one-dimensional (1D) lines is proposed. It is meant to simplify the analysis of wave guides, with the low-energy properties of the guides preserved. Guides comprising uniform-cross-sectional sections and discontinuities such as bends and branching junctions are considered. The uniform sections are treated as 1D lines, and the discontinuities are described by equations sets connecting the wave functions on the lines. The procedures to derive the equations and to solve reduced systems are illustrated by examples, and the scheme is found to apply when the discontinuities are distant and the energy is low. When the scheme applies, it may substantially simplify the analysis of a wave guide, and hence the scheme may find uses in the study of related problems, such as quantum wire networks.

  16. The Information Search

    Science.gov (United States)

    Doraiswamy, Uma

    2011-01-01

    This paper in the form of story discusses a college student's information search process. In this story we see Kuhlthau's information search process: initiation, selection, exploration, formulation, collection, and presentation. Katie is a student who goes in search of information for her class research paper. Katie's class readings, her interest…

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

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

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

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

    NARCIS (Netherlands)

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

    2005-01-01

    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

  1. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

    Other applications of statistical physics (networks, traffic flows, algorithmic problems, econophysics, astrophysical applications, etc.) ... of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results.

  2. Search Results | Page 792 | IDRC - International Development ...

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

    Search Results. Showing 7911 - 7920 of 8491 results. Research in Action. TECHNOLOGICAL CHANGE Access to ICT Networking. The future of Africa is mobile. Research in Action. Movers and shakers: David M. Malone. Research in Action. Social assistance. Selling security to the poor. Research in Action. Justice and ...

  3. Asymptotic analysis for personalized web search

    NARCIS (Netherlands)

    Volkovich, Y.; Litvak, Nelli

    2010-01-01

    PageRank with personalization is used in Web search as an importance measure for Web documents. The goal of this paper is to characterize the tail behavior of the PageRank distribution in the Web and other complex networks characterized by power laws. To this end, we model the PageRank as a solution

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

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

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

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

  8. Keyword Search in Databases

    CERN Document Server

    Yu, Jeffrey Xu; Chang, Lijun

    2009-01-01

    It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from

  9. K-12 Local Network (LAN) Design Guide

    National Research Council Canada - National Science Library

    Horton, Cody

    1998-01-01

    ...) educators preparing to design and implement LANs in K-12 schools and libraries. Data was collected during the implementation of LANs in K-12 schools of the Monterey Peninsula Uniform School District (MPUSD...

  10. Search for the top quark using multivariate analysis techniques

    International Nuclear Information System (INIS)

    Bhat, P.C.

    1994-08-01

    The D0 collaboration is developing top search strategies using multivariate analysis techniques. We report here on applications of the H-matrix method to the eμ channel and neural networks to the e+jets channel

  11. Optimal PMU placement using Iterated Local Search

    Energy Technology Data Exchange (ETDEWEB)

    Hurtgen, M.; Maun, J.-C. [Universite Libre de Bruxelles, Avenue F. Roosevelt 50, B-1050 Brussels (Belgium)

    2010-10-15

    An essential tool for power system monitoring is state estimation. Using PMUs can greatly improve the state estimation process. However, for state estimation, the PMUs should be placed appropriately in the network. The problem of optimal PMU placement for full observability is analysed in this paper. The objective of the paper is to minimise the size of the PMU configuration while allowing full observability of the network. The method proposed initially suggests a PMU distribution which makes the network observable. The Iterated Local Search (ILS) metaheuristic is then used to minimise the size of the PMU configuration needed to observe the network. The algorithm is tested on IEEE test networks with 14, 57 and 118 nodes and compared to the results obtained in previous publications. (author)

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

  13. Using ontologies to model human navigation behavior in information networks: A study based on Wikipedia.

    Science.gov (United States)

    Lamprecht, Daniel; Strohmaier, Markus; Helic, Denis; Nyulas, Csongor; Tudorache, Tania; Noy, Natalya F; Musen, Mark A

    The need to examine the behavior of different user groups is a fundamental requirement when building information systems. In this paper, we present Ontology-based Decentralized Search (OBDS), a novel method to model the navigation behavior of users equipped with different types of background knowledge. Ontology-based Decentralized Search combines decentralized search, an established method for navigation in social networks, and ontologies to model navigation behavior in information networks. The method uses ontologies as an explicit representation of background knowledge to inform the navigation process and guide it towards navigation targets. By using different ontologies, users equipped with different types of background knowledge can be represented. We demonstrate our method using four biomedical ontologies and their associated Wikipedia articles. We compare our simulation results with base line approaches and with results obtained from a user study. We find that our method produces click paths that have properties similar to those originating from human navigators. The results suggest that our method can be used to model human navigation behavior in systems that are based on information networks, such as Wikipedia. This paper makes the following contributions: (i) To the best of our knowledge, this is the first work to demonstrate the utility of ontologies in modeling human navigation and (ii) it yields new insights and understanding about the mechanisms of human navigation in information networks.

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

  15. Cecil Cereal's Supermarket Search. Teacher's Guide [and] Student Materials.

    Science.gov (United States)

    Estes, Cynthia

    The document presents objectives, teaching methods, activities, and work sheets for a unit on choosing breakfast cereal. The unit is intended to be used as an integral part of the fifth grade health program. Activities take place in a classroom learning center and can be completed in approximately four to six hours of classroom time. Objectives…

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

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

  18. A Mathematical and Sociological Analysis of Google Search Algorithm

    Science.gov (United States)

    2013-01-16

    available through the world wide web , a search engine or similar ser- vice is now absolutely necessary in order to find relevant information on-line. About 12...and its computation. See [25], [16], [9], [8], [31], [32] and a recent survey in [2]. The search algorithm also becomes a very useful tool in many Web ...search technologies such as spam detection, crawler configuration, trust networks, and etc.. and find many applications in [12], [13] and etc.. Today

  19. Adaptive Large Neighbourhood Search

    DEFF Research Database (Denmark)

    Røpke, Stefan

    Large neighborhood search is a metaheuristic that has gained popularity in recent years. The heuristic repeatedly moves from solution to solution by first partially destroying the solution and then repairing it. The best solution observed during this search is presented as the final solution....... This tutorial introduces the large neighborhood search metaheuristic and the variant adaptive large neighborhood search that dynamically tunes parameters of the heuristic while it is running. Both heuristics belong to a broader class of heuristics that are searching a solution space using very large...... neighborhoods. The tutorial also present applications of the adaptive large neighborhood search, mostly related to vehicle routing problems for which the heuristic has been extremely successful. We discuss how the heuristic can be parallelized and thereby take advantage of modern desktop computers...

  20. University Students' Online Information Searching Strategies in Different Search Contexts

    Science.gov (United States)

    Tsai, Meng-Jung; Liang, Jyh-Chong; Hou, Huei-Tse; Tsai, Chin-Chung

    2012-01-01

    This study investigates the role of search context played in university students' online information searching strategies. A total of 304 university students in Taiwan were surveyed with questionnaires in which two search contexts were defined as searching for learning, and searching for daily life information. Students' online search strategies…

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

    Science.gov (United States)

    Nahum, Yoav

    2008-02-01

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

  2. Mobile Search and Advertising

    OpenAIRE

    Lovitskii, Vladimir; McCaffery, Colin; Thrasher, Michael; Traynor, David; Wright, Peter

    2009-01-01

    Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a general rule such search result exceed 1...

  3. Mastering ElasticSearch

    CERN Document Server

    Kuc, Rafal

    2013-01-01

    A practical tutorial that covers the difficult design, implementation, and management of search solutions.Mastering ElasticSearch is aimed at to intermediate users who want to extend their knowledge about ElasticSearch. The topics that are described in the book are detailed, but we assume that you already know the basics, like the query DSL or data indexing. Advanced users will also find this book useful, as the examples are getting deep into the internals where it is needed.

  4. ElasticSearch cookbook

    CERN Document Server

    Paro, Alberto

    2013-01-01

    Written in an engaging, easy-to-follow style, the recipes will help you to extend the capabilities of ElasticSearch to manage your data effectively.If you are a developer who implements ElasticSearch in your web applications, manage data, or have decided to start using ElasticSearch, this book is ideal for you. This book assumes that you've got working knowledge of JSON and Java

  5. CNN Newsroom Classroom Guides. April 1-29, 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 April 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) peace in the Middle East, Tom Bradley, and minority superheroes (April 1);…

  6. Google Power Search

    CERN Document Server

    Spencer, Stephan

    2011-01-01

    Behind Google's deceptively simple interface is immense power for both market and competitive research-if you know how to use it well. Sure, basic searches are easy, but complex searches require specialized skills. This concise book takes you through the full range of Google's powerful search-refinement features, so you can quickly find the specific information you need. Learn techniques ranging from simple Boolean logic to URL parameters and other advanced tools, and see how they're applied to real-world market research examples. Incorporate advanced search operators such as filetype:, intit

  7. Supersymmetry searches at CMS

    Directory of Open Access Journals (Sweden)

    Bargassa Pedrame

    2014-04-01

    Full Text Available The accumulation of 19 fb−1 of data at 8 TeV has been a unique window for Supersymmetry searches at the LHC, allowing the CMS collaboration to search for specific supersymmetric particles. This article covers the search for supersymmetric particles in a variety of production-and decay-modes as well as channels. It focuses on the search for the lightest scalar top (stop in the single lepton channel, stop which might be the only observable in the case where Supersymmetry is realized in nature, and which can play a unique role in “naturalness”

  8. Exotic Higgs searches

    CERN Document Server

    Pelliccioni, Mario

    2016-01-01

    Exotic Higgs searches cover a wide range of signatures, thus leading to indications to new physics beyond Standard Model. We report a review on exotic Higgs searches for lepton flavour violating Higgs decays, for "mono-Higgs" searches, for Higgs decays to invisible and for high mass Higgs searches. Both ATLAS and CMS results will be shown, for Run-1 data statistics collected at the energy of $\\sqrt s$ = 7,8 TeV and for the first data collected during Run-2 phase at the energy of $\\sqrt s$ = 13 TeV.

  9. Unstoppable, sbottomless sfermion searches

    Science.gov (United States)

    Trigger, Isabel

    Results are presented from searches by the LEP collaborations for scalar partners of leptons and light quarks in the context of the Minimal Supersymmetric Standard Model (MSSM). Examples shown are searches by OPAL for events with two leptons and significant missing transverse momentum and events with anomalous dE/dx, L3 searches for mass-degenerate squarks and for single electrons, and a DELPHI search for staus of mass less than MZ0/2. No evidence is observed for any signal indicating physics beyond the Standard Model (SM). Limits are shown in the context of a constrained MSSM (CMSSM).

  10. Unstoppable, bottomless sfermion searches

    Energy Technology Data Exchange (ETDEWEB)

    Trigger, Isabel [CERN (Switzerland)

    2004-07-01

    Results are presented from searches by the LEP collaborations for scalar partners of leptons and light quarks in the context of the Minimal Supersymmetric Standard Model (MSSM). Examples shown are searches by OPAL for events with two leptons and significant missing transverse momentum and events with anomalous dE/dx, L3 searches for mass-degenerate squarks and for single electrons, and a DELPHI search for staus of mass less than M{sub Z{sup 0/2}}. No evidence is observed for any signal indicating physics beyond the Standard Model (SM). Limits are shown in the context of a constrained MSSM (CMSSM). (orig.)

  11. Unstoppable, bottomless sfermion searches

    International Nuclear Information System (INIS)

    Trigger, Isabel

    2004-01-01

    Results are presented from searches by the LEP collaborations for scalar partners of leptons and light quarks in the context of the Minimal Supersymmetric Standard Model (MSSM). Examples shown are searches by OPAL for events with two leptons and significant missing transverse momentum and events with anomalous dE/dx, L3 searches for mass-degenerate squarks and for single electrons, and a DELPHI search for staus of mass less than M Z 0 /2. No evidence is observed for any signal indicating physics beyond the Standard Model (SM). Limits are shown in the context of a constrained MSSM (CMSSM). (orig.)

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

  13. Guide to Professional Radio & TV Newscasting.

    Science.gov (United States)

    Siller, Robert C.

    Written for those who want to get started in the field of broadcast journalism, this practical self-study guide discusses all the basic elements needed and shows how the professionals on both local and network levels prepare for a newscast. The content encompasses how a newsman writes his copy, how he "plays" his story, and how writing style is…

  14. CNN Newsroom Classroom Guides, June 2002.

    Science.gov (United States)

    Cable News Network, Atlanta, GA.

    These classroom guides, designed to accompany the daily CNN (Cable News Network) Newsroom broadcasts for the month of June 2002, provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Major topics covered include: the Kashmir conflict; the Pakistan and the Kazahkstan Summit;…

  15. CNN Newsroom Classroom Guides, July 2000.

    Science.gov (United States)

    Cable News Network, Atlanta, GA.

    These classroom guides, designed to accompany the daily CNN (Cable News Network) Newsroom broadcasts for the month of July 2000, provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Top stories include: Mexican voters go to polls in a landmark election (July 3); Mexico's…

  16. CNN Newsroom Classroom Guides, September 2001.

    Science.gov (United States)

    Cable News Network, Atlanta, GA.

    These classroom guides, designed to accompany the daily CNN (Cable News Network) Newsroom broadcasts for the month of September 2001 provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Top stories include: shark attacks ignite controversy in some Florida communities,…

  17. CNN Newsroom Classroom Guides, July 2001.

    Science.gov (United States)

    Cable News Network, Atlanta, GA.

    These classroom guides, designed to accompany the daily CNN (Cable News Network) Newsroom broadcasts for the month of July 2001 provide program rundowns, suggestions for class activities and discussion, student handouts, and a list of related news terms. Top stories include: Slobodan Milosevic prepares to go before the U.N. war crimes tribunal,…

  18. Nonsequential search equilibrium with search cost heterogeneity

    NARCIS (Netherlands)

    Moraga-Gonzalez, Jose Luis; Sandor, Zsolt; Wildenbeest, Matthijs R.

    We generalize the model of Burdett and Judd (1983) to the case where an arbitrary finite number of firms sells a homogeneous good to buyers who have heterogeneous search costs. We show that a price dispersed symmetric Nash equilibrium always exists. Numerical results show that the behavior of prices

  19. Citation Searching: Search Smarter & Find More

    Science.gov (United States)

    Hammond, Chelsea C.; Brown, Stephanie Willen

    2008-01-01

    The staff at University of Connecticut are participating in Elsevier's Student Ambassador Program (SAmP) in which graduate students train their peers on "citation searching" research using Scopus and Web of Science, two tremendous citation databases. They are in the fourth semester of these training programs, and they are wildly successful: They…

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

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

  2. Improved cuckoo search with particle swarm optimization for ...

    Indian Academy of Sciences (India)

    work are NP hard, a hybrid Particle Swarm Optimization (PSO) – Cuckoo Search algorithm (CS) is proposed to optimize the learning rate of the neural network. Keywords. Content based image retrieval (CBIR); image compression; partial recurrent neural network (PRNN); particle swarm optimization (PSO); HAAR wavelet;.

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

  4. "Family Guides" to Timely Topics in Space Science

    Science.gov (United States)

    Morrow, C.; McLain, B.; Wilkerson, A.; Garvin-Doxas, K.; Dyches, P.

    We have undertaken the development, field testing, and dissemination of a new series of ``Family Guides'' on timely topics of notable interest in space science and astronomy. Each Guide includes an innovative collection of puzzles, pictures, poetry, and projects, all designed to stimulate enjoyable co-learning, inquiry-based experiences between kids aged 6-12 and the caring adults in their lives. The Guides are primarily intended for use in informal educational settings, including at home, with after-school programs, in youth groups, and in programs for children, school-groups, or families that are conducted in museums, planetariums, and nature centers. We are learning that classroom teachers also express interest in the Guide's activities as a means to engage students attention toward more formal lessons. The Guides endeavor to be accessible to those who are not familiar with astronomy. They provide background on questions commonly asked by children. The interactive activities challenge common misconceptions. The Guides' also coach adults how to lead inquiry with kids instead of telling or prescribing answers. The Guides' resource sections provide leads to more information and additional products related to family learning. We released the field test version of the Family Guide to the Sun in late summer 2003. In January 2004 we released the field test version of the Family Guide to Mars in time for use with educational programs associated with the Mars Exploration Rover landings. We are in the planning stages for a Family Guide to Saturn and for a Family Guide to the Search for Life Elsewhere. These later Guides will build on the base of understanding we construct from the field testing of the earlier Guides. This paper will provide details of the Guides' contents as well as results from field testing in various educational settings. We are proposing for funds to translate the Family Guide to Mars and the Family Guide the Sun into both French and Spanish.

  5. Agrosearch: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  6. Africa Development: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  7. African Anthropologist: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  8. Biokemistri: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  9. Acta Structilia: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  10. Measuring Online Search Expertise

    Science.gov (United States)

    Bailey, Earl

    2017-01-01

    Search expertise has long been studied and used extensively in information seeking behavior research, both as a fundamental concept and as a method of comparing groups of users. Unfortunately, while search expertise has been studied for some time, the conceptualization of it has lagged behind its use in categorizing users. This has led to users…

  11. Ergonomics SA: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  12. Agronomie Africaine: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  13. Mathematics Connection: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  14. Critical Arts: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  15. Rwanda Journal: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  16. Kenya Veterinarian: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  17. Supporting complex search tasks

    DEFF Research Database (Denmark)

    Gäde, Maria; Hall, Mark; Huurdeman, Hugo

    2015-01-01

    introductory to specialized, and from authoritative to speculative or opinionated, when to show what sources of information? How does the information seeking process evolve and what are relevant differences between different stages? With complex task and search process management, blending searching, browsing...

  18. Innovation: Advanced Search

    African Journals Online (AJOL)

    Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...

  19. Distributed Deep Web Search

    NARCIS (Netherlands)

    Tjin-Kam-Jet, Kien

    2013-01-01

    The World Wide Web contains billions of documents (and counting); hence, it is likely that some document will contain the answer or content you are searching for. While major search engines like Bing and Google often manage to return relevant results to your query, there are plenty of situations in

  20. Search and switching costs

    NARCIS (Netherlands)

    Siekman, Wilhelm Henricus

    2016-01-01

    This thesis analyses markets with search and with switching costs. It provides insights in several important issues in search markets, including how loss aversion may affect consumer behavior and firm conduct, and how prices, welfare, and profits may change when an intermediating platform orders