Science.gov

Sample records for setting network eaprasnet

  1. Network Attack Reference Data Set

    DTIC Science & Technology

    2004-12-01

    services they offer. When the attacker attempts to access system services in order to determine which are available, the scan is called a “ portscan ”. Network...Scans The following portscans were crafted using simPortScan.cc (Appendix B.2). Filename: scan V TCP fast seq small.tcp Source: Crafted...Stealthy Portscans . Journal of Computer Security, 10, 105–136. 6. Yegneswaran, V., Barford, P., and Ullrich, J. (2003). Internet Intrusions: Global

  2. Best Friend Networks of Children across Settings.

    ERIC Educational Resources Information Center

    Ray, Glen E.; And Others

    1995-01-01

    Investigated children's classroom sociometry and size of their best-friend networks. For both classroom and playground settings, popular children had the most reciprocal best friends, while rejected children had the fewest, but had more on the playground than in the classroom. Results suggest that constraints and opportunities of different…

  3. Local Area Networks in the School Setting.

    ERIC Educational Resources Information Center

    Bluhm, Harry P.

    1986-01-01

    Defines local area networks (LANs); describes basic components and configurations of LANs; and discusses LANs benefits (reduced costs, better management of computer resources, enhanced communications) and pitfalls (hidden costs, time delays, network maintenance, lack of standardization, network security breaches, lack of network compatible…

  4. Securing Mobile Networks in an Operational Setting

    NASA Technical Reports Server (NTRS)

    Ivancic, William D.; Stewart, David H.; Bell, Terry L.; Paulsen, Phillip E.; Shell, Dan

    2004-01-01

    This paper describes a network demonstration and three month field trial of mobile networking using mobile-IPv4. The network was implemented as part of the US Coast Guard operational network which is a ".mil" network and requires stringent levels of security. The initial demonstrations took place in November 2002 and a three month field trial took place from July through September of 2003. The mobile network utilized encryptors capable of NSA-approved Type 1 algorithms, mobile router from Cisco Systems and 802.11 and satellite wireless links. This paper also describes a conceptual architecture for wide-scale deployment of secure mobile networking in operational environments where both private and public infrastructure is used. Additional issues presented include link costs, placement of encryptors and running routing protocols over layer-3 encryption devices.

  5. Interneurons set the tune of developing networks.

    PubMed

    Ben-Ari, Yehezkel; Khalilov, Ilgam; Represa, Alfonso; Gozlan, Henri

    2004-07-01

    Despite a rather long migratory journey, interneurons are functional before vertically migrating pyramidal neurons and they constitute the source and target of the first functional synapses in the developing hippocampus. Interneuron-driven network patterns are already present in utero while principal cells are mostly quiescent. At that early stage, GABAergic synapses--which are formed before glutamatergic ones--are excitatory, suggesting that GABA is a pioneer, much like the neurons from which it is released. This review discusses this sequence of events, its functional significance and the role that interneurons might play in the construction of cortical networks.

  6. Edge union of networks on the same vertex set

    NASA Astrophysics Data System (ADS)

    Loe, Chuan Wen; Jeldtoft Jensen, Henrik

    2013-06-01

    Random network generators such as Erdős-Rényi, Watts-Strogatz and Barabási-Albert models are used as models to study real-world networks. Let G1(V, E1) and G2(V, E2) be two such networks on the same vertex set V. This paper studies the degree distribution and clustering coefficient of the resultant networks, G(V, E1∪E2).

  7. Exploring empowerment in settings: mapping distributions of network power.

    PubMed

    Neal, Jennifer Watling

    2014-06-01

    This paper brings together two trends in the empowerment literature-understanding empowerment in settings and understanding empowerment as relational-by examining what makes settings empowering from a social network perspective. Specifically, extending Neal and Neal's (Am J Community Psychol 48(3/4):157-167, 2011) conception of network power, an empowering setting is defined as one in which (1) actors have existing relationships that allow for the exchange of resources and (2) the distribution of network power among actors in the setting is roughly equal. The paper includes a description of how researchers can examine distributions of network power in settings. Next, this process is illustrated in both an abstract example and using empirical data on early adolescents' peer relationships in urban classrooms. Finally, implications for theory, methods, and intervention related to understanding empowering settings are explored.

  8. Education through telemedicine networks: setting quality standards.

    PubMed

    Shershneva, Marianna B; Olson, Curtis A

    2005-01-01

    Quality standards for educational programming have received limited attention in telemedicine. We selected five sets of standards from the distance education literature established by: (1) the American Council on Education; (2) the American Distance Education Consortium; (3) the Council of Regional Accrediting Commissions; (4) the Distance Education and Training Council; (5) the Innovations in Distance Education Project. The standards were reviewed to determine the purposes they were intended to serve and the process by which they were established. The content of the five sets of standards were summarized around the 'four commonplaces' of education: learner, teacher, curriculum and context. Four major findings emerged. First, none of the sets of standards addresses all of the issues that are potentially relevant to telemedicine education; all emphasize certain topics while neglecting others. Second, there are some important aspects of telemedicine that are not addressed at all, such as patient confidentiality. Third, the standards generally provide a framework for defining high quality in distance education, leaving to those at the local level the task of deciding how a standard applies in their setting. Finally, the standards reviewed have many elements that could potentially apply to telemedicine education. Setting quality standards for education through telemedicine requires a systematic approach and a means for continuous improvement of those standards.

  9. Modelling gene and protein regulatory networks with answer set programming.

    PubMed

    Fayruzov, Timur; Janssen, Jeroen; Vermeir, Dirk; Cornelis, Chris; De Cock, Martine

    2011-01-01

    Recently, many approaches to model regulatory networks have been proposed in the systems biology domain. However, the task is far from being solved. In this paper, we propose an Answer Set Programming (ASP)-based approach to model interaction networks. We build a general ASP framework that describes the network semantics and allows modelling specific networks with little effort. ASP provides a rich and flexible toolbox that allows expanding the framework with desired features. In this paper, we tune our framework to mimic Boolean network behaviour and apply it to model the Budding Yeast and Fission Yeast cell cycle networks. The obtained steady states of these networks correspond to those of the Boolean networks.

  10. Dominating sets and ego-centered decompositions in social networks

    NASA Astrophysics Data System (ADS)

    Boudourides, M. A.; Lenis, S. T.

    2016-09-01

    Our aim here is to address the problem of decomposing a whole network into a minimal number of ego-centered subnetworks. For this purpose, the network egos are picked out as the members of a minimum dominating set of the network. However, to find such an efficient dominating ego-centered construction, we need to be able to detect all the minimum dominating sets and to compare all the corresponding dominating ego-centered decompositions of the network. To find all the minimum dominating sets of the network, we are developing a computational heuristic, which is based on the partition of the set of nodes of a graph into three subsets, the always dominant vertices, the possible dominant vertices and the never dominant vertices, when the domination number of the network is known. To compare the ensuing dominating ego-centered decompositions of the network, we are introducing a number of structural measures that count the number of nodes and links inside and across the ego-centered subnetworks. Furthermore, we are applying the techniques of graph domination and ego-centered decomposition for six empirical social networks.

  11. Connected Dominating Set Based Topology Control in Wireless Sensor Networks

    ERIC Educational Resources Information Center

    He, Jing

    2012-01-01

    Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…

  12. Weight prediction in complex networks based on neighbor set

    NASA Astrophysics Data System (ADS)

    Zhu, Boyao; Xia, Yongxiang; Zhang, Xue-Jun

    2016-12-01

    Link weights are essential to network functionality, so weight prediction is important for understanding weighted networks given incomplete real-world data. In this work, we develop a novel method for weight prediction based on the local network structure, namely, the set of neighbors of each node. The performance of this method is validated in two cases. In the first case, some links are missing altogether along with their weights, while in the second case all links are known and weight information is missing for some links. Empirical experiments on real-world networks indicate that our method can provide accurate predictions of link weights in both cases.

  13. A mesoscopic network model for permanent set in crosslinked elastomers

    SciTech Connect

    Weisgraber, T H; Gee, R H; Maiti, A; Clague, D S; Chinn, S; Maxwell, R S

    2009-01-29

    A mesoscopic computational model for polymer networks and composites is developed as a coarse-grained representation of the composite microstructure. Unlike more complex molecular dynamics simulations, the model only considers the effects of crosslinks on mechanical behavior. The elastic modulus, which depends only on the crosslink density and parameters in the bond potential, is consistent with rubber elasticity theory, and the network response satisfies the independent network hypothesis of Tobolsky. The model, when applied to a commercial filled silicone elastomer, quantitatively reproduces the experimental permanent set and stress-strain response due to changes in the crosslinked network from irradiation.

  14. Weight prediction in complex networks based on neighbor set

    PubMed Central

    Zhu, Boyao; Xia, Yongxiang; Zhang, Xue-Jun

    2016-01-01

    Link weights are essential to network functionality, so weight prediction is important for understanding weighted networks given incomplete real-world data. In this work, we develop a novel method for weight prediction based on the local network structure, namely, the set of neighbors of each node. The performance of this method is validated in two cases. In the first case, some links are missing altogether along with their weights, while in the second case all links are known and weight information is missing for some links. Empirical experiments on real-world networks indicate that our method can provide accurate predictions of link weights in both cases. PMID:27905497

  15. Designing application software in wide area network settings

    NASA Technical Reports Server (NTRS)

    Makpangou, Mesaac; Birman, Ken

    1990-01-01

    Progress in methodologies for developing robust local area network software has not been matched by similar results for wide area settings. The design of application software spanning multiple local area environments is examined. For important classes of applications, simple design techniques are presented that yield fault tolerant wide area programs. An implementation of these techniques as a set of tools for use within the ISIS system is described.

  16. Analysis of Gene Sets Based on the Underlying Regulatory Network

    PubMed Central

    Michailidis, George

    2009-01-01

    Abstract Networks are often used to represent the interactions among genes and proteins. These interactions are known to play an important role in vital cell functions and should be included in the analysis of genes that are differentially expressed. Methods of gene set analysis take advantage of external biological information and analyze a priori defined sets of genes. These methods can potentially preserve the correlation among genes; however, they do not directly incorporate the information about the gene network. In this paper, we propose a latent variable model that directly incorporates the network information. We then use the theory of mixed linear models to present a general inference framework for the problem of testing the significance of subnetworks. Several possible test procedures are introduced and a network based method for testing the changes in expression levels of genes as well as the structure of the network is presented. The performance of the proposed method is compared with methods of gene set analysis using both simulation studies, as well as real data on genes related to the galactose utilization pathway in yeast. PMID:19254181

  17. Evaluation of social network user sentiments based on fuzzy sets

    NASA Astrophysics Data System (ADS)

    Luneva, E. E.; Banokin, P. I.; Yefremov, A. A.

    2015-10-01

    The article introduces social network user sentiment evaluation with proposed technique based on fuzzy sets. The advantage of proposed technique consists in ability to take into account user's influence as well as the fact that a user could be an author of several messages. Results presented in this paper can be used in mechanical engineering to analyze reviews on products as well as in robotics for developing user communication interface. The paper contains experimental data and shows the steps of sentiment value calculation of resulting messages on a certain topic. Application of proposed technique is demonstrated on experimental data from Twitter social network.

  18. On correlated reaction sets and coupled reaction sets in metabolic networks.

    PubMed

    Marashi, Sayed-Amir; Hosseini, Zhaleh

    2015-08-01

    Two reactions are in the same "correlated reaction set" (or "Co-Set") if their fluxes are linearly correlated. On the other hand, two reactions are "coupled" if nonzero flux through one reaction implies nonzero flux through the other reaction. Flux correlation analysis has been previously used in the analysis of enzyme dysregulation and enzymopathy, while flux coupling analysis has been used to predict co-expression of genes and to model network evolution. The goal of this paper is to emphasize, through a few examples, that these two concepts are inherently different. In other words, except for the case of full coupling, which implies perfect correlation between two fluxes (R(2) = 1), there are no constraints on Pearson correlation coefficients (CC) in case of any other type of (un)coupling relations. In other words, Pearson CC can take any value between 0 and 1 in other cases. Furthermore, by analyzing genome-scale metabolic networks, we confirm that there are some examples in real networks of bacteria, yeast and human, which approve that flux coupling and flux correlation cannot be used interchangeably.

  19. Identifying a set of influential spreaders in complex networks

    NASA Astrophysics Data System (ADS)

    Zhang, Jian-Xiong; Chen, Duan-Bing; Dong, Qiang; Zhao, Zhi-Dan

    2016-06-01

    Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency.

  20. Identifying a set of influential spreaders in complex networks

    PubMed Central

    Zhang, Jian-Xiong; Chen, Duan-Bing; Dong, Qiang; Zhao, Zhi-Dan

    2016-01-01

    Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency. PMID:27296252

  1. Products pipeline network plans set out for North Yemen

    SciTech Connect

    Venus, C.

    1984-02-13

    The growth of oil-products demand in future years is leading the Yemen Arab Republic (Y.A.R.) to improve the distribution network for the products by constructing a pipeline system. Petroleum products are currently distributed by road tankers only between the receiving terminals and the main cities, which represent the most important consumption centers, together with new industrial plants such as cement factories, power plants, etc. The technical design and economic and financial feasibility study of the project was entrusted to Omnium Technique des Transports par Pipelines (OTP). The scope covers the setting up in the Y.A.R. of the basic equipment for the supply, storage, and land transportation of petroleum products with a view to: Meeting the national demand for the next 25 years. Providing an adequate strategic reserve of petroleum products with a total storage capacity amounting to 3 months of consumption. The only exception in the transportation of the petroleum products will involve heavy fuel oil which will continue to be transported by road tankers. This article describes the basic facilities which have to be installed before the start-up of the projected network. The project includes a marine terminal in Salif and a pipeline to Sana'a with the related storage, truck loading, and pumping facilities for white products and gas oil which will be transported by pipeline.

  2. Permitted and forbidden sets in discrete-time linear threshold recurrent neural networks.

    PubMed

    Yi, Zhang; Zhang, Lei; Yu, Jiali; Tan, Kok Kiong

    2009-06-01

    The concepts of permitted and forbidden sets enable a new perspective of the memory in neural networks. Such concepts exhibit interesting dynamics in recurrent neural networks. This paper studies the basic theories of permitted and forbidden sets of the linear threshold discrete-time recurrent neural networks. The linear threshold transfer function has been regarded as an adequate transfer function for recurrent neural networks. Networks with this transfer function form a class of hybrid analog and digital networks which are especially useful for perceptual computations. Networks in discrete time can directly provide algorithms for efficient implementation in digital hardware. The main contribution of this paper is to establish foundations of permitted and forbidden sets. Necessary and sufficient conditions for the linear threshold discrete-time recurrent neural networks are obtained for complete convergence, existence of permitted and forbidden sets, as well as conditionally multiattractivity, respectively. Simulation studies explore some possible interesting practical applications.

  3. Setting Up a Public Use Local Area Network.

    ERIC Educational Resources Information Center

    Flower, Eric; Thulstrup, Lisa

    1988-01-01

    Describes a public use microcomputer cluster at the University of Maine, Orono. Various network topologies, hardware and software options, installation problems, system management, and performance are discussed. (MES)

  4. Mesoscopic structures reveal the network between the layers of multiplex data sets.

    PubMed

    Iacovacci, Jacopo; Wu, Zhihao; Bianconi, Ginestra

    2015-10-01

    Multiplex networks describe a large variety of complex systems, whose elements (nodes) can be connected by different types of interactions forming different layers (networks) of the multiplex. Multiplex networks include social networks, transportation networks, or biological networks in the cell or in the brain. Extracting relevant information from these networks is of crucial importance for solving challenging inference problems and for characterizing the multiplex networks microscopic and mesoscopic structure. Here we propose an information theory method to extract the network between the layers of multiplex data sets, forming a "network of networks." We build an indicator function, based on the entropy of network ensembles, to characterize the mesoscopic similarities between the layers of a multiplex network, and we use clustering techniques to characterize the communities present in this network of networks. We apply the proposed method to study the Multiplex Collaboration Network formed by scientists collaborating on different subjects and publishing in the American Physical Society journals. The analysis of this data set reveals the interplay between the collaboration networks and the organization of knowledge in physics.

  5. Mesoscopic structures reveal the network between the layers of multiplex data sets

    NASA Astrophysics Data System (ADS)

    Iacovacci, Jacopo; Wu, Zhihao; Bianconi, Ginestra

    2015-10-01

    Multiplex networks describe a large variety of complex systems, whose elements (nodes) can be connected by different types of interactions forming different layers (networks) of the multiplex. Multiplex networks include social networks, transportation networks, or biological networks in the cell or in the brain. Extracting relevant information from these networks is of crucial importance for solving challenging inference problems and for characterizing the multiplex networks microscopic and mesoscopic structure. Here we propose an information theory method to extract the network between the layers of multiplex data sets, forming a "network of networks." We build an indicator function, based on the entropy of network ensembles, to characterize the mesoscopic similarities between the layers of a multiplex network, and we use clustering techniques to characterize the communities present in this network of networks. We apply the proposed method to study the Multiplex Collaboration Network formed by scientists collaborating on different subjects and publishing in the American Physical Society journals. The analysis of this data set reveals the interplay between the collaboration networks and the organization of knowledge in physics.

  6. Integrating proteomics profiling data sets: a network perspective.

    PubMed

    Bhat, Akshay; Dakna, Mohammed; Mischak, Harald

    2015-01-01

    Understanding disease mechanisms often requires complex and accurate integration of cellular pathways and molecular networks. Systems biology offers the possibility to provide a comprehensive map of the cell's intricate wiring network, which can ultimately lead to decipher the disease phenotype. Here, we describe what biological pathways are, how they function in normal and abnormal cellular systems, limitations faced by databases for integrating data, and highlight how network models are emerging as a powerful integrative framework to understand and interpret the roles of proteins and peptides in diseases.

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

    DOEpatents

    Wyss, Gregory D.

    2000-01-01

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

  8. Social Networking Tools in a University Setting: A Student's Perspective

    ERIC Educational Resources Information Center

    Haytko, Diana L.; Parker, R. Stephen

    2012-01-01

    As Professors, we are challenged to reach ever-changing cohorts of college students as they flow through our classes and our lives. Technological advancements happen daily and we need to decide which, if any, to incorporate into our classrooms. Our students constantly check Facebook, Twitter, MySpace and other online social networks. Should we be…

  9. The Impact of Educational Networking in the Educational Setting

    ERIC Educational Resources Information Center

    Lozano, Melissa Nicole

    2011-01-01

    Society's reliance on technology today has created a demand for more effective ways of communication unlike any before. The need to communicate has made its way from the home to the business world and into the educational setting. This article discusses the historical journey that has landed communication in the classroom. Scholars such as Piaget…

  10. Measuring Social Networks for Medical Research in Lower-Income Settings

    PubMed Central

    Kelly, Laura; Patel, Shivani A.; Narayan, K. M. Venkat; Prabhakaran, Dorairaj; Cunningham, Solveig A.

    2014-01-01

    Social networks are believed to affect health-related behaviors and health. Data to examine the links between social relationships and health in low- and middle-income country settings are limited. We provide guidance for introducing an instrument to collect social network data as part of epidemiological surveys, drawing on experience in urban India. We describe development and fielding of an instrument to collect social network information relevant to health behaviors among adults participating in a large, population-based study of non-communicable diseases in Delhi, India. We discuss basic characteristics of social networks relevant to health including network size, health behaviors of network partners (i.e., network exposures), network homogeneity, network diversity, strength of ties, and multiplexity. Data on these characteristics can be collected using a short instrument of 11 items asked about up to 5 network members and 3 items about the network generally, administered in approximately 20 minutes. We found high willingness to respond to questions about social networks (97% response). Respondents identified an average of 3.8 network members, most often relatives (80% of network ties), particularly blood relationships. Ninety-one percent of respondents reported that their primary contacts for discussing health concerns were relatives. Among all listed ties, 91% of most frequent snack partners and 64% of exercise partners in the last two weeks were relatives. These results demonstrate that family relationships are the crux of social networks in some settings, including among adults in urban India. Collecting basic information about social networks can be feasibly and effectively done within ongoing epidemiological studies. PMID:25153127

  11. Identifying generalities in data sets using periodic Hopfield networks : initial status report.

    SciTech Connect

    Link, Hamilton E.; Backer, Alejandro

    2004-12-01

    We present a novel class of dynamic neural networks that is capable of learning, in an unsupervised manner, attractors that correspond to generalities in a data set. Upon presentation of a test stimulus, the networks follow a sequence of attractors that correspond to subsets of increasing size or generality in the original data set. The networks, inspired by those of the insect antennal lobe, build upon a modified Hopfield network in which nodes are periodically suppressed, global inhibition is gradually strengthened, and the weight of input neurons is gradually decreased relative to recurrent connections. This allows the networks to converge on a Hopfield network's equilibrium within each suppression cycle, and to switch between attractors in between cycles. The fast mutually reinforcing excitatory connections that dominate dynamics within cycles ensures the robust error-tolerant behavior that characterizes Hopfield networks. The cyclic inhibition releases the network from what would otherwise be stable equilibriums or attractors. Increasing global inhibition and decreasing dependence on the input leads successive attractors to differ, and to display increasing generality. As the network is faced with stronger inhibition, only neurons connected with stronger mutually excitatory connections will remain on; successive attractors will consist of sets of neurons that are more strongly correlated, and will tend to select increasingly generic characteristics of the data. Using artificial data, we were able to identify configurations of the network that appeared to produce a sequence of increasingly general results. The next logical steps are to apply these networks to suitable real-world data that can be characterized by a hierarchy of increasing generality and observe the network's performance. This report describes the work, data, and results, the current understanding of the results, and how the work could be continued. The code, data, and preliminary results are

  12. Set7 mediated interactions regulate transcriptional networks in embryonic stem cells.

    PubMed

    Tuano, Natasha K; Okabe, Jun; Ziemann, Mark; Cooper, Mark E; El-Osta, Assam

    2016-11-02

    Histone methylation by lysine methyltransferase enzymes regulate the expression of genes implicated in lineage specificity and cellular differentiation. While it is known that Set7 catalyzes mono-methylation of histone and non-histone proteins, the functional importance of this enzyme in stem cell differentiation remains poorly understood. We show Set7 expression is increased during mouse embryonic stem cell (mESC) differentiation and is regulated by the pluripotency factors, Oct4 and Sox2. Transcriptional network analyses reveal smooth muscle (SM) associated genes are subject to Set7-mediated regulation. Furthermore, pharmacological inhibition of Set7 activity confirms this regulation. We observe Set7-mediated modification of serum response factor (SRF) and mono-methylation of histone H4 lysine 4 (H3K4me1) regulate gene expression. We conclude the broad substrate specificity of Set7 serves to control key transcriptional networks in embryonic stem cells.

  13. What Does Love Mean? Exploring Network Culture in Two Network Settings

    ERIC Educational Resources Information Center

    Yeung, King-To

    2005-01-01

    Meaning matters in the way people form social ties. Adopting an unconventional analytic technique--the Galois lattice analysis--I show how network researchers can uncover relational meanings using conventional research techniques (i.e., closed-ended network surveys). Galois lattice analysis also inspires new ways of conceptualizing relational…

  14. Sensitivity analysis of biological Boolean networks using information fusion based on nonadditive set functions

    PubMed Central

    2014-01-01

    Background An algebraic method for information fusion based on nonadditive set functions is used to assess the joint contribution of Boolean network attributes to the sensitivity of the network to individual node mutations. The node attributes or characteristics under consideration are: in-degree, out-degree, minimum and average path lengths, bias, average sensitivity of Boolean functions, and canalizing degrees. The impact of node mutations is assessed using as target measure the average Hamming distance between a non-mutated/wild-type network and a mutated network. Results We find that for a biochemical signal transduction network consisting of several main signaling pathways whose nodes represent signaling molecules (mainly proteins), the algebraic method provides a robust classification of attribute contributions. This method indicates that for the biochemical network, the most significant impact is generated mainly by the combined effects of two attributes: out-degree, and average sensitivity of nodes. Conclusions The results support the idea that both topological and dynamical properties of the nodes need to be under consideration. The algebraic method is robust against the choice of initial conditions and partition of data sets in training and testing sets for estimation of the nonadditive set functions of the information fusion procedure. PMID:25189194

  15. Standardized network order sets in rural Ontario: a follow-up report on successes and sustainability.

    PubMed

    Rawn, Andrea; Wilson, Katrina

    2011-01-01

    Unifying, implementing and sustaining a large order set project requires strategic placement of key organizational professionals to provide ongoing user education, communication and support. This article will outline the successful strategies implemented by the Grey Bruce Health Network, Evidence-Based Care Program to reduce length of stay, increase patient satisfaction and increase the use of best practices resulting in quality outcomes, safer practice and better allocation of resources by using standardized Order Sets within a network of 11 hospital sites. Audits conducted in 2007 and again in 2008 revealed a reduced length of stay of 0.96 in-patient days when order sets were used on admission and readmission for the same or a related diagnosis within one month decreased from 5.5% without order sets to 3.5% with order sets.

  16. Moving Large Data Sets Over High-Performance Long Distance Networks

    SciTech Connect

    Hodson, Stephen W; Poole, Stephen W; Ruwart, Thomas; Settlemyer, Bradley W

    2011-04-01

    In this project we look at the performance characteristics of three tools used to move large data sets over dedicated long distance networking infrastructure. Although performance studies of wide area networks have been a frequent topic of interest, performance analyses have tended to focus on network latency characteristics and peak throughput using network traffic generators. In this study we instead perform an end-to-end long distance networking analysis that includes reading large data sets from a source file system and committing large data sets to a destination file system. An evaluation of end-to-end data movement is also an evaluation of the system configurations employed and the tools used to move the data. For this paper, we have built several storage platforms and connected them with a high performance long distance network configuration. We use these systems to analyze the capabilities of three data movement tools: BBcp, GridFTP, and XDD. Our studies demonstrate that existing data movement tools do not provide efficient performance levels or exercise the storage devices in their highest performance modes. We describe the device information required to achieve high levels of I/O performance and discuss how this data is applicable in use cases beyond data movement performance.

  17. Fine Registration of Kilo-Station Networks - a Modern Procedure for Terrestrial Laser Scanning Data Sets

    NASA Astrophysics Data System (ADS)

    Hullo, J.-F.

    2016-06-01

    We propose a complete methodology for the fine registration and referencing of kilo-station networks of terrestrial laser scanner data currently used for many valuable purposes such as 3D as-built reconstruction of Building Information Models (BIM) or industrial asbuilt mock-ups. This comprehensive target-based process aims to achieve the global tolerance below a few centimetres across a 3D network including more than 1,000 laser stations spread over 10 floors. This procedure is particularly valuable for 3D networks of indoor congested environments. In situ, the use of terrestrial laser scanners, the layout of the targets and the set-up of a topographic control network should comply with the expert methods specific to surveyors. Using parametric and reduced Gauss-Helmert models, the network is expressed as a set of functional constraints with a related stochastic model. During the post-processing phase inspired by geodesy methods, a robust cost function is minimised. At the scale of such a data set, the complexity of the 3D network is beyond comprehension. The surveyor, even an expert, must be supported, in his analysis, by digital and visual indicators. In addition to the standard indicators used for the adjustment methods, including Baarda's reliability, we introduce spectral analysis tools of graph theory for identifying different types of errors or a lack of robustness of the system as well as in fine documenting the quality of the registration.

  18. Characterizing gene sets using discriminative random walks with restart on heterogeneous biological networks

    PubMed Central

    Blatti, Charles; Sinha, Saurabh

    2016-01-01

    Motivation: Analysis of co-expressed gene sets typically involves testing for enrichment of different annotations or ‘properties’ such as biological processes, pathways, transcription factor binding sites, etc., one property at a time. This common approach ignores any known relationships among the properties or the genes themselves. It is believed that known biological relationships among genes and their many properties may be exploited to more accurately reveal commonalities of a gene set. Previous work has sought to achieve this by building biological networks that combine multiple types of gene–gene or gene–property relationships, and performing network analysis to identify other genes and properties most relevant to a given gene set. Most existing network-based approaches for recognizing genes or annotations relevant to a given gene set collapse information about different properties to simplify (homogenize) the networks. Results: We present a network-based method for ranking genes or properties related to a given gene set. Such related genes or properties are identified from among the nodes of a large, heterogeneous network of biological information. Our method involves a random walk with restarts, performed on an initial network with multiple node and edge types that preserve more of the original, specific property information than current methods that operate on homogeneous networks. In this first stage of our algorithm, we find the properties that are the most relevant to the given gene set and extract a subnetwork of the original network, comprising only these relevant properties. We then re-rank genes by their similarity to the given gene set, based on a second random walk with restarts, performed on the above subnetwork. We demonstrate the effectiveness of this algorithm for ranking genes related to Drosophila embryonic development and aggressive responses in the brains of social animals. Availability and Implementation: DRaWR was implemented as

  19. Fuzzy rough sets, and a granular neural network for unsupervised feature selection.

    PubMed

    Ganivada, Avatharam; Ray, Shubhra Sankar; Pal, Sankar K

    2013-12-01

    A granular neural network for identifying salient features of data, based on the concepts of fuzzy set and a newly defined fuzzy rough set, is proposed. The formation of the network mainly involves an input vector, initial connection weights and a target value. Each feature of the data is normalized between 0 and 1 and used to develop granulation structures by a user defined α-value. The input vector and the target value of the network are defined using granulation structures, based on the concept of fuzzy sets. The same granulation structures are also presented to a decision system. The decision system helps in extracting the domain knowledge about data in the form of dependency factors, using the notion of new fuzzy rough set. These dependency factors are assigned as the initial connection weights of the proposed network. It is then trained using minimization of a novel feature evaluation index in an unsupervised manner. The effectiveness of the proposed network, in evaluating selected features, is demonstrated on several real-life datasets. The results of FRGNN are found to be statistically more significant than related methods in 28 instances of 40 instances, i.e., 70% of instances, using the paired t-test.

  20. A fractal model of HIV transmission on complex sociogeographic networks: towards analysis of large data sets.

    PubMed

    Wallace, R

    1993-01-01

    "A paradigm of HIV (human immunodeficiency virus) transmission along very large 'sociogeographic' networks--spatially focused nets of social interaction--is extended to include fractal (dilationally self-similar) structures upon which a metric of 'sociogeographic' distance can be defined.... Techniques are sketched for determining the sociogeographic structure of a large, geographically centered social network, providing a possible empirical basis for predicting forms and rates of spread of the initial, rapid stages of an HIV outbreak for networks not yet infected, and perhaps greatly expanding the utility of routinely collected small-area administrative data sets in the design of mutually reinforcing, multifactorial disease-control strategies."

  1. Balance between Noise and Information Flow Maximizes Set Complexity of Network Dynamics

    PubMed Central

    Mäki-Marttunen, Tuomo; Kesseli, Juha; Nykter, Matti

    2013-01-01

    Boolean networks have been used as a discrete model for several biological systems, including metabolic and genetic regulatory networks. Due to their simplicity they offer a firm foundation for generic studies of physical systems. In this work we show, using a measure of context-dependent information, set complexity, that prior to reaching an attractor, random Boolean networks pass through a transient state characterized by high complexity. We justify this finding with a use of another measure of complexity, namely, the statistical complexity. We show that the networks can be tuned to the regime of maximal complexity by adding a suitable amount of noise to the deterministic Boolean dynamics. In fact, we show that for networks with Poisson degree distributions, all networks ranging from subcritical to slightly supercritical can be tuned with noise to reach maximal set complexity in their dynamics. For networks with a fixed number of inputs this is true for near-to-critical networks. This increase in complexity is obtained at the expense of disruption in information flow. For a large ensemble of networks showing maximal complexity, there exists a balance between noise and contracting dynamics in the state space. In networks that are close to critical the intrinsic noise required for the tuning is smaller and thus also has the smallest effect in terms of the information processing in the system. Our results suggest that the maximization of complexity near to the state transition might be a more general phenomenon in physical systems, and that noise present in a system may in fact be useful in retaining the system in a state with high information content. PMID:23516395

  2. Artificial neural network classification using a minimal training set - Comparison to conventional supervised classification

    NASA Technical Reports Server (NTRS)

    Hepner, George F.; Logan, Thomas; Ritter, Niles; Bryant, Nevin

    1990-01-01

    Recent research has shown an artificial neural network (ANN) to be capable of pattern recognition and the classification of image data. This paper examines the potential for the application of neural network computing to satellite image processing. A second objective is to provide a preliminary comparison and ANN classification. An artificial neural network can be trained to do land-cover classification of satellite imagery using selected sites representative of each class in a manner similar to conventional supervised classification. One of the major problems associated with recognition and classifications of pattern from remotely sensed data is the time and cost of developing a set of training sites. This reseach compares the use of an ANN back propagation classification procedure with a conventional supervised maximum likelihood classification procedure using a minimal training set. When using a minimal training set, the neural network is able to provide a land-cover classification superior to the classification derived from the conventional classification procedure. This research is the foundation for developing application parameters for further prototyping of software and hardware implementations for artificial neural networks in satellite image and geographic information processing.

  3. Evolution of Autocatalytic Sets in Computational Models of Chemical Reaction Networks.

    PubMed

    Hordijk, Wim

    2016-06-01

    Several computational models of chemical reaction networks have been presented in the literature in the past, showing the appearance and (potential) evolution of autocatalytic sets. However, the notion of autocatalytic sets has been defined differently in different modeling contexts, each one having some shortcoming or limitation. Here, we review four such models and definitions, and then formally describe and analyze them in the context of a mathematical framework for studying autocatalytic sets known as RAF theory. The main results are that: (1) RAF theory can capture the various previous definitions of autocatalytic sets and is therefore more complete and general, (2) the formal framework can be used to efficiently detect and analyze autocatalytic sets in all of these different computational models, (3) autocatalytic (RAF) sets are indeed likely to appear and evolve in such models, and (4) this could have important implications for a possible metabolism-first scenario for the origin of life.

  4. Evolution of Autocatalytic Sets in Computational Models of Chemical Reaction Networks

    NASA Astrophysics Data System (ADS)

    Hordijk, Wim

    2016-06-01

    Several computational models of chemical reaction networks have been presented in the literature in the past, showing the appearance and (potential) evolution of autocatalytic sets. However, the notion of autocatalytic sets has been defined differently in different modeling contexts, each one having some shortcoming or limitation. Here, we review four such models and definitions, and then formally describe and analyze them in the context of a mathematical framework for studying autocatalytic sets known as RAF theory. The main results are that: (1) RAF theory can capture the various previous definitions of autocatalytic sets and is therefore more complete and general, (2) the formal framework can be used to efficiently detect and analyze autocatalytic sets in all of these different computational models, (3) autocatalytic (RAF) sets are indeed likely to appear and evolve in such models, and (4) this could have important implications for a possible metabolism-first scenario for the origin of life.

  5. Peer Network Composition of Acculturated and Ethnoculturally-Affiliated Adolescents in a Multicultural Setting.

    ERIC Educational Resources Information Center

    Maharaj, Sherry I.; Connolly, Jennifer A.

    1994-01-01

    A study investigated the ethnocultural composition of the peer networks of 896 suburban high school students. Results indicated that gender mix, setting mix, and frequency of contact significantly differed across homogenous, integrated, and heterogeneous peer structures, demonstrating the mitigating impact of environmental factors on the interplay…

  6. How Do Social Networks Influence Learning Outcomes? A Case Study in an Industrial Setting

    ERIC Educational Resources Information Center

    Maglajlic, Seid; Helic, Denis

    2012-01-01

    and Purpose: The purpose of this research is to shed light on the impact of implicit social networks to the learning outcome of e-learning participants in an industrial setting. Design/methodology/approach: The paper presents a theoretical framework that allows the authors to measure correlation coefficients between the different affiliations that…

  7. Node Deployment Algorithm for Underwater Sensor Networks Based on Connected Dominating Set

    PubMed Central

    Jiang, Peng; Liu, Jun; Wu, Feng; Wang, Jianzhong; Xue, Anke

    2016-01-01

    Existing node deployment algorithms for underwater sensor networks are nearly unable to improve the network coverage rate under the premise of ensuring the full network connectivity and do not optimize the communication and move energy consumption during the deployment. Hence, a node deployment algorithm based on connected dominating set (CDS) is proposed. After randomly sowing the nodes in 3D monitoring underwater space, disconnected nodes move to the sink node until the network achieves full connectivity. The sink node then performs centralized optimization to determine the CDS and adjusts the locations of dominated nodes. Simulation results show that the proposed algorithm can achieve a high coverage rate while ensuring full connectivity and decreases the communication and movement energy consumption during deployment. PMID:26999147

  8. Detecting communities in clustered networks based on group action on set

    NASA Astrophysics Data System (ADS)

    Zhang, Zhanli; Jiang, Xin; Ma, Lili; Tang, Shaoting; Zheng, Zhiming

    2011-03-01

    In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks.

  9. Set processing in a network environment. [data bases and magnetic disks and tapes

    NASA Technical Reports Server (NTRS)

    Hardgrave, W. T.

    1975-01-01

    A combination of a local network, a mass storage system, and an autonomous set processor serving as a data/storage management machine is described. Its characteristics include: content-accessible data bases usable from all connected devices; efficient storage/access of large data bases; simple and direct programming with data manipulation and storage management handled by the set processor; simple data base design and entry from source representation to set processor representation with no predefinition necessary; capability available for user sort/order specification; significant reduction in tape/disk pack storage and mounts; flexible environment that allows upgrading hardware/software configuration without causing major interruptions in service; minimal traffic on data communications network; and improved central memory usage on large processors.

  10. Gene regulatory network inference using fused LASSO on multiple data sets.

    PubMed

    Omranian, Nooshin; Eloundou-Mbebi, Jeanne M O; Mueller-Roeber, Bernd; Nikoloski, Zoran

    2016-02-11

    Devising computational methods to accurately reconstruct gene regulatory networks given gene expression data is key to systems biology applications. Here we propose a method for reconstructing gene regulatory networks by simultaneous consideration of data sets from different perturbation experiments and corresponding controls. The method imposes three biologically meaningful constraints: (1) expression levels of each gene should be explained by the expression levels of a small number of transcription factor coding genes, (2) networks inferred from different data sets should be similar with respect to the type and number of regulatory interactions, and (3) relationships between genes which exhibit similar differential behavior over the considered perturbations should be favored. We demonstrate that these constraints can be transformed in a fused LASSO formulation for the proposed method. The comparative analysis on transcriptomics time-series data from prokaryotic species, Escherichia coli and Mycobacterium tuberculosis, as well as a eukaryotic species, mouse, demonstrated that the proposed method has the advantages of the most recent approaches for regulatory network inference, while obtaining better performance and assigning higher scores to the true regulatory links. The study indicates that the combination of sparse regression techniques with other biologically meaningful constraints is a promising framework for gene regulatory network reconstructions.

  11. Network Conduciveness with Application to the Graph-Coloring and Independent-Set Optimization Transitions

    PubMed Central

    Barbosa, Valmir C.

    2010-01-01

    Background Given an undirected graph, we consider the two problems of combinatorial optimization, which ask that its chromatic and independence numbers be found. Although both problems are NP-hard, when either one is solved on the incrementally denser graphs of a random sequence, at certain critical values of the number of edges, it happens that the transition to the next value causes optimal solutions to be obtainable substantially more easily than right before it. Methodology/Principal Findings We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another. We demonstrate that the performance jumps of graph coloring and independent sets at the critical-value transitions in the number of edges can be understood by resorting to the network that represents the solution space of the problems for each graph and examining its conduciveness between the non-optimal solutions and the optimal ones. Right past each transition, this network becomes strikingly more conducive in the direction of the optimal solutions than it was just before it, while at the same time becoming less conducive in the opposite direction. Conclusions/Significance Network conduciveness provides a useful conceptual framework for explaining the performance jumps associated with graph coloring and independent sets. We believe it may also become instrumental in helping clarify further issues related to NP-hardness that remain poorly understood. Additionally, it may become useful also in other areas in which network theory has a role to play. PMID:20628597

  12. Design and characterization of chemical space networks for different compound data sets.

    PubMed

    Zwierzyna, Magdalena; Vogt, Martin; Maggiora, Gerald M; Bajorath, Jürgen

    2015-02-01

    Chemical Space Networks (CSNs) are generated for different compound data sets on the basis of pairwise similarity relationships. Such networks are thought to complement and further extend traditional coordinate-based views of chemical space. Our proof-of-concept study focuses on CSNs based upon fingerprint similarity relationships calculated using the conventional Tanimoto similarity metric. The resulting CSNs are characterized with statistical measures from network science and compared in different ways. We show that the homophily principle, which is widely considered in the context of social networks, is a major determinant of the topology of CSNs of bioactive compounds, designed as threshold networks, typically giving rise to community structures. Many properties of CSNs are influenced by numerical features of the conventional Tanimoto similarity metric and largely dominated by the edge density of the networks, which depends on chosen similarity threshold values. However, properties of different CSNs with constant edge density can be directly compared, revealing systematic differences between CSNs generated from randomly collected or bioactive compounds.

  13. Associating Human-Centered Concepts with Social Networks Using Fuzzy Sets

    NASA Astrophysics Data System (ADS)

    Yager, Ronald R.

    that allows us to determine how true it is that a particular node is a leader. In this work we look at the use of fuzzy set methodologies [8-10] to provide a bridge between the human analyst and the formal model of the network.

  14. Learning contextual gene set interaction networks of cancer with condition specificity

    PubMed Central

    2013-01-01

    Background Identifying similarities and differences in the molecular constitutions of various types of cancer is one of the key challenges in cancer research. The appearances of a cancer depend on complex molecular interactions, including gene regulatory networks and gene-environment interactions. This complexity makes it challenging to decipher the molecular origin of the cancer. In recent years, many studies reported methods to uncover heterogeneous depictions of complex cancers, which are often categorized into different subtypes. The challenge is to identify diverse molecular contexts within a cancer, to relate them to different subtypes, and to learn underlying molecular interactions specific to molecular contexts so that we can recommend context-specific treatment to patients. Results In this study, we describe a novel method to discern molecular interactions specific to certain molecular contexts. Unlike conventional approaches to build modular networks of individual genes, our focus is to identify cancer-generic and subtype-specific interactions between contextual gene sets, of which each gene set share coherent transcriptional patterns across a subset of samples, termed contextual gene set. We then apply a novel formulation for quantitating the effect of the samples from each subtype on the calculated strength of interactions observed. Two cancer data sets were analyzed to support the validity of condition-specificity of identified interactions. When compared to an existing approach, the proposed method was much more sensitive in identifying condition-specific interactions even in heterogeneous data set. The results also revealed that network components specific to different types of cancer are related to different biological functions than cancer-generic network components. We found not only the results that are consistent with previous studies, but also new hypotheses on the biological mechanisms specific to certain cancer types that warrant further

  15. SiBIC: a web server for generating gene set networks based on biclusters obtained by maximal frequent itemset mining.

    PubMed

    Takahashi, Kei-ichiro; Takigawa, Ichigaku; Mamitsuka, Hiroshi

    2013-01-01

    Detecting biclusters from expression data is useful, since biclusters are coexpressed genes under only part of all given experimental conditions. We present a software called SiBIC, which from a given expression dataset, first exhaustively enumerates biclusters, which are then merged into rather independent biclusters, which finally are used to generate gene set networks, in which a gene set assigned to one node has coexpressed genes. We evaluated each step of this procedure: 1) significance of the generated biclusters biologically and statistically, 2) biological quality of merged biclusters, and 3) biological significance of gene set networks. We emphasize that gene set networks, in which nodes are not genes but gene sets, can be more compact than usual gene networks, meaning that gene set networks are more comprehensible. SiBIC is available at http://utrecht.kuicr.kyoto-u.ac.jp:8080/miami/faces/index.jsp.

  16. Computing minimal nutrient sets from metabolic networks via linear constraint solving

    PubMed Central

    2013-01-01

    Background As more complete genome sequences become available, bioinformatics challenges arise in how to exploit genome sequences to make phenotypic predictions. One type of phenotypic prediction is to determine sets of compounds that will support the growth of a bacterium from the metabolic network inferred from the genome sequence of that organism. Results We present a method for computationally determining alternative growth media for an organism based on its metabolic network and transporter complement. Our method predicted 787 alternative anaerobic minimal nutrient sets for Escherichia coli K–12 MG1655 from the EcoCyc database. The program automatically partitioned the nutrients within these sets into 21 equivalence classes, most of which correspond to compounds serving as sources of carbon, nitrogen, phosphorous, and sulfur, or combinations of these essential elements. The nutrient sets were predicted with 72.5% accuracy as evaluated by comparison with 91 growth experiments. Novel aspects of our approach include (a) exhaustive consideration of all combinations of nutrients rather than assuming that all element sources can substitute for one another(an assumption that can be invalid in general) (b) leveraging the notion of a machinery-duplicating constraint, namely, that all intermediate metabolites used in active reactions must be produced in increasing concentrations to prevent successive dilution from cell division, (c) the use of Satisfiability Modulo Theory solvers rather than Linear Programming solvers, because our approach cannot be formulated as linear programming, (d) the use of Binary Decision Diagrams to produce an efficient implementation. Conclusions Our method for generating minimal nutrient sets from the metabolic network and transporters of an organism combines linear constraint solving with binary decision diagrams to efficiently produce solution sets to provided growth problems. PMID:23537498

  17. A dynamic evolutionary clustering perspective: Community detection in signed networks by reconstructing neighbor sets

    NASA Astrophysics Data System (ADS)

    Chen, Jianrui; Wang, Hua; Wang, Lina; Liu, Weiwei

    2016-04-01

    Community detection in social networks has been intensively studied in recent years. In this paper, a novel similarity measurement is defined according to social balance theory for signed networks. Inter-community positive links are found and deleted due to their low similarity. The positive neighbor sets are reconstructed by this method. Then, differential equations are proposed to imitate the constantly changing states of nodes. Each node will update its state based on the difference between its state and average state of its positive neighbors. Nodes in the same community will evolve together with time and nodes in the different communities will evolve far away. Communities are detected ultimately when states of nodes are stable. Experiments on real world and synthetic networks are implemented to verify detection performance. The thorough comparisons demonstrate the presented method is more efficient than two acknowledged better algorithms.

  18. A jazz-based approach for optimal setting of pressure reducing valves in water distribution networks

    NASA Astrophysics Data System (ADS)

    De Paola, Francesco; Galdiero, Enzo; Giugni, Maurizio

    2016-05-01

    This study presents a model for valve setting in water distribution networks (WDNs), with the aim of reducing the level of leakage. The approach is based on the harmony search (HS) optimization algorithm. The HS mimics a jazz improvisation process able to find the best solutions, in this case corresponding to valve settings in a WDN. The model also interfaces with the improved version of a popular hydraulic simulator, EPANET 2.0, to check the hydraulic constraints and to evaluate the performances of the solutions. Penalties are introduced in the objective function in case of violation of the hydraulic constraints. The model is applied to two case studies, and the obtained results in terms of pressure reductions are comparable with those of competitive metaheuristic algorithms (e.g. genetic algorithms). The results demonstrate the suitability of the HS algorithm for water network management and optimization.

  19. Experience in Strategic Networking to Promote Palliative Care in a Clinical Academic Setting in India

    PubMed Central

    Nair, Shoba; Tarey, SD; Barathi, B; Mary, Thiophin Regina; Mathew, Lovely; Daniel, Sudha Pauline

    2016-01-01

    Background: Palliative care in low and middle-income countries is a new discipline, responding to a greater patient need, than in high-income countries. By its very nature, palliative as a specialty has to network with other specialties to provide quality care to patients. For any medical discipline to grow as a specialty, it should be well established in the teaching medical institutions of that country. Data show that palliative care is more likely to establish and grow in an academic health care institution. It is a necessity that multiple networking strategies are adopted to reach this goal. Objectives: (1) To describe a strategic approach to palliative care service development and integration into clinical academic setting. (2) To present the change in metrics to evaluate progress. Design and Setting: This is a descriptive study wherein, the different strategies that are adopted by the Department of Palliative Medicine for networking in an academic health care institution and outside the institution are scrutinized. Measurement: The impact of this networking was assessed, one, at the level of academics and the other, at the level of service. The number of people who attended various training programs conducted by the department and the number of patients who availed palliative care service over the years were assessed. Results: Ten different strategies were identified that helped with networking of palliative care in the institution. During this time, the referrals to the department increased both for malignant diseases (52–395) and nonmalignant diseases (5–353) from 2000 to 2013. The academic sessions conducted by the department for undergraduates also saw an increase in the number of hours from 6 to 12, apart from the increase in a number of courses conducted by the department for doctors and nurses. Conclusion: Networking is an essential strategy for the establishment of a relatively new medical discipline like palliative care in a developing and

  20. Chip-set for quality of service support in passive optical networks

    NASA Astrophysics Data System (ADS)

    Ringoot, Edwin; Hoebeke, Rudy; Slabbinck, B. Hans; Verhaert, Michel

    1998-10-01

    In this paper the design of a chip-set for QoS provisioning in ATM-based Passive Optical Networks is discussed. The implementation of a general-purpose switch chip on the Optical Network Unit is presented, with focus on the design of the cell scheduling and buffer management logic. The cell scheduling logic supports `colored' grants, priority jumping and weighted round-robin scheduling. The switch chip offers powerful buffer management capabilities enabling the efficient support of GFR and UBR services. Multicast forwarding is also supported. In addition, the architecture of a MAC controller chip developed for a SuperPON access network is introduced. In particular, the permit scheduling logic and its implementation on the Optical Line Termination will be discussed. The chip-set enables the efficient support of services with different service requirements on the SuperPON. The permit scheduling logic built into the MAC controller chip in combination with the cell scheduling and buffer management capabilities of the switch chip can be used by network operators to offer guaranteed service performance to delay sensitive services, and to efficiently and fairly distribute any spare capacity to delay insensitive services.

  1. Acoustic Metadata Management and Transparent Access to Networked Oceanographic Data Sets

    DTIC Science & Technology

    2015-09-30

    Transparent Access to Networked Oceanographic Data Sets Marie A. Roch Dept. of Computer Science San Diego State University 5500 Campanile Drive San...derived from these recordings (metadata of the recordings) becomes crucial in order to combine data across disparate studies to provide information...The period over which effort was invested may not be the same as that of the acoustic data itself. Examples of this include gaps due to

  2. Informative conditions for the data set in an MIMO networked control system with delays, packet dropout and transmission scheduling

    NASA Astrophysics Data System (ADS)

    Zhang, Cong; Xiong, Zhihua; Ye, Hao

    2014-07-01

    In system identification, a data set needs to be informative to guarantee that the identification criterion has a unique global minimum asymptotically and the parameter estimation is consistent. In this paper, we study the informativity of the data set in a multiple-input and multiple-output (MIMO) networked control system (NCS), which contains possible network-induced delays, packet dropout, transmission scheduling, or a combination of these factors in network transmission. Moreover, to guarantee the data set of this MIMO NCS to be informative, a group of conditions for network transmission and controller's proportional term are developed. Finally, simulation studies are given to illustrate the result.

  3. Online social networking sites-a novel setting for health promotion?

    PubMed

    Loss, Julika; Lindacher, Verena; Curbach, Janina

    2014-03-01

    Among adolescents, online social networking sites (SNS) such as Facebook are popular platforms for social interaction and may therefore be considered as 'novel settings' that could be exploited for health promotion. In this article, we examine the relevant definitions in health promotion and literature in order to analyze whether key characteristics of 'settings for health promotion' and the socio-ecological settings approach can be transferred to SNS. As many of our daily activities have shifted to cyberspace, we argue that online social interaction may gain more importance than geographic closeness for defining a 'setting'. While exposition to positive references to risk behavior by peers may render the SNS environment detrimental to health, SNS may allow people to create their own content and therefore foster participation. However, those health promotion projects delivered on SNS up until today solely relied on health education directed at end users. It remains unclear how health promotion on SNS can meet other requirements of the settings approach (e.g. building partnerships, changing the environment). As yet, one should be cautious in terming SNS a 'setting'.

  4. Linking plant specialization to dependence in interactions for seed set in pollination networks.

    PubMed

    Tur, Cristina; Castro-Urgal, Rocío; Traveset, Anna

    2013-01-01

    Studies on pollination networks have provided valuable information on the number, frequency, distribution and identity of interactions between plants and pollinators. However, little is still known on the functional effect of these interactions on plant reproductive success. Information on the extent to which plants depend on such interactions will help to make more realistic predictions of the potential impacts of disturbances on plant-pollinator networks. Plant functional dependence on pollinators (all interactions pooled) can be estimated by comparing seed set with and without pollinators (i.e. bagging flowers to exclude them). Our main goal in this study was thus to determine whether plant dependence on current insect interactions is related to plant specialization in a pollination network. We studied two networks from different communities, one in a coastal dune and one in a mountain. For ca. 30% of plant species in each community, we obtained the following specialization measures: (i) linkage level (number of interactions), (ii) diversity of interactions, and (iii) closeness centrality (a measure of how much a species is connected to other plants via shared pollinators). Phylogenetically controlled regression analyses revealed that, for the largest and most diverse coastal community, plants highly dependent on pollinators were the most generalists showing the highest number and diversity of interactions as well as occupying central positions in the network. The mountain community, by contrast, did not show such functional relationship, what might be attributable to their lower flower-resource heterogeneity and diversity of interactions. We conclude that plants with a wide array of pollinator interactions tend to be those that are more strongly dependent upon them for seed production and thus might be those more functionally vulnerable to the loss of network interaction, although these outcomes might be context-dependent.

  5. A restricted branch and bound approach for setting the left turn phase sequences in signalized networks

    SciTech Connect

    Pillai, R.S.; Rathi, A.K.; Cohen, S.

    1994-07-01

    The main objective of synchronized signal timing is to keep traffic moving along arterial in platoons throughout the signal system by proper setting of left turn phase sequence at signals along the arterials/networks. The synchronization of traffic signals located along the urban/suburban arterials in metropolitan areas is perhaps one of the most cost-effective method for improving traffic flow along these streets. The popular technique for solving this problem formulates it as a mixed integer linear program and used Land and Powell branch and bound search to arrive at the optimal solution. The computation time tends to be excessive for realistic multiarterial network problems due to the exhaustive nature of the branch and bound search technique. Furthermore, the Land and Powell branch and bound code is known to be numerically unstable, which results in suboptimal solutions for network problems with a range on the cycle time variable. This paper presents the development of a fast and numerically stable heuristic, developed using MINOS linear programming solver. The new heuristic can generate optimal/near-optimal solutions in a fraction of the time needed to compute the optimal solution by Land and Powell code. The solution technique is based on restricted search using branch and bound technique. The efficiency of the heuristic approach is demonstrated by numerical results for a set of test problems.

  6. Neural network and rough set hybrid scheme for prediction of missing associations.

    PubMed

    Anitha, A; Acharjya, D P

    2015-01-01

    Currently, internet is the best tool for distributed computing, which involves spreading of data geographically. But, retrieving information from huge data is critical and has no relevance unless it provides certain information. Prediction of missing associations can be viewed as fundamental problems in machine learning where the main objective is to determine decisions for the missing associations. Mathematical models such as naive Bayes structure, human composed network structure, Bayesian network modelling, etc., were developed to this end. But, it has certain limitations and failed to include uncertainties. Therefore, effort has been made to process inconsistencies in the data with the introduction of rough set theory. This paper uses two processes, pre-process and post-process, to predict the decisions for the missing associations in the attribute values. In preprocess, rough set is used to reduce the dimensionality, whereas neural network is used in postprocess to explore the decision for the missing associations. A real-life example is provided to show the viability of the proposed research.

  7. Holding-based network of nations based on listed energy companies: An empirical study on two-mode affiliation network of two sets of actors

    NASA Astrophysics Data System (ADS)

    Li, Huajiao; Fang, Wei; An, Haizhong; Gao, Xiangyun; Yan, Lili

    2016-05-01

    Economic networks in the real world are not homogeneous; therefore, it is important to study economic networks with heterogeneous nodes and edges to simulate a real network more precisely. In this paper, we present an empirical study of the one-mode derivative holding-based network constructed by the two-mode affiliation network of two sets of actors using the data of worldwide listed energy companies and their shareholders. First, we identify the primitive relationship in the two-mode affiliation network of the two sets of actors. Then, we present the method used to construct the derivative network based on the shareholding relationship between two sets of actors and the affiliation relationship between actors and events. After constructing the derivative network, we analyze different topological features on the node level, edge level and entire network level and explain the meanings of the different values of the topological features combining the empirical data. This study is helpful for expanding the usage of complex networks to heterogeneous economic networks. For empirical research on the worldwide listed energy stock market, this study is useful for discovering the inner relationships between the nations and regions from a new perspective.

  8. Reconstructing Protein Structures by Neural Network Pairwise Interaction Fields and Iterative Decoy Set Construction

    PubMed Central

    Mirabello, Claudio; Adelfio, Alessandro; Pollastri, Gianluca

    2014-01-01

    Predicting the fold of a protein from its amino acid sequence is one of the grand problems in computational biology. While there has been progress towards a solution, especially when a protein can be modelled based on one or more known structures (templates), in the absence of templates, even the best predictions are generally much less reliable. In this paper, we present an approach for predicting the three-dimensional structure of a protein from the sequence alone, when templates of known structure are not available. This approach relies on a simple reconstruction procedure guided by a novel knowledge-based evaluation function implemented as a class of artificial neural networks that we have designed: Neural Network Pairwise Interaction Fields (NNPIF). This evaluation function takes into account the contextual information for each residue and is trained to identify native-like conformations from non-native-like ones by using large sets of decoys as a training set. The training set is generated and then iteratively expanded during successive folding simulations. As NNPIF are fast at evaluating conformations, thousands of models can be processed in a short amount of time, and clustering techniques can be adopted for model selection. Although the results we present here are very preliminary, we consider them to be promising, with predictions being generated at state-of-the-art levels in some of the cases. PMID:24970210

  9. Knowledge Mining from Clinical Datasets Using Rough Sets and Backpropagation Neural Network

    PubMed Central

    Nahato, Kindie Biredagn; Harichandran, Khanna Nehemiah; Arputharaj, Kannan

    2015-01-01

    The availability of clinical datasets and knowledge mining methodologies encourages the researchers to pursue research in extracting knowledge from clinical datasets. Different data mining techniques have been used for mining rules, and mathematical models have been developed to assist the clinician in decision making. The objective of this research is to build a classifier that will predict the presence or absence of a disease by learning from the minimal set of attributes that has been extracted from the clinical dataset. In this work rough set indiscernibility relation method with backpropagation neural network (RS-BPNN) is used. This work has two stages. The first stage is handling of missing values to obtain a smooth data set and selection of appropriate attributes from the clinical dataset by indiscernibility relation method. The second stage is classification using backpropagation neural network on the selected reducts of the dataset. The classifier has been tested with hepatitis, Wisconsin breast cancer, and Statlog heart disease datasets obtained from the University of California at Irvine (UCI) machine learning repository. The accuracy obtained from the proposed method is 97.3%, 98.6%, and 90.4% for hepatitis, breast cancer, and heart disease, respectively. The proposed system provides an effective classification model for clinical datasets. PMID:25821508

  10. Knowledge mining from clinical datasets using rough sets and backpropagation neural network.

    PubMed

    Nahato, Kindie Biredagn; Harichandran, Khanna Nehemiah; Arputharaj, Kannan

    2015-01-01

    The availability of clinical datasets and knowledge mining methodologies encourages the researchers to pursue research in extracting knowledge from clinical datasets. Different data mining techniques have been used for mining rules, and mathematical models have been developed to assist the clinician in decision making. The objective of this research is to build a classifier that will predict the presence or absence of a disease by learning from the minimal set of attributes that has been extracted from the clinical dataset. In this work rough set indiscernibility relation method with backpropagation neural network (RS-BPNN) is used. This work has two stages. The first stage is handling of missing values to obtain a smooth data set and selection of appropriate attributes from the clinical dataset by indiscernibility relation method. The second stage is classification using backpropagation neural network on the selected reducts of the dataset. The classifier has been tested with hepatitis, Wisconsin breast cancer, and Statlog heart disease datasets obtained from the University of California at Irvine (UCI) machine learning repository. The accuracy obtained from the proposed method is 97.3%, 98.6%, and 90.4% for hepatitis, breast cancer, and heart disease, respectively. The proposed system provides an effective classification model for clinical datasets.

  11. Agenda setting for maternal survival: the power of global health networks and norms.

    PubMed

    Smith, Stephanie L; Rodriguez, Mariela A

    2016-04-01

    Nearly 300,000 women--almost all poor women in low-income countries--died from pregnancy-related complications in 2010. This represents a decline since the 1980s, when an estimated half million women died each year, but is still far higher than the aims set in the United Nations Millennium Development Goals (MDGs) at the turn of the century. The 1970s, 1980s and 1990 s witnessed a shift from near complete neglect of the issue to emergence of a network of individuals and organizations with a shared concern for reducing maternal deaths and growth in the number of organizations and governments with maternal health strategies and programmes. Maternal health experienced a marked change in agenda status in the 2000s, attracting significantly higher level attention (e.g. from world leaders) and greater resource commitments (e.g. as one issue addressed by US$40 billion in pledges to the 2010 Global Strategy for Women's and Children's Health) than ever before. Several differences between network and actor features, issue characteristics and the policy environment pre- and post-2000 help to explain the change in agenda status for global maternal mortality reduction. Significantly, a strong poverty reduction norm emerged at the turn of the century; represented by the United Nations MDGs framework, the norm set unusually strong expectations for international development actors to advance included issues. As the norm grew, it drew policy attention to the maternal health goal (MDG 5). Seeking to advance the goals agenda, world leaders launched initiatives addressing maternal and child health. New network governance and framing strategies that closely linked maternal, newborn and child health shaped the initiatives. Diverse network composition--expanding beyond a relatively narrowly focused and technically oriented group to encompass allies and leaders that brought additional resources to bear on the problem--was crucial to maternal health's rise on the agenda in the 2000s.

  12. Agenda setting for maternal survival: the power of global health networks and norms

    PubMed Central

    Smith, Stephanie L; Rodriguez, Mariela A

    2016-01-01

    Nearly 300 000 women—almost all poor women in low-income countries—died from pregnancy-related complications in 2010. This represents a decline since the 1980s, when an estimated half million women died each year, but is still far higher than the aims set in the United Nations Millennium Development Goals (MDGs) at the turn of the century. The 1970s, 1980s and 1990s witnessed a shift from near complete neglect of the issue to emergence of a network of individuals and organizations with a shared concern for reducing maternal deaths and growth in the number of organizations and governments with maternal health strategies and programmes. Maternal health experienced a marked change in agenda status in the 2000s, attracting significantly higher level attention (e.g. from world leaders) and greater resource commitments (e.g. as one issue addressed by US$40 billion in pledges to the 2010 Global Strategy for Women’s and Children’s Health) than ever before. Several differences between network and actor features, issue characteristics and the policy environment pre- and post-2000 help to explain the change in agenda status for global maternal mortality reduction. Significantly, a strong poverty reduction norm emerged at the turn of the century; represented by the United Nations MDGs framework, the norm set unusually strong expectations for international development actors to advance included issues. As the norm grew, it drew policy attention to the maternal health goal (MDG 5). Seeking to advance the goals agenda, world leaders launched initiatives addressing maternal and child health. New network governance and framing strategies that closely linked maternal, newborn and child health shaped the initiatives. Diverse network composition—expanding beyond a relatively narrowly focused and technically oriented group to encompass allies and leaders that brought additional resources to bear on the problem—was crucial to maternal health’s rise on the agenda in the

  13. Structural damage identification based on rough sets and artificial neural network.

    PubMed

    Liu, Chengyin; Wu, Xiang; Wu, Ning; Liu, Chunyu

    2014-01-01

    This paper investigates potential applications of the rough sets (RS) theory and artificial neural network (ANN) method on structural damage detection. An information entropy based discretization algorithm in RS is applied for dimension reduction of the original damage database obtained from finite element analysis (FEA). The proposed approach is tested with a 14-bay steel truss model for structural damage detection. The experimental results show that the damage features can be extracted efficiently from the combined utilization of RS and ANN methods even the volume of measurement data is enormous and with uncertainties.

  14. Structural Damage Identification Based on Rough Sets and Artificial Neural Network

    PubMed Central

    Liu, Chengyin; Wu, Xiang; Wu, Ning; Liu, Chunyu

    2014-01-01

    This paper investigates potential applications of the rough sets (RS) theory and artificial neural network (ANN) method on structural damage detection. An information entropy based discretization algorithm in RS is applied for dimension reduction of the original damage database obtained from finite element analysis (FEA). The proposed approach is tested with a 14-bay steel truss model for structural damage detection. The experimental results show that the damage features can be extracted efficiently from the combined utilization of RS and ANN methods even the volume of measurement data is enormous and with uncertainties. PMID:25013847

  15. Breast mass segmentation in digital mammography based on pulse coupled neural network and level set method

    NASA Astrophysics Data System (ADS)

    Xie, Weiying; Ma, Yide; Li, Yunsong

    2015-05-01

    A novel approach to mammographic image segmentation, termed as PCNN-based level set algorithm, is presented in this paper. Just as its name implies, a method based on pulse coupled neural network (PCNN) in conjunction with the variational level set method for medical image segmentation. To date, little work has been done on detecting the initial zero level set contours based on PCNN algorithm for latterly level set evolution. When all the pixels of the input image are fired by PCNN, the small pixel value will be a much more refined segmentation. In mammographic image, the breast tumor presents big pixel value. Additionally, the mammographic image with predominantly dark region, so that we firstly obtain the negative of mammographic image with predominantly dark region except the breast tumor before all the pixels of an input image are fired by PCNN. Therefore, in here, PCNN algorithm is employed to achieve mammary-specific, initial mass contour detection. After that, the initial contours are all extracted. We define the extracted contours as the initial zero level set contours for automatic mass segmentation by variational level set in mammographic image analysis. What's more, a new proposed algorithm improves external energy of variational level set method in terms of mammographic images in low contrast. In accordance with the gray scale of mass region in mammographic image is higher than the region surrounded, so the Laplace operator is used to modify external energy, which could make the bright spot becoming much brighter than the surrounded pixels in the image. A preliminary evaluation of the proposed method performs on a known public database namely MIAS, rather than synthetic images. The experimental results demonstrate that our proposed approach can potentially obtain better masses detection results in terms of sensitivity and specificity. Ultimately, this algorithm could lead to increase both sensitivity and specificity of the physicians' interpretation of

  16. LS-44: An improved deep space network station location set for Viking navigation

    NASA Technical Reports Server (NTRS)

    Koble, H. M.; Pease, G. E.; Yip, K. W.

    1976-01-01

    Improved estimates for the spin axis and longitude components of the Deep Space Network station locations were obtained from post-flight processing of radio metric data received from various Mariner planetary missions. The use of an upgraded set of ionospheric calibrations and the incorporation of near-Venus and near-Mercury radio metric data from the Mariner 10 spacecraft are the principal contributing effects to the improvement. These new estimates, designated Location Set (LS) 44, have supported Viking navigation activities in the vicinity of Mars. As such, the station locations were determined relative to the planetary positions inherent in JPL Development Ephemeris (DE) 84, which was used throughout the Viking mission. The article also presents and discusses a version of LS 44 based upon the latest planetary ephemeris, DE 96.

  17. Delineating geographical regions with networks of human interactions in an extensive set of countries.

    PubMed

    Sobolevsky, Stanislav; Szell, Michael; Campari, Riccardo; Couronné, Thomas; Smoreda, Zbigniew; Ratti, Carlo

    2013-01-01

    Large-scale networks of human interaction, in particular country-wide telephone call networks, can be used to redraw geographical maps by applying algorithms of topological community detection. The geographic projections of the emerging areas in a few recent studies on single regions have been suggested to share two distinct properties: first, they are cohesive, and second, they tend to closely follow socio-economic boundaries and are similar to existing political regions in size and number. Here we use an extended set of countries and clustering indices to quantify overlaps, providing ample additional evidence for these observations using phone data from countries of various scales across Europe, Asia, and Africa: France, the UK, Italy, Belgium, Portugal, Saudi Arabia, and Ivory Coast. In our analysis we use the known approach of partitioning country-wide networks, and an additional iterative partitioning of each of the first level communities into sub-communities, revealing that cohesiveness and matching of official regions can also be observed on a second level if spatial resolution of the data is high enough. The method has possible policy implications on the definition of the borderlines and sizes of administrative regions.

  18. Diabetes research in children network:availability of protocol data sets.

    PubMed

    Ruedy, Katrina J; Beck, Roy W; Xing, Dongyuan; Kollman, Craig

    2007-09-01

    The Diabetes Research in Children Network (DirecNet) was established in 2001 by the National Institute of Child Health and Human Development and the National Institute of Diabetes and Digestive and Kidney Diseases through special congressional funding for type 1 diabetes research. The network consists of five clinical centers, a coordinating center, and a central laboratory. Since its inception, DirecNet has conducted nine protocols, resulting in 28 published manuscripts with an additional 2 under review and 5 in development. The protocols have involved evaluation of technology available for the treatment of type 1 diabetes, including home glucose meters (OneTouch Ultra, FreeStyle, and BD Logic), continuous glucose monitoring systems (GW2B, CGMS, FreeStyle Navigator, and Guardian RT), and hemoglobin A1c (HbA1c) devices (DCA 2000 and A1cNow). In addition, the group has conducted several studies evaluating factors affecting hypoglycemia, including exercise and bedtime snack composition. The data sets that have resulted from these studies include data from the devices being evaluated, central laboratory glucose, HbA1c and hormone data, clinical center glucose and HbA1c data, accelerometer data, and pump data depending on the procedures involved with each protocol. These data sets are, or will be, available at no charge on the study group's public Web site. Several psychosocial questionnaires developed by DirecNet are also available.

  19. Generating a comprehensive set of standard operating procedures for a biorepository network-The CTRNet experience.

    PubMed

    Barnes, Rebecca; Albert, Monique; Damaraju, Sambasivarao; de Sousa-Hitzler, Jean; Kodeeswaran, Sugy; Mes-Masson, Anne-Marie; Watson, Peter; Schacter, Brent

    2013-12-01

    Despite the integral role of biorepositories in fueling translational research and the advancement of medicine, there are significant gaps in harmonization of biobanking practices, resulting in variable biospecimen collection, storage, and processing. This significantly impacts accurate downstream analysis and, in particular, creates a problem for biorepository networks or consortia. The Canadian Tumour Repository Network (CTRNet; www.ctrnet.ca ) is a consortium of Canadian tumor biorepositories that aims to enhance biobanking capacity and quality through standardization. To minimize the issue of variable biobanking practices throughout its network, CTRNet has developed and maintained a comprehensive set of 45 standard operating procedures (SOPs). There were four key elements to the CTRNet SOP development process: 1) an SOP development team was formed from members across CTRNet to co-produce each SOP; 2) a principal author was appointed with responsibility for overall coordination of the SOP development process; 3) the CTRNet Management Committee (composed of principal investigators for each member biorepository) reviewed/revised each SOP completed by the development team; and 4) external expert reviewers provided feedback and recommendations on each SOP. Once final Management Committee approval was obtained, the ratified SOP was published on the CTRNet website for public access. Since the SOPs were first published on the CTRNet website (June 2008), there have been approximately 15,000 downloads of one or more CTRNet SOPs/Policies by users from over 60 countries. In accordance with biobanking best practices, CTRNet performs an exhaustive review of its SOPs at set intervals, to coincide with each granting cycle. The last revision was completed in May 2012.

  20. GuMNet - Guadarrama Monitoring Network. Installation and set up of a high altitude monitoring network, north of Madrid. Spain

    NASA Astrophysics Data System (ADS)

    Santolaria-Canales, Edmundo

    2015-04-01

    An observational monitoring network in the Guadarrama Mountains is due to be operational at the end of 2015. This network integrates atmospheric measurements as well as subsurface observations in a high mountain climate, located up to 2.400 m.a.s.l. The data provided by GuMNet will help to improve the characterization of microclimate in high mountain areas, as well as land-atmosphere interations. The network information aims at meeting the needs of accuracy to be used for biological, agricultural, hydrological, meteorological and climatic investigations in this area. This initiative is supported and developed by research groups integrating the GuMNet Consortiuma from the Complutense and Polytechnical Universities of Madrid (UCM and UPM), the Energetic Environmental and Technological Research Centre (CIEMAT), the Spanish National Meteorological Agency (AEMET), and the National Park Sierra de Guadarrama (PNSG). The starting setup includes seven meteorological stations compatible with WMO standards, to be installed in the central area of the massif. Including a four-component net radiation sensor, an ultrasonic snow height, a pluviometer specialized for snow capture, air temperature and humidity devices and wind speed/direction sensor. Along with these atmospheric measurements, each station will include a set of subsurface measurements of temperature in shallow boreholes ( 20 m depth ) and temperature and humidity in trenches up to 1 m depth. These compatible WMO stations will be complemented by a station specialized in eddy covariance measuremets with CO2 fluxes at low altitude pastureland near Madrid. Another portable station is available to develop ad hoc comparison studies. This setup is embedded in a broader network of meteorological stations run partly by AEMET and partly by the PNSG. Most of the AEMET stations are distributed over lower altitudes, and will provide a very reliable boundary information for the atmosphere state around the Sierra. In the same way

  1. Exploratory Analysis in Time-Varying Data Sets: a Healthcare Network Application.

    PubMed

    Manukyan, Narine; Eppstein, Margaret J; Horbar, Jeffrey D; Leahy, Kathleen A; Kenny, Michael J; Mukherjee, Shreya; Rizzo, Donna M

    2013-07-01

    We introduce a new method for exploratory analysis of large data sets with time-varying features, where the aim is to automatically discover novel relationships between features (over some time period) that are predictive of any of a number of time-varying outcomes (over some other time period). Using a genetic algorithm, we co-evolve (i) a subset of predictive features, (ii) which attribute will be predicted (iii) the time period over which to assess the predictive features, and (iv) the time period over which to assess the predicted attribute. After validating the method on 15 synthetic test problems, we used the approach for exploratory analysis of a large healthcare network data set. We discovered a strong association, with 100% sensitivity, between hospital participation in multi-institutional quality improvement collaboratives during or before 2002, and changes in the risk-adjusted rates of mortality and morbidity observed after a 1-2 year lag. The proposed approach is a potentially powerful and general tool for exploratory analysis of a wide range of time-series data sets.

  2. Comparison of bladder segmentation using deep-learning convolutional neural network with and without level sets

    NASA Astrophysics Data System (ADS)

    Cha, Kenny H.; Hadjiiski, Lubomir M.; Samala, Ravi K.; Chan, Heang-Ping; Cohan, Richard H.; Caoili, Elaine M.

    2016-03-01

    We are developing a CAD system for detection of bladder cancer in CTU. In this study we investigated the application of deep-learning convolutional neural network (DL-CNN) to the segmentation of the bladder, which is a challenging problem because of the strong boundary between the non-contrast and contrast-filled regions in the bladder. We trained a DL-CNN to estimate the likelihood of a pixel being inside the bladder using neighborhood information. The segmented bladder was obtained from thresholding and hole-filling of the likelihood map. We compared the segmentation performance of the DL-CNN alone and with additional cascaded 3D and 2D level sets to refine the segmentation using 3D hand-segmented contours as reference standard. The segmentation accuracy was evaluated by five performance measures: average volume intersection %, average % volume error, average absolute % error, average minimum distance, and average Jaccard index for a data set of 81 training and 92 test cases. For the training set, DLCNN with level sets achieved performance measures of 87.2+/-6.1%, 6.0+/-9.1%, 8.7+/-6.1%, 3.0+/-1.2 mm, and 81.9+/-7.6%, respectively, while the DL-CNN alone obtained the values of 73.6+/-8.5%, 23.0+/-8.5%, 23.0+/-8.5%, 5.1+/-1.5 mm, and 71.5+/-9.2%, respectively. For the test set, the DL-CNN with level sets achieved performance measures of 81.9+/-12.1%, 10.2+/-16.2%, 14.0+/-13.0%, 3.6+/-2.0 mm, and 76.2+/-11.8%, respectively, while DL-CNN alone obtained 68.7+/-12.0%, 27.2+/-13.7%, 27.4+/-13.6%, 5.7+/-2.2 mm, and 66.2+/-11.8%, respectively. DL-CNN alone is effective in segmenting bladders but may not follow the details of the bladder wall. The combination of DL-CNN with level sets provides highly accurate bladder segmentation.

  3. Implementing evidence-based policy in a network setting: road safety policy in the Netherlands.

    PubMed

    Bax, Charlotte; de Jong, Martin; Koppenjan, Joop

    2010-01-01

    In the early 1990s, in order to improve road safety in The Netherlands, the Institute for Road Safety Research (SWOV) developed an evidence-based "Sustainable Safety" concept. Based on this concept, Dutch road safety policy, was seen as successful and as a best practice in Europe. In The Netherlands, the policy context has now changed from a sectoral policy setting towards a fragmented network in which safety is a facet of other transport-related policies. In this contribution, it is argued that the implementation strategy underlying Sustainable Safety should be aligned with the changed context. In order to explore the adjustments needed, two perspectives of policy implementation are discussed: (1) national evidence-based policies with sectoral implementation; and (2) decentralized negotiation on transport policy in which road safety is but one aspect. We argue that the latter approach matches the characteristics of the newly evolved policy context best, and conclude with recommendations for reformulating the implementation strategy.

  4. Hydro-Climatic Data Network (HCDN) Streamflow Data Set, 1874-1988

    USGS Publications Warehouse

    Slack, James Richard; Lumb, Alan M.; Landwehr, Jurate Maciunas

    1993-01-01

    The potential consequences of climate change to continental water resources are of great concern in the management of those resources. Critically important to society is what effect fluctuations in the prevailing climate may have on hydrologic conditions, such as the occurrence and magnitude of floods or droughts and the seasonal distribution of water supplies within a region. Records of streamflow that are unaffected by artificial diversions, storage, or other works of man in or on the natural stream channels or in the watershed can provide an account of hydrologic responses to fluctuations in climate. By examining such records given known past meteorologic conditions, we can better understand hydrologic responses to those conditions and anticipate the effects of postulated changes in current climate regimes. Furthermore, patterns in streamflow records can indicate when a change in the prevailing climate regime may have occurred in the past, even in the absence of concurrent meteorologic records. A streamflow data set, which is specifically suitable for the study of surface-water conditions throughout the United States under fluctuations in the prevailing climatic conditions, has been developed. This data set, called the Hydro-Climatic Data Network, or HCDN, consists of streamflow records for 1,659 sites throughout United States and its Territories. Records cumulatively span the period 1874 through 1988, inclusive, and represent a total of 73,231 water years of information. Development of the HCDN Data Set: Records for the HCDN were obtained through a comprehensive search of the extensive surface- water data holdings of the U.S. Geological Survey (USGS), which are contained in the USGS National Water Storage and Retrieval System (WATSTORE). All streamflow discharge records in WATSTORE through September 30, 1988, were examined for inclusion in the HCDN in accordance with strictly defined criteria of measurement accuracy and natural conditions. No reconstructed

  5. Analysis of the Effect of Degree Correlation on the Size of Minimum Dominating Sets in Complex Networks

    PubMed Central

    2016-01-01

    Network controllability is an important topic in wide-ranging research fields. However, the relationship between controllability and network structure is poorly understood, although degree heterogeneity is known to determine the controllability. We focus on the size of a minimum dominating set (MDS), a measure of network controllability, and investigate the effect of degree-degree correlation, which is universally observed in real-world networks, on the size of an MDS. We show that disassortativity or negative degree-degree correlation reduces the size of an MDS using analytical treatments and numerical simulation, whereas positive correlations hardly affect the size of an MDS. This result suggests that disassortativity enhances network controllability. Furthermore, apart from the controllability issue, the developed techniques provide new ways of analyzing complex networks with degree-degree correlations. PMID:27327273

  6. Adaptation and implementation of standardized order sets in a network of multi-hospital corporations in rural Ontario.

    PubMed

    Meleskie, Jessica; Eby, Don

    2009-01-01

    Standardized, preprinted or computer-generated physician orders are an attractive project for organizations that wish to improve the quality of patient care. The successful development and maintenance of order sets is a major undertaking. This article recounts the collaborative experience of the Grey Bruce Health Network in adapting and implementing an existing set of physician orders for use in its three hospital corporations. An Order Set Committee composed of primarily front-line staff was given authority over the order set development, approval and implementation processes. This arrangement bypassed the traditional approval process and facilitated the rapid implementation of a large number of order sets in a short time period.

  7. Deconstructing myths, building alliances: a networking model to enhance tobacco control in hospital mental health settings.

    PubMed

    Ballbè, Montse; Gual, Antoni; Nieva, Gemma; Saltó, Esteve; Fernández, Esteve

    2016-01-01

    Life expectancy for people with severe mental disorders is up to 25 years less in comparison to the general population, mainly due to diseases caused or worsened by smoking. However, smoking is usually a neglected issue in mental healthcare settings. The aim of this article is to describe a strategy to improve tobacco control in the hospital mental healthcare services of Catalonia (Spain). To bridge this gap, the Catalan Network of Smoke-free Hospitals launched a nationwide bottom-up strategy in Catalonia in 2007. The strategy relied on the creation of a working group of key professionals from various hospitals -the early adopters- based on Rogers' theory of the Diffusion of Innovations. In 2016, the working group is composed of professionals from 17 hospitals (70.8% of all hospitals in the region with mental health inpatient units). Since 2007, tobacco control has improved in different areas such as increasing mental health professionals' awareness of smoking, training professionals on smoking cessation interventions and achieving good compliance with the national smoking ban. The working group has produced and disseminated various materials, including clinical practice and best practice guidelines, implemented smoking cessation programmes and organised seminars and training sessions on smoking cessation measures in patients with mental illnesses. The next challenge is to ensure effective follow-up for smoking cessation after discharge. While some areas of tobacco control within these services still require significant improvement, the aforementioned initiative promotes successful tobacco control in these settings.

  8. GSA-PCA: gene set generation by principal component analysis of the Laplacian matrix of a metabolic network

    PubMed Central

    2012-01-01

    Background Gene Set Analysis (GSA) has proven to be a useful approach to microarray analysis. However, most of the method development for GSA has focused on the statistical tests to be used rather than on the generation of sets that will be tested. Existing methods of set generation are often overly simplistic. The creation of sets from individual pathways (in isolation) is a poor reflection of the complexity of the underlying metabolic network. We have developed a novel approach to set generation via the use of Principal Component Analysis of the Laplacian matrix of a metabolic network. We have analysed a relatively simple data set to show the difference in results between our method and the current state-of-the-art pathway-based sets. Results The sets generated with this method are semi-exhaustive and capture much of the topological complexity of the metabolic network. The semi-exhaustive nature of this method has also allowed us to design a hypergeometric enrichment test to determine which genes are likely responsible for set significance. We show that our method finds significant aspects of biology that would be missed (i.e. false negatives) and addresses the false positive rates found with the use of simple pathway-based sets. Conclusions The set generation step for GSA is often neglected but is a crucial part of the analysis as it defines the full context for the analysis. As such, set generation methods should be robust and yield as complete a representation of the extant biological knowledge as possible. The method reported here achieves this goal and is demonstrably superior to previous set analysis methods. PMID:22876834

  9. The roles of reward, default, and executive control networks in set-shifting impairments in schizophrenia.

    PubMed

    Waltz, James A; Kasanova, Zuzana; Ross, Thomas J; Salmeron, Betty J; McMahon, Robert P; Gold, James M; Stein, Elliot A

    2013-01-01

    Patients with schizophrenia (SZ) show deficits on tasks of rapid reinforcement learning, like probabilistic reversal learning (PRL), but the neural bases for those impairments are not known. Recent evidence of relatively intact sensitivity to negative outcomes in the ventral striatum (VS) in many SZ patients suggests that PRL deficits may be largely attributable to processes downstream from feedback processing, involving both the activation of executive control task regions and deactivation of default mode network (DMN) components. We analyzed data from 29 chronic SZ patients and 21 matched normal controls (NCs) performing a PRL task in an MRI scanner. Subjects were presented with eight pairs of fractal stimuli, for 50 trials each. For each pair, subjects learned to choose the more frequently-rewarded (better) stimulus. Each time a criterion was reached, the better stimulus became the worse one, and the worse became the better. Responses to feedback events were assessed through whole-brain and regions-of-interest (ROI) analyses in DMN. We also assessed correlations between BOLD signal contrasts and clinical measures in SZs. Relative to NCs, SZ patients showed comparable deactivation of VS in response to negative feedback, but reduced deactivation of DMN components including medial prefrontal cortex (mPFC). The magnitudes of patients' punishment-evoked deactivations in VS and ventromedial PFC correlated significantly with clinical ratings for avolition/anhedonia. These findings suggest that schizophrenia is associated with a reduced ability to deactivate components of default mode networks, following the presentation of informative feedback and that motivational deficits in SZ relate closely to feedback-evoked activity in reward circuit components. These results also confirm a role for ventrolateral and dorsomedial PFC in the execution of response-set shifts.

  10. Determinants of Low Cloud Properties - An Artificial Neural Network Approach Using Observation Data Sets

    NASA Astrophysics Data System (ADS)

    Andersen, Hendrik; Cermak, Jan

    2015-04-01

    This contribution studies the determinants of low cloud properties based on the application of various global observation data sets in machine learning algorithms. Clouds play a crucial role in the climate system as their radiative properties and precipitation patterns significantly impact the Earth's energy balance. Cloud properties are determined by environmental conditions, as cloud formation requires the availability of water vapour ("precipitable water") and condensation nuclei in sufficiently saturated conditions. A main challenge in the research of aerosol-cloud interactions is the separation of aerosol effects from meteorological influence. To gain understanding of the processes that govern low cloud properties in order to increase accuracy of climate models and predictions of future changes in the climate system is thus of great importance. In this study, artificial neural networks are used to relate a selection of predictors (meteorological parameters, aerosol loading) to a set of predictands (cloud microphysical and optical properties). As meteorological parameters, wind direction and velocity, sea level pressure, static stability of the lower troposphere, atmospheric water vapour and temperature at the surface are used (re-analysis data by the European Centre for Medium-Range Weather Forecasts). In addition to meteorological conditions, aerosol loading is used as a predictor of cloud properties (MODIS collection 6 aerosol optical depth). The statistical model reveals significant relationships between predictors and predictands and is able to represent the aerosol-cloud-meteorology system better than frequently used bivariate relationships. The most important predictors can be identified by the additional error when excluding one predictor at a time. The sensitivity of each predictand to each of the predictors is analyzed.

  11. Probabilistic neural network with homogeneity testing in recognition of discrete patterns set.

    PubMed

    Savchenko, A V

    2013-10-01

    The article is devoted to pattern recognition task with the database containing small number of samples per class. By mapping of local continuous feature vectors to a discrete range, this problem is reduced to statistical classification of a set of discrete finite patterns. It is demonstrated that the Bayesian decision under the assumption that probability distributions can be estimated using the Parzen kernel and the Gaussian window with a fixed variance for all the classes, implemented in the PNN, is not optimal in the classification of a set of patterns. We presented here the novel modification of the PNN with homogeneity testing which gives an optimal solution of the latter task under the same assumption about probability densities. By exploiting the discrete nature of patterns our modification prevents the well-known drawbacks of the memory-based approach implemented in both the PNN and the PNN with homogeneity testing, namely, low classification speed and high requirements to the memory usage. Our modification only requires the storage and processing of the histograms of input and training samples. We present the results of an experimental study in two practically important tasks: (1) the problem of Russian text authorship attribution with character n-grams features; and (2) face recognition with well-known datasets (AT&T, FERET and JAFFE) and comparison of color- and gradient-orientation histograms. Our results support the statement that the proposed network provides better accuracy (1%-7%) and is much more resistant to change of the smoothing parameter of Gaussian kernel function in comparison with the original PNN.

  12. Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

    PubMed Central

    Guziolowski, Carito; Videla, Santiago; Eduati, Federica; Thiele, Sven; Cokelaer, Thomas; Siegel, Anne; Saez-Rodriguez, Julio

    2013-01-01

    Motivation: Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions. Results: We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input–output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design. Availability: caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/. Supplementary information: Supplementary materials are available at Bioinformatics online. Contact: santiago.videla@irisa.fr PMID:23853063

  13. A General Fuzzy Cerebellar Model Neural Network Multidimensional Classifier Using Intuitionistic Fuzzy Sets for Medical Identification.

    PubMed

    Zhao, Jing; Lin, Lo-Yi; Lin, Chih-Min

    2016-01-01

    The diversity of medical factors makes the analysis and judgment of uncertainty one of the challenges of medical diagnosis. A well-designed classification and judgment system for medical uncertainty can increase the rate of correct medical diagnosis. In this paper, a new multidimensional classifier is proposed by using an intelligent algorithm, which is the general fuzzy cerebellar model neural network (GFCMNN). To obtain more information about uncertainty, an intuitionistic fuzzy linguistic term is employed to describe medical features. The solution of classification is obtained by a similarity measurement. The advantages of the novel classifier proposed here are drawn out by comparing the same medical example under the methods of intuitionistic fuzzy sets (IFSs) and intuitionistic fuzzy cross-entropy (IFCE) with different score functions. Cross verification experiments are also taken to further test the classification ability of the GFCMNN multidimensional classifier. All of these experimental results show the effectiveness of the proposed GFCMNN multidimensional classifier and point out that it can assist in supporting for correct medical diagnoses associated with multiple categories.

  14. A General Fuzzy Cerebellar Model Neural Network Multidimensional Classifier Using Intuitionistic Fuzzy Sets for Medical Identification

    PubMed Central

    Zhao, Jing; Lin, Lo-Yi

    2016-01-01

    The diversity of medical factors makes the analysis and judgment of uncertainty one of the challenges of medical diagnosis. A well-designed classification and judgment system for medical uncertainty can increase the rate of correct medical diagnosis. In this paper, a new multidimensional classifier is proposed by using an intelligent algorithm, which is the general fuzzy cerebellar model neural network (GFCMNN). To obtain more information about uncertainty, an intuitionistic fuzzy linguistic term is employed to describe medical features. The solution of classification is obtained by a similarity measurement. The advantages of the novel classifier proposed here are drawn out by comparing the same medical example under the methods of intuitionistic fuzzy sets (IFSs) and intuitionistic fuzzy cross-entropy (IFCE) with different score functions. Cross verification experiments are also taken to further test the classification ability of the GFCMNN multidimensional classifier. All of these experimental results show the effectiveness of the proposed GFCMNN multidimensional classifier and point out that it can assist in supporting for correct medical diagnoses associated with multiple categories. PMID:27298619

  15. Blood pressure long term regulation: A neural network model of the set point development

    PubMed Central

    2011-01-01

    Background The notion of the nucleus tractus solitarius (NTS) as a comparator evaluating the error signal between its rostral neural structures (RNS) and the cardiovascular receptor afferents into it has been recently presented. From this perspective, stress can cause hypertension via set point changes, so offering an answer to an old question. Even though the local blood flow to tissues is influenced by circulating vasoactive hormones and also by local factors, there is yet significant sympathetic control. It is well established that the state of maturation of sympathetic innervation of blood vessels at birth varies across animal species and it takes place mostly during the postnatal period. During ontogeny, chemoreceptors are functional; they discharge when the partial pressures of oxygen and carbon dioxide in the arterial blood are not normal. Methods The model is a simple biological plausible adaptative neural network to simulate the development of the sympathetic nervous control. It is hypothesized that during ontogeny, from the RNS afferents to the NTS, the optimal level of each sympathetic efferent discharge is learned through the chemoreceptors' feedback. Its mean discharge leads to normal oxygen and carbon dioxide levels in each tissue. Thus, the sympathetic efferent discharge sets at the optimal level if, despite maximal drift, the local blood flow is compensated for by autoregulation. Such optimal level produces minimum chemoreceptor output, which must be maintained by the nervous system. Since blood flow is controlled by arterial blood pressure, the long-term mean level is stabilized to regulate oxygen and carbon dioxide levels. After development, the cardiopulmonary reflexes play an important role in controlling efferent sympathetic nerve activity to the kidneys and modulating sodium and water excretion. Results Starting from fixed RNS afferents to the NTS and random synaptic weight values, the sympathetic efferents converged to the optimal values

  16. Prioritization of candidate disease genes by enlarging the seed set and fusing information of the network topology and gene expression.

    PubMed

    Zhang, Shao-Wu; Shao, Dong-Dong; Zhang, Song-Yao; Wang, Yi-Bin

    2014-06-01

    The identification of disease genes is very important not only to provide greater understanding of gene function and cellular mechanisms which drive human disease, but also to enhance human disease diagnosis and treatment. Recently, high-throughput techniques have been applied to detect dozens or even hundreds of candidate genes. However, experimental approaches to validate the many candidates are usually time-consuming, tedious and expensive, and sometimes lack reproducibility. Therefore, numerous theoretical and computational methods (e.g. network-based approaches) have been developed to prioritize candidate disease genes. Many network-based approaches implicitly utilize the observation that genes causing the same or similar diseases tend to correlate with each other in gene-protein relationship networks. Of these network approaches, the random walk with restart algorithm (RWR) is considered to be a state-of-the-art approach. To further improve the performance of RWR, we propose a novel method named ESFSC to identify disease-related genes, by enlarging the seed set according to the centrality of disease genes in a network and fusing information of the protein-protein interaction (PPI) network topological similarity and the gene expression correlation. The ESFSC algorithm restarts at all of the nodes in the seed set consisting of the known disease genes and their k-nearest neighbor nodes, then walks in the global network separately guided by the similarity transition matrix constructed with PPI network topological similarity properties and the correlational transition matrix constructed with the gene expression profiles. As a result, all the genes in the network are ranked by weighted fusing the above results of the RWR guided by two types of transition matrices. Comprehensive simulation results of the 10 diseases with 97 known disease genes collected from the Online Mendelian Inheritance in Man (OMIM) database show that ESFSC outperforms existing methods for

  17. The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.

    PubMed

    Djurfeldt, Mikael

    2012-07-01

    The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.

  18. Computers and Communication Networks in Educational Settings in the Twenty-First Century: Preparation for Educators' New Roles.

    ERIC Educational Resources Information Center

    Kook, Joong-Kak

    1997-01-01

    Discussion of changes in classrooms as a result of communication networks focuses on teachers' roles in future educational settings. Topics include teachers as information consultants, as team collaborators, as facilitators, as course developers, and as academic advisors; and the computer and communication skills needed by teachers. (LRW)

  19. Setting Access Permission through Transitive Relationship in Web-based Social Networks

    NASA Astrophysics Data System (ADS)

    Hong, Dan; Shen, Vincent Y.

    The rising popularity of various social networking websites has created a huge problem on Internet privacy. Although it is easy to post photos, comments, opinions on some events, etc. on the Web, some of these data (such as a person’s location at a particular time, criticisms of a politician, etc.) are private and should not be accessed by unauthorized users. Although social networks facilitate sharing, the fear of sending sensitive data to a third party without knowledge or permission of the data owners discourages people from taking full advantage of some social networking applications. We exploit the existing relationships on social networks and build a ‘‘trust network’’ with transitive relationship to allow controlled data sharing so that the privacy and preferences of data owners are respected. The trust network linking private data owners, private data requesters, and intermediary users is a directed weighted graph. The permission value for each private data requester can be automatically assigned in this network based on the transitive relationship. Experiments were conducted to confirm the feasibility of constructing the trust network from existing social networks, and to assess the validity of permission value assignments in the query process. Since the data owners only need to define the access rights of their closest contacts once, this privacy scheme can make private data sharing easily manageable by social network participants.

  20. Effects of Relative Mean Sea Level Variations on Tidal Networks Generated on Experimental Setting

    NASA Astrophysics Data System (ADS)

    Stefanon, L.; Carniello, L.; D'Alpaos, A.; Rinaldo, A.

    2012-12-01

    We present the results of laboratory experiments carried out in a large experimental apparatus aimed at reproducing a typical lagoonal environment subject to tidal forcings. The experimental apparatus consists of two adjoining basins reproducing the sea and the lagoon. The tide is generated at the sea by a vertical steel sharp-edge weir, oscillating vertically. The weir is driven by an ad hoc developed software which continuously corrects the weir motion on the basis of water levels measured at the sea, allowing us to generate a sinusoidal tide of fixed amplitude and period, oscillating around mean water level. The bottom of the lagoon is covered by a layer of cohesionless plastic grains, with a density of 1041 kg/m3. The cohesionless plastic grains are characterized by a nearly uniform grain size distribution, with a median grain size of 0.8 mm. The lack of external sediment supply, the absence of vegetation, and the prevalence of bedload transport prevent any deposition processes and lateral surface accretion, attributing a purely erosive character to the experimental lagoon. As a consequence, in this experimental lagoon the main morphodynamic process responsible for tidal network initiation and development is the differential erosion between the channels and the adjacent surface. The experiments were designed in order to analyze the effects of mean sea level variations on channel network dynamics, focusing on the changes of the relevant geomorphic characteristics of the experimental networks, such as e.g. drainage density, based on the probability distribution of unchanneled lengths, and flowing tidal prism. Our results suggest that a decrease in the tidal prism leads to network retreat and contraction of channel cross sections. Conversely, an increase in the tidal prism promotes network re-incision and re-expansion of channel cross sections. In general, contractions and expansions tend to occur within the same planar blueprint and the network re-expands cutting

  1. Deep learning in the small sample size setting: cascaded feed forward neural networks for medical image segmentation

    NASA Astrophysics Data System (ADS)

    Gaonkar, Bilwaj; Hovda, David; Martin, Neil; Macyszyn, Luke

    2016-03-01

    Deep Learning, refers to large set of neural network based algorithms, have emerged as promising machine- learning tools in the general imaging and computer vision domains. Convolutional neural networks (CNNs), a specific class of deep learning algorithms, have been extremely effective in object recognition and localization in natural images. A characteristic feature of CNNs, is the use of a locally connected multi layer topology that is inspired by the animal visual cortex (the most powerful vision system in existence). While CNNs, perform admirably in object identification and localization tasks, typically require training on extremely large datasets. Unfortunately, in medical image analysis, large datasets are either unavailable or are extremely expensive to obtain. Further, the primary tasks in medical imaging are organ identification and segmentation from 3D scans, which are different from the standard computer vision tasks of object recognition. Thus, in order to translate the advantages of deep learning to medical image analysis, there is a need to develop deep network topologies and training methodologies, that are geared towards medical imaging related tasks and can work in a setting where dataset sizes are relatively small. In this paper, we present a technique for stacked supervised training of deep feed forward neural networks for segmenting organs from medical scans. Each `neural network layer' in the stack is trained to identify a sub region of the original image, that contains the organ of interest. By layering several such stacks together a very deep neural network is constructed. Such a network can be used to identify extremely small regions of interest in extremely large images, inspite of a lack of clear contrast in the signal or easily identifiable shape characteristics. What is even more intriguing is that the network stack achieves accurate segmentation even when it is trained on a single image with manually labelled ground truth. We validate

  2. Mining for bioactive scaffolds with scaffold networks: improved compound set enrichment from primary screening data.

    PubMed

    Varin, Thibault; Schuffenhauer, Ansgar; Ertl, Peter; Renner, Steffen

    2011-07-25

    Identification of meaningful chemical patterns in the increasing amounts of high-throughput-generated bioactivity data available today is an increasingly important challenge for successful drug discovery. Herein, we present the scaffold network as a novel approach for mapping and navigation of chemical and biological space. A scaffold network represents the chemical space of a library of molecules consisting of all molecular scaffolds and smaller "parent" scaffolds generated therefrom by the pruning of rings, effectively leading to a network of common scaffold substructure relationships. This algorithm provides an extension of the scaffold tree algorithm that, instead of a network, generates a tree relationship between a heuristically rule-based selected subset of parent scaffolds. The approach was evaluated for the identification of statistically significantly active scaffolds from primary screening data for which the scaffold tree approach has already been shown to be successful. Because of the exhaustive enumeration of smaller scaffolds and the full enumeration of relationships between them, about twice as many statistically significantly active scaffolds were identified compared to the scaffold-tree-based approach. We suggest visualizing scaffold networks as islands of active scaffolds.

  3. Algorithms for Data Sharing, Coordination, and Communication in Dynamic Network Settings

    DTIC Science & Technology

    2007-12-03

    Chakraborty, and Nancy Lynch. Clock Synchronization for Wireless Networks. In Teruo Higashino , editor, Principles of Distributed Systems: OPODIS 2004: 8th...Teruo Higashino , editor, Principles of Distributed Systems: OPODIS 2004: 8th International Conference on Principles of Distributed 4 Systems, Grenoble

  4. Secure Your Wireless Network: Going Wireless Comes with Its Own Special Set of Security Concerns

    ERIC Educational Resources Information Center

    Bloomquist, Jane; Musa, Atif

    2004-01-01

    Imagine a completely wireless school, an open network in which all students and staff can roam around using laptops or handheld computers to browse the Internet, access files and applications on the school server, and communicate with each other and the world via e-mail. It's a great picture--and at some schools the future is already here. But…

  5. Summary information and data sets for the HBCU Solar Measurements Network

    SciTech Connect

    Marion, W

    1994-08-01

    Since 1985, the National Renewable Energy Laboratory (NREL), formerly the Solar Energy Research Institute (SERI), has operated a solar radiation measurement network of six stations located at Historically Black Colleges and Universities (HBCUs) in the southeastern United States. NREL initiated this network to provide better regional coverage and to comply with President Reagan`s Executive Order 12320, dated September 15, 1981, directing all federal agencies to implement programs to strengthen the nation`s HBCUs. Funding for the HBCU network has been provided by the Department of Energy`s (DOE`s) Resource Assessment Program, Photovoltaic Program, and Solar Thermal Program, and it is currently funded by the Solar Radiation Resource Assessment Project. The objectives of the HBCU network are (1) To significantly improve the assessment of solar radiation resources in the southeastern United States; (2) To enlist the help of the HBCUs in collecting high-quality solar radiation data; (3) To encourage the distribution of solar radiation resource information and the development of solar energy applications in the Southeast; (4) To encourage the development of academic and research programs in solar energy at HBCUs.

  6. Unions Set Sights on High-Profile Charter-Network Schools

    ERIC Educational Resources Information Center

    Sawchuk, Stephen

    2009-01-01

    What started as a ripple in the charter community shows signs of becoming a wave as major charter school networks scramble to respond to an unfamiliar phenomenon: moves by their teachers to organize unions. In the first half of this year, teachers formed collective bargaining units in schools run by several of the best-known and highest-profile…

  7. Recent developments in the setting up of the Malta Seismic Network

    NASA Astrophysics Data System (ADS)

    Agius, Matthew; Galea, Pauline; D'Amico, Sebastiano

    2015-04-01

    Weak to moderate earthquakes in the Sicily Channel have until now been either poorly located or left undetected. The number of seismic stations operated by various networks: Italy (INGV), Tunisia (TT), and Libya (LNSN) have now improved considerably, however most of the seismicity occurs offshore, in the central part of the Channel, away from the mainland stations. Seismic data availability from island stations across the Channel has been limited or had intermittent transmission hindering proper real-time earthquake monitoring and hypocentre relocation. In order to strengthen the seismic monitoring of the Sicily Channel, in particular the central parts of the Channel, the Seismic Monitoring and Research Unit (SMRU), University of Malta, has, in the last year, been installing a permanent seismic network across the Maltese archipelago: the Malta Seismic Network (ML). Furthermore the SMRU has upgraded its IT facilities to run a virtual regional seismic network composed of the stations on Pantelleria and Lampedusa, together with all the currently publicly available stations in the region. Selected distant seismic stations found elsewhere in the Mediterranean and across the globe have also been incorporated in the system in order to enhance the overall performance of the monitoring and to detect potentially damaging regional earthquakes. Data acquisition and processing of the seismic networks are run by SeisComP. The new installations are part of the project SIMIT (B1-2.19/11) funded by the Italia-Malta Operational Programme 2007-2013. The new system allows the SMRU to rapidly perform more accurate hypocentre locations in the region, and issue automatic SMS alert for potentially felt events in the Sicily Channel detected by the network and for strong earthquakes elsewhere. Within the SIMIT project, the alert system will include civil protection departments in Malta and Sicily. We present the recent developments of the real and virtual seismic network, and discuss the

  8. MAXBAND Version 3.1: Heuristic and optimal approach for setting the left turn phase sequences in signalized networks

    SciTech Connect

    Pillai, R.S.; Rathi, A.K.

    1995-02-01

    The main objective of synchronized signal timing is to keep traffic moving along arterials in platoons throughout the signal system by proper setting of left turn phase sequence at signals along the arterials/networks. The synchronization of traffic signals located along the urban/suburban arterials in metropolitan areas is perhaps one of the most cost-effective methods for improving traffic flow along these streets. MAXBAND Version 2.1 (formerly known as MAXBAND-86), a progression-based optimization model, is used for generating signal timing plan for urban networks. This model formulates the problem as a mixed integer linear program and uses Land and Powell branch and bound search to arrive at the optimal solution. The computation time of MAXBAND Version 2.1 tends to be excessive for realistic multiarterial network problems due to the exhaustive nature of the branch and bound search technique. Furthermore, the Land and Powell branch and bound code is known to be numerically unstable, which results in suboptimal solutions for network problems with a range on the cycle time variable. This report presents the development of a new version of MAXBAND called MAXBAND Version 3.1. This new version has a fast heuristic algorithm and a fast optimal algorithm for generating signal timing plan for arterials and networks. MAXBAND 3.1 can generate optimal/near-optimal solutions in fraction of the time needed to compute the optimal solution by Version 2.1. The heuristic algorithm in the new model is based on restricted search using branch and bound technique. The algorithm for generating the optimal solution is faster and more efficient than version 2.1 algorithm. Furthermore, the new version is numerically stable. The efficiency of the new model is demonstrated by numerical results for a set of test problems.

  9. A Validated Set of MIDAS V5 Task Network Model Scenarios to Evaluate Nextgen Closely Spaced Parallel Operations Concepts

    NASA Technical Reports Server (NTRS)

    Gore, Brian Francis; Hooey, Becky Lee; Haan, Nancy; Socash, Connie; Mahlstedt, Eric; Foyle, David C.

    2013-01-01

    The Closely Spaced Parallel Operations (CSPO) scenario is a complex, human performance model scenario that tested alternate operator roles and responsibilities to a series of off-nominal operations on approach and landing (see Gore, Hooey, Mahlstedt, Foyle, 2013). The model links together the procedures, equipment, crewstation, and external environment to produce predictions of operator performance in response to Next Generation system designs, like those expected in the National Airspaces NextGen concepts. The task analysis that is contained in the present report comes from the task analysis window in the MIDAS software. These tasks link definitions and states for equipment components, environmental features as well as operational contexts. The current task analysis culminated in 3300 tasks that included over 1000 Subject Matter Expert (SME)-vetted, re-usable procedural sets for three critical phases of flight; the Descent, Approach, and Land procedural sets (see Gore et al., 2011 for a description of the development of the tasks included in the model; Gore, Hooey, Mahlstedt, Foyle, 2013 for a description of the model, and its results; Hooey, Gore, Mahlstedt, Foyle, 2013 for a description of the guidelines that were generated from the models results; Gore, Hooey, Foyle, 2012 for a description of the models implementation and its settings). The rollout, after landing checks, taxi to gate and arrive at gate illustrated in Figure 1 were not used in the approach and divert scenarios exercised. The other networks in Figure 1 set up appropriate context settings for the flight deck.The current report presents the models task decomposition from the tophighest level and decomposes it to finer-grained levels. The first task that is completed by the model is to set all of the initial settings for the scenario runs included in the model (network 75 in Figure 1). This initialization process also resets the CAD graphic files contained with MIDAS, as well as the embedded

  10. Quantum state reconstruction of an oscillator network in an optomechanical setting

    NASA Astrophysics Data System (ADS)

    Moore, Darren W.; Tufarelli, Tommaso; Paternostro, Mauro; Ferraro, Alessandro

    2016-11-01

    We introduce a scheme to reconstruct an arbitrary quantum state of a mechanical oscillator network. We assume that a single element of the network is coupled to a cavity field via a linearized optomechanical interaction, the time dependence of which is controlled by a classical driving field. By designing a suitable interaction profile, we show how the statistics of an arbitrary mechanical quadrature can be encoded in the cavity field, which can then be measured. We discuss the important special case of Gaussian state reconstruction and study numerically the effectiveness of our scheme for a finite number of measurements. Finally, we speculate on possible routes to extend our ideas to the regime of single-photon optomechanics.

  11. Physical rehabilitation in post-conflict settings: analysis of public policy and stakeholder networks.

    PubMed

    Blanchet, Karl; Girois, Susan; Urseau, Isabelle; Smerdon, Christine; Drouet, Yann; Jama, Ali

    2014-01-01

    Physical rehabilitation plays a determinant role in post-conflict contexts to restore disabled citizens' mobility and independence. While the main objectives of any physical rehabilitation programme are to ensure that the services provided are accessible and of good quality to meet existing needs, it is intended that the services need to be supported over the long term by public health and social welfare authorities. This article presents the results of a study conducted in three post-conflict countries on the relationships between the level of commitment of national governments to rehabilitation services and the influence of social networks on national policy related to physical rehabilitation. From a policy and resource standpoint, the environment in Nepal is the most favourable for creating leverage at the national level to influence the commitment of ministries in the rehabilitation sector, compared with Cambodia and Somaliland. Stakeholder network analysis in Nepal, furthermore, reveals a dominant civil society and private sector supporting rehabilitation services, including intense involvement of local organisations and user groups. Implications for Rehabilitation Physical rehabilitation is not on the top of the agenda of governments in fragile states. The commitment and involvement of national authorities in the rehabilitation sector is positively influenced by civil society and international organisations. The denser the social network of the rehabilitation sector is, the more influence the actors can exert influence over national authorities.

  12. Mitochondrial superoxide in osteocytes perturbs canalicular networks in the setting of age-related osteoporosis.

    PubMed

    Kobayashi, Keiji; Nojiri, Hidetoshi; Saita, Yoshitomo; Morikawa, Daichi; Ozawa, Yusuke; Watanabe, Kenji; Koike, Masato; Asou, Yoshinori; Shirasawa, Takuji; Yokote, Koutaro; Kaneko, Kazuo; Shimizu, Takahiko

    2015-03-16

    Osteocytes are major bone cells that play a crucial role in maintaining the quality of and healing damage to bone tissue. The number of living osteocytes and canalicular networks declines in an age-dependent manner. However, the pathological effects of mitochondrial redox imbalances on osteocytes and bone metabolism have not been fully elucidated. We generated mice lacking mitochondrial superoxide dismutase 2 (Sod2) in osteocytes. Like an aged bone, Sod2 depletion in the osteocytes positively enhanced the production of cellular superoxide in vivo. A bone morphological analysis demonstrated that the Sod2-deficient femurs showed remarkable bone loss in an age-dependent manner. Interestingly, Sod2 loss induced markedly disorganized osteocytic canalicular networks and decreased the number of live osteocytes. Furthermore, Sod2 deficiency significantly suppressed bone formation and increased bone resorption concomitant with the upregulation of sclerostin and receptor activator of NF-κB ligand (RANKL). In vitro experiments also revealed that treatment with paraquat, a superoxide inducer in mitochondria, promoted the RANKL expression via, in part, ERK phosphorylation. These findings demonstrate that the mitochondrial superoxide induced in osteocytes by Sod2 ablation causes age-related bone loss due to the impairment of canalicular networks and bone metabolism via the deregulation of the sclerostin and RANKL expression.

  13. Mitochondrial superoxide in osteocytes perturbs canalicular networks in the setting of age-related osteoporosis

    PubMed Central

    Kobayashi, Keiji; Nojiri, Hidetoshi; Saita, Yoshitomo; Morikawa, Daichi; Ozawa, Yusuke; Watanabe, Kenji; Koike, Masato; Asou, Yoshinori; Shirasawa, Takuji; Yokote, Koutaro; Kaneko, Kazuo; Shimizu, Takahiko

    2015-01-01

    Osteocytes are major bone cells that play a crucial role in maintaining the quality of and healing damage to bone tissue. The number of living osteocytes and canalicular networks declines in an age-dependent manner. However, the pathological effects of mitochondrial redox imbalances on osteocytes and bone metabolism have not been fully elucidated. We generated mice lacking mitochondrial superoxide dismutase 2 (Sod2) in osteocytes. Like an aged bone, Sod2 depletion in the osteocytes positively enhanced the production of cellular superoxide in vivo. A bone morphological analysis demonstrated that the Sod2-deficient femurs showed remarkable bone loss in an age-dependent manner. Interestingly, Sod2 loss induced markedly disorganized osteocytic canalicular networks and decreased the number of live osteocytes. Furthermore, Sod2 deficiency significantly suppressed bone formation and increased bone resorption concomitant with the upregulation of sclerostin and receptor activator of NF-κB ligand (RANKL). In vitro experiments also revealed that treatment with paraquat, a superoxide inducer in mitochondria, promoted the RANKL expression via, in part, ERK phosphorylation. These findings demonstrate that the mitochondrial superoxide induced in osteocytes by Sod2 ablation causes age-related bone loss due to the impairment of canalicular networks and bone metabolism via the deregulation of the sclerostin and RANKL expression. PMID:25779629

  14. Structured Set Intra Prediction With Discriminative Learning in a Max-Margin Markov Network for High Efficiency Video Coding

    PubMed Central

    Dai, Wenrui; Xiong, Hongkai; Jiang, Xiaoqian; Chen, Chang Wen

    2014-01-01

    This paper proposes a novel model on intra coding for High Efficiency Video Coding (HEVC), which simultaneously predicts blocks of pixels with optimal rate distortion. It utilizes the spatial statistical correlation for the optimal prediction based on 2-D contexts, in addition to formulating the data-driven structural interdependences to make the prediction error coherent with the probability distribution, which is desirable for successful transform and coding. The structured set prediction model incorporates a max-margin Markov network (M3N) to regulate and optimize multiple block predictions. The model parameters are learned by discriminating the actual pixel value from other possible estimates to maximize the margin (i.e., decision boundary bandwidth). Compared to existing methods that focus on minimizing prediction error, the M3N-based model adaptively maintains the coherence for a set of predictions. Specifically, the proposed model concurrently optimizes a set of predictions by associating the loss for individual blocks to the joint distribution of succeeding discrete cosine transform coefficients. When the sample size grows, the prediction error is asymptotically upper bounded by the training error under the decomposable loss function. As an internal step, we optimize the underlying Markov network structure to find states that achieve the maximal energy using expectation propagation. For validation, we integrate the proposed model into HEVC for optimal mode selection on rate-distortion optimization. The proposed prediction model obtains up to 2.85% bit rate reduction and achieves better visual quality in comparison to the HEVC intra coding. PMID:25505829

  15. Functional network construction in Arabidopsis using rule-based machine learning on large-scale data sets.

    PubMed

    Bassel, George W; Glaab, Enrico; Marquez, Julietta; Holdsworth, Michael J; Bacardit, Jaume

    2011-09-01

    The meta-analysis of large-scale postgenomics data sets within public databases promises to provide important novel biological knowledge. Statistical approaches including correlation analyses in coexpression studies of gene expression have emerged as tools to elucidate gene function using these data sets. Here, we present a powerful and novel alternative methodology to computationally identify functional relationships between genes from microarray data sets using rule-based machine learning. This approach, termed "coprediction," is based on the collective ability of groups of genes co-occurring within rules to accurately predict the developmental outcome of a biological system. We demonstrate the utility of coprediction as a powerful analytical tool using publicly available microarray data generated exclusively from Arabidopsis thaliana seeds to compute a functional gene interaction network, termed Seed Co-Prediction Network (SCoPNet). SCoPNet predicts functional associations between genes acting in the same developmental and signal transduction pathways irrespective of the similarity in their respective gene expression patterns. Using SCoPNet, we identified four novel regulators of seed germination (ALTERED SEED GERMINATION5, 6, 7, and 8), and predicted interactions at the level of transcript abundance between these novel and previously described factors influencing Arabidopsis seed germination. An online Web tool to query SCoPNet has been developed as a community resource to dissect seed biology and is available at http://www.vseed.nottingham.ac.uk/.

  16. A novel proposal of a simplified bacterial gene set and the neo-construction of a general minimized metabolic network

    PubMed Central

    Ye, Yuan-Nong; Ma, Bin-Guang; Dong, Chuan; Zhang, Hong; Chen, Ling-Ling; Guo, Feng-Biao

    2016-01-01

    A minimal gene set (MGS) is critical for the assembly of a minimal artificial cell. We have developed a proposal of simplifying bacterial gene set to approximate a bacterial MGS by the following procedure. First, we base our simplified bacterial gene set (SBGS) on experimentally determined essential genes to ensure that the genes included in the SBGS are critical. Second, we introduced a half-retaining strategy to extract persistent essential genes to ensure stability. Third, we constructed a viable metabolic network to supplement SBGS. The proposed SBGS includes 327 genes and required 431 reactions. This report describes an SBGS that preserves both self-replication and self-maintenance systems. In the minimized metabolic network, we identified five novel hub metabolites and confirmed 20 known hubs. Highly essential genes were found to distribute the connecting metabolites into more reactions. Based on our SBGS, we expanded the pool of targets for designing broad-spectrum antibacterial drugs to reduce pathogen resistance. We also suggested a rough semi-de novo strategy to synthesize an artificial cell, with potential applications in industry. PMID:27713529

  17. A replica exchange transition interface sampling method with multiple interface sets for investigating networks of rare events

    NASA Astrophysics Data System (ADS)

    Swenson, David W. H.; Bolhuis, Peter G.

    2014-07-01

    The multiple state transition interface sampling (TIS) framework in principle allows the simulation of a large network of complex rare event transitions, but in practice suffers from convergence problems. To improve convergence, we combine multiple state TIS [J. Rogal and P. G. Bolhuis, J. Chem. Phys. 129, 224107 (2008)] with replica exchange TIS [T. S. van Erp, Phys. Rev. Lett. 98, 268301 (2007)]. In addition, we introduce multiple interface sets, which allow more than one order parameter to be defined for each state. We illustrate the methodology on a model system of multiple independent dimers, each with two states. For reaction networks with up to 64 microstates, we determine the kinetics in the microcanonical ensemble, and discuss the convergence properties of the sampling scheme. For this model, we find that the kinetics depend on the instantaneous composition of the system. We explain this dependence in terms of the system's potential and kinetic energy.

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

    PubMed

    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.

  19. Paediatric obesity research in early childhood and the primary care setting: the TARGet Kids! research network.

    PubMed

    Morinis, Julia; Maguire, Jonathon; Khovratovich, Marina; McCrindle, Brian W; Parkin, Patricia C; Birken, Catherine S

    2012-04-01

    Primary paediatric health care is the foundation for preventative child health. In light of the recent obesity epidemic, paediatricians find themselves at the frontline of identification and management of childhood obesity. However, it is well recognized that evidence based approaches to obesity prevention and subsequent translation of this evidence into practice are critically needed. This paper explores the role of primary care in obesity prevention and introduces a novel application and development of a primary care research network in Canada--TARGet Kids!--to develop and translate an evidence-base on effective screening and prevention of childhood obesity.

  20. Paediatric Obesity Research in Early Childhood and the Primary Care Setting: The TARGet Kids! Research Network

    PubMed Central

    Morinis, Julia; Maguire, Jonathon; Khovratovich, Marina; McCrindle, Brian W.; Parkin, Patricia C.; Birken, Catherine S.

    2012-01-01

    Primary paediatric health care is the foundation for preventative child health. In light of the recent obesity epidemic, paediatricians find themselves at the frontline of identification and management of childhood obesity. However, it is well recognized that evidence based approaches to obesity prevention and subsequent translation of this evidence into practice are critically needed. This paper explores the role of primary care in obesity prevention and introduces a novel application and development of a primary care research network in Canada—TARGet Kids!—to develop and translate an evidence-base on effective screening and prevention of childhood obesity. PMID:22690197

  1. Editor's Highlight: Evaluation of a Microelectrode Array-Based Assay for Neural Network Ontogeny Using Training Set Chemicals.

    PubMed

    Brown, Jasmine P; Hall, Diana; Frank, Christopher L; Wallace, Kathleen; Mundy, William R; Shafer, Timothy J

    2016-11-01

    Thousands of compounds in the environment have not been characterized for developmental neurotoxicity (DNT) hazard. To address this issue, methods to screen compounds rapidly for DNT hazard evaluation are necessary and are being developed for key neurodevelopmental processes. In order to develop an assay for network formation, this study evaluated effects of a training set of chemicals on network ontogeny by measuring spontaneous electrical activity in neural networks grown on microelectrode arrays (MEAs). Rat (0-24 h old) primary cortical cells were plated in 48 well-MEA plates and exposed to 6 compounds: acetaminophen, bisindolylmaleimide-1 (Bis-1), domoic acid, mevastatin, sodium orthovanadate, and loperamide for a period of 12 days. Spontaneous network activity was recorded on days 2, 5, 7, 9, and 12 and viability was assessed using the Cell Titer Blue assay on day 12. Network activity (e.g. mean firing rate [MFR], burst rate [BR], etc), increased between days 5 and 12. Random Forest analysis indicated that across all compounds and times, temporal correlation of firing patterns (r), MFR, BR, number of active electrodes and % of spikes in a burst were the most influential parameters in separating control from treated wells. All compounds except acetaminophen (≤ 30 µM) caused concentration-related effects on one or more of these parameters. Domoic acid and sodium orthovanadate altered several of these parameters in the absence of cytotoxicity. Although cytotoxicity was observed with Bis1, mevastatin, and loperamide, some parameters were affected by these compounds at concentrations below those resulting in cytotoxicity. These results demonstrate that this assay may be suitable for screening of compounds for DNT hazard identification.

  2. Spatial Fingerprints of Community Structure in Human Interaction Network for an Extensive Set of Large-Scale Regions

    PubMed Central

    Kallus, Zsófia; Barankai, Norbert; Szüle, János; Vattay, Gábor

    2015-01-01

    Human interaction networks inferred from country-wide telephone activity recordings were recently used to redraw political maps by projecting their topological partitions into geographical space. The results showed remarkable spatial cohesiveness of the network communities and a significant overlap between the redrawn and the administrative borders. Here we present a similar analysis based on one of the most popular online social networks represented by the ties between more than 5.8 million of its geo-located users. The worldwide coverage of their measured activity allowed us to analyze the large-scale regional subgraphs of entire continents and an extensive set of examples for single countries. We present results for North and South America, Europe and Asia. In our analysis we used the well-established method of modularity clustering after an aggregation of the individual links into a weighted graph connecting equal-area geographical pixels. Our results show fingerprints of both of the opposing forces of dividing local conflicts and of uniting cross-cultural trends of globalization. PMID:25993329

  3. SELPHI: correlation-based identification of kinase-associated networks from global phospho-proteomics data sets

    PubMed Central

    Petsalaki, Evangelia; Helbig, Andreas O.; Gopal, Anjali; Pasculescu, Adrian; Roth, Frederick P.; Pawson, Tony

    2015-01-01

    While phospho-proteomics studies have shed light on the dynamics of cellular signaling, they mainly describe global effects and rarely explore mechanistic details, such as kinase/substrate relationships. Tools and databases, such as NetworKIN and PhosphoSitePlus, provide valuable regulatory details on signaling networks but rely on prior knowledge. They therefore provide limited information on less studied kinases and fewer unexpected relationships given that better studied signaling events can mask condition- or cell-specific ‘network wiring’. SELPHI is a web-based tool providing in-depth analysis of phospho-proteomics data that is intuitive and accessible to non-bioinformatics experts. It uses correlation analysis of phospho-sites to extract kinase/phosphatase and phospho-peptide associations, and highlights the potential flow of signaling in the system under study. We illustrate SELPHI via analysis of phospho-proteomics data acquired in the presence of erlotinib—a tyrosine kinase inhibitor (TKI)—in cancer cells expressing TKI-resistant and -sensitive variants of the Epidermal Growth Factor Receptor. In this data set, SELPHI revealed information overlooked by the reporting study, including the known role of MET and EPHA2 kinases in conferring resistance to erlotinib in TKI sensitive strains. SELPHI can significantly enhance the analysis of phospho-proteomics data contributing to improved understanding of sample-specific signaling networks. SELPHI is freely available via http://llama.mshri.on.ca/SELPHI. PMID:25948583

  4. Setting up a Wireless Local Area Network (WLAN) for a healthcare system.

    PubMed

    Wang, Jin; Du, Hongwei

    2005-01-01

    WLAN can help the medical professionals to improve their working efficiency and reduce medical errors. In this paper, the important issues of deploying WLAN in hospitals are discussed. It gives a comprehensive overview of how to set up the mobility, Quality of Service (QoS) and security of the WLAN for a healthcare system. IEEE 802.11e standard and the Health Insurance Portability and Accountability ACT (HIPAA) regulations are discussed and some suggestions are given to meet the specific requirements of a healthcare environment.

  5. Spiking neural networks with different reinforcement learning (RL) schemes in a multiagent setting.

    PubMed

    Christodoulou, Chris; Cleanthous, Aristodemos

    2010-12-31

    This paper investigates the effectiveness of spiking agents when trained with reinforcement learning (RL) in a challenging multiagent task. In particular, it explores learning through reward-modulated spike-timing dependent plasticity (STDP) and compares it to reinforcement of stochastic synaptic transmission in the general-sum game of the Iterated Prisoner's Dilemma (IPD). More specifically, a computational model is developed where we implement two spiking neural networks as two "selfish" agents learning simultaneously but independently, competing in the IPD game. The purpose of our system (or collective) is to maximise its accumulated reward in the presence of reward-driven competing agents within the collective. This can only be achieved when the agents engage in a behaviour of mutual cooperation during the IPD. Previously, we successfully applied reinforcement of stochastic synaptic transmission to the IPD game. The current study utilises reward-modulated STDP with eligibility trace and results show that the system managed to exhibit the desired behaviour by establishing mutual cooperation between the agents. It is noted that the cooperative outcome was attained after a relatively short learning period which enhanced the accumulation of reward by the system. As in our previous implementation, the successful application of the learning algorithm to the IPD becomes possible only after we extended it with additional global reinforcement signals in order to enhance competition at the neuronal level. Moreover it is also shown that learning is enhanced (as indicated by an increased IPD cooperative outcome) through: (i) strong memory for each agent (regulated by a high eligibility trace time constant) and (ii) firing irregularity produced by equipping the agents' LIF neurons with a partial somatic reset mechanism.

  6. The Setting-up of Multi-Site School Collaboratives: The Benefits of This Organizational Reform in Terms of Networking Opportunities and Their Effects

    ERIC Educational Resources Information Center

    Mifsud, Denise

    2015-01-01

    This article, which is set within the Maltese education scenario of unfolding decentralization through the setting-up of multi-site school collaboratives (legally termed "colleges") via a policy mandate, explores a particular aspect of this reform--that of "networking". This is examined in terms of the potential for…

  7. Universal set of dynamically protected gates for bipartite qubit networks: Soft pulse implementation of the [[5,1,3

    NASA Astrophysics Data System (ADS)

    De, Amrit; Pryadko, Leonid P.

    2016-04-01

    We model repetitive quantum error correction (QEC) with the single-error-correcting five-qubit code on a network of individually controlled qubits with always-on Ising couplings. We use our previously designed universal set of quantum gates based on sequences of shaped decoupling pulses. In addition to being accurate quantum gates, the sequences also provide dynamical decoupling (DD) of low-frequency phase noise. The simulation involves integrating the unitary dynamics of six qubits over the duration of tens of thousands of control pulses, using classical stochastic phase noise as a source of decoherence. The combined DD and QEC protocol dramatically improves the coherence, with the QEC alone being responsible for more than an order of magnitude infidelity reduction.

  8. Energy-efficient key distribution using electrocardiograph biometric set for secure communications in wireless body healthcare networks.

    PubMed

    Shi, Jinyang; Lam, Kwok-Yan; Gu, Ming; Li, Mingze; Chung, Siu-Leung

    2011-10-01

    Wireless body sensor network (WBSN) has gained significant interests as an important infrastructure for real-time biomedical healthcare systems, while the security of the sensitive health information becomes one of the main challenges. Due to the constraints of limited power, traditional cryptographic key distribution schemes are not suitable for WBSN. This paper proposes a novel energy-efficient approach, BodyKey, which can distribute the keys using the electrocardiograph biometrics. BodyKey represents the biometric features as ordered set, and deals with the biometric variations using set reconciliation. In this way, only limited necessary information needs to be communicated for key agreement, and the total energy consumption for key distribution can thus be reduced. Experiments on the PhysioBank Database show that BodyKey can perform an energy consumption rate of 0.01 mJ/bit with an equal accuracy rate of 97.28%, allowing the system to be used as an energy-efficient key distribution scheme for secure communications in WBSN.

  9. Distributed Event-Based Set-Membership Filtering for a Class of Nonlinear Systems With Sensor Saturations Over Sensor Networks.

    PubMed

    Ma, Lifeng; Wang, Zidong; Lam, Hak-Keung; Kyriakoulis, Nikos

    2016-07-07

    In this paper, the distributed set-membership filtering problem is investigated for a class of discrete time-varying system with an event-based communication mechanism over sensor networks. The system under consideration is subject to sector-bounded nonlinearity, unknown but bounded noises and sensor saturations. Each intelligent sensing node transmits the data to its neighbors only when certain triggering condition is violated. By means of a set of recursive matrix inequalities, sufficient conditions are derived for the existence of the desired distributed event-based filter which is capable of confining the system state in certain ellipsoidal regions centered at the estimates. Within the established theoretical framework, two additional optimization problems are formulated: one is to seek the minimal ellipsoids (in the sense of matrix trace) for the best filtering performance, and the other is to maximize the triggering threshold so as to reduce the triggering frequency with satisfactory filtering performance. A numerically attractive chaos algorithm is employed to solve the optimization problems. Finally, an illustrative example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.

  10. Design of cognitive engine for cognitive radio based on the rough sets and radial basis function neural network

    NASA Astrophysics Data System (ADS)

    Yang, Yanchao; Jiang, Hong; Liu, Congbin; Lan, Zhongli

    2013-03-01

    Cognitive radio (CR) is an intelligent wireless communication system which can dynamically adjust the parameters to improve system performance depending on the environmental change and quality of service. The core technology for CR is the design of cognitive engine, which introduces reasoning and learning methods in the field of artificial intelligence, to achieve the perception, adaptation and learning capability. Considering the dynamical wireless environment and demands, this paper proposes a design of cognitive engine based on the rough sets (RS) and radial basis function neural network (RBF_NN). The method uses experienced knowledge and environment information processed by RS module to train the RBF_NN, and then the learning model is used to reconfigure communication parameters to allocate resources rationally and improve system performance. After training learning model, the performance is evaluated according to two benchmark functions. The simulation results demonstrate the effectiveness of the model and the proposed cognitive engine can effectively achieve the goal of learning and reconfiguration in cognitive radio.

  11. Naturally-Emerging Technology-Based Leadership Roles in Three Independent Schools: A Social Network-Based Case Study Using Fuzzy Set Qualitative Comparative Analysis

    ERIC Educational Resources Information Center

    Velastegui, Pamela J.

    2013-01-01

    This hypothesis-generating case study investigates the naturally emerging roles of technology brokers and technology leaders in three independent schools in New York involving 92 school educators. A multiple and mixed method design utilizing Social Network Analysis (SNA) and fuzzy set Qualitative Comparative Analysis (FSQCA) involved gathering…

  12. A new 2.5D representation for lymph node detection using random sets of deep convolutional neural network observations.

    PubMed

    Roth, Holger R; Lu, Le; Seff, Ari; Cherry, Kevin M; Hoffman, Joanne; Wang, Shijun; Liu, Jiamin; Turkbey, Evrim; Summers, Ronald M

    2014-01-01

    Automated Lymph Node (LN) detection is an important clinical diagnostic task but very challenging due to the low contrast of surrounding structures in Computed Tomography (CT) and to their varying sizes, poses, shapes and sparsely distributed locations. State-of-the-art studies show the performance range of 52.9% sensitivity at 3.1 false-positives per volume (FP/vol.), or 60.9% at 6.1 FP/vol. for mediastinal LN, by one-shot boosting on 3D HAAR features. In this paper, we first operate a preliminary candidate generation stage, towards -100% sensitivity at the cost of high FP levels (-40 per patient), to harvest volumes of interest (VOI). Our 2.5D approach consequently decomposes any 3D VOI by resampling 2D reformatted orthogonal views N times, via scale, random translations, and rotations with respect to the VOI centroid coordinates. These random views are then used to train a deep Convolutional Neural Network (CNN) classifier. In testing, the CNN is employed to assign LN probabilities for all N random views that can be simply averaged (as a set) to compute the final classification probability per VOI. We validate the approach on two datasets: 90 CT volumes with 388 mediastinal LNs and 86 patients with 595 abdominal LNs. We achieve sensitivities of 70%/83% at 3 FP/vol. and 84%/90% at 6 FP/vol. in mediastinum and abdomen respectively, which drastically improves over the previous state-of-the-art work.

  13. A New 2.5D Representation for Lymph Node Detection using Random Sets of Deep Convolutional Neural Network Observations

    PubMed Central

    Lu, Le; Seff, Ari; Cherry, Kevin M.; Hoffman, Joanne; Wang, Shijun; Liu, Jiamin; Turkbey, Evrim; Summers, Ronald M.

    2015-01-01

    Automated Lymph Node (LN) detection is an important clinical diagnostic task but very challenging due to the low contrast of surrounding structures in Computed Tomography (CT) and to their varying sizes, poses, shapes and sparsely distributed locations. State-of-the-art studies show the performance range of 52.9% sensitivity at 3.1 false-positives per volume (FP/vol.), or 60.9% at 6.1 FP/vol. for mediastinal LN, by one-shot boosting on 3D HAAR features. In this paper, we first operate a preliminary candidate generation stage, towards ~100% sensitivity at the cost of high FP levels (~40 per patient), to harvest volumes of interest (VOI). Our 2.5D approach consequently decomposes any 3D VOI by resampling 2D reformatted orthogonal views N times, via scale, random translations, and rotations with respect to the VOI centroid coordinates. These random views are then used to train a deep Convolutional Neural Network (CNN) classifier. In testing, the CNN is employed to assign LN probabilities for all N random views that can be simply averaged (as a set) to compute the final classification probability per VOI. We validate the approach on two datasets: 90 CT volumes with 388 mediastinal LNs and 86 patients with 595 abdominal LNs. We achieve sensitivities of 70%/83% at 3 FP/vol. and 84%/90% at 6 FP/vol. in mediastinum and abdomen respectively, which drastically improves over the previous state-of-the-art work. PMID:25333158

  14. A nonlinear training set superposition filter derived by neural network training methods for implementation in a shift-invariant optical correlator

    NASA Astrophysics Data System (ADS)

    Kypraios, Ioannis; Young, Rupert C. D.; Birch, Philip M.; Chatwin, Christopher R.

    2003-08-01

    The various types of synthetic discriminant function (sdf) filter result in a weighted linear superposition of the training set images. Neural network training procedures result in a non-linear superposition of the training set images or, effectively, a feature extraction process, which leads to better interpolation properties than achievable with the sdf filter. However, generally, shift invariance is lost since a data dependant non-linear weighting function is incorporated in the input data window. As a compromise, we train a non-linear superposition filter via neural network methods with the constraint of a linear input to allow for shift invariance. The filter can then be used in a frequency domain based optical correlator. Simulation results are presented that demonstrate the improved training set interpolation achieved by the non-linear filter as compared to a linear superposition filter.

  15. From global agenda-setting to domestic implementation: successes and challenges of the global health network on tobacco control.

    PubMed

    Gneiting, Uwe

    2016-04-01

    Global policy attention to tobacco control has increased significantly since the 1990 s and culminated in the first international treaty negotiated under the auspices of the World Health Organization--the Framework Convention on Tobacco Control (FCTC). Although the political process that led to the creation of the FCTC has been extensively researched, the FCTC's progression from an aspirational treaty towards a global health governance framework with tangible policy effects within FCTC member countries has not been well-understood to date. This article analyses the role of the global health network of tobacco control advocates and scientists, which formed during the FCTC negotiations during the late 1990 s, in translating countries' commitment to the FCTC into domestic policy change. By comparing the network's influence around two central tobacco control interventions (smoke-free environments and taxation), the study identifies several scope conditions, which have shaped the network's effectiveness around the FCTC's implementation: the complexity of the policy issue and the relative importance of non-health expertise, the required scope of domestic political buy-in, the role of the general public as network allies, and the strength of policy opposition. These political factors had a greater influence on the network's success than the evidence base for the effectiveness of tobacco control interventions. The network's variable success points to a trade-off faced by global health networks between their need to maintain internal cohesion and their ability to form alliances with actors in their social environment.

  16. Time series analysis of benzo[A]pyrene-induced transcriptome changes suggests that a network of transcription factors regulates the effects on functional gene sets.

    PubMed

    van Delft, Joost H M; Mathijs, Karen; Staal, Yvonne C M; van Herwijnen, Marcel H M; Brauers, Karen J J; Boorsma, André; Kleinjans, Jos C S

    2010-10-01

    Chemical carcinogens may cause a multitude of effects inside cells, thereby affecting transcript levels of genes by direct activation of transcription factors (TF) or indirectly through the formation of DNA damage. As the temporal profiles of these responses may be profoundly different, examining time-dependent changes may provide new insights in TF networks related to cellular responses to chemical carcinogens. Therefore, we investigated in human hepatoma cells gene expression changes caused by benzo[a]pyrene at 12 time points after exposure, in relation to DNA adduct and cell cycle. Temporal profiles for functional gene sets demonstrate both early and late effects in up- and downregulation of relevant gene sets involved in cell cycle, apoptosis, DNA repair, and metabolism of amino acids and lipids. Many significant transcription regulation networks appeared to be around TF that are proto-oncogenes or tumor suppressor genes. The time series analysis tool Short Time-series Expression Miner (STEM) was used to identify time-dependent correlation of pathways, gene sets, TF networks, and biological parameters. Most correlations are with DNA adduct levels, which is an early response, and less with the later responses on G1 and S phase cells. The majority of the modulated genes in the Reactome pathways can be regulated by several of these TF, e.g., 73% by nuclear factor-kappa B and 34-42% by c-MYC, SRF, AP1, and E2F1. All these TF can also regulate one or more of the others. Our data indicate that a complex network of a few TF is responsible for the majority of the transcriptional changes induced by BaP. This network hardly changes over time, despite that the transcriptional profiles clearly alter, suggesting that also other regulatory mechanisms are involved.

  17. Attitudes toward Using Social Networking Sites in Educational Settings with Underperforming Latino Youth: A Mixed Methods Study

    ERIC Educational Resources Information Center

    Howard, Keith E.; Curwen, Margie Sauceda; Howard, Nicol R.; Colón-Muñiz, Anaida

    2015-01-01

    The researchers examined the online social networking attitudes of underperforming Latino high school students in an alternative education program that uses technology as the prime venue for learning. A sequential explanatory mixed methods study was used to cross-check multiple sources of data explaining students' levels of comfort with utilizing…

  18. Social Perception of Public Water Supply Network and Groundwater Quality in an Urban Setting Facing Saltwater Intrusion and Water Shortages

    NASA Astrophysics Data System (ADS)

    Alameddine, Ibrahim; Jawhari, Gheeda; El-Fadel, Mutasem

    2017-04-01

    Perceptions developed by consumers regarding the quality of water reaching their household can affect the ultimate use of the water. This study identified key factors influencing consumers' perception of water quality in a highly urbanized coastal city, experiencing chronic water shortages, overexploitation of groundwater, and accelerated saltwater intrusion. Household surveys were administered to residents to capture views and perceptions of consumed water. Concomitantly, groundwater and tap water samples were collected and analyzed at each residence for comparison with perceptions. People's rating of groundwater quality was found to correlate to the measured water quality both in the dry and wet seasons. In contrast, perceptions regarding the water quality of the public water supply network did not show any correlation with the measured tap water quality indicators. Logistic regression models developed to predict perception based on salient variables indicated that age, apartment ownership, and levels of total dissolved solids play a significant role in shaping perceptions regarding groundwater quality. Perceptions concerning the water quality of the public water supply network appeared to be independent of the measured total dissolved solids levels at the tap but correlated to those measured in the wells. The study highlights misconceptions that can arise as a result of uncontrolled cross-connections of groundwater to the public supply network water and the development of misaligned perceptions based on prior consumption patterns, water shortages, and a rapidly salinizing groundwater aquifer.

  19. Social Perception of Public Water Supply Network and Groundwater Quality in an Urban Setting Facing Saltwater Intrusion and Water Shortages.

    PubMed

    Alameddine, Ibrahim; Jawhari, Gheeda; El-Fadel, Mutasem

    2017-04-01

    Perceptions developed by consumers regarding the quality of water reaching their household can affect the ultimate use of the water. This study identified key factors influencing consumers' perception of water quality in a highly urbanized coastal city, experiencing chronic water shortages, overexploitation of groundwater, and accelerated saltwater intrusion. Household surveys were administered to residents to capture views and perceptions of consumed water. Concomitantly, groundwater and tap water samples were collected and analyzed at each residence for comparison with perceptions. People's rating of groundwater quality was found to correlate to the measured water quality both in the dry and wet seasons. In contrast, perceptions regarding the water quality of the public water supply network did not show any correlation with the measured tap water quality indicators. Logistic regression models developed to predict perception based on salient variables indicated that age, apartment ownership, and levels of total dissolved solids play a significant role in shaping perceptions regarding groundwater quality. Perceptions concerning the water quality of the public water supply network appeared to be independent of the measured total dissolved solids levels at the tap but correlated to those measured in the wells. The study highlights misconceptions that can arise as a result of uncontrolled cross-connections of groundwater to the public supply network water and the development of misaligned perceptions based on prior consumption patterns, water shortages, and a rapidly salinizing groundwater aquifer.

  20. Two-dimensional paper network format that enables simple multistep assays for use in low-resource settings in the context of malaria antigen detection.

    PubMed

    Fu, Elain; Liang, Tinny; Spicar-Mihalic, Paolo; Houghtaling, Jared; Ramachandran, Sujatha; Yager, Paul

    2012-05-15

    The lateral flow test has become the standard bioassay format in low-resource settings because it is rapid, easy to use, and low in cost, uses reagents stored in dry form, and is equipment-free. However, lateral flow tests are often limited to a single chemical delivery step and not capable of the multistep processing characteristic of high performance laboratory-based assays. To address this limitation, we are developing a paper network platform that extends the conventional lateral flow test to two dimensions; this allows incorporation of multistep chemical processing, while still retaining the advantages of conventional lateral flow tests. Here, we demonstrate this format for an easy-to-use, signal-amplified sandwich format immunoassay for the malaria protein PfHRP2. The card contains reagents stored in dry form such that the user need only add sample and water. The multiple flows in the device are activated in a single user step of folding the card closed; the configuration of the paper network automatically delivers the appropriate volumes of (i) sample plus antibody conjugated to a gold particle label, (ii) a rinse buffer, and (iii) a signal amplification reagent to the capture region. These results highlight the potential of the paper network platform to enhance access to high-quality diagnostic capabilities in low-resource settings in the developed and developing worlds.

  1. Functional Network Construction in Arabidopsis Using Rule-Based Machine Learning on Large-Scale Data Sets[C][W][OA

    PubMed Central

    Bassel, George W.; Glaab, Enrico; Marquez, Julietta; Holdsworth, Michael J.; Bacardit, Jaume

    2011-01-01

    The meta-analysis of large-scale postgenomics data sets within public databases promises to provide important novel biological knowledge. Statistical approaches including correlation analyses in coexpression studies of gene expression have emerged as tools to elucidate gene function using these data sets. Here, we present a powerful and novel alternative methodology to computationally identify functional relationships between genes from microarray data sets using rule-based machine learning. This approach, termed “coprediction,” is based on the collective ability of groups of genes co-occurring within rules to accurately predict the developmental outcome of a biological system. We demonstrate the utility of coprediction as a powerful analytical tool using publicly available microarray data generated exclusively from Arabidopsis thaliana seeds to compute a functional gene interaction network, termed Seed Co-Prediction Network (SCoPNet). SCoPNet predicts functional associations between genes acting in the same developmental and signal transduction pathways irrespective of the similarity in their respective gene expression patterns. Using SCoPNet, we identified four novel regulators of seed germination (ALTERED SEED GERMINATION5, 6, 7, and 8), and predicted interactions at the level of transcript abundance between these novel and previously described factors influencing Arabidopsis seed germination. An online Web tool to query SCoPNet has been developed as a community resource to dissect seed biology and is available at http://www.vseed.nottingham.ac.uk/. PMID:21896882

  2. Networks.

    ERIC Educational Resources Information Center

    Maughan, George R.; Petitto, Karen R.; McLaughlin, Don

    2001-01-01

    Describes the connectivity features and options of modern campus communication and information system networks, including signal transmission (wire-based and wireless), signal switching, convergence of networks, and network assessment variables, to enable campus leaders to make sound future-oriented decisions. (EV)

  3. From global agenda-setting to domestic implementation: successes and challenges of the global health network on tobacco control

    PubMed Central

    Gneiting, Uwe

    2016-01-01

    Global policy attention to tobacco control has increased significantly since the 1990s and culminated in the first international treaty negotiated under the auspices of the World Health Organization—the Framework Convention on Tobacco Control (FCTC). Although the political process that led to the creation of the FCTC has been extensively researched, the FCTC’s progression from an aspirational treaty towards a global health governance framework with tangible policy effects within FCTC member countries has not been well-understood to date. This article analyses the role of the global health network of tobacco control advocates and scientists, which formed during the FCTC negotiations during the late 1990s, in translating countries’ commitment to the FCTC into domestic policy change. By comparing the network’s influence around two central tobacco control interventions (smoke-free environments and taxation), the study identifies several scope conditions, which have shaped the network’s effectiveness around the FCTC’s implementation: the complexity of the policy issue and the relative importance of non-health expertise, the required scope of domestic political buy-in, the role of the general public as network allies, and the strength of policy opposition. These political factors had a greater influence on the network’s success than the evidence base for the effectiveness of tobacco control interventions. The network’s variable success points to a trade-off faced by global health networks between their need to maintain internal cohesion and their ability to form alliances with actors in their social environment. PMID:26253698

  4. On the ecogeomorphological feedbacks that control tidal channel network evolution in a sandy mangrove setting.

    PubMed

    van Maanen, B; Coco, G; Bryan, K R

    2015-08-08

    An ecomorphodynamic model was developed to study how Avicennia marina mangroves influence channel network evolution in sandy tidal embayments. The model accounts for the effects of mangrove trees on tidal flow patterns and sediment dynamics. Mangrove growth is in turn controlled by hydrodynamic conditions. The presence of mangroves was found to enhance the initiation and branching of tidal channels, partly because the extra flow resistance in mangrove forests favours flow concentration, and thus sediment erosion in between vegetated areas. The enhanced branching of channels is also the result of a vegetation-induced increase in erosion threshold. On the other hand, this reduction in bed erodibility, together with the soil expansion driven by organic matter production, reduces the landward expansion of channels. The ongoing accretion in mangrove forests ultimately drives a reduction in tidal prism and an overall retreat of the channel network. During sea-level rise, mangroves can potentially enhance the ability of the soil surface to maintain an elevation within the upper portion of the intertidal zone, while hindering both the branching and headward erosion of the landward expanding channels. The modelling results presented here indicate the critical control exerted by ecogeomorphological interactions in driving landscape evolution.

  5. moGrams: A Network-Based Methodology for Visualizing the Set of Nondominated Solutions in Multiobjective Optimization.

    PubMed

    Trawinski, Krzysztof; Chica, Manuel; Pancho, David P; Damas, Sergio; Cordon, Oscar

    2017-01-16

    An appropriate visualization of multiobjective nondominated solutions is a valuable asset for decision making. Although there are methods for visualizing the solutions in the design space, they do not provide any information about their relationship. In this paper, we propose a novel methodology that allows the visualization of the nondominated solutions in the design space and their relationships by means of a network. The nodes represent the solutions in the objective space while the edges show the relationships among the solutions in the design space. Our proposal (called moGrams) thus provides a joint visualization of both objective and design spaces. It aims at helping the decision maker to get more understanding of the problem so that (s)he can choose the most appropriate and flexible final solution. moGrams can be applied to any multicriteria problem in which the solutions are related by a similarity metric. Besides, the decision maker interaction is facilitated by modifying the network based on the current preferences to obtain a clearer view. An exhaustive experimental study is performed using four multiobjective problems with a variable number of objectives to show both usefulness and versatility of moGrams. The results exhibit interesting characteristics of our methodology for visualizing and analyzing solutions of multiobjective problems.

  6. On the ecogeomorphological feedbacks that control tidal channel network evolution in a sandy mangrove setting

    PubMed Central

    van Maanen, B.; Coco, G.; Bryan, K. R.

    2015-01-01

    An ecomorphodynamic model was developed to study how Avicennia marina mangroves influence channel network evolution in sandy tidal embayments. The model accounts for the effects of mangrove trees on tidal flow patterns and sediment dynamics. Mangrove growth is in turn controlled by hydrodynamic conditions. The presence of mangroves was found to enhance the initiation and branching of tidal channels, partly because the extra flow resistance in mangrove forests favours flow concentration, and thus sediment erosion in between vegetated areas. The enhanced branching of channels is also the result of a vegetation-induced increase in erosion threshold. On the other hand, this reduction in bed erodibility, together with the soil expansion driven by organic matter production, reduces the landward expansion of channels. The ongoing accretion in mangrove forests ultimately drives a reduction in tidal prism and an overall retreat of the channel network. During sea-level rise, mangroves can potentially enhance the ability of the soil surface to maintain an elevation within the upper portion of the intertidal zone, while hindering both the branching and headward erosion of the landward expanding channels. The modelling results presented here indicate the critical control exerted by ecogeomorphological interactions in driving landscape evolution. PMID:26339195

  7. Neural Network Function Classifier

    DTIC Science & Technology

    2003-02-07

    neural network sets. Each of the neural networks in a particular set is trained to recognize a particular data set type. The best function representation of the data set is determined from the neural network output. The system comprises sets of trained neural networks having neural networks trained to identify different types of data. The number of neural networks within each neural network set will depend on the number of function types that are represented. The system further comprises

  8. miR-124, -128, and -137 Orchestrate Neural Differentiation by Acting on Overlapping Gene Sets Containing a Highly Connected Transcription Factor Network.

    PubMed

    Santos, Márcia C T; Tegge, Allison N; Correa, Bruna R; Mahesula, Swetha; Kohnke, Luana Q; Qiao, Mei; Ferreira, Marco A R; Kokovay, Erzsebet; Penalva, Luiz O F

    2016-01-01

    The ventricular-subventricular zone harbors neural stem cells (NSCs) that can differentiate into neurons, astrocytes, and oligodendrocytes. This process requires loss of stem cell properties and gain of characteristics associated with differentiated cells. miRNAs function as important drivers of this transition; miR-124, -128, and -137 are among the most relevant ones and have been shown to share commonalities and act as proneurogenic regulators. We conducted biological and genomic analyses to dissect their target repertoire during neurogenesis and tested the hypothesis that they act cooperatively to promote differentiation. To map their target genes, we transfected NSCs with antagomiRs and analyzed differences in their mRNA profile throughout differentiation with respect to controls. This strategy led to the identification of 910 targets for miR-124, 216 for miR-128, and 652 for miR-137. The target sets show extensive overlap. Inspection by gene ontology and network analysis indicated that transcription factors are a major component of these miRNAs target sets. Moreover, several of these transcription factors form a highly interconnected network. Sp1 was determined to be the main node of this network and was further investigated. Our data suggest that miR-124, -128, and -137 act synergistically to regulate Sp1 expression. Sp1 levels are dramatically reduced as cells differentiate and silencing of its expression reduced neuronal production and affected NSC viability and proliferation. In summary, our results show that miRNAs can act cooperatively and synergistically to regulate complex biological processes like neurogenesis and that transcription factors are heavily targeted to branch out their regulatory effect.

  9. ENGAGING COMMUNITIES TO STRENGTHEN RESEARCH ETHICS IN LOW-INCOME SETTINGS: SELECTION AND PERCEPTIONS OF MEMBERS OF A NETWORK OF REPRESENTATIVES IN COASTAL KENYA

    PubMed Central

    Kamuya, Dorcas M; Marsh, Vicki; Kombe, Francis K; Geissler, P Wenzel; Molyneux, Sassy C

    2013-01-01

    There is wide agreement that community engagement is important for many research types and settings, often including interaction with ‘representatives’ of communities. There is relatively little published experience of community engagement in international research settings, with available information focusing on Community Advisory Boards or Groups (CAB/CAGs), or variants of these, where CAB/G members often advise researchers on behalf of the communities they represent. In this paper we describe a network of community members (‘KEMRI Community Representatives’, or ‘KCRs’) linked to a large multi-disciplinary research programme on the Kenyan Coast. Unlike many CAB/Gs, the intention with the KCR network has evolved to be for members to represent the geographical areas in which a diverse range of health studies are conducted through being typical of those communities. We draw on routine reports, self-administered questionnaires and interviews to: 1) document how typical KCR members are of the local communities in terms of basic characteristics, and 2) explore KCR's perceptions of their roles, and of the benefits and challenges of undertaking these roles. We conclude that this evolving network is a potentially valuable way of strengthening interactions between a research institution and a local geographic community, through contributing to meeting intrinsic ethical values such as showing respect, and instrumental values such as improving consent processes. However, there are numerous challenges involved. Other ways of interacting with members of local communities, including community leaders, and the most vulnerable groups least likely to be vocal in representative groups, have always been, and remain, essential. PMID:23433404

  10. Toxoplasmosis in Iran: A guide for general physicians working in the Iranian health network setting: A systematic review

    PubMed Central

    Alavi, Seyed Mohammad; Alavi, Leila

    2016-01-01

    Background: Human toxoplasmosis is an important zoonotic infection worldwide which is caused by the intracellular parasite Toxoplasma gondii (T.gondii). The aim of this study was to review briefly the general aspects of toxoplasma infection in in Iranian health system network. Methods: We searched published toxoplasmosis related articles in English databases including Science Direct, Pub Med, Scopus, Google Scholar, Magiran, Iran Medex, Iran Doc and Scientific Information Database (SID) for toxoplasmosis. Results: Out of 1267 articles from the English and Persian databases search, 40 articles were suitable with our research objectives and so were selected for the study. It is estimated that at least a third of the world human population is infected with T.gondii, suggesting it as one of the most common parasitic infections through the world. Maternal infection during pregnancy may affect dangerous outcome for the fetus, or even cause intrauterine death. Reactivation of a previous infection in immunocompromised patient such as drug induced, AIDS and organ transplantation can cause life-threating central nervous system infection. Ocular toxoplasmosis is one of the most important causes of blindness, especially in individuals with a deficient immune system. Conclusion: According to the increasing burden of toxoplasmosis on human health, the findings of this study highlight the appropriate preventive measures, diagnosis, and management of this disease. PMID:27999640

  11. Ultraperformance liquid chromatography-mass spectrometry based comprehensive metabolomics combined with pattern recognition and network analysis methods for characterization of metabolites and metabolic pathways from biological data sets.

    PubMed

    Zhang, Ai-hua; Sun, Hui; Han, Ying; Yan, Guang-li; Yuan, Ye; Song, Gao-chen; Yuan, Xiao-xia; Xie, Ning; Wang, Xi-jun

    2013-08-06

    Metabolomics is the study of metabolic changes in biological systems and provides the small molecule fingerprints related to the disease. Extracting biomedical information from large metabolomics data sets by multivariate data analysis is of considerable complexity. Therefore, more efficient and optimizing metabolomics data processing technologies are needed to improve mass spectrometry applications in biomarker discovery. Here, we report the findings of urine metabolomic investigation of hepatitis C virus (HCV) patients by high-throughput ultraperformance liquid chromatography-mass spectrometry (UPLC-MS) coupled with pattern recognition methods (principal component analysis, partial least-squares, and OPLS-DA) and network pharmacology. A total of 20 urinary differential metabolites (13 upregulated and 7 downregulated) were identified and contributed to HCV progress, involve several key metabolic pathways such as taurine and hypotaurine metabolism, glycine, serine and threonine metabolism, histidine metabolism, arginine and proline metabolism, and so forth. Metabolites identified through metabolic profiling may facilitate the development of more accurate marker algorithms to better monitor disease progression. Network analysis validated close contact between these metabolites and implied the importance of the metabolic pathways. Mapping altered metabolites to KEGG pathways identified alterations in a variety of biological processes mediated through complex networks. These findings may be promising to yield a valuable and noninvasive tool that insights into the pathophysiology of HCV and to advance the early diagnosis and monitor the progression of disease. Overall, this investigation illustrates the power of the UPLC-MS platform combined with the pattern recognition and network analysis methods that can engender new insights into HCV pathobiology.

  12. Networking.

    ERIC Educational Resources Information Center

    Duvall, Betty

    Networking is an information giving and receiving system, a support system, and a means whereby women can get ahead in careers--either in new jobs or in current positions. Networking information can create many opportunities: women can talk about how other women handle situations and tasks, and previously established contacts can be used in…

  13. A Systematic Review and Network Meta-Analysis of Biologic Agents in the First Line Setting for Advanced Colorectal Cancer

    PubMed Central

    Kumachev, Alexander; Yan, Marie; Berry, Scott; Ko, Yoo-Joung; Martinez, Maria C. R.; Shah, Keya; Chan, Kelvin K. W.

    2015-01-01

    Background Epithelial growth factor receptor inhibitors (EGFRis) and bevacizumab (BEV) are used in combination with chemotherapy for the treatment of metastatic colorectal cancer (mCRC). However, few randomized controlled trials (RCTs) have directly compared their relative efficacy on progression-free survival (PFS) and overall survival (OS). Methods We conducted a systematic review of first-line RCTs comparing (1) EGFRis vs. BEV, with chemotherapy in both arms (2) EGFRis + chemotherapy vs. chemotherapy alone, or (3) BEV + chemotherapy vs. chemotherapy alone, using Cochrane methodology. Data on and PFS and OS were extracted using the Parmar method. Pairwise meta-analyses and Bayesian network meta-analyses (NMA) were conducted to estimate the direct, indirect and combined PFS and OS hazard ratios (HRs) comparing EGFRis to BEV. Results Seventeen RCTs contained extractable data for quantitative analysis. Combining direct and indirect data using an NMA did not show a statistical difference between EGFRis versus BEV (PFS HR = 1.11 (95% CR: 0.92–1.36) and OS HR = 0.91 (95% CR: 0.75–1.09)). Direct meta-analysis (3 RCTs), indirect (14 RCTs) and combined (17 RCTs) NMA of PFS HRs were concordant and did not show a difference between EGFRis and BEV. Meta-analysis of OS using direct evidence, largely influenced by one trial, showed an improvement with EGFRis therapy (HR = 0.79 (95% CR: 0.65–0.98)), while indirect and combined NMA of OS did not show a difference between EGFRis and BEV Successive inclusions of trials over time in the combined NMA did not show superiority of EGFRis over BEV. Conclusions Our findings did not support OS or PFS benefits of EGFRis over BEV in first-line mCRC. PMID:26474403

  14. Event-based distributed set-membership filtering for a class of time-varying non-linear systems over sensor networks with saturation effects

    NASA Astrophysics Data System (ADS)

    Wei, Guoliang; Liu, Shuai; Wang, Licheng; Wang, Yongxiong

    2016-07-01

    In this paper, based on the event-triggered mechanism, the problem of distributed set-membership filtering is concerned for a class of time-varying non-linear systems over sensor networks subject to saturation effects. Different from the traditional periodic sample-data approach, the filter is updated only when the predefined event is satisfied, which the event is defined according to the measurement output. For each node, the proposed novel event-triggered mechanism can reduce the unnecessary information transmission between sensors and filters. The purpose of the addressed problem is to design a series of distributed set-membership filters, for all the admissible unknown but bounded noises, non-linearities and sensor saturation, such that the set of all possible states can be determined. The desired filter parameters are obtained by solving a recursive linear matrix inequality that can be computed recursively using the available MATLAB toolbox. Finally, a simulation example is exploited to show the effectiveness of the proposed design approach in this paper.

  15. Pebble and bedrock abrasion during fluvial transport in active orogenic setting : experimental study and application to natural hydrographic networks.

    NASA Astrophysics Data System (ADS)

    Attal, M.; Lavé, J.

    2003-04-01

    At mountain range scale, rivers play an important role in shaping the landscape : in response to active uplift, they incise into bedrock and ensure base level lowering for hillslopes erosion. At the same time, they ensure evacuation of erosion products out of the range as suspended- or bedload. Incision rates are commonly equated with a stream power law, assuming that river incision depends only on hydrodynamic variables. However, this simplification is not mechanically satisfying : in many settings, river bedload fluxes exert an important control on incision rates, by limiting bedrock exposure or by providing an efficient tool for river mechanical abrasion. It is therefore important to better quantify the abrasion processes during bedload transport both to deduce pebble size reduction that controls carrying capacity and bedrock exposure, and to derive bedrock incision laws. Such characterization can be constrained through experimental studies or field measurements. Experimental studies on pebble and bedrock abrasion have been conducted for a long time [e.g. Daubree, 1879]. They generally provide incision rates around two orders of magnitude below natural downstream fining rates. Previous authors have suggested that this discrepancy could be explained by the fact that experimental device doesn’t reproduce really the abrasion phenomena effective in natural rivers, like saltation and following impacts. In this way, we have built an experimental device in order to reproduce these abrasion phenomena. It consists of a circular flume of 30 cm width and of 60 cm curvature radius. Water is injected tangentially on four points ; it generates a flow that produce sediment motion. Velocity vertical profile is roughly similar to what could be observed in natural rivers. The bottom and the sides of the device are interchangeable, in order to measure distinctly pebble abrasion or the interactions between sediment load and substratum. The aim of this experimental study is to

  16. European Network of Forensic Science Institutes (ENFSI): Evaluation of new commercial STR multiplexes that include the European Standard Set (ESS) of markers.

    PubMed

    Welch, L A; Gill, P; Phillips, C; Ansell, R; Morling, N; Parson, W; Palo, J U; Bastisch, I

    2012-12-01

    To support and to underpin the European initiative to increase the European set of standard markers (ESS), by the addition of five new loci, a collaborative project was organised by the European Network of Forensic Science Institutes (ENFSI) DNA working group in order to assess the new multiplex kits available. We have prepared allele frequency databases from 26 EU populations. Concordance studies were carried out to verify that genotyping results were consistent between kits. Population genetics studies were conducted and it was estimated that F(ST)<0.001. The results showed that the kits were comparable to each other in terms of performance and major discrepancy issues were highlighted. We provide details of allele frequencies for each of the populations analysed per laboratory.

  17. Computer image analysis in obtaining characteristics of images: greenhouse tomatoes in the process of generating learning sets of artificial neural networks

    NASA Astrophysics Data System (ADS)

    Zaborowicz, M.; Przybył, J.; Koszela, K.; Boniecki, P.; Mueller, W.; Raba, B.; Lewicki, A.; Przybył, K.

    2014-04-01

    The aim of the project was to make the software which on the basis on image of greenhouse tomato allows for the extraction of its characteristics. Data gathered during the image analysis and processing were used to build learning sets of artificial neural networks. Program enables to process pictures in jpeg format, acquisition of statistical information of the picture and export them to an external file. Produced software is intended to batch analyze collected research material and obtained information saved as a csv file. Program allows for analysis of 33 independent parameters implicitly to describe tested image. The application is dedicated to processing and image analysis of greenhouse tomatoes. The program can be used for analysis of other fruits and vegetables of a spherical shape.

  18. Hydro-climatic data network (HCDN); a U.S. Geological Survey streamflow data set for the United States for the study of climate variations, 1874-1988

    USGS Publications Warehouse

    Slack, J.R.; Landwehr, Jurate Maciunas

    1992-01-01

    Records of streamflow can provide an account of climatic variation over a hydrologic basin. The ability to do so is conditioned on the absence of confounding factors that diminish the climate signal. A national data set of streamflow records that are relatively free of confounding anthropogenic influences has been developed for the purpose of studying the variation in surface-water conditions throughout the United States. Records in the U.S. Geological Survey (USGS) National Water Storage and Retrieval System (WATSTORE) data base for active and discontinued streamflow gaging stations through water year 1988 (that is, through September 30, 1988) were reviewed jointly with data specialists in each USGS District office. The resulting collection of stations, each with its respective period of record satisfying the qualifying criteria, is called the Hydro-Climatic Data Network, or HCDN. The HCDN consists of 1,659 sites throughout the United States and its territories, totaling 73,231 water years of daily mean discharge values. For each station in the HCDN, information necessary for its identification, along with any qualifying comments about the available record and a set of descriptive watershed characteristics are provided in tabular format in this report, both on paper and on computer disk (enclosed). For each station in the HCDN, the appropriate daily mean discharge values were compiled, and statistical characteristics, including monthly mean discharges and annual mean, minimum and maximum discharges, were derived. The discharge data values are provided in a companion report.

  19. Network Kits.

    ERIC Educational Resources Information Center

    Falk, Howard

    1999-01-01

    Describes interconnection methods, speed, and comparative equipment costs of networking starter kits. These kits supply network-connection devices that plug into or connect to each computer that is part of a network; they may also provide interconnection cables and installation software needed to set up a network. Reviews 20 kits that use a…

  20. Action Research Monographs. Complete Set. Pennsylvania Action Research Network, 1998-99. A Section 353 Project of the Pennsylvania Department of Education, Bureau of Adult Basic and Literacy Education. A Learning from Practice Project.

    ERIC Educational Resources Information Center

    Pennsylvania State Univ., McKeesport.

    This publication consists of the complete set of 23 monographs developed by the Pennsylvania Action Research Network to supplement the 67 monographs produced over the past 3 years. The specific audience are literacy, General Educational Development (GED), and English-as-a Second Language (ESL) practitioners. The titles are: "Use of…

  1. Identification of miR-34 regulatory networks in settings of disease and antimiR-therapy: Implications for treating cardiac pathology and other diseases.

    PubMed

    Ooi, Jenny Y Y; Bernardo, Bianca C; Singla, Saloni; Patterson, Natalie L; Lin, Ruby C Y; McMullen, Julie R

    2016-04-28

    Expression of the miR-34 family (miR-34a, -34b, -34c) is elevated in settings of heart disease, and inhibition with antimiR-34a/antimiR-34 has emerged as a promising therapeutic strategy. Under chronic cardiac disease settings, targeting the entire miR-34 family is more effective than targeting miR-34a alone. The identification of transcription factor (TF)-miRNA regulatory networks has added complexity to understanding the therapeutic potential of miRNA-based therapies. Here, we sought to determine whether antimiR-34 targets secondary miRNAs via TFs which could contribute to antimiR-34-mediated protection. Using miRNA-Seq we identified differentially regulated miRNAs in hearts from mice with cardiac pathology due to transverse aortic constriction (TAC), and focused on miRNAs which were also regulated by antimiR-34. Two clusters of stress-responsive miRNAs were classified as "pathological" and "cardioprotective," respectively. Using ChIPBase we identified 45 TF binding sites on the promoters of "pathological" and "cardioprotective" miRNAs, and 5 represented direct targets of miR-34, with the capacity to regulate other miRNAs. Knockdown studies in a cardiomyoblast cell line demonstrated that expression of 2 "pathological" miRNAs (let-7e, miR-31) was regulated by one of the identified TFs. Furthermore, by qPCR we confirmed that expression of let-7e and miR-31 was lower in hearts from antimiR-34 treated TAC mice; this may explain why targeting the entire miR-34 family is more effective than targeting miR-34a alone. Finally, we showed that Acsl4 (a common target of miR-34, let-7e and miR-31) was increased in hearts from TAC antimiR-34 treated mice. In summary, antimiR-34 regulates the expression of other miRNAs and this has implications for drug development.

  2. Status of the Prevention of Multidrug-Resistant Organisms in International Settings: A Survey of the Society for Healthcare Epidemiology of America Research Network.

    PubMed

    Safdar, Nasia; Sengupta, Sharmila; Musuuza, Jackson S; Juthani-Mehta, Manisha; Drees, Marci; Abbo, Lilian M; Milstone, Aaron M; Furuno, Jon P; Varman, Meera; Anderson, Deverick J; Morgan, Daniel J; Miller, Loren G; Snyder, Graham M

    2017-01-01

    OBJECTIVE To examine self-reported practices and policies to reduce infection and transmission of multidrug-resistant organisms (MDRO) in healthcare settings outside the United States. DESIGN Cross-sectional survey. PARTICIPANTS International members of the Society for Healthcare Epidemiology of America (SHEA) Research Network. METHODS Electronic survey of infection control and prevention practices, capabilities, and barriers outside the United States and Canada. Participants were stratified according to their country's economic development status as defined by the World Bank as low-income, lower-middle-income, upper-middle-income, and high-income. RESULTS A total of 76 respondents (33%) of 229 SHEA members outside the United States and Canada completed the survey questionnaire, representing 30 countries. Forty (53%) were high-, 33 (43%) were middle-, and 1 (1%) was a low-income country. Country data were missing for 2 respondents (3%). Of the 76 respondents, 64 (84%) reported having a formal or informal antibiotic stewardship program at their institution. High-income countries were more likely than middle-income countries to have existing MDRO policies (39/64 [61%] vs 25/64 [39%], P=.003) and to place patients with MDRO in contact precautions (40/72 [56%] vs 31/72 [44%], P=.05). Major barriers to preventing MDRO transmission included constrained resources (infrastructure, supplies, and trained staff) and challenges in changing provider behavior. CONCLUSIONS In this survey, a substantial proportion of institutions reported encountering barriers to implementing key MDRO prevention strategies. Interventions to address capacity building internationally are urgently needed. Data on the infection prevention practices of low income countries are needed. Infect Control Hosp Epidemiol. 2016:1-8.

  3. Monitoring street-level spatial-temporal variations of carbon monoxide in urban settings using a wireless sensor network (WSN) framework.

    PubMed

    Wen, Tzai-Hung; Jiang, Joe-Air; Sun, Chih-Hong; Juang, Jehn-Yih; Lin, Tzu-Shiang

    2013-11-27

    Air pollution has become a severe environmental problem due to urbanization and heavy traffic. Monitoring street-level air quality is an important issue, but most official monitoring stations are installed to monitor large-scale air quality conditions, and their limited spatial resolution cannot reflect the detailed variations in air quality that may be induced by traffic jams. By deploying wireless sensors on crossroads and main roads, this study established a pilot framework for a wireless sensor network (WSN)-based real-time monitoring system to understand street-level spatial-temporal changes of carbon monoxide (CO) in urban settings. The system consists of two major components. The first component is the deployment of wireless sensors. We deployed 44 sensor nodes, 40 transmitter nodes and four gateway nodes in this study. Each sensor node includes a signal processing module, a CO sensor and a wireless communication module. In order to capture realistic human exposure to traffic pollutants, all sensors were deployed at a height of 1.5 m on lampposts and traffic signs. The study area covers a total length of 1.5 km of Keelung Road in Taipei City. The other component is a map-based monitoring platform for sensor data visualization and manipulation in time and space. Using intensive real-time street-level monitoring framework, we compared the spatial-temporal patterns of air pollution in different time periods. Our results capture four CO concentration peaks throughout the day at the location, which was located along an arterial and nearby traffic sign. The hourly average could reach 5.3 ppm from 5:00 pm to 7:00 pm due to the traffic congestion. The proposed WSN-based framework captures detailed ground information and potential risk of human exposure to traffic-related air pollution. It also provides street-level insights into real-time monitoring for further early warning of air pollution and urban environmental management.

  4. Monitoring Street-Level Spatial-Temporal Variations of Carbon Monoxide in Urban Settings Using a Wireless Sensor Network (WSN) Framework

    PubMed Central

    Wen, Tzai-Hung; Jiang, Joe-Air; Sun, Chih-Hong; Juang, Jehn-Yih; Lin, Tzu-Shiang

    2013-01-01

    Air pollution has become a severe environmental problem due to urbanization and heavy traffic. Monitoring street-level air quality is an important issue, but most official monitoring stations are installed to monitor large-scale air quality conditions, and their limited spatial resolution cannot reflect the detailed variations in air quality that may be induced by traffic jams. By deploying wireless sensors on crossroads and main roads, this study established a pilot framework for a wireless sensor network (WSN)-based real-time monitoring system to understand street-level spatial-temporal changes of carbon monoxide (CO) in urban settings. The system consists of two major components. The first component is the deployment of wireless sensors. We deployed 44 sensor nodes, 40 transmitter nodes and four gateway nodes in this study. Each sensor node includes a signal processing module, a CO sensor and a wireless communication module. In order to capture realistic human exposure to traffic pollutants, all sensors were deployed at a height of 1.5 m on lampposts and traffic signs. The study area covers a total length of 1.5 km of Keelung Road in Taipei City. The other component is a map-based monitoring platform for sensor data visualization and manipulation in time and space. Using intensive real-time street-level monitoring framework, we compared the spatial-temporal patterns of air pollution in different time periods. Our results capture four CO concentration peaks throughout the day at the location, which was located along an arterial and nearby traffic sign. The hourly average could reach 5.3 ppm from 5:00 pm to 7:00 pm due to the traffic congestion. The proposed WSN-based framework captures detailed ground information and potential risk of human exposure to traffic-related air pollution. It also provides street-level insights into real-time monitoring for further early warning of air pollution and urban environmental management. PMID:24287859

  5. Automated International Information Networks; Systems Design Concepts, Goal-Setting and Priorities. FID/TM Panel at the ASIS Meeting in San Francisco, 2 October, 1969.

    ERIC Educational Resources Information Center

    Samuelson, Kjell

    An invitation to participate in this panel discussion was sent to official representatives of organizations which had an expressed interest in information networks. Since some of the represented international bodies had started preliminary planning for network communication, the discussion was centered around systems design concepts. However, as…

  6. Neurobiology: Setting the Set Point for Neural Homeostasis.

    PubMed

    Truszkowski, Torrey L S; Aizenman, Carlos D

    2015-12-07

    Neural homeostasis allows neural networks to maintain a dynamic range around a given set point. How this set point is determined remains unknown. New evidence shows that alterations of activity during a critical developmental period can alter the homeostatic set point, resulting in epilepsy-like activity.

  7. Ready ... set ... grow.

    PubMed

    Hudson, T

    1998-01-05

    Three years after going public, FPA Medical Management rose from obscurity to become the nation's second largest practice manager. Its network of primary care doctors ballooned from only 95 to nearly 6,700. Now, as executives mull over $2 billion in acquisitions, the company is set to bulk up even more.

  8. Automatic sets and Delone sets

    NASA Astrophysics Data System (ADS)

    Barbé, A.; von Haeseler, F.

    2004-04-01

    Automatic sets D\\subset{\\bb Z}^m are characterized by having a finite number of decimations. They are equivalently generated by fixed points of certain substitution systems, or by certain finite automata. As examples, two-dimensional versions of the Thue-Morse, Baum-Sweet, Rudin-Shapiro and paperfolding sequences are presented. We give a necessary and sufficient condition for an automatic set D\\subset{\\bb Z}^m to be a Delone set in {\\bb R}^m . The result is then extended to automatic sets that are defined as fixed points of certain substitutions. The morphology of automatic sets is discussed by means of examples.

  9. The Use of Alternative Social Networking Sites in Higher Educational Settings: A Case Study of the E-Learning Benefits of Ning in Education

    ERIC Educational Resources Information Center

    Brady, Kevin P.; Holcomb, Lori B.; Smith, Bethany V.

    2010-01-01

    Distance education as a primary means of instruction is expanding significantly at the college and university level. Simultaneously, the growth of social networking sites (SNS) including Facebook, LinkedIn, and MySpace is also rising among today's college students. An increasing number of higher education instructors are beginning to combine…

  10. Text Sets.

    ERIC Educational Resources Information Center

    Giorgis, Cyndi; Johnson, Nancy J.

    2002-01-01

    Presents annotations of approximately 30 titles grouped in text sets. Defines a text set as five to ten books on a particular topic or theme. Discusses books on the following topics: living creatures; pirates; physical appearance; natural disasters; and the Irish potato famine. (SG)

  11. Do networking activities outside of the classroom protect students against being bullied? A field study with students in secondary school settings in Germany.

    PubMed

    Blickle, Gerhard; Meurs, James A; Schoepe, Christine

    2013-01-01

    Research has shown that having close relationships with fellow classmates can provide a buffer for students against bullying and the negative outcomes associated with it. But, research has not explicitly examined the potential benefits of social networking behaviors outside of the classroom for those who could be bullied. This study addresses this gap and finds that, although a bullying climate in the classroom increases overall bullying, students high on external networking activities did not experience an increase in the bullying they received when in a classroom with a high bullying climate. However, the same group of students reported the largest degree of received bulling under conditions of a low bullying climate. We discuss the implications of our results and provide directions for future research.

  12. Recent developments and applications of a real-time tool to detect magma migration in different volcanic settings and network optimization.

    NASA Astrophysics Data System (ADS)

    Taisne, B.; Aoki, Y.; Caudron, C.

    2014-12-01

    Triggering mechanism of a seismic swarm has to be identified with great confidence in real time. Crisis response will not be the same whether magma is involved or not. The recent developments of a method based on the Seismic Amplitude Ratio Analysis enable a rapid and unambiguous diagnosis to detect migrating micro-seismicity. The beauty of this method lies in the fact that the ratio of seismic energy, recorded at different stations, is independent of the seismic energy radiated at the source and depends only on the location of the source and attenuation of the medium. Since drastic changes in attenuation are unlikely to occur at the time scale of magma intrusion, temporal evolutions in the measured ratio have to be explained by a change in the source location. Based on simple assumptions, this technique can be used to assess the potential of existing monitoring seismic network to detect migrating events in real-time. Of much importance, it can also be used to design monitoring seismic network based on the available number of sensors, as well as from field constraints. The method will be implemented in MSNoise software (http://www.msnoise.org/). This allows us to mine existing datasets, to compare the different noise-based techniques, but also to use the method for monitoring purposes. We will present how the key question: "Migration or No Migration" could be answered in real time without need of complex calculation nor full knowledge of the site effect and attenuation of the medium.

  13. Youths navigating social networks and social support systems in settings of chronic crisis: the case of youth-headed households in Rwanda.

    PubMed

    Lee, Laura May

    2012-10-01

    Youth-headed households in Rwanda live in a context of chronic crisis, where poverty, disease and uncertainty are not exceptional but characterise people's daily lived reality. Struggling under the pressures of economic deprivation, social isolation, abuse and exploitation, these youths experience social suffering and feel the impact of social forces on their everyday lives. Yet, amid constraints in the environment, youths demonstrate resilience by actively navigating their social networks and working to create opportunities for the future. The article describes qualitative research carried out in three communities in Rwanda, between 2006 and 2010, examining the support systems of Rwandan youths affected by the HIV epidemic and socio-political conflict and exploring how youth heads of households navigate social networks in order to buffer the suffering in their lives. It is argued that social support is vital for these youths as they struggle to survive, seek to gain a degree of control over their lives, and strive to have a hopeful future. Examples show the remarkable ability of such youths to confront adversity by mobilising resources and exhibiting agency, although they may continue to experience suffering when support is lacking. The article concludes that to improve wellbeing and reduce suffering for youth-headed households, it is critical to recognise the social relations that may limit or enhance these youths' ability to navigate their social environment. Youths' agency needs to be recognised as a means to reduce the detrimental impacts of their actions and instead build on positive strategies, enabling them as they navigate their life course towards future possibilities. Finally, the dual role of youth heads of households - as individuals in adult roles and as youths - should be recognised, with initiatives to build them up designed around economic strengthening and mentorship.

  14. Sequencing-based gene network analysis provides a core set of gene resource for understanding thermal adaptation in Zhikong scallop Chlamys farreri.

    PubMed

    Fu, X; Sun, Y; Wang, J; Xing, Q; Zou, J; Li, R; Wang, Z; Wang, S; Hu, X; Zhang, L; Bao, Z

    2014-01-01

    Marine organisms are commonly exposed to variable environmental conditions, and many of them are under threat from increased sea temperatures caused by global climate change. Generating transcriptomic resources under different stress conditions are crucial for understanding molecular mechanisms underlying thermal adaptation. In this study, we conducted transcriptome-wide gene expression profiling of the scallop Chlamys farreri challenged by acute and chronic heat stress. Of the 13 953 unique tags, more than 850 were significantly differentially expressed at each time point after acute heat stress, which was more than the number of tags differentially expressed (320-350) under chronic heat stress. To obtain a systemic view of gene expression alterations during thermal stress, a weighted gene coexpression network was constructed. Six modules were identified as acute heat stress-responsive modules. Among them, four modules involved in apoptosis regulation, mRNA binding, mitochondrial envelope formation and oxidation reduction were downregulated. The remaining two modules were upregulated. One was enriched with chaperone and the other with microsatellite sequences, whose coexpression may originate from a transcription factor binding site. These results indicated that C. farreri triggered several cellular processes to acclimate to elevated temperature. No modules responded to chronic heat stress, suggesting that the scallops might have acclimated to elevated temperature within 3 days. This study represents the first sequencing-based gene network analysis in a nonmodel aquatic species and provides valuable gene resources for the study of thermal adaptation, which should assist in the development of heat-tolerant scallop lines for aquaculture.

  15. Rough sets and near sets in medical imaging: a review.

    PubMed

    Hassanien, Aboul Ella; Abraham, Ajith; Peters, James F; Schaefer, Gerald; Henry, Christopher

    2009-11-01

    This paper presents a review of the current literature on rough-set- and near-set-based approaches to solving various problems in medical imaging such as medical image segmentation, object extraction, and image classification. Rough set frameworks hybridized with other computational intelligence technologies that include neural networks, particle swarm optimization, support vector machines, and fuzzy sets are also presented. In addition, a brief introduction to near sets and near images with an application to MRI images is given. Near sets offer a generalization of traditional rough set theory and a promising approach to solving the medical image correspondence problem as well as an approach to classifying perceptual objects by means of features in solving medical imaging problems. Other generalizations of rough sets such as neighborhood systems, shadowed sets, and tolerance spaces are also briefly considered in solving a variety of medical imaging problems. Challenges to be addressed and future directions of research are identified and an extensive bibliography is also included.

  16. What's on YOUR Facebook profile? Evaluation of an educational intervention to promote appropriate use of privacy settings by medical students on social networking sites

    PubMed Central

    Walton, Jennifer M.; White, Jonathan; Ross, Shelley

    2015-01-01

    Background The rise of social media has led to growing concerns about the potential implications of ‘unprofessional’ postings by physicians and medical students on individuals, institutions, and the medical profession. Relevant and effective guidelines have been difficult to develop and enforce, and there is a need for students and physicians to consider how their online activities may be perceived in the context of their professional roles. The purpose of this project was to examine the Internet presence of a graduating Canadian medical school class by scanning students’ public profiles on the social media site Facebook, incorporate this information into an educational activity addressing professionalism and social media, and evaluate the impact of this activity on student behavior. Methods A systematic search for public Facebook profiles of each member of the class was conducted, and data were collected on the types of publicly visible material. These were presented as part of an educational session on social media and professionalism. One month later, the Facebook search was repeated. Results Of 152 students in the class, profiles were found for 121 (79.8%). The majority of students used appropriately restrictive privacy settings; however, a significant minority had publicly visible information, including comments, photographs, location, and status as a medical student. The educational innovation was well received with more than 90% of students agreeing that this topic was important and well addressed. A follow-up search found that many students had altered their privacy settings to make less information publicly available. Conclusions A small but significant proportion of students share potentially unprofessional content on social media. An interactive educational intervention, which includes specific disclosure of how participants appear to others on social media, resulted in a significant change in student behavior. PMID:26198434

  17. What's on YOUR Facebook profile? Evaluation of an educational intervention to promote appropriate use of privacy settings by medical students on social networking sites.

    PubMed

    Walton, Jennifer M; White, Jonathan; Ross, Shelley

    2015-01-01

    Background The rise of social media has led to growing concerns about the potential implications of 'unprofessional' postings by physicians and medical students on individuals, institutions, and the medical profession. Relevant and effective guidelines have been difficult to develop and enforce, and there is a need for students and physicians to consider how their online activities may be perceived in the context of their professional roles. The purpose of this project was to examine the Internet presence of a graduating Canadian medical school class by scanning students' public profiles on the social media site Facebook, incorporate this information into an educational activity addressing professionalism and social media, and evaluate the impact of this activity on student behavior. Methods A systematic search for public Facebook profiles of each member of the class was conducted, and data were collected on the types of publicly visible material. These were presented as part of an educational session on social media and professionalism. One month later, the Facebook search was repeated. Results Of 152 students in the class, profiles were found for 121 (79.8%). The majority of students used appropriately restrictive privacy settings; however, a significant minority had publicly visible information, including comments, photographs, location, and status as a medical student. The educational innovation was well received with more than 90% of students agreeing that this topic was important and well addressed. A follow-up search found that many students had altered their privacy settings to make less information publicly available. Conclusions A small but significant proportion of students share potentially unprofessional content on social media. An interactive educational intervention, which includes specific disclosure of how participants appear to others on social media, resulted in a significant change in student behavior.

  18. Networking computers.

    PubMed

    McBride, D C

    1997-03-01

    This decade the role of the personal computer has shifted dramatically from a desktop device designed to increase individual productivity and efficiency to an instrument of communication linking people and machines in different places with one another. A computer in one city can communicate with another that may be thousands of miles away. Networking is how this is accomplished. Just like the voice network used by the telephone, computer networks transmit data and other information via modems over these same telephone lines. A network can be created over both short and long distances. Networks can be established within a hospital or medical building or over many hospitals or buildings covering many geographic areas. Those confined to one location are called LANs, local area networks. Those that link computers in one building to those at other locations are known as WANs, or wide area networks. The ultimate wide area network is the one we've all been hearing so much about these days--the Internet, and its World Wide Web. Setting up a network is a process that requires careful planning and commitment. To avoid potential pitfalls and to make certain the network you establish meets your needs today and several years down the road, several steps need to be followed. This article reviews the initial steps involved in getting ready to network.

  19. Dynamic interactions of proteins in complex networks: identifying the complete set of interacting E2s for functional investigation of E3-dependent protein ubiquitination.

    PubMed

    Christensen, Devin E; Klevit, Rachel E

    2009-10-01

    A ubiquitin ligase (E3) functions at the crossroad between ubiquitin activation and the attachment of ubiquitin to protein substrates. During this process, the E3 interacts with both a substrate and a ubiquitin-conjugating enzyme (E2). Although a major goal when investigating an E3 is to identify its substrates, recent evidence indicates that the E2 dictates the type of ubiquitin modification that will occur on the substrate. There are approximately 30 E2s identified in the human genome, many of which remain to be characterized. We found that the RING E3 BRCA1/BARD1 can interact with 10 different E2s. The ability of BRCA1 to interact with multiple E2s is likely to be a common feature among other RING and U-box E3s. We and others have also found that certain E2s show a preference for attaching either the first ubiquitin to a substrate lysine or ubiquitin to itself (chain building), suggesting that E2s may play a role in dictating product formation. Therefore, when investigating the functions of an E3 it is advisable to identify all E2s that interact with the E3 so that these can be used in E3-dependent substrate-ubiquitination assays. We describe a method used to identify all the E2s that interact with BRCA1. Defining the set of E2s that interact with other RING and U-box E3s will open the door for predictive models and lead to a better understand of substrate ubiquitination.

  20. Autocatalytic sets and boundaries.

    PubMed

    Hordijk, Wim; Steel, Mike

    Autopoietic systems, chemotons, and autogens are models that aim to explain (the emergence of) life as a functionally closed and self-sustaining system. An essential element in these models is the notion of a boundary containing, maintaining, and being generated by an internal reaction network. The more general concept of collectively autocatalytic sets, formalized as RAF theory, does not explicitly include this notion of a boundary. Here, we argue that (1) the notion of a boundary can also be incorporated in the formal RAF framework, (2) this provides a mechanism for the emergence of higher-level autocatalytic sets, (3) this satisfies a necessary condition for the evolvability of autocatalytic sets, and (4) this enables the RAF framework to formally represent and analyze (at least in part) the other models. We suggest that RAF theory might thus provide a basis for a unifying formal framework for the further development and study of such models. Graphical abstractThe emergence of an autocatalytic (super)set of autocatalytic (sub)sets.

  1. TELECOM 1 multiservices network

    NASA Astrophysics Data System (ADS)

    Lombard, D.; Ramat, P.; Rancy, F.

    The main objectives of the TELECOM 1 French domestic satellite project are to set up a business communication network which is to carry a wide range of digital services including data, voice, and pictures between a number of small earth stations located on the subscribers' premises. The parallel development of terrestrial specialized services networks has enabled the fitting of the TELECOM 1 network with high interworking capabilities with these networks. It has also allowed TELECOM 1 to be designed as the basis of the Future Integrated Services Digital Network. The TELECOM 1 network consists of the terrestrial network, the satellite network, and the maintenance network. Various elements which include the terrestrial network; the satellite network, and its modulation, TDMA frame and terminals; the System Management Center; the signalling system; and the demand assignment operation which are involved in the operation of the multiservices network are presented. The TELECOM 1 network evolution until 1990 through the rapid development of the ISDN is discussed.

  2. Network dismantling

    PubMed Central

    Braunstein, Alfredo; Dall’Asta, Luca; Semerjian, Guilhem; Zdeborová, Lenka

    2016-01-01

    We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spreading, we present precise predictions for the minimal size of a dismantling set in a large random graph with a prescribed (light-tailed) degree distribution. Building on the statistical mechanics perspective, we propose a three-stage Min-Sum algorithm for efficiently dismantling networks, including heavy-tailed ones for which the dismantling and decycling problems are not equivalent. We also provide additional insights into the dismantling problem, concluding that it is an intrinsically collective problem and that optimal dismantling sets cannot be viewed as a collection of individually well-performing nodes. PMID:27791075

  3. Introduction to Fuzzy Set Theory

    NASA Technical Reports Server (NTRS)

    Kosko, Bart

    1990-01-01

    An introduction to fuzzy set theory is described. Topics covered include: neural networks and fuzzy systems; the dynamical systems approach to machine intelligence; intelligent behavior as adaptive model-free estimation; fuzziness versus probability; fuzzy sets; the entropy-subsethood theorem; adaptive fuzzy systems for backing up a truck-and-trailer; product-space clustering with differential competitive learning; and adaptive fuzzy system for target tracking.

  4. ConfidenceSets for Network Structure

    DTIC Science & Technology

    2011-05-01

    David Choi, Patrick Wolfe Harvard University Office of Sponsored Research 1350 Massachusetts Ave. Holyoke 727 Cambridge, MA 02138 - REPORT...hence the identification of residual structure in the corresponding partition. K, and they are comprised of small numbers of students. This effect is due

  5. Multifractal nature of network induced time delay in networked control systems

    NASA Astrophysics Data System (ADS)

    Tian, Yu-Chu; Yu, Zu-Guo; Fidge, Colin

    2007-01-01

    When modelling and simulating networked control systems (NCSs) over TCP/IP network protocols, we obtained network traffic data sets with irregular behaviour. Analysing the data sets revealed multifractal network traffic. Typical data sets are given in this Letter together with our preliminary analysis. The network architecture and traffic specifications that generated the multifractal traffic are also described in detail.

  6. Finding overlapping communities using seed set

    NASA Astrophysics Data System (ADS)

    Yang, Jin-Xuan; Zhang, Xiao-Dong

    2017-02-01

    The local optimization algorithm using seed set to find overlapping communities has become more and more a significant method, but it is a great challenge how to choose a good seed set. In this paper, a new method is proposed to achieve the choice of candidate seed sets, and yields a new algorithm to find overlapping communities in complex networks. By testing in real world networks and synthetic networks, this method can successfully detect overlapping communities and outperform other state-of-the-art overlapping community detection methods.

  7. News Competition: Physics Olympiad hits Thailand Report: Institute carries out survey into maths in physics at university Event: A day for everyone teaching physics Conference: Welsh conference celebrates birthday Schools: Researchers in Residence scheme set to close Teachers: A day for new physics teachers Social: Network combines fun and physics Forthcoming events

    NASA Astrophysics Data System (ADS)

    2011-09-01

    Competition: Physics Olympiad hits Thailand Report: Institute carries out survey into maths in physics at university Event: A day for everyone teaching physics Conference: Welsh conference celebrates birthday Schools: Researchers in Residence scheme set to close Teachers: A day for new physics teachers Social: Network combines fun and physics Forthcoming events

  8. Robustness of Interdependent Networks

    NASA Astrophysics Data System (ADS)

    Havlin, Shlomo

    2011-03-01

    In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small fraction of nodes in one network may lead to the complete fragmentation of a system of many interdependent networks. We will present a framework for understanding the robustness of interacting networks subject to such cascading failures and provide a basic analytic approach that may be useful in future studies. We present exact analytical solutions for the critical fraction of nodes that upon removal will lead to a failure cascade and to a complete fragmentation of two interdependent networks in a first order transition. Surprisingly, analyzing complex systems as a set of interdependent networks may alter a basic assumption that network theory has relied on: while for a single network a broader degree distribution of the network nodes results in the network being more robust to random failures, for interdependent networks, the broader the distribution is, the more vulnerable the networks become to random failure. We also show that reducing the coupling between the networks leads to a change from a first order percolation phase transition to a second order percolation transition at a critical point. These findings pose a significant challenge to the future design of robust networks that need to consider the unique properties of interdependent networks.

  9. Network connectivity value.

    PubMed

    Dragicevic, Arnaud; Boulanger, Vincent; Bruciamacchie, Max; Chauchard, Sandrine; Dupouey, Jean-Luc; Stenger, Anne

    2017-02-23

    In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant.

  10. UpSet: Visualization of Intersecting Sets

    PubMed Central

    Lex, Alexander; Gehlenborg, Nils; Strobelt, Hendrik; Vuillemot, Romain; Pfister, Hanspeter

    2016-01-01

    Understanding relationships between sets is an important analysis task that has received widespread attention in the visualization community. The major challenge in this context is the combinatorial explosion of the number of set intersections if the number of sets exceeds a trivial threshold. In this paper we introduce UpSet, a novel visualization technique for the quantitative analysis of sets, their intersections, and aggregates of intersections. UpSet is focused on creating task-driven aggregates, communicating the size and properties of aggregates and intersections, and a duality between the visualization of the elements in a dataset and their set membership. UpSet visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes. Sorting according to various measures enables a task-driven analysis of relevant intersections and aggregates. The elements represented in the sets and their associated attributes are visualized in a separate view. Queries based on containment in specific intersections, aggregates or driven by attribute filters are propagated between both views. We also introduce several advanced visual encodings and interaction methods to overcome the problems of varying scales and to address scalability. UpSet is web-based and open source. We demonstrate its general utility in multiple use cases from various domains. PMID:26356912

  11. Generalized classifier neural network.

    PubMed

    Ozyildirim, Buse Melis; Avci, Mutlu

    2013-03-01

    In this work a new radial basis function based classification neural network named as generalized classifier neural network, is proposed. The proposed generalized classifier neural network has five layers, unlike other radial basis function based neural networks such as generalized regression neural network and probabilistic neural network. They are input, pattern, summation, normalization and output layers. In addition to topological difference, the proposed neural network has gradient descent based optimization of smoothing parameter approach and diverge effect term added calculation improvements. Diverge effect term is an improvement on summation layer calculation to supply additional separation ability and flexibility. Performance of generalized classifier neural network is compared with that of the probabilistic neural network, multilayer perceptron algorithm and radial basis function neural network on 9 different data sets and with that of generalized regression neural network on 3 different data sets include only two classes in MATLAB environment. Better classification performance up to %89 is observed. Improved classification performances proved the effectivity of the proposed neural network.

  12. Extracting information from multiplex networks

    NASA Astrophysics Data System (ADS)

    Iacovacci, Jacopo; Bianconi, Ginestra

    2016-06-01

    Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ ˜ S for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

  13. Extracting information from multiplex networks.

    PubMed

    Iacovacci, Jacopo; Bianconi, Ginestra

    2016-06-01

    Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ̃(S) for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

  14. Scalable Virtual Network Mapping Algorithm for Internet-Scale Networks

    NASA Astrophysics Data System (ADS)

    Yang, Qiang; Wu, Chunming; Zhang, Min

    The proper allocation of network resources from a common physical substrate to a set of virtual networks (VNs) is one of the key technical challenges of network virtualization. While a variety of state-of-the-art algorithms have been proposed in an attempt to address this issue from different facets, the challenge still remains in the context of large-scale networks as the existing solutions mainly perform in a centralized manner which requires maintaining the overall and up-to-date information of the underlying substrate network. This implies the restricted scalability and computational efficiency when the network scale becomes large. This paper tackles the virtual network mapping problem and proposes a novel hierarchical algorithm in conjunction with a substrate network decomposition approach. By appropriately transforming the underlying substrate network into a collection of sub-networks, the hierarchical virtual network mapping algorithm can be carried out through a global virtual network mapping algorithm (GVNMA) and a local virtual network mapping algorithm (LVNMA) operated in the network central server and within individual sub-networks respectively with their cooperation and coordination as necessary. The proposed algorithm is assessed against the centralized approaches through a set of numerical simulation experiments for a range of network scenarios. The results show that the proposed hierarchical approach can be about 5-20 times faster for VN mapping tasks than conventional centralized approaches with acceptable communication overhead between GVNCA and LVNCA for all examined networks, whilst performs almost as well as the centralized solutions.

  15. Network generation enhances interpretation of proteomics data sets by a combination of two-dimensional polyacrylamide gel electrophoresis and matrix-assisted laser desorption/ionization-time of flight mass spectrometry.

    PubMed

    Wang, Xijun; Zhang, Aihua; Sun, Hui; Wu, Gelin; Sun, Wenjun; Yan, Guangli

    2012-10-21

    Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in diseases. As the size of the interaction dataset increases, powerful computational methods are required in order to effectively interpret network models from large scale interactome data. In this study, we carried out comparative proteomics to construct and identify the proteins networks associated with hepatic injury (HI) which are largely unknown, as a case study. All proteins expressed were separated and identified by two-dimensional gel electrophoresis (2-DE) and matrix-assisted laser desorption/ionization time-of-flight-time-of-flight mass spectrometry (MALDI-TOF/TOF MS). Protein-interacting networks and pathways were mapped using STRING analysis program. We have performed for the first time a comprehensive profiling of changes in protein expression of HI rats, to uncover the networks altered by treated with CCl(4). Identification of fifteen spots (seven over-expressed and eight under-expressed) were established by MALDI-TOF/TOF MS. These proteins were subjected to functional pathway analysis using STRING software for better understanding of the biological context of the identified proteins. It suggested that modulation of multiple vital physiological pathways including DNA repair process, cell apoptosis, oxidation reduction, signal transduction, metabolic process, intracellular signaling cascade, regulation of biological processes, cell communication, regulation of cellular process, and molecular transport. In summary, the present study provides the first protein-interacting network maps and novel insights into the biological responses and potential pathways of HI. The generation of protein interaction networks clearly enhances the interpretation of proteomic data, particularly in respect of understanding molecular mechanisms of panel protein biomarkers.

  16. Autocatalytic Sets and RNA Secondary Structure.

    PubMed

    Hordijk, Wim

    2017-04-04

    The dominant paradigm in origin of life research is that of an RNA world. However, despite experimental progress towards the spontaneous formation of RNA, the RNA world hypothesis still has its problems. Here, we introduce a novel computational model of chemical reaction networks based on RNA secondary structure and analyze the existence of autocatalytic sub-networks in random instances of this model, by combining two well-established computational tools. Our main results are that (i) autocatalytic sets are highly likely to exist, even for very small reaction networks and short RNA sequences, and (ii) sequence diversity seems to be a more important factor in the formation of autocatalytic sets than sequence length. These findings could shed new light on the probability of the spontaneous emergence of an RNA world as a network of mutually collaborative ribozymes.

  17. Statistical Mechanics of the Minimum Dominating Set Problem

    NASA Astrophysics Data System (ADS)

    Zhao, Jin-Hua; Habibulla, Yusupjan; Zhou, Hai-Jun

    2015-06-01

    The minimum dominating set (MDS) problem has wide applications in network science and related fields. It aims at constructing a node set of smallest size such that any node of the network is either in this set or is adjacent to at least one node of this set. Although this optimization problem is generally very difficult, we show it can be exactly solved by a generalized leaf-removal (GLR) process if the network contains no core. We present a percolation theory to describe the GLR process on random networks, and solve a spin glass model by mean field method to estimate the MDS size. We also implement a message-passing algorithm and a local heuristic algorithm that combines GLR with greedy node-removal to obtain near-optimal solutions for single random networks. Our algorithms also perform well on real-world network instances.

  18. Neural Networks

    SciTech Connect

    Smith, Patrick I.

    2003-09-23

    Physicists use large detectors to measure particles created in high-energy collisions at particle accelerators. These detectors typically produce signals indicating either where ionization occurs along the path of the particle, or where energy is deposited by the particle. The data produced by these signals is fed into pattern recognition programs to try to identify what particles were produced, and to measure the energy and direction of these particles. Ideally, there are many techniques used in this pattern recognition software. One technique, neural networks, is particularly suitable for identifying what type of particle caused by a set of energy deposits. Neural networks can derive meaning from complicated or imprecise data, extract patterns, and detect trends that are too complex to be noticed by either humans or other computer related processes. To assist in the advancement of this technology, Physicists use a tool kit to experiment with several neural network techniques. The goal of this research is interface a neural network tool kit into Java Analysis Studio (JAS3), an application that allows data to be analyzed from any experiment. As the final result, a physicist will have the ability to train, test, and implement a neural network with the desired output while using JAS3 to analyze the results or output. Before an implementation of a neural network can take place, a firm understanding of what a neural network is and how it works is beneficial. A neural network is an artificial representation of the human brain that tries to simulate the learning process [5]. It is also important to think of the word artificial in that definition as computer programs that use calculations during the learning process. In short, a neural network learns by representative examples. Perhaps the easiest way to describe the way neural networks learn is to explain how the human brain functions. The human brain contains billions of neural cells that are responsible for processing

  19. Quantifying randomness in real networks

    NASA Astrophysics Data System (ADS)

    Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

    2015-10-01

    Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

  20. Quantifying randomness in real networks.

    PubMed

    Orsini, Chiara; Dankulov, Marija M; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

    2015-10-20

    Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

  1. Celestial data routing network

    NASA Astrophysics Data System (ADS)

    Bordetsky, Alex

    2000-11-01

    Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

  2. Cross-cultural and site-based influences on demographic, well-being, and social network predictors of risk perception in hazard and disaster settings in Ecuador and Mexico: predictors of risk perception in hazard and disaster settings in Ecuador and Mexico.

    PubMed

    Jones, Eric C; Faas, Albert J; Murphy, Arthur D; Tobin, Graham A; Whiteford, Linda M; McCarty, Christopher

    2013-03-01

    Although virtually all comparative research about risk perception focuses on which hazards are of concern to people in different culture groups, much can be gained by focusing on predictors of levels of risk perception in various countries and places. In this case, we examine standard and novel predictors of risk perception in seven sites among communities affected by a flood in Mexico (one site) and volcanic eruptions in Mexico (one site) and Ecuador (five sites). We conducted more than 450 interviews with questions about how people feel at the time (after the disaster) regarding what happened in the past, their current concerns, and their expectations for the future. We explore how aspects of the context in which people live have an effect on how strongly people perceive natural hazards in relationship with demographic, well-being, and social network factors. Generally, our research indicates that levels of risk perception for past, present, and future aspects of a specific hazard are similar across these two countries and seven sites. However, these contexts produced different predictors of risk perception-in other words, there was little overlap between sites in the variables that predicted the past, present, or future aspects of risk perception in each site. Generally, current stress was related to perception of past danger of an event in the Mexican sites, but not in Ecuador; network variables were mainly important for perception of past danger (rather than future or present danger), although specific network correlates varied from site to site across the countries.

  3. Jacobi Set Computation

    SciTech Connect

    Bhatia, Harsh

    2016-07-28

    Jacobi Set Computation is a software to compute the Jacobi set of 2 piecewise linear scalar functions defined on a triangular mesh. This functionality is useful for analyzing multiple scalar fields simultaneously.

  4. Analysis on relationship between extreme pathways and correlated reaction sets

    PubMed Central

    Xi, Yanping; Chen, Yi-Ping Phoebe; Cao, Ming; Wang, Weirong; Wang, Fei

    2009-01-01

    Background Constraint-based modeling of reconstructed genome-scale metabolic networks has been successfully applied on several microorganisms. In constraint-based modeling, in order to characterize all allowable phenotypes, network-based pathways, such as extreme pathways and elementary flux modes, are defined. However, as the scale of metabolic network rises, the number of extreme pathways and elementary flux modes increases exponentially. Uniform random sampling solves this problem to some extent to study the contents of the available phenotypes. After uniform random sampling, correlated reaction sets can be identified by the dependencies between reactions derived from sample phenotypes. In this paper, we study the relationship between extreme pathways and correlated reaction sets. Results Correlated reaction sets are identified for E. coli core, red blood cell and Saccharomyces cerevisiae metabolic networks respectively. All extreme pathways are enumerated for the former two metabolic networks. As for Saccharomyces cerevisiae metabolic network, because of the large scale, we get a set of extreme pathways by sampling the whole extreme pathway space. In most cases, an extreme pathway covers a correlated reaction set in an 'all or none' manner, which means either all reactions in a correlated reaction set or none is used by some extreme pathway. In rare cases, besides the 'all or none' manner, a correlated reaction set may be fully covered by combination of a few extreme pathways with related function, which may bring redundancy and flexibility to improve the survivability of a cell. In a word, extreme pathways show strong complementary relationship on usage of reactions in the same correlated reaction set. Conclusion Both extreme pathways and correlated reaction sets are derived from the topology information of metabolic networks. The strong relationship between correlated reaction sets and extreme pathways suggests a possible mechanism: as a controllable unit, an

  5. Noncomputable Spectral Sets

    NASA Astrophysics Data System (ADS)

    Teutsch, Jason

    2007-01-01

    It is possible to enumerate all computer programs. In particular, for every partial computable function, there is a shortest program which computes that function. f-MIN is the set of indices for shortest programs. In 1972, Meyer showed that f-MIN is Turing equivalent to 0'', the halting set with halting set oracle. This paper generalizes the notion of shortest programs, and we use various measures from computability theory to describe the complexity of the resulting "spectral sets." We show that under certain Godel numberings, the spectral sets are exactly the canonical sets 0', 0'', 0''', ... up to Turing equivalence. This is probably not true in general, however we show that spectral sets always contain some useful information. We show that immunity, or "thinness" is a useful characteristic for distinguishing between spectral sets. In the final chapter, we construct a set which neither contains nor is disjoint from any infinite arithmetic set, yet it is 0-majorized and contains a natural spectral set. Thus a pathological set becomes a bit more friendly. Finally, a number of interesting open problems are left for the inspired reader.

  6. Sets, Planets, and Comets

    ERIC Educational Resources Information Center

    Baker, Mark; Beltran, Jane; Buell, Jason; Conrey, Brian; Davis, Tom; Donaldson, Brianna; Detorre-Ozeki, Jeanne; Dibble, Leila; Freeman, Tom; Hammie, Robert; Montgomery, Julie; Pickford, Avery; Wong, Justine

    2013-01-01

    Sets in the game "Set" are lines in a certain four-dimensional space. Here we introduce planes into the game, leading to interesting mathematical questions, some of which we solve, and to a wonderful variation on the game "Set," in which every tableau of nine cards must contain at least one configuration for a player to pick up.

  7. Statistical mechanics of maximal independent sets

    NASA Astrophysics Data System (ADS)

    Dall'Asta, Luca; Pin, Paolo; Ramezanpour, Abolfazl

    2009-12-01

    The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints. It is known that finding minimum and maximum-density maximal independent sets are hard optimization problems. In this paper, we use cavity method of statistical physics and Monte Carlo simulations to study the corresponding constraint satisfaction problem on random graphs. We obtain the entropy of maximal independent sets within the replica symmetric and one-step replica symmetry breaking frameworks, shedding light on the metric structure of the landscape of solutions and suggesting a class of possible algorithms. This is of particular relevance for the application to the study of strategic interactions in social and economic networks, where maximal independent sets correspond to pure Nash equilibria of a graphical game of public goods allocation.

  8. Quantifying randomness in real networks

    PubMed Central

    Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

    2015-01-01

    Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks—the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain—and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs. PMID:26482121

  9. Data in support of a central role of plasminogen activator inhibitor-2 polymorphism in recurrent cardiovascular disease risk in the setting of high HDL cholesterol and C-reactive protein using Bayesian network modeling.

    PubMed

    Corsetti, James P; Salzman, Peter; Ryan, Dan; Moss, Arthur J; Zareba, Wojciech; Sparks, Charles E

    2016-09-01

    Data is presented that was utilized as the basis for Bayesian network modeling of influence pathways focusing on the central role of a polymorphism of plasminogen activator inhibitor-2 (PAI-2) on recurrent cardiovascular disease risk in patients with high levels of HDL cholesterol and C-reactive protein (CRP) as a marker of inflammation, "Influences on Plasminogen Activator Inhibitor-2 Polymorphism-Associated Recurrent Cardiovascular Disease Risk in Patients with High HDL Cholesterol and Inflammation" (Corsetti et al., 2016; [1]). The data consist of occurrence of recurrent coronary events in 166 post myocardial infarction patients along with 1. clinical data on gender, race, age, and body mass index; 2. blood level data on 17 biomarkers; and 3. genotype data on 53 presumptive CVD-related single nucleotide polymorphisms. Additionally, a flow diagram of the Bayesian modeling procedure is presented along with Bayesian network subgraphs (root nodes to outcome events) utilized as the data from which PAI-2 associated influence pathways were derived (Corsetti et al., 2016; [1]).

  10. Emergent Complex Network Geometry

    PubMed Central

    Wu, Zhihao; Menichetti, Giulia; Rahmede, Christoph; Bianconi, Ginestra

    2015-01-01

    Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant for routing problems, inference and data mining. In real growing networks, topological, structural and geometrical properties emerge spontaneously from their dynamical rules. Nevertheless we still miss a model in which networks develop an emergent complex geometry. Here we show that a single two parameter network model, the growing geometrical network, can generate complex network geometries with non-trivial distribution of curvatures, combining exponential growth and small-world properties with finite spectral dimensionality. In one limit, the non-equilibrium dynamical rules of these networks can generate scale-free networks with clustering and communities, in another limit planar random geometries with non-trivial modularity. Finally we find that these properties of the geometrical growing networks are present in a large set of real networks describing biological, social and technological systems. PMID:25985280

  11. Acronical Risings and Settings

    NASA Astrophysics Data System (ADS)

    Hockey, Thomas A.

    2012-01-01

    A concept found in historical primary sources, and useful in contemporary historiography, is the acronical rising and setting of stars (or planets). Topocentric terms, they provide information about a star's relationship to the Sun and thus its visibility in the sky. Yet there remains ambiguity as to what these two phrases actually mean. "Acronical” is said to have come from the Greek akros ("point,” "summit,” or "extremity") and nux ("night"). While all sources agree that the word is originally Greek, there are alternate etymologies for it. A more serious difficulty with acronical rising and setting is that there are two competing definitions. One I call the Poetical Definition. Acronical rising (or setting) is one of the three Poetical Risings (or Settings) known to classicists. (The other two are cosmical rising/setting, discussed below, and the more familiar helical rising/setting.) The term "poetical" refers to these words use in classical poetry, e. g., that of Columella, Hesiod, Ovid, Pliny the Younger, and Virgil. The Poetical Definition of "acronical” usually is meant in this context. The Poetical Definition of "acronical” is as follows: When a star rises as the Sun sets, it rises acronically. When a star sets as the Sun sets, it sets acronically. In contrast with the Poetical Definition, there also is what I call the Astronomical Definition. The Astronomical Definition is somewhat more likely to appear in astronomical, mathematical, or navigational works. When the Astronomical Definition is recorded in dictionaries, it is often with the protasis "In astronomy, . . . ." The Astronomical Definition of "acronical” is as follows: When a star rises as the Sun sets, it rises acronically. When a star sets as the Sun rises, it sets acronically. I will attempt to sort this all out in my talk.

  12. PM10 and gaseous pollutants trends from air quality monitoring networks in Bari province: principal component analysis and absolute principal component scores on a two years and half data set

    PubMed Central

    2014-01-01

    Background The chemical composition of aerosols and particle size distributions are the most significant factors affecting air quality. In particular, the exposure to finer particles can cause short and long-term effects on human health. In the present paper PM10 (particulate matter with aerodynamic diameter lower than 10 μm), CO, NOx (NO and NO2), Benzene and Toluene trends monitored in six monitoring stations of Bari province are shown. The data set used was composed by bi-hourly means for all parameters (12 bi-hourly means per day for each parameter) and it’s referred to the period of time from January 2005 and May 2007. The main aim of the paper is to provide a clear illustration of how large data sets from monitoring stations can give information about the number and nature of the pollutant sources, and mainly to assess the contribution of the traffic source to PM10 concentration level by using multivariate statistical techniques such as Principal Component Analysis (PCA) and Absolute Principal Component Scores (APCS). Results Comparing the night and day mean concentrations (per day) for each parameter it has been pointed out that there is a different night and day behavior for some parameters such as CO, Benzene and Toluene than PM10. This suggests that CO, Benzene and Toluene concentrations are mainly connected with transport systems, whereas PM10 is mostly influenced by different factors. The statistical techniques identified three recurrent sources, associated with vehicular traffic and particulate transport, covering over 90% of variance. The contemporaneous analysis of gas and PM10 has allowed underlining the differences between the sources of these pollutants. Conclusions The analysis of the pollutant trends from large data set and the application of multivariate statistical techniques such as PCA and APCS can give useful information about air quality and pollutant’s sources. These knowledge can provide useful advices to environmental policies in

  13. From network structure to network reorganization: implications for adult neurogenesis

    NASA Astrophysics Data System (ADS)

    Schneider-Mizell, Casey M.; Parent, Jack M.; Ben-Jacob, Eshel; Zochowski, Michal R.; Sander, Leonard M.

    2010-12-01

    Networks can be dynamical systems that undergo functional and structural reorganization. One example of such a process is adult hippocampal neurogenesis, in which new cells are continuously born and incorporate into the existing network of the dentate gyrus region of the hippocampus. Many of these introduced cells mature and become indistinguishable from established neurons, joining the existing network. Activity in the network environment is known to promote birth, survival and incorporation of new cells. However, after epileptogenic injury, changes to the connectivity structure around the neurogenic niche are known to correlate with aberrant neurogenesis. The possible role of network-level changes in the development of epilepsy is not well understood. In this paper, we use a computational model to investigate how the structural and functional outcomes of network reorganization, driven by addition of new cells during neurogenesis, depend on the original network structure. We find that there is a stable network topology that allows the network to incorporate new neurons in a manner that enhances activity of the persistently active region, but maintains global network properties. In networks having other connectivity structures, new cells can greatly alter the distribution of firing activity and destroy the initial activity patterns. We thus find that new cells are able to provide focused enhancement of network only for small-world networks with sufficient inhibition. Network-level deviations from this topology, such as those caused by epileptogenic injury, can set the network down a path that develops toward pathological dynamics and aberrant structural integration of new cells.

  14. Improved Autoassociative Neural Networks

    NASA Technical Reports Server (NTRS)

    Hand, Charles

    2003-01-01

    Improved autoassociative neural networks, denoted nexi, have been proposed for use in controlling autonomous robots, including mobile exploratory robots of the biomorphic type. In comparison with conventional autoassociative neural networks, nexi would be more complex but more capable in that they could be trained to do more complex tasks. A nexus would use bit weights and simple arithmetic in a manner that would enable training and operation without a central processing unit, programs, weight registers, or large amounts of memory. Only a relatively small amount of memory (to hold the bit weights) and a simple logic application- specific integrated circuit would be needed. A description of autoassociative neural networks is prerequisite to a meaningful description of a nexus. An autoassociative network is a set of neurons that are completely connected in the sense that each neuron receives input from, and sends output to, all the other neurons. (In some instantiations, a neuron could also send output back to its own input terminal.) The state of a neuron is completely determined by the inner product of its inputs with weights associated with its input channel. Setting the weights sets the behavior of the network. The neurons of an autoassociative network are usually regarded as comprising a row or vector. Time is a quantized phenomenon for most autoassociative networks in the sense that time proceeds in discrete steps. At each time step, the row of neurons forms a pattern: some neurons are firing, some are not. Hence, the current state of an autoassociative network can be described with a single binary vector. As time goes by, the network changes the vector. Autoassociative networks move vectors over hyperspace landscapes of possibilities.

  15. A security architecture for health information networks.

    PubMed

    Kailar, Rajashekar; Muralidhar, Vinod

    2007-10-11

    Health information network security needs to balance exacting security controls with practicality, and ease of implementation in today's healthcare enterprise. Recent work on 'nationwide health information network' architectures has sought to share highly confidential data over insecure networks such as the Internet. Using basic patterns of health network data flow and trust models to support secure communication between network nodes, we abstract network security requirements to a core set to enable secure inter-network data sharing. We propose a minimum set of security controls that can be implemented without needing major new technologies, but yet realize network security and privacy goals of confidentiality, integrity and availability. This framework combines a set of technology mechanisms with environmental controls, and is shown to be sufficient to counter commonly encountered network security threats adequately.

  16. Norovirus in Healthcare Settings

    MedlinePlus

    ... Evaluating Environmental Cleaning Appendices to the Conceptual Program Model for Environmental Evaluation Basic Infection Control and Prevention Plan for Outpatient Oncology Settings Appendices Outpatient Care Guide Tools for Protecting Healthcare Personnel PPE Training ...

  17. Enabling network-aware applications

    SciTech Connect

    Tierney, Brian L.; Gunter, Dan; Lee, Jason; Stouffer, Martin

    2001-08-01

    Many high performance distributed applications use only a small fraction of their available bandwidth. A common cause of this problem is not a flaw in the application design, but rather improperly tuned network settings. Proper tuning techniques, such as setting the correct TCP buffers and using parallel streams, are well known in the networking community, but outside the networking community they are infrequently applied. In this paper, we describe a service that makes the task of network tuning trivial for application developers and users. Widespread use of this service should virtually eliminate a common stumbling block for high performance distributed applications.

  18. The development of the International Network for Frontier Research on Earthquake Precursors (INFREP) by designing new analysing software and by setting up new recording locations of radio VLF/LF signals in Romania

    NASA Astrophysics Data System (ADS)

    Moldovan, Iren-Adelina; Petruta Constantin, Angela; Emilian Toader, Victorin; Toma-Danila, Dragos; Biagi, Pier Francesco; Maggipinto, Tommaso; Dolea, Paul; Septimiu Moldovan, Adrian

    2014-05-01

    Based on scientific evidences supporting the causality between earthquake preparatory stages, space weather and solar activity and different types of electromagnetic (EM) disturbances together with the benefit of having full access at ground and space based EM data, INFREP proposes a complex and cross correlated investigation of phenomena that occur in the coupled system Lithosphere-Atmosphere-Ionsophere in order to identify possible causes responsible for anomalous effects observed in the propagation characteristics of radio waves, especially at low (LF) and very low frequency (VLF). INFREP, a network of VLF (20-60 kHz) and LF (150-300 kHz) radio receivers, was put into operation in Europe in 2009, having as principal goal, the study of disturbances produced by the earthquakes on the propagation properties of these signals. The Romanian NIEP VLF / LF monitoring system consisting in a radio receiver -made by Elettronika S.R.L. (Italy) and provided by the Bari University- and the infrastructure that is necessary to record and transmit the collected data, is a part of the international initiative INFREP. The NIEP VLF / LF receiver installed in Romania was put into operation in February 2009 in Bucharest and relocated to the Black-Sea shore (Dobruja Seismologic Observatory) in December 2009. The first development of the Romanian EM monitoring system was needed because after changing the receiving site from Bucharest to Eforie we obtained unsatisfactory monitoring data, characterized by large fluctuations of the received signals' intensities. Trying to understand this behavior has led to the conclusion that the electric component of the electromagnetic field was possibly influenced by the local conditions. Starting from this observation we have run some tests and changed the vertical antenna with a loop-type antenna that is more appropriate in highly electric-field polluted environments. Since the amount of recorded data is huge, for streamlining the research process

  19. Artist Place Settings

    ERIC Educational Resources Information Center

    Pellegrino, Linda

    2009-01-01

    Art history can be a little dry at times, but the author is always trying to incorporate new ways of teaching it. In this article, she describes a project in which students were to create a place setting out of clay that had to be unified through a famous artist's style. This place setting had to consist of at least five pieces (dinner plate, cup…

  20. 77 FR 4698 - Energy Conservation Program: Test Procedure and Energy Conservation Standard for Set-Top Boxes...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-01-31

    ... Set-Top Boxes and Network Equipment AGENCY: Office of Energy Efficiency and Renewable Energy... development of test procedures and energy conservation standards for set-top boxes and network equipment. The... relating to set-top boxes and network equipment ] published on December 16, 2011 (76 FR 78174) is...

  1. Setting conservation priorities.

    PubMed

    Wilson, Kerrie A; Carwardine, Josie; Possingham, Hugh P

    2009-04-01

    A generic framework for setting conservation priorities based on the principles of classic decision theory is provided. This framework encapsulates the key elements of any problem, including the objective, the constraints, and knowledge of the system. Within the context of this framework the broad array of approaches for setting conservation priorities are reviewed. While some approaches prioritize assets or locations for conservation investment, it is concluded here that prioritization is incomplete without consideration of the conservation actions required to conserve the assets at particular locations. The challenges associated with prioritizing investments through time in the face of threats (and also spatially and temporally heterogeneous costs) can be aided by proper problem definition. Using the authors' general framework for setting conservation priorities, multiple criteria can be rationally integrated and where, how, and when to invest conservation resources can be scheduled. Trade-offs are unavoidable in priority setting when there are multiple considerations, and budgets are almost always finite. The authors discuss how trade-offs, risks, uncertainty, feedbacks, and learning can be explicitly evaluated within their generic framework for setting conservation priorities. Finally, they suggest ways that current priority-setting approaches may be improved.

  2. Set theory and physics

    NASA Astrophysics Data System (ADS)

    Svozil, K.

    1995-11-01

    Inasmuch as physical theories are formalizable, set theory provides a framework for theoretical physics. Four speculations about the relevance of set theoretical modeling for physics are presented: the role of transcendental set theory (i) in chaos theory, (ii) for paradoxical decompositions of solid three-dimensional objects, (iii) in the theory of effective computability (Church-Turing thesis) related to the possible “solution of supertasks,” and (iv) for weak solutions. Several approaches to set theory and their advantages and disadvatages for physical applications are discussed: Canlorian “naive” (i.e., nonaxiomatic) set theory, contructivism, and operationalism. In the author's opinion, an attitude of “suspended attention” (a term borrowed from psychoanalysis) seems most promising for progress. Physical and set theoretical entities must be operationalized wherever possible. At the same time, physicists should be open to “bizarre” or “mindboggling” new formalisms, which need not be operationalizable or testable at the lime of their creation, but which may successfully lead to novel fields of phenomenology and technology.

  3. Set theory and physics

    SciTech Connect

    Svozil, K.

    1995-11-01

    Inasmuch as physical theories are formalizable, set theory provides a framework for theoretical physics. Four speculations about the relevance of set theoretical modeling for physics are presented: the role of transcendental set theory (i) in chaos theory, (ii) for paradoxical decompositions of solid three-dimensional objects, (iii) in the theory of effective computability (Church-Turing thesis) related to the possible {open_quotes}solution of supertasks,{close_quotes} and (iv) for weak solutions. Several approaches to set theory and their advantages and disadvantages for physical applications are discussed: Cantorian {open_quotes}naive{close_quotes} (i.e., nonaxiomatic) set theory, contructivism, and operationalism. In the author`s opinion, an attitude, of {open_quotes}suspended attention{close_quotes} (a term borrowed from psychoanalysis) seems most promising for progress. Physical and set theoretical entities must be operationalized wherever possible. At the same time, physicists should be open to {open_quotes}bizarre{close_quotes} or {open_quotes}mindboggling{close_quotes} new formalisms, which need not be operationalizable or testable at the time of their creation, but which may successfully lead to novel fields of phenomenology and technology.

  4. Multicriteria identification sets method

    NASA Astrophysics Data System (ADS)

    Kamenev, G. K.

    2016-11-01

    A multicriteria identification and prediction method for mathematical models of simulation type in the case of several identification criteria (error functions) is proposed. The necessity of the multicriteria formulation arises, for example, when one needs to take into account errors of completely different origins (not reducible to a single characteristic) or when there is no information on the class of noise in the data to be analyzed. An identification sets method is described based on the approximation and visualization of the multidimensional graph of the identification error function and sets of suboptimal parameters. This method allows for additional advantages of the multicriteria approach, namely, the construction and visual analysis of the frontier and the effective identification set (frontier and the Pareto set for identification criteria), various representations of the sets of Pareto effective and subeffective parameter combinations, and the corresponding predictive trajectory tubes. The approximation is based on the deep holes method, which yields metric ɛ-coverings with nearly optimal properties, and on multiphase approximation methods for the Edgeworth-Pareto hull. The visualization relies on the approach of interactive decision maps. With the use of the multicriteria method, multiple-choice solutions of identification and prediction problems can be produced and justified by analyzing the stability of the optimal solution not only with respect to the parameters (robustness with respect to data) but also with respect to the chosen set of identification criteria (robustness with respect to the given collection of functionals).

  5. Introduction: optimization in networks.

    PubMed

    Motter, Adilson E; Toroczkai, Zoltan

    2007-06-01

    The recent surge in the network modeling of complex systems has set the stage for a new era in the study of fundamental and applied aspects of optimization in collective behavior. This Focus Issue presents an extended view of the state of the art in this field and includes articles from a large variety of domains in which optimization manifests itself, including physical, biological, social, and technological networked systems.

  6. Wide Range SET Pulse Measurement

    NASA Technical Reports Server (NTRS)

    Shuler, Robert L.; Chen, Li

    2012-01-01

    small number of SETs were not significantly higher in the test over the control circuits. At higher LET the test circuit SETs are one or two orders of magnitude greater than for the control circuit. The NFET circuit produces more and slightly longer SETs as expected. But the differences do not appear to be significant enough to modify strategies now used to avoid capture of SETs in chips such as FPGAs. Complete data and graphs will be in the full paper / presentation. In the summary figure below left, NOCL is the reference circuit without any input, and number of stages triggered is plotted. Simulation at right shows the smallest pulse captured (stage 2) at about 300 ps. Our conclusion is that the method is promising, but that improvements in the merge network are desirable before applying in a deep submicron process

  7. Network Science

    NASA Astrophysics Data System (ADS)

    Barabási, Albert-László

    2016-07-01

    Preface; Personal introduction; 1. Introduction; 2. Graph theory; 3. Random networks; 4. The scale-free property; 5. The Barabási-Albert model; 6. Evolving networks; 7. Degree correlation; 8. Network robustness; 9. Communities; 10. Spreading phenomena; Index.

  8. Self Evolving Modular Network

    NASA Astrophysics Data System (ADS)

    Tokunaga, Kazuhiro; Kawabata, Nobuyuki; Furukawa, Tetsuo

    We propose a novel modular network called the Self-Evolving Modular Network (SEEM). The SEEM has a modular network architecture with a graph structure and these following advantages: (1) new modules are added incrementally to allow the network to adapt in a self-organizing manner, and (2) graph's paths are formed based on the relationships between the models represented by modules. The SEEM is expected to be applicable to evolving functions of an autonomous robot in a self-organizing manner through interaction with the robot's environment and categorizing large-scale information. This paper presents the architecture and an algorithm for the SEEM. Moreover, performance characteristic and effectiveness of the network are shown by simulations using cubic functions and a set of 3D-objects.

  9. Community structure in networks

    NASA Astrophysics Data System (ADS)

    Newman, Mark

    2004-03-01

    Many networked systems, including physical, biological, social, and technological networks, appear to contain ``communities'' -- groups of nodes within which connections are dense, but between which they are sparser. The ability to find such communities in an automated fashion could be of considerable use. Communities in a web graph for instance might correspond to sets of web sites dealing with related topics, while communities in a biochemical network or an electronic circuit might correspond to functional units of some kind. We present a number of new methods for community discovery, including methods based on ``betweenness'' measures and methods based on modularity optimization. We also give examples of applications of these methods to both computer-generated and real-world network data, and show how our techniques can be used to shed light on the sometimes dauntingly complex structure of networked systems.

  10. Network Consistent Data Association.

    PubMed

    Chakraborty, Anirban; Das, Abir; Roy-Chowdhury, Amit K

    2016-09-01

    Existing data association techniques mostly focus on matching pairs of data-point sets and then repeating this process along space-time to achieve long term correspondences. However, in many problems such as person re-identification, a set of data-points may be observed at multiple spatio-temporal locations and/or by multiple agents in a network and simply combining the local pairwise association results between sets of data-points often leads to inconsistencies over the global space-time horizons. In this paper, we propose a Novel Network Consistent Data Association (NCDA) framework formulated as an optimization problem that not only maintains consistency in association results across the network, but also improves the pairwise data association accuracies. The proposed NCDA can be solved as a binary integer program leading to a globally optimal solution and is capable of handling the challenging data-association scenario where the number of data-points varies across different sets of instances in the network. We also present an online implementation of NCDA method that can dynamically associate new observations to already observed data-points in an iterative fashion, while maintaining network consistency. We have tested both the batch and the online NCDA in two application areas-person re-identification and spatio-temporal cell tracking and observed consistent and highly accurate data association results in all the cases.

  11. Network planning under uncertainties

    NASA Astrophysics Data System (ADS)

    Ho, Kwok Shing; Cheung, Kwok Wai

    2008-11-01

    generic framework for solving the network planning problem under uncertainties. In addition to reviewing the various network planning problems involving uncertainties, we also propose that a unified framework based on robust optimization can be used to solve a rather large segment of network planning problem under uncertainties. Robust optimization is first introduced in the operations research literature and is a framework that incorporates information about the uncertainty sets for the parameters in the optimization model. Even though robust optimization is originated from tackling the uncertainty in the optimization process, it can serve as a comprehensive and suitable framework for tackling generic network planning problems under uncertainties. In this paper, we begin by explaining the main ideas behind the robust optimization approach. Then we demonstrate the capabilities of the proposed framework by giving out some examples of how the robust optimization framework can be applied to the current common network planning problems under uncertain environments. Next, we list some practical considerations for solving the network planning problem under uncertainties with the proposed framework. Finally, we conclude this article with some thoughts on the future directions for applying this framework to solve other network planning problems.

  12. Network susceptibilities: Theory and applications.

    PubMed

    Manik, Debsankha; Rohden, Martin; Ronellenfitsch, Henrik; Zhang, Xiaozhu; Hallerberg, Sarah; Witthaut, Dirk; Timme, Marc

    2017-01-01

    We introduce the concept of network susceptibilities quantifying the response of the collective dynamics of a network to small parameter changes. We distinguish two types of susceptibilities: vertex susceptibilities and edge susceptibilities, measuring the responses due to changes in the properties of units and their interactions, respectively. We derive explicit forms of network susceptibilities for oscillator networks close to steady states and offer example applications for Kuramoto-type phase-oscillator models, power grid models, and generic flow models. Focusing on the role of the network topology implies that these ideas can be easily generalized to other types of networks, in particular those characterizing flow, transport, or spreading phenomena. The concept of network susceptibilities is broadly applicable and may straightforwardly be transferred to all settings where networks responses of the collective dynamics to topological changes are essential.

  13. Network susceptibilities: Theory and applications

    NASA Astrophysics Data System (ADS)

    Manik, Debsankha; Rohden, Martin; Ronellenfitsch, Henrik; Zhang, Xiaozhu; Hallerberg, Sarah; Witthaut, Dirk; Timme, Marc

    2017-01-01

    We introduce the concept of network susceptibilities quantifying the response of the collective dynamics of a network to small parameter changes. We distinguish two types of susceptibilities: vertex susceptibilities and edge susceptibilities, measuring the responses due to changes in the properties of units and their interactions, respectively. We derive explicit forms of network susceptibilities for oscillator networks close to steady states and offer example applications for Kuramoto-type phase-oscillator models, power grid models, and generic flow models. Focusing on the role of the network topology implies that these ideas can be easily generalized to other types of networks, in particular those characterizing flow, transport, or spreading phenomena. The concept of network susceptibilities is broadly applicable and may straightforwardly be transferred to all settings where networks responses of the collective dynamics to topological changes are essential.

  14. Exact controllability of complex networks

    PubMed Central

    Yuan, Zhengzhong; Zhao, Chen; Di, Zengru; Wang, Wen-Xu; Lai, Ying-Cheng

    2013-01-01

    Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural controllability theory, we continue to lack a framework to control undirected complex networks, especially given link weights. Here we introduce an exact controllability paradigm based on the maximum multiplicity to identify the minimum set of driver nodes required to achieve full control of networks with arbitrary structures and link-weight distributions. The framework reproduces the structural controllability of directed networks characterized by structural matrices. We explore the controllability of a large number of real and model networks, finding that dense networks with identical weights are difficult to be controlled. An efficient and accurate tool is offered to assess the controllability of large sparse and dense networks. The exact controllability framework enables a comprehensive understanding of the impact of network properties on controllability, a fundamental problem towards our ultimate control of complex systems. PMID:24025746

  15. Short pulse test set

    NASA Astrophysics Data System (ADS)

    1990-11-01

    This report discusses the construction and operation of the Short Pulse Test Set that has been built for the U.S. Army Missile Command for the purpose of applying short (25 to 100 nanosecond), high voltage pulses to electronic explosive devices (EEDs) in both the pin-to-pin and pins-to-case mode. The test set employs the short pulse generating techniques first described in the Franklin Institute Research Laboratories (now Franklin Research Center) Report I-C3410, 'Pins-to-Case Short Pulse Sensitivity Studies for the Atlas DC Switch', December 1974. This report, authored by Ramie H. Thompson, was prepared for Picatinny Arsenal under contract DAAA21-72C-0766. The test set described herein utilizes a computer controlled high speed digitizer to monitor the pulse voltage and current and provides software to process and display these data.

  16. Weighted network analysis of earthquake seismic data

    NASA Astrophysics Data System (ADS)

    Chakraborty, Abhijit; Mukherjee, G.; Manna, S. S.

    2015-09-01

    Three different earthquake seismic data sets are used to construct the earthquake networks following the prescriptions of Abe and Suzuki (2004). It has been observed that different links of this network appear with highly different strengths. This prompted us to extend the study of earthquake networks by considering it as the weighted network. Different properties of such weighted network have been found to be quite different from those of their un-weighted counterparts.

  17. Network Cosmology

    PubMed Central

    Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

    2012-01-01

    Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

  18. Network cosmology.

    PubMed

    Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

    2012-01-01

    Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

  19. Therapists in Oncology Settings

    ERIC Educational Resources Information Center

    Hendrick, Susan S.

    2013-01-01

    This article describes the author's experiences of working with cancer patients/survivors both individually and in support groups for many years, across several settings. It also documents current best-practice guidelines for the psychosocial treatment of cancer patients/survivors and their families. The author's view of the important qualities…

  20. The Crystal Set

    ERIC Educational Resources Information Center

    Greenslade, Thomas B., Jr.

    2014-01-01

    In past issues of this journal, the late H. R. Crane wrote a long series of articles under the running title of "How Things Work." In them, Dick dealt with many questions that physics teachers asked themselves, but did not have the time to answer. This article is my attempt to work through the physics of the crystal set, which I thought…

  1. Goal Setting and Hope

    ERIC Educational Resources Information Center

    Curran, Katie; Reivich, Karen

    2011-01-01

    The science behind the mechanisms and mediators that lead to successful goal accomplishment has been a focus of research since the 1970s. When an individual desires to make a change or accomplish an outcome, research shows that he or she will be more successful if he or she attends to a number of variables that are key in goal setting.…

  2. Building Temperature Set Point

    SciTech Connect

    Meincke, Carol L.; Evans, Christopher A.

    2014-09-01

    This white paper provides information and recommendations for an actionable and enforceable corporate policy statement on temperature set points for office and related spaces at Sandia and presents a strategy that balances the need to achieve the energy goals with optimizing employee comfort and productivity.

  3. Sequential state generation by model neural networks.

    PubMed Central

    Kleinfeld, D

    1986-01-01

    Sequential patterns of neural output activity form the basis of many biological processes, such as the cyclic pattern of outputs that control locomotion. I show how such sequences can be generated by a class of model neural networks that make defined sets of transitions between selected memory states. Sequence-generating networks depend upon the interplay between two sets of synaptic connections. One set acts to stabilize the network in its current memory state, while the second set, whose action is delayed in time, causes the network to make specified transitions between the memories. The dynamic properties of these networks are described in terms of motion along an energy surface. The performance of the networks, both with intact connections and with noisy or missing connections, is illustrated by numerical examples. In addition, I present a scheme for the recognition of externally generated sequences by these networks. PMID:3467316

  4. OPTIMAL NETWORK TOPOLOGY DESIGN

    NASA Technical Reports Server (NTRS)

    Yuen, J. H.

    1994-01-01

    This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.

  5. Latent geometry of bipartite networks

    NASA Astrophysics Data System (ADS)

    Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri

    2017-03-01

    Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.

  6. A Security Architecture for Health Information Networks

    PubMed Central

    Kailar, Rajashekar

    2007-01-01

    Health information network security needs to balance exacting security controls with practicality, and ease of implementation in today’s healthcare enterprise. Recent work on ‘nationwide health information network’ architectures has sought to share highly confidential data over insecure networks such as the Internet. Using basic patterns of health network data flow and trust models to support secure communication between network nodes, we abstract network security requirements to a core set to enable secure inter-network data sharing. We propose a minimum set of security controls that can be implemented without needing major new technologies, but yet realize network security and privacy goals of confidentiality, integrity and availability. This framework combines a set of technology mechanisms with environmental controls, and is shown to be sufficient to counter commonly encountered network security threats adequately. PMID:18693862

  7. Topological entropy of catalytic sets: Hypercycles revisited

    NASA Astrophysics Data System (ADS)

    Sardanyés, Josep; Duarte, Jorge; Januário, Cristina; Martins, Nuno

    2012-02-01

    The dynamics of catalytic networks have been widely studied over the last decades because of their implications in several fields like prebiotic evolution, virology, neural networks, immunology or ecology. One of the most studied mathematical bodies for catalytic networks was initially formulated in the context of prebiotic evolution, by means of the hypercycle theory. The hypercycle is a set of self-replicating species able to catalyze other replicator species within a cyclic architecture. Hypercyclic organization might arise from a quasispecies as a way to increase the informational containt surpassing the so-called error threshold. The catalytic coupling between replicators makes all the species to behave like a single and coherent evolutionary multimolecular unit. The inherent nonlinearities of catalytic interactions are responsible for the emergence of several types of dynamics, among them, chaos. In this article we begin with a brief review of the hypercycle theory focusing on its evolutionary implications as well as on different dynamics associated to different types of small catalytic networks. Then we study the properties of chaotic hypercycles with error-prone replication with symbolic dynamics theory, characterizing, by means of the theory of topological Markov chains, the topological entropy and the periods of the orbits of unimodal-like iterated maps obtained from the strange attractor. We will focus our study on some key parameters responsible for the structure of the catalytic network: mutation rates, autocatalytic and cross-catalytic interactions.

  8. Patterns in randomly evolving networks: Idiotypic networks

    NASA Astrophysics Data System (ADS)

    Brede, Markus; Behn, Ulrich

    2003-03-01

    We present a model for the evolution of networks of occupied sites on undirected regular graphs. At every iteration step in a parallel update, I randomly chosen empty sites are occupied and occupied sites having occupied neighbor degree outside of a given interval (tl,tu) are set empty. Depending on the influx I and the values of both lower threshold and upper threshold of the occupied neighbor degree, different kinds of behavior can be observed. In certain regimes stable long-living patterns appear. We distinguish two types of patterns: static patterns arising on graphs with low connectivity and dynamic patterns found on high connectivity graphs. Increasing I patterns become unstable and transitions between almost stable patterns, interrupted by disordered phases, occur. For still larger I the lifetime of occupied sites becomes very small and network structures are dominated by randomness. We develop methods to analyze the nature and dynamics of these network patterns, give a statistical description of defects and fluctuations around them, and elucidate the transitions between different patterns. Results and methods presented can be applied to a variety of problems in different fields and a broad class of graphs. Aiming chiefly at the modeling of functional networks of interacting antibodies and B cells of the immune system (idiotypic networks), we focus on a class of graphs constructed by bit chains. The biological relevance of the patterns and possible operational modes of idiotypic networks are discussed.

  9. Transmission design in a multimode HFC network

    NASA Astrophysics Data System (ADS)

    Cambron, G. Keith

    1996-11-01

    Contemporary hybrid fiber coaxial (HFC) networks are capable of supporting a wide range of services including traditional analog video, telephony, digital video, and data services. Each service has unique performance or service requirements. This contribution examines transmission design for one such network. Pacific Bell's advanced communications network (ACN). The design methodology begins with a set of end to end service quality objectives. Network impairments, such as noise, distortion and delay, are allocated across the network elements using a set of standard network models. These models are a representative set of the actual field designs and bound the network operating parameters. Network components, headend equipment, and customer premises equipment are specified analytically or characterized empirically in relationship to the chosen impairment set. The component parameters are then included in analytical models to estimate overall network performance. In addition to the forward path transmission considerations examined by traditional coaxial network designers, other dimensions including power consumption, traffic demand, and message latency are taken into account. Analytical models are used to estimate the effects of multiple modulation schemes within the unified network. The variability introduced by on demand services such as telephony and interactive digital services changes the base computational domain from deterministic models to stochastic ones. These models are then used to set operating parameters at measurable points throughout the network for proof of performance prior to turn up, and for ongoing performance monitoring. For closure, empirical results are compared with model projections as a way of verifying and improving the predictive models.

  10. Network Solutions.

    ERIC Educational Resources Information Center

    Vietzke, Robert; And Others

    1996-01-01

    This special section explains the latest developments in networking technologies, profiles school districts benefiting from successful implementations, and reviews new products for building networks. Highlights include ATM (asynchronous transfer mode), cable modems, networking switches, Internet screening software, file servers, network management…

  11. Optical Neural Network Classifier Architectures

    DTIC Science & Technology

    1998-04-01

    We present an adaptive opto-electronic neural network hardware architecture capable of exploiting parallel optics to realize real-time processing and...function neural network based on a previously demonstrated binary-input version. The greyscale-input capability broadens the range of applications for...a reduced feature set of multiwavelet images to improve training times and discrimination capability of the neural network . The design uses a joint

  12. Scaling in Computer Network Traffic

    DTIC Science & Technology

    2007-11-02

    Laboratory for Applied Network Research). ♠ CAIDA (Cooperative Association for Internet Data Analysis). ♥ ♠ WAND (Waikato Applied Network Dynamics [DAG...permission of CAIDA , c© 2001 CAIDA /UC Regents. Mapnet Author: Bradley Huffaker. 15 Flows and Packets Flows are sets of packets associated to the same data

  13. A network approach based on cliques

    NASA Astrophysics Data System (ADS)

    Fadigas, I. S.; Pereira, H. B. B.

    2013-05-01

    The characterization of complex networks is a procedure that is currently found in several research studies. Nevertheless, few studies present a discussion on networks in which the basic element is a clique. In this paper, we propose an approach based on a network of cliques. This approach consists not only of a set of new indices to capture the properties of a network of cliques but also of a method to characterize complex networks of cliques (i.e., some of the parameters are proposed to characterize the small-world phenomenon in networks of cliques). The results obtained are consistent with results from classical methods used to characterize complex networks.

  14. The Moon has set

    NASA Astrophysics Data System (ADS)

    Herschberg, I. S.; Mebius, J. E.

    1989-08-01

    The Sappho epigram mentioned in the title is shown to contain implicit astronomical information, which must have contributed to the expressiveness of Sappho's short poem to contemporary audiences. Astronomical computations are given to discover the earliest and the latest time of year for which the Pleiads set at midnight while being visible earlier in the evening, taking into account the atmospheric refraction. The time of year for which Sappho's poem is valid is concluded to run from 17 Jan. to 29 Mar.

  15. The Crystal Set

    NASA Astrophysics Data System (ADS)

    Greenslade, Thomas B.

    2014-04-01

    In past issues of this journal, the late H. R. Crane wrote a long series of articles under the running title of "How Things Work." In them, Dick dealt with many questions that physics teachers asked themselves, but did not have the time to answer. This article is my attempt to work through the physics of the crystal set, which I thought I knew, but actually did not.

  16. Networking standards

    NASA Technical Reports Server (NTRS)

    Davies, Mark

    1991-01-01

    The enterprise network is currently a multivendor environment consisting of many defacto and proprietary standards. During the 1990s, these networks will evolve towards networks which are based on international standards in both Local Area Network (LAN) and Wide Area Network (WAN) space. Also, you can expect to see the higher level functions and applications begin the same transition. Additional information is given in viewgraph form.

  17. Triage in military settings.

    PubMed

    Falzone, E; Pasquier, P; Hoffmann, C; Barbier, O; Boutonnet, M; Salvadori, A; Jarrassier, A; Renner, J; Malgras, B; Mérat, S

    2017-02-01

    Triage, a medical term derived from the French word "trier", is the practical process of sorting casualties to rationally allocate limited resources. In combat settings with limited medical resources and long transportation times, triage is challenging since the objectives are to avoid overcrowding medical treatment facilities while saving a maximum of soldiers and to get as many of them back into action as possible. The new face of modern warfare, asymmetric and non-conventional, has led to the integrative evolution of triage into the theatre of operations. This article defines different triage scores and algorithms currently implemented in military settings. The discrepancies associated with these military triage systems are highlighted. The assessment of combat casualty severity requires several scores and each nation adopts different systems for triage on the battlefield with the same aim of quickly identifying those combat casualties requiring lifesaving and damage control resuscitation procedures. Other areas of interest for triage in military settings are discussed, including predicting the need for massive transfusion, haemodynamic parameters and ultrasound exploration.

  18. Computer Network Defense Roadmap

    DTIC Science & Technology

    2009-05-01

    networks, podcasts , and wikis, and mobile end- user devices, has brought a new set of challenges to CND. The DON will work with the JTF-GNO and other...within an overarching, full spectrum enterprise access control schema that supports the end-to-end requirements in a coalition, first responder/non

  19. Semantic Networks and Social Networks

    ERIC Educational Resources Information Center

    Downes, Stephen

    2005-01-01

    Purpose: To illustrate the need for social network metadata within semantic metadata. Design/methodology/approach: Surveys properties of social networks and the semantic web, suggests that social network analysis applies to semantic content, argues that semantic content is more searchable if social network metadata is merged with semantic web…

  20. Setting Goals for Achievement in Physical Education Settings

    ERIC Educational Resources Information Center

    Baghurst, Timothy; Tapps, Tyler; Kensinger, Weston

    2015-01-01

    Goal setting has been shown to improve student performance, motivation, and task completion in academic settings. Although goal setting is utilized by many education professionals to help students set realistic and proper goals, physical educators may not be using goal setting effectively. Without incorporating all three types of goals and…

  1. Fractal and multifractal analyses of bipartite networks.

    PubMed

    Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

    2017-03-31

    Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

  2. Fractal and multifractal analyses of bipartite networks

    PubMed Central

    Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

    2017-01-01

    Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions. PMID:28361962

  3. Registration of multiple image sets with thin-plate spline

    NASA Astrophysics Data System (ADS)

    He, Liang; Houk, James C.

    1994-09-01

    A thin-plate spline method for spatial warping was used to register multiple image sets during 3D reconstruction of histological sections. In a neuroanatomical study, the same labeling method was applied to several turtle brains. Each case produced a set of microscopic sections. Spatial warping was employed to map data sets from multiple cases onto a template coordinate system. This technique enabled us to produce an anatomical reconstruction of a neural network that controls limb movement.

  4. Growing networks with superjoiners.

    PubMed

    Jabr-Hamdan, Ameerah; Sun, Jie; Ben-Avraham, Daniel

    2014-11-01

    We study the Krapivsky-Redner (KR) network growth model, but where new nodes can connect to any number of existing nodes, m, picked from a power-law distribution p(m)∼m^{-α}. Each of the m new connections is still carried out as in the KR model with probability redirection r (corresponding to degree exponent γ_{KR}=1+1/r in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and total-degree distributions and on the potential tension between the degree exponent α, characterizing new connections (outgoing links), and the degree exponent γ_{KR}(r) dictated by the redirection mechanism.

  5. Growing networks with superjoiners

    NASA Astrophysics Data System (ADS)

    Jabr-Hamdan, Ameerah; Sun, Jie; ben-Avraham, Daniel

    2014-11-01

    We study the Krapivsky-Redner (KR) network growth model, but where new nodes can connect to any number of existing nodes, m , picked from a power-law distribution p (m ) ˜m-α . Each of the m new connections is still carried out as in the KR model with probability redirection r (corresponding to degree exponent γKR=1 +1 /r in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and total-degree distributions and on the potential tension between the degree exponent α , characterizing new connections (outgoing links), and the degree exponent γKR(r ) dictated by the redirection mechanism.

  6. Learning network representations

    NASA Astrophysics Data System (ADS)

    Moyano, Luis G.

    2017-02-01

    In this review I present several representation learning methods, and discuss the latest advancements with emphasis in applications to network science. Representation learning is a set of techniques that has the goal of efficiently mapping data structures into convenient latent spaces. Either for dimensionality reduction or for gaining semantic content, this type of feature embeddings has demonstrated to be useful, for example, for node classification or link prediction tasks, among many other relevant applications to networks. I provide a description of the state-of-the-art of network representation learning as well as a detailed account of the connections with other fields of study such as continuous word embeddings and deep learning architectures. Finally, I provide a broad view of several applications of these techniques to networks in various domains.

  7. NASA Integrated Space Communications Network

    NASA Technical Reports Server (NTRS)

    Tai, Wallace; Wright, Nate; Prior, Mike; Bhasin, Kul

    2012-01-01

    The NASA Integrated Network for Space Communications and Navigation (SCaN) has been in the definition phase since 2010. It is intended to integrate NASA s three existing network elements, i.e., the Space Network, Near Earth Network, and Deep Space Network, into a single network. In addition to the technical merits, the primary purpose of the Integrated Network is to achieve a level of operating cost efficiency significantly higher than it is today. Salient features of the Integrated Network include (a) a central system element that performs service management functions and user mission interfaces for service requests; (b) a set of common service execution equipment deployed at the all stations that provides return, forward, and radiometric data processing and delivery capabilities; (c) the network monitor and control operations for the entire integrated network are conducted remotely and centrally at a prime-shift site and rotating among three sites globally (a follow-the-sun approach); (d) the common network monitor and control software deployed at all three network elements that supports the follow-the-sun operations.

  8. Ranking Information in Networks

    NASA Astrophysics Data System (ADS)

    Eliassi-Rad, Tina; Henderson, Keith

    Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would like to discover sets of authors with expertise in a wide range of disciplines. We present this ranking task as a Top-K problem; utilize fixed-memory heuristic search; and present performance of both the serial and distributed search algorithms on synthetic and real-world data sets.

  9. Airport Surface Network Architecture Definition

    NASA Technical Reports Server (NTRS)

    Nguyen, Thanh C.; Eddy, Wesley M.; Bretmersky, Steven C.; Lawas-Grodek, Fran; Ellis, Brenda L.

    2006-01-01

    Currently, airport surface communications are fragmented across multiple types of systems. These communication systems for airport operations at most airports today are based dedicated and separate architectures that cannot support system-wide interoperability and information sharing. The requirements placed upon the Communications, Navigation, and Surveillance (CNS) systems in airports are rapidly growing and integration is urgently needed if the future vision of the National Airspace System (NAS) and the Next Generation Air Transportation System (NGATS) 2025 concept are to be realized. To address this and other problems such as airport surface congestion, the Space Based Technologies Project s Surface ICNS Network Architecture team at NASA Glenn Research Center has assessed airport surface communications requirements, analyzed existing and future surface applications, and defined a set of architecture functions that will help design a scalable, reliable and flexible surface network architecture to meet the current and future needs of airport operations. This paper describes the systems approach or methodology to networking that was employed to assess airport surface communications requirements, analyze applications, and to define the surface network architecture functions as the building blocks or components of the network. The systems approach used for defining these functions is relatively new to networking. It is viewing the surface network, along with its environment (everything that the surface network interacts with or impacts), as a system. Associated with this system are sets of services that are offered by the network to the rest of the system. Therefore, the surface network is considered as part of the larger system (such as the NAS), with interactions and dependencies between the surface network and its users, applications, and devices. The surface network architecture includes components such as addressing/routing, network management, network

  10. Learning Analytics for Networked Learning Models

    ERIC Educational Resources Information Center

    Joksimovic, Srecko; Hatala, Marek; Gaševic, Dragan

    2014-01-01

    Teaching and learning in networked settings has attracted significant attention recently. The central topic of networked learning research is human-human and human-information interactions occurring within a networked learning environment. The nature of these interactions is highly complex and usually requires a multi-dimensional approach to…

  11. A neural computation approach to the set covering problem

    SciTech Connect

    Grossman, T.

    1995-07-01

    This paper presents a neural network algorithm which is capable of finding approximate solutions for unicost set covering problems. The network has two types of units (neurons), with different dynamics and activation functions. One type represents the objects to be covered (the rows in the matrix representation of the problem) and another represents the ``covering`` sets (the 0,1 variables). They are connected as a bipartite graph which represents the incidence relations between objects and sets (i.e the 0,1 adjacency matrix). When the parameters of the units are correctly tuned, the stable states of the system correspond to the minimal covers. I show that in its basic mode of operation, descent dynamics, when the network is set in an arbitrary initial state it converges in less than 2n steps (where n is the number of variables), to a stable state which represents a valid solution. In this mode, the network implements a greedy heuristic in which the choice function is based on the unit inputs (which are determined by the activation functions and the network state). On top of the basic network dynamics, the algorithm applies an adaptive restart procedure which helps to search more effectively for ``good`` initial states and results in better performance.

  12. Networked Microgrids Scoping Study

    SciTech Connect

    Backhaus, Scott N.; Dobriansky, Larisa; Glover, Steve; Liu, Chen-Ching; Looney, Patrick; Mashayekh, Salman; Pratt, Annabelle; Schneider, Kevin; Stadler, Michael; Starke, Michael; Wang, Jianhui; Yue, Meng

    2016-12-05

    Much like individual microgrids, the range of opportunities and potential architectures of networked microgrids is very diverse. The goals of this scoping study are to provide an early assessment of research and development needs by examining the benefits of, risks created by, and risks to networked microgrids. At this time there are very few, if any, examples of deployed microgrid networks. In addition, there are very few tools to simulate or otherwise analyze the behavior of networked microgrids. In this setting, it is very difficult to evaluate networked microgrids systematically or quantitatively. At this early stage, this study is relying on inputs, estimations, and literature reviews by subject matter experts who are engaged in individual microgrid research and development projects, i.e., the authors of this study The initial step of the study gathered input about the potential opportunities provided by networked microgrids from these subject matter experts. These opportunities were divided between the subject matter experts for further review. Part 2 of this study is comprised of these reviews. Part 1 of this study is a summary of the benefits and risks identified in the reviews in Part 2 and synthesis of the research needs required to enable networked microgrids.

  13. Characterizing Network Services through Cluster-Set Variations

    SciTech Connect

    Bartoletti, A; Tang, N

    2005-03-23

    Common Internet services can be reliably distinguished based solely upon the locations of clusters in traffic-based features (ratios of inbound to outbound packets, ratios of packets to payloads, etc.) This capability has value in revealing the nature of ''hidden'' (tunneled) services and in detecting anomalous changes to known services. We provide measures of session capture volumes sufficient to make confidence-level assertions regarding ''unknown'' services, and outline a throughput system for providing alarms for service anomalies.

  14. Communications, Navigation, and Network Reconfigurable Test-bed Flight Hardware Compatibility Test S

    NASA Technical Reports Server (NTRS)

    2010-01-01

    Communications, Navigation, and Network Reconfigurable Test-bed Flight Hardware Compatibility Test Sets and Networks Integration Management Office Testing for the Tracking and Data Relay Satellite System

  15. Tool setting device

    DOEpatents

    Brown, Raymond J.

    1977-01-01

    The present invention relates to a tool setting device for use with numerically controlled machine tools, such as lathes and milling machines. A reference position of the machine tool relative to the workpiece along both the X and Y axes is utilized by the control circuit for driving the tool through its program. This reference position is determined for both axes by displacing a single linear variable displacement transducer (LVDT) with the machine tool through a T-shaped pivotal bar. The use of the T-shaped bar allows the cutting tool to be moved sequentially in the X or Y direction for indicating the actual position of the machine tool relative to the predetermined desired position in the numerical control circuit by using a single LVDT.

  16. Network Basics.

    ERIC Educational Resources Information Center

    Tennant, Roy

    1992-01-01

    Explains how users can find and access information resources available on the Internet. Highlights include network information centers (NICs); lists, both formal and informal; computer networking protocols, including international standards; electronic mail; remote log-in; and file transfer. (LRW)

  17. Network neuroscience.

    PubMed

    Bassett, Danielle S; Sporns, Olaf

    2017-02-23

    Despite substantial recent progress, our understanding of the principles and mechanisms underlying complex brain function and cognition remains incomplete. Network neuroscience proposes to tackle these enduring challenges. Approaching brain structure and function from an explicitly integrative perspective, network neuroscience pursues new ways to map, record, analyze and model the elements and interactions of neurobiological systems. Two parallel trends drive the approach: the availability of new empirical tools to create comprehensive maps and record dynamic patterns among molecules, neurons, brain areas and social systems; and the theoretical framework and computational tools of modern network science. The convergence of empirical and computational advances opens new frontiers of scientific inquiry, including network dynamics, manipulation and control of brain networks, and integration of network processes across spatiotemporal domains. We review emerging trends in network neuroscience and attempt to chart a path toward a better understanding of the brain as a multiscale networked system.

  18. Controlling centrality in complex networks

    PubMed Central

    Nicosia, V.; Criado, R.; Romance, M.; Russo, G.; Latora, V.

    2012-01-01

    Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes. PMID:22355732

  19. Network science.

    PubMed

    Barabási, Albert-László

    2013-03-28

    Professor Barabási's talk described how the tools of network science can help understand the Web's structure, development and weaknesses. The Web is an information network, in which the nodes are documents (at the time of writing over one trillion of them), connected by links. Other well-known network structures include the Internet, a physical network where the nodes are routers and the links are physical connections, and organizations, where the nodes are people and the links represent communications.

  20. Controllability of the better chosen partial networks

    NASA Astrophysics Data System (ADS)

    Liu, Xueming; Pan, Linqiang

    2016-08-01

    How to control large complex networks is a great challenge. Recent studies have proved that the whole network can be sufficiently steered by injecting control signals into a minimum set of driver nodes, and the minimum numbers of driver nodes for many real networks are high, indicating that it is difficult to control them. For some large natural and technological networks, it is impossible and not feasible to control the full network. For example, in biological networks like large-scale gene regulatory networks it is impossible to control all the genes. This prompts us to explore the question how to choose partial networks that are easy for controlling and important in networked systems. In this work, we propose a method to achieve this goal. By computing the minimum driver nodes densities of the partial networks of Erdös-Rényi (ER) networks, scale-free (SF) networks and 23 real networks, we find that our method performs better than random method that chooses nodes randomly. Moreover, we find that the nodes chosen by our method tend to be the essential elements of the whole systems, via studying the nodes chosen by our method of a real human signaling network and a human protein interaction network and discovering that the chosen nodes from these networks tend to be cancer-associated genes. The implementation of our method shows some interesting connections between the structure and the controllability of networks, improving our understanding of the control principles of complex systems.

  1. Integrated Networks.

    ERIC Educational Resources Information Center

    Robinovitz, Stewart

    1987-01-01

    A strategy for integrated data and voice networks implemented at the University of Michigan is described. These networks often use multi-technologies, multi-vendors, and multi-transmission media that will be fused into a single integrated network. Transmission media include twisted-pair wire, coaxial cable, fiber optics, and microwave. (Author/MLW)

  2. Small-world networks

    NASA Astrophysics Data System (ADS)

    Strogatz, Steven

    Everyone is familiar with the small-world phenomenon: soon after meeting a stranger, we are often suprised to discover that we have a mutual friend, or that we are somehow linked by a short chain of friends. In this talk, I'll present evidence that the small-world phenomenon is more than a curiosity of social networks — it is actually a general property of large, sparse networks whose topology is neither completely regular nor completely random. To check this idea, Duncan Watts and I have analyzed three networks of scientific interest: the neural network of the nematode worm C. elegans, the electrical power grid of the western United States, and the collaboration graph of actors in feature films. All three are small worlds, in the sense that the average number of "handshakes" separating any two members is extremely small (close to the theoretical lower limit set by a random graph). Yet at the same time, all three networks exhibit much more local clustering than a random net, demonstrating that they are not random. I'll also discuss a class of model networks that interpolate between regular lattices and random graphs. Previous theoretical research on complex systems in a wide range of disciplines has focused almost exclusively on networks that are either regular or random. Real networks often lie somewhere in between. Our mathematical model shows that networks in this middle ground tend to exhibit the small-world phenomenon, thanks to the presence of a few long-range edges that link parts of the graph that would otherwise be far apart. Furthermore, we find that when various dynamical systems are coupled in a small-world fashion, they exhibit much greater propagation speed, computational power, and synchronizability than their locally connected, regular counterparts. We explore the implications of these results for simple models of disease spreading, global computation in cellular automata, and collective locking of biological oscillators.

  3. Attractor Metabolic Networks

    PubMed Central

    De la Fuente, Ildefonso M.; Cortes, Jesus M.; Pelta, David A.; Veguillas, Juan

    2013-01-01

    Background The experimental observations and numerical studies with dissipative metabolic networks have shown that cellular enzymatic activity self-organizes spontaneously leading to the emergence of a Systemic Metabolic Structure in the cell, characterized by a set of different enzymatic reactions always locked into active states (metabolic core) while the rest of the catalytic processes are only intermittently active. This global metabolic structure was verified for Escherichia coli, Helicobacter pylori and Saccharomyces cerevisiae, and it seems to be a common key feature to all cellular organisms. In concordance with these observations, the cell can be considered a complex metabolic network which mainly integrates a large ensemble of self-organized multienzymatic complexes interconnected by substrate fluxes and regulatory signals, where multiple autonomous oscillatory and quasi-stationary catalytic patterns simultaneously emerge. The network adjusts the internal metabolic activities to the external change by means of flux plasticity and structural plasticity. Methodology/Principal Findings In order to research the systemic mechanisms involved in the regulation of the cellular enzymatic activity we have studied different catalytic activities of a dissipative metabolic network under different external stimuli. The emergent biochemical data have been analysed using statistical mechanic tools, studying some macroscopic properties such as the global information and the energy of the system. We have also obtained an equivalent Hopfield network using a Boltzmann machine. Our main result shows that the dissipative metabolic network can behave as an attractor metabolic network. Conclusions/Significance We have found that the systemic enzymatic activities are governed by attractors with capacity to store functional metabolic patterns which can be correctly recovered from specific input stimuli. The network attractors regulate the catalytic patterns, modify the efficiency

  4. Control efficacy of complex networks

    PubMed Central

    Gao, Xin-Dong; Wang, Wen-Xu; Lai, Ying-Cheng

    2016-01-01

    Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks. PMID:27324438

  5. Control efficacy of complex networks

    NASA Astrophysics Data System (ADS)

    Gao, Xin-Dong; Wang, Wen-Xu; Lai, Ying-Cheng

    2016-06-01

    Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

  6. 78 FR 5075 - Energy Conservation Program: Test Procedure for Set-Top Boxes

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-01-23

    ... waves to exchange data wirelessly over a computer network using the Institute of Electrical and... Wattmeter 5. Calibration 6. Network Setup G. Test Method and Measurements 1. Set-Top Box Warm-Up 2. Test... determination (the 2011 proposed determination), that tentatively determined that STBs and network...

  7. Neural-Network Object-Recognition Program

    NASA Technical Reports Server (NTRS)

    Spirkovska, L.; Reid, M. B.

    1993-01-01

    HONTIOR computer program implements third-order neural network exhibiting invariance under translation, change of scale, and in-plane rotation. Invariance incorporated directly into architecture of network. Only one view of each object needed to train network for two-dimensional-translation-invariant recognition of object. Also used for three-dimensional-transformation-invariant recognition by training network on only set of out-of-plane rotated views. Written in C language.

  8. Associative memory in phasing neuron networks

    SciTech Connect

    Nair, Niketh S; Bochove, Erik J.; Braiman, Yehuda

    2014-01-01

    We studied pattern formation in a network of coupled Hindmarsh-Rose model neurons and introduced a new model for associative memory retrieval using networks of Kuramoto oscillators. Hindmarsh-Rose Neural Networks can exhibit a rich set of collective dynamics that can be controlled by their connectivity. Specifically, we showed an instance of Hebb's rule where spiking was correlated with network topology. Based on this, we presented a simple model of associative memory in coupled phase oscillators.

  9. Telemedicine in clinical setting

    PubMed Central

    Zhang, Xiao-Ying; Zhang, Peiying

    2016-01-01

    The telemedicine department of a hospital is an emerging branch in upcoming hospitals and may become an essential component of every hospital. It basically utilizes the information technologies along with telecommunication systems in order to provide clinical care and assistance. Furthermore, the branch of telemedicine offers significant opportunities for the process of developmental freedom from illness, early death, and preventable diseases. It advances development by providing relevant drugs and the necessary care aimed to alleviate patient suffering. It is also beneficial for patients in rural remote areas who usually do not have adequate access to advanced hospitals. Telemedicine in these remote areas allows for timely treatment of emergency cases. Thus, it contributes towards remote emergency critical care in order to save lives in crucial cases. Additionally, the emerging advances have now enabled telemedicine to transfer large amounts of clinical informatics data including images, and test reports to the specifically specialized health professionals in some serious cases. However, as in the case of many emerging technologies, organizing information and understanding the field has significant challenges. The present review article aimed to discuss important aspects of the field with regard to the better management of patients in clinical settings. PMID:27703503

  10. Superelastic networks

    SciTech Connect

    Obukhov, S.P.; Rubinstein, M.; Colby, R.H.

    1993-12-31

    This paper discusses the elastic modulus, swelling, and deswelling behavior of networks as a function of their concentration and the preparation state. Based on these results, the authors expect that networks prepared by crosslinking long chains at low concentration, followed by removal of solvent, will have superelastic properties - the deswollen networks will have low modulus and will be capable of stretching by enormous amounts without breaking. This is because deswelling introduces only temporary entanglements. These temporary entanglements change the static configuration of the network strands. The authors discuss the non-Gaussian nature of these strands and the linear viscoelastic response of the superelastic networks.

  11. Communications network analysis tool

    NASA Astrophysics Data System (ADS)

    Phillips, Wayne; Dunn, Gary

    1989-11-01

    The Communications Network Analysis Tool (CNAT) is a set of computer programs that aids in the performance evaluation of a communication system in a real-world scenario. Communication network protocols can be modeled and battle group connectivity can be analyzed in the presence of jamming and the benefit of relay platforms can be studied. The Joint Tactical Information Distribution System (JTIDS) Communication system architecture is currently being modeled; however, the computer software is modular enough to allow substitution of a new code representative of prospective communication protocols.

  12. Synthetic biological networks

    NASA Astrophysics Data System (ADS)

    Archer, Eric; Süel, Gürol M.

    2013-09-01

    Despite their obvious relationship and overlap, the field of physics is blessed with many insightful laws, while such laws are sadly absent in biology. Here we aim to discuss how the rise of a more recent field known as synthetic biology may allow us to more directly test hypotheses regarding the possible design principles of natural biological networks and systems. In particular, this review focuses on synthetic gene regulatory networks engineered to perform specific functions or exhibit particular dynamic behaviors. Advances in synthetic biology may set the stage to uncover the relationship of potential biological principles to those developed in physics.

  13. Statistically Validated Networks in Bipartite Complex Systems

    PubMed Central

    Tumminello, Michele; Miccichè, Salvatore; Lillo, Fabrizio; Piilo, Jyrki; Mantegna, Rosario N.

    2011-01-01

    Many complex systems present an intrinsic bipartite structure where elements of one set link to elements of the second set. In these complex systems, such as the system of actors and movies, elements of one set are qualitatively different than elements of the other set. The properties of these complex systems are typically investigated by constructing and analyzing a projected network on one of the two sets (for example the actor network or the movie network). Complex systems are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set, and this heterogeneity makes it very difficult to discriminate links of the projected network that are just reflecting system's heterogeneity from links relevant to unveil the properties of the system. Here we introduce an unsupervised method to statistically validate each link of a projected network against a null hypothesis that takes into account system heterogeneity. We apply the method to a biological, an economic and a social complex system. The method we propose is able to detect network structures which are very informative about the organization and specialization of the investigated systems, and identifies those relationships between elements of the projected network that cannot be explained simply by system heterogeneity. We also show that our method applies to bipartite systems in which different relationships might have different qualitative nature, generating statistically validated networks in which such difference is preserved. PMID:21483858

  14. Optimizing Nutrient Uptake in Biological Transport Networks

    NASA Astrophysics Data System (ADS)

    Ronellenfitsch, Henrik; Katifori, Eleni

    2013-03-01

    Many biological systems employ complex networks of vascular tubes to facilitate transport of solute nutrients, examples include the vascular system of plants (phloem), some fungi, and the slime-mold Physarum. It is believed that such networks are optimized through evolution for carrying out their designated task. We propose a set of hydrodynamic governing equations for solute transport in a complex network, and obtain the optimal network architecture for various classes of optimizing functionals. We finally discuss the topological properties and statistical mechanics of the resulting complex networks, and examine correspondence of the obtained networks to those found in actual biological systems.

  15. Studying the complex expression dependences between sets of coexpressed genes.

    PubMed

    Huerta, Mario; Casanova, Oriol; Barchino, Roberto; Flores, Jose; Querol, Enrique; Cedano, Juan

    2014-01-01

    Organisms simplify the orchestration of gene expression by coregulating genes whose products function together in the cell. The use of clustering methods to obtain sets of coexpressed genes from expression arrays is very common; nevertheless there are no appropriate tools to study the expression networks among these sets of coexpressed genes. The aim of the developed tools is to allow studying the complex expression dependences that exist between sets of coexpressed genes. For this purpose, we start detecting the nonlinear expression relationships between pairs of genes, plus the coexpressed genes. Next, we form networks among sets of coexpressed genes that maintain nonlinear expression dependences between all of them. The expression relationship between the sets of coexpressed genes is defined by the expression relationship between the skeletons of these sets, where this skeleton represents the coexpressed genes with a well-defined nonlinear expression relationship with the skeleton of the other sets. As a result, we can study the nonlinear expression relationships between a target gene and other sets of coexpressed genes, or start the study from the skeleton of the sets, to study the complex relationships of activation and deactivation between the sets of coexpressed genes that carry out the different cellular processes present in the expression experiments.

  16. Vulnerability of network of networks

    NASA Astrophysics Data System (ADS)

    Havlin, S.; Kenett, D. Y.; Bashan, A.; Gao, J.; Stanley, H. E.

    2014-10-01

    Our dependence on networks - be they infrastructure, economic, social or others - leaves us prone to crises caused by the vulnerabilities of these networks. There is a great need to develop new methods to protect infrastructure networks and prevent cascade of failures (especially in cases of coupled networks). Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How, and at which cost can one restructure the network such that it will become more robust against malicious attacks? The gradual increase in attacks on the networks society depends on - Internet, mobile phone, transportation, air travel, banking, etc. - emphasize the need to develop new strategies to protect and defend these crucial networks of communication and infrastructure networks. One example is the threat of liquid explosives a few years ago, which completely shut down air travel for days, and has created extreme changes in regulations. Such threats and dangers warrant the need for new tools and strategies to defend critical infrastructure. In this paper we review recent advances in the theoretical understanding of the vulnerabilities of interdependent networks with and without spatial embedding, attack strategies and their affect on such networks of networks as well as recently developed strategies to optimize and repair failures caused by such attacks.

  17. Network Monitor and Control of Disruption-Tolerant Networks

    NASA Technical Reports Server (NTRS)

    Torgerson, J. Leigh

    2014-01-01

    For nearly a decade, NASA and many researchers in the international community have been developing Internet-like protocols that allow for automated network operations in networks where the individual links between nodes are only sporadically connected. A family of Disruption-Tolerant Networking (DTN) protocols has been developed, and many are reaching CCSDS Blue Book status. A NASA version of DTN known as the Interplanetary Overlay Network (ION) has been flight-tested on the EPOXI spacecraft and ION is currently being tested on the International Space Station. Experience has shown that in order for a DTN service-provider to set up a large scale multi-node network, a number of network monitor and control technologies need to be fielded as well as the basic DTN protocols. The NASA DTN program is developing a standardized means of querying a DTN node to ascertain its operational status, known as the DTN Management Protocol (DTNMP), and the program has developed some prototypes of DTNMP software. While DTNMP is a necessary component, it is not sufficient to accomplish Network Monitor and Control of a DTN network. JPL is developing a suite of tools that provide for network visualization, performance monitoring and ION node control software. This suite of network monitor and control tools complements the GSFC and APL-developed DTN MP software, and the combined package can form the basis for flight operations using DTN.

  18. An efficient quantum scheme for Private Set Intersection

    NASA Astrophysics Data System (ADS)

    Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

    2016-01-01

    Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server's set. Therefore, it is very suitable for big data services in Cloud or large-scale client-server networks.

  19. The correlation of metrics in complex networks with applications in functional brain networks

    NASA Astrophysics Data System (ADS)

    Li, C.; Wang, H.; de Haan, W.; Stam, C. J.; Van Mieghem, P.

    2011-11-01

    An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients between widely studied network metrics in three network models (Bárabasi-Albert graphs, Erdös-Rényi random graphs and Watts-Strogatz small-world graphs) as well as in functional brain networks of healthy subjects. The metric correlations, which we have observed and theoretically explained, motivate us to propose a small representative set of metrics by including only one metric from each subset of mutually strongly dependent metrics. The following contributions are considered important. (a) A network with a given degree distribution can indeed be characterized by a small representative set of metrics. (b) Unweighted networks, which are obtained from weighted functional brain networks with a fixed threshold, and Erdös-Rényi random graphs follow a similar degree distribution. Moreover, their metric correlations and the resultant representative metrics are similar as well. This verifies the influence of degree distribution on metric correlations. (c) Most metric correlations can be explained analytically. (d) Interestingly, the most studied metrics so far, the average shortest path length and the clustering coefficient, are strongly correlated and, thus, redundant. Whereas spectral metrics, though only studied recently in the context of complex networks, seem to be essential in network characterizations. This representative set of metrics tends to both sufficiently and effectively characterize networks with a given degree distribution. In the study of a specific network, however, we have to at least consider the representative set so that important network properties will not be neglected.

  20. Leadership in School Networks: Findings from the Networked Learning Communities Programme

    ERIC Educational Resources Information Center

    Jopling, Michael; Spender, Barbara

    2006-01-01

    The Networked Learning Community (NLC) programme has been a major research and development activity of the National College of School Leadership (NCSL). One hundred and four voluntary, funded school networks were set up following a process of bidding and selection operated by a core NCSL team, the Networked Learning Group (NLG). A second tranche…

  1. Risk and reliability assessment for telecommunications networks

    SciTech Connect

    Wyss, G.D.; Schriner, H.K.; Gaylor, T.R.

    1996-08-01

    Sandia National Laboratories has assembled an interdisciplinary team to explore the applicability of probabilistic logic modeling (PLM) techniques to model network reliability for a wide variety of communications network architectures. The authors have found that the reliability and failure modes of current generation network technologies can be effectively modeled using fault tree PLM techniques. They have developed a ``plug-and-play`` fault tree analysis methodology that can be used to model connectivity and the provision of network services in a wide variety of current generation network architectures. They have also developed an efficient search algorithm that can be used to determine the minimal cut sets of an arbitrarily-interconnected (non-hierarchical) network without the construction of a fault tree model. This paper provides an overview of these modeling techniques and describes how they are applied to networks that exhibit hybrid network structures (i.e., a network in which some areas are hierarchical and some areas are not hierarchical).

  2. Network-Based Identification of Biomarkers Coexpressed with Multiple Pathways

    PubMed Central

    Guo, Nancy Lan; Wan, Ying-Wooi

    2014-01-01

    Unraveling complex molecular interactions and networks and incorporating clinical information in modeling will present a paradigm shift in molecular medicine. Embedding biological relevance via modeling molecular networks and pathways has become increasingly important for biomarker identification in cancer susceptibility and metastasis studies. Here, we give a comprehensive overview of computational methods used for biomarker identification, and provide a performance comparison of several network models used in studies of cancer susceptibility, disease progression, and prognostication. Specifically, we evaluated implication networks, Boolean networks, Bayesian networks, and Pearson’s correlation networks in constructing gene coexpression networks for identifying lung cancer diagnostic and prognostic biomarkers. The results show that implication networks, implemented in Genet package, identified sets of biomarkers that generated an accurate prediction of lung cancer risk and metastases; meanwhile, implication networks revealed more biologically relevant molecular interactions than Boolean networks, Bayesian networks, and Pearson’s correlation networks when evaluated with MSigDB database. PMID:25392692

  3. Network Sampling and Classification:An Investigation of Network Model Representations

    PubMed Central

    Airoldi, Edoardo M.; Bai, Xue; Carley, Kathleen M.

    2011-01-01

    Methods for generating a random sample of networks with desired properties are important tools for the analysis of social, biological, and information networks. Algorithm-based approaches to sampling networks have received a great deal of attention in recent literature. Most of these algorithms are based on simple intuitions that associate the full features of connectivity patterns with specific values of only one or two network metrics. Substantive conclusions are crucially dependent on this association holding true. However, the extent to which this simple intuition holds true is not yet known. In this paper, we examine the association between the connectivity patterns that a network sampling algorithm aims to generate and the connectivity patterns of the generated networks, measured by an existing set of popular network metrics. We find that different network sampling algorithms can yield networks with similar connectivity patterns. We also find that the alternative algorithms for the same connectivity pattern can yield networks with different connectivity patterns. We argue that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of network metrics for a specific network type. This fact has important implications for network data analysis: for instance, implications related to the way significance is currently assessed. PMID:21666773

  4. Re-Setting Music Education's "Default Settings"

    ERIC Educational Resources Information Center

    Regelski, Thomas A.

    2013-01-01

    This paper explores the effects and problems of one highly influential default setting of the "normal style template" of music education and proposes some alternatives. These do not require abandoning all traditional templates for school music. But re-setting the default settings does depend on reconsidering the promised function of…

  5. Deploying temporary networks for upscaling of sparse network stations

    NASA Astrophysics Data System (ADS)

    Coopersmith, Evan J.; Cosh, Michael H.; Bell, Jesse E.; Kelly, Victoria; Hall, Mark; Palecki, Michael A.; Temimi, Marouane

    2016-10-01

    Soil observations networks at the national scale play an integral role in hydrologic modeling, drought assessment, agricultural decision support, and our ability to understand climate change. Understanding soil moisture variability is necessary to apply these measurements to model calibration, business and consumer applications, or even human health issues. The installation of soil moisture sensors as sparse, national networks is necessitated by limited financial resources. However, this results in the incomplete sampling of the local heterogeneity of soil type, vegetation cover, topography, and the fine spatial distribution of precipitation events. To this end, temporary networks can be installed in the areas surrounding a permanent installation within a sparse network. The temporary networks deployed in this study provide a more representative average at the 3 km and 9 km scales, localized about the permanent gauge. The value of such temporary networks is demonstrated at test sites in Millbrook, New York and Crossville, Tennessee. The capacity of a single U.S. Climate Reference Network (USCRN) sensor set to approximate the average of a temporary network at the 3 km and 9 km scales using a simple linear scaling function is tested. The capacity of a temporary network to provide reliable estimates with diminishing numbers of sensors, the temporal stability of those networks, and ultimately, the relationship of the variability of those networks to soil moisture conditions at the permanent sensor are investigated. In this manner, this work demonstrates the single-season installation of a temporary network as a mechanism to characterize the soil moisture variability at a permanent gauge within a sparse network.

  6. LMSS communication network design

    NASA Technical Reports Server (NTRS)

    1982-01-01

    The architecture of the telecommunication network as the first step in the design of the LMSS system is described. A set of functional requirements including the total number of users to be served by the LMSS are hypothesized. The design parameters are then defined at length and are systematically selected such that the resultant system is capable of serving the hypothesized number of users. The design of the backhaul link is presented. The number of multiple backhaul beams required for communication to the base stations is determined. A conceptual procedure for call-routing and locating a mobile subscriber within the LMSS network is presented. The various steps in placing a call are explained, and the relationship between the two sets of UHF and S-band multiple beams is developed. A summary of the design parameters is presented.

  7. Neural Networks

    DTIC Science & Technology

    1990-01-01

    FUNDING NUMBERS PROGRAM PROJECT TASK WORK UNIT ELEMENT NO. NO. NO. ACCESSION NO 11 TITLE (Include Security Classification) NEURAL NETWORKS 12. PERSONAL...SUB-GROUP Neural Networks Optical Architectures Nonlinear Optics Adaptation 19. ABSTRACT (Continue on reverse if necessary and identify by block number...341i Y C-odes , lo iii/(iv blank) 1. INTRODUCTION Neural networks are a type of distributed processing system [1

  8. A neural network prototyping package within IRAF

    NASA Technical Reports Server (NTRS)

    Bazell, D.; Bankman, I.

    1992-01-01

    We outline our plans for incorporating a Neural Network Prototyping Package into the IRAF environment. The package we are developing will allow the user to choose between different types of networks and to specify the details of the particular architecture chosen. Neural networks consist of a highly interconnected set of simple processing units. The strengths of the connections between units are determined by weights which are adaptively set as the network 'learns'. In some cases, learning can be a separate phase of the user cycle of the network while in other cases the network learns continuously. Neural networks have been found to be very useful in pattern recognition and image processing applications. They can form very general 'decision boundaries' to differentiate between objects in pattern space and they can be used for associative recall of patterns based on partial cures and for adaptive filtering. We discuss the different architectures we plan to use and give examples of what they can do.

  9. Network reliability

    NASA Technical Reports Server (NTRS)

    Johnson, Marjory J.

    1985-01-01

    Network control (or network management) functions are essential for efficient and reliable operation of a network. Some control functions are currently included as part of the Open System Interconnection model. For local area networks, it is widely recognized that there is a need for additional control functions, including fault isolation functions, monitoring functions, and configuration functions. These functions can be implemented in either a central or distributed manner. The Fiber Distributed Data Interface Medium Access Control and Station Management protocols provide an example of distributed implementation. Relative information is presented here in outline form.

  10. Innovation Networks

    NASA Astrophysics Data System (ADS)

    Pyka, Andreas; Scharnhorst, Andrea

    The idea for this book started when we organized a topical workshop entitled "Innovation Networks - New Approaches in Modeling and Analyzing" (held in Augsburg, Germany in October 2005), under the auspices of Exystence, a network of excellence funded in the European Union's Fifth Framework Program. Unlike other conferences on innovation and networks, however, this workshop brought together scientists from economics, sociology, communication science, science and technology studies, and physics. With this book we aim to build further on a bridge connecting the bodies of knowledge on networks in economics, the social sciences and, more recently, statistical physics.

  11. Radial sets: interactive visual analysis of large overlapping sets.

    PubMed

    Alsallakh, Bilal; Aigner, Wolfgang; Miksch, Silvia; Hauser, Helwig

    2013-12-01

    In many applications, data tables contain multi-valued attributes that often store the memberships of the table entities to multiple sets such as which languages a person masters, which skills an applicant documents, or which features a product comes with. With a growing number of entities, the resulting element-set membership matrix becomes very rich of information about how these sets overlap. Many analysis tasks targeted at set-typed data are concerned with these overlaps as salient features of such data. This paper presents Radial Sets, a novel visual technique to analyze set memberships for a large number of elements. Our technique uses frequency-based representations to enable quickly finding and analyzing different kinds of overlaps between the sets, and relating these overlaps to other attributes of the table entities. Furthermore, it enables various interactions to select elements of interest, find out if they are over-represented in specific sets or overlaps, and if they exhibit a different distribution for a specific attribute compared to the rest of the elements. These interactions allow formulating highly-expressive visual queries on the elements in terms of their set memberships and attribute values. As we demonstrate via two usage scenarios, Radial Sets enable revealing and analyzing a multitude of overlapping patterns between large sets, beyond the limits of state-of-the-art techniques.

  12. MOTIVATION: Goals and Goal Setting

    ERIC Educational Resources Information Center

    Stratton, Richard K.

    2005-01-01

    Goal setting has great impact on a team's performance. Goals enable a team to synchronize their efforts to achieve success. In this article, the author talks about goals and goal setting. This articles complements Domain 5--Teaching and Communication (p.14) and discusses one of the benchmarks listed therein: "Teach the goal setting process and…

  13. VLSI Based Multiprocessor Communications Networks.

    DTIC Science & Technology

    1982-09-01

    BENE63: Bones. V.E. MATHEMATICAL THOERY OF illustrated in Figure 10. which provides equal CONNECTING NETWORIS AND TELEPHONE TRAFFIC. Aced. lengths...can be controlled. It should be clear, then, that a connection between two ports of a network can be established by sending into the network a string ...of control digits, each one of which is used to set the connection through a particular switch. This string of digits is called the connection ’header

  14. Wireless local area network security.

    PubMed

    Bergeron, Bryan P

    2004-01-01

    Wireless local area networks (WLANs) are increasingly popular in clinical settings because they facilitate the use of wireless PDAs, laptops, and other pervasive computing devices at the point of care. However, because of the relative immaturity of wireless network technology and evolving standards, WLANs, if improperly configured, can present significant security risks. Understanding the security limitations of the technology and available fixes can help minimize the risks of clinical data loss and maintain compliance with HIPAA guidelines.

  15. Policy issues in interconnecting networks

    NASA Technical Reports Server (NTRS)

    Leiner, Barry M.

    1989-01-01

    To support the activities of the Federal Research Coordinating Committee (FRICC) in creating an interconnected set of networks to serve the research community, two workshops were held to address the technical support of policy issues that arise when interconnecting such networks. The workshops addressed the required and feasible technologies and architectures that could be used to satisfy the desired policies for interconnection. The results of the workshop are documented.

  16. Bimodality in Network Control

    NASA Astrophysics Data System (ADS)

    Jia, Tao; Liu, Yang-Yu; Posfai, Marton; Slotine, Jean-Jacques; Barabasi, Albert-Laszlo

    2013-03-01

    Controlling complex systems is a fundamental challenge of network science. Recent tools enable us to identify the minimum driver nodes, from which we can control a system. They also indicate a multiplicity of minimum driver node sets (MDS's): multiple combinations of the same number of nodes can achieve control over the system. This multiplicity allows us to classify individual nodes as critical if they are involved in all control configurations, intermittent if they occasionally act as driver nodes and redundant if they do not play any role in control. We develop computational and analytical framework analyzing nodes in each category in both model and real networks. We find that networks with identical degree distribution can be in two distinct control modes, ``centralized'' or ``distributed'', with drastic change on the role of each node in maintaining the controllability and orders of magnitude difference in the number of MDS's. In analyzing both model and real networks, we find that the two modes can be inferred directly from the network's degree distribution. Finally we show that the two control modes can be switched by small structural perturbations, leading to potential applications of control theory in real systems.

  17. Network Flows

    DTIC Science & Technology

    1988-12-01

    Researchers have suggested other solution strategies, using ideas from nonlinear progamming for solving this general separable convex cost flow problems. Some...plane methods and branch and bound procedures of integer programming, primal-dual methods of linear and nonlinear programming, and polyhedral methods...Combinatorial Optimization: Networks and Matroids), Bazaraa and Jarvis [1978] (Linear Programming and Network Flows), Minieka [1978] (Optimization Algorithms for

  18. Modeling Unreliable Observations in Bayesian Networks by Credal Networks

    NASA Astrophysics Data System (ADS)

    Antonucci, Alessandro; Piatti, Alberto

    Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs about a variable of interest in the network after the observation of some other variables. This is usually achieved under the assumption that the observations could reveal the actual states of the variables in a fully reliable way. We propose a procedure for a more general modeling of the observations, which allows for updating beliefs in different situations, including various cases of unreliable, incomplete, uncertain and also missing observations. This is achieved by augmenting the original Bayesian network with a number of auxiliary variables corresponding to the observations. For a flexible modeling of the observational process, the quantification of the relations between these auxiliary variables and those of the original Bayesian network is done by credal sets, i.e., convex sets of probability mass functions. Without any lack of generality, we show how this can be done by simply estimating the bounds of likelihoods of the observations for the different values of the observed variables. Overall, the Bayesian network is transformed into a credal network, for which a standard updating problem has to be solved. Finally, a number of transformations that might simplify the updating of the resulting credal network is provided.

  19. Attractors: architects of network organization?

    PubMed

    Mpitsos, G J

    2000-05-01

    An attractor is defined here informally as a state of activity toward which a system settles. The settling or relaxation process dissipates the effects produced by external perturbations. In neural systems the relaxation process occurs temporally in the responses of each neuron and spatially across the network such that the activity settles into a subset of the available connections. Within limits, the set of neurons toward which the coordinated neural firing settles can be different from one time to another, and a given set of neurons can generate different types of attractor activity, depending on how the input environment activates the network. Findings such as these indicate that though information resides in the details of neuroanatomic structure, the expression of this information is in the dynamics of attractors. As such, attractors are sources of information that can be used not only in adaptive behavior, but also to effect the neural architecture that generates the attractor. The discussion here focuses on the latter possibility. A conjecture is offered to show that the relaxation dynamic of an attractor may 'guide' activity-dependent learning processes in such a way that synaptic strengths, firing thresholds, the physical connections between neurons, and the size of the network are automatically set in an optimal, interrelated fashion. This inter-relatedness among network parameters would not be expected from more classical, 'switchboard' approaches to neural integration. The ideas are discussed within the context of 'pulse-propagated networks' or equivalently as 'spike-activated networks' in which the specific order in time intervals between action potentials carries important information for cooperative activity to emerge among neurons in a network. Though the proposed ideas are forward-looking, being based on preliminary work in biological and artificial networks, they are testable in biological neural networks reconstructed from identified neurons in

  20. Policies for implementing network firewalls

    SciTech Connect

    Brown, C.D.

    1994-05-01

    Corporate networks are frequently protected by {open_quotes}firewalls{close_quotes} or gateway systems that control access to/from other networks, e.g., the Internet, in order to reduce the network`s vulnerability to hackers and other unauthorized access. Firewalls typically limit access to particular network nodes and application protocols, and they often perform special authentication and authorization functions. One of the difficult issues associated with network firewalls is determining which applications should be permitted through the firewall. For example, many networks permit the exchange of electronic mail with the outside but do not permit file access to be initiated by outside users, as this might allow outside users to access sensitive data or to surreptitiously modify data or programs (e.g., to intall Trojan Horse software). However, if access through firewalls is severely restricted, legitimate network users may find it difficult or impossible to collaborate with outside users and to share data. Some of the most serious issues regarding firewalls involve setting policies for firewalls with the goal of achieving an acceptable balance between the need for greater functionality and the associated risks. Two common firewall implementation techniques, screening routers and application gateways, are discussed below, followed by some common policies implemented by network firewalls.

  1. Temporal networks

    NASA Astrophysics Data System (ADS)

    Holme, Petter; Saramäki, Jari

    2012-10-01

    A great variety of systems in nature, society and technology-from the web of sexual contacts to the Internet, from the nervous system to power grids-can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via e-mail, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself. Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks. The study of temporal networks is very interdisciplinary in nature. Reflecting this, even the object of study has many names-temporal graphs, evolving graphs, time-varying graphs, time-aggregated graphs, time-stamped graphs, dynamic networks, dynamic graphs, dynamical graphs, and so on. This review covers different fields where temporal graphs are considered

  2. A quantum network of clocks

    NASA Astrophysics Data System (ADS)

    Kómár, P.; Kessler, E. M.; Bishof, M.; Jiang, L.; Sørensen, A. S.; Ye, J.; Lukin, M. D.

    2014-08-01

    The development of precise atomic clocks plays an increasingly important role in modern society. Shared timing information constitutes a key resource for navigation with a direct correspondence between timing accuracy and precision in applications such as the Global Positioning System. By combining precision metrology and quantum networks, we propose a quantum, cooperative protocol for operating a network of geographically remote optical atomic clocks. Using nonlocal entangled states, we demonstrate an optimal utilization of global resources, and show that such a network can be operated near the fundamental precision limit set by quantum theory. Furthermore, the internal structure of the network, combined with quantum communication techniques, guarantees security both from internal and external threats. Realization of such a global quantum network of clocks may allow construction of a real-time single international time scale (world clock) with unprecedented stability and accuracy.

  3. Control of collective network chaos.

    PubMed

    Wagemakers, Alexandre; Barreto, Ernest; Sanjuán, Miguel A F; So, Paul

    2014-06-01

    Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of "reduced" ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

  4. Control of collective network chaos

    NASA Astrophysics Data System (ADS)

    Wagemakers, Alexandre; Barreto, Ernest; Sanjuán, Miguel A. F.; So, Paul

    2014-06-01

    Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of "reduced" ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

  5. Supporting Advice Sharing for Technical Problems in Residential Settings

    ERIC Educational Resources Information Center

    Poole, Erika Shehan

    2010-01-01

    Visions of future computing in residential settings often come with assumptions of seamless, well-functioning, properly configured devices and network connectivity. In the near term, however, processes of setup, maintenance, and troubleshooting are fraught with difficulties; householders regularly report these tasks as confusing, frustrating, and…

  6. Dissociating Stimulus-Set and Response-Set in the Context of Task-Set Switching

    ERIC Educational Resources Information Center

    Kieffaber, Paul D.; Kruschke, John K.; Cho, Raymond Y.; Walker, Philip M.; Hetrick, William P.

    2013-01-01

    The primary aim of the present research was to determine how "stimulus-set" and "response-set" components of task-set contribute to switch costs and conflict processing. Three experiments are described wherein participants completed an explicitly cued task-switching procedure. Experiment 1 established that task switches requiring a reconfiguration…

  7. IGS Network Coordinator Report - 2002

    NASA Technical Reports Server (NTRS)

    Moore, Angelyn

    2004-01-01

    The IGS network is a set of permanent, continuously-operating, dual-frequency GPS stations operated by over 100 worldwide agencies. The dataset is pooled at IGS Data Centers for routine use by IGS Analysis Centers in creating precise IGS products, as well as free access by other analysts around the world. The IGS Central Bureau hosts the IGS Network Coordinator, who assures adherence to standards and provides information regarding the IGS network via the Central Bureau Information System website at http://igscb.jpl.nasa.gov.

  8. Setting conservation targets for sandy beach ecosystems

    NASA Astrophysics Data System (ADS)

    Harris, Linda; Nel, Ronel; Holness, Stephen; Sink, Kerry; Schoeman, David

    2014-10-01

    Representative and adequate reserve networks are key to conserving biodiversity. This begs the question, how much of which features need to be placed in protected areas? Setting specifically-derived conservation targets for most ecosystems is common practice; however, this has never been done for sandy beaches. The aims of this paper, therefore, are to propose a methodology for setting conservation targets for sandy beach ecosystems; and to pilot the proposed method using data describing biodiversity patterns and processes from microtidal beaches in South Africa. First, a classification scheme of valued features of beaches is constructed, including: biodiversity features; unique features; and important processes. Second, methodologies for setting targets for each feature under different data-availability scenarios are described. From this framework, targets are set for features characteristic of microtidal beaches in South Africa, as follows. 1) Targets for dune vegetation types were adopted from a previous assessment, and ranged 19-100%. 2) Targets for beach morphodynamic types (habitats) were set using species-area relationships (SARs). These SARs were derived from species richness data from 142 sampling events around the South African coast (extrapolated to total theoretical species richness estimates using previously-established species-accumulation curve relationships), plotted against the area of the beach (calculated from Google Earth imagery). The species-accumulation factor (z) was 0.22, suggesting a baseline habitat target of 27% is required to protect 75% of the species. This baseline target was modified by heuristic principles, based on habitat rarity and threat status, with final values ranging 27-40%. 3) Species targets were fixed at 20%, modified using heuristic principles based on endemism, threat status, and whether or not beaches play an important role in the species' life history, with targets ranging 20-100%. 4) Targets for processes and 5

  9. Network Structure and City Size

    PubMed Central

    Levinson, David

    2012-01-01

    Network structure varies across cities. This variation may yield important knowledge about how the internal structure of the city affects its performance. This paper systematically compares a set of surface transportation network structure variables (connectivity, hierarchy, circuity, treeness, entropy, accessibility) across the 50 largest metropolitan areas in the United States. A set of scaling parameters are discovered to show how network size and structure vary with city size. These results suggest that larger cities are physically more inter-connected. Hypotheses are presented as to why this might obtain. This paper then consistently measures and ranks access to jobs across 50 US metropolitan areas. It uses that accessibility measure, along with network structure variables and city size to help explain journey-to-work time and auto mode share in those cities. A 1 percent increase in accessibility reduces average metropolitan commute times by about 90 seconds each way. A 1 percent increase in network connectivity reduces commute time by 0.1 percent. A 1 percent increase in accessibility results in a 0.0575 percent drop in auto mode share, while a 1 percent increase in treeness reduces auto mode share by 0.061 percent. Use of accessibility and network structure measures is important for planning and evaluating the performance of network investments and land use changes. PMID:22253764

  10. Technological Networks

    NASA Astrophysics Data System (ADS)

    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

  11. Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

    PubMed Central

    Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

    2006-01-01

    A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

  12. Modularity and community structure in networks

    PubMed Central

    Newman, M. E. J.

    2006-01-01

    Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as “modularity” over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets. PMID:16723398

  13. The SET domain protein, Set3p, promotes the reliable execution of cytokinesis in Schizosaccharomyces pombe.

    PubMed

    Rentas, Stefan; Saberianfar, Reza; Grewal, Charnpal; Kanippayoor, Rachelle; Mishra, Mithilesh; McCollum, Dannel; Karagiannis, Jim

    2012-01-01

    In response to perturbation of the cell division machinery fission yeast cells activate regulatory networks that ensure the faithful completion of cytokinesis. For instance, when cells are treated with drugs that impede constriction of the actomyosin ring (low doses of Latrunculin A, for example) these networks ensure that cytokinesis is complete before progression into the subsequent mitosis. Here, we identify three previously uncharacterized genes, hif2, set3, and snt1, whose deletion results in hyper-sensitivity to LatA treatment and in increased rates of cytokinesis failure. Interestingly, these genes are orthologous to TBL1X, MLL5, and NCOR2, human genes that encode components of a histone deacetylase complex with a known role in cytokinesis. Through co-immunoprecipitation experiments, localization studies, and phenotypic analysis of gene deletion mutants, we provide evidence for an orthologous complex in fission yeast. Furthermore, in light of the putative role of the complex in chromatin modification, together with our results demonstrating an increase in Set3p levels upon Latrunculin A treatment, global gene expression profiles were generated. While this analysis demonstrated that the expression of cytokinesis genes was not significantly affected in set3Δ backgrounds, it did reveal defects in the ability of the mutant to regulate genes with roles in the cellular response to stress. Taken together, these findings support the existence of a conserved, multi-protein complex with a role in promoting the successful completion of cytokinesis.

  14. Middleware for reliable mobile medical workflow support in disaster settings.

    PubMed

    Brown, Steven W; Griswold, William G; Demchak, Barry; Lenert, Leslie A

    2006-01-01

    Mobile information technology can help first responders assist patients more quickly, reliably, and safely, while focusing resources on those most in need. Yet the disaster setting complicates reliable networked computing. The WIISARD client-server architecture provides mobile IT support for medical response in disasters. Cached remote objects (CROs) are shared via publish/subscribe, enabling disconnected operation when out of network range and ensuring data consistency across clients with rollback/replay. CROs also provide a flexible, familiar, and performant programming model for client programmers. A drill with the San Diego MMST showed that a basic client-server architecture, even with CRO's, is insufficient, because prolonged network failures-to be expected in disaster reponse-inhibit group work. We describe an extension of the CRO model to clusters of computers that supports group work during network failures.

  15. Geometric Hitting Set for Segments of Few Orientations

    SciTech Connect

    Fekete, Sandor P.; Huang, Kan; Mitchell, Joseph S. B.; Parekh, Ojas D.; Phillips, Cynthia A.

    2016-01-13

    Here we study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks) using the fewest sensors (the \\hitting points"). We give approximation algorithms for cases including (i) lines of 3 slopes in the plane, (ii) vertical lines and horizontal segments, (iii) pairs of horizontal/vertical segments. Lastly, we give hardness and hardness of approximation results for these problems. We prove that the hitting set problem for vertical lines and horizontal rays is polynomially solvable.

  16. Deep Reconstruction Models for Image Set Classification.

    PubMed

    Hayat, Munawar; Bennamoun, Mohammed; An, Senjian

    2015-04-01

    Image set classification finds its applications in a number of real-life scenarios such as classification from surveillance videos, multi-view camera networks and personal albums. Compared with single image based classification, it offers more promises and has therefore attracted significant research attention in recent years. Unlike many existing methods which assume images of a set to lie on a certain geometric surface, this paper introduces a deep learning framework which makes no such prior assumptions and can automatically discover the underlying geometric structure. Specifically, a Template Deep Reconstruction Model (TDRM) is defined whose parameters are initialized by performing unsupervised pre-training in a layer-wise fashion using Gaussian Restricted Boltzmann Machines (GRBMs). The initialized TDRM is then separately trained for images of each class and class-specific DRMs are learnt. Based on the minimum reconstruction errors from the learnt class-specific models, three different voting strategies are devised for classification. Extensive experiments are performed to demonstrate the efficacy of the proposed framework for the tasks of face and object recognition from image sets. Experimental results show that the proposed method consistently outperforms the existing state of the art methods.

  17. Emulation of the Active Immune Response in a Computer Network

    DTIC Science & Technology

    2009-01-15

    Dynamics of the Estimation Process 53 15 Dual Network Interface for concurrent execution of testbed experiments and lab management 57 16 Hardware Testbed...Two Physical Nodes 62 20 Network Security Testbed Management Software Stack 63 21 Virtual Network Topology for Worm Propagation Experiment Generated...system could be reformulated in terms of the characteristics of computer networks and interpreted as a set of instructions to a network manager . This

  18. Categorical properties of soft sets.

    PubMed

    Zhou, Min; Li, Shenggang; Akram, Muhammad

    2014-01-01

    The present study investigates some novel categorical properties of soft sets. By combining categorical theory with soft set theory, a categorical framework of soft set theory is established. It is proved that the category SFun of soft sets and soft functions has equalizers, finite products, pullbacks, and exponential properties. It is worth mentioning that we find that SFun is both a topological construct and Cartesian closed. The category SRel of soft sets and Z-soft set relations is also characterized, which shows the existence of the zero objects, biproducts, additive identities, injective objects, projective objects, injective hulls, and projective covers. Finally, by constructing proper adjoint situations, some intrinsic connections between SFun and SRel are established.

  19. PUMP SETS NO. 5 AND NO. 4. Each pump set ...

    Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

    PUMP SETS NO. 5 AND NO. 4. Each pump set consists of a Worthington Pump and a General Electric motor - Edwards Air Force Base, Air Force Rocket Propulsion Laboratory, Flame Deflector Water System, Test Area 1-120, north end of Jupiter Boulevard, Boron, Kern County, CA

  20. Innovation network

    PubMed Central

    Acemoglu, Daron; Akcigit, Ufuk; Kerr, William R.

    2016-01-01

    Technological progress builds upon itself, with the expansion of invention in one domain propelling future work in linked fields. Our analysis uses 1.8 million US patents and their citation properties to map the innovation network and its strength. Past innovation network structures are calculated using citation patterns across technology classes during 1975–1994. The interaction of this preexisting network structure with patent growth in upstream technology fields has strong predictive power on future innovation after 1995. This pattern is consistent with the idea that when there is more past upstream innovation for a particular technology class to build on, then that technology class innovates more. PMID:27681628

  1. Innovation network.

    PubMed

    Acemoglu, Daron; Akcigit, Ufuk; Kerr, William R

    2016-10-11

    Technological progress builds upon itself, with the expansion of invention in one domain propelling future work in linked fields. Our analysis uses 1.8 million US patents and their citation properties to map the innovation network and its strength. Past innovation network structures are calculated using citation patterns across technology classes during 1975-1994. The interaction of this preexisting network structure with patent growth in upstream technology fields has strong predictive power on future innovation after 1995. This pattern is consistent with the idea that when there is more past upstream innovation for a particular technology class to build on, then that technology class innovates more.

  2. Interoperability Context-Setting Framework

    SciTech Connect

    Widergren, Steven E.; Hardin, Dave; Ambrosio, Ron; Drummond, R.; Gunther, E.; Gilchrist, Grant; Cohen, David

    2007-01-31

    -conditioning (HVAC) unit up several degrees. The resulting load reduction becomes part of an aggregated response from the electricity service provider to the bulk system operator who is now in a better position to manage total system load with available generation. Looking across the electric system, from generating plants, to transmission substations, to the distribution system, to factories, office parks, and buildings, automation is growing, and the opportunities for unleashing new value propositions are exciting. How can we facilitate this change and do so in a way that ensures the reliability of electric resources for the wellbeing of our economy and security? The GridWise Architecture Council (GWAC) mission is to enable interoperability among the many entities that interact with the electric power system. A good definition of interoperability is, “The capability of two or more networks, systems, devices, applications, or components to exchange information between them and to use the information so exchanged.” As a step in the direction of enabling interoperability, the GWAC proposes a context-setting framework to organize concepts and terminology so that interoperability issues can be identified and debated, improvements to address issues articulated, and actions prioritized and coordinated across the electric power community.

  3. Sentinel Network

    Cancer.gov

    The Sentinel Network is an integrated, electronic, national medical product safety initiative that compiles information about the safe and effective use of medical products accessible to patients and healthcare practitioners.

  4. Exchange Network

    EPA Pesticide Factsheets

    The Environmental Information Exchange Network (EIEN) is an Internet-based system used by state, tribal and territorial partners to securely share environmental and health information with one another and EPA.

  5. Developer Network

    SciTech Connect

    2012-08-21

    NREL's Developer Network, developer.nrel.gov, provides data that users can access to provide data to their own analyses, mobile and web applications. Developers can retrieve the data through a Web services API (application programming interface). The Developer Network handles overhead of serving up web services such as key management, authentication, analytics, reporting, documentation standards, and throttling in a common architecture, while allowing web services and APIs to be maintained and managed independently.

  6. RNEDE: Resilient Network Design Environment

    SciTech Connect

    Venkat Venkatasubramanian, Tanu Malik, Arun Giridh; Craig Rieger; Keith Daum; Miles McQueen

    2010-08-01

    Modern living is more and more dependent on the intricate web of critical infrastructure systems. The failure or damage of such systems can cause huge disruptions. Traditional design of this web of critical infrastructure systems was based on the principles of functionality and reliability. However, it is increasingly being realized that such design objectives are not sufficient. Threats, disruptions and faults often compromise the network, taking away the benefits of an efficient and reliable design. Thus, traditional network design parameters must be combined with self-healing mechanisms to obtain a resilient design of the network. In this paper, we present RNEDEa resilient network design environment that that not only optimizes the network for performance but tolerates fluctuations in its structure that result from external threats and disruptions. The environment evaluates a set of remedial actions to bring a compromised network to an optimal level of functionality. The environment includes a visualizer that enables the network administrator to be aware of the current state of the network and the suggested remedial actions at all times.

  7. Maximal switchability of centralized networks

    NASA Astrophysics Data System (ADS)

    Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu

    2016-08-01

    We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.

  8. Egocentric Social Network Analysis of Pathological Gambling

    PubMed Central

    Meisel, Matthew K.; Clifton, Allan D.; MacKillop, James; Miller, Joshua D.; Campbell, W. Keith; Goodie, Adam S.

    2012-01-01

    Aims To apply social network analysis (SNA) to investigate whether frequency and severity of gambling problems were associated with different network characteristics among friends, family, and co-workers. is an innovative way to look at relationships among individuals; the current study was the first to our knowledge to apply SNA to gambling behaviors. Design Egocentric social network analysis was used to formally characterize the relationships between social network characteristics and gambling pathology. Setting Laboratory-based questionnaire and interview administration. Participants Forty frequent gamblers (22 non-pathological gamblers, 18 pathological gamblers) were recruited from the community. Findings The SNA revealed significant social network compositional differences between the two groups: pathological gamblers (PGs) had more gamblers, smokers, and drinkers in their social networks than did nonpathological gamblers (NPGs). PGs had more individuals in their network with whom they personally gambled, smoked, and drank with than those with who were NPG. Network ties were closer to individuals in their networks who gambled, smoked, and drank more frequently. Associations between gambling severity and structural network characteristics were not significant. Conclusions Pathological gambling is associated with compositional but not structural differences in social networks. Pathological gamblers differ from non-pathological gamblers in the number of gamblers, smokers, and drinkers in their social networks. Homophily within the networks also indicates that gamblers tend to be closer with other gamblers. This homophily may serve to reinforce addictive behaviors, and may suggest avenues for future study or intervention. PMID:23072641

  9. Sentient networks

    SciTech Connect

    Chapline, G.

    1998-03-01

    The engineering problems of constructing autonomous networks of sensors and data processors that can provide alerts for dangerous situations provide a new context for debating the question whether man-made systems can emulate the cognitive capabilities of the mammalian brain. In this paper we consider the question whether a distributed network of sensors and data processors can form ``perceptions`` based on sensory data. Because sensory data can have exponentially many explanations, the use of a central data processor to analyze the outputs from a large ensemble of sensors will in general introduce unacceptable latencies for responding to dangerous situations. A better idea is to use a distributed ``Helmholtz machine`` architecture in which the sensors are connected to a network of simple processors, and the collective state of the network as a whole provides an explanation for the sensory data. In general communication within such a network will require time division multiplexing, which opens the door to the possibility that with certain refinements to the Helmholtz machine architecture it may be possible to build sensor networks that exhibit a form of artificial consciousness.

  10. Fuzzy sets and data analysis.

    NASA Astrophysics Data System (ADS)

    di Gesù, V.

    Methods and their applications to data analysis problems in fuzzy-sets theory are presented. Fuzzy-sets theory seems to be a powerful tool to model uncertainty and vagueness present in the data and to represent the human thinking in a more natural way.

  11. Determination of optimum structure of backpropagation networks

    NASA Astrophysics Data System (ADS)

    Phien, Huynh N.; Sureerattanan, Songyot

    2000-10-01

    The paper proposes the use of the Baysian Information Criterion (BIC), along with an algorithm to systematically select the appropriate structure of the backpropagation (BP) network for a given set of data. Simulation results with hydrological and economic data show that the algorithm performs very satisfactorily. Moreover, it compares with the method of Daqi and Shouyi for one hidden layer network and it is also used for the networks with more than one hidden layer.

  12. Quantitative description and modeling of real networks

    NASA Astrophysics Data System (ADS)

    Capocci, Andrea; Caldarelli, Guido; de Los Rios, Paolo

    2003-10-01

    We present data analysis and modeling of two particular cases of study in the field of growing networks. We analyze World Wide Web data set and authorship collaboration networks in order to check the presence of correlation in the data. The results are reproduced with good agreement through a suitable modification of the standard Albert-Barabási model of network growth. In particular, intrinsic relevance of sites plays a role in determining the future degree of the vertex.

  13. Neural Network False Alarm Filter. Volume 1.

    DTIC Science & Technology

    1994-12-01

    This effort identified, developed and demonstrated a set of approaches for applying neural network learning techniques to the development of a real... neural network models, 9 fault report causes and 12 common groups of BIT techniques was identified. From this space, 4 unique, high-potential...of their strengths and weaknesses were performed along with cost/ benefit analyses. This study concluded that the best candidates for neural network insert

  14. Analysis of the Westland Data Set

    NASA Technical Reports Server (NTRS)

    Wen, Fang; Willett, Peter; Deb, Somnath

    2001-01-01

    The "Westland" set of empirical accelerometer helicopter data with seeded and labeled faults is analyzed with the aim of condition monitoring. The autoregressive (AR) coefficients from a simple linear model encapsulate a great deal of information in a relatively few measurements; and it has also been found that augmentation of these by harmonic and other parameters call improve classification significantly. Several techniques have been explored, among these restricted Coulomb energy (RCE) networks, learning vector quantization (LVQ), Gaussian mixture classifiers and decision trees. A problem with these approaches, and in common with many classification paradigms, is that augmentation of the feature dimension can degrade classification ability. Thus, we also introduce the Bayesian data reduction algorithm (BDRA), which imposes a Dirichlet prior oil training data and is thus able to quantify probability of error in all exact manner, such that features may be discarded or coarsened appropriately.

  15. Commissioning services and Primary Health Networks.

    PubMed

    Booth, Mark; Boxall, Anne-Marie

    2016-01-01

    Commissioning is set to become a stronger feature in the Australian health system as Primary Health Networks embrace it as a tool for improving population health outcomes. International experience shows that developing into a commissioning organisation is not always easy. Drawing on international experiences of commissioning, as well as those from the Australian hospital sector, will help smooth the path for Primary Health Networks.

  16. Artificial Neural Networks and Instructional Technology.

    ERIC Educational Resources Information Center

    Carlson, Patricia A.

    1991-01-01

    Artificial neural networks (ANN), part of artificial intelligence, are discussed. Such networks are fed sample cases (training sets), learn how to recognize patterns in the sample data, and use this experience in handling new cases. Two cognitive roles for ANNs (intelligent filters and spreading, associative memories) are examined. Prototypes…

  17. Radiation Behavior of Analog Neural Network Chip

    NASA Technical Reports Server (NTRS)

    Langenbacher, H.; Zee, F.; Daud, T.; Thakoor, A.

    1996-01-01

    A neural network experiment conducted for the Space Technology Research Vehicle (STRV-1) 1-b launched in June 1994. Identical sets of analog feed-forward neural network chips was used to study and compare the effects of space and ground radiation on the chips. Three failure mechanisms are noted.

  18. Social Networking on the Semantic Web

    ERIC Educational Resources Information Center

    Finin, Tim; Ding, Li; Zhou, Lina; Joshi, Anupam

    2005-01-01

    Purpose: Aims to investigate the way that the semantic web is being used to represent and process social network information. Design/methodology/approach: The Swoogle semantic web search engine was used to construct several large data sets of Resource Description Framework (RDF) documents with social network information that were encoded using the…

  19. Breast Cancer Detection with Reduced Feature Set.

    PubMed

    Mert, Ahmet; Kılıç, Niyazi; Bilgili, Erdem; Akan, Aydin

    2015-01-01

    This paper explores feature reduction properties of independent component analysis (ICA) on breast cancer decision support system. Wisconsin diagnostic breast cancer (WDBC) dataset is reduced to one-dimensional feature vector computing an independent component (IC). The original data with 30 features and reduced one feature (IC) are used to evaluate diagnostic accuracy of the classifiers such as k-nearest neighbor (k-NN), artificial neural network (ANN), radial basis function neural network (RBFNN), and support vector machine (SVM). The comparison of the proposed classification using the IC with original feature set is also tested on different validation (5/10-fold cross-validations) and partitioning (20%-40%) methods. These classifiers are evaluated how to effectively categorize tumors as benign and malignant in terms of specificity, sensitivity, accuracy, F-score, Youden's index, discriminant power, and the receiver operating characteristic (ROC) curve with its criterion values including area under curve (AUC) and 95% confidential interval (CI). This represents an improvement in diagnostic decision support system, while reducing computational complexity.

  20. Breast Cancer Detection with Reduced Feature Set

    PubMed Central

    Kılıç, Niyazi; Bilgili, Erdem

    2015-01-01

    This paper explores feature reduction properties of independent component analysis (ICA) on breast cancer decision support system. Wisconsin diagnostic breast cancer (WDBC) dataset is reduced to one-dimensional feature vector computing an independent component (IC). The original data with 30 features and reduced one feature (IC) are used to evaluate diagnostic accuracy of the classifiers such as k-nearest neighbor (k-NN), artificial neural network (ANN), radial basis function neural network (RBFNN), and support vector machine (SVM). The comparison of the proposed classification using the IC with original feature set is also tested on different validation (5/10-fold cross-validations) and partitioning (20%–40%) methods. These classifiers are evaluated how to effectively categorize tumors as benign and malignant in terms of specificity, sensitivity, accuracy, F-score, Youden's index, discriminant power, and the receiver operating characteristic (ROC) curve with its criterion values including area under curve (AUC) and 95% confidential interval (CI). This represents an improvement in diagnostic decision support system, while reducing computational complexity. PMID:26078774

  1. The neurobiology of syntax: beyond string sets.

    PubMed

    Petersson, Karl Magnus; Hagoort, Peter

    2012-07-19

    The human capacity to acquire language is an outstanding scientific challenge to understand. Somehow our language capacities arise from the way the human brain processes, develops and learns in interaction with its environment. To set the stage, we begin with a summary of what is known about the neural organization of language and what our artificial grammar learning (AGL) studies have revealed. We then review the Chomsky hierarchy in the context of the theory of computation and formal learning theory. Finally, we outline a neurobiological model of language acquisition and processing based on an adaptive, recurrent, spiking network architecture. This architecture implements an asynchronous, event-driven, parallel system for recursive processing. We conclude that the brain represents grammars (or more precisely, the parser/generator) in its connectivity, and its ability for syntax is based on neurobiological infrastructure for structured sequence processing. The acquisition of this ability is accounted for in an adaptive dynamical systems framework. Artificial language learning (ALL) paradigms might be used to study the acquisition process within such a framework, as well as the processing properties of the underlying neurobiological infrastructure. However, it is necessary to combine and constrain the interpretation of ALL results by theoretical models and empirical studies on natural language processing. Given that the faculty of language is captured by classical computational models to a significant extent, and that these can be embedded in dynamic network architectures, there is hope that significant progress can be made in understanding the neurobiology of the language faculty.

  2. Networking a mobile robot

    NASA Astrophysics Data System (ADS)

    McKee, Gerard T.

    1994-10-01

    Conventional mobile robotic systems are `stand alone'. Program development involves loading programs into the mobile, via an umbilical. Autonomous operation, in this context, means `isolation': the user cannot interact with the program as the robot is moving around. Recent research in `swarm robotics' has exploited wireless networks as a means of providing inter- robot communication, but the population is still isolated from the human user. In this paper we report on research we are conducting into the provision of mobile robots as resources on a local area computer network, and thus breaking the isolation barrier. We are making use of new multimedia workstation and wireless networking technology to link the robots to the network in order to provide a new type of resource for the user. We model the robot as a set of resources and propose a client-server architecture as the basis for providing user access to the robots. We describe the types of resources each robot can provide and we outline the potential for cooperative robotics, human-robot cooperation, and teleoperation and autonomous robot behavior within this context.

  3. BER Science Network Requirements

    SciTech Connect

    Alapaty, Kiran; Allen, Ben; Bell, Greg; Benton, David; Brettin, Tom; Canon, Shane; Dart, Eli; Cotter, Steve; Crivelli, Silvia; Carlson, Rich; Dattoria, Vince; Desai, Narayan; Egan, Richard; Tierney, Brian; Goodwin, Ken; Gregurick, Susan; Hicks, Susan; Johnston, Bill; de Jong, Bert; Kleese van Dam, Kerstin; Livny, Miron; Markowitz, Victor; McGraw, Jim; McCord, Raymond; Oehmen, Chris; Regimbal, Kevin; Shipman, Galen; Strand, Gary; Flick, Jeff; Turnbull, Susan; Williams, Dean; Zurawski, Jason

    2010-11-01

    The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In April 2010 ESnet and the Office of Biological and Environmental Research, of the DOE Office of Science, organized a workshop to characterize the networking requirements of the science programs funded by BER. The requirements identified at the workshop are summarized and described in more detail in the case studies and the Findings section. A number of common themes emerged from the case studies and workshop discussions. One is that BER science, like many other disciplines, is becoming more and more distributed and collaborative in nature. Another common theme is that data set sizes are exploding. Climate Science in particular is on the verge of needing to manage exabytes of data, and Genomics is on the verge of a huge paradigm shift in the number of sites with sequencers and the amount of sequencer data being generated.

  4. Evolving Sensitivity Balances Boolean Networks

    PubMed Central

    Luo, Jamie X.; Turner, Matthew S.

    2012-01-01

    We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We define the sensitivity of a BN to be the mean change in its Ergodic Set structure under all possible loss of interaction mutations. Insilico experiments were used to selectively evolve BNs for sensitivity to losing interactions. We find that maximum sensitivity was often achievable and resulted in the BNs becoming topologically balanced, i.e. they evolve towards network structures in which they have a similar number of inhibitory and excitatory interactions. In terms of the dynamics, the dominant sensitivity strategy that evolved was to build BNs with Ergodic Sets dominated by a single long limit cycle which is easily destabilised by mutations. We discuss the relevance of our findings in the context of Stem Cell Differentiation and propose a relationship between pluripotent stem cells and our evolved sensitive networks. PMID:22586459

  5. Bank supervision using the Threshold-Minimum Dominating Set

    NASA Astrophysics Data System (ADS)

    Gogas, Periklis; Papadimitriou, Theophilos; Matthaiou, Maria-Artemis

    2016-06-01

    An optimized, healthy and stable banking system resilient to financial crises is a prerequisite for sustainable growth. Minimization of (a) the associated systemic risk and (b) the propagation of contagion in the case of a banking crisis are necessary conditions to achieve this goal. Central Banks are in charge of this significant undertaking via a close and detailed monitoring of the banking network. In this paper, we propose the use of an auxiliary supervision/monitoring system that is both efficient with respect to the required resources and can promptly identify a set of banks that are in distress so that immediate and appropriate action can be taken by the supervising authority. We use the network defined by the interrelations between banking institutions employing tools from Complex Networks theory for an efficient management of the entire banking network. In doing so, we introduce the Threshold Minimum Dominating Set (T-MDS). The T-MDS is used to identify the smallest and most efficient subset of banks that can be used as (a) sensors of distress of a manifesting banking crisis and (b) provide a path of possible contagion. We propose the use of this method as a supplementary monitoring tool in the arsenal of a Central Bank. Our dataset includes the 122 largest American banks in terms of their interbank loans. The empirical results show that when the T-MDS methodology is applied, we can have an efficient supervision of the whole banking network, by monitoring just a subset of 47 banks.

  6. Gene Sets Net Correlations Analysis (GSNCA): a multivariate differential coexpression test for gene sets

    PubMed Central

    Rahmatallah, Yasir; Emmert-Streib, Frank; Glazko, Galina

    2014-01-01

    Motivation: To date, gene set analysis approaches primarily focus on identifying differentially expressed gene sets (pathways). Methods for identifying differentially coexpressed pathways also exist but are mostly based on aggregated pairwise correlations or other pairwise measures of coexpression. Instead, we propose Gene Sets Net Correlations Analysis (GSNCA), a multivariate differential coexpression test that accounts for the complete correlation structure between genes. Results: In GSNCA, weight factors are assigned to genes in proportion to the genes’ cross-correlations (intergene correlations). The problem of finding the weight vectors is formulated as an eigenvector problem with a unique solution. GSNCA tests the null hypothesis that for a gene set there is no difference in the weight vectors of the genes between two conditions. In simulation studies and the analyses of experimental data, we demonstrate that GSNCA captures changes in the structure of genes’ cross-correlations rather than differences in the averaged pairwise correlations. Thus, GSNCA infers differences in coexpression networks, however, bypassing method-dependent steps of network inference. As an additional result from GSNCA, we define hub genes as genes with the largest weights and show that these genes correspond frequently to major and specific pathway regulators, as well as to genes that are most affected by the biological difference between two conditions. In summary, GSNCA is a new approach for the analysis of differentially coexpressed pathways that also evaluates the importance of the genes in the pathways, thus providing unique information that may result in the generation of novel biological hypotheses. Availability and implementation: Implementation of the GSNCA test in R is available upon request from the authors. Contact: YRahmatallah@uams.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24292935

  7. Industrial entrepreneurial network: Structural and functional analysis

    NASA Astrophysics Data System (ADS)

    Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.

    2016-12-01

    Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.

  8. PowerSet: A Comprehensive Visualization of Set Intersections.

    PubMed

    Alsallakh, Bilal; Ren, Liu

    2017-01-01

    When analyzing a large amount of data, analysts often define groups over data elements that share certain properties. Using these groups as the unit of analysis not only reduces the data volume, but also allows detecting various patterns in the data. This involves analyzing intersection relations between these groups, and how the element attributes vary between these intersections. This kind of set-based analysis has various applications in a variety of domains, due to the generic and powerful notion of sets. However, visualizing intersections relations is challenging because their number grows exponentially with the number of sets. We present a novel technique based on Treemaps to provide a comprehensive overview of non-empty intersections in a set system in a scalable way. It enables gaining insight about how elements are distributed across these intersections as well as performing fine-grained analysis to explore and compare their attributes both in overview and in detail. Interaction allows querying and filtering these elements based on their set memberships. We demonstrate how our technique supports various use cases in data exploration and analysis by providing insights into set-based data, beyond the limits of state-of-the-art techniques.

  9. Network motif identification in stochastic networks

    NASA Astrophysics Data System (ADS)

    Jiang, Rui; Tu, Zhidong; Chen, Ting; Sun, Fengzhu

    2006-06-01

    Network motifs have been identified in a wide range of networks across many scientific disciplines and are suggested to be the basic building blocks of most complex networks. Nonetheless, many networks come with intrinsic and/or experimental uncertainties and should be treated as stochastic networks. The building blocks in these networks thus may also have stochastic properties. In this article, we study stochastic network motifs derived from families of mutually similar but not necessarily identical patterns of interconnections. We establish a finite mixture model for stochastic networks and develop an expectation-maximization algorithm for identifying stochastic network motifs. We apply this approach to the transcriptional regulatory networks of Escherichia coli and Saccharomyces cerevisiae, as well as the protein-protein interaction networks of seven species, and identify several stochastic network motifs that are consistent with current biological knowledge. expectation-maximization algorithm | mixture model | transcriptional regulatory network | protein-protein interaction network

  10. Effective Teacher Professionalization in Networks?

    ERIC Educational Resources Information Center

    Hofman, Roelande H.; Dijkstra, Bernadette J.

    2010-01-01

    Teacher professionalization has been focused too strongly on external experts and a one-size-fits-all set of solutions that often fail to distinguish between the needs of different teachers. This article describes a research into teacher networks that might be more successful vehicles for professional development of teachers. The results show that…

  11. Network Policy and Economic Doctrines

    ERIC Educational Resources Information Center

    Atkinson, Robert D.

    2010-01-01

    For many years, debates over telecommunications network policy were marked by a relative lack of partisan and ideological conflict. In the last decade, this has changed markedly. Today, debates over a whole set of issues, including broadband competition, net neutrality, copyright, privacy, and others, have become more contentious. These…

  12. Interacting neural networks

    NASA Astrophysics Data System (ADS)

    Metzler, R.; Kinzel, W.; Kanter, I.

    2000-08-01

    Several scenarios of interacting neural networks which are trained either in an identical or in a competitive way are solved analytically. In the case of identical training each perceptron receives the output of its neighbor. The symmetry of the stationary state as well as the sensitivity to the used training algorithm are investigated. Two competitive perceptrons trained on mutually exclusive learning aims and a perceptron which is trained on the opposite of its own output are examined analytically. An ensemble of competitive perceptrons is used as decision-making algorithms in a model of a closed market (El Farol Bar problem or the Minority Game. In this game, a set of agents who have to make a binary decision is considered.); each network is trained on the history of minority decisions. This ensemble of perceptrons relaxes to a stationary state whose performance can be better than random.

  13. Grammatical complexity of strange sets

    NASA Astrophysics Data System (ADS)

    Auerbach, Ditza; Procaccia, Itamar

    1990-06-01

    Chaotic dynamical systems can be organized around an underlying strange set, which is comprised of all the unstable periodic orbits. In this paper, we quantify the complexity of such an organization; this complexity addresses the difficulty of predicting the structure of the strange set from low-order data and is independent of the entropy and the algorithmic complexity. We refer to the new measure as the grammatical complexity. The notion is introduced, discussed, and illustrated in the context of simple dynamical systems. In addition, the grammatical complexity is generalized to include metric properties arising due to the nonuniform distribution of the invariant measure on the strange set.

  14. Wave Propagation in Isotropic Media with Two Orthogonal Fracture Sets

    NASA Astrophysics Data System (ADS)

    Shao, S.; Pyrak-Nolte, L. J.

    2016-10-01

    Orthogonal intersecting fracture sets form fracture networks that affect the hydraulic and mechanical integrity of a rock mass. Interpretation of elastic waves propagated through orthogonal fracture networks is complicated by guided modes that propagate along and between fractures, by multiple internal reflections, as well as by scattering from fracture intersections. The existence of some or all of these potentially overlapping modes depends on local stress fields that can preferentially close or open either one or both sets of fractures. In this study, an acoustic wave front imaging system was used to examine the effect of bi-axial loading conditions on acoustic wave propagation in isotropic media containing two orthogonal fracture sets. From the experimental data, orthogonal intersecting fracture sets support guided waves that depend on fracture spacing and fracture-specific stiffnesses. In addition, fracture intersections have stronger effects on propagating wave fronts than merely the superposition of the effects of two independent fractures because of energy partitioning among transmitted/reflected waves, scattered waves and guided modes. Interpretation of the properties of fractures or fracture sets from seismic measurements must consider non-uniform fracture stiffnesses within and among fracture sets, as well as considering the striking effects of fracture intersections on wave propagation.

  15. Metabolic Networks

    NASA Astrophysics Data System (ADS)

    Palumbo, Maria Concetta; Farina, Lorenzo; Colosimo, Alfredo; Giuliani, Alessandro

    The use of the term `network' is more and more widespread in all fields of biology. It evokes a systemic approach to biological problems able to overcome the evident limitations of the strict reductionism of the past twenty years. The expectations produced by taking into considerations not only the single elements but even the intermingled `web' of links connecting different parts of biological entities, are huge. Nevertheless, we believe that the lack of consciousness that networks, beside their biological `likelihood', are modeling tools and not real entities, could be detrimental to the exploitation of the full potential of this paradigm. Like any modeling tool the network paradigm has a range of application going from situations in which it is particularly fit to situations in which its application can be largely misleading. In this chapter we deal with an aspect of biological entities that is particularly fit for the network approach: the intermediate metabolism. This fit derives both from the existence of a privileged formalization in which the relative role of nodes (metabolites) and arches (enzymes) is immediately suggested by the system architecture. Here we will discuss some applications of both graph theory based analysis and multidimensional statistics method to metabolic network studies with the emphasis on the derivation of biologically meaningful information.

  16. Availability Issues in Wireless Visual Sensor Networks

    PubMed Central

    Costa, Daniel G.; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

    2014-01-01

    Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

  17. Evolutionary Phylogenetic Networks: Models and Issues

    NASA Astrophysics Data System (ADS)

    Nakhleh, Luay

    Phylogenetic networks are special graphs that generalize phylogenetic trees to allow for modeling of non-treelike evolutionary histories. The ability to sequence multiple genetic markers from a set of organisms and the conflicting evolutionary signals that these markers provide in many cases, have propelled research and interest in phylogenetic networks to the forefront in computational phylogenetics. Nonetheless, the term 'phylogenetic network' has been generically used to refer to a class of models whose core shared property is tree generalization. Several excellent surveys of the different flavors of phylogenetic networks and methods for their reconstruction have been written recently. However, unlike these surveys, this chapte focuses specifically on one type of phylogenetic networks, namely evolutionary phylogenetic networks, which explicitly model reticulate evolutionary events. Further, this chapter focuses less on surveying existing tools, and addresses in more detail issues that are central to the accurate reconstruction of phylogenetic networks.

  18. Online Community Detection for Large Complex Networks

    PubMed Central

    Pan, Gang; Zhang, Wangsheng; Wu, Zhaohui; Li, Shijian

    2014-01-01

    Complex networks describe a wide range of systems in nature and society. To understand complex networks, it is crucial to investigate their community structure. In this paper, we develop an online community detection algorithm with linear time complexity for large complex networks. Our algorithm processes a network edge by edge in the order that the network is fed to the algorithm. If a new edge is added, it just updates the existing community structure in constant time, and does not need to re-compute the whole network. Therefore, it can efficiently process large networks in real time. Our algorithm optimizes expected modularity instead of modularity at each step to avoid poor performance. The experiments are carried out using 11 public data sets, and are measured by two criteria, modularity and NMI (Normalized Mutual Information). The results show that our algorithm's running time is less than the commonly used Louvain algorithm while it gives competitive performance. PMID:25061683

  19. Structural factoring approach for analyzing stochastic networks

    NASA Technical Reports Server (NTRS)

    Hayhurst, Kelly J.; Shier, Douglas R.

    1991-01-01

    The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

  20. Queuing theory models for computer networks

    NASA Technical Reports Server (NTRS)

    Galant, David C.

    1989-01-01

    A set of simple queuing theory models which can model the average response of a network of computers to a given traffic load has been implemented using a spreadsheet. The impact of variations in traffic patterns and intensities, channel capacities, and message protocols can be assessed using them because of the lack of fine detail in the network traffic rates, traffic patterns, and the hardware used to implement the networks. A sample use of the models applied to a realistic problem is included in appendix A. Appendix B provides a glossary of terms used in this paper. This Ames Research Center computer communication network is an evolving network of local area networks (LANs) connected via gateways and high-speed backbone communication channels. Intelligent planning of expansion and improvement requires understanding the behavior of the individual LANs as well as the collection of networks as a whole.

  1. Quantifying evolvability in small biological networks

    SciTech Connect

    Nemenman, Ilya; Mugler, Andrew; Ziv, Etay; Wiggins, Chris H

    2008-01-01

    The authors introduce a quantitative measure of the capacity of a small biological network to evolve. The measure is applied to a stochastic description of the experimental setup of Guet et al. (Science 2002, 296, pp. 1466), treating chemical inducers as functional inputs to biochemical networks and the expression of a reporter gene as the functional output. The authors take an information-theoretic approach, allowing the system to set parameters that optimise signal processing ability, thus enumerating each network's highest-fidelity functions. All networks studied are highly evolvable by the measure, meaning that change in function has little dependence on change in parameters. Moreover, each network's functions are connected by paths in the parameter space along which information is not significantly lowered, meaning a network may continuously change its functionality without completely losing it along the way. This property further underscores the evolvability of the networks.

  2. Biomarker Reference Sets for Cancers in Women — EDRN Public Portal

    Cancer.gov

    The purpose of this study is to develop a standard reference set of specimens for use by investigators participating in the National Cancer Institutes Early Detection Research Network (EDRN) in defining false positive rates for new cancer biomarkers in women.

  3. Network meta-analysis, electrical networks and graph theory.

    PubMed

    Rücker, Gerta

    2012-12-01

    Network meta-analysis is an active field of research in clinical biostatistics. It aims to combine information from all randomized comparisons among a set of treatments for a given medical condition. We show how graph-theoretical methods can be applied to network meta-analysis. A meta-analytic graph consists of vertices (treatments) and edges (randomized comparisons). We illustrate the correspondence between meta-analytic networks and electrical networks, where variance corresponds to resistance, treatment effects to voltage, and weighted treatment effects to current flows. Based thereon, we then show that graph-theoretical methods that have been routinely applied to electrical networks also work well in network meta-analysis. In more detail, the resulting consistent treatment effects induced in the edges can be estimated via the Moore-Penrose pseudoinverse of the Laplacian matrix. Moreover, the variances of the treatment effects are estimated in analogy to electrical effective resistances. It is shown that this method, being computationally simple, leads to the usual fixed effect model estimate when applied to pairwise meta-analysis and is consistent with published results when applied to network meta-analysis examples from the literature. Moreover, problems of heterogeneity and inconsistency, random effects modeling and including multi-armed trials are addressed. Copyright © 2012 John Wiley & Sons, Ltd.

  4. FIRE II - Cirrus Data Sets

    Atmospheric Science Data Center

    2013-07-26

    FIRE II - Cirrus Data Sets First ISCCP Regional Experiment (FIRE) II Cirrus was conducted in southeastern Kansas. It was designed to improve the ... stratocumulus systems, the radiative properties of these clouds and their interactions. Relevant Documents:  FIRE ...

  5. Comprehensive, Multi-Source Cyber-Security Events Data Set

    DOE Data Explorer

    Kent, Alexander D. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2015-05-21

    This data set represents 58 consecutive days of de-identified event data collected from five sources within Los Alamos National Laboratory’s corporate, internal computer network. The data sources include Windows-based authentication events from both individual computers and centralized Active Directory domain controller servers; process start and stop events from individual Windows computers; Domain Name Service (DNS) lookups as collected on internal DNS servers; network flow data as collected on at several key router locations; and a set of well-defined red teaming events that present bad behavior within the 58 days. In total, the data set is approximately 12 gigabytes compressed across the five data elements and presents 1,648,275,307 events in total for 12,425 users, 17,684 computers, and 62,974 processes. Specific users that are well known system related (SYSTEM, Local Service) were not de-identified though any well-known administrators account were still de-identified. In the network flow data, well-known ports (e.g. 80, 443, etc) were not de-identified. All other users, computers, process, ports, times, and other details were de-identified as a unified set across all the data elements (e.g. U1 is the same U1 in all of the data). The specific timeframe used is not disclosed for security purposes. In addition, no data that allows association outside of LANL’s network is included. All data starts with a time epoch of 1 using a time resolution of 1 second. In the authentication data, failed authentication events are only included for users that had a successful authentication event somewhere within the data set.

  6. An adaptive level set method

    SciTech Connect

    Milne, Roger Brent

    1995-12-01

    This thesis describes a new method for the numerical solution of partial differential equations of the parabolic type on an adaptively refined mesh in two or more spatial dimensions. The method is motivated and developed in the context of the level set formulation for the curvature dependent propagation of surfaces in three dimensions. In that setting, it realizes the multiple advantages of decreased computational effort, localized accuracy enhancement, and compatibility with problems containing a range of length scales.

  7. Setting and Supporting the Theater

    DTIC Science & Technology

    2015-11-01

    The Army Operating Concept, Win in a Complex World, asserts that in order to win in this environment, Army forces must be able to “set the theater...of extended lines of commu- nication in austere environments.” Setting the theater is a continuous shaping activity and is the responsi- bility of the...geographic combatant command. As a result of the world becoming increasingly complex, U.S. forces must be able to establish the conditions in

  8. Privacy Amplification with Social Networks

    NASA Astrophysics Data System (ADS)

    Nagaraja, Shishir

    There are a number of scenarios where users wishing to communicate, share a weak secret. Often, they are also part of a common social network. Connections (edges) from the social network are represented as shared link keys between participants (vertices). We propose mechanisms that utilise the graph topology of such a network, to increase the entropy of weak pre-shared secrets. Our proposal is based on using random walks to identify a chain of common acquaintances between Alice and Bob, each of which contribute entropy to the final key. Our mechanisms exploit one-wayness and convergence properties of Markovian random walks to, firstly, maximize the set of potential entropy contributors, and second, to resist any contribution from dubious sources such as Sybill sub-networks.

  9. Social network sampling using spanning trees

    NASA Astrophysics Data System (ADS)

    Jalali, Zeinab S.; Rezvanian, Alireza; Meybodi, Mohammad Reza

    2016-12-01

    Due to the large scales and limitations in accessing most online social networks, it is hard or infeasible to directly access them in a reasonable amount of time for studying and analysis. Hence, network sampling has emerged as a suitable technique to study and analyze real networks. The main goal of sampling online social networks is constructing a small scale sampled network which preserves the most important properties of the original network. In this paper, we propose two sampling algorithms for sampling online social networks using spanning trees. The first proposed sampling algorithm finds several spanning trees from randomly chosen starting nodes; then the edges in these spanning trees are ranked according to the number of times that each edge has appeared in the set of found spanning trees in the given network. The sampled network is then constructed as a sub-graph of the original network which contains a fraction of nodes that are incident on highly ranked edges. In order to avoid traversing the entire network, the second sampling algorithm is proposed using partial spanning trees. The second sampling algorithm is similar to the first algorithm except that it uses partial spanning trees. Several experiments are conducted to examine the performance of the proposed sampling algorithms on well-known real networks. The obtained results in comparison with other popular sampling methods demonstrate the efficiency of the proposed sampling algorithms in terms of Kolmogorov-Smirnov distance (KSD), skew divergence distance (SDD) and normalized distance (ND).

  10. System Administrator for LCS Development Sets

    NASA Technical Reports Server (NTRS)

    Garcia, Aaron

    2013-01-01

    The Spaceport Command and Control System Project is creating a Checkout and Control System that will eventually launch the next generation of vehicles from Kennedy Space Center. KSC has a large set of Development and Operational equipment already deployed in several facilities, including the Launch Control Center, which requires support. The position of System Administrator will complete tasks across multiple platforms (Linux/Windows), many of them virtual. The Hardware Branch of the Control and Data Systems Division at the Kennedy Space Center uses system administrators for a variety of tasks. The position of system administrator comes with many responsibilities which include maintaining computer systems, repair or set up hardware, install software, create backups and recover drive images are a sample of jobs which one must complete. Other duties may include working with clients in person or over the phone and resolving their computer system needs. Training is a major part of learning how an organization functions and operates. Taking that into consideration, NASA is no exception. Training on how to better protect the NASA computer infrastructure will be a topic to learn, followed by NASA work polices. Attending meetings and discussing progress will be expected. A system administrator will have an account with root access. Root access gives a user full access to a computer system and or network. System admins can remove critical system files and recover files using a tape backup. Problem solving will be an important skill to develop in order to complete the many tasks.

  11. Equity, sustainability and governance in urban settings.

    PubMed

    Rice, Marilyn; Hancock, Trevor

    2016-03-01

    In this commentary the urban setting is explored from the perspective of ecological sustainability and social equity. Urban-related issues are highlighted related to social inequality, deficits in urban infrastructures, behavior-related illnesses and risks, global ecological changes, and urban sprawl. Approaches to addressing these issues are described from the perspective of urban governance, urban planning and design, social determinants of health, health promotion, and personal and community empowerment. Examples of successful strategies are provided from Latin America, including using participatory instruments (assessments, evaluation, participatory budgeting, etc.), establishing intersectoral committees, increasing participation of civil society organizations, and developing virtual forums and networks to channel participatory and collaborative processes. A way forward is proposed, using the urban setting to show the imperative of creating intersectoral policies and programs that produce environments that are both healthy and sustainable. It will be important to include new forms of social participation and use social media to facilitate citizen decision-making and active participation of all sectors of society, especially excluded groups.

  12. New value added to network services through software-defined optical core networking

    NASA Astrophysics Data System (ADS)

    Yamada, Akiko; Nakatsugawa, Keiichi; Yamashita, Shinji; Soumiya, Toshio

    2016-02-01

    If an optical core network can be handled flexibly, it can be used not only as network infrastructure but also as a temporary broadband resource when customers have to transfer a large volume of data quickly, which will in turn lead to new WAN services. We propose "software-defined optical core networking", which achieves flexible optical network control, meaning it virtualizes optical transport network/wavelength-division multiplexing resources and controls them with resources from other layers, such as Ether/MPLS. We developed a testbed system and verified that users could request broadband resources easily, and our controller could quickly set up an optical channel data unit path for the request.

  13. An inability to set independent attentional control settings by hemifield.

    PubMed

    Becker, Mark W; Ravizza, Susan M; Peltier, Chad

    2015-11-01

    Recent evidence suggests that people can simultaneously activate attentional control setting for two distinct colors. However, it is unclear whether both attentional control settings must operate globally across the visual field or whether each can be constrained to a particular spatial location. Using two different paradigms, we investigated participants' ability to apply independent color attentional control settings to distinct regions of space. In both experiments, participants were told to identify red letters in one hemifield and green letters in the opposite hemifield. Additionally, some trials used a "relevant distractor"-a letter that matched the opposite side's target color. In Experiment 1, eight letters appeared (four per hemifield) simultaneously for a brief amount of time and then were masked. Relevant distractors increased the error rate and resulted in a greater number of distractor intrusions than irrelevant distractors. Similar results were observed in Experiment 2 in which red and green targets were presented in two rapid serial visual presentation streams. Relevant distractors were found to produce an attentional blink similar in magnitude to an actual target. The results of both experiments suggest that letters matching either attentional control setting were selected by attention and were processed as if they were targets, providing strong evidence that both attentional control settings were applied globally, rather than being constrained to a particular location.

  14. Ada Run Time Support Environments and a common APSE Interface Set. [Ada Programming Support Environment

    NASA Technical Reports Server (NTRS)

    Mckay, C. W.; Bown, R. L.

    1985-01-01

    The paper discusses the importance of linking Ada Run Time Support Environments to the Common Ada Programming Support Environment (APSE) Interface Set (CAIS). A non-stop network operating systems scenario is presented to serve as a forum for identifying the important issues. The network operating system exemplifies the issues involved in the NASA Space Station data management system.

  15. Rapid Network Design

    DTIC Science & Technology

    2013-09-01

    packet- switched networks are extremely prone to human design faults, which can adversely affect the reliability of the network. This thesis proposes an...network devices and create a functioning packet- switch network. network design , network topology, packet- switching networks, routing protocols, data... switched networks are extremely prone to human design faults, which can adversely affect the reliability of the network. This thesis proposes an

  16. Collaborative networks: helping rural laboratories achieve quality.

    PubMed

    Hassell, Lewis A; Fogler, Martha W; Russell, Sonia E

    2006-01-01

    Rural hospital laboratories can combine some of their significant advantages with the benefits of an egalitarian, collaborative network to create a setting in which the disadvantages of their size (such as limited skill sets and resources) may be more readily overcome. Participation in a knowledge-sharing network, a coordinated effort at reference-range establishment and validation, and development of quality and safety algorithms help them avoid many potentially costly problems. This article describes the experience of developing such a network over a 30-year period and illustrates the benefits of this practice.

  17. Bootstrap percolation on spatial networks

    NASA Astrophysics Data System (ADS)

    Gao, Jian; Zhou, Tao; Hu, Yanqing

    2015-10-01

    Bootstrap percolation is a general representation of some networked activation process, which has found applications in explaining many important social phenomena, such as the propagation of information. Inspired by some recent findings on spatial structure of online social networks, here we study bootstrap percolation on undirected spatial networks, with the probability density function of long-range links’ lengths being a power law with tunable exponent. Setting the size of the giant active component as the order parameter, we find a parameter-dependent critical value for the power-law exponent, above which there is a double phase transition, mixed of a second-order phase transition and a hybrid phase transition with two varying critical points, otherwise there is only a second-order phase transition. We further find a parameter-independent critical value around -1, about which the two critical points for the double phase transition are almost constant. To our surprise, this critical value -1 is just equal or very close to the values of many real online social networks, including LiveJournal, HP Labs email network, Belgian mobile phone network, etc. This work helps us in better understanding the self-organization of spatial structure of online social networks, in terms of the effective function for information spreading.

  18. Aging and functional brain networks

    SciTech Connect

    Tomasi D.; Tomasi, D.; Volkow, N.D.

    2011-07-11

    Aging is associated with changes in human brain anatomy and function and cognitive decline. Recent studies suggest the aging decline of major functional connectivity hubs in the 'default-mode' network (DMN). Aging effects on other networks, however, are largely unknown. We hypothesized that aging would be associated with a decline of short- and long-range functional connectivity density (FCD) hubs in the DMN. To test this hypothesis, we evaluated resting-state data sets corresponding to 913 healthy subjects from a public magnetic resonance imaging database using functional connectivity density mapping (FCDM), a voxelwise and data-driven approach, together with parallel computing. Aging was associated with pronounced long-range FCD decreases in DMN and dorsal attention network (DAN) and with increases in somatosensory and subcortical networks. Aging effects in these networks were stronger for long-range than for short-range FCD and were also detected at the level of the main functional hubs. Females had higher short- and long-range FCD in DMN and lower FCD in the somatosensory network than males, but the gender by age interaction effects were not significant for any of the networks or hubs. These findings suggest that long-range connections may be more vulnerable to aging effects than short-range connections and that, in addition to the DMN, the DAN is also sensitive to aging effects, which could underlie the deterioration of attention processes that occurs with aging.

  19. Bootstrap percolation on spatial networks

    PubMed Central

    Gao, Jian; Zhou, Tao; Hu, Yanqing

    2015-01-01

    Bootstrap percolation is a general representation of some networked activation process, which has found applications in explaining many important social phenomena, such as the propagation of information. Inspired by some recent findings on spatial structure of online social networks, here we study bootstrap percolation on undirected spatial networks, with the probability density function of long-range links’ lengths being a power law with tunable exponent. Setting the size of the giant active component as the order parameter, we find a parameter-dependent critical value for the power-law exponent, above which there is a double phase transition, mixed of a second-order phase transition and a hybrid phase transition with two varying critical points, otherwise there is only a second-order phase transition. We further find a parameter-independent critical value around −1, about which the two critical points for the double phase transition are almost constant. To our surprise, this critical value −1 is just equal or very close to the values of many real online social networks, including LiveJournal, HP Labs email network, Belgian mobile phone network, etc. This work helps us in better understanding the self-organization of spatial structure of online social networks, in terms of the effective function for information spreading. PMID:26423347

  20. Networked Automatic Optical Telescopes

    NASA Astrophysics Data System (ADS)

    Mattox, J. R.

    2000-05-01

    Many groups around the world are developing automated or robotic optical observatories. The coordinated operation of automated optical telescopes at diverse sites could provide observing prospects which are not otherwise available, e.g., continuous optical photometry without diurnal interruption. Computer control and scheduling also offers the prospect of effective response to transient events such as γ -ray bursts. These telescopes could also serve science education by providing high-quality CCD data for educators and students. The Automatic Telescope Network (ATN) project has been undertaken to promote networking of automated telescopes. A web site is maintained at http://gamma.bu.edu/atn/. The development of such networks will be facilitated by the existence of standards. A set of standard commands for instrument and telescope control systems will allow for the creation of software for an ``observatory control system'' which can be used at any facility which complies with the TCS and ICS standards. Also, there is a strong need for standards for the specification of observations to be done, and reports on the results and status of observations. A proposed standard for this is the Remote Telescope Markup Language (RTML), which is expected to be described in another poster in this session. It may thus be feasible for amateur-astronomers to soon buy all necessary equipment and software to field an automatic telescope. The owner/operator could make otherwise unused telescope time available to the network in exchange for the utilization of other telescopes in the network --- including occasional utilization of meter-class telescopes with research-grade CCD detectors at good sites.

  1. A Measure for the Cohesion of Weighted Networks.

    ERIC Educational Resources Information Center

    Egghe, Leo; Rousseau, Ronald

    2003-01-01

    Discusses graph theory in information science, focusing on measures for the cohesion of networks. Illustrates how a set of weights between connected nodes can be transformed into a set of dissimilarity measures and presents an example of the new compactness measures for a cocitation and a bibliographic coupling network. (Author/LRW)

  2. Network Physiology: Mapping Interactions Between Networks of Physiologic Networks

    NASA Astrophysics Data System (ADS)

    Ivanov, Plamen Ch.; Bartsch, Ronny P.

    The human organism is an integrated network of interconnected and interacting organ systems, each representing a separate regulatory network. The behavior of one physiological system (network) may affect the dynamics of all other systems in the network of physiologic networks. Due to these interactions, failure of one system can trigger a cascade of failures throughout the entire network. We introduce a systematic method to identify a network of interactions between diverse physiologic organ systems, to quantify the hierarchical structure and dynamics of this network, and to track its evolution under different physiologic states. We find a robust relation between network structure and physiologic states: every state is characterized by specific network topology, node connectivity and links strength. Further, we find that transitions from one physiologic state to another trigger a markedly fast reorganization in the network of physiologic interactions on time scales of just a few minutes, indicating high network flexibility in response to perturbations. This reorganization in network topology occurs simultaneously and globally in the entire network as well as at the level of individual physiological systems, while preserving a hierarchical order in the strength of network links. Our findings highlight the need of an integrated network approach to understand physiologic function, since the framework we develop provides new information which can not be obtained by studying individual systems. The proposed system-wide integrative approach may facilitate the development of a new field, Network Physiology.

  3. Complete Basis Set Model Chemistries

    NASA Astrophysics Data System (ADS)

    Ochterski, Joseph Wallace

    1994-01-01

    The major source of error in most ab initio calculations of molecular energies is the truncation of the one-electron basis set. Extrapolation to the complete basis set second -order (CBS2) limit using the N^{-1 } asymptotic convergence of N-configuration pair natural orbital (PNO) expansions can be combined with the use of relatively small basis sets for the higher-order correlation energy to develop cost effective computational models. Following this strategy, four new computational models denoted CBS-4, CBS-q, CBS-Q, and CBS-QCI/APNO are introduced. The mean absolute deviations (MAD) from experiment for the 125 energies of the G2 test set are 2.0, 1.7, 1.0 and 0.5 kcal/mol, respectively. The error distributions for all six models are indistinguishable from Gaussian distribution functions. Calculations on the cyclopropenyl radical and cyclopropenylidene provide new dissociation energies which are in accord with an interpretation of the thermochemistry emphasizing aromaticity. Several levels of theory are examined as candidates for the routine calculation of molecular geometries. The very simple UHF/3-21G* model gives bond lengths to an accuracy of +/-0.027 A compared with experiment for a test set of 69 small molecules. The commonly used MP2/6-31G* model (RMS error 0.025 A) offers virtually no improvement and use of the considerably more expensive QCISD calculations with the same basis set provides only a modest reduction to 0.020 A. However, spin projected MP3 calculations with a modified basis set including f -functions on Si, P, S, and Cl, reduce the RMS error to 0.010 A. This PMP3/6-31Gdf* model is recommended as a general scheme of geometry optimization for small molecules. The equilibrium structure and binding energy of the water dimer have been determined for several levels of ab initio theory. The basis set convergence of the SCF energy, the intramolecular and intermolecular MP2 energy, and higher-order effects, are examined separately and realistic error

  4. Gradient networks

    NASA Astrophysics Data System (ADS)

    Toroczkai, Zoltán; Kozma, Balázs; Bassler, Kevin E.; Hengartner, N. W.; Korniss, G.

    2008-04-01

    Gradient networks are defined (Toroczkai and Bassler 2004 Nature 428 716) as directed graphs formed by local gradients of a scalar field distributed on the nodes of a substrate network G. We present the derivation for some of the general properties of gradient graphs and give an exact expression for the in-degree distribution R(l) of the gradient network when the substrate is a binomial (Erd{\\;\\kern -0.10em \\raise -0.35ex \\{{^{^{\\prime\\prime}}}}\\kern -0.57em \\o} s-Rényi) random graph, G_{N,p} , and the scalars are independent identically distributed (i.i.d.) random variables. We show that in the limit N \\to \\infty, p \\to 0, z = pN = \\mbox{const} \\gg 1, R(l)\\propto l^{-1} for l < l_c = z , i.e., gradient networks become scale-free graphs up to a cut-off degree. This paper presents the detailed derivation of the results announced in Toroczkai and Bassler (2004 Nature 428 716).

  5. Network Views

    ERIC Educational Resources Information Center

    Alexander, Louis

    2010-01-01

    The world changed in 2008. The financial crisis brought with it a deepening sense of insecurity, and the desire to be connected to a network increased. Throughout the summer and fall of 2008, events were unfolding with alarming rapidity. The Massachusetts Institute of Technology (MIT) Alumni Association wanted to respond to this change in the…

  6. Resistive Networks.

    ERIC Educational Resources Information Center

    Balabanian, Norman

    This programed text on resistive networks was developed under contract with the United States Office of Education as part of a series of materials for use in an electrical engineering sequence. It is to be used in conjunction with other materials and with other short texts in the series, this one being Number 3. (DH)

  7. Beyond Networking.

    ERIC Educational Resources Information Center

    Carmel, Michael

    1981-01-01

    Discusses the new relationships between libraries and their users with reference to the worldwide medical information networks which have developed through the influence of the U.S. National Library of Medicine. Consideration is given to the new roles librarians will have to assume. (Author/LLS)

  8. Knowledge Networks

    ERIC Educational Resources Information Center

    McLeod, Scott

    2008-01-01

    The blogosphere and the Internet are both examples of complex, self-organizing networks. So too is the world of academic publishing. Some faculty members are prolific article and book writers. Their publications often are hubs, or even superhubs, in the scholarly literature, cited regularly by others. Some scholars might just be nodes, with…

  9. Global Networking.

    ERIC Educational Resources Information Center

    Lynch, Clifford

    1997-01-01

    Discusses the state of the Internet. Highlights include the magnitude of the infrastructure, costs, its increasing pace, constraints in international links, provision of network capacity to homes and small businesses, cable television modems, political and cultural problems, the digital library concept, search engines, the failure of personal…

  10. CFD Data Sets on the WWW for Education and Testing

    NASA Technical Reports Server (NTRS)

    Globus, Al; Lasinski, T. A. (Technical Monitor)

    1995-01-01

    The Numerical Aerodynamic Simulation (NAS) Systems Division at NASA Ames Research Center has begun the development of a Computational Fluid Dynamics (CFD) data set archive on the World Wide Web (WWW) at URL http://www.nas.nasa.gov/NAS/DataSets/. Data sets are integrated with related information such as research papers, metadata, visualizations, etc. In this paper, four classes of users are identified and discussed: students, visualization developers, CFD practitioners, and management. Bandwidth and security issues are briefly reviewed and the status of the archive as of May 1995 is examined. Routine network distribution of data sets is likely to have profound implications for the conduct of science. The exact nature of these changes is subject to speculation, but the ability for anyone to examine the data, in addition to the investigator's analysis, may well play an important role in the future.

  11. Neural network based system for equipment surveillance

    DOEpatents

    Vilim, R.B.; Gross, K.C.; Wegerich, S.W.

    1998-04-28

    A method and system are disclosed for performing surveillance of transient signals of an industrial device to ascertain the operating state. The method and system involves the steps of reading into a memory training data, determining neural network weighting values until achieving target outputs close to the neural network output. If the target outputs are inadequate, wavelet parameters are determined to yield neural network outputs close to the desired set of target outputs and then providing signals characteristic of an industrial process and comparing the neural network output to the industrial process signals to evaluate the operating state of the industrial process. 33 figs.

  12. Neural network based system for equipment surveillance

    DOEpatents

    Vilim, Richard B.; Gross, Kenneth C.; Wegerich, Stephan W.

    1998-01-01

    A method and system for performing surveillance of transient signals of an industrial device to ascertain the operating state. The method and system involves the steps of reading into a memory training data, determining neural network weighting values until achieving target outputs close to the neural network output. If the target outputs are inadequate, wavelet parameters are determined to yield neural network outputs close to the desired set of target outputs and then providing signals characteristic of an industrial process and comparing the neural network output to the industrial process signals to evaluate the operating state of the industrial process.

  13. Realizing actual feedback control of complex network

    NASA Astrophysics Data System (ADS)

    Tu, Chengyi; Cheng, Yuhua

    2014-06-01

    In this paper, we present the concept of feedbackability and how to identify the Minimum Feedbackability Set of an arbitrary complex directed network. Furthermore, we design an estimator and a feedback controller accessing one MFS to realize actual feedback control, i.e. control the system to our desired state according to the estimated system internal state from the output of estimator. Last but not least, we perform numerical simulations of a small linear time-invariant dynamics network and a real simple food network to verify the theoretical results. The framework presented here could make an arbitrary complex directed network realize actual feedback control and deepen our understanding of complex systems.

  14. Intelligent virtual reality in the setting of fuzzy sets

    NASA Technical Reports Server (NTRS)

    Dockery, John; Littman, David

    1992-01-01

    The authors have previously introduced the concept of virtual reality worlds governed by artificial intelligence. Creation of an intelligent virtual reality was further proposed as a universal interface for the handicapped. This paper extends consideration of intelligent virtual realty to a context in which fuzzy set principles are explored as a major tool for implementing theory in the domain of applications to the disabled.

  15. Assessment of protein set coherence using functional annotations

    PubMed Central

    Chagoyen, Monica; Carazo, Jose M; Pascual-Montano, Alberto

    2008-01-01

    Background Analysis of large-scale experimental datasets frequently produces one or more sets of proteins that are subsequently mined for functional interpretation and validation. To this end, a number of computational methods have been devised that rely on the analysis of functional annotations. Although current methods provide valuable information (e.g. significantly enriched annotations, pairwise functional similarities), they do not specifically measure the degree of homogeneity of a protein set. Results In this work we present a method that scores the degree of functional homogeneity, or coherence, of a set of proteins on the basis of the global similarity of their functional annotations. The method uses statistical hypothesis testing to assess the significance of the set in the context of the functional space of a reference set. As such, it can be used as a first step in the validation of sets expected to be homogeneous prior to further functional interpretation. Conclusion We evaluate our method by analysing known biologically relevant sets as well as random ones. The known relevant sets comprise macromolecular complexes, cellular components and pathways described for Saccharomyces cerevisiae, which are mostly significantly coherent. Finally, we illustrate the usefulness of our approach for validating 'functional modules' obtained from computational analysis of protein-protein interaction networks. Matlab code and supplementary data are available at PMID:18937846

  16. Social Networking Services in E-Learning

    ERIC Educational Resources Information Center

    Weber, Peter; Rothe, Hannes

    2016-01-01

    This paper is a report on the findings of a study conducted on the use of the social networking service NING in a cross-location e-learning setting named "Net Economy." We describe how we implemented NING as a fundamental part of the setting through a special phase concept and team building approach. With the help of user statistics, we…

  17. Social Networking Services in E-Learning

    ERIC Educational Resources Information Center

    Weber, Peter; Rothe, Hannes

    2012-01-01

    This paper is a report on the findings of a study conducted on the use of the social networking service NING in a cross-location e-learning setting named "Net Economy." We describe how we implemented NING as a fundamental part of the setting through a special phase concept and team building approach. With the help of user statistics, we examine…

  18. ASCR Science Network Requirements

    SciTech Connect

    Dart, Eli; Tierney, Brian

    2009-08-24

    The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In April 2009 ESnet and the Office of Advanced Scientific Computing Research (ASCR), of the DOE Office of Science, organized a workshop to characterize the networking requirements of the programs funded by ASCR. The ASCR facilities anticipate significant increases in wide area bandwidth utilization, driven largely by the increased capabilities of computational resources and the wide scope of collaboration that is a hallmark of modern science. Many scientists move data sets between facilities for analysis, and in some cases (for example the Earth System Grid and the Open Science Grid), data distribution is an essential component of the use of ASCR facilities by scientists. Due to the projected growth in wide area data transfer needs, the ASCR supercomputer centers all expect to deploy and use 100 Gigabit per second networking technology for wide area connectivity as soon as that deployment is financially feasible. In addition to the network connectivity that ESnet provides, the ESnet Collaboration Services (ECS) are critical to several science communities. ESnet identity and trust services, such as the DOEGrids certificate authority, are widely used both by the supercomputer centers and by collaborations such as Open Science Grid (OSG) and the Earth System Grid (ESG). Ease of use is a key determinant of the scientific utility of network-based services. Therefore, a key enabling aspect for scientists beneficial use of high

  19. Whether information network supplements friendship network

    NASA Astrophysics Data System (ADS)

    Miao, Lili; Zhang, Qian-Ming; Nie, Da-Cheng; Cai, Shi-Min

    2015-02-01

    Homophily is a significant mechanism for link prediction in complex network, of which principle describes that people with similar profiles or experiences tend to tie with each other. In a multi-relationship network, friendship among people has been utilized to reinforce similarity of taste for recommendation system whose basic idea is similar to homophily, yet how the taste inversely affects friendship prediction is little discussed. This paper contributes to address the issue by analyzing two benchmark data sets both including user's behavioral information of taste and friendship based on the principle of homophily. It can be found that the creation of friendship tightly associates with personal taste. Especially, the behavioral information of taste involving with popular objects is much more effective to improve the performance of friendship prediction. However, this result seems to be contradictory to the finding in Zhang et al. (2013) that the behavior information of taste involving with popular objects is redundant in recommendation system. We thus discuss this inconformity to comprehensively understand the correlation between them.

  20. Cosmic setting for chondrule formation

    NASA Technical Reports Server (NTRS)

    Taylor, G. J.; Scott, E. R. D.; Keil, K.

    1983-01-01

    Chondrules are igneous-textured, millimeter-sized, spherical to irregularly-shaped silicate objects which constitute the major component of most chondrites. There is agreement that chondrules were once molten. Models for chondrule origin can be divided into two categories. One involves a 'planetary' setting, which envisages chondrules forming on the surfaces of parent bodies. Melting mechanisms include impact and volcanism. The other category is concerned with a cosmic setting in the solar nebula, prior to nebula formation. Aspects regarding the impact on planetary surfaces are considered, taking into account chondrule abundances, the abundancy of agglutinates on the moon, comminution, hypervelocity impact pits, questions of age, and chondrule compositions. Attention is also given to collisions during accretion, collisions between molten planetesimals, volcanism, and virtues of a nebular setting.

  1. Small sets of complementary observables

    NASA Astrophysics Data System (ADS)

    Grassl, M.; McNulty, D.; Mišta, L.; Paterek, T.

    2017-01-01

    Two observables are called complementary if preparing a physical object in an eigenstate of one of them yields a completely random result in a measurement of the other. We investigate small sets of complementary observables that cannot be extended by yet another complementary observable. We construct explicit examples of unextendible sets up to dimension 16 and conjecture certain small sets to be unextendible in higher dimensions. Our constructions provide three complementary measurements, only one observable away from the ultimate minimum of two. Almost all our examples in finite dimensions are useful for discriminating pure states from some mixed states, and they help to shed light on the complex topology of the Bloch space of higher-dimensional quantum systems.

  2. Segmenting data sets for RIP.

    PubMed

    de Sanctis, Daniele; Nanao, Max H

    2012-09-01

    Specific radiation damage can be used for the phasing of macromolecular crystal structures. In practice, however, the optimization of the X-ray dose used to `burn' the crystal to induce specific damage can be difficult. Here, a method is presented in which a single large data set that has not been optimized in any way for radiation-damage-induced phasing (RIP) is segmented into multiple sub-data sets, which can then be used for RIP. The efficacy of this method is demonstrated using two model systems and two test systems. A method to improve the success of this type of phasing experiment by varying the composition of the two sub-data sets with respect to their separation by image number, and hence by absorbed dose, as well as their individual completeness is illustrated.

  3. System and method for generating a relationship network

    DOEpatents

    Franks, Kasian; Myers, Cornelia A.; Podowski, Raf M.

    2011-07-26

    A computer-implemented system and process for generating a relationship network is disclosed. The system provides a set of data items to be related and generates variable length data vectors to represent the relationships between the terms within each data item. The system can be used to generate a relationship network for documents, images, or any other type of file. This relationship network can then be queried to discover the relationships between terms within the set of data items.

  4. System and method for generating a relationship network

    DOEpatents

    Franks, Kasian; Myers, Cornelia A; Podowski, Raf M

    2015-05-05

    A computer-implemented system and process for generating a relationship network is disclosed. The system provides a set of data items to be related and generates variable length data vectors to represent the relationships between the terms within each data item. The system can be used to generate a relationship network for documents, images, or any other type of file. This relationship network can then be queried to discover the relationships between terms within the set of data items.

  5. Accurate multiple network alignment through context-sensitive random walk

    PubMed Central

    2015-01-01

    Background Comparative network analysis can provide an effective means of analyzing large-scale biological networks and gaining novel insights into their structure and organization. Global network alignment aims to predict the best overall mapping between a given set of biological networks, thereby identifying important similarities as well as differences among the networks. It has been shown that network alignment methods can be used to detect pathways or network modules that are conserved across different networks. Until now, a number of network alignment algorithms have been proposed based on different formulations and approaches, many of them focusing on pairwise alignment. Results In this work, we propose a novel multiple network alignment algorithm based on a context-sensitive random walk model. The random walker employed in the proposed algorithm switches between two different modes, namely, an individual walk on a single network and a simultaneous walk on two networks. The switching decision is made in a context-sensitive manner by examining the current neighborhood, which is effective for quantitatively estimating the degree of correspondence between nodes that belong to different networks, in a manner that sensibly integrates node similarity and topological similarity. The resulting node correspondence scores are then used to predict the maximum expected accuracy (MEA) alignment of the given networks. Conclusions Performance evaluation based on synthetic networks as well as real protein-protein interaction networks shows that the proposed algorithm can construct more accurate multiple network alignments compared to other leading methods. PMID:25707987

  6. Fast Setting Cement - Literature Survey

    DTIC Science & Technology

    1973-01-01

    materials does produce early set times and high strengths . It is re- ported, also, that the addition of 1.5 percent Ca"l 2 to clinkers contain- Ing more than...produce high strength concrete. They include addition of iron asggregate, physical treatment of clinker , ’ addition of highly reactive SiO2 or Ca0, and...Fast-Fix. The Western Co. has developed materials designated as Fast-Fix with rapid setting and high strength properties. Published data show i .1

  7. Telepsychiatry in juvenile justice settings.

    PubMed

    Kaliebe, Kristopher E; Heneghan, James; Kim, Thomas J

    2011-01-01

    Telepsychiatry is emerging as a valuable means of providing mental health care in juvenile justice settings. Youth in the juvenile justice system have high levels of psychiatric morbidity. State and local juvenile justice systems frequently struggle to provide specialized psychiatric care, as these systems have limited resources and often operate in remote locations. Case studies in the use of telepsychiatry to provide improved care in juvenile corrections in 4 states are described, along with a review of advantages and disadvantages of telepsychiatry in these settings.

  8. Physical controllability of complex networks

    NASA Astrophysics Data System (ADS)

    Wang, Le-Zhi; Chen, Yu-Zhong; Wang, Wen-Xu; Lai, Ying-Cheng

    2017-01-01

    A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

  9. FRIPON, the French fireball network

    NASA Astrophysics Data System (ADS)

    Colas, F.; Zanda, B.; Bouley, S.; Vaubaillon, J.; Marmo, C.; Audureau, Y.; Kwon, M. K.; Rault, J. L.; Caminade, S.; Vernazza, P.; Gattacceca, J.; Birlan, M.; Maquet, L.; Egal, A.; Rotaru, M.; Gruson-Daniel, Y.; Birnbaum, C.; Cochard, F.; Thizy, O.

    2015-10-01

    FRIPON (Fireball Recovery and InterPlanetary Observation Network) [4](Colas et al, 2014) was recently founded by ANR (Agence Nationale de la Recherche). Its aim is to connect meteoritical science with asteroidal and cometary science in order to better understand solar system formation and evolution. The main idea is to set up an observation network covering all the French territory to collect a large number of meteorites (one or two per year) with accurate orbits, allowing us to pinpoint possible parent bodies. 100 all-sky cameras will be installed at the end of 2015 forming a dense network with an average distance of 100km between stations. To maximize the accuracy of orbit determination, we will mix our optical data with radar data from the GRAVES beacon received by 25 stations [5](Rault et al, 2015). As both the setting up of the network and the creation of search teams for meteorites will need manpower beyond our small team of professionals, we are developing a citizen science network called Vigie-Ciel [6](Zanda et al, 2015). The public at large will thus be able to simply use our data, participate in search campaigns or even setup their own cameras.

  10. Physical controllability of complex networks

    PubMed Central

    Wang, Le-Zhi; Chen, Yu-Zhong; Wang, Wen-Xu; Lai, Ying-Cheng

    2017-01-01

    A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control. PMID:28074900

  11. Comparison of tree-child phylogenetic networks.

    PubMed

    Cardona, Gabriel; Rosselló, Francesc; Valiente, Gabriel

    2009-01-01

    Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of nontreelike evolutionary events, like recombination, hybridization, or lateral gene transfer. While much progress has been made to find practical algorithms for reconstructing a phylogenetic network from a set of sequences, all attempts to endorse a class of phylogenetic networks (strictly extending the class of phylogenetic trees) with a well-founded distance measure have, to the best of our knowledge and with the only exception of the bipartition distance on regular networks, failed so far. In this paper, we present and study a new meaningful class of phylogenetic networks, called tree-child phylogenetic networks, and we provide an injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors. We then use this representation to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class. Simple polynomial algorithms for reconstructing a tree-child phylogenetic network from its path multiplicity vectors, for computing the distance between two tree-child phylogenetic networks and for aligning a pair of tree-child phylogenetic networks, are provided. They have been implemented as a Perl package and a Java applet, which can be found at http://bioinfo.uib.es/~recerca/phylonetworks/mudistance/.

  12. Dynamics of and on complex networks

    NASA Astrophysics Data System (ADS)

    Halu, Arda

    Complex networks are dynamic, evolving structures that can host a great number of dynamical processes. In this thesis, we address current challenges regarding the dynamics of and dynamical processes on complex networks. First, we study complex network dynamics from the standpoint of network growth. As a quantitative measure of the complexity and information content of networks generated by growing network models, we define and evaluate their entropy rate. We propose stochastic growth models inspired by the duplication-divergence mechanism to generate epistatic interaction networks and find that they exhibit the property of monochromaticity as a result of their dynamical evolution. Second, we explore the dynamics of quantum mechanical processes on complex networks. We investigate the Bose-Hubbard model on annealed and quenched scale-free networks as well as Apollonian networks and show that their phase diagram changes significantly in the presence of complex topologies, depending on the second degree of the degree distribution and the maximal eigenvalue of the adjacency matrix. We then study the Jaynes-Cummings-Hubbard model on various complex topologies and demonstrate the importance of the maximal eigenvalue of the hopping matrix in determining the phase diagram of the model. Third, we investigate dynamical processes on interacting and multiplex networks. We study opinion dynamics in a simulated setting of two antagonistically interacting networks and recover the importance of connectivity and committed agents. We propose a multiplex centrality measure that takes into account the connectivity patterns within and across different layers and find that the dynamics of biased random walks on multiplex networks gives rise to a centrality ranking that is different from univariate centrality measures. Finally, we study the statistical mechanics of multilayered spatial networks and demonstrate the emergence of significant link overlap and improved navigability in

  13. Distributed Semantic Overlay Networks

    NASA Astrophysics Data System (ADS)

    Doulkeridis, Christos; Vlachou, Akrivi; Nørvåg, Kjetil; Vazirgiannis, Michalis

    Semantic Overlay Networks (SONs) have been recently proposed as a way to organize content in peer-to-peer (P2P) networks. The main objective is to discover peers with similar content and then form thematically focused peer groups. Efficient content retrieval can be performed by having queries selectively forwarded only to relevant groups of peers to the query. As a result, less peers need to be contacted, in order to answer a query. In this context, the challenge is to generate SONs in a decentralized and distributed manner, as the centralized assembly of global information is not feasible. Different approaches for exploiting the generated SONs for content retrieval have been proposed in the literature, which are examined in this chapter, with a particular focus on SON interconnections for efficient search. Several applications, such as P2P document and image retrieval, can be deployed over generated SONs, motivating the need for distributed and truly scalable SON creation. Therefore, recently several research papers focus on SONs as stated in our comprehensive overview of related work in the field of semantic overlay networks. A classification of existing algorithms according to a set of qualitative criteria is also provided. In spite of the rich existing work in the field of SONs, several challenges have not been efficiently addressed yet, therefore, future promising research directions are pointed out and discussed at the end of this chapter.

  14. Insecurity of Wireless Networks

    SciTech Connect

    Sheldon, Frederick T; Weber, John Mark; Yoo, Seong-Moo; Pan, W. David

    2012-01-01

    Wireless is a powerful core technology enabling our global digital infrastructure. Wi-Fi networks are susceptible to attacks on Wired Equivalency Privacy, Wi-Fi Protected Access (WPA), and WPA2. These attack signatures can be profiled into a system that defends against such attacks on the basis of their inherent characteristics. Wi-Fi is the standard protocol for wireless networks used extensively in US critical infrastructures. Since the Wired Equivalency Privacy (WEP) security protocol was broken, the Wi-Fi Protected Access (WPA) protocol has been considered the secure alternative compatible with hardware developed for WEP. However, in November 2008, researchers developed an attack on WPA, allowing forgery of Address Resolution Protocol (ARP) packets. Subsequent enhancements have enabled ARP poisoning, cryptosystem denial of service, and man-in-the-middle attacks. Open source systems and methods (OSSM) have long been used to secure networks against such attacks. This article reviews OSSMs and the results of experimental attacks on WPA. These experiments re-created current attacks in a laboratory setting, recording both wired and wireless traffic. The article discusses methods of intrusion detection and prevention in the context of cyber physical protection of critical Internet infrastructure. The basis for this research is a specialized (and undoubtedly incomplete) taxonomy of Wi-Fi attacks and their adaptations to existing countermeasures and protocol revisions. Ultimately, this article aims to provide a clearer picture of how and why wireless protection protocols and encryption must achieve a more scientific basis for detecting and preventing such attacks.

  15. [The Pasteur network].

    PubMed

    Durosoir, J L

    1995-01-14

    Inspired by Louis Pasteur, the international network of Pasteur Institutes forms an original body of research institutes whose vitality has grown steadily since Albert Calmette first created the Saigon Institute in 1891. The dynamic development of the 23 Pasteur Institutes currently implanted throughout the world was made possible by three driving forces. First of all, Pasteur's own teaching--"Advance only what you can prove experimentally"--the founding principle of modern research. Secondly, the international missions headed by leading collaborators including Thuillier who worked on cholera in Egypt, Loir who initiated antirabies research in Australia and Russia, Calmette in Saigon, and others in Rio de Janeiro, Dalat, Tunis and Alger. And finally Pasteur's own personal renown. Today the Pasteur Institutes fill a vital need in their respective countries developing and producing vaccines locally, serving often as the only competent medical laboratory in developing countries and helping improve standards of hygiene adapted to local situations. Fundamental research has always been at the heart of Pasteur Institutes, coupled with essential training for technicians and researchers alike. Despite political incertitudes and turmoil, the international network of Pasteur Institutes has held its place as the leader in scientific progress for over a century, setting the place for modern international research. The Cantacuzene Institute in Bucarest and the Pasteur Institute in Saint-Petersburg which joined the network in 1991 and 1993 are the most recent examples of the fundamental principle of exchange and cooperation so important for further development.

  16. Setting an Endowment Spending Rate.

    ERIC Educational Resources Information Center

    Morrell, Louis R.

    1995-01-01

    Trustees can set endowment spending policies to meet current spending needs and protect the future by understanding, forecasting, and managing potential risks and returns. Spending policy should be based on a combination of economic conditions and capital market characteristics related to the institution's investment portfolio. (Author/MSE)

  17. Level Set Strategy for SCFT

    NASA Astrophysics Data System (ADS)

    Ouaknin, Gaddiel

    This thesis investigates the design of sharp in terface level set methods in the context of self-consistent field theory (SCFT) in polymer physics. SCFT computes the structure and energy of inhomogeneous self-assembling polymers at thermodynamic equilibrium. Level set methods are based on an implicit representation of free boundaries, which enable motions with arbitrary change in topology. In addition, recent advances on how to impose Robin boundary conditions enables the study of free boundary problems of interest in the community interested in self-assembly. We first present a computational framework, encoded on a forest of quad/oct-trees in a parallel environment. We then present results of imposing sharp Neumann boundary conditions as was first proposed by de Gennes, which enables SCFT computations of meaningful quantities at the boundary of irregular geometries. We then introduce the concept of functional level-set derivative in the context of SCFT and rigorously derive expressions for the change of energy of a diblock copolymer with respect to an enclosing shape. The level-set derivative is then used to embed SCFT into a variable shape simulator, where the internal structure and the enclosing shape are coupled together and evolve in tandem in order to reduce the energy of the diblock copolymer. Finally an algorithm for solving the inverse problem for directed self-assembly is presented.

  18. Goal Setting to Achieve Results

    ERIC Educational Resources Information Center

    Newman, Rich

    2012-01-01

    Both districts and individual schools have a very clear set of goals and skills for their students to achieve and master. In fact, except in rare cases, districts and schools develop very detailed goals they wish to pursue. In most cases, unfortunately, only the teachers and staff at a particular school or district-level office are aware of the…

  19. Multiple Kernel Point Set Registration.

    PubMed

    Nguyen, Thanh Minh; Wu, Q M Jonathan

    2015-12-22

    The finite Gaussian mixture model with kernel correlation is a flexible tool that has recently received attention for point set registration. While there are many algorithms for point set registration presented in the literature, an important issue arising from these studies concerns the mapping of data with nonlinear relationships and the ability to select a suitable kernel. Kernel selection is crucial for effective point set registration. We focus here on multiple kernel point set registration. We make several contributions in this paper. First, each observation is modeled using the Student's t-distribution, which is heavily tailed and more robust than the Gaussian distribution. Second, by automatically adjusting the kernel weights, the proposed method allows us to prune the ineffective kernels. This makes the choice of kernels less crucial. After parameter learning, the kernel saliencies of the irrelevant kernels go to zero. Thus, the choice of kernels is less crucial and it is easy to include other kinds of kernels. Finally, we show empirically that our model outperforms state-of-the-art methods recently proposed in the literature.

  20. Multiple Kernel Point Set Registration.

    PubMed

    Nguyen, Thanh Minh; Wu, Q M Jonathan

    2016-06-01

    The finite Gaussian mixture model with kernel correlation is a flexible tool that has recently received attention for point set registration. While there are many algorithms for point set registration presented in the literature, an important issue arising from these studies concerns the mapping of data with nonlinear relationships and the ability to select a suitable kernel. Kernel selection is crucial for effective point set registration. We focus here on multiple kernel point set registration. We make several contributions in this paper. First, each observation is modeled using the Student's t-distribution, which is heavily tailed and more robust than the Gaussian distribution. Second, by automatically adjusting the kernel weights, the proposed method allows us to prune the ineffective kernels. This makes the choice of kernels less crucial. After parameter learning, the kernel saliencies of the irrelevant kernels go to zero. Thus, the choice of kernels is less crucial and it is easy to include other kinds of kernels. Finally, we show empirically that our model outperforms state-of-the-art methods recently proposed in the literature.

  1. Setting Time Limits on Tests

    ERIC Educational Resources Information Center

    van der Linden, Wim J.

    2011-01-01

    It is shown how the time limit on a test can be set to control the probability of a test taker running out of time before completing it. The probability is derived from the item parameters in the lognormal model for response times. Examples of curves representing the probability of running out of time on a test with given parameters as a function…

  2. Bullying in Early Educational Settings

    ERIC Educational Resources Information Center

    Kirves, Laura; Sajaniemi, Nina

    2012-01-01

    The aim of this research was to study the prevalence of bullying in early educational settings in Finnish kindergartens. In addition, the study investigated whether bullying in kindergartens differs from school bullying and what forms bullying takes among under-school-age children. Two kinds of data were collected for the study: data from a survey…

  3. Feedback Seeking in Training Settings.

    ERIC Educational Resources Information Center

    Kuchinke, K. Peter

    The role of feedback in training settings was examined in a survey-based study of feedback in nine 5-day management development training courses in a United Kingdom government agency. The courses followed a highly standardized curriculum and delivery process. Although the courses were primarily instructor-and theory-centered, they also included…

  4. Promoting Literacy in Multilingual Settings

    ERIC Educational Resources Information Center

    Kosonen, Kimmo; Young, Catherine; Malone, Susan

    2006-01-01

    This compilation of resource papers and findings is from a regional workshop on mother-tongue/bilingual literacy programmes for ethnic and linguistic minorities in multilingual settings. It was organized by Asia-Pacific Programme of Education for All (APPEAL), United Nations Educational and Cultural Organization (UNESCO) Bangkok, 6-10 December…

  5. Behavior Management in Afterschool Settings

    ERIC Educational Resources Information Center

    Mahoney, Joseph L.

    2014-01-01

    Although behavioral management is one of the most challenging aspects of working in an afterschool setting, staff do not typically receive formal training in evidence-based approaches to handling children's behavior problems. Common approaches to behavioral management such as punishment or time-out are temporary solutions because they do not…

  6. Teaching Quality across School Settings

    ERIC Educational Resources Information Center

    Cohen, Julie; Brown, Michelle

    2016-01-01

    Districts are increasingly making personnel decisions based on teachers' impact on student-achievement gains and classroom observations. In some schools, however, a teacher's practices and their students' achievement may reflect not just individual but collaborative efforts. In other settings, teachers' instruction benefits less from the insights…

  7. Communicable Diseases in Childhood Settings.

    ERIC Educational Resources Information Center

    Networks, 1994

    1994-01-01

    This newsletter addresses managing the spread of communicable diseases in childhood settings as well as educational program concerns for children who are HIV infected. Noting that communicable diseases are a source of concern no matter how minor they might appear, the newsletter suggests that it is important for individuals who work with the…

  8. Conversational Competence in Academic Settings

    ERIC Educational Resources Information Center

    Bowman, Richard F.

    2014-01-01

    Conversational competence is a process, not a state. Ithaca does not exist, only the voyage to Ithaca. Vibrant campuses are a series of productive conversations. At its core, communicative competence in academic settings mirrors a collective search for meaning regarding the purpose and direction of a campus community. Communicative competence…

  9. Teaching Leadership in Nontraditional Settings.

    ERIC Educational Resources Information Center

    Oechsle, Lois H.; Volden, Cecilia M.

    1984-01-01

    Discusses clinical placement for a leadership/management course at the University of North Dakota College of Nursing. The program used nontraditional settings such as the YMCA, nursing homes, rehabilitation hospitals, and senior citizens' centers as alternate sites for nursing practice and work. (JOW)

  10. Informal Learning in Experiential Settings.

    ERIC Educational Resources Information Center

    Neathery, Madelyn Faye

    1998-01-01

    Assesses informal learning in experiential settings. Elementary teachers (n=20) from public and private schools participated in an on-site seminar involving experiential learning in science centers, a wildlife refuge, and a zoological sanctuary. The significance of instruction provided by guides, types of exhibits, and the use of informational…

  11. Qualitative networks: a symbolic approach to analyze biological signaling networks

    PubMed Central

    Schaub, Marc A; Henzinger, Thomas A; Fisher, Jasmin

    2007-01-01

    Background A central goal of Systems Biology is to model and analyze biological signaling pathways that interact with one another to form complex networks. Here we introduce Qualitative networks, an extension of Boolean networks. With this framework, we use formal verification methods to check whether a model is consistent with the laboratory experimental observations on which it is based. If the model does not conform to the data, we suggest a revised model and the new hypotheses are tested in-silico. Results We consider networks in which elements range over a small finite domain allowing more flexibility than Boolean values, and add target functions that allow to model a rich set of behaviors. We propose a symbolic algorithm for analyzing the steady state of these networks, allowing us to scale up to a system consisting of 144 elements and state spaces of approximately 1086 states. We illustrate the usefulness of this approach through a model of the interaction between the Notch and the Wnt signaling pathways in mammalian skin, and its extensive analysis. Conclusion We introduce an approach for constructing computational models of biological systems that extends the framework of Boolean networks and uses formal verification methods for the analysis of the model. This approach can scale to multicellular models of complex pathways, and is therefore a useful tool for the analysis of complex biological systems. The hypotheses formulated during in-silico testing suggest new avenues to explore experimentally. Hence, this approach has the potential to efficiently complement experimental studies in biology. PMID:17408511

  12. The Sun Sets on Mars

    NASA Technical Reports Server (NTRS)

    2004-01-01

    On Sol 20 of its journey, Mars Exploration Rover Opportunity woke up around 5:30 in the martian afternoon to watch the sunset. A series of five sets of three-color images from the rover's panoramic camera was acquired looking toward the southwest. Each set used an infrared, green and violet filter, rather than the human red-green-blue, so that the maximum panoramic camera wavelength range could be covered by the observations, enhancing the scientific value of the measurements.

    A color image was made from the first post-sunset sequence of calibrated color images, with the color balance set to approximate what the sunset color would have looked like to the human eye. The color seen in this first post-sunset image was then used to colorize each image in the sequence. Approximately one-minute gaps between consecutive color images meant the Sun's position changed within each color set, so the images had to be manually shifted to compensate for this motion. In this fashion, the position and brightness of the Sun are taken from each individual image, but the color is taken from a single set of images. The images were then combined into a movie where one color set fades gracefully into the next. Analysis of the five color sets shows that there were only small color variations during the sunset, so most of the real variations are captured in the movie.

    The rapid dimming of the Sun near the horizon is due to the dust in the sky. There is nearly twice as much dust as there was when the Mars Pathfinder spacecraft, which landed on Mars in 1997, imaged the sunset. This causes the Sun to be many times fainter. The sky above the Sun has the same blue tint observed by Pathfinder and also by Viking, which landed on Mars in 1976. This is because dust in the martian atmosphere scatters blue light forward toward the observer much more efficiently than it scatters red light forward. Therefore, a 'halo' of blueish sky color is always observed close to the Sun. We're only seeing

  13. Ecosystem flow networks: loaded dice?

    PubMed

    Ulanowicz, R E; Wolff, W F

    1991-02-01

    An information-theoretic comparison of the topologies of observed ecosystem transfers and randomly constructed networks reveals that it is not easy to separate the members of the two sets. The distribution of ecosystem flow magnitudes, however, is seen to differ markedly from ordinary probability functions and to resemble the Cauchy or Pareto distributions. The agencies that impart such structure to ecological flow networks are not obvious, but one strong possibility is that autocatalysis, or indirect mutualism, promotes certain pathways at the expense of others, thereby enlarging the tail of the distribution of flow magnitudes.

  14. Estimation of global network statistics from incomplete data.

    PubMed

    Bliss, Catherine A; Danforth, Christopher M; Dodds, Peter Sheridan

    2014-01-01

    Complex networks underlie an enormous variety of social, biological, physical, and virtual systems. A profound complication for the science of complex networks is that in most cases, observing all nodes and all network interactions is impossible. Previous work addressing the impacts of partial network data is surprisingly limited, focuses primarily on missing nodes, and suggests that network statistics derived from subsampled data are not suitable estimators for the same network statistics describing the overall network topology. We generate scaling methods to predict true network statistics, including the degree distribution, from only partial knowledge of nodes, links, or weights. Our methods are transparent and do not assume a known generating process for the network, thus enabling prediction of network statistics for a wide variety of applications. We validate analytical results on four simulated network classes and empirical data sets of various sizes. We perform subsampling experiments by varying proportions of sampled data and demonstrate that our scaling methods can provide very good estimates of true network statistics while acknowledging limits. Lastly, we apply our techniques to a set of rich and evolving large-scale social networks, Twitter reply networks. Based on 100 million tweets, we use our scaling techniques to propose a statistical characterization of the Twitter Interactome from September 2008 to November 2008. Our treatment allows us to find support for Dunbar's hypothesis in detecting an upper threshold for the number of active social contacts that individuals maintain over the course of one week.

  15. Modeling the Citation Network by Network Cosmology

    PubMed Central

    Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

    2015-01-01

    Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well. PMID:25807397

  16. Modeling the citation network by network cosmology.

    PubMed

    Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

    2015-01-01

    Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.

  17. Implementing controlled-unitary operations over the butterfly network

    SciTech Connect

    Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S.; Murao, Mio

    2014-12-04

    We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

  18. Interworking evolution of mobile satellite and terrestrial networks

    NASA Technical Reports Server (NTRS)

    Matyas, R.; Kelleher, P.; Moller, P.; Jones, T.

    1993-01-01

    There is considerable interest among mobile satellite service providers in interworking with terrestrial networks to provide a universal global network. With such interworking, subscribers may be provided a common set of services such as those planned for the Public Switched Telephone Network (PSTN), the Integrated Services Digital Network (ISDN), and future Intelligent Networks (IN's). This paper first reviews issues in satellite interworking. Next the status and interworking plans of terrestrial mobile communications service providers are examined with early examples of mobile satellite interworking including a discussion of the anticipated evolution towards full interworking between mobile satellite and both fixed and mobile terrestrial networks.

  19. Neural Networks

    NASA Astrophysics Data System (ADS)

    Schwindling, Jerome

    2010-04-01

    This course presents an overview of the concepts of the neural networks and their aplication in the framework of High energy physics analyses. After a brief introduction on the concept of neural networks, the concept is explained in the frame of neuro-biology, introducing the concept of multi-layer perceptron, learning and their use as data classifer. The concept is then presented in a second part using in more details the mathematical approach focussing on typical use cases faced in particle physics. Finally, the last part presents the best way to use such statistical tools in view of event classifers, putting the emphasis on the setup of the multi-layer perceptron. The full article (15 p.) corresponding to this lecture is written in french and is provided in the proceedings of the book SOS 2008.

  20. Network gravity

    NASA Astrophysics Data System (ADS)

    Lombard, John

    2017-01-01

    We introduce the construction of a new framework for probing discrete emergent geometry and boundary-boundary observables based on a fundamentally a-dimensional underlying network structure. Using a gravitationally motivated action with Forman weighted combinatorial curvatures and simplicial volumes relying on a decomposition of an abstract simplicial complex into realized embeddings of proper skeletons, we demonstrate properties such as a minimal volume-scale cutoff, the necessity of a term playing the role of a positive definite cosmological constant as a regulator for nondegenerate geometries, and naturally emergent simplicial structures from Metropolis network evolution simulations with no restrictions on attachment rules or regular building blocks. We see emergent properties which echo results from both the spinfoam formalism and causal dynamical triangulations in quantum gravity, and provide analytical and numerical results to support the analogy. We conclude with a summary of open questions and intent for future work in developing the program.

  1. NASA Network

    NASA Technical Reports Server (NTRS)

    Carter, David; Wetzel, Scott

    2000-01-01

    The NASA Network includes nine NASA operated and partner operated stations covering North America, the west coast of South America, the Pacific, and Western Australia . A new station is presently being setup in South Africa and discussions are underway to add another station in Argentina. NASA SLR operations are supported by Honeywell Technical Solutions, Inc (HTSI), formally AlliedSignal Technical Services, The University of Texas, the University of Hawaii and Universidad Nacional de San Agustin.

  2. Zone routing in a torus network

    DOEpatents

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  3. Super-speed computer interfaces and networks

    SciTech Connect

    Tolmie, D.E.; St. John, W.; DuBois, D.H.

    1997-10-01

    This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Research into super-speed computer interfaces has been directed towards identifying networking requirements from compute-intensive applications that are crucial to DOE programs. In particular, both the DOE Energy Research High Performance Computing Research Centers (HPCRC) and the DOE Defense Programs Accelerated Strategic Computing Initiative (ASCI) have planned applications that will require large increases in network bandwidth. This project was set up to help network researchers identify those networking requirements and to plan the development of such networks. Based on studies, research, and LANL-sponsored workshops, this project helped forge the beginnings for multi-gigabit/sec network research and developments that today is being lead by Los Alamos in the American National Standards Institute (ANSI) 6.4 gigabit/sec specification called HIPPI-6400.

  4. Controlling contagion processes in activity driven networks.

    PubMed

    Liu, Suyu; Perra, Nicola; Karsai, Márton; Vespignani, Alessandro

    2014-03-21

    The vast majority of strategies aimed at controlling contagion processes on networks consider the connectivity pattern of the system either quenched or annealed. However, in the real world, many networks are highly dynamical and evolve, in time, concurrently with the contagion process. Here, we derive an analytical framework for the study of control strategies specifically devised for a class of time-varying networks, namely activity-driven networks. We develop a block variable mean-field approach that allows the derivation of the equations describing the coevolution of the contagion process and the network dynamic. We derive the critical immunization threshold and assess the effectiveness of three different control strategies. Finally, we validate the theoretical picture by simulating numerically the spreading process and control strategies in both synthetic networks and a large-scale, real-world, mobile telephone call data set.

  5. Physics, stability, and dynamics of supply networks

    NASA Astrophysics Data System (ADS)

    Helbing, Dirk; Lämmer, Stefan; Seidel, Thomas; Šeba, Pétr; Płatkowski, Tadeusz

    2004-12-01

    We show how to treat supply networks as physical transport problems governed by balance equations and equations for the adaptation of production speeds. Although the nonlinear behavior is different, the linearized set of coupled differential equations is formally related to those of mechanical or electrical oscillator networks. Supply networks possess interesting features due to their complex topology and directed links. We derive analytical conditions for absolute and convective instabilities. The empirically observed “bullwhip effect” in supply chains is explained as a form of convective instability based on resonance effects. Moreover, it is generalized to arbitrary supply networks. Their related eigenvalues are usually complex, depending on the network structure (even without loops). Therefore, their generic behavior is characterized by damped or growing oscillations. We also show that regular distribution networks possess two negative eigenvalues only, but perturbations generate a spectrum of complex eigenvalues.

  6. NASA Ocean Altimeter Pathfinder Project. Report 2; Data Set Validation

    NASA Technical Reports Server (NTRS)

    Koblinsky, C. J.; Ray, Richard D.; Beckley, Brian D.; Bremmer, Anita; Tsaoussi, Lucia S.; Wang, Yan-Ming

    1999-01-01

    The NOAA/NASA Pathfinder program was created by the Earth Observing System (EOS) Program Office to determine how existing satellite-based data sets can be processed and used to study global change. The data sets are designed to be long time-series data processed with stable calibration and community consensus algorithms to better assist the research community. The Ocean Altimeter Pathfinder Project involves the reprocessing of all altimeter observations with a consistent set of improved algorithms, based on the results from TOPEX/POSEIDON (T/P), into easy-to-use data sets for the oceanographic community for climate research. Details are currently presented in two technical reports: Report# 1: Data Processing Handbook Report #2: Data Set Validation This report describes the validation of the data sets against a global network of high quality tide gauge measurements and provides an estimate of the error budget. The first report describes the processing schemes used to produce the geodetic consistent data set comprised of SEASAT, GEOSAT, ERS-1, TOPEX/ POSEIDON, and ERS-2 satellite observations.

  7. A unified lunar control network

    NASA Technical Reports Server (NTRS)

    Davies, Merton E.; Colvin, Tim R.; Meyer, Donald L.

    1987-01-01

    Mapping network control on the Moon is composed of a number of independent regional networks. These networks frequently have different origins but never have common ties, even in overlapping areas. The objective of the unified network program is to tie the regional networks into a single consistent planetwide control network. The plan is to start with the best defined regions, create common ties with neighboring data sets, and then expand into poorly defined regions. The most accurately defined points on the Moon are locations of the laser ranging retroreflectors and the VLBI measurements of the locations of the Apollo 15, 16, 17 ALSEP stations. Recent values for the coordinates of the retroreflectors have been received. The accuracy of these locations is about 30 m and their locations are used to define the center-of-mass and, hence, the origin of the unified lunar coordinate system. The coordinates of the retroreflectors are given in both principal axis and mean Earth/Polar axis systems. Mean Earth/Polar axis coordinates have been recommended by the IAU for the Moon. The difference in the coordinates is important, more than 600 m in latitude and longitude.

  8. Bond Percolation on Multiplex Networks

    NASA Astrophysics Data System (ADS)

    Hackett, A.; Cellai, D.; Gómez, S.; Arenas, A.; Gleeson, J. P.

    2016-04-01

    We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate the relevance of these tools to the modeling of multilayer robustness and contribute to the debate on whether any benefit is to be yielded from studying a full multiplex structure as opposed to its monoplex projection, especially in the seemingly irrelevant case of a bond occupation probability that does not depend on the layer. Although we find that in many cases the predictions of our theory for multiplex networks coincide with previously derived results for monoplex networks, we also uncover the remarkable result that for a certain class of multiplex networks, well described by our theory, new critical phenomena occur as multiple percolation phase transitions are present. We provide an instance of this phenomenon in a multiplex network constructed from London rail and European air transportation data sets.

  9. Network device interface for digitally interfacing data channels to a controller via a network

    NASA Technical Reports Server (NTRS)

    Ellerbrock, Philip J. (Inventor); Grant, Robert L. (Inventor); Konz, Daniel W. (Inventor); Winkelmann, Joseph P. (Inventor)

    2005-01-01

    The present invention provides a network device interface and method for digitally connecting a plurality of data channels, such as sensors, actuators, and subsystems, to a controller using a network bus. The network device interface interprets commands and data received from the controller and polls the data channels in accordance with these commands. Specifically, the network device interface receives digital commands and data from the controller, and based on these commands and data, communicates with the data channels to either retrieve data in the case of a sensor or send data to activate an actuator. Data retrieved from the sensor is then converted by the network device interface into digital signals and transmitted back to the controller. In one advantageous embodiment, the network device interface uses a specialized protocol for communicating across the network bus that uses a low-level instruction set and has low overhead for data communication.

  10. Network device interface for digitally interfacing data channels to a controller via a network

    NASA Technical Reports Server (NTRS)

    Ellerbrock, Philip J. (Inventor); Grant, Robert L. (Inventor); Konz, Daniel W. (Inventor); Winkelmann, Joseph P. (Inventor)

    2004-01-01

    The present invention provides a network device interface and method for digitally connecting a plurality of data channels, such as sensors, actuators, and subsystems, to a controller using a network bus. The network device interface interprets commands and data received from the controller and polls the data channels in accordance with these commands. Specifically, the network device interface receives digital commands and data from the controller, and based on these commands and data, communicates with the data channels to either retrieve data in the case of a sensor or send data to activate an actuator. Data retrieved from the sensor is then converted by the network device interface into digital signals and transmitted back to the controller. In one advantageous embodiment, the network device interface uses a specialized protocol for communicating across the network bus that uses a low-level instruction set and has low overhead for data communication.

  11. Bus transport network model with ideal n-depth clique network topology

    NASA Astrophysics Data System (ADS)

    Yang, Xu-Hua; Chen, Guang; Sun, Bao; Chen, Sheng-Yong; Wang, Wan-Liang

    2011-11-01

    We propose an ideal n-depth clique network model. In this model, the original network is composed of cliques (maximal complete subgraphs) that overlap with each other. The network expands continuously by the addition of new cliques. The final diameter of the network can be set in advance, namely, it is controllable. Assuming that the diameter of the network is n, the network exhibits a logistic structure with (n+1) layers. In this structure, the 0th layer represents the original network and each node of the (m)th layer (1≤m≤n) corresponds to a clique in the (m-1)th layer. In the growth process of the network, we ensure that any (m)th layer network is composed of overlapping cliques. Any node in an (m)th layer network corresponds to an m-depth community in the original network, and the diameter of an m-depth community is m. Therefore, the (n-1)th layer network will contain only one clique, the (n)th layer network will contain only one node, and the diameter of the corresponding original network is n. Then an ideal n-depth clique network will be obtained. Based on the ideal n-depth clique network model, we construct a bus transport network model with an ideal n-depth clique network topology (ICNBTN). Moreover, our study compares this model with the real bus transport network (RealBTN) of three major cities in China and a recently introduced bus transport network model (BTN) whose network properties correspond well with those of real BTNs. The network properties of the ICNBTN are much closer to those of the RealBTN than those of the BTN are. At the same time, the ICNBTN has higher clustering extent of bus routes, smaller network diameter, which corresponds to shorter maximum transfer times in a bus network, and lower average shortest path time coefficient than the BTN and the RealBTN. Therefore, the ICNBTN can achieve higher transfer efficiency for a bus transport system.

  12. Lagged correlation networks

    NASA Astrophysics Data System (ADS)

    Curme, Chester

    Technological advances have provided scientists with large high-dimensional datasets that describe the behaviors of complex systems: from the statistics of energy levels in complex quantum systems, to the time-dependent transcription of genes, to price fluctuations among assets in a financial market. In this environment, where it may be difficult to infer the joint distribution of the data, network science has flourished as a way to gain insight into the structure and organization of such systems by focusing on pairwise interactions. This work focuses on a particular setting, in which a system is described by multivariate time series data. We consider time-lagged correlations among elements in this system, in such a way that the measured interactions among elements are asymmetric. Finally, we allow these interactions to be characteristically weak, so that statistical uncertainties may be important to consider when inferring the structure of the system. We introduce a methodology for constructing statistically validated networks to describe such a system, extend the methodology to accommodate interactions with a periodic component, and show how consideration of bipartite community structures in these networks can aid in the construction of robust statistical models. An example of such a system is a financial market, in which high frequency returns data may be used to describe contagion, or the spreading of shocks in price among assets. These data provide the experimental testing ground for our methodology. We study NYSE data from both the present day and one decade ago, examine the time scales over which the validated lagged correlation networks exist, and relate differences in the topological properties of the networks to an increasing economic efficiency. We uncover daily periodicities in the validated interactions, and relate our findings to explanations of the Epps Effect, an empirical phenomenon of financial time series. We also study bipartite community

  13. A new formulation for feedforward neural networks.

    PubMed

    Razavi, Saman; Tolson, Bryan A

    2011-10-01

    Feedforward neural network is one of the most commonly used function approximation techniques and has been applied to a wide variety of problems arising from various disciplines. However, neural networks are black-box models having multiple challenges/difficulties associated with training and generalization. This paper initially looks into the internal behavior of neural networks and develops a detailed interpretation of the neural network functional geometry. Based on this geometrical interpretation, a new set of variables describing neural networks is proposed as a more effective and geometrically interpretable alternative to the traditional set of network weights and biases. Then, this paper develops a new formulation for neural networks with respect to the newly defined variables; this reformulated neural network (ReNN) is equivalent to the common feedforward neural network but has a less complex error response surface. To demonstrate the learning ability of ReNN, in this paper, two training methods involving a derivative-based (a variation of backpropagation) and a derivative-free optimization algorithms are employed. Moreover, a new measure of regularization on the basis of the developed geometrical interpretation is proposed to evaluate and improve the generalization ability of neural networks. The value of the proposed geometrical interpretation, the ReNN approach, and the new regularization measure are demonstrated across multiple test problems. Results show that ReNN can be trained more effectively and efficiently compared to the common neural networks and the proposed regularization measure is an effective indicator of how a network would perform in terms of generalization.

  14. Optical set-reset latch

    DOEpatents

    Skogen, Erik J.

    2013-01-29

    An optical set-reset (SR) latch is formed from a first electroabsorption modulator (EAM), a second EAM and a waveguide photodetector (PD) which are arranged in an optical and electrical feedback loop which controls the transmission of light through the first EAM to latch the first EAM in a light-transmissive state in response to a Set light input. A second waveguide PD controls the transmission of light through the second EAM and is used to switch the first EAM to a light-absorptive state in response to a Reset light input provided to the second waveguide PD. The optical SR latch, which may be formed on a III-V compound semiconductor substrate (e.g. an InP or a GaAs substrate) as a photonic integrated circuit (PIC), stores a bit of optical information and has an optical output for the logic state of that bit of information.

  15. Developing a Research Skill Set

    PubMed Central

    You, Y. Nancy; Bednarski, Brian

    2014-01-01

    The recent decades have witnessed a significant expansion in the diversity of career paths within academic surgery. Although the skills for providing exemplary surgical care and for maintaining a strong work ethic are the foundations of an academic surgeon, deliberate career planning and organized acquisition of research skills contribute to the success of an academic career. In this article, we identify a set of core academic skills and propose a framework for acquiring them. We also describe specific career paths within academic surgery and provide an overview of the opportunities for acquiring specific skill sets. The development of an academic career is challenging, and firm knowledge of the personal motivations will sustain and endure the time needed for acquiring the needed skills. PMID:25067917

  16. Developing a research skill set.

    PubMed

    You, Y Nancy; Bednarski, Brian

    2014-06-01

    The recent decades have witnessed a significant expansion in the diversity of career paths within academic surgery. Although the skills for providing exemplary surgical care and for maintaining a strong work ethic are the foundations of an academic surgeon, deliberate career planning and organized acquisition of research skills contribute to the success of an academic career. In this article, we identify a set of core academic skills and propose a framework for acquiring them. We also describe specific career paths within academic surgery and provide an overview of the opportunities for acquiring specific skill sets. The development of an academic career is challenging, and firm knowledge of the personal motivations will sustain and endure the time needed for acquiring the needed skills.

  17. Answer Set Programming: A Primer

    NASA Astrophysics Data System (ADS)

    Eiter, Thomas; Ianni, Giovambattista; Krennwallner, Thomas

    Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years. This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation. It looks into positive programs over stratified programs to arbitrary programs, and then proceeds to extensions with two kinds of negation (named weak and strong negation), and disjunction in rule heads. The second part then considers the ASP paradigm itself, and describes the basic idea. It shows some programming techniques and briefly overviews Answer Set solvers. The third part is devoted to ASP in the context of the Semantic Web, presenting some formalisms and mentioning some applications in this area. The article concludes with issues of current and future ASP research.

  18. Minimum network constraint on reverse engineering to develop biological regulatory networks.

    PubMed

    Shao, Bin; Wu, Jiayi; Tian, Binghui; Ouyang, Qi

    2015-09-07

    Reconstructing the topological structure of biological regulatory networks from microarray expression data or data of protein expression profiles is one of major tasks in systems biology. In recent years, various mathematical methods have been developed to meet this task. Here, based on our previously reported reverse engineering method, we propose a new constraint, i.e., the minimum network constraint, to facilitate the reconstruction of biological networks. Three well studied regulatory networks (the budding yeast cell cycle network, the fission yeast cell cycle network, and the SOS network of Escherichia coli) were used as the test sets to verify the performance of this method. Numerical results show that the biological networks prefer to use the minimal networks to fulfill their functional tasks, making it possible to apply minimal network criteria in the network reconstruction process. Two scenarios were considered in the reconstruction process: generating data using different initial conditions; and generating data from knock out and over-expression experiments. In both cases, network structures are revealed faithfully in a few steps using our approach.

  19. Cross-Species Network Analysis Uncovers Conserved Nitrogen-Regulated Network Modules in Rice1[OPEN

    PubMed Central

    Obertello, Mariana; Shrivastava, Stuti; Katari, Manpreet S.; Coruzzi, Gloria M.

    2015-01-01

    In this study, we used a cross-species network approach to uncover nitrogen (N)-regulated network modules conserved across a model and a crop species. By translating gene network knowledge from the data-rich model Arabidopsis (Arabidopsis thaliana) to a crop, rice (Oryza sativa), we identified evolutionarily conserved N-regulatory modules as targets for translational studies to improve N use efficiency in transgenic plants. To uncover such conserved N-regulatory network modules, we first generated an N-regulatory network based solely on rice transcriptome and gene interaction data. Next, we enhanced the network knowledge in the rice N-regulatory network using transcriptome and gene interaction data from Arabidopsis and new data from Arabidopsis and rice plants exposed to the same N treatment conditions. This cross-species network analysis uncovered a set of N-regulated transcription factors (TFs) predicted to target the same genes and network modules in both species. Supernode analysis of the TFs and their targets in these conserved network modules uncovered genes directly related to N use (e.g. N assimilation) and to other shared biological processes indirectly related to N. This cross-species network approach was validated with members of two TF families in the supernode network, BASIC-LEUCINE ZIPPER TRANSCRIPTION FACTOR1-TGA and HYPERSENSITIVITY TO LOW PI-ELICITED PRIMARY ROOT SHORTENING1 (HRS1)/HRS1 Homolog family, which have recently been experimentally validated to mediate the N response in Arabidopsis. PMID:26045464

  20. Communication in the perioperative setting.

    PubMed

    Cvetic, Elizabeth

    2011-09-01

    Poor communication in the perioperative setting contributes to an unsafe OR culture and affects patient safety and employee engagement, decision making, productivity, morale, and retention. Communication breakdowns can lead to surgical delays, patient inconvenience, and serious errors. Simplification and standardization of communication processes and the use of effective communication skills (eg, clear verbal communication, awareness of the effects of nonverbal communication, use of listening and conflict management skills) are ways to improve OR interactions and minimize or prevent errors.

  1. Less than a Class Set

    ERIC Educational Resources Information Center

    Bennett, Kristin Redington

    2012-01-01

    The iPad holds amazing potential for classroom use. Just a few--or even only one--is enough to get results. Having a class set promotes traditional, whole-class instruction, but fewer iPads facilitate individualized and tailored instruction. In this article, the author discusses the potential of the iPad and suggests ways to put the iPad to use in…

  2. Fluctuation Induced Almost Invariant Sets

    DTIC Science & Technology

    2006-12-28

    the methods are used to illustrate the technique. 28-12-2006 Interim Report Office of Naval Research One Liberty Center 875 North Randolph Street...Markov processes. Two examples of the methods are used to illustrate the technique. I. INTRODUCTION Transport in dynamical systems is an important topic...chaotic saddle present. As an alternative to the above analysis methods , set theoretic methods have been used to quantify the stochastic attractors

  3. Efficient, sparse biological network determination

    PubMed Central

    August, Elias; Papachristodoulou, Antonis

    2009-01-01

    Background Determining the interaction topology of biological systems is a topic that currently attracts significant research interest. Typical models for such systems take the form of differential equations that involve polynomial and rational functions. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data much harder. The use of linear dynamics and linearization techniques that have been proposed in the past can circumvent this, but the general problem of developing efficient algorithms for models that provide more accurate system descriptions remains open. Results We present a network determination algorithm that can treat model descriptions with polynomial and rational functions and which does not make use of linearization. For this purpose, we make use of the observation that biochemical networks are in general 'sparse' and minimize the 1-norm of the decision variables (sum of weighted network connections) while constraints keep the error between data and the network dynamics small. The emphasis of our methodology is on determining the interconnection topology rather than the specific reaction constants and it takes into account the necessary properties that a chemical reaction network should have – something that techniques based on linearization can not. The problem can be formulated as a Linear Program, a convex optimization problem, for which efficient algorithms are available that can treat large data sets efficiently and uncertainties in data or model parameters. Conclusion The presented methodology is able to predict with accuracy and efficiency the connectivity structure of a chemical reaction network with mass action kinetics and of a gene regulatory network from simulation data even if the dynamics of these systems are non-polynomial (rational) and uncertainties in the data are taken into account. It also produces a network structure that can explain the real experimental

  4. Why Network? Theoretical Perspectives on Networking

    ERIC Educational Resources Information Center

    Muijs, Daniel; West, Mel; Ainscow, Mel

    2010-01-01

    In recent years, networking and collaboration have become increasingly popular in education. However, there is at present a lack of attention to the theoretical basis of networking, which could illuminate when and when not to network and under what conditions networks are likely to be successful. In this paper, we will attempt to sketch the…

  5. Modified neural networks for rapid recovery of tokamak plasma parameters for real time control

    NASA Astrophysics Data System (ADS)

    Sengupta, A.; Ranjan, P.

    2002-07-01

    Two modified neural network techniques are used for the identification of the equilibrium plasma parameters of the Superconducting Steady State Tokamak I from external magnetic measurements. This is expected to ultimately assist in a real time plasma control. As different from the conventional network structure where a single network with the optimum number of processing elements calculates the outputs, a multinetwork system connected in parallel does the calculations here in one of the methods. This network is called the double neural network. The accuracy of the recovered parameters is clearly more than the conventional network. The other type of neural network used here is based on the statistical function parametrization combined with a neural network. The principal component transformation removes linear dependences from the measurements and a dimensional reduction process reduces the dimensionality of the input space. This reduced and transformed input set, rather than the entire set, is fed into the neural network input. This is known as the principal component transformation-based neural network. The accuracy of the recovered parameters in the latter type of modified network is found to be a further improvement over the accuracy of the double neural network. This result differs from that obtained in an earlier work where the double neural network showed better performance. The conventional network and the function parametrization methods have also been used for comparison. The conventional network has been used for an optimization of the set of magnetic diagnostics. The effective set of sensors, as assessed by this network, are compared with the principal component based network. Fault tolerance of the neural networks has been tested. The double neural network showed the maximum resistance to faults in the diagnostics, while the principal component based network performed poorly. Finally the processing times of the methods have been compared. The double

  6. Statistical physics of complex networks

    NASA Astrophysics Data System (ADS)

    Xie, Huafeng

    Rank algorithm to a new ranking method, CiteRank, in which the starting point of random surfers is exponentially biased towards more recent publications. The ranking results are compared for two rather different citation networks: all American Physical Society publications between 1893 and 2003 and the set of high energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters of the CiteRank algorithm are remarkably similar.

  7. Electrical contact tool set station

    DOEpatents

    Byers, M.E.

    1988-02-22

    An apparatus is provided for the precise setting to zero of electrically conductive cutting tools used in the machining of work pieces. An electrically conductive cylindrical pin, tapered at one end to a small flat, rests in a vee-shaped channel in a base so that its longitudinal axis is parallel to the longitudinal axis of the machine's spindle. Electronic apparatus is connected between the cylindrical pin and the electrically conductive cutting tool to produce a detectable signal when contact between tool and pin is made. The axes of the machine are set to zero by contact between the cutting tool and the sides, end or top of the cylindrical pin. Upon contact, an electrical circuit is completed, and the detectable signal is produced. The tool can then be set to zero for that axis. Should the tool contact the cylindrical pin with too much force, the cylindrical pin would be harmlessly dislodged from the vee-shaped channel, preventing damage either to the cutting tool or the cylindrical pin. 5 figs.

  8. Integrated network design and scheduling problems :

    SciTech Connect

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  9. Growth of a Dendritic Channel Network (Invited)

    NASA Astrophysics Data System (ADS)

    Rothman, D.; Abrams, D. M.; Devauchelle, O.; Petroff, A. P.; Lobkovsky, A. E.; Straub, K. M.; McElroy, B.; Mohrig, D. C.; Kudrolli, A.

    2009-12-01

    Dendritic channel networks are a ubiquitous feature of Earth's topography. A half century of work has detailed their scale-invariant geometry. But relatively little is known about how such networks grow, especially in natural settings at geologic time scales. This talk addresses the growth of a particularly simple class of channel networks: those which drain groundwater. We focus on a pristine field site in the Florida Panhandle, in which channels extending for kilometers have been incised vertically through tens of meters of ancient beach sands. We first show how the flow of subsurface water interacts with the planform geometry of the network. Ground-penetrating radar images of the water table shape near a highly-ramified section of the network provide a qualitative view of groundwater focusing. Noting that the water table represents a balance between water input via rain and water flowing into the channel network, we solve for the steady state shape of the water table around the entire network and the associated water fluxes. Comparison of predicted and measured fluxes shows that the ramified structure of the Florida network is consistent with uniformly forced unstable growth through a homogeneous medium. In other words, the dendritic pattern results intrinsically from growth dynamics rather than geologic heterogeneity. We then use these observations to show that the growth of groundwater-driven networks can be described by two linear response laws. Remarkably, one of these growth laws is reversible, which allows us to reconstruct network history and estimate network age. A particularly striking feature of the Florida network is the existence of a characteristic length scale between channels. Our theory predicts how this length scale evolves, thereby linking network growth to geometric form. Reference: D. M. Abrams, A. E. Lobkovsky, A. P. Petroff, K. M. Straub, B. McElroy, D. C. Mohrig, A. Kudrolli, and D. H. Rothman,, Growth laws for channel networks incised by

  10. Diagnosing Anomalous Network Performance with Confidence

    SciTech Connect

    Settlemyer, Bradley W; Hodson, Stephen W; Kuehn, Jeffery A; Poole, Stephen W

    2011-04-01

    Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnec- tion networks offer excellent best-case network latencies; how- ever, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to under- stand anomalous network performance. Our tool, Confidence, instead uses an empirically derived probability distribution to characterize network performance. In this paper we describe several instances where the Confidence toolkit allowed us to understand and diagnose network performance anomalies that we could not adequately explore with the simple summary statis- tics provided by traditional measurement tools. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

  11. Measuring and modeling correlations in multiplex networks

    NASA Astrophysics Data System (ADS)

    Nicosia, Vincenzo; Latora, Vito

    2015-09-01

    The interactions among the elementary components of many complex systems can be qualitatively different. Such systems are therefore naturally described in terms of multiplex or multilayer networks, i.e., networks where each layer stands for a different type of interaction between the same set of nodes. There is today a growing interest in understanding when and why a description in terms of a multiplex network is necessary and more informative than a single-layer projection. Here we contribute to this debate by presenting a comprehensive study of correlations in multiplex networks. Correlations in node properties, especially degree-degree correlations, have been thoroughly studied in single-layer networks. Here we extend this idea to investigate and characterize correlations between the different layers of a multiplex network. Such correlations are intrinsically multiplex, and we first study them empirically by constructing and analyzing several multiplex networks from the real world. In particular, we introduce various measures to characterize correlations in the activity of the nodes and in their degree at the different layers and between activities and degrees. We show that real-world networks exhibit indeed nontrivial multiplex correlations. For instance, we find cases where two layers of the same multiplex network are positively correlated in terms of node degrees, while other two layers are negatively correlated. We then focus on constructing synthetic multiplex networks, proposing a series of models to reproduce the correlations observed empirically and/or to assess their relevance.

  12. Cross-linked structure of network evolution

    SciTech Connect

    Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

    2014-03-15

    We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

  13. Comparing biological networks via graph compression

    PubMed Central

    2010-01-01

    Background Comparison of various kinds of biological data is one of the main problems in bioinformatics and systems biology. Data compression methods have been applied to comparison of large sequence data and protein structure data. Since it is still difficult to compare global structures of large biological networks, it is reasonable to try to apply data compression methods to comparison of biological networks. In existing compression methods, the uniqueness of compression results is not guaranteed because there is some ambiguity in selection of overlapping edges. Results This paper proposes novel efficient methods, CompressEdge and CompressVertices, for comparing large biological networks. In the proposed methods, an original network structure is compressed by iteratively contracting identical edges and sets of connected edges. Then, the similarity of two networks is measured by a compression ratio of the concatenated networks. The proposed methods are applied to comparison of metabolic networks of several organisms, H. sapiens, M. musculus, A. thaliana, D. melanogaster, C. elegans, E. coli, S. cerevisiae, and B. subtilis, and are compared with an existing method. These results suggest that our methods can efficiently measure the similarities between metabolic networks. Conclusions Our proposed algorithms, which compress node-labeled networks, are useful for measuring the similarity of large biological networks. PMID:20840727

  14. Multi-scale modularity and motif distributional effect in metabolic networks.

    PubMed

    Gao, Shang; Chen, Alan; Rahmani, Ali; Zeng, Jia; Tan, Mehmet; Alhajj, Reda; Rokne, Jon; Demetrick, Douglas; Wei, Xiaohui

    2016-01-01

    Metabolism is a set of fundamental processes that play important roles in a plethora of biological and medical contexts. It is understood that the topological information of reconstructed metabolic networks, such as modular organization, has crucial implications on biological functions. Recent interpretations of modularity in network settings provide a view of multiple network partitions induced by different resolution parameters. Here we ask the question: How do multiple network partitions affect the organization of metabolic networks? Since network motifs are often interpreted as the super families of evolved units, we further investigate their impact under multiple network partitions and investigate how the distribution of network motifs influences the organization of metabolic networks. We studied Homo sapiens, Saccharomyces cerevisiae and Escherichia coli metabolic networks; we analyzed the relationship between different community structures and motif distribution patterns. Further, we quantified the degree to which motifs participate in the modular organization of metabolic networks.

  15. Network developments and network monitoring in Internet2

    NASA Astrophysics Data System (ADS)

    Boyd, E.; Evett, S.

    Given that performance is excellent across backbone networks, and that performance is a problem end-to-end, it is clear that problems are concentrated towards the edge and in network transitions. To achieve good end-to-end performance, we need to diagnose (understand the limits of performance) and address (work with members and application communities to address those performance issues). We envision readily available performance information that is easy to find, ubiquitous, reliable, valuable, actionable (analysis suggests course of action), and automated (applications act on data received). The Internet2 End-to-End Performance Initative (E2Epi) currently focuses on the development and widespread deployment of perfSONAR [1][2], an international consortium developing a performance middleware architecture and a set of protocol standards for inter-operability between measurement and monitoring systems. perfSONAR is a set of open source web services that can be added, piecemeal, and extended to create a performance monitoring framework. It is designed to be standards-based, modular, decentralized, and open source. This makes it applicable to multiple generations of network monitoring systems and encourages outside development while still allowing it to be customized for individual science applications. perfSONAR is a joint effort of ESnet, GÉANT2 JRA1, Internet2, and RNP. The Internet2 Network is a hybrid optical and IP network, that offers dynamic and static wavelength services. The Internet2 Network Observatory supports three types of services: measurement, co-location, and experimental servers to support specific projects. The Observatory collects data and makes it publicly available.

  16. Theory of interface: category theory, directed networks and evolution of biological networks.

    PubMed

    Haruna, Taichi

    2013-11-01

    Biological networks have two modes. The first mode is static: a network is a passage on which something flows. The second mode is dynamic: a network is a pattern constructed by gluing functions of entities constituting the network. In this paper, first we discuss that these two modes can be associated with the category theoretic duality (adjunction) and derive a natural network structure (a path notion) for each mode by appealing to the category theoretic universality. The path notion corresponding to the static mode is just the usual directed path. The path notion for the dynamic mode is called lateral path which is the alternating path considered on the set of arcs. Their general functionalities in a network are transport and coherence, respectively. Second, we introduce a betweenness centrality of arcs for each mode and see how the two modes are embedded in various real biological network data. We find that there is a trade-off relationship between the two centralities: if the value of one is large then the value of the other is small. This can be seen as a kind of division of labor in a network into transport on the network and coherence of the network. Finally, we propose an optimization model of networks based on a quality function involving intensities of the two modes in order to see how networks with the above trade-off relationship can emerge through evolution. We show that the trade-off relationship can be observed in the evolved networks only when the dynamic mode is dominant in the quality function by numerical simulations. We also show that the evolved networks have features qualitatively similar to real biological networks by standard complex network analysis.

  17. Gossip spread in social network Models

    NASA Astrophysics Data System (ADS)

    Johansson, Tobias

    2017-04-01

    Gossip almost inevitably arises in real social networks. In this article we investigate the relationship between the number of friends of a person and limits on how far gossip about that person can spread in the network. How far gossip travels in a network depends on two sets of factors: (a) factors determining gossip transmission from one person to the next and (b) factors determining network topology. For a simple model where gossip is spread among people who know the victim it is known that a standard scale-free network model produces a non-monotonic relationship between number of friends and expected relative spread of gossip, a pattern that is also observed in real networks (Lind et al., 2007). Here, we study gossip spread in two social network models (Toivonen et al., 2006; Vázquez, 2003) by exploring the parameter space of both models and fitting them to a real Facebook data set. Both models can produce the non-monotonic relationship of real networks more accurately than a standard scale-free model while also exhibiting more realistic variability in gossip spread. Of the two models, the one given in Vázquez (2003) best captures both the expected values and variability of gossip spread.

  18. A simple model for studying interacting networks

    NASA Astrophysics Data System (ADS)

    Liu, Wenjia; Jolad, Shivakumar; Schmittmann, Beate; Zia, R. K. P.

    2011-03-01

    Many specific physical networks (e.g., internet, power grid, interstates), have been characterized in considerable detail, but in isolation from each other. Yet, each of these networks supports the functions of the others, and so far, little is known about how their interactions affect their structure and functionality. To address this issue, we consider two coupled model networks. Each network is relatively simple, with a fixed set of nodes, but dynamically generated set of links which has a preferred degree, κ . In the stationary state, the degree distribution has exponential tails (far from κ), an attribute which we can explain. Next, we consider two such networks with different κ 's, reminiscent of two social groups, e.g., extroverts and introverts. Finally, we let these networks interact by establishing a controllable fraction of cross links. The resulting distribution of links, both within and across the two model networks, is investigated and discussed, along with some potential consequences for real networks. Supported in part by NSF-DMR-0705152 and 1005417.

  19. [Networks in cognitive research].

    PubMed

    Pléh, Csaba

    2012-01-01

    This review paper starts from discussing two models of network research: one starting from general networks, the other starting from the Ego. Ego based researches are characterized starting form the model of Dunbar as presenting networks of different size and intimacy, both in real and virtual networks. Researches into the personality determinants of networks mainly shows the effects of extroversion. The future of network research indicates a trend towards relating personal, conceptual, and neural networks.

  20. Communications Network

    NASA Technical Reports Server (NTRS)

    1990-01-01

    The Multi-Compatible Network Interface Unit (MCNIU) is intended to connect the space station's communications and tracking, guidance and navigation, life support, electric power, payload data, hand controls, display consoles and other systems, and also communicate with diverse processors. Honeywell is now marketing MCNIU commercially. It has applicability in certain military operations or civil control centers. It has nongovernment utility among large companies, universities and research organizations that transfer large amounts of data among workstations and computers. *This product is no longer commercially available.