Brain Network Theory Can Predict Whether Neuropsychological Outcomes Will Differ from Clinical Expectations.

PubMed

Warren, David E; Denburg, Natalie L; Power, Jonathan D; Bruss, Joel; Waldron, Eric J; Sun, Haoxin; Petersen, Steve E; Tranel, Daniel

2017-02-01

Theories of brain-network organization based on neuroimaging data have burgeoned in recent years, but the predictive power of such theories for cognition and behavior has only rarely been examined. Here, predictions from clinical neuropsychologists about the cognitive profiles of patients with focal brain lesions were used to evaluate a brain-network theory (Warren et al., 2014). Neuropsychologists made predictions regarding the neuropsychological profiles of a neurological patient sample (N = 30) based on lesion location. The neuropsychologists then rated the congruence of their predictions with observed neuropsychological outcomes, in regard to the "severity" of neuropsychological deficits and the "focality" of neuropsychological deficits. Based on the network theory, two types of lesion locations were identified: "target" locations (putative hubs in a brain-wide network) and "control" locations (hypothesized to play limited roles in network function). We found that patients with lesions of target locations (N = 19) had deficits of greater than expected severity that were more widespread than expected, whereas patients with lesions of control locations (N = 11) showed milder, circumscribed deficits that were more congruent with expectations. The findings for the target brain locations suggest that prevailing views of brain-behavior relationships may be sharpened and refined by integrating recently proposed network-oriented perspectives. © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Network Theory: A Primer and Questions for Air Transportation Systems Applications

NASA Technical Reports Server (NTRS)

Holmes, Bruce J.

2004-01-01

A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.

Optimal multi-community network modularity for information diffusion

NASA Astrophysics Data System (ADS)

Wu, Jiaocan; Du, Ruping; Zheng, Yingying; Liu, Dong

2016-02-01

Studies demonstrate that community structure plays an important role in information spreading recently. In this paper, we investigate the impact of multi-community structure on information diffusion with linear threshold model. We utilize extended GN network that contains four communities and analyze dynamic behaviors of information that spreads on it. And we discover the optimal multi-community network modularity for information diffusion based on the social reinforcement. Results show that, within the appropriate range, multi-community structure will facilitate information diffusion instead of hindering it, which accords with the results derived from two-community network.

Feasibility Evaluation of an On-site Generator Network by the Cooperative Game Theory

NASA Astrophysics Data System (ADS)

Komiyama, Ryoichi; Hayashi, Taketo; Fujii, Yasumasa; Yamaji, Kenji

On-site generator, such as CGS (cogeneration system), is allegedly considered to be an effective end-use energy system in order to accomplish primary energy conservation, CO2 emission mitigation and system cost reduction, which characteristics eventually improve the whole performance of an existing energy system for the future. Considering the drawback of installing an end-use CGS into the customer with small or middle scale floor space, however, it is difficult to achieve those distinctive features because the thermal-electricity ratio of CGS does not always be in agreement with that of customer energy demand. In order to overcome that matching deficiency, it is hence better to organize an on-site generator network based on mutual electricity and heating transmission. But focusing on some cogenerators underlying their behaviors on maximizing their own profits, this on-site network, which situation corresponds to a grand coalition, is not necessarily established because of each cogenerator’s motivation to form a partial coalition and acquire its own profit as much as possible. In this paper, we attempt to analyze the optimal operation of an on-site generator network and identify by applying the nucleolus of the cooperative game theory the optimal benefit allocation strategy in order for the cogenerators to construct the network. Regarding the installation site of this network, the center of Tokyo area is assumed, which locational information includes floor space and so forth through a GIS (geographic information system) database. The results from the nucleolus suggest that all districts should impartially obtain the benefit from organizing network for the purpose of jointly attaining the system total cost reduction.

Endogenous Molecular-Cellular Network Cancer Theory: A Systems Biology Approach.

PubMed

Wang, Gaowei; Yuan, Ruoshi; Zhu, Xiaomei; Ao, Ping

2018-01-01

In light of ever apparent limitation of the current dominant cancer mutation theory, a quantitative hypothesis for cancer genesis and progression, endogenous molecular-cellular network hypothesis has been proposed from the systems biology perspective, now for more than 10 years. It was intended to include both the genetic and epigenetic causes to understand cancer. Its development enters the stage of meaningful interaction with experimental and clinical data and the limitation of the traditional cancer mutation theory becomes more evident. Under this endogenous network hypothesis, we established a core working network of hepatocellular carcinoma (HCC) according to the hypothesis and quantified the working network by a nonlinear dynamical system. We showed that the two stable states of the working network reproduce the main known features of normal liver and HCC at both the modular and molecular levels. Using endogenous network hypothesis and validated working network, we explored genetic mutation pattern in cancer and potential strategies to cure or relieve HCC from a totally new perspective. Patterns of genetic mutations have been traditionally analyzed by posteriori statistical association approaches in light of traditional cancer mutation theory. One may wonder the possibility of a priori determination of any mutation regularity. Here, we found that based on the endogenous network theory the features of genetic mutations in cancers may be predicted without any prior knowledge of mutation propensities. Normal hepatocyte and cancerous hepatocyte stable states, specified by distinct patterns of expressions or activities of proteins in the network, provide means to directly identify a set of most probable genetic mutations and their effects in HCC. As the key proteins and main interactions in the network are conserved through cell types in an organism, similar mutational features may also be found in other cancers. This analysis yielded straightforward and testable

Analytical theory of polymer-network-mediated interaction between colloidal particles

PubMed Central

Di Michele, Lorenzo; Zaccone, Alessio; Eiser, Erika

2012-01-01

Nanostructured materials based on colloidal particles embedded in a polymer network are used in a variety of applications ranging from nanocomposite rubbers to organic-inorganic hybrid solar cells. Further, polymer-network-mediated colloidal interactions are highly relevant to biological studies whereby polymer hydrogels are commonly employed to probe the mechanical response of living cells, which can determine their biological function in physiological environments. The performance of nanomaterials crucially relies upon the spatial organization of the colloidal particles within the polymer network that depends, in turn, on the effective interactions between the particles in the medium. Existing models based on nonlocal equilibrium thermodynamics fail to clarify the nature of these interactions, precluding the way toward the rational design of polymer-composite materials. In this article, we present a predictive analytical theory of these interactions based on a coarse-grained model for polymer networks. We apply the theory to the case of colloids partially embedded in cross-linked polymer substrates and clarify the origin of attractive interactions recently observed experimentally. Monte Carlo simulation results that quantitatively confirm the theoretical predictions are also presented. PMID:22679289

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Critical Theory and Information Studies: A Marcusean Infusion

ERIC Educational Resources Information Center

Pyati, Ajit K.

2006-01-01

In the field of library and information science, also known as information studies, critical theory is often not included in debates about the discipline's theoretical foundations. This paper argues that the critical theory of Herbert Marcuse, in particular, has a significant contribution to make to the field of information studies. Marcuse's…

76 FR 67750 - Homeland Security Information Network Advisory Committee

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-02

... DEPARTMENT OF HOMELAND SECURITY [Docket No. DHS-2011-0107] Homeland Security Information Network... Information Network Advisory Committee. SUMMARY: The Secretary of Homeland Security has determined that the renewal of the Homeland Security Information Network Advisory Committee (HSINAC) is necessary and in the...

Information Network on Rural Development (INRD), Bangladesh.

ERIC Educational Resources Information Center

Wanasundra, Leelangi

1994-01-01

Discusses information networking in Bangladesh and describes the formation of the Information Network on Rural Development (INRD) which was initiated by the Center on Integrated Rural Development for Asia and the Pacific (CIRDAP). Organization, membership, activities, participation, and finance are examined. (four references) (LRW)

An information spreading model based on online social networks

NASA Astrophysics Data System (ADS)

Wang, Tao; He, Juanjuan; Wang, Xiaoxia

2018-01-01

Online social platforms are very popular in recent years. In addition to spreading information, users could review or collect information on online social platforms. According to the information spreading rules of online social network, a new information spreading model, namely IRCSS model, is proposed in this paper. It includes sharing mechanism, reviewing mechanism, collecting mechanism and stifling mechanism. Mean-field equations are derived to describe the dynamics of the IRCSS model. Moreover, the steady states of reviewers, collectors and stiflers and the effects of parameters on the peak values of reviewers, collectors and sharers are analyzed. Finally, numerical simulations are performed on different networks. Results show that collecting mechanism and reviewing mechanism, as well as the connectivity of the network, make information travel wider and faster, and compared to WS network and ER network, the speed of reviewing, sharing and collecting information is fastest on BA network.

Searching Information Sources in Networks

DTIC Science & Technology

2017-06-14

SECURITY CLASSIFICATION OF: During the course of this project, we made significant progresses in multiple directions of the information detection...result on information source detection on non-tree networks; (2) The development of information source localization algorithms to detect multiple... information sources. The algorithms have provable performance guarantees and outperform existing algorithms in 1. REPORT DATE (DD-MM-YYYY) 4. TITLE AND

Quantum Information Theory - an Invitation

NASA Astrophysics Data System (ADS)

Werner, Reinhard F.

Quantum information and quantum computers have received a lot of public attention recently. Quantum computers have been advertised as a kind of warp drive for computing, and indeed the promise of the algorithms of Shor and Grover is to perform computations which are extremely hard or even provably impossible on any merely ``classical'' computer.In this article I shall give an account of the basic concepts of quantum information theory is given, staying as much as possible in the area of general agreement.The article is divided into two parts. The first (up to the end of Sect. 2.5) is mostly in plain English, centered around the exploration of what can or cannot be done with quantum systems as information carriers. The second part, Sect. 2.6, then gives a description of the mathematical structures and of some of the tools needed to develop the theory.

Improving information filtering via network manipulation

NASA Astrophysics Data System (ADS)

Zhang, Fuguo; Zeng, An

2012-12-01

The recommender system is a very promising way to address the problem of overabundant information for online users. Although the information filtering for the online commercial systems has received much attention recently, almost all of the previous works are dedicated to design new algorithms and consider the user-item bipartite networks as given and constant information. However, many problems for recommender systems such as the cold-start problem (i.e., low recommendation accuracy for the small-degree items) are actually due to the limitation of the underlying user-item bipartite networks. In this letter, we propose a strategy to enhance the performance of the already existing recommendation algorithms by directly manipulating the user-item bipartite networks, namely adding some virtual connections to the networks. Numerical analyses on two benchmark data sets, MovieLens and Netflix, show that our method can remarkably improves the recommendation performance. Specifically, it not only improves the recommendations accuracy (especially for the small-degree items), but also helps the recommender systems generate more diverse and novel recommendations.

How Neural Networks Learn from Experience.

ERIC Educational Resources Information Center

Hinton, Geoffrey E.

1992-01-01

Discusses computational studies of learning in artificial neural networks and findings that may provide insights into the learning abilities of the human brain. Describes efforts to test theories about brain information processing, using artificial neural networks. Vignettes include information concerning how a neural network represents…

Unification of quantum information theory

NASA Astrophysics Data System (ADS)

Abeyesinghe, Anura

We present the unification of many previously disparate results in noisy quantum Shannon theory and the unification of all of noiseless quantum Shannon theory. More specifically we deal here with bipartite, unidirectional, and memoryless quantum Shannon theory. We find all the optimal protocols and quantify the relationship between the resources used, both for the one-shot and for the ensemble case, for what is arguably the most fundamental task in quantum information theory: sharing entangled states between a sender and a receiver. We find that all of these protocols are derived from our one-shot superdense coding protocol and relate nicely to each other. We then move on to noisy quantum information theory and give a simple, direct proof of the "mother" protocol, or rather her generalization to the Fully Quantum Slepian-Wolf protocol (FQSW). FQSW simultaneously accomplishes two goals: quantum communication-assisted entanglement distillation, and state transfer from the sender to the receiver. As a result, in addition to her other "children," the mother protocol generates the state merging primitive of Horodecki, Oppenheim, and Winter as well as a new class of distributed compression protocols for correlated quantum sources, which are optimal for sources described by separable density operators. Moreover, the mother protocol described here is easily transformed into the so-called "father" protocol, demonstrating that the division of single-sender/single-receiver protocols into two families was unnecessary: all protocols in the family are children of the mother.

Maximizing information exchange between complex networks

NASA Astrophysics Data System (ADS)

West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo

2008-10-01

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain’s response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of

Animal Social Network Theory Can Help Wildlife Conservation.

PubMed

Snijders, Lysanne; Blumstein, Daniel T; Stanley, Christina R; Franks, Daniel W

2017-08-01

Many animals preferentially associate with certain other individuals. This social structuring can influence how populations respond to changes to their environment, thus making network analysis a promising technique for understanding, predicting, and potentially manipulating population dynamics. Various network statistics can correlate with individual fitness components and key population-level processes, yet the logical role and formal application of animal social network theory for conservation and management have not been well articulated. We outline how understanding of direct and indirect relationships between animals can be profitably applied by wildlife managers and conservationists. By doing so, we aim to stimulate the development and implementation of practical tools for wildlife conservation and management and to inspire novel behavioral research in this field. Copyright © 2017 Elsevier Ltd. All rights reserved.

Parallel Distributed Processing Theory in the Age of Deep Networks.

PubMed

Bowers, Jeffrey S

2017-12-01

Parallel distributed processing (PDP) models in psychology are the precursors of deep networks used in computer science. However, only PDP models are associated with two core psychological claims, namely that all knowledge is coded in a distributed format and cognition is mediated by non-symbolic computations. These claims have long been debated in cognitive science, and recent work with deep networks speaks to this debate. Specifically, single-unit recordings show that deep networks learn units that respond selectively to meaningful categories, and researchers are finding that deep networks need to be supplemented with symbolic systems to perform some tasks. Given the close links between PDP and deep networks, it is surprising that research with deep networks is challenging PDP theory. Copyright © 2017. Published by Elsevier Ltd.

Information in a Network of Neuronal Cells: Effect of Cell Density and Short-Term Depression

PubMed Central

Onesto, Valentina; Cosentino, Carlo; Di Fabrizio, Enzo; Cesarelli, Mario; Amato, Francesco; Gentile, Francesco

2016-01-01

Neurons are specialized, electrically excitable cells which use electrical to chemical signals to transmit and elaborate information. Understanding how the cooperation of a great many of neurons in a grid may modify and perhaps improve the information quality, in contrast to few neurons in isolation, is critical for the rational design of cell-materials interfaces for applications in regenerative medicine, tissue engineering, and personalized lab-on-a-chips. In the present paper, we couple an integrate-and-fire model with information theory variables to analyse the extent of information in a network of nerve cells. We provide an estimate of the information in the network in bits as a function of cell density and short-term depression time. In the model, neurons are connected through a Delaunay triangulation of not-intersecting edges; in doing so, the number of connecting synapses per neuron is approximately constant to reproduce the early time of network development in planar neural cell cultures. In simulations where the number of nodes is varied, we observe an optimal value of cell density for which information in the grid is maximized. In simulations in which the posttransmission latency time is varied, we observe that information increases as the latency time decreases and, for specific configurations of the grid, it is largely enhanced in a resonance effect. PMID:27403421

Implications of Information Theory for Computational Modeling of Schizophrenia.

PubMed

Silverstein, Steven M; Wibral, Michael; Phillips, William A

2017-10-01

Information theory provides a formal framework within which information processing and its disorders can be described. However, information theory has rarely been applied to modeling aspects of the cognitive neuroscience of schizophrenia. The goal of this article is to highlight the benefits of an approach based on information theory, including its recent extensions, for understanding several disrupted neural goal functions as well as related cognitive and symptomatic phenomena in schizophrenia. We begin by demonstrating that foundational concepts from information theory-such as Shannon information, entropy, data compression, block coding, and strategies to increase the signal-to-noise ratio-can be used to provide novel understandings of cognitive impairments in schizophrenia and metrics to evaluate their integrity. We then describe more recent developments in information theory, including the concepts of infomax, coherent infomax, and coding with synergy, to demonstrate how these can be used to develop computational models of schizophrenia-related failures in the tuning of sensory neurons, gain control, perceptual organization, thought organization, selective attention, context processing, predictive coding, and cognitive control. Throughout, we demonstrate how disordered mechanisms may explain both perceptual/cognitive changes and symptom emergence in schizophrenia. Finally, we demonstrate that there is consistency between some information-theoretic concepts and recent discoveries in neurobiology, especially involving the existence of distinct sites for the accumulation of driving input and contextual information prior to their interaction. This convergence can be used to guide future theory, experiment, and treatment development.

IEEE International Symposium Information Theory, held at Santa Monica California, February 9-12, 1981.

DTIC Science & Technology

1981-01-01

Channel and study permutation codes as a special case. ,uch a code is generated by an initial vector x, a group G of orthogonal n by n matrices, and a...random-access components, is introduced and studied . Under this scheme, the network stations are divided into groups , each of which is assigned a...IEEE INFORMATION THEORY GROUP CO-SPONSORED BY: UNION RADIO SCIENTIFIQUE INTERNATIONALE IEEE Catalog Number 81 CH 1609-7 IT 𔃻. 81 ~20 04Q SECURITY

Extending unified-theory-of-reinforcement neural networks to steady-state operant behavior.

PubMed

Calvin, Olivia L; McDowell, J J

2016-06-01

The unified theory of reinforcement has been used to develop models of behavior over the last 20 years (Donahoe et al., 1993). Previous research has focused on the theory's concordance with the respondent behavior of humans and animals. In this experiment, neural networks were developed from the theory to extend the unified theory of reinforcement to operant behavior on single-alternative variable-interval schedules. This area of operant research was selected because previously developed neural networks could be applied to it without significant alteration. Previous research with humans and animals indicates that the pattern of their steady-state behavior is hyperbolic when plotted against the obtained rate of reinforcement (Herrnstein, 1970). A genetic algorithm was used in the first part of the experiment to determine parameter values for the neural networks, because values that were used in previous research did not result in a hyperbolic pattern of behavior. After finding these parameters, hyperbolic and other similar functions were fitted to the behavior produced by the neural networks. The form of the neural network's behavior was best described by an exponentiated hyperbola (McDowell, 1986; McLean and White, 1983; Wearden, 1981), which was derived from the generalized matching law (Baum, 1974). In post-hoc analyses the addition of a baseline rate of behavior significantly improved the fit of the exponentiated hyperbola and removed systematic residuals. The form of this function was consistent with human and animal behavior, but the estimated parameter values were not. Copyright © 2016 Elsevier B.V. All rights reserved.

IMNN: Information Maximizing Neural Networks

NASA Astrophysics Data System (ADS)

Charnock, Tom; Lavaux, Guilhem; Wandelt, Benjamin D.

2018-04-01

This software trains artificial neural networks to find non-linear functionals of data that maximize Fisher information: information maximizing neural networks (IMNNs). As compressing large data sets vastly simplifies both frequentist and Bayesian inference, important information may be inadvertently missed. Likelihood-free inference based on automatically derived IMNN summaries produces summaries that are good approximations to sufficient statistics. IMNNs are robustly capable of automatically finding optimal, non-linear summaries of the data even in cases where linear compression fails: inferring the variance of Gaussian signal in the presence of noise, inferring cosmological parameters from mock simulations of the Lyman-α forest in quasar spectra, and inferring frequency-domain parameters from LISA-like detections of gravitational waveforms. In this final case, the IMNN summary outperforms linear data compression by avoiding the introduction of spurious likelihood maxima.

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

NASA Astrophysics Data System (ADS)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

Connectomics and graph theory analyses: Novel insights into network abnormalities in epilepsy.

PubMed

Gleichgerrcht, Ezequiel; Kocher, Madison; Bonilha, Leonardo

2015-11-01

The assessment of neural networks in epilepsy has become increasingly relevant in the context of translational research, given that localized forms of epilepsy are more likely to be related to abnormal function within specific brain networks, as opposed to isolated focal brain pathology. It is notable that variability in clinical outcomes from epilepsy treatment may be a reflection of individual patterns of network abnormalities. As such, network endophenotypes may be important biomarkers for the diagnosis and treatment of epilepsy. Despite its exceptional potential, measuring abnormal networks in translational research has been thus far constrained by methodologic limitations. Fortunately, recent advancements in neuroscience, particularly in the field of connectomics, permit a detailed assessment of network organization, dynamics, and function at an individual level. Data from the personal connectome can be assessed using principled forms of network analyses based on graph theory, which may disclose patterns of organization that are prone to abnormal dynamics and epileptogenesis. Although the field of connectomics is relatively new, there is already a rapidly growing body of evidence to suggest that it can elucidate several important and fundamental aspects of abnormal networks to epilepsy. In this article, we provide a review of the emerging evidence from connectomics research regarding neural network architecture, dynamics, and function related to epilepsy. We discuss how connectomics may bring together pathophysiologic hypotheses from conceptual and basic models of epilepsy and in vivo biomarkers for clinical translational research. By providing neural network information unique to each individual, the field of connectomics may help to elucidate variability in clinical outcomes and open opportunities for personalized medicine approaches to epilepsy. Connectomics involves complex and rich data from each subject, thus collaborative efforts to enable the

Information Networks and Education: An Analytic Bibliography.

ERIC Educational Resources Information Center

Pritchard, Roger

This literature review presents a broad and overall perspective on the various kinds of information networks that will be useful to educators in developing nations. There are five sections to the essay. The first section cites and briefly describes the literature dealing with library, information, and computer networks. Sections two and three…

A resource management architecture based on complex network theory in cloud computing federation

NASA Astrophysics Data System (ADS)

Zhang, Zehua; Zhang, Xuejie

2011-10-01

Cloud Computing Federation is a main trend of Cloud Computing. Resource Management has significant effect on the design, realization, and efficiency of Cloud Computing Federation. Cloud Computing Federation has the typical characteristic of the Complex System, therefore, we propose a resource management architecture based on complex network theory for Cloud Computing Federation (abbreviated as RMABC) in this paper, with the detailed design of the resource discovery and resource announcement mechanisms. Compare with the existing resource management mechanisms in distributed computing systems, a Task Manager in RMABC can use the historical information and current state data get from other Task Managers for the evolution of the complex network which is composed of Task Managers, thus has the advantages in resource discovery speed, fault tolerance and adaptive ability. The result of the model experiment confirmed the advantage of RMABC in resource discovery performance.

Workplace Learning in Informal Networks

ERIC Educational Resources Information Center

Milligan, Colin; Littlejohn, Allison; Margaryan, Anoush

2014-01-01

Learning does not stop when an individual leaves formal education, but becomes increasingly informal, and deeply embedded within other activities such as work. This article describes the challenges of informal learning in knowledge intensive industries, highlighting the important role of personal learning networks. The article argues that…

Developing Visualization Techniques for Semantics-based Information Networks

NASA Technical Reports Server (NTRS)

Keller, Richard M.; Hall, David R.

2003-01-01

Information systems incorporating complex network structured information spaces with a semantic underpinning - such as hypermedia networks, semantic networks, topic maps, and concept maps - are being deployed to solve some of NASA s critical information management problems. This paper describes some of the human interaction and navigation problems associated with complex semantic information spaces and describes a set of new visual interface approaches to address these problems. A key strategy is to leverage semantic knowledge represented within these information spaces to construct abstractions and views that will be meaningful to the human user. Human-computer interaction methodologies will guide the development and evaluation of these approaches, which will benefit deployed NASA systems and also apply to information systems based on the emerging Semantic Web.

Game Theory Based Security in Wireless Body Area Network with Stackelberg Security Equilibrium

PubMed Central

Somasundaram, M.; Sivakumar, R.

2015-01-01

Wireless Body Area Network (WBAN) is effectively used in healthcare to increase the value of the patient's life and also the value of healthcare services. The biosensor based approach in medical care system makes it difficult to respond to the patients with minimal response time. The medical care unit does not deploy the accessing of ubiquitous broadband connections full time and hence the level of security will not be high always. The security issue also arises in monitoring the user body function records. Most of the systems on the Wireless Body Area Network are not effective in facing the security deployment issues. To access the patient's information with higher security on WBAN, Game Theory with Stackelberg Security Equilibrium (GTSSE) is proposed in this paper. GTSSE mechanism takes all the players into account. The patients are monitored by placing the power position authority initially. The position authority in GTSSE is the organizer and all the other players react to the organizer decision. Based on our proposed approach, experiment has been conducted on factors such as security ratio based on patient's health information, system flexibility level, energy consumption rate, and information loss rate. Stackelberg Security considerably improves the strength of solution with higher security. PMID:26759829

Game Theory Based Security in Wireless Body Area Network with Stackelberg Security Equilibrium.

PubMed

Somasundaram, M; Sivakumar, R

2015-01-01

Wireless Body Area Network (WBAN) is effectively used in healthcare to increase the value of the patient's life and also the value of healthcare services. The biosensor based approach in medical care system makes it difficult to respond to the patients with minimal response time. The medical care unit does not deploy the accessing of ubiquitous broadband connections full time and hence the level of security will not be high always. The security issue also arises in monitoring the user body function records. Most of the systems on the Wireless Body Area Network are not effective in facing the security deployment issues. To access the patient's information with higher security on WBAN, Game Theory with Stackelberg Security Equilibrium (GTSSE) is proposed in this paper. GTSSE mechanism takes all the players into account. The patients are monitored by placing the power position authority initially. The position authority in GTSSE is the organizer and all the other players react to the organizer decision. Based on our proposed approach, experiment has been conducted on factors such as security ratio based on patient's health information, system flexibility level, energy consumption rate, and information loss rate. Stackelberg Security considerably improves the strength of solution with higher security.

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks

PubMed Central

Salim, Shelly; Moh, Sangman

2016-01-01

A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead. PMID:27376290

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks.

PubMed

Salim, Shelly; Moh, Sangman

2016-06-30

A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead.

Information flow in the auditory cortical network

PubMed Central

Hackett, Troy A.

2011-01-01

Auditory processing in the cerebral cortex is comprised of an interconnected network of auditory and auditory-related areas distributed throughout the forebrain. The nexus of auditory activity is located in temporal cortex among several specialized areas, or fields, that receive dense inputs from the medial geniculate complex. These areas are collectively referred to as auditory cortex. Auditory activity is extended beyond auditory cortex via connections with auditory-related areas elsewhere in the cortex. Within this network, information flows between areas to and from countless targets, but in a manner that is characterized by orderly regional, areal and laminar patterns. These patterns reflect some of the structural constraints that passively govern the flow of information at all levels of the network. In addition, the exchange of information within these circuits is dynamically regulated by intrinsic neurochemical properties of projecting neurons and their targets. This article begins with an overview of the principal circuits and how each is related to information flow along major axes of the network. The discussion then turns to a description of neurochemical gradients along these axes, highlighting recent work on glutamate transporters in the thalamocortical projections to auditory cortex. The article concludes with a brief discussion of relevant neurophysiological findings as they relate to structural gradients in the network. PMID:20116421

Information processing in network architecture of genome controlled signal transduction circuit. A proposed theoretical explanation.

PubMed

Chakraborty, Chiranjib; Sarkar, Bimal Kumar; Patel, Pratiksha; Agoramoorthy, Govindasamy

2012-01-01

In this paper, Shannon information theory has been applied to elaborate cell signaling. It is proposed that in the cellular network architecture, four components viz. source (DNA), transmitter (mRNA), receiver (protein) and destination (another protein) are involved. The message transmits from source (DNA) to transmitter (mRNA) and then passes through a noisy channel reaching finally the receiver (protein). The protein synthesis process is here considered as the noisy channel. Ultimately, signal is transmitted from receiver to destination (another protein). The genome network architecture elements were compared with genetic alphabet L = {A, C, G, T} with a biophysical model based on the popular Shannon information theory. This study found the channel capacity as maximum for zero error (sigma = 0) and at this condition, transition matrix becomes a unit matrix with rank 4. The transition matrix will be erroneous and finally at sigma = 1 channel capacity will be localized maxima with a value of 0.415 due to the increased value at sigma. On the other hand, minima exists at sigma = 0.75, where all transition probabilities become 0.25 and uncertainty will be maximum resulting in channel capacity with the minima value of zero.

The tensor network theory library

NASA Astrophysics Data System (ADS)

Al-Assam, S.; Clark, S. R.; Jaksch, D.

2017-09-01

In this technical paper we introduce the tensor network theory (TNT) library—an open-source software project aimed at providing a platform for rapidly developing robust, easy to use and highly optimised code for TNT calculations. The objectives of this paper are (i) to give an overview of the structure of TNT library, and (ii) to help scientists decide whether to use the TNT library in their research. We show how to employ the TNT routines by giving examples of ground-state and dynamical calculations of one-dimensional bosonic lattice system. We also discuss different options for gaining access to the software available at www.tensornetworktheory.org.

Discovery of Information Diffusion Process in Social Networks

NASA Astrophysics Data System (ADS)

Kim, Kwanho; Jung, Jae-Yoon; Park, Jonghun

Information diffusion analysis in social networks is of significance since it enables us to deeply understand dynamic social interactions among users. In this paper, we introduce approaches to discovering information diffusion process in social networks based on process mining. Process mining techniques are applied from three perspectives: social network analysis, process discovery and community recognition. We then present experimental results by using a real-life social network data. The proposed techniques are expected to employ as new analytical tools in online social networks such as blog and wikis for company marketers, politicians, news reporters and online writers.

Management of ATM-based networks supporting multimedia medical information systems

NASA Astrophysics Data System (ADS)

Whitman, Robert A.; Blaine, G. James; Fritz, Kevin; Goodgold, Ken; Heisinger, Patrick

1997-05-01

Medical information systems are acquiring the ability to collect and deliver many different types of medical information. In support of the increased network demands necessitated by these expanded capabilities, asynchronous transfer mode (ATM) based networks are being deployed in medical care systems. While ATM supplies a much greater line rate than currently deployed networks, the management and standards surrounding ATM are yet to mature. This paper explores the management and control issues surrounding an ATM network supporting medical information systems, and examines how management impacts network performance and robustness. A multivendor ATM network at the BJC Health System/Washington University and the applications using the network are discussed. Performance information for specific applications is presented and analyzed. Network management's influence on application reliability is outlined. The information collected is used to show how ATM network standards and management tools influence network reliability and performance. Performance of current applications using the ATM network is discussed. Special attention is given to issues encountered in implementation of hypertext transfer protocol over ATM internet protocol (IP) communications. A classical IP ATM implementation yields greater than twenty percent higher network performance over LANE. Maximum performance for a host's suite of applications can be obtained by establishing multiple individually engineered IP links through its ATM network connection.

Network information security in a phase III Integrated Academic Information Management System (IAIMS).

PubMed

Shea, S; Sengupta, S; Crosswell, A; Clayton, P D

1992-01-01

The developing Integrated Academic Information System (IAIMS) at Columbia-Presbyterian Medical Center provides data sharing links between two separate corporate entities, namely Columbia University Medical School and The Presbyterian Hospital, using a network-based architecture. Multiple database servers with heterogeneous user authentication protocols are linked to this network. "One-stop information shopping" implies one log-on procedure per session, not separate log-on and log-off procedures for each server or application used during a session. These circumstances provide challenges at the policy and technical levels to data security at the network level and insuring smooth information access for end users of these network-based services. Five activities being conducted as part of our security project are described: (1) policy development; (2) an authentication server for the network; (3) Kerberos as a tool for providing mutual authentication, encryption, and time stamping of authentication messages; (4) a prototype interface using Kerberos services to authenticate users accessing a network database server; and (5) a Kerberized electronic signature.

Sailor: Maryland's Online Public Information Network. Sailor Network Assessment Final Report: Findings and Future Sailor Network Development.

ERIC Educational Resources Information Center

Bertot, John Carlo; McClure, Charles R.

This report describes the results of an assessment of Sailor, Maryland's Online Public Information Network, which provides statewide Internet connection to 100% of Maryland public libraries. The concept of a "statewide networked environment" includes information services, products, hardware and software, telecommunications…

78 FR 17418 - Rural Health Information Technology Network Development Grant

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-21

... Information Technology Network Development Grant AGENCY: Health Resources and Services Administration (HRSA...-competitive replacement award under the Rural Health Information Technology Network Development Grant (RHITND... relinquishing its fiduciary responsibilities for the Rural Health Information Technology Network Development...

Network Data: Statistical Theory and New Models

DTIC Science & Technology

2016-02-17

SECURITY CLASSIFICATION OF: During this period of review, Bin Yu worked on many thrusts of high-dimensional statistical theory and methodologies. Her...research covered a wide range of topics in statistics including analysis and methods for spectral clustering for sparse and structured networks...2,7,8,21], sparse modeling (e.g. Lasso) [4,10,11,17,18,19], statistical guarantees for the EM algorithm [3], statistical analysis of algorithm leveraging

Finite-block-length analysis in classical and quantum information theory.

PubMed

Hayashi, Masahito

2017-01-01

Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects.

Client-controlled case information: a general system theory perspective.

PubMed

Fitch, Dale

2004-07-01

The author proposes a model for client control of case information via the World Wide Web built on principles of general system theory. It incorporates the client into the design, resulting in an information structure that differs from traditional human services information-sharing practices. Referencing general system theory, the concepts of controller and controlled system, as well as entropy and negentropy, are applied to the information flow and autopoietic behavior as they relate to the boundary-maintaining functions of today's organizations. The author's conclusions synthesize general system theory and human services values to lay the foundation for an information-sharing framework for human services in the 21st century.

Coordination sequences and information spreading in small-world networks

NASA Astrophysics Data System (ADS)

Herrero, Carlos P.

2002-10-01

We study the spread of information in small-world networks generated from different d-dimensional regular lattices, with d=1, 2, and 3. With this purpose, we analyze by numerical simulations the behavior of the coordination sequence, e.g., the average number of sites C(n) that can be reached from a given node of the network in n steps along its bonds. For sufficiently large networks, we find an asymptotic behavior C(n)~ρn, with a constant ρ that depends on the network dimension d and on the rewiring probability p (which measures the disorder strength of a given network). A simple model of information spreading in these networks is studied, assuming that only a fraction q of the network sites are active. The number of active nodes reached in n steps has an asymptotic form λn, λ being a constant that depends on p and q, as well as on the dimension d of the underlying lattice. The information spreading presents two different regimes depending on the value of λ: For λ>1 the information propagates along the whole system, and for λ<1 the spreading is damped and the information remains confined in a limited region of the network. We discuss the connection of these results with site percolation in small-world networks.

78 FR 7797 - Homeland Security Information Network Advisory Committee (HSINAC)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-04

... DEPARTMENT OF HOMELAND SECURITY [Docket No. DHS-2013-0005] Homeland Security Information Network... Committee Meeting. SUMMARY: The Homeland Security Information Network Advisory Committee (HSIN AC) will meet... received by the (Homeland Security Information Network Advisory Committee), go to http://www.regulations...

Modeling of information diffusion in Twitter-like social networks under information overload.

PubMed

Li, Pei; Li, Wei; Wang, Hui; Zhang, Xin

2014-01-01

Due to the existence of information overload in social networks, it becomes increasingly difficult for users to find useful information according to their interests. This paper takes Twitter-like social networks into account and proposes models to characterize the process of information diffusion under information overload. Users are classified into different types according to their in-degrees and out-degrees, and user behaviors are generalized into two categories: generating and forwarding. View scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated by a given type user is adopted to characterize the information diffusion efficiency, which is calculated theoretically. To verify the accuracy of theoretical analysis results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of importance to understand the diffusion dynamics in social networks, and this analysis framework can be extended to consider more realistic situations.

Modeling of Information Diffusion in Twitter-Like Social Networks under Information Overload

PubMed Central

Li, Wei

2014-01-01

Due to the existence of information overload in social networks, it becomes increasingly difficult for users to find useful information according to their interests. This paper takes Twitter-like social networks into account and proposes models to characterize the process of information diffusion under information overload. Users are classified into different types according to their in-degrees and out-degrees, and user behaviors are generalized into two categories: generating and forwarding. View scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated by a given type user is adopted to characterize the information diffusion efficiency, which is calculated theoretically. To verify the accuracy of theoretical analysis results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of importance to understand the diffusion dynamics in social networks, and this analysis framework can be extended to consider more realistic situations. PMID:24795541

Transient response of nonlinear polymer networks: A kinetic theory

NASA Astrophysics Data System (ADS)

Vernerey, Franck J.

2018-06-01

Dynamic networks are found in a majority of natural materials, but also in engineering materials, such as entangled polymers and physically cross-linked gels. Owing to their transient bond dynamics, these networks display a rich class of behaviors, from elasticity, rheology, self-healing, or growth. Although classical theories in rheology and mechanics have enabled us to characterize these materials, there is still a gap in our understanding on how individuals (i.e., the mechanics of each building blocks and its connection with others) affect the emerging response of the network. In this work, we introduce an alternative way to think about these networks from a statistical point of view. More specifically, a network is seen as a collection of individual polymer chains connected by weak bonds that can associate and dissociate over time. From the knowledge of these individual chains (elasticity, transient attachment, and detachment events), we construct a statistical description of the population and derive an evolution equation of their distribution based on applied deformation and their local interactions. We specifically concentrate on nonlinear elastic response that follows from the strain stiffening response of individual chains of finite size. Upon appropriate averaging operations and using a mean field approximation, we show that the distribution can be replaced by a so-called chain distribution tensor that is used to determine important macroscopic measures such as stress, energy storage and dissipation in the network. Prediction of the kinetic theory are then explored against known experimental measurement of polymer responses under uniaxial loading. It is found that even under the simplest assumptions of force-independent chain kinetics, the model is able to reproduce complex time-dependent behaviors of rubber and self-healing supramolecular polymers.

Gossip in Random Networks

NASA Astrophysics Data System (ADS)

Malarz, K.; Szvetelszky, Z.; Szekf, B.; Kulakowski, K.

2006-11-01

We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erd{õ}s and Rényi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value pc, for which half of agents are informed, scales with the system size as N-gamma with gamma approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.

Information transfer in community structured multiplex networks

NASA Astrophysics Data System (ADS)

Solé Ribalta, Albert; Granell, Clara; Gómez, Sergio; Arenas, Alex

2015-08-01

The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

From information theory to quantitative description of steric effects.

PubMed

Alipour, Mojtaba; Safari, Zahra

2016-07-21

Immense efforts have been made in the literature to apply the information theory descriptors for investigating the electronic structure theory of various systems. In the present study, the information theoretic quantities, such as Fisher information, Shannon entropy, Onicescu information energy, and Ghosh-Berkowitz-Parr entropy, have been used to present a quantitative description for one of the most widely used concepts in chemistry, namely the steric effects. Taking the experimental steric scales for the different compounds as benchmark sets, there are reasonable linear relationships between the experimental scales of the steric effects and theoretical values of steric energies calculated from information theory functionals. Perusing the results obtained from the information theoretic quantities with the two representations of electron density and shape function, the Shannon entropy has the best performance for the purpose. On the one hand, the usefulness of considering the contributions of functional groups steric energies and geometries, and on the other hand, dissecting the effects of both global and local information measures simultaneously have also been explored. Furthermore, the utility of the information functionals for the description of steric effects in several chemical transformations, such as electrophilic and nucleophilic reactions and host-guest chemistry, has been analyzed. The functionals of information theory correlate remarkably with the stability of systems and experimental scales. Overall, these findings show that the information theoretic quantities can be introduced as quantitative measures of steric effects and provide further evidences of the quality of information theory toward helping theoreticians and experimentalists to interpret different problems in real systems.

Information Theory and the Earth's Density Distribution

NASA Technical Reports Server (NTRS)

Rubincam, D. P.

1979-01-01

An argument for using the information theory approach as an inference technique in solid earth geophysics. A spherically symmetric density distribution is derived as an example of the method. A simple model of the earth plus knowledge of its mass and moment of inertia lead to a density distribution which was surprisingly close to the optimum distribution. Future directions for the information theory approach in solid earth geophysics as well as its strengths and weaknesses are discussed.

Finite-block-length analysis in classical and quantum information theory

PubMed Central

HAYASHI, Masahito

2017-01-01

Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects. PMID:28302962

Information Theory in Biology after 18 Years

ERIC Educational Resources Information Center

Johnson, Horton A.

1970-01-01

Reviews applications of information theory to biology, concluding that they have not proved very useful. Suggests modifications and extensions to increase the biological relevance of the theory, and speculates about applications in quantifying cell proliferation, chemical homeostasis and aging. (EB)

Client-Controlled Case Information: A General System Theory Perspective

ERIC Educational Resources Information Center

Fitch, Dale

2004-01-01

The author proposes a model for client control of case information via the World Wide Web built on principles of general system theory. It incorporates the client into the design, resulting in an information structure that differs from traditional human services information-sharing practices. Referencing general system theory, the concepts of…

Implications of Information Theory for Computational Modeling of Schizophrenia

PubMed Central

Wibral, Michael; Phillips, William A.

2017-01-01

Information theory provides a formal framework within which information processing and its disorders can be described. However, information theory has rarely been applied to modeling aspects of the cognitive neuroscience of schizophrenia. The goal of this article is to highlight the benefits of an approach based on information theory, including its recent extensions, for understanding several disrupted neural goal functions as well as related cognitive and symptomatic phenomena in schizophrenia. We begin by demonstrating that foundational concepts from information theory—such as Shannon information, entropy, data compression, block coding, and strategies to increase the signal-to-noise ratio—can be used to provide novel understandings of cognitive impairments in schizophrenia and metrics to evaluate their integrity. We then describe more recent developments in information theory, including the concepts of infomax, coherent infomax, and coding with synergy, to demonstrate how these can be used to develop computational models of schizophrenia-related failures in the tuning of sensory neurons, gain control, perceptual organization, thought organization, selective attention, context processing, predictive coding, and cognitive control. Throughout, we demonstrate how disordered mechanisms may explain both perceptual/cognitive changes and symptom emergence in schizophrenia. Finally, we demonstrate that there is consistency between some information-theoretic concepts and recent discoveries in neurobiology, especially involving the existence of distinct sites for the accumulation of driving input and contextual information prior to their interaction. This convergence can be used to guide future theory, experiment, and treatment development. PMID:29601053

Applied Actant Network Theory: Toward the Automated Detection of Technoscientific Emergence from Full Text Publications and Patents (Open Access)

DTIC Science & Technology

2012-11-02

Applied Actant-Network Theory: Toward the Automated Detection of Technoscientific Emergence from Full-Text Publications and Patents David C...Brock**, Olga Babko-Malaya*, James Pustejovsky***, Patrick Thomas****, *BAE Systems Advanced Information Technologies, ** David C. Brock Consulting... Wojick , D. 2008. Population modeling of the emergence and development of scientific fields. Scientometrics, 75(3):495–518. Cook, T. D. and

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

NASA Astrophysics Data System (ADS)

Mazzoli, M.; Sánchez, A.

2017-11-01

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has addressed this issue by combining the physics of complex networks with a description of interactions in terms of evolutionary game theory. We here take this research a step further by introducing a most salient societal factor such as the individuals’ preferences, a characteristic that is key to understanding much of the social phenomenology these days. We consider a heterogeneous, agent-based model in which agents interact strategically with their neighbors, but their preferences and payoffs for the possible actions differ. We study how such a heterogeneous network behaves under evolutionary dynamics and different strategic interactions, namely coordination games and best shot games. With this model we study the emergence of the equilibria predicted analytically in random graphs under best response dynamics, and we extend this test to unexplored contexts like proportional imitation and scale free networks. We show that some theoretically predicted equilibria do not arise in simulations with incomplete information, and we demonstrate the importance of the graph topology and the payoff function parameters for some games. Finally, we discuss our results with the available experimental evidence on coordination games, showing that our model agrees better with the experiment than standard economic theories, and draw hints as to how to maximize social efficiency in situations of conflicting preferences.

Econophysics: from Game Theory and Information Theory to Quantum Mechanics

NASA Astrophysics Data System (ADS)

Jimenez, Edward; Moya, Douglas

2005-03-01

Rationality is the universal invariant among human behavior, universe physical laws and ordered and complex biological systems. Econophysics isboth the use of physical concepts in Finance and Economics, and the use of Information Economics in Physics. In special, we will show that it is possible to obtain the Quantum Mechanics principles using Information and Game Theory.

Information Processing Theory and Conceptual Development.

ERIC Educational Resources Information Center

Schroder, H. M.

An educational program based upon information processing theory has been developed at Southern Illinois University. The integrating theme was the development of conceptual ability for coping with social and personal problems. It utilized student information search and concept formation as foundations for discussion and judgment and was organized…

Functional Organization of the Action Observation Network in Autism: A Graph Theory Approach.

PubMed

Alaerts, Kaat; Geerlings, Franca; Herremans, Lynn; Swinnen, Stephan P; Verhoeven, Judith; Sunaert, Stefan; Wenderoth, Nicole

2015-01-01

The ability to recognize, understand and interpret other's actions and emotions has been linked to the mirror system or action-observation-network (AON). Although variations in these abilities are prevalent in the neuro-typical population, persons diagnosed with autism spectrum disorders (ASD) have deficits in the social domain and exhibit alterations in this neural network. Here, we examined functional network properties of the AON using graph theory measures and region-to-region functional connectivity analyses of resting-state fMRI-data from adolescents and young adults with ASD and typical controls (TC). Overall, our graph theory analyses provided convergent evidence that the network integrity of the AON is altered in ASD, and that reductions in network efficiency relate to reductions in overall network density (i.e., decreased overall connection strength). Compared to TC, individuals with ASD showed significant reductions in network efficiency and increased shortest path lengths and centrality. Importantly, when adjusting for overall differences in network density between ASD and TC groups, participants with ASD continued to display reductions in network integrity, suggesting that also network-level organizational properties of the AON are altered in ASD. While differences in empirical connectivity contributed to reductions in network integrity, graph theoretical analyses provided indications that also changes in the high-level network organization reduced integrity of the AON.

Functional Organization of the Action Observation Network in Autism: A Graph Theory Approach

PubMed Central

Alaerts, Kaat; Geerlings, Franca; Herremans, Lynn; Swinnen, Stephan P.; Verhoeven, Judith; Sunaert, Stefan; Wenderoth, Nicole

2015-01-01

Background The ability to recognize, understand and interpret other’s actions and emotions has been linked to the mirror system or action-observation-network (AON). Although variations in these abilities are prevalent in the neuro-typical population, persons diagnosed with autism spectrum disorders (ASD) have deficits in the social domain and exhibit alterations in this neural network. Method Here, we examined functional network properties of the AON using graph theory measures and region-to-region functional connectivity analyses of resting-state fMRI-data from adolescents and young adults with ASD and typical controls (TC). Results Overall, our graph theory analyses provided convergent evidence that the network integrity of the AON is altered in ASD, and that reductions in network efficiency relate to reductions in overall network density (i.e., decreased overall connection strength). Compared to TC, individuals with ASD showed significant reductions in network efficiency and increased shortest path lengths and centrality. Importantly, when adjusting for overall differences in network density between ASD and TC groups, participants with ASD continued to display reductions in network integrity, suggesting that also network-level organizational properties of the AON are altered in ASD. Conclusion While differences in empirical connectivity contributed to reductions in network integrity, graph theoretical analyses provided indications that also changes in the high-level network organization reduced integrity of the AON. PMID:26317222

Geographic information modeling of Econet of Northwestern Federal District territory on graph theory basis

NASA Astrophysics Data System (ADS)

Kopylova, N. S.; Bykova, A. A.; Beregovoy, D. N.

2018-05-01

Based on the landscape-geographical approach, a structural and logical scheme for the Northwestern Federal District Econet has been developed, which can be integrated into the federal and world ecological network in order to improve the environmental infrastructure of the region. The method of Northwestern Federal District Econet organization on the basis of graph theory by means of the Quantum GIS geographic information system is proposed as an effective mean of preserving and recreating the unique biodiversity of landscapes, regulation of the sphere of environmental protection.

Self-Organized Information Processing in Neuronal Networks: Replacing Layers in Deep Networks by Dynamics

NASA Astrophysics Data System (ADS)

Kirst, Christoph

It is astonishing how the sub-parts of a brain co-act to produce coherent behavior. What are mechanism that coordinate information processing and communication and how can those be changed flexibly in order to cope with variable contexts? Here we show that when information is encoded in the deviations around a collective dynamical reference state of a recurrent network the propagation of these fluctuations is strongly dependent on precisely this underlying reference. Information here 'surfs' on top of the collective dynamics and switching between states enables fast and flexible rerouting of information. This in turn affects local processing and consequently changes in the global reference dynamics that re-regulate the distribution of information. This provides a generic mechanism for self-organized information processing as we demonstrate with an oscillatory Hopfield network that performs contextual pattern recognition. Deep neural networks have proven to be very successful recently. Here we show that generating information channels via collective reference dynamics can effectively compress a deep multi-layer architecture into a single layer making this mechanism a promising candidate for the organization of information processing in biological neuronal networks.

The Social Side of Information Networking.

ERIC Educational Resources Information Center

Katz, James E.

1997-01-01

Explores the social issues, including manners, security, crime (fraud), and social control associated with information networking, with emphasis on the Internet. Also addresses the influence of cellular phones, the Internet and other information technologies on society. (GR)

Comment on Gallistel: behavior theory and information theory: some parallels.

PubMed

Nevin, John A

2012-05-01

In this article, Gallistel proposes information theory as an approach to some enduring problems in the study of operant and classical conditioning. Copyright © 2012 Elsevier B.V. All rights reserved.

Tufts academic health information network: concept and scenario.

PubMed

Stearns, N S

1986-04-01

Tufts University School of Medicine's new health sciences education building, the Arthur M. Sackler Center for Health Communications, will house a modern medical library and computer center, classrooms, auditoria, and media facilities. The building will also serve as the center for an information and communication network linking the medical school and adjacent New England Medical Center, Tufts' primary teaching hospital, with Tufts Associated Teaching Hospitals throughout New England. Ultimately, the Tufts network will join other gateway networks, information resource facilities, health care institutions, and medical schools throughout the world. The center and the network are intended to facilitate and improve the education of health professionals, the delivery of health care to patients, the conduct of research, and the implementation of administrative management approaches that should provide more efficient utilization of resources and save dollars. A model and scenario show how health care delivery and health care education are integrated through better use of information transfer technologies by health information specialists, practitioners, and educators.

Tufts academic health information network: concept and scenario.

PubMed Central

Stearns, N S

1986-01-01

Tufts University School of Medicine's new health sciences education building, the Arthur M. Sackler Center for Health Communications, will house a modern medical library and computer center, classrooms, auditoria, and media facilities. The building will also serve as the center for an information and communication network linking the medical school and adjacent New England Medical Center, Tufts' primary teaching hospital, with Tufts Associated Teaching Hospitals throughout New England. Ultimately, the Tufts network will join other gateway networks, information resource facilities, health care institutions, and medical schools throughout the world. The center and the network are intended to facilitate and improve the education of health professionals, the delivery of health care to patients, the conduct of research, and the implementation of administrative management approaches that should provide more efficient utilization of resources and save dollars. A model and scenario show how health care delivery and health care education are integrated through better use of information transfer technologies by health information specialists, practitioners, and educators. PMID:3708191

Extraction of business relationships in supply networks using statistical learning theory.

PubMed

Zuo, Yi; Kajikawa, Yuya; Mori, Junichiro

2016-06-01

Supply chain management represents one of the most important scientific streams of operations research. The supply of energy, materials, products, and services involves millions of transactions conducted among national and local business enterprises. To deliver efficient and effective support for supply chain design and management, structural analyses and predictive models of customer-supplier relationships are expected to clarify current enterprise business conditions and to help enterprises identify innovative business partners for future success. This article presents the outcomes of a recent structural investigation concerning a supply network in the central area of Japan. We investigated the effectiveness of statistical learning theory to express the individual differences of a supply chain of enterprises within a certain business community using social network analysis. In the experiments, we employ support vector machine to train a customer-supplier relationship model on one of the main communities extracted from a supply network in the central area of Japan. The prediction results reveal an F-value of approximately 70% when the model is built by using network-based features, and an F-value of approximately 77% when the model is built by using attribute-based features. When we build the model based on both, F-values are improved to approximately 82%. The results of this research can help to dispel the implicit design space concerning customer-supplier relationships, which can be explored and refined from detailed topological information provided by network structures rather than from traditional and attribute-related enterprise profiles. We also investigate and discuss differences in the predictive accuracy of the model for different sizes of enterprises and types of business communities.

Network Information System

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

1996-05-01

The Network Information System (NWIS) was initially implemented in May 1996 as a system in which computing devices could be recorded so that unique names could be generated for each device. Since then the system has grown to be an enterprise wide information system which is integrated with other systems to provide the seamless flow of data through the enterprise. The system Iracks data for two main entities: people and computing devices. The following are the type of functions performed by NWIS for these two entities: People Provides source information to the enterprise person data repository for select contractors andmore » visitors Generates and tracks unique usernames and Unix user IDs for every individual granted cyber access Tracks accounts for centrally managed computing resources, and monitors and controls the reauthorization of the accounts in accordance with the DOE mandated interval Computing Devices Generates unique names for all computing devices registered in the system Tracks the following information for each computing device: manufacturer, make, model, Sandia property number, vendor serial number, operating system and operating system version, owner, device location, amount of memory, amount of disk space, and level of support provided for the machine Tracks the hardware address for network cards Tracks the P address registered to computing devices along with the canonical and alias names for each address Updates the Dynamic Domain Name Service (DDNS) for canonical and alias names Creates the configuration files for DHCP to control the DHCP ranges and allow access to only properly registered computers Tracks and monitors classified security plans for stand-alone computers Tracks the configuration requirements used to setup the machine Tracks the roles people have on machines (system administrator, administrative access, user, etc...) Allows systems administrators to track changes made on the machine (both hardware and software) Generates an

ASIST 2001: Information in a Networked World--Harnessing the Flow. Proceedings of the ASIST Annual Meeting (64th, Washington, DC, November 3-8, 2001).

ERIC Educational Resources Information Center

Aversa, Elizabeth, Ed.; Manley, Cynthia, Ed.

The theme of the 2001 "ASIST" (American Society for Information Science and Technology) annual conference is "Information in a Networked World," which covers a broad range of theory and practice in information science. The program includes 52 refereed papers, 46 SIG and panel sessions, and 33 poster presentations. Topics include: digital…

Spatial analysis of bus transport networks using network theory

NASA Astrophysics Data System (ADS)

Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong

2018-07-01

In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison

Running a network on a shoestring: the Global Invasive Species Information Network

USGS Publications Warehouse

Jarnevich, Catherine S.; Simpson, Annie; Graham, James J; Newman, Gregory J.; Bargeron, Chuck T.

2015-01-01

The Global Invasive Species Information Network (GISIN) was conceptualized in 2004 to aggregate and disseminate invasive species data in a standardized way. A decade later the GISIN community has implemented a data portal and three of six GISIN data aggregation models in the GISIN data exchange Protocol, including invasive species status information, resource URLs, and occurrence data. The portal is based on a protocol developed by representatives from 15 countries and 27 organizations of the global invasive species information management community. The GISIN has 19 data providers sharing 34,343 species status records, 1,693,073 occurrences, and 15,601 resource URLs. While the GISIN's goal is to be global, much of its data and funding are provided by the United States. Several initiatives use the GISIN as their information backbone, such as the Great Lakes Early Detection Network (GLEDN) and the North American Invasive Species Network (NAISN). Here we share several success stories and organizational challenges that remain.

International School Health Network: an informal network for advocacy and knowledge exchange.

PubMed

McCall, Douglas S; Rootman, Irving; Bayley, Dale

2005-01-01

In Canada, researchers, policy-makers and non-governmental organisations have re-conceptualized the school setting as being an ecological entity, linked to parallel ecologies of the homes and the community it serves. The school, public health and other systems that seek to deliver programs in that setting are open, loosely coupled and bureaucratic. This reconceived view of the school as a setting for health promotion leads to an emphasis on building organizational, system, professional and community capacity. One of the most effective ways of building such capacities when resources are scarce is to invest in a variety of formal and informal networks that can sustain themselves with little or no external resources. A number of recognised researchers from the health and education sectors have emphasized this systems-based approach and the need to build supportive, small-scale networks or learning communities. In recent health promotion research, networking at various levels, across sectors and within communities is viewed as a key strategy within new, more effective health promotion strategies. In education, the notion of networking for educational change has been described as "learning communities" for continuous school improvement. The authors suggest that this strategy of networking be used at the international level to address several global challenges: There is no single, convenient way to obtain basic information about the status and nature of national and state/provincial school health programs around the world. There is no global research agenda in school health promotion, despite the obvious value of sharing such research and knowledge. There is no global mechanism to facilitate the development of common or shared tools for surveillance of child/youth health and monitoring of school health policies and programs, despite the excellent work being done in individual countries and by the European Network of Health Promoting Schools. There is no international

Extracting spatial information from networks with low-order eigenvectors

NASA Astrophysics Data System (ADS)

Cucuringu, Mihai; Blondel, Vincent D.; Van Dooren, Paul

2013-03-01

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low-order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower-order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

How Fast Can Networks Synchronize? A Random Matrix Theory Approach

NASA Astrophysics Data System (ADS)

Timme, Marc; Wolf, Fred; Geisel, Theo

2004-03-01

Pulse-coupled oscillators constitute a paradigmatic class of dynamical systems interacting on networks because they model a variety of biological systems including flashing fireflies and chirping crickets as well as pacemaker cells of the heart and neural networks. Synchronization is one of the most simple and most prevailing kinds of collective dynamics on such networks. Here we study collective synchronization [1] of pulse-coupled oscillators interacting on asymmetric random networks. Using random matrix theory we analytically determine the speed of synchronization in such networks in dependence on the dynamical and network parameters [2]. The speed of synchronization increases with increasing coupling strengths. Surprisingly, however, it stays finite even for infinitely strong interactions. The results indicate that the speed of synchronization is limited by the connectivity of the network. We discuss the relevance of our findings to general equilibration processes on complex networks. [5mm] [1] M. Timme, F. Wolf, T. Geisel, Phys. Rev. Lett. 89:258701 (2002). [2] M. Timme, F. Wolf, T. Geisel, cond-mat/0306512 (2003).

Theory of liquid crystal elastomers and polymer networks : Connection between neoclassical theory and differential geometry.

PubMed

Nguyen, Thanh-Son; Selinger, Jonathan V

2017-09-01

In liquid crystal elastomers and polymer networks, the orientational order of liquid crystals is coupled with elastic distortions of crosslinked polymers. Previous theoretical research has described these materials through two different approaches: a neoclassical theory based on the liquid crystal director and the deformation gradient tensor, and a geometric elasticity theory based on the difference between the actual metric tensor and a reference metric. Here, we connect those two approaches using a formalism based on differential geometry. Through this connection, we determine how both the director and the geometry respond to a change of temperature.

Adaptive capacity of geographical clusters: Complexity science and network theory approach

NASA Astrophysics Data System (ADS)

Albino, Vito; Carbonara, Nunzia; Giannoccaro, Ilaria

This paper deals with the adaptive capacity of geographical clusters (GCs), that is a relevant topic in the literature. To address this topic, GC is considered as a complex adaptive system (CAS). Three theoretical propositions concerning the GC adaptive capacity are formulated by using complexity theory. First, we identify three main properties of CAS s that affect the adaptive capacity, namely the interconnectivity, the heterogeneity, and the level of control, and define how the value of these properties influence the adaptive capacity. Then, we associate these properties with specific GC characteristics so obtaining the key conditions of GCs that give them the adaptive capacity so assuring their competitive advantage. To test these theoretical propositions, a case study on two real GCs is carried out. The considered GCs are modeled as networks where firms are nodes and inter-firms relationships are links. Heterogeneity, interconnectivity, and level of control are considered as network properties and thus measured by using the methods of the network theory.

Stimulus information stored in lasting active and hidden network states is destroyed by network bursts

PubMed Central

Dranias, Mark R.; Westover, M. Brandon; Cash, Sidney; VanDongen, Antonius M. J.

2015-01-01

In both humans and animals brief synchronizing bursts of epileptiform activity known as interictal epileptiform discharges (IEDs) can, even in the absence of overt seizures, cause transient cognitive impairments (TCI) that include problems with perception or short-term memory. While no evidence from single units is available, it has been assumed that IEDs destroy information represented in neuronal networks. Cultured neuronal networks are a model for generic cortical microcircuits, and their spontaneous activity is characterized by the presence of synchronized network bursts (SNBs), which share a number of properties with IEDs, including the high degree of synchronization and their spontaneous occurrence in the absence of an external stimulus. As a model approach to understanding the processes underlying IEDs, optogenetic stimulation and multielectrode array (MEA) recordings of cultured neuronal networks were used to study whether stimulus information represented in these networks survives SNBs. When such networks are optically stimulated they encode and maintain stimulus information for as long as one second. Experiments involved recording the network response to a single stimulus and trials where two different stimuli were presented sequentially, akin to a paired pulse trial. We broke the sequential stimulus trials into encoding, delay and readout phases and found that regardless of which phase the SNB occurs, stimulus-specific information was impaired. SNBs were observed to increase the mean network firing rate, but this did not translate monotonically into increases in network entropy. It was found that the more excitable a network, the more stereotyped its response was during a network burst. These measurements speak to whether SNBs are capable of transmitting information in addition to blocking it. These results are consistent with previous reports and provide baseline predictions concerning the neural mechanisms by which IEDs might cause TCI. PMID:25755638

Information theory, spectral geometry, and quantum gravity.

PubMed

Kempf, Achim; Martin, Robert

2008-01-18

We show that there exists a deep link between the two disciplines of information theory and spectral geometry. This allows us to obtain new results on a well-known quantum gravity motivated natural ultraviolet cutoff which describes an upper bound on the spatial density of information. Concretely, we show that, together with an infrared cutoff, this natural ultraviolet cutoff beautifully reduces the path integral of quantum field theory on curved space to a finite number of ordinary integrations. We then show, in particular, that the subsequent removal of the infrared cutoff is safe.

Florida Information Resource Network.

ERIC Educational Resources Information Center

Watson, Francis C.

1986-01-01

The Florida Information Resource Network (FIRN) is an effort by the Florida education community and the Florida Legislature to provide an electronic link among all agencies, institutions, and schools in the public education system. The communications link, perhaps one of the most advanced in the nation, has three purposes: (1) to provide equal…

Study on Network Error Analysis and Locating based on Integrated Information Decision System

NASA Astrophysics Data System (ADS)

Yang, F.; Dong, Z. H.

2017-10-01

Integrated information decision system (IIDS) integrates multiple sub-system developed by many facilities, including almost hundred kinds of software, which provides with various services, such as email, short messages, drawing and sharing. Because the under-layer protocols are different, user standards are not unified, many errors are occurred during the stages of setup, configuration, and operation, which seriously affect the usage. Because the errors are various, which may be happened in different operation phases, stages, TCP/IP communication protocol layers, sub-system software, it is necessary to design a network error analysis and locating tool for IIDS to solve the above problems. This paper studies on network error analysis and locating based on IIDS, which provides strong theory and technology supports for the running and communicating of IIDS.

Game Theory for Wireless Sensor Networks: A Survey

PubMed Central

Shi, Hai-Yan; Wang, Wan-Liang; Kwok, Ngai-Ming; Chen, Sheng-Yong

2012-01-01

Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field. PMID:23012533

Functional neural networks of honesty and dishonesty in children: Evidence from graph theory analysis.

PubMed

Ding, Xiao Pan; Wu, Si Jia; Liu, Jiangang; Fu, Genyue; Lee, Kang

2017-09-21

The present study examined how different brain regions interact with each other during spontaneous honest vs. dishonest communication. More specifically, we took a complex network approach based on the graph-theory to analyze neural response data when children are spontaneously engaged in honest or dishonest acts. Fifty-nine right-handed children between 7 and 12 years of age participated in the study. They lied or told the truth out of their own volition. We found that lying decreased both the global and local efficiencies of children's functional neural network. This finding, for the first time, suggests that lying disrupts the efficiency of children's cortical network functioning. Further, it suggests that the graph theory based network analysis is a viable approach to study the neural development of deception.

Information Theory - The Bridge Connecting Bounded Rational Game Theory and Statistical Physics

NASA Technical Reports Server (NTRS)

Wolpert, David H.

2005-01-01

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality of all red-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. This paper shows that the same information theoretic mathematical structure, known as Product Distribution (PD) theory, addresses both issues. In this, PD theory not only provides a principle formulation of bounded rationality and a set of new types of mean field theory in statistical physics; it also shows that those topics are fundamentally one and the same.

Mutual information-based LPI optimisation for radar network

NASA Astrophysics Data System (ADS)

Shi, Chenguang; Zhou, Jianjiang; Wang, Fei; Chen, Jun

2015-07-01

Radar network can offer significant performance improvement for target detection and information extraction employing spatial diversity. For a fixed number of radars, the achievable mutual information (MI) for estimating the target parameters may extend beyond a predefined threshold with full power transmission. In this paper, an effective low probability of intercept (LPI) optimisation algorithm is presented to improve LPI performance for radar network. Based on radar network system model, we first provide Schleher intercept factor for radar network as an optimisation metric for LPI performance. Then, a novel LPI optimisation algorithm is presented, where for a predefined MI threshold, Schleher intercept factor for radar network is minimised by optimising the transmission power allocation among radars in the network such that the enhanced LPI performance for radar network can be achieved. The genetic algorithm based on nonlinear programming (GA-NP) is employed to solve the resulting nonconvex and nonlinear optimisation problem. Some simulations demonstrate that the proposed algorithm is valuable and effective to improve the LPI performance for radar network.

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory

PubMed Central

Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors’ long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests. PMID:27218468

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory.

PubMed

Xing, Lizhi; Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors' long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests.

Elastic Network Models For Biomolecular Dynamics: Theory and Application to Membrane Proteins and Viruses

NASA Astrophysics Data System (ADS)

Lezon, Timothy R.; Shrivastava, Indira H.; Yang, Zheng; Bahar, Ivet

The following sections are included: * Introduction * Theory and Assumptions * Statistical mechanical foundations * Anisotropic network models * Gaussian network model * Rigid block models * Treatment of perturbations * Langevin dynamics * Applications * Membrane proteins * Viruses * Conclusion * References

Actor-Network Theory and methodology: Just what does it mean to say that nonhumans have agency?

PubMed

Sayes, Edwin

2014-02-01

Actor-Network Theory is a controversial social theory. In no respect is this more so than the role it 'gives' to nonhumans: nonhumans have agency, as Latour provocatively puts it. This article aims to interrogate the multiple layers of this declaration to understand what it means to assert with Actor-Network Theory that nonhumans exercise agency. The article surveys a wide corpus of statements by the position's leading figures and emphasizes the wider methodological framework in which these statements are embedded. With this work done, readers will then be better placed to reject or accept the Actor-Network position - understanding more precisely what exactly it is at stake in this decision.

78 FR 34665 - Homeland Security Information Network Advisory Committee (HSINAC); Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-10

... DEPARTMENT OF HOMELAND SECURITY [DHS-2013-0037] Homeland Security Information Network Advisory... Committee Meeting. SUMMARY: The Homeland Security Information Network Advisory Committee (HSINAC) will meet... posted beforehand at this link: http://www.dhs.gov/homeland-security-information-network-advisory...

Information Exchange Between Resilient and High-Threat Networks: Techniques for Threat Mitigation

DTIC Science & Technology

2004-11-01

Information Exchange between Resilient and High-Threat Networks : Techniques for Threat Mitigation Tim Dean and Graham Wyatt QinetiQ...SUMMARY High resilience military networks frequently have requirements for exchange of information with networks of low assurance, including networks of...assured, two-way, information flow between high resilience networks and other networks of unknown threat. The techniques include conventional and

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks.

PubMed

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A

2016-10-26

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called "Collective Influence (CI)" has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes' significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct "virtual" information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes' importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

Relay-based information broadcast in complex networks

NASA Astrophysics Data System (ADS)

Fan, Zhongyan; Han, Zeyu; Tang, Wallace K. S.; Lin, Dong

2018-04-01

Information broadcast (IB) is a critical process in complex network, usually accomplished by flooding mechanism. Although flooding is simple and no prior topological information is required, it consumes a lot of transmission overhead. Another extreme is the tree-based broadcast (TB), for which information is disseminated via a spanning tree. It achieves the minimal transmission overhead but the maintenance of spanning tree for every node is an obvious obstacle for implementation. Motivated by the success of scale-free network models for real-world networks, in this paper, we investigate the issues in IB by considering an alternative solution in-between these two extremes. A novel relay-based broadcast (RB) mechanism is proposed by employing a subset of nodes as relays. Information is firstly forwarded to one of these relays and then re-disseminated to others through the spanning tree whose root is the relay. This mechanism provides a trade-off solution between flooding and TB. On one hand, it saves up a lot of transmission overhead as compared to flooding; on the other hand, it costs much less resource for maintenance than TB as only a few spanning trees are needed. Based on two major criteria, namely the transmission overhead and the convergence time, the effectiveness of RB is confirmed. The impacts of relay assignment and network structures on performance are also studied in this work.

Resistance and Security Index of Networks: Structural Information Perspective of Network Security

NASA Astrophysics Data System (ADS)

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-06-01

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

Resistance and Security Index of Networks: Structural Information Perspective of Network Security.

PubMed

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-06-03

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks.

Resistance and Security Index of Networks: Structural Information Perspective of Network Security

PubMed Central

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-01-01

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks. PMID:27255783

Enhancing topology adaptation in information-sharing social networks

NASA Astrophysics Data System (ADS)

Cimini, Giulio; Chen, Duanbing; Medo, Matúš; Lü, Linyuan; Zhang, Yi-Cheng; Zhou, Tao

2012-04-01

The advent of the Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. It has thus become important to address issues like who gets followed and how to allow people to discover new and better information sources. In this paper we conduct an empirical analysis of different online social networking sites and draw inspiration from its results to present different source selection strategies in an adaptive model for social recommendation. We show that local search rules which enhance the typical topological features of real social communities give rise to network configurations that are globally optimal. These rules create networks which are effective in information diffusion and resemble structures resulting from real social systems.

Analysis of Computer Network Information Based on "Big Data"

NASA Astrophysics Data System (ADS)

Li, Tianli

2017-11-01

With the development of the current era, computer network and large data gradually become part of the people's life, people use the computer to provide convenience for their own life, but at the same time there are many network information problems has to pay attention. This paper analyzes the information security of computer network based on "big data" analysis, and puts forward some solutions.

Complex Network Theory Applied to the Growth of Kuala Lumpur's Public Urban Rail Transit Network.

PubMed

Ding, Rui; Ujang, Norsidah; Hamid, Hussain Bin; Wu, Jianjun

2015-01-01

Recently, the number of studies involving complex network applications in transportation has increased steadily as scholars from various fields analyze traffic networks. Nonetheless, research on rail network growth is relatively rare. This research examines the evolution of the Public Urban Rail Transit Networks of Kuala Lumpur (PURTNoKL) based on complex network theory and covers both the topological structure of the rail system and future trends in network growth. In addition, network performance when facing different attack strategies is also assessed. Three topological network characteristics are considered: connections, clustering and centrality. In PURTNoKL, we found that the total number of nodes and edges exhibit a linear relationship and that the average degree stays within the interval [2.0488, 2.6774] with heavy-tailed distributions. The evolutionary process shows that the cumulative probability distribution (CPD) of degree and the average shortest path length show good fit with exponential distribution and normal distribution, respectively. Moreover, PURTNoKL exhibits clear cluster characteristics; most of the nodes have a 2-core value, and the CPDs of the centrality's closeness and betweenness follow a normal distribution function and an exponential distribution, respectively. Finally, we discuss four different types of network growth styles and the line extension process, which reveal that the rail network's growth is likely based on the nodes with the biggest lengths of the shortest path and that network protection should emphasize those nodes with the largest degrees and the highest betweenness values. This research may enhance the networkability of the rail system and better shape the future growth of public rail networks.

The Value of Information in Distributed Decision Networks

DTIC Science & Technology

2016-03-04

formulation, and then we describe the various results at- tained. 1 Mathematical description of Distributed Decision Network un- der Information...Constraints We now define a mathematical framework for networks. Let G = (V,E) be an undirected random network (graph) drawn from a known distribution pG, 1

An integrated multimedia medical information network system.

PubMed

Yamamoto, K; Makino, J; Sasagawa, N; Nagira, M

1998-01-01

An integrated multimedia medical information network system at Shimane Medical university has been developed to organize medical information generated from each section and provide information services useful for education, research and clinical practice. The report describes the outline of our system. It is designed to serve as a distributed database for electronic medical records and images. We are developing the MML engine that is to be linked to the world wide web (WWW) network system. To the users, this system will present an integrated multimedia representation of the patient records, providing access to both the image and text-based data required for an effective clinical decision making and medical education.

Child Rights Information Network Newsletter, 1996.

ERIC Educational Resources Information Center

Purbrick, Becky, Ed.

1996-01-01

These two newsletter issues communicate activities of the newly formed Child Rights Information Network (CRIN) and report on emerging information resources and activities concerning children and child rights. The January 1996 issue describes the history of CRIN, provides updates on the activities of projects linked to CRIN, and summarizes…

Child Rights Information Network Newsletter, 1997.

ERIC Educational Resources Information Center

Purbrick, Becky, Ed.

1997-01-01

These three newsletter issues communicate activities of the Child Rights Information Network (CRIN) and report on information resources and worldwide activities concerning children and child rights. The January 1997 issue profiles CRIN members in Costa Rica, Tanzania, Germany, and Switzerland; and provides updates on the activities of projects…

Multi-Modal Traveler Information System - Information Clearinghouse Final Network

DOT National Transportation Integrated Search

1997-07-23

This Working Paper will summarize the lessons learned from the initial implementation of the Information Clearinghouse and outline the proposed configuration and functional capabilities of the Final Network. In addition, all new users added since Mar...

Competition between Homophily and Information Entropy Maximization in Social Networks

PubMed Central

Zhao, Jichang; Liang, Xiao; Xu, Ke

2015-01-01

In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective. PMID:26334994

Putting Gino's lesson to work: Actor-network theory, enacted humanity, and rehabilitation.

PubMed

Abrams, Thomas; Gibson, Barbara E

2016-02-01

This article argues that rehabilitation enacts a particular understanding of "the human" throughout therapeutic assessment and treatment. Following Michel Callon and Vololona Rabeharisoa's "Gino's Lesson on Humanity," we suggest that this is not simply a top-down process, but is cultivated in the application and response to biomedical frameworks of human ability, competence, and responsibility. The emergence of the human is at once a materially contingent, moral, and interpersonal process. We begin the article by outlining the basics of the actor-network theory that underpins "Gino's Lesson on Humanity." Next, we elucidate its central thesis regarding how disabled personhood emerges through actor-network interactions. Section "Learning Gino's lesson" draws on two autobiographical examples, examining the emergence of humanity through rehabilitation, particularly assessment measures and the responses to them. We conclude by thinking about how rehabilitation and actor-network theory might take this lesson on humanity seriously. © The Author(s) 2016.

Optimization of flow modeling in fractured media with discrete fracture network via percolation theory

NASA Astrophysics Data System (ADS)

Donado-Garzon, L. D.; Pardo, Y.

2013-12-01

Fractured media are very heterogeneous systems where occur complex physical and chemical processes to model. One of the possible approaches to conceptualize this type of massifs is the Discrete Fracture Network (DFN). Donado et al., modeled flow and transport in a granitic batholith based on this approach and found good fitting with hydraulic and tracer tests, but the computational cost was excessive due to a gigantic amount of elements to model. We present in this work a methodology based on percolation theory for reducing the number of elements and in consequence, to reduce the bandwidth of the conductance matrix and the execution time of each network. DFN poses as an excellent representation of all the set of fractures of the media, but not all the fractures of the media are part of the conductive network. Percolation theory is used to identify which nodes or fractures are not conductive, based on the occupation probability or percolation threshold. In a fractured system, connectivity determines the flow pattern in the fractured rock mass. This volume of fluid is driven through connection paths formed by the fractures, when the permeability of the rock is negligible compared to the fractures. In a population of distributed fractures, each of this that has no intersection with any connected fracture do not contribute to generate a flow field. This algorithm also permits us to erase these elements however they are water conducting and hence, refine even more the backbone of the network. We used 100 different generations of DFN that were optimized in this study using percolation theory. In each of the networks calibrate hydrodynamic parameters as hydraulic conductivity and specific storage coefficient, for each of the five families of fractures, yielding a total of 10 parameters to estimate, at each generation. Since the effects of the distribution of fault orientation changes the value of the percolation threshold, but not the universal laws of classical

Information and the War against Terrorism.

ERIC Educational Resources Information Center

Strickland, Lee S.

2002-01-01

Considers the effectiveness of information and information theory as tools in the war against terrorism following the September 11 attacks, as well as the legal and political authority for their covert use. Topics include understanding the elements of an information network; and using organizational theory to disrupt the target information…

Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics

NASA Astrophysics Data System (ADS)

Rangan, Aaditya V.; Cai, David; Tao, Louis

2007-02-01

Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions - with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton's iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton's iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarse-grained dynamical properties of

Understanding cancer complexome using networks, spectral graph theory and multilayer framework

NASA Astrophysics Data System (ADS)

Rai, Aparna; Pradhan, Priodyuti; Nagraj, Jyothi; Lohitesh, K.; Chowdhury, Rajdeep; Jalan, Sarika

2017-02-01

Cancer complexome comprises a heterogeneous and multifactorial milieu that varies in cytology, physiology, signaling mechanisms and response to therapy. The combined framework of network theory and spectral graph theory along with the multilayer analysis provides a comprehensive approach to analyze the proteomic data of seven different cancers, namely, breast, oral, ovarian, cervical, lung, colon and prostate. Our analysis demonstrates that the protein-protein interaction networks of the normal and the cancerous tissues associated with the seven cancers have overall similar structural and spectral properties. However, few of these properties implicate unsystematic changes from the normal to the disease networks depicting difference in the interactions and highlighting changes in the complexity of different cancers. Importantly, analysis of common proteins of all the cancer networks reveals few proteins namely the sensors, which not only occupy significant position in all the layers but also have direct involvement in causing cancer. The prediction and analysis of miRNAs targeting these sensor proteins hint towards the possible role of these proteins in tumorigenesis. This novel approach helps in understanding cancer at the fundamental level and provides a clue to develop promising and nascent concept of single drug therapy for multiple diseases as well as personalized medicine.

Understanding cancer complexome using networks, spectral graph theory and multilayer framework.

PubMed

Rai, Aparna; Pradhan, Priodyuti; Nagraj, Jyothi; Lohitesh, K; Chowdhury, Rajdeep; Jalan, Sarika

2017-02-03

Cancer complexome comprises a heterogeneous and multifactorial milieu that varies in cytology, physiology, signaling mechanisms and response to therapy. The combined framework of network theory and spectral graph theory along with the multilayer analysis provides a comprehensive approach to analyze the proteomic data of seven different cancers, namely, breast, oral, ovarian, cervical, lung, colon and prostate. Our analysis demonstrates that the protein-protein interaction networks of the normal and the cancerous tissues associated with the seven cancers have overall similar structural and spectral properties. However, few of these properties implicate unsystematic changes from the normal to the disease networks depicting difference in the interactions and highlighting changes in the complexity of different cancers. Importantly, analysis of common proteins of all the cancer networks reveals few proteins namely the sensors, which not only occupy significant position in all the layers but also have direct involvement in causing cancer. The prediction and analysis of miRNAs targeting these sensor proteins hint towards the possible role of these proteins in tumorigenesis. This novel approach helps in understanding cancer at the fundamental level and provides a clue to develop promising and nascent concept of single drug therapy for multiple diseases as well as personalized medicine.

Maximally informative pairwise interactions in networks

PubMed Central

Fitzgerald, Jeffrey D.; Sharpee, Tatyana O.

2010-01-01

Several types of biological networks have recently been shown to be accurately described by a maximum entropy model with pairwise interactions, also known as the Ising model. Here we present an approach for finding the optimal mappings between input signals and network states that allow the network to convey the maximal information about input signals drawn from a given distribution. This mapping also produces a set of linear equations for calculating the optimal Ising-model coupling constants, as well as geometric properties that indicate the applicability of the pairwise Ising model. We show that the optimal pairwise interactions are on average zero for Gaussian and uniformly distributed inputs, whereas they are nonzero for inputs approximating those in natural environments. These nonzero network interactions are predicted to increase in strength as the noise in the response functions of each network node increases. This approach also suggests ways for how interactions with unmeasured parts of the network can be inferred from the parameters of response functions for the measured network nodes. PMID:19905153

Illuminating a plant’s tissue-specific metabolic diversity using computational metabolomics and information theory

PubMed Central

Li, Dapeng; Heiling, Sven; Baldwin, Ian T.

2016-01-01

Secondary metabolite diversity is considered an important fitness determinant for plants’ biotic and abiotic interactions in nature. This diversity can be examined in two dimensions. The first one considers metabolite diversity across plant species. A second way of looking at this diversity is by considering the tissue-specific localization of pathways underlying secondary metabolism within a plant. Although these cross-tissue metabolite variations are increasingly regarded as important readouts of tissue-level gene function and regulatory processes, they have rarely been comprehensively explored by nontargeted metabolomics. As such, important questions have remained superficially addressed. For instance, which tissues exhibit prevalent signatures of metabolic specialization? Reciprocally, which metabolites contribute most to this tissue specialization in contrast to those metabolites exhibiting housekeeping characteristics? Here, we explore tissue-level metabolic specialization in Nicotiana attenuata, an ecological model with rich secondary metabolism, by combining tissue-wide nontargeted mass spectral data acquisition, information theory analysis, and tandem MS (MS/MS) molecular networks. This analysis was conducted for two different methanolic extracts of 14 tissues and deconvoluted 895 nonredundant MS/MS spectra. Using information theory analysis, anthers were found to harbor the most specialized metabolome, and most unique metabolites of anthers and other tissues were annotated through MS/MS molecular networks. Tissue–metabolite association maps were used to predict tissue-specific gene functions. Predictions for the function of two UDP-glycosyltransferases in flavonoid metabolism were confirmed by virus-induced gene silencing. The present workflow allows biologists to amortize the vast amount of data produced by modern MS instrumentation in their quest to understand gene function. PMID:27821729

Design of surface-water data networks for regional information

USGS Publications Warehouse

Moss, Marshall E.; Gilroy, E.J.; Tasker, Gary D.; Karlinger, M.R.

1982-01-01

This report describes a technique, Network Analysis of Regional Information (NARI), and the existing computer procedures that have been developed for the specification of the regional information-cost relation for several statistical parameters of streamflow. The measure of information used is the true standard error of estimate of a regional logarithmic regression. The cost is a function of the number of stations at which hydrologic data are collected and the number of years for which the data are collected. The technique can be used to obtain either (1) a minimum cost network that will attain a prespecified accuracy and reliability or (2) a network that maximizes information given a set of budgetary and time constraints.

Understanding information exchange during disaster response: Methodological insights from infocentric analysis

Treesearch

Toddi A. Steelman; Branda Nowell; Deena Bayoumi; Sarah McCaffrey

2014-01-01

We leverage economic theory, network theory, and social network analytical techniques to bring greater conceptual and methodological rigor to understand how information is exchanged during disasters. We ask, "How can information relationships be evaluated more systematically during a disaster response?" "Infocentric analysis"—a term and...

A DNA network as an information processing system.

PubMed

Santini, Cristina Costa; Bath, Jonathan; Turberfield, Andrew J; Tyrrell, Andy M

2012-01-01

Biomolecular systems that can process information are sought for computational applications, because of their potential for parallelism and miniaturization and because their biocompatibility also makes them suitable for future biomedical applications. DNA has been used to design machines, motors, finite automata, logic gates, reaction networks and logic programs, amongst many other structures and dynamic behaviours. Here we design and program a synthetic DNA network to implement computational paradigms abstracted from cellular regulatory networks. These show information processing properties that are desirable in artificial, engineered molecular systems, including robustness of the output in relation to different sources of variation. We show the results of numerical simulations of the dynamic behaviour of the network and preliminary experimental analysis of its main components.

Models, Entropy and Information of Temporal Social Networks

NASA Astrophysics Data System (ADS)

Zhao, Kun; Karsai, Márton; Bianconi, Ginestra

Temporal social networks are characterized by heterogeneous duration of contacts, which can either follow a power-law distribution, such as in face-to-face interactions, or a Weibull distribution, such as in mobile-phone communication. Here we model the dynamics of face-to-face interaction and mobile phone communication by a reinforcement dynamics, which explains the data observed in these different types of social interactions. We quantify the information encoded in the dynamics of these networks by the entropy of temporal networks. Finally, we show evidence that human dynamics is able to modulate the information present in social network dynamics when it follows circadian rhythms and when it is interfacing with a new technology such as the mobile-phone communication technology.

Mutual information, neural networks and the renormalization group

NASA Astrophysics Data System (ADS)

Koch-Janusz, Maciej; Ringel, Zohar

2018-06-01

Physical systems differing in their microscopic details often display strikingly similar behaviour when probed at macroscopic scales. Those universal properties, largely determining their physical characteristics, are revealed by the powerful renormalization group (RG) procedure, which systematically retains `slow' degrees of freedom and integrates out the rest. However, the important degrees of freedom may be difficult to identify. Here we demonstrate a machine-learning algorithm capable of identifying the relevant degrees of freedom and executing RG steps iteratively without any prior knowledge about the system. We introduce an artificial neural network based on a model-independent, information-theoretic characterization of a real-space RG procedure, which performs this task. We apply the algorithm to classical statistical physics problems in one and two dimensions. We demonstrate RG flow and extract the Ising critical exponent. Our results demonstrate that machine-learning techniques can extract abstract physical concepts and consequently become an integral part of theory- and model-building.

Some characteristics of supernetworks based on unified hybrid network theory framework

NASA Astrophysics Data System (ADS)

Liu, Qiang; Fang, Jin-Qing; Li, Yong

Comparing with single complex networks, supernetworks are more close to the real world in some ways, and have become the newest research hot spot in the network science recently. Some progresses have been made in the research of supernetworks, but the theoretical research method and complex network characteristics of supernetwork models are still needed to further explore. In this paper, we propose three kinds of supernetwork models with three layers based on the unified hybrid network theory framework (UHNTF), and introduce preferential and random linking, respectively, between the upper and lower layers. Then we compared the topological characteristics of the single networks with the supernetwork models. In order to analyze the influence of the interlayer edges on network characteristics, the cross-degree is defined as a new important parameter. Then some interesting new phenomena are found, the results imply this supernetwork model has reference value and application potential.

Applying Information Processing Theory to Supervision: An Initial Exploration

ERIC Educational Resources Information Center

Tangen, Jodi L.; Borders, L. DiAnne

2017-01-01

Although clinical supervision is an educational endeavor (Borders & Brown, [Borders, L. D., 2005]), many scholars neglect theories of learning in working with supervisees. The authors describe 1 learning theory--information processing theory (Atkinson & Shiffrin, 1968, 1971; Schunk, 2016)--and the ways its associated interventions may…

Blending Formal and Informal Learning Networks for Online Learning

ERIC Educational Resources Information Center

Czerkawski, Betül C.

2016-01-01

With the emergence of social software and the advance of web-based technologies, online learning networks provide invaluable opportunities for learning, whether formal or informal. Unlike top-down, instructor-centered, and carefully planned formal learning settings, informal learning networks offer more bottom-up, student-centered participatory…

Effect of Heterogeneous Interest Similarity on the Spread of Information in Mobile Social Networks

NASA Astrophysics Data System (ADS)

Zhao, Narisa; Sui, Guoqin; Yang, Fan

2018-06-01

Mobile social networks (MSNs) are important platforms for spreading news. The fact that individuals usually forward information aligned with their own interests inevitably changes the dynamics of information spread. Thereby, first we present a theoretical model based on the discrete Markov chain and mean field theory to evaluate the effect of interest similarity on the information spread in MSNs. Meanwhile, individuals' interests are heterogeneous and vary with time. These two features result in interest shift behavior, and both features are considered in our model. A leveraging simulation demonstrates the accuracy of our model. Moreover, the basic reproduction number R0 is determined. Further extensive numerical analyses based on the model indicate that interest similarity has a critical impact on information spread at the early spreading stage. Specifically, the information always spreads more quickly and widely if the interest similarity between an individual and the information is higher. Finally, five actual data sets from Sina Weibo illustrate the validity of the model.

Exploring a social network for sharing information about pain.

PubMed

Alvarez, Ana Graziela; Dal Sasso, Grace T Marcon

2012-01-01

The purpose of study was to evaluate the opinion of users about the experience of sharing information about pain in a social network. An electronic survey study was conducted from September to November/2009. Nine participants assessed the social network through of an electronic questionnaire. positive aspects (easy access, organized information, interactivity, encourages the sharing of information, learning opportunity). The sharing of information contributes to the development of a collective intelligence based on exchanging experiences and knowledge sharing.

Assessing the Robustness of Graph Statistics for Network Analysis Under Incomplete Information

DTIC Science & Technology

strategy for dismantling these networks based on their network structure. However, these strategies typically assume complete information about the...combat them with missing information . This thesis analyzes the performance of a variety of network statistics in the context of incomplete information by...leveraging simulation to remove nodes and edges from networks and evaluating the effect this missing information has on our ability to accurately

Should the model for risk-informed regulation be game theory rather than decision theory?

PubMed

Bier, Vicki M; Lin, Shi-Woei

2013-02-01

Risk analysts frequently view the regulation of risks as being largely a matter of decision theory. According to this view, risk analysis methods provide information on the likelihood and severity of various possible outcomes; this information should then be assessed using a decision-theoretic approach (such as cost/benefit analysis) to determine whether the risks are acceptable, and whether additional regulation is warranted. However, this view ignores the fact that in many industries (particularly industries that are technologically sophisticated and employ specialized risk and safety experts), risk analyses may be done by regulated firms, not by the regulator. Moreover, those firms may have more knowledge about the levels of safety at their own facilities than the regulator does. This creates a situation in which the regulated firm has both the opportunity-and often also the motive-to provide inaccurate (in particular, favorably biased) risk information to the regulator, and hence the regulator has reason to doubt the accuracy of the risk information provided by regulated parties. Researchers have argued that decision theory is capable of dealing with many such strategic interactions as well as game theory can. This is especially true in two-player, two-stage games in which the follower has a unique best strategy in response to the leader's strategy, as appears to be the case in the situation analyzed in this article. However, even in such cases, we agree with Cox that game-theoretic methods and concepts can still be useful. In particular, the tools of mechanism design, and especially the revelation principle, can simplify the analysis of such games because the revelation principle provides rigorous assurance that it is sufficient to analyze only games in which licensees truthfully report their risk levels, making the problem more manageable. Without that, it would generally be necessary to consider much more complicated forms of strategic behavior (including

Incorporating profile information in community detection for online social networks

NASA Astrophysics Data System (ADS)

Fan, W.; Yeung, K. H.

2014-07-01

Community structure is an important feature in the study of complex networks. It is because nodes of the same community may have similar properties. In this paper we extend two popular community detection methods to partition online social networks. In our extended methods, the profile information of users is used for partitioning. We apply the extended methods in several sample networks of Facebook. Compared with the original methods, the community structures we obtain have higher modularity. Our results indicate that users' profile information is consistent with the community structure of their friendship network to some extent. To the best of our knowledge, this paper is the first to discuss how profile information can be used to improve community detection in online social networks.

Enabling information management systems in tactical network environments

NASA Astrophysics Data System (ADS)

Carvalho, Marco; Uszok, Andrzej; Suri, Niranjan; Bradshaw, Jeffrey M.; Ceccio, Philip J.; Hanna, James P.; Sinclair, Asher

2009-05-01

Net-Centric Information Management (IM) and sharing in tactical environments promises to revolutionize forward command and control capabilities by providing ubiquitous shared situational awareness to the warfighter. This vision can be realized by leveraging the tactical and Mobile Ad hoc Networks (MANET) which provide the underlying communications infrastructure, but, significant technical challenges remain. Enabling information management in these highly dynamic environments will require multiple support services and protocols which are affected by, and highly dependent on, the underlying capabilities and dynamics of the tactical network infrastructure. In this paper we investigate, discuss, and evaluate the effects of realistic tactical and mobile communications network environments on mission-critical information management systems. We motivate our discussion by introducing the Advanced Information Management System (AIMS) which is targeted for deployment in tactical sensor systems. We present some operational requirements for AIMS and highlight how critical IM support services such as discovery, transport, federation, and Quality of Service (QoS) management are necessary to meet these requirements. Our goal is to provide a qualitative analysis of the impact of underlying assumptions of availability and performance of some of the critical services supporting tactical information management. We will also propose and describe a number of technologies and capabilities that have been developed to address these challenges, providing alternative approaches for transport, service discovery, and federation services for tactical networks.

Using Bayesian networks to support decision-focused information retrieval

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

Lehner, P.; Elsaesser, C.; Seligman, L.

This paper has described an approach to controlling the process of pulling data/information from distributed data bases in a way that is specific to a persons specific decision making context. Our prototype implementation of this approach uses a knowledge-based planner to generate a plan, an automatically constructed Bayesian network to evaluate the plan, specialized processing of the network to derive key information items that would substantially impact the evaluation of the plan (e.g., determine that replanning is needed), automated construction of Standing Requests for Information (SRIs) which are automated functions that monitor changes and trends in distributed data base thatmore » are relevant to the key information items. This emphasis of this paper is on how Bayesian networks are used.« less

The Role of the Australian Open Learning Information Network.

ERIC Educational Resources Information Center

Bishop, Robin; And Others

Three documents are presented which describe the Australian Open Learning Information Network (AOLIN)--a national, independent, and self-supporting network of educational researchers with a common interest in the use of information technology for open and distance education--and discuss two evaluative studies undertaken by the organization. The…

The Philosophy of Information as an Underlying and Unifying Theory of Information Science

ERIC Educational Resources Information Center

Tomic, Taeda

2010-01-01

Introduction: Philosophical analyses of theoretical principles underlying these sub-domains reveal philosophy of information as underlying meta-theory of information science. Method: Conceptual research on the knowledge sub-domains in information science and philosophy and analysis of their mutual connection. Analysis: Similarities between…

Optimal Phase Oscillatory Network

NASA Astrophysics Data System (ADS)

Follmann, Rosangela

2013-03-01

Important topics as preventive detection of epidemics, collective self-organization, information flow and systemic robustness in clusters are typical examples of processes that can be studied in the context of the theory of complex networks. It is an emerging theory in a field, which has recently attracted much interest, involving the synchronization of dynamical systems associated to nodes, or vertices, of the network. Studies have shown that synchronization in oscillatory networks depends not only on the individual dynamics of each element, but also on the combination of the topology of the connections as well as on the properties of the interactions of these elements. Moreover, the response of the network to small damages, caused at strategic points, can enhance the global performance of the whole network. In this presentation we explore an optimal phase oscillatory network altered by an additional term in the coupling function. The application to associative-memory network shows improvement on the correct information retrieval as well as increase of the storage capacity. The inclusion of some small deviations on the nodes, when solutions are attracted to a false state, results in additional enhancement of the performance of the associative-memory network. Supported by FAPESP - Sao Paulo Research Foundation, grant number 2012/12555-4

Value of Information and Prospect theory as tools to involve decision-makers in water-related design, operation and planning of water systems

NASA Astrophysics Data System (ADS)

Alfonso, Leonardo

2013-04-01

The role of decision-makers is to take the outputs from hydrological and hydraulic analyses and, in some extent, use them as inputs to make decisions that are related to planning, design and operation of water systems. However, the use of these technical analyses is frequently limited, since there are other non-hydrological issues that must be considered, that may end up in very different solutions than those envisaged by the purely technical ones. A possibility to account for the nature of the human decisions under uncertainty is by exploring the use of concepts from decision theory and behavioural economics, such as Value of Information and Prospect Theory and embed them into the methodologies we use in the hydrology practice. Three examples are presented to illustrate these multidisciplinary interactions. The first one, for monitoring network design, uses Value of Information within a methodology to locate water level stations in a complex canal of networks in the Netherlands. The second example, for operation, shows how the Value of Information concept can be used to formulate alternative methods to evaluate flood risk according to the set of options available for decision-making during a flood event. The third example, for planning, uses Prospect Theory concepts to understand how the "losses hurt more than gains feel good" effect can determine the final decision of urbanise or not a flood-prone area. It is demonstrated that decision theory and behavioural economic principles are promising to evaluate the complex decision-making process in water-related issues.

Geosciences Information Network (GIN): A modular, distributed, interoperable data network for the geosciences

NASA Astrophysics Data System (ADS)

Allison, M.; Gundersen, L. C.; Richard, S. M.; Dickinson, T. L.

2008-12-01

A coalition of the state geological surveys (AASG), the U.S. Geological Survey (USGS), and partners will receive NSF funding over 3 years under the INTEROP solicitation to start building the Geoscience Information Network (www.geoinformatics.info/gin) a distributed, interoperable data network. The GIN project will develop standardized services to link existing and in-progress components using a few standards and protocols, and work with data providers to implement these services. The key components of this network are 1) catalog system(s) for data discovery; 2) service definitions for interfaces for searching catalogs and accessing resources; 3) shared interchange formats to encode information for transmission (e.g. various XML markup languages); 4) data providers that publish information using standardized services defined by the network; and 5) client applications adapted to use information resources provided by the network. The GIN will integrate and use catalog resources that currently exist or are in development. We are working with the USGS National Geologic Map Database's existing map catalog, with the USGS National Geological and Geophysical Data Preservation Program, which is developing a metadata catalog (National Digital Catalog) for geoscience information resource discovery, and with the GEON catalog. Existing interchange formats will be used, such as GeoSciML, ChemML, and Open Geospatial Consortium sensor, observation and measurement MLs. Client application development will be fostered by collaboration with industry and academic partners. The GIN project will focus on the remaining aspects of the system -- service definitions and assistance to data providers to implement the services and bring content online - and on system integration of the modules. Initial formal collaborators include the OneGeology-Europe consortium of 27 nations that is building a comparable network under the EU INSPIRE initiative, GEON, Earthchem, and GIS software company ESRI

Information Filtering on Coupled Social Networks

PubMed Central

Nie, Da-Cheng; Zhang, Zi-Ke; Zhou, Jun-Lin; Fu, Yan; Zhang, Kui

2014-01-01

In this paper, based on the coupled social networks (CSN), we propose a hybrid algorithm to nonlinearly integrate both social and behavior information of online users. Filtering algorithm, based on the coupled social networks, considers the effects of both social similarity and personalized preference. Experimental results based on two real datasets, Epinions and Friendfeed, show that the hybrid pattern can not only provide more accurate recommendations, but also enlarge the recommendation coverage while adopting global metric. Further empirical analyses demonstrate that the mutual reinforcement and rich-club phenomenon can also be found in coupled social networks where the identical individuals occupy the core position of the online system. This work may shed some light on the in-depth understanding of the structure and function of coupled social networks. PMID:25003525

Information filtering on coupled social networks.

PubMed

Nie, Da-Cheng; Zhang, Zi-Ke; Zhou, Jun-Lin; Fu, Yan; Zhang, Kui

2014-01-01

In this paper, based on the coupled social networks (CSN), we propose a hybrid algorithm to nonlinearly integrate both social and behavior information of online users. Filtering algorithm, based on the coupled social networks, considers the effects of both social similarity and personalized preference. Experimental results based on two real datasets, Epinions and Friendfeed, show that the hybrid pattern can not only provide more accurate recommendations, but also enlarge the recommendation coverage while adopting global metric. Further empirical analyses demonstrate that the mutual reinforcement and rich-club phenomenon can also be found in coupled social networks where the identical individuals occupy the core position of the online system. This work may shed some light on the in-depth understanding of the structure and function of coupled social networks.

Information Theoretic Characterization of Physical Theories with Projective State Space

NASA Astrophysics Data System (ADS)

Zaopo, Marco

2015-08-01

Probabilistic theories are a natural framework to investigate the foundations of quantum theory and possible alternative or deeper theories. In a generic probabilistic theory, states of a physical system are represented as vectors of outcomes probabilities and state spaces are convex cones. In this picture the physics of a given theory is related to the geometric shape of the cone of states. In quantum theory, for instance, the shape of the cone of states corresponds to a projective space over complex numbers. In this paper we investigate geometric constraints on the state space of a generic theory imposed by the following information theoretic requirements: every non completely mixed state of a system is perfectly distinguishable from some other state in a single shot measurement; information capacity of physical systems is conserved under making mixtures of states. These assumptions guarantee that a generic physical system satisfies a natural principle asserting that the more a state of the system is mixed the less information can be stored in the system using that state as logical value. We show that all theories satisfying the above assumptions are such that the shape of their cones of states is that of a projective space over a generic field of numbers. Remarkably, these theories constitute generalizations of quantum theory where superposition principle holds with coefficients pertaining to a generic field of numbers in place of complex numbers. If the field of numbers is trivial and contains only one element we obtain classical theory. This result tells that superposition principle is quite common among probabilistic theories while its absence gives evidence of either classical theory or an implausible theory.

Driving the brain towards creativity and intelligence: A network control theory analysis.

PubMed

Kenett, Yoed N; Medaglia, John D; Beaty, Roger E; Chen, Qunlin; Betzel, Richard F; Thompson-Schill, Sharon L; Qiu, Jiang

2018-01-04

High-level cognitive constructs, such as creativity and intelligence, entail complex and multiple processes, including cognitive control processes. Recent neurocognitive research on these constructs highlight the importance of dynamic interaction across neural network systems and the role of cognitive control processes in guiding such a dynamic interaction. How can we quantitatively examine the extent and ways in which cognitive control contributes to creativity and intelligence? To address this question, we apply a computational network control theory (NCT) approach to structural brain imaging data acquired via diffusion tensor imaging in a large sample of participants, to examine how NCT relates to individual differences in distinct measures of creative ability and intelligence. Recent application of this theory at the neural level is built on a model of brain dynamics, which mathematically models patterns of inter-region activity propagated along the structure of an underlying network. The strength of this approach is its ability to characterize the potential role of each brain region in regulating whole-brain network function based on its anatomical fingerprint and a simplified model of node dynamics. We find that intelligence is related to the ability to "drive" the brain system into easy to reach neural states by the right inferior parietal lobe and lower integration abilities in the left retrosplenial cortex. We also find that creativity is related to the ability to "drive" the brain system into difficult to reach states by the right dorsolateral prefrontal cortex (inferior frontal junction) and higher integration abilities in sensorimotor areas. Furthermore, we found that different facets of creativity-fluency, flexibility, and originality-relate to generally similar but not identical network controllability processes. We relate our findings to general theories on intelligence and creativity. Copyright © 2018 Elsevier Ltd. All rights reserved.

Thermodynamical transcription of density functional theory with minimum Fisher information

NASA Astrophysics Data System (ADS)

Nagy, Á.

2018-03-01

Ghosh, Berkowitz and Parr designed a thermodynamical transcription of the ground-state density functional theory and introduced a local temperature that varies from point to point. The theory, however, is not unique because the kinetic energy density is not uniquely defined. Here we derive the expression of the phase-space Fisher information in the GBP theory taking the inverse temperature as the Fisher parameter. It is proved that this Fisher information takes its minimum for the case of constant temperature. This result is consistent with the recently proven theorem that the phase-space Shannon information entropy attains its maximum at constant temperature.

Network marketing with bounded rationality and partial information

NASA Astrophysics Data System (ADS)

Kiet, Hoang Anh Tuan; Kim, Beom Jun

2008-08-01

Network marketing has been proposed and used as a way to spread the product information to consumers through social connections. We extend the previous game model of the network marketing on a small-world tree network and propose two games: In the first model with the bounded rationality, each consumer makes purchase decision stochastically, while in the second model, consumers get only partial information due to the finite length of social connections. Via extensive numerical simulations, we find that as the rationality is enhanced not only the consumer surplus but also the firm’s profit is increased. The implication of our results is also discussed.

The system of technical diagnostics of the industrial safety information network

NASA Astrophysics Data System (ADS)

Repp, P. V.

2017-01-01

This research is devoted to problems of safety of the industrial information network. Basic sub-networks, ensuring reliable operation of the elements of the industrial Automatic Process Control System, were identified. The core tasks of technical diagnostics of industrial information safety were presented. The structure of the technical diagnostics system of the information safety was proposed. It includes two parts: a generator of cyber-attacks and the virtual model of the enterprise information network. The virtual model was obtained by scanning a real enterprise network. A new classification of cyber-attacks was proposed. This classification enables one to design an efficient generator of cyber-attacks sets for testing the virtual modes of the industrial information network. The numerical method of the Monte Carlo (with LPτ - sequences of Sobol), and Markov chain was considered as the design method for the cyber-attacks generation algorithm. The proposed system also includes a diagnostic analyzer, performing expert functions. As an integrative quantitative indicator of the network reliability the stability factor (Kstab) was selected. This factor is determined by the weight of sets of cyber-attacks, identifying the vulnerability of the network. The weight depends on the frequency and complexity of cyber-attacks, the degree of damage, complexity of remediation. The proposed Kstab is an effective integral quantitative measure of the information network reliability.

Information Systems at Enterprise. Design of Secure Network of Enterprise

NASA Astrophysics Data System (ADS)

Saigushev, N. Y.; Mikhailova, U. V.; Vedeneeva, O. A.; Tsaran, A. A.

2018-05-01

No enterprise and company can do without designing its own corporate network in today's information society. It accelerates and facilitates the work of employees at any level, but contains a big threat to confidential information of the company. In addition to the data theft attackers, there are plenty of information threats posed by modern malware effects. In this regard, the computational security of corporate networks is an important component of modern information technologies of computer security for any enterprise. This article says about the design of the protected corporate network of the enterprise that provides the computers on the network access to the Internet, as well interoperability with the branch. The access speed to the Internet at a high level is provided through the use of high-speed access channels and load balancing between devices. The security of the designed network is performed through the use of VLAN technology as well as access lists and AAA server.

78 FR 71631 - Committee Name: Homeland Security Information Network Advisory Committee (HSINAC)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-29

... Network Advisory Committee (HSINAC) AGENCY: Operation Coordination and Planning/Office of Chief.... SUMMARY: The Homeland Security Information Network Advisory Council (HSINAC) will meet December 17, 2013... , Phone: 202-343-4212. SUPPLEMENTARY INFORMATION: The Homeland Security Information Network Advisory...

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

NASA Astrophysics Data System (ADS)

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-10-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

PubMed Central

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-01-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community. PMID:27782207

INfORM: Inference of NetwOrk Response Modules.

PubMed

Marwah, Veer Singh; Kinaret, Pia Anneli Sofia; Serra, Angela; Scala, Giovanni; Lauerma, Antti; Fortino, Vittorio; Greco, Dario

2018-06-15

Detecting and interpreting responsive modules from gene expression data by using network-based approaches is a common but laborious task. It often requires the application of several computational methods implemented in different software packages, forcing biologists to compile complex analytical pipelines. Here we introduce INfORM (Inference of NetwOrk Response Modules), an R shiny application that enables non-expert users to detect, evaluate and select gene modules with high statistical and biological significance. INfORM is a comprehensive tool for the identification of biologically meaningful response modules from consensus gene networks inferred by using multiple algorithms. It is accessible through an intuitive graphical user interface allowing for a level of abstraction from the computational steps. INfORM is freely available for academic use at https://github.com/Greco-Lab/INfORM. Supplementary data are available at Bioinformatics online.

Combining a dispersal model with network theory to assess habitat connectivity.

PubMed

Lookingbill, Todd R; Gardner, Robert H; Ferrari, Joseph R; Keller, Cherry E

2010-03-01

Assessing the potential for threatened species to persist and spread within fragmented landscapes requires the identification of core areas that can sustain resident populations and dispersal corridors that can link these core areas with isolated patches of remnant habitat. We developed a set of GIS tools, simulation methods, and network analysis procedures to assess potential landscape connectivity for the Delmarva fox squirrel (DFS; Sciurus niger cinereus), an endangered species inhabiting forested areas on the Delmarva Peninsula, USA. Information on the DFS's life history and dispersal characteristics, together with data on the composition and configuration of land cover on the peninsula, were used as input data for an individual-based model to simulate dispersal patterns of millions of squirrels. Simulation results were then assessed using methods from graph theory, which quantifies habitat attributes associated with local and global connectivity. Several bottlenecks to dispersal were identified that were not apparent from simple distance-based metrics, highlighting specific locations for landscape conservation, restoration, and/or squirrel translocations. Our approach links simulation models, network analysis, and available field data in an efficient and general manner, making these methods useful and appropriate for assessing the movement dynamics of threatened species within landscapes being altered by human and natural disturbances.

Network-based machine learning and graph theory algorithms for precision oncology.

PubMed

Zhang, Wei; Chien, Jeremy; Yong, Jeongsik; Kuang, Rui

2017-01-01

Network-based analytics plays an increasingly important role in precision oncology. Growing evidence in recent studies suggests that cancer can be better understood through mutated or dysregulated pathways or networks rather than individual mutations and that the efficacy of repositioned drugs can be inferred from disease modules in molecular networks. This article reviews network-based machine learning and graph theory algorithms for integrative analysis of personal genomic data and biomedical knowledge bases to identify tumor-specific molecular mechanisms, candidate targets and repositioned drugs for personalized treatment. The review focuses on the algorithmic design and mathematical formulation of these methods to facilitate applications and implementations of network-based analysis in the practice of precision oncology. We review the methods applied in three scenarios to integrate genomic data and network models in different analysis pipelines, and we examine three categories of network-based approaches for repositioning drugs in drug-disease-gene networks. In addition, we perform a comprehensive subnetwork/pathway analysis of mutations in 31 cancer genome projects in the Cancer Genome Atlas and present a detailed case study on ovarian cancer. Finally, we discuss interesting observations, potential pitfalls and future directions in network-based precision oncology.

Securing Information with Complex Optical Encryption Networks

DTIC Science & Technology

2015-08-11

Network Security, Network Vulnerability , Multi-dimentional Processing, optoelectronic devices 16. SECURITY CLASSIFICATION OF: 17. LIMITATION... optoelectronic devices and systems should be analyzed before the retrieval, any hostile hacker will need to possess multi-disciplinary scientific...sophisticated optoelectronic principles and systems where he/she needs to process the information. However, in the military applications, most military

Information Security Analysis Using Game Theory and Simulation

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

Schlicher, Bob G; Abercrombie, Robert K

Information security analysis can be performed using game theory implemented in dynamic simulations of Agent Based Models (ABMs). Such simulations can be verified with the results from game theory analysis and further used to explore larger scale, real world scenarios involving multiple attackers, defenders, and information assets. Our approach addresses imperfect information and scalability that allows us to also address previous limitations of current stochastic game models. Such models only consider perfect information assuming that the defender is always able to detect attacks; assuming that the state transition probabilities are fixed before the game assuming that the players actions aremore » always synchronous; and that most models are not scalable with the size and complexity of systems under consideration. Our use of ABMs yields results of selected experiments that demonstrate our proposed approach and provides a quantitative measure for realistic information systems and their related security scenarios.« less

Scattering theory of efficient quantum transport across finite networks

NASA Astrophysics Data System (ADS)

Walschaers, Mattia; Mulet, Roberto; Buchleitner, Andreas

2017-11-01

We present a scattering theory for the efficient transmission of an excitation across a finite network with designed disorder. We show that the presence of randomly positioned network sites allows significant acceleration of the excitation transfer processes as compared to a dimer structure, but only if the disordered Hamiltonians are constrained to be centrosymmetric and exhibit a dominant doublet in their spectrum. We identify the cause of this efficiency enhancement to be the constructive interplay between disorder-induced fluctuations of the dominant doublet’s splitting and the coupling strength between the input and output sites to the scattering channels. We find that the characteristic strength of these fluctuations together with the channel coupling fully control the transfer efficiency.

47 CFR 64.2011 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 3 2011-10-01 2011-10-01 false Notification of customer proprietary network information security breaches. 64.2011 Section 64.2011 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Proprietary Network Information § 64.2011 Notification of customer proprietary network information security...

47 CFR 64.2011 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 3 2010-10-01 2010-10-01 false Notification of customer proprietary network information security breaches. 64.2011 Section 64.2011 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Proprietary Network Information § 64.2011 Notification of customer proprietary network information security...

47 CFR 64.2011 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Proprietary Network Information § 64.2011 Notification of customer proprietary network information security... 47 Telecommunication 3 2013-10-01 2013-10-01 false Notification of customer proprietary network information security breaches. 64.2011 Section 64.2011 Telecommunication FEDERAL COMMUNICATIONS COMMISSION...

47 CFR 64.5111 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Proprietary Network Information. § 64.5111 Notification of customer proprietary network information security... 47 Telecommunication 3 2013-10-01 2013-10-01 false Notification of customer proprietary network information security breaches. 64.5111 Section 64.5111 Telecommunication FEDERAL COMMUNICATIONS COMMISSION...

47 CFR 64.5111 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Proprietary Network Information. § 64.5111 Notification of customer proprietary network information security... 47 Telecommunication 3 2014-10-01 2014-10-01 false Notification of customer proprietary network information security breaches. 64.5111 Section 64.5111 Telecommunication FEDERAL COMMUNICATIONS COMMISSION...

47 CFR 64.2011 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Proprietary Network Information § 64.2011 Notification of customer proprietary network information security... 47 Telecommunication 3 2014-10-01 2014-10-01 false Notification of customer proprietary network information security breaches. 64.2011 Section 64.2011 Telecommunication FEDERAL COMMUNICATIONS COMMISSION...

47 CFR 64.2011 - Notification of customer proprietary network information security breaches.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Proprietary Network Information § 64.2011 Notification of customer proprietary network information security... 47 Telecommunication 3 2012-10-01 2012-10-01 false Notification of customer proprietary network information security breaches. 64.2011 Section 64.2011 Telecommunication FEDERAL COMMUNICATIONS COMMISSION...

Analysis of surface-water data network in Kansas for effectiveness in providing regional streamflow information; with a section on theory and application of generalized least squares

USGS Publications Warehouse

Medina, K.D.; Tasker, Gary D.

1987-01-01

This report documents the results of an analysis of the surface-water data network in Kansas for its effectiveness in providing regional streamflow information. The network was analyzed using generalized least squares regression. The correlation and time-sampling error of the streamflow characteristic are considered in the generalized least squares method. Unregulated medium-, low-, and high-flow characteristics were selected to be representative of the regional information that can be obtained from streamflow-gaging-station records for use in evaluating the effectiveness of continuing the present network stations, discontinuing some stations, and (or) adding new stations. The analysis used streamflow records for all currently operated stations that were not affected by regulation and for discontinued stations for which unregulated flow characteristics, as well as physical and climatic characteristics, were available. The State was divided into three network areas, western, northeastern, and southeastern Kansas, and analysis was made for the three streamflow characteristics in each area, using three planning horizons. The analysis showed that the maximum reduction of sampling mean-square error for each cost level could be obtained by adding new stations and discontinuing some current network stations. Large reductions in sampling mean-square error for low-flow information could be achieved in all three network areas, the reduction in western Kansas being the most dramatic. The addition of new stations would be most beneficial for mean-flow information in western Kansas. The reduction of sampling mean-square error for high-flow information would benefit most from the addition of new stations in western Kansas. Southeastern Kansas showed the smallest error reduction in high-flow information. A comparison among all three network areas indicated that funding resources could be most effectively used by discontinuing more stations in northeastern and southeastern Kansas

Social networks predict selective observation and information spread in ravens

PubMed Central

Rubenstein, Daniel I.; Bugnyar, Thomas; Hoppitt, William; Mikus, Nace; Schwab, Christine

2016-01-01

Animals are predicted to selectively observe and learn from the conspecifics with whom they share social connections. Yet, hardly anything is known about the role of different connections in observation and learning. To address the relationships between social connections, observation and learning, we investigated transmission of information in two raven (Corvus corax) groups. First, we quantified social connections in each group by constructing networks on affiliative interactions, aggressive interactions and proximity. We then seeded novel information by training one group member on a novel task and allowing others to observe. In each group, an observation network based on who observed whose task-solving behaviour was strongly correlated with networks based on affiliative interactions and proximity. Ravens with high social centrality (strength, eigenvector, information centrality) in the affiliative interaction network were also central in the observation network, possibly as a result of solving the task sooner. Network-based diffusion analysis revealed that the order that ravens first solved the task was best predicted by connections in the affiliative interaction network in a group of subadult ravens, and by social rank and kinship (which influenced affiliative interactions) in a group of juvenile ravens. Our results demonstrate that not all social connections are equally effective at predicting the patterns of selective observation and information transmission. PMID:27493780

Minimum energy information fusion in sensor networks

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

Chapline, G

1999-05-11

In this paper we consider how to organize the sharing of information in a distributed network of sensors and data processors so as to provide explanations for sensor readings with minimal expenditure of energy. We point out that the Minimum Description Length principle provides an approach to information fusion that is more naturally suited to energy minimization than traditional Bayesian approaches. In addition we show that for networks consisting of a large number of identical sensors Kohonen self-organization provides an exact solution to the problem of combing the sensor outputs into minimal description length explanations.

The Weight-control Information Network (WIN) | NIH MedlinePlus the Magazine

MedlinePlus

... Javascript on. Feature: Reducing Childhood Obesity The Weight-control Information Network (WIN) Past Issues / Spring - Summer 2010 ... overweight children, here are tips from the Weight-control Information Network (WIN), an information service of the ...

Scalable Hierarchical Network Management System for Displaying Network Information in Three Dimensions

NASA Technical Reports Server (NTRS)

George, Jude (Inventor); Schlecht, Leslie (Inventor); McCabe, James D. (Inventor); LeKashman, John Jr. (Inventor)

1998-01-01

A network management system has SNMP agents distributed at one or more sites, an input output module at each site, and a server module located at a selected site for communicating with input output modules, each of which is configured for both SNMP and HNMP communications. The server module is configured exclusively for HNMP communications, and it communicates with each input output module according to the HNMP. Non-iconified, informationally complete views are provided of network elements to aid in network management.

Information Retrieval on social network: An Adaptive Proof

NASA Astrophysics Data System (ADS)

Elveny, M.; Syah, R.; Elfida, M.; Nasution, M. K. M.

2018-01-01

Information Retrieval has become one of the areas for studying to get the trusty information, with which the recall and precision become the measurement form that represents it. Nevertheless, development in certain scientific fields make it possible to improve the performance of the Information Retrieval. In this case, through social networks whereby the role of social actor degrees plays a role. This is an implication of the query in which co-occurrence becomes an indication of social networks. An adaptive approach we use by involving this query in sequence to a stand-alone query, it has proven the relationship among them.

Towards Information Polycentricity Theory--Investigation of a Hospital Revenue Cycle

ERIC Educational Resources Information Center

Singh, Rajendra

2011-01-01

This research takes steps towards developing a new theory of organizational information management based on the ideas that, first, information creates ordering effects in transactions and, second, that there are multiple centers of authority in organizations. The rationale for developing this theory is the empirical observation that hospitals have…

Extension of analog network coding in wireless information exchange

NASA Astrophysics Data System (ADS)

Chen, Cheng; Huang, Jiaqing

2012-01-01

Ever since the concept of analog network coding(ANC) was put forward by S.Katti, much attention has been focused on how to utilize analog network coding to take advantage of wireless interference, which used to be considered generally harmful, to improve throughput performance. Previously, only the case of two nodes that need to exchange information has been fully discussed while the issue of extending analog network coding to more than three nodes remains undeveloped. In this paper, we propose a practical transmission scheme to extend analog network coding to more than two nodes that need to exchange information among themselves. We start with the case of three nodes that need to exchange information and demonstrate that through utilizing our algorithm, the throughput can achieve 33% and 20% increase compared with that of traditional transmission scheduling and digital network coding, respectively. Then, we generalize the algorithm so that it can fit for occasions with any number of nodes. We also discuss some technical issues and throughput analysis as well as the bit error rate.

Tackling Information Asymmetry in Networks: A New Entropy-Based Ranking Index

NASA Astrophysics Data System (ADS)

Barucca, Paolo; Caldarelli, Guido; Squartini, Tiziano

2018-06-01

Information is a valuable asset in socio-economic systems, a significant part of which is entailed into the network of connections between agents. The different interlinkages patterns that agents establish may, in fact, lead to asymmetries in the knowledge of the network structure; since this entails a different ability of quantifying relevant, systemic properties (e.g. the risk of contagion in a network of liabilities), agents capable of providing a better estimation of (otherwise) inaccessible network properties, ultimately have a competitive advantage. In this paper, we address the issue of quantifying the information asymmetry of nodes: to this aim, we define a novel index—InfoRank—intended to rank nodes according to their information content. In order to do so, each node ego-network is enforced as a constraint of an entropy-maximization problem and the subsequent uncertainty reduction is used to quantify the node-specific accessible information. We, then, test the performance of our ranking procedure in terms of reconstruction accuracy and show that it outperforms other centrality measures in identifying the "most informative" nodes. Finally, we discuss the socio-economic implications of network information asymmetry.

Evaluating Action Learning: A Critical Realist Complex Network Theory Approach

ERIC Educational Resources Information Center

Burgoyne, John G.

2010-01-01

This largely theoretical paper will argue the case for the usefulness of applying network and complex adaptive systems theory to an understanding of action learning and the challenge it is evaluating. This approach, it will be argued, is particularly helpful in the context of improving capability in dealing with wicked problems spread around…

Interspecific social networks promote information transmission in wild songbirds.

PubMed

Farine, Damien R; Aplin, Lucy M; Sheldon, Ben C; Hoppitt, William

2015-03-22

Understanding the functional links between social structure and population processes is a central aim of evolutionary ecology. Multiple types of interactions can be represented by networks drawn for the same population, such as kinship, dominance or affiliative networks, but the relative importance of alternative networks in modulating population processes may not be clear. We illustrate this problem, and a solution, by developing a framework for testing the importance of different types of association in facilitating the transmission of information. We apply this framework to experimental data from wild songbirds that form mixed-species flocks, recording the arrival (patch discovery) of individuals to novel foraging sites. We tested whether intraspecific and interspecific social networks predicted the spread of information about novel food sites, and found that both contributed to transmission. The likelihood of acquiring information per unit of connection to knowledgeable individuals increased 22-fold for conspecifics, and 12-fold for heterospecifics. We also found that species varied in how much information they produced, suggesting that some species play a keystone role in winter foraging flocks. More generally, these analyses demonstrate that this method provides a powerful approach, using social networks to quantify the relative transmission rates across different social relationships.

College Students' Nutrition Information Networks.

ERIC Educational Resources Information Center

Hertzler, Ann A.; Frary, Robert B.

1995-01-01

Use of nutrition information networks (consumer market, media, authority, family, and high school classes), food choices, fat practices, and nutrient intake were rated by 179 male and 300 female undergraduates. Family was an important influence; media and consumer market influenced fat practices, especially for women. No source was used very…

Effective network inference through multivariate information transfer estimation

NASA Astrophysics Data System (ADS)

Dahlqvist, Carl-Henrik; Gnabo, Jean-Yves

2018-06-01

Network representation has steadily gained in popularity over the past decades. In many disciplines such as finance, genetics, neuroscience or human travel to cite a few, the network may not directly be observable and needs to be inferred from time-series data, leading to the issue of separating direct interactions between two entities forming the network from indirect interactions coming through its remaining part. Drawing on recent contributions proposing strategies to deal with this problem such as the so-called "global silencing" approach of Barzel and Barabasi or "network deconvolution" of Feizi et al. (2013), we propose a novel methodology to infer an effective network structure from multivariate conditional information transfers. Its core principal is to test the information transfer between two nodes through a step-wise approach by conditioning the transfer for each pair on a specific set of relevant nodes as identified by our algorithm from the rest of the network. The methodology is model free and can be applied to high-dimensional networks with both inter-lag and intra-lag relationships. It outperforms state-of-the-art approaches for eliminating the redundancies and more generally retrieving simulated artificial networks in our Monte-Carlo experiments. We apply the method to stock market data at different frequencies (15 min, 1 h, 1 day) to retrieve the network of US largest financial institutions and then document how bank's centrality measurements relate to bank's systemic vulnerability.

An Information-Related Systems Theory of Counseling

ERIC Educational Resources Information Center

Wilkinson, Melvin

1973-01-01

The author suggests that a systems theory of counseling should have an adequate theoretical foundation in the way various types of systems handle information. Using the works of W. R. Ashby as a basis, the paper is a beginning attempt to establish this foundation. It describes how information can be used to maintain homeostasis and protect key…

Optimal Learning Paths in Information Networks

PubMed Central

Rodi, G. C.; Loreto, V.; Servedio, V. D. P.; Tria, F.

2015-01-01

Each sphere of knowledge and information could be depicted as a complex mesh of correlated items. By properly exploiting these connections, innovative and more efficient navigation strategies could be defined, possibly leading to a faster learning process and an enduring retention of information. In this work we investigate how the topological structure embedding the items to be learned can affect the efficiency of the learning dynamics. To this end we introduce a general class of algorithms that simulate the exploration of knowledge/information networks standing on well-established findings on educational scheduling, namely the spacing and lag effects. While constructing their learning schedules, individuals move along connections, periodically revisiting some concepts, and sometimes jumping on very distant ones. In order to investigate the effect of networked information structures on the proposed learning dynamics we focused both on synthetic and real-world graphs such as subsections of Wikipedia and word-association graphs. We highlight the existence of optimal topological structures for the simulated learning dynamics whose efficiency is affected by the balance between hubs and the least connected items. Interestingly, the real-world graphs we considered lead naturally to almost optimal learning performances. PMID:26030508

Recoverability in quantum information theory

NASA Astrophysics Data System (ADS)

Wilde, Mark

The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this work, we establish improvements of this entropy inequality in the form of physically meaningful remainder terms. One of the main results can be summarized informally as follows: if the decrease in quantum relative entropy between two quantum states after a quantum physical evolution is relatively small, then it is possible to perform a recovery operation, such that one can perfectly recover one state while approximately recovering the other. This can be interpreted as quantifying how well one can reverse a quantum physical evolution. Our proof method is elementary, relying on the method of complex interpolation, basic linear algebra, and the recently introduced Renyi generalization of a relative entropy difference. The theorem has a number of applications in quantum information theory, which have to do with providing physically meaningful improvements to many known entropy inequalities. This is based on arXiv:1505.04661, now accepted for publication in Proceedings of the Royal Society A. I acknowledge support from startup funds from the Department of Physics and Astronomy at LSU, the NSF under Award No. CCF-1350397, and the DARPA Quiness Program through US Army Research Office award W31P4Q-12-1-0019.

GTRF: a game theory approach for regulating node behavior in real-time wireless sensor networks.

PubMed

Lin, Chi; Wu, Guowei; Pirozmand, Poria

2015-06-04

The selfish behaviors of nodes (or selfish nodes) cause packet loss, network congestion or even void regions in real-time wireless sensor networks, which greatly decrease the network performance. Previous methods have focused on detecting selfish nodes or avoiding selfish behavior, but little attention has been paid to regulating selfish behavior. In this paper, a Game Theory-based Real-time & Fault-tolerant (GTRF) routing protocol is proposed. GTRF is composed of two stages. In the first stage, a game theory model named VA is developed to regulate nodes' behaviors and meanwhile balance energy cost. In the second stage, a jumping transmission method is adopted, which ensures that real-time packets can be successfully delivered to the sink before a specific deadline. We prove that GTRF theoretically meets real-time requirements with low energy cost. Finally, extensive simulations are conducted to demonstrate the performance of our scheme. Simulation results show that GTRF not only balances the energy cost of the network, but also prolongs network lifetime.

USING INFORMATION THEORY TO DEFINE A SUSTAINABILITY INDEX

EPA Science Inventory

Information theory has many applications in Ecology and Environmental science, such as a biodiversity indicator, as a measure of evolution, a measure of distance from thermodynamic equilibrium, and as a measure of system organization. Fisher Information, in particular, provides a...

Managing for resilience: an information theory-based ...

EPA Pesticide Factsheets

Ecosystems are complex and multivariate; hence, methods to assess the dynamics of ecosystems should have the capacity to evaluate multiple indicators simultaneously. Most research on identifying leading indicators of regime shifts has focused on univariate methods and simple models which have limited utility when evaluating real ecosystems, particularly because drivers are often unknown. We discuss some common univariate and multivariate approaches for detecting critical transitions in ecosystems and demonstrate their capabilities via case studies. Synthesis and applications. We illustrate the utility of an information theory-based index for assessing ecosystem dynamics. Trends in this index also provide a sentinel of both abrupt and gradual transitions in ecosystems. In response to the need to identify leading indicators of regime shifts in ecosystems, our research compares traditional indicators and Fisher information, an information theory based method, by examining four case study systems. Results demonstrate the utility of methods and offers great promise for quantifying and managing for resilience.

Response to Patrick Love's "Informal Theory": A Rejoinder

ERIC Educational Resources Information Center

Evans, Nancy J.; Guido, Florence M.

2012-01-01

This rejoinder to Patrick Love's article, "Informal Theory: The Ignored Link in Theory-to-Practice," which appears earlier in this issue of the "Journal of College Student Development", was written at the invitation of the Editor. In the critique, we point out the weaknesses of many of Love's arguments and propositions. We provide an alternative…

Urban occupational structures as information networks: The effect on network density of increasing number of occupations.

PubMed

Shutters, Shade T; Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M A

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence-or connectedness-which is equivalent to the density of a city's weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks.

Urban occupational structures as information networks: The effect on network density of increasing number of occupations

PubMed Central

Lobo, José; Muneepeerakul, Rachata; Strumsky, Deborah; Mellander, Charlotta; Brachert, Matthias; Farinha, Teresa; Bettencourt, Luis M. A.

2018-01-01

Urban economies are composed of diverse activities, embodied in labor occupations, which depend on one another to produce goods and services. Yet little is known about how the nature and intensity of these interdependences change as cities increase in population size and economic complexity. Understanding the relationship between occupational interdependencies and the number of occupations defining an urban economy is relevant because interdependence within a networked system has implications for system resilience and for how easily can the structure of the network be modified. Here, we represent the interdependencies among occupations in a city as a non-spatial information network, where the strengths of interdependence between pairs of occupations determine the strengths of the links in the network. Using those quantified link strengths we calculate a single metric of interdependence–or connectedness–which is equivalent to the density of a city’s weighted occupational network. We then examine urban systems in six industrialized countries, analyzing how the density of urban occupational networks changes with network size, measured as the number of unique occupations present in an urban workforce. We find that in all six countries, density, or economic interdependence, increases superlinearly with the number of distinct occupations. Because connections among occupations represent flows of information, we provide evidence that connectivity scales superlinearly with network size in information networks. PMID:29734354

An Appraisal of Social Network Theory and Analysis as Applied to Public Health: Challenges and Opportunities.

PubMed

Valente, Thomas W; Pitts, Stephanie R

2017-03-20

The use of social network theory and analysis methods as applied to public health has expanded greatly in the past decade, yielding a significant academic literature that spans almost every conceivable health issue. This review identifies several important theoretical challenges that confront the field but also provides opportunities for new research. These challenges include (a) measuring network influences, (b) identifying appropriate influence mechanisms, (c) the impact of social media and computerized communications, (d) the role of networks in evaluating public health interventions, and (e) ethics. Next steps for the field are outlined and the need for funding is emphasized. Recently developed network analysis techniques, technological innovations in communication, and changes in theoretical perspectives to include a focus on social and environmental behavioral influences have created opportunities for new theory and ever broader application of social networks to public health topics.

Searching LOGIN, the Local Government Information Network.

ERIC Educational Resources Information Center

Jack, Robert F.

1984-01-01

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

Medical libraries, bioinformatics, and networked information: a coming convergence?

PubMed

Lynch, C

1999-10-01

Libraries will be changed by technological and social developments that are fueled by information technology, bioinformatics, and networked information. Libraries in highly focused settings such as the health sciences are at a pivotal point in their development as the synthesis of historically diverse and independent information sources transforms health care institutions. Boundaries are breaking down between published literature and research data, between research databases and clinical patient data, and between consumer health information and professional literature. This paper focuses on the dynamics that are occurring with networked information sources and the roles that libraries will need to play in the world of medical informatics in the early twenty-first century.

Expanding the informational chemistries of life: peptide/RNA networks

NASA Astrophysics Data System (ADS)

Taran, Olga; Chen, Chenrui; Omosun, Tolulope O.; Hsieh, Ming-Chien; Rha, Allisandra; Goodwin, Jay T.; Mehta, Anil K.; Grover, Martha A.; Lynn, David G.

2017-11-01

The RNA world hypothesis simplifies the complex biopolymer networks underlining the informational and metabolic needs of living systems to a single biopolymer scaffold. This simplification requires abiotic reaction cascades for the construction of RNA, and this chemistry remains the subject of active research. Here, we explore a complementary approach involving the design of dynamic peptide networks capable of amplifying encoded chemical information and setting the stage for mutualistic associations with RNA. Peptide conformational networks are known to be capable of evolution in disease states and of co-opting metal ions, aromatic heterocycles and lipids to extend their emergent behaviours. The coexistence and association of dynamic peptide and RNA networks appear to have driven the emergence of higher-order informational systems in biology that are not available to either scaffold independently, and such mutualistic interdependence poses critical questions regarding the search for life across our Solar System and beyond. This article is part of the themed issue 'Reconceptualizing the origins of life'.

Information flow in a network of dispersed signalers-receivers

NASA Astrophysics Data System (ADS)

Halupka, Konrad

2017-11-01

I consider a stochastic model of multi-agent communication in regular network. The model describes how dispersed animals exchange information. Each agent can initiate and transfer the signal to its nearest neighbors, who may pass it farther. For an external observer of busy networks, signaling activity may appear random, even though information flow actually thrives. Only when signal initiation and transfer are at low levels do spatiotemporal autocorrelations emerge as clumping signaling activity in space and pink noise time series. Under such conditions, the costs of signaling are moderate, but the signaler can reach a large audience. I propose that real-world networks of dispersed signalers-receivers may self-organize into this state and the flow of information maintains their integrity.

Discretized kinetic theory on scale-free networks

NASA Astrophysics Data System (ADS)

Bertotti, Maria Letizia; Modanese, Giovanni

2016-10-01

The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1, 2] with a network structure. The model is based on a system of n differential equations of the kinetic discretized-Boltzmann kind. The network structure is incorporated in a probabilistic way, through the introduction of a link density P(α) and of correlation coefficients P(β|α), which give the conditioned probability that an individual with α links is connected to one with β links. We study the properties of the equations and give analytical results concerning the existence, normalization and positivity of the solutions. For a fixed network with P(α) = c/α q , we investigate numerically the dependence of the detailed and marginal equilibrium distributions on the initial conditions and on the exponent q. Our results are compatible with those obtained from the Bouchaud-Mezard model and from agent-based simulations, and provide additional information about the dependence of the individual income on the level of connectivity.

Information transfer network of global market indices

NASA Astrophysics Data System (ADS)

Kim, Yup; Kim, Jinho; Yook, Soon-Hyung

2015-07-01

We study the topological properties of the information transfer networks (ITN) of the global financial market indices for six different periods. ITN is a directed weighted network, in which the direction and weight are determined by the transfer entropy between market indices. By applying the threshold method, it is found that ITN undergoes a crossover from the complete graph to a small-world (SW) network. SW regime of ITN for a global crisis is found to be much more enhanced than that for ordinary periods. Furthermore, when ITN is in SW regime, the average clustering coefficient is found to be synchronized with average volatility of markets. We also compare the results with the topological properties of correlation networks.

Quantitative design of emergency monitoring network for river chemical spills based on discrete entropy theory.

PubMed

Shi, Bin; Jiang, Jiping; Sivakumar, Bellie; Zheng, Yi; Wang, Peng

2018-05-01

Field monitoring strategy is critical for disaster preparedness and watershed emergency environmental management. However, development of such is also highly challenging. Despite the efforts and progress thus far, no definitive guidelines or solutions are available worldwide for quantitatively designing a monitoring network in response to river chemical spill incidents, except general rules based on administrative divisions or arbitrary interpolation on routine monitoring sections. To address this gap, a novel framework for spatial-temporal network design was proposed in this study. The framework combines contaminant transport modelling with discrete entropy theory and spectral analysis. The water quality model was applied to forecast the spatio-temporal distribution of contaminant after spills and then corresponding information transfer indexes (ITIs) and Fourier approximation periodic functions were estimated as critical measures for setting sampling locations and times. The results indicate that the framework can produce scientific preparedness plans of emergency monitoring based on scenario analysis of spill risks as well as rapid design as soon as the incident happened but not prepared. The framework was applied to a hypothetical spill case based on tracer experiment and a real nitrobenzene spill incident case to demonstrate its suitability and effectiveness. The newly-designed temporal-spatial monitoring network captured major pollution information at relatively low costs. It showed obvious benefits for follow-up early-warning and treatment as well as for aftermath recovery and assessment. The underlying drivers of ITIs as well as the limitations and uncertainty of the approach were analyzed based on the case studies. Comparison with existing monitoring network design approaches, management implications, and generalized applicability were also discussed. Copyright © 2018 Elsevier Ltd. All rights reserved.

Leadership in Groups: Social Networks and Perceptions of Formal and Informal Leaders

DTIC Science & Technology

2006-03-01

LEADERSHIP IN GROUPS: SOCIAL NETWORKS AND PERCEPTIONS OF FORMAL AND INFORMAL LEADERS THESIS...01 LEADERSHIP IN GROUPS: SOCIAL NETWORKS AND PERCEPTIONS OF FORMAL AND INFORMAL LEADERS THESIS Presented to the Faculty...DISTRIBUTION UNLIMITED. AFIT/GSS/ENV/06M-01 LEADERSHIP IN GROUPS: SOCIAL NETWORKS AND PERCEPTIONS OF FORMAL AND INFORMAL LEADERS

A multivariate extension of mutual information for growing neural networks.

PubMed

Ball, Kenneth R; Grant, Christopher; Mundy, William R; Shafer, Timothy J

2017-11-01

Recordings of neural network activity in vitro are increasingly being used to assess the development of neural network activity and the effects of drugs, chemicals and disease states on neural network function. The high-content nature of the data derived from such recordings can be used to infer effects of compounds or disease states on a variety of important neural functions, including network synchrony. Historically, synchrony of networks in vitro has been assessed either by determination of correlation coefficients (e.g. Pearson's correlation), by statistics estimated from cross-correlation histograms between pairs of active electrodes, and/or by pairwise mutual information and related measures. The present study examines the application of Normalized Multiinformation (NMI) as a scalar measure of shared information content in a multivariate network that is robust with respect to changes in network size. Theoretical simulations are designed to investigate NMI as a measure of complexity and synchrony in a developing network relative to several alternative approaches. The NMI approach is applied to these simulations and also to data collected during exposure of in vitro neural networks to neuroactive compounds during the first 12 days in vitro, and compared to other common measures, including correlation coefficients and mean firing rates of neurons. NMI is shown to be more sensitive to developmental effects than first order synchronous and nonsynchronous measures of network complexity. Finally, NMI is a scalar measure of global (rather than pairwise) mutual information in a multivariate network, and hence relies on less assumptions for cross-network comparisons than historical approaches. Copyright © 2017 Elsevier Ltd. All rights reserved.

Theory of rumour spreading in complex social networks

NASA Astrophysics Data System (ADS)

Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M.

2007-01-01

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.

BOULDER AREA SUSTAINABILITY INFORMATION NETWORK (BASIN)

EPA Science Inventory

The primary goal of the Boulder Area Sustainability Information Network (BASIN) is to help citizens make meaningful connections between environmental data and their day-to-day activities and facilitate involvement in public policy development. Objectives include:

...

• Child Rights Information Network Newsletter, 2000-2002.

  ERIC Educational Resources Information Center

  Khan, Andrea, Ed.; Greenwood, Laura, Ed.

  These five newsletter issues communicate activities of the Child Rights Information Network (CRIN) and report on information resources and world-wide activities concerning children and child rights. The March 2000 issue focuses on children's right to education, assessing the matter form a range of differing perspectives, at international and…

• Grower Communication Networks: Information Sources for Organic Farmers

  ERIC Educational Resources Information Center

  Crawford, Chelsi; Grossman, Julie; Warren, Sarah T.; Cubbage, Fred

  2015-01-01

  This article reports on a study to determine which information sources organic growers use to inform farming practices by conducting in-depth semi-structured interviews with 23 organic farmers across 17 North Carolina counties. Effective information sources included: networking, agricultural organizations, universities, conferences, Extension, Web…

• An Agent-Based Model of Private Woodland Owner Management Behavior Using Social Interactions, Information Flow, and Peer-To-Peer Networks

  PubMed Central

  Huff, Emily Silver; Leahy, Jessica E.; Hiebeler, David; Weiskittel, Aaron R.; Noblet, Caroline L.

  2015-01-01

  Privately owned woodlands are an important source of timber and ecosystem services in North America and worldwide. Impacts of management on these ecosystems and timber supply from these woodlands are difficult to estimate because complex behavioral theory informs the owner’s management decisions. The decision-making environment consists of exogenous market factors, internal cognitive processes, and social interactions with fellow landowners, foresters, and other rural community members. This study seeks to understand how social interactions, information flow, and peer-to-peer networks influence timber harvesting behavior using an agent-based model. This theoretical model includes forested polygons in various states of ‘harvest readiness’ and three types of agents: forest landowners, foresters, and peer leaders (individuals trained in conservation who use peer-to-peer networking). Agent rules, interactions, and characteristics were parameterized with values from existing literature and an empirical survey of forest landowner attitudes, intentions, and demographics. The model demonstrates that as trust in foresters and peer leaders increases, the percentage of the forest that is harvested sustainably increases. Furthermore, peer leaders can serve to increase landowner trust in foresters. Model output and equations will inform forest policy and extension/outreach efforts. The model also serves as an important testing ground for new theories of landowner decision making and behavior. PMID:26562429

• Testing of information condensation in a model reverberating spiking neural network.

  PubMed

  Vidybida, Alexander

  2011-06-01

  Information about external world is delivered to the brain in the form of structured in time spike trains. During further processing in higher areas, information is subjected to a certain condensation process, which results in formation of abstract conceptual images of external world, apparently, represented as certain uniform spiking activity partially independent on the input spike trains details. Possible physical mechanism of condensation at the level of individual neuron was discussed recently. In a reverberating spiking neural network, due to this mechanism the dynamics should settle down to the same uniform/ periodic activity in response to a set of various inputs. Since the same periodic activity may correspond to different input spike trains, we interpret this as possible candidate for information condensation mechanism in a network. Our purpose is to test this possibility in a network model consisting of five fully connected neurons, particularly, the influence of geometric size of the network, on its ability to condense information. Dynamics of 20 spiking neural networks of different geometric sizes are modelled by means of computer simulation. Each network was propelled into reverberating dynamics by applying various initial input spike trains. We run the dynamics until it becomes periodic. The Shannon's formula is used to calculate the amount of information in any input spike train and in any periodic state found. As a result, we obtain explicit estimate of the degree of information condensation in the networks, and conclude that it depends strongly on the net's geometric size.

• Stochastic cycle selection in active flow networks

  NASA Astrophysics Data System (ADS)

  Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

  2016-11-01

  Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

• Synthesizing animal and human behavior research via neural network learning theory.

  PubMed

  Tryon, W W

  1995-12-01

  Animal and human research have been "divorced" since approximately 1968. Several recent articles have tried to persuade behavior therapists of the merits of animal research. Three reasons are given concerning why disinterest in animal research is so widespread: (1) functional explanations are given for animals, and cognitive explanations are given for humans; (2) serial symbol manipulating models are used to explain human behavior; and (3) human learning was assumed, thereby removing it as something to be explained. Brain-inspired connectionist neural networks, collectively referred to as neural network learning theory (NNLT), are briefly described, and a spectrum of their accomplishments from simple conditioning through speech is outlined. Five benefits that behavior therapists can derive from NNLT are described. They include (a) enhanced professional identity derived from a comprehensive learning theory, (b) improved interdisciplinary collaboration both clinically and scientifically, (c) renewed perceived relevance of animal research, (d) access to plausible proximal causal mechanisms capable of explaining operant conditioning, and (e) an inherently developmental perspective.