Inferring topologies via driving-based generalized synchronization of two-layer networks

NASA Astrophysics Data System (ADS)

Wang, Yingfei; Wu, Xiaoqun; Feng, Hui; Lu, Jun-an; Xu, Yuhua

2016-05-01

The interaction topology among the constituents of a complex network plays a crucial role in the network’s evolutionary mechanisms and functional behaviors. However, some network topologies are usually unknown or uncertain. Meanwhile, coupling delays are ubiquitous in various man-made and natural networks. Hence, it is necessary to gain knowledge of the whole or partial topology of a complex dynamical network by taking into consideration communication delay. In this paper, topology identification of complex dynamical networks is investigated via generalized synchronization of a two-layer network. Particularly, based on the LaSalle-type invariance principle of stochastic differential delay equations, an adaptive control technique is proposed by constructing an auxiliary layer and designing proper control input and updating laws so that the unknown topology can be recovered upon successful generalized synchronization. Numerical simulations are provided to illustrate the effectiveness of the proposed method. The technique provides a certain theoretical basis for topology inference of complex networks. In particular, when the considered network is composed of systems with high-dimension or complicated dynamics, a simpler response layer can be constructed, which is conducive to circuit design. Moreover, it is practical to take into consideration perturbations caused by control input. Finally, the method is applicable to infer topology of a subnetwork embedded within a complex system and locate hidden sources. We hope the results can provide basic insight into further research endeavors on understanding practical and economical topology inference of networks.

Exponential H(infinity) synchronization of general discrete-time chaotic neural networks with or without time delays.

PubMed

Qi, Donglian; Liu, Meiqin; Qiu, Meikang; Zhang, Senlin

2010-08-01

This brief studies exponential H(infinity) synchronization of a class of general discrete-time chaotic neural networks with external disturbance. On the basis of the drive-response concept and H(infinity) control theory, and using Lyapunov-Krasovskii (or Lyapunov) functional, state feedback controllers are established to not only guarantee exponential stable synchronization between two general chaotic neural networks with or without time delays, but also reduce the effect of external disturbance on the synchronization error to a minimal H(infinity) norm constraint. The proposed controllers can be obtained by solving the convex optimization problems represented by linear matrix inequalities. Most discrete-time chaotic systems with or without time delays, such as Hopfield neural networks, cellular neural networks, bidirectional associative memory networks, recurrent multilayer perceptrons, Cohen-Grossberg neural networks, Chua's circuits, etc., can be transformed into this general chaotic neural network to be H(infinity) synchronization controller designed in a unified way. Finally, some illustrated examples with their simulations have been utilized to demonstrate the effectiveness of the proposed methods.

Sub-Network Access Control Technology Demonstrator: Software Design of the Network Management System

DTIC Science & Technology

2002-08-01

Canadian Operational Fleet. Requirements The proposed network management solution must provide the normal monitoring and configuration mechanisms generally...Joint Warrior Inter- operability Demonstrations (JWID) m and the Communication System Network Inter- Operability (CSNI) Navy Network Trials. In short...management functional area normally includes two main functions: fault isolation and diagnosis, and restoration of the system . In short, an operator

De novo design of protein homo-oligomers with modular hydrogen bond network-mediated specificity

PubMed Central

Boyken, Scott E.; Chen, Zibo; Groves, Benjamin; Langan, Robert A.; Oberdorfer, Gustav; Ford, Alex; Gilmore, Jason; Xu, Chunfu; DiMaio, Frank; Pereira, Jose Henrique; Sankaran, Banumathi; Seelig, Georg; Zwart, Peter H.; Baker, David

2017-01-01

In nature, structural specificity in DNA and proteins is encoded quite differently: in DNA, specificity arises from modular hydrogen bonds in the core of the double helix, whereas in proteins, specificity arises largely from buried hydrophobic packing complemented by irregular peripheral polar interactions. Here we describe a general approach for designing a wide range of protein homo-oligomers with specificity determined by modular arrays of central hydrogen bond networks. We use the approach to design dimers, trimers, and tetramers consisting of two concentric rings of helices, including previously not seen triangular, square, and supercoiled topologies. X-ray crystallography confirms that the structures overall, and the hydrogen bond networks in particular, are nearly identical to the design models, and the networks confer interaction specificity in vivo. The ability to design extensive hydrogen bond networks with atomic accuracy is a milestone for protein design and enables the programming of protein interaction specificity for a broad range of synthetic biology applications. PMID:27151862

Modular, Hierarchical Learning By Artificial Neural Networks

NASA Technical Reports Server (NTRS)

Baldi, Pierre F.; Toomarian, Nikzad

1996-01-01

Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.

Computer-aided design of biological circuits using TinkerCell

PubMed Central

Bergmann, Frank T; Sauro, Herbert M

2010-01-01

Synthetic biology is an engineering discipline that builds on modeling practices from systems biology and wet-lab techniques from genetic engineering. As synthetic biology advances, efficient procedures will be developed that will allow a synthetic biologist to design, analyze and build biological networks. In this idealized pipeline, computer-aided design (CAD) is a necessary component. The role of a CAD application would be to allow efficient transition from a general design to a final product. TinkerCell is a design tool for serving this purpose in synthetic biology. In TinkerCell, users build biological networks using biological parts and modules. The network can be analyzed using one of several functions provided by TinkerCell or custom programs from third-party sources. Since best practices for modeling and constructing synthetic biology networks have not yet been established, TinkerCell is designed as a flexible and extensible application that can adjust itself to changes in the field. PMID:21327060

Nonlinear inversion of electrical resistivity imaging using pruning Bayesian neural networks

NASA Astrophysics Data System (ADS)

Jiang, Fei-Bo; Dai, Qian-Wei; Dong, Li

2016-06-01

Conventional artificial neural networks used to solve electrical resistivity imaging (ERI) inversion problem suffer from overfitting and local minima. To solve these problems, we propose to use a pruning Bayesian neural network (PBNN) nonlinear inversion method and a sample design method based on the K-medoids clustering algorithm. In the sample design method, the training samples of the neural network are designed according to the prior information provided by the K-medoids clustering results; thus, the training process of the neural network is well guided. The proposed PBNN, based on Bayesian regularization, is used to select the hidden layer structure by assessing the effect of each hidden neuron to the inversion results. Then, the hyperparameter α k , which is based on the generalized mean, is chosen to guide the pruning process according to the prior distribution of the training samples under the small-sample condition. The proposed algorithm is more efficient than other common adaptive regularization methods in geophysics. The inversion of synthetic data and field data suggests that the proposed method suppresses the noise in the neural network training stage and enhances the generalization. The inversion results with the proposed method are better than those of the BPNN, RBFNN, and RRBFNN inversion methods as well as the conventional least squares inversion.

GrDHP: a general utility function representation for dual heuristic dynamic programming.

PubMed

Ni, Zhen; He, Haibo; Zhao, Dongbin; Xu, Xin; Prokhorov, Danil V

2015-03-01

A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function. With this proposed architecture, we can obtain the required derivatives of the utility function directly from the goal network. In addition, instead of a fixed predefined utility function in literature, we conduct an online learning process for the goal network so that the derivatives of the utility function can be adaptively tuned over time. We provide the control performance of both the proposed GrDHP and the traditional DHP approaches under the same environment and parameter settings. The statistical simulation results and the snapshot of the system variables are presented to demonstrate the improved learning and controlling performance. We also apply both approaches to a power system example to further demonstrate the control capabilities of the GrDHP approach.

Predictive modelling-based design and experiments for synthesis and spinning of bioinspired silk fibres

PubMed Central

Gronau, Greta; Jacobsen, Matthew M.; Huang, Wenwen; Rizzo, Daniel J.; Li, David; Staii, Cristian; Pugno, Nicola M.; Wong, Joyce Y.; Kaplan, David L.; Buehler, Markus J.

2016-01-01

Scalable computational modelling tools are required to guide the rational design of complex hierarchical materials with predictable functions. Here, we utilize mesoscopic modelling, integrated with genetic block copolymer synthesis and bioinspired spinning process, to demonstrate de novo materials design that incorporates chemistry, processing and material characterization. We find that intermediate hydrophobic/hydrophilic block ratios observed in natural spider silks and longer chain lengths lead to outstanding silk fibre formation. This design by nature is based on the optimal combination of protein solubility, self-assembled aggregate size and polymer network topology. The original homogeneous network structure becomes heterogeneous after spinning, enhancing the anisotropic network connectivity along the shear flow direction. Extending beyond the classical polymer theory, with insights from the percolation network model, we illustrate the direct proportionality between network conductance and fibre Young's modulus. This integrated approach provides a general path towards de novo functional network materials with enhanced mechanical properties and beyond (optical, electrical or thermal) as we have experimentally verified. PMID:26017575

Predictive modelling-based design and experiments for synthesis and spinning of bioinspired silk fibres.

PubMed

Lin, Shangchao; Ryu, Seunghwa; Tokareva, Olena; Gronau, Greta; Jacobsen, Matthew M; Huang, Wenwen; Rizzo, Daniel J; Li, David; Staii, Cristian; Pugno, Nicola M; Wong, Joyce Y; Kaplan, David L; Buehler, Markus J

2015-05-28

Scalable computational modelling tools are required to guide the rational design of complex hierarchical materials with predictable functions. Here, we utilize mesoscopic modelling, integrated with genetic block copolymer synthesis and bioinspired spinning process, to demonstrate de novo materials design that incorporates chemistry, processing and material characterization. We find that intermediate hydrophobic/hydrophilic block ratios observed in natural spider silks and longer chain lengths lead to outstanding silk fibre formation. This design by nature is based on the optimal combination of protein solubility, self-assembled aggregate size and polymer network topology. The original homogeneous network structure becomes heterogeneous after spinning, enhancing the anisotropic network connectivity along the shear flow direction. Extending beyond the classical polymer theory, with insights from the percolation network model, we illustrate the direct proportionality between network conductance and fibre Young's modulus. This integrated approach provides a general path towards de novo functional network materials with enhanced mechanical properties and beyond (optical, electrical or thermal) as we have experimentally verified.

Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.

PubMed

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

2017-01-01

Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.

Ownership strategies of multinational corporations: Towards designing effective global networks

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

Raghunathan, S.P.

1992-01-01

The thesis of this research is that MNCs, attempting to implement different international strategies in response to several environmental factors, let their global networks evolve. The ownership structure of the network is therefore a function of the international strategy and environment of a firm. A particular strategy (configuration/coordination), given a certain environment, may be effective if associated with the appropriate structure. This study is based on a survey of 318 US manufacturing-sector MNCs using a questionnaire. The ownership structure of an MNC network was identified by studying the nature of ownership - method and form - of overseas subsidiaries. Usingmore » network theoretic methods, ownership structure was empirically related to international environment, strategy, and performance. Results of this study throw light on the design of global networks and enable a general theory of the design of MNCs to be eventually developed.« less

Extended target recognition in cognitive radar networks.

PubMed

Wei, Yimin; Meng, Huadong; Liu, Yimin; Wang, Xiqin

2010-01-01

We address the problem of adaptive waveform design for extended target recognition in cognitive radar networks. A closed-loop active target recognition radar system is extended to the case of a centralized cognitive radar network, in which a generalized likelihood ratio (GLR) based sequential hypothesis testing (SHT) framework is employed. Using Doppler velocities measured by multiple radars, the target aspect angle for each radar is calculated. The joint probability of each target hypothesis is then updated using observations from different radar line of sights (LOS). Based on these probabilities, a minimum correlation algorithm is proposed to adaptively design the transmit waveform for each radar in an amplitude fluctuation situation. Simulation results demonstrate performance improvements due to the cognitive radar network and adaptive waveform design. Our minimum correlation algorithm outperforms the eigen-waveform solution and other non-cognitive waveform design approaches.

First-order design of geodetic networks using the simulated annealing method

NASA Astrophysics Data System (ADS)

Berné, J. L.; Baselga, S.

2004-09-01

The general problem of the optimal design for a geodetic network subject to any extrinsic factors, namely the first-order design problem, can be dealt with as a numeric optimization problem. The classic theory of this problem and the optimization methods are revised. Then the innovative use of the simulated annealing method, which has been successfully applied in other fields, is presented for this classical geodetic problem. This method, belonging to iterative heuristic techniques in operational research, uses a thermodynamical analogy to crystalline networks to offer a solution that converges probabilistically to the global optimum. Basic formulation and some examples are studied.

Building a Solar System Internet

NASA Technical Reports Server (NTRS)

Clark, Gilbert J.

2018-01-01

This presentation is expected to be given during the scheduled Communications Technology and Development discussion in the University Student Design Challenge (2). It is an introduction to various challenges inherent to the construction of networks in space. The presentation also includes both an overview of networking in general, as well as approaches taken to the construction of delay- and disruption- tolerant networks.

Character recognition from trajectory by recurrent spiking neural networks.

PubMed

Jiangrong Shen; Kang Lin; Yueming Wang; Gang Pan

2017-07-01

Spiking neural networks are biologically plausible and power-efficient on neuromorphic hardware, while recurrent neural networks have been proven to be efficient on time series data. However, how to use the recurrent property to improve the performance of spiking neural networks is still a problem. This paper proposes a recurrent spiking neural network for character recognition using trajectories. In the network, a new encoding method is designed, in which varying time ranges of input streams are used in different recurrent layers. This is able to improve the generalization ability of our model compared with general encoding methods. The experiments are conducted on four groups of the character data set from University of Edinburgh. The results show that our method can achieve a higher average recognition accuracy than existing methods.

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

Burchett, Deon L.; Chen, Richard Li-Yang; Phillips, Cynthia A.

This report summarizes the work performed under the project project Next-Generation Algo- rithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for in- frastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years ofmore » Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded [12] in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasi- ble region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality con- straints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.« less

Criteria for Choosing the Best Neural Network: Part 1

DTIC Science & Technology

1991-07-24

Touretzky, pp. 177-185. San Mateo: Morgan Kaufmann. Harp, S.A., Samad , T., and Guha, A . (1990). Designing application-specific neural networks using genetic...determining a parsimonious neural network for use in prediction/generalization based on a given fixed learning sample. Both the classification and...statistical settings, algorithms for selecting the number of hidden layer nodes in a three layer, feedforward neural network are presented. The selection

General aviation design synthesis utilizing interactive computer graphics

NASA Technical Reports Server (NTRS)

Galloway, T. L.; Smith, M. R.

1976-01-01

Interactive computer graphics is a fast growing area of computer application, due to such factors as substantial cost reductions in hardware, general availability of software, and expanded data communication networks. In addition to allowing faster and more meaningful input/output, computer graphics permits the use of data in graphic form to carry out parametric studies for configuration selection and for assessing the impact of advanced technologies on general aviation designs. The incorporation of interactive computer graphics into a NASA developed general aviation synthesis program is described, and the potential uses of the synthesis program in preliminary design are demonstrated.

SIMULATING SUB-DECADAL CHANNEL MORPHOLOGIC CHANGE IN EPHEMERAL STREAM NETWORKS

EPA Science Inventory

A distributed watershed model was modified to simulate cumulative channel morphologic
change from multiple runoff events in ephemeral stream networks. The model incorporates the general design of the event-based Kinematic Runoff and" Erosion Model (KINEROS), which describes t...

Computer-aided design of biological circuits using TinkerCell.

PubMed

Chandran, Deepak; Bergmann, Frank T; Sauro, Herbert M

2010-01-01

Synthetic biology is an engineering discipline that builds on modeling practices from systems biology and wet-lab techniques from genetic engineering. As synthetic biology advances, efficient procedures will be developed that will allow a synthetic biologist to design, analyze, and build biological networks. In this idealized pipeline, computer-aided design (CAD) is a necessary component. The role of a CAD application would be to allow efficient transition from a general design to a final product. TinkerCell is a design tool for serving this purpose in synthetic biology. In TinkerCell, users build biological networks using biological parts and modules. The network can be analyzed using one of several functions provided by TinkerCell or custom programs from third-party sources. Since best practices for modeling and constructing synthetic biology networks have not yet been established, TinkerCell is designed as a flexible and extensible application that can adjust itself to changes in the field. © 2010 Landes Bioscience

Model-free adaptive sliding mode controller design for generalized projective synchronization of the fractional-order chaotic system via radial basis function neural networks

NASA Astrophysics Data System (ADS)

Wang, L. M.

2017-09-01

A novel model-free adaptive sliding mode strategy is proposed for a generalized projective synchronization (GPS) between two entirely unknown fractional-order chaotic systems subject to the external disturbances. To solve the difficulties from the little knowledge about the master-slave system and to overcome the bad effects of the external disturbances on the generalized projective synchronization, the radial basis function neural networks are used to approach the packaged unknown master system and the packaged unknown slave system (including the external disturbances). Consequently, based on the slide mode technology and the neural network theory, a model-free adaptive sliding mode controller is designed to guarantee asymptotic stability of the generalized projective synchronization error. The main contribution of this paper is that a control strategy is provided for the generalized projective synchronization between two entirely unknown fractional-order chaotic systems subject to the unknown external disturbances, and the proposed control strategy only requires that the master system has the same fractional orders as the slave system. Moreover, the proposed method allows us to achieve all kinds of generalized projective chaos synchronizations by turning the user-defined parameters onto the desired values. Simulation results show the effectiveness of the proposed method and the robustness of the controlled system.

Dynamics and control of diseases in networks with community structure.

PubMed

Salathé, Marcel; Jones, James H

2010-04-08

The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.

77 FR 58203 - In the Matter of the Designation of the Haqqani Network Also Known as HQN as a Foreign Terrorist...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-19

... DEPARTMENT OF STATE [Public Notice 8032] In the Matter of the Designation of the Haqqani Network Also Known as HQN as a Foreign Terrorist Organization Pursuant to Section 219 of the Immigration and Nationality Act, as Amended Based upon a review of the Administrative Record assembled in this matter and in consultation with the Attorney General...

Rational design of functional and tunable oscillating enzymatic networks

NASA Astrophysics Data System (ADS)

Semenov, Sergey N.; Wong, Albert S. Y.; van der Made, R. Martijn; Postma, Sjoerd G. J.; Groen, Joost; van Roekel, Hendrik W. H.; de Greef, Tom F. A.; Huck, Wilhelm T. S.

2015-02-01

Life is sustained by complex systems operating far from equilibrium and consisting of a multitude of enzymatic reaction networks. The operating principles of biology's regulatory networks are known, but the in vitro assembly of out-of-equilibrium enzymatic reaction networks has proved challenging, limiting the development of synthetic systems showing autonomous behaviour. Here, we present a strategy for the rational design of programmable functional reaction networks that exhibit dynamic behaviour. We demonstrate that a network built around autoactivation and delayed negative feedback of the enzyme trypsin is capable of producing sustained oscillating concentrations of active trypsin for over 65 h. Other functions, such as amplification, analog-to-digital conversion and periodic control over equilibrium systems, are obtained by linking multiple network modules in microfluidic flow reactors. The methodology developed here provides a general framework to construct dissipative, tunable and robust (bio)chemical reaction networks.

The Need and Keys for a New Generation Network Adjustment Software

NASA Astrophysics Data System (ADS)

Colomina, I.; Blázquez, M.; Navarro, J. A.; Sastre, J.

2012-07-01

Orientation and calibration of photogrammetric and remote sensing instruments is a fundamental capacity of current mapping systems and a fundamental research topic. Neither digital remote sensing acquisition systems nor direct orientation gear, like INS and GNSS technologies, made block adjustment obsolete. On the contrary, the continuous flow of new primary data acquisition systems has challenged the capacity of the legacy block adjustment systems - in general network adjustment systems - in many aspects: extensibility, genericity, portability, large data sets capacity, metadata support and many others. In this article, we concentrate on the extensibility and genericity challenges that current and future network systems shall face. For this purpose we propose a number of software design strategies with emphasis on rigorous abstract modeling that help in achieving simplicity, genericity and extensibility together with the protection of intellectual proper rights in a flexible manner. We illustrate our suggestions with the general design approach of GENA, the generic extensible network adjustment system of GeoNumerics.

Impulsive synchronization of stochastic reaction-diffusion neural networks with mixed time delays.

PubMed

Sheng, Yin; Zeng, Zhigang

2018-07-01

This paper discusses impulsive synchronization of stochastic reaction-diffusion neural networks with Dirichlet boundary conditions and hybrid time delays. By virtue of inequality techniques, theories of stochastic analysis, linear matrix inequalities, and the contradiction method, sufficient criteria are proposed to ensure exponential synchronization of the addressed stochastic reaction-diffusion neural networks with mixed time delays via a designed impulsive controller. Compared with some recent studies, the neural network models herein are more general, some restrictions are relaxed, and the obtained conditions enhance and generalize some published ones. Finally, two numerical simulations are performed to substantiate the validity and merits of the developed theoretical analysis. Copyright © 2018 Elsevier Ltd. All rights reserved.

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.

Improved Lower Bounds on the Price of Stability of Undirected Network Design Games

NASA Astrophysics Data System (ADS)

Bilò, Vittorio; Caragiannis, Ioannis; Fanelli, Angelo; Monaco, Gianpiero

Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda. Even though the generalization of such games in directed networks is well understood in terms of the price of stability (it is exactly H n , the n-th harmonic number, for games with n players), far less is known for network design games in undirected networks. The upper bound carries over to this case as well while the best known lower bound is 42/23 ≈ 1.826. For more restricted but interesting variants of such games such as broadcast and multicast games, sublogarithmic upper bounds are known while the best known lower bound is 12/7 ≈ 1.714. In the current paper, we improve the lower bounds as follows. We break the psychological barrier of 2 by showing that the price of stability of undirected network design games is at least 348/155 ≈ 2.245. Our proof uses a recursive construction of a network design game with a simple gadget as the main building block. For broadcast and multicast games, we present new lower bounds of 20/11 ≈ 1.818 and 1.862, respectively.

Performance management of multiple access communication networks

NASA Astrophysics Data System (ADS)

Lee, Suk; Ray, Asok

1993-12-01

This paper focuses on conceptual design, development, and implementation of a performance management tool for computer communication networks to serve large-scale integrated systems. The objective is to improve the network performance in handling various types of messages by on-line adjustment of protocol parameters. The techniques of perturbation analysis of Discrete Event Dynamic Systems (DEDS), stochastic approximation (SA), and learning automata have been used in formulating the algorithm of performance management. The efficacy of the performance management tool has been demonstrated on a network testbed. The conceptual design presented in this paper offers a step forward to bridging the gap between management standards and users' demands for efficient network operations since most standards such as ISO (International Standards Organization) and IEEE address only the architecture, services, and interfaces for network management. The proposed concept of performance management can also be used as a general framework to assist design, operation, and management of various DEDS such as computer integrated manufacturing and battlefield C(sup 3) (Command, Control, and Communications).

Planning Communication Networks to Deliver Educational Services.

ERIC Educational Resources Information Center

Ballard, Richard J.; Eastwood, Lester F., Jr.

As companion to the more general document Telecommunications Media for the Delivery of Educational Programming , this report concentrates on the technical and economic factors affecting the design of only one class of educational networks, dedicated coaxial cable systems. To provide illustrations, possible single and dual dedicated cable networks…

Themes and methods of research presented at European General Practice Research Network conferences.

PubMed

Kruschinski, Carsten; Lange, Maaike; Lionis, Christos; van Weel, Chris; Hummers-Pradier, Eva

2010-08-01

The World Organization of Family Doctors (Wonca) defined core characteristics of general practice and general practitioners' competencies. It is unclear to which extent research has addressed these issues so far. To determine themes and research methods of general practice research as reflected by presentations at the European General Practice Research Network (EGPRN) meetings. Descriptive and retrospective study. All abstracts presented at each of the 14 EGPRN conferences between June 2001 and October 2007 were analysed for content and study design/methodology. Categories for content were developed inductively; a predefined hierarchical scheme was used for study designs. A total of N=614 abstracts were classified. The main research topics were related to GP/health service issues (n=232), clinical (n=148) and patient-related themes (n=118). Original data (n=558) were mainly derived from cross-sectional designs (38.7%). Intervention studies (11.0%), longitudinal designs including case-control and cohort studies (13.3%) as well as instrumental research (2.2%) were less common. More than one-fourth of all original studies were qualitative studies (27.6%). Stratified analysis revealed that cross-sectional designs were less frequent in the second half of conferences. Analysis by country showed that, in contrast to different quantitative designs, the proportion of qualitative studies was comparable. To test effectiveness of diagnostic and therapeutic interventions under primary care conditions, a higher proportion of experimental studies would be preferable. This could increase the acceptance of general practitioners' specific approaches and provide clear guidance on approaches and procedures, especially in health care systems not predominantly based on primary care.

Network protocols for real-time applications

NASA Technical Reports Server (NTRS)

Johnson, Marjory J.

1987-01-01

The Fiber Distributed Data Interface (FDDI) and the SAE AE-9B High Speed Ring Bus (HSRB) are emerging standards for high-performance token ring local area networks. FDDI was designed to be a general-purpose high-performance network. HSRB was designed specifically for military real-time applications. A workshop was conducted at NASA Ames Research Center in January, 1987 to compare and contrast these protocols with respect to their ability to support real-time applications. This report summarizes workshop presentations and includes an independent comparison of the two protocols. A conclusion reached at the workshop was that current protocols for the upper layers of the Open Systems Interconnection (OSI) network model are inadequate for real-time applications.

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

NASA Astrophysics Data System (ADS)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

What is the optimal architecture for visual information routing?

PubMed

Wolfrum, Philipp; von der Malsburg, Christoph

2007-12-01

Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.

Resilience-based optimal design of water distribution network

NASA Astrophysics Data System (ADS)

Suribabu, C. R.

2017-11-01

Optimal design of water distribution network is generally aimed to minimize the capital cost of the investments on tanks, pipes, pumps, and other appurtenances. Minimizing the cost of pipes is usually considered as a prime objective as its proportion in capital cost of the water distribution system project is very high. However, minimizing the capital cost of the pipeline alone may result in economical network configuration, but it may not be a promising solution in terms of resilience point of view. Resilience of the water distribution network has been considered as one of the popular surrogate measures to address ability of network to withstand failure scenarios. To improve the resiliency of the network, the pipe network optimization can be performed with two objectives, namely minimizing the capital cost as first objective and maximizing resilience measure of the configuration as secondary objective. In the present work, these two objectives are combined as single objective and optimization problem is solved by differential evolution technique. The paper illustrates the procedure for normalizing the objective functions having distinct metrics. Two of the existing resilience indices and power efficiency are considered for optimal design of water distribution network. The proposed normalized objective function is found to be efficient under weighted method of handling multi-objective water distribution design problem. The numerical results of the design indicate the importance of sizing pipe telescopically along shortest path of flow to have enhanced resiliency indices.

Conic section function neural network circuitry for offline signature recognition.

PubMed

Erkmen, Burcu; Kahraman, Nihan; Vural, Revna A; Yildirim, Tulay

2010-04-01

In this brief, conic section function neural network (CSFNN) circuitry was designed for offline signature recognition. CSFNN is a unified framework for multilayer perceptron (MLP) and radial basis function (RBF) networks to make simultaneous use of advantages of both. The CSFNN circuitry architecture was developed using a mixed mode circuit implementation. The designed circuit system is problem independent. Hence, the general purpose neural network circuit system could be applied to various pattern recognition problems with different network sizes on condition with the maximum network size of 16-16-8. In this brief, CSFNN circuitry system has been applied to two different signature recognition problems. CSFNN circuitry was trained with chip-in-the-loop learning technique in order to compensate typical analog process variations. CSFNN hardware achieved highly comparable computational performances with CSFNN software for nonlinear signature recognition problems.

Eradicating catastrophic collapse in interdependent networks via reinforced nodes

PubMed Central

Yuan, Xin; Hu, Yanqing; Havlin, Shlomo

2017-01-01

In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together with their connected neighbors can still be functioning after disconnected from the giant component. Here, we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter—the functioning component—comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, it is found that, for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent Erdős–Rényi (ER) networks: regular random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NONs). These findings might yield insight for designing resilient interdependent infrastructure networks. PMID:28289204

Least dissipation cost as a design principle for robustness and function of cellular networks

NASA Astrophysics Data System (ADS)

Han, Bo; Wang, Jin

2008-03-01

From a study of the budding yeast cell cycle, we found that the cellular network evolves to have the least cost for realizing its biological function. We quantify the cost in terms of the dissipation or heat loss characterized through the steady-state properties: the underlying landscape and the associated flux. We found that the dissipation cost is intimately related to the stability and robustness of the network. With the least dissipation cost, the network becomes most stable and robust under mutations and perturbations on the sharpness of the response from input to output as well as self-degradations. The least dissipation cost may provide a general design principle for the cellular network to survive from the evolution and realize the biological function.

A generalized optimization principle for asymmetric branching in fluidic networks

PubMed Central

Stephenson, David

2016-01-01

When applied to a branching network, Murray’s law states that the optimal branching of vascular networks is achieved when the cube of the parent channel radius is equal to the sum of the cubes of the daughter channel radii. It is considered integral to understanding biological networks and for the biomimetic design of artificial fluidic systems. However, despite its ubiquity, we demonstrate that Murray’s law is only optimal (i.e. maximizes flow conductance per unit volume) for symmetric branching, where the local optimization of each individual channel corresponds to the global optimum of the network as a whole. In this paper, we present a generalized law that is valid for asymmetric branching, for any cross-sectional shape, and for a range of fluidic models. We verify our analytical solutions with the numerical optimization of a bifurcating fluidic network for the examples of laminar, turbulent and non-Newtonian fluid flows. PMID:27493583

Effects of Interdisciplinary Education on Technology-Driven Application Design

ERIC Educational Resources Information Center

Tafa, Z.; Rakocevic, G.; Mihailovic, D.; Milutinovic, V.

2011-01-01

This paper describes the structure and the underlying rationale of a new course dedicated to capability maturity model integration (CMMI)-directed design of wireless sensor networks (WSNs)-based biomedical applications that stresses: 1) engineering-, medico-engineering-, and informatics-related issues; 2) design for general- and special-purpose…

Generalizing the Network Scale-Up Method: A New Estimator for the Size of Hidden Populations*

PubMed Central

Feehan, Dennis M.; Salganik, Matthew J.

2018-01-01

The network scale-up method enables researchers to estimate the size of hidden populations, such as drug injectors and sex workers, using sampled social network data. The basic scale-up estimator offers advantages over other size estimation techniques, but it depends on problematic modeling assumptions. We propose a new generalized scale-up estimator that can be used in settings with non-random social mixing and imperfect awareness about membership in the hidden population. Further, the new estimator can be used when data are collected via complex sample designs and from incomplete sampling frames. However, the generalized scale-up estimator also requires data from two samples: one from the frame population and one from the hidden population. In some situations these data from the hidden population can be collected by adding a small number of questions to already planned studies. For other situations, we develop interpretable adjustment factors that can be applied to the basic scale-up estimator. We conclude with practical recommendations for the design and analysis of future studies. PMID:29375167

Engineering online and in-person social networks to sustain physical activity: application of a conceptual model

PubMed Central

2013-01-01

Background High rates of physical inactivity compromise the health status of populations globally. Social networks have been shown to influence physical activity (PA), but little is known about how best to engineer social networks to sustain PA. To improve procedures for building networks that shape PA as a normative behavior, there is a need for more specific hypotheses about how social variables influence PA. There is also a need to integrate concepts from network science with ecological concepts that often guide the design of in-person and electronically-mediated interventions. Therefore, this paper: (1) proposes a conceptual model that integrates principles from network science and ecology across in-person and electronically-mediated intervention modes; and (2) illustrates the application of this model to the design and evaluation of a social network intervention for PA. Methods/Design A conceptual model for engineering social networks was developed based on a scoping literature review of modifiable social influences on PA. The model guided the design of a cluster randomized controlled trial in which 308 sedentary adults were randomly assigned to three groups: WalkLink+: prompted and provided feedback on participants’ online and in-person social-network interactions to expand networks for PA, plus provided evidence-based online walking program and weekly walking tips; WalkLink: evidence-based online walking program and weekly tips only; Minimal Treatment Control: weekly tips only. The effects of these treatment conditions were assessed at baseline, post-program, and 6-month follow-up. The primary outcome was accelerometer-measured PA. Secondary outcomes included objectively-measured aerobic fitness, body mass index, waist circumference, blood pressure, and neighborhood walkability; and self-reported measures of the physical environment, social network environment, and social network interactions. The differential effects of the three treatment conditions on primary and secondary outcomes will be analyzed using general linear modeling (GLM), or generalized linear modeling if the assumptions for GLM cannot be met. Discussion Results will contribute to greater understanding of how to conceptualize and implement social networks to support long-term PA. Establishing social networks for PA across multiple life settings could contribute to cultural norms that sustain active living. Trial registration ClinicalTrials.gov NCT01142804 PMID:23945138

The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis

DTIC Science & Technology

2017-09-01

being pushed over the minimum designated threshold. 1.4 Motivation A simple setting to motivate this research is the “30 minutes or it’s free” guarantee...parallel network structure in Fig. 4.4 is simple in design , yet shows a relatively high resilience when compared to the other networks in general. The high...United States Naval Academy, 2002 Submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE IN OPERATIONS RESEARCH

Epidemic Percolation Networks, Epidemic Outcomes, and Interventions

DOE PAGES

Kenah, Eben; Miller, Joel C.

2011-01-01

Epidemic percolation networks (EPNs) are directed random networks that can be used to analyze stochastic “Susceptible-Infectious-Removed” (SIR) and “Susceptible-Exposed-Infectious-Removed” (SEIR) epidemic models, unifying and generalizing previous uses of networks and branching processes to analyze mass-action and network-based S(E)IR models. This paper explains the fundamental concepts underlying the definition and use of EPNs, using them to build intuition about the final outcomes of epidemics. We then show how EPNs provide a novel and useful perspective on the design of vaccination strategies.

Epidemic Percolation Networks, Epidemic Outcomes, and Interventions

PubMed Central

Kenah, Eben; Miller, Joel C.

2011-01-01

Epidemic percolation networks (EPNs) are directed random networks that can be used to analyze stochastic “Susceptible-Infectious-Removed” (SIR) and “Susceptible-Exposed-Infectious-Removed” (SEIR) epidemic models, unifying and generalizing previous uses of networks and branching processes to analyze mass-action and network-based S(E)IR models. This paper explains the fundamental concepts underlying the definition and use of EPNs, using them to build intuition about the final outcomes of epidemics. We then show how EPNs provide a novel and useful perspective on the design of vaccination strategies. PMID:21437002

Design of fuzzy systems using neurofuzzy networks.

PubMed

Figueiredo, M; Gomide, F

1999-01-01

This paper introduces a systematic approach for fuzzy system design based on a class of neural fuzzy networks built upon a general neuron model. The network structure is such that it encodes the knowledge learned in the form of if-then fuzzy rules and processes data following fuzzy reasoning principles. The technique provides a mechanism to obtain rules covering the whole input/output space as well as the membership functions (including their shapes) for each input variable. Such characteristics are of utmost importance in fuzzy systems design and application. In addition, after learning, it is very simple to extract fuzzy rules in the linguistic form. The network has universal approximation capability, a property very useful in, e.g., modeling and control applications. Here we focus on function approximation problems as a vehicle to illustrate its usefulness and to evaluate its performance. Comparisons with alternative approaches are also included. Both, nonnoisy and noisy data have been studied and considered in the computational experiments. The neural fuzzy network developed here and, consequently, the underlying approach, has shown to provide good results from the accuracy, complexity, and system design points of view.

Plug in to the Utah Library Network, Reach Out to the World. Utah Library Network and Internet Training Handbook [for DOS]. Information Forum Publication #7.

ERIC Educational Resources Information Center

Reinwand, Louis; And Others

This manual is designed to assist public libraries in Utah in their use of the Internet. Many of the examples used were created specifically to explain the use of products that the Utah Library Network provides for public libraries in Utah. The introduction provides background history and general information about the Internet and general…

A reverse engineering approach to optimize experiments for the construction of biological regulatory networks.

PubMed

Zhang, Xiaomeng; Shao, Bin; Wu, Yangle; Qi, Ouyang

2013-01-01

One of the major objectives in systems biology is to understand the relation between the topological structures and the dynamics of biological regulatory networks. In this context, various mathematical tools have been developed to deduct structures of regulatory networks from microarray expression data. In general, from a single data set, one cannot deduct the whole network structure; additional expression data are usually needed. Thus how to design a microarray expression experiment in order to get the most information is a practical problem in systems biology. Here we propose three methods, namely, maximum distance method, trajectory entropy method, and sampling method, to derive the optimal initial conditions for experiments. The performance of these methods is tested and evaluated in three well-known regulatory networks (budding yeast cell cycle, fission yeast cell cycle, and E. coli. SOS network). Based on the evaluation, we propose an efficient strategy for the design of microarray expression experiments.

Receiver-exciter controller design

NASA Technical Reports Server (NTRS)

Jansma, P. A.

1982-01-01

A description of the general design of both the block 3 and block 4 receiver-exciter controllers for the Deep Space Network (DSN) Mark IV-A System is presented along with the design approach. The controllers are designed to enable the receiver-exciter subsystem (RCV) to be configured, calibrated, initialized and operated from a central location via high level instructions. The RECs are designed to be operated under the control of the DMC subsystem. The instructions are in the form of standard subsystem blocks (SSBs) received via the local area network (LAN). The centralized control provided by RECs and other DSCC controllers in Mark IV-A is intended to reduce DSN operations costs from the Mark III era.

Control Centrality and Hierarchical Structure in Complex Networks

PubMed Central

Liu, Yang-Yu; Slotine, Jean-Jacques; Barabási, Albert-László

2012-01-01

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network’s degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its layer index or topological position in the underlying hierarchical structure of the network. Inspired by the deep relation between control centrality and hierarchical structure in a general directed network, we design an efficient attack strategy against the controllability of malicious networks. PMID:23028542

Engineering online and in-person social networks to sustain physical activity: application of a conceptual model.

PubMed

Rovniak, Liza S; Sallis, James F; Kraschnewski, Jennifer L; Sciamanna, Christopher N; Kiser, Elizabeth J; Ray, Chester A; Chinchilli, Vernon M; Ding, Ding; Matthews, Stephen A; Bopp, Melissa; George, Daniel R; Hovell, Melbourne F

2013-08-14

High rates of physical inactivity compromise the health status of populations globally. Social networks have been shown to influence physical activity (PA), but little is known about how best to engineer social networks to sustain PA. To improve procedures for building networks that shape PA as a normative behavior, there is a need for more specific hypotheses about how social variables influence PA. There is also a need to integrate concepts from network science with ecological concepts that often guide the design of in-person and electronically-mediated interventions. Therefore, this paper: (1) proposes a conceptual model that integrates principles from network science and ecology across in-person and electronically-mediated intervention modes; and (2) illustrates the application of this model to the design and evaluation of a social network intervention for PA. A conceptual model for engineering social networks was developed based on a scoping literature review of modifiable social influences on PA. The model guided the design of a cluster randomized controlled trial in which 308 sedentary adults were randomly assigned to three groups: WalkLink+: prompted and provided feedback on participants' online and in-person social-network interactions to expand networks for PA, plus provided evidence-based online walking program and weekly walking tips; WalkLink: evidence-based online walking program and weekly tips only; Minimal Treatment Control: weekly tips only. The effects of these treatment conditions were assessed at baseline, post-program, and 6-month follow-up. The primary outcome was accelerometer-measured PA. Secondary outcomes included objectively-measured aerobic fitness, body mass index, waist circumference, blood pressure, and neighborhood walkability; and self-reported measures of the physical environment, social network environment, and social network interactions. The differential effects of the three treatment conditions on primary and secondary outcomes will be analyzed using general linear modeling (GLM), or generalized linear modeling if the assumptions for GLM cannot be met. Results will contribute to greater understanding of how to conceptualize and implement social networks to support long-term PA. Establishing social networks for PA across multiple life settings could contribute to cultural norms that sustain active living. ClinicalTrials.gov NCT01142804.

Development of Integrated Programs for Aerospace-vehicle design (IPAD): Reference design process

NASA Technical Reports Server (NTRS)

Meyer, D. D.

1979-01-01

The airplane design process and its interfaces with manufacturing and customer operations are documented to be used as criteria for the development of integrated programs for the analysis, design, and testing of aerospace vehicles. Topics cover: design process management, general purpose support requirements, design networks, and technical program elements. Design activity sequences are given for both supersonic and subsonic commercial transports, naval hydrofoils, and military aircraft.

Geometric Bioinspired Networks for Recognition of 2-D and 3-D Low-Level Structures and Transformations.

PubMed

Bayro-Corrochano, Eduardo; Vazquez-Santacruz, Eduardo; Moya-Sanchez, Eduardo; Castillo-Munis, Efrain

2016-10-01

This paper presents the design of radial basis function geometric bioinspired networks and their applications. Until now, the design of neural networks has been inspired by the biological models of neural networks but mostly using vector calculus and linear algebra. However, these designs have never shown the role of geometric computing. The question is how biological neural networks handle complex geometric representations involving Lie group operations like rotations. Even though the actual artificial neural networks are biologically inspired, they are just models which cannot reproduce a plausible biological process. Until now researchers have not shown how, using these models, one can incorporate them into the processing of geometric computing. Here, for the first time in the artificial neural networks domain, we address this issue by designing a kind of geometric RBF using the geometric algebra framework. As a result, using our artificial networks, we show how geometric computing can be carried out by the artificial neural networks. Such geometric neural networks have a great potential in robot vision. This is the most important aspect of this contribution to propose artificial geometric neural networks for challenging tasks in perception and action. In our experimental analysis, we show the applicability of our geometric designs, and present interesting experiments using 2-D data of real images and 3-D screw axis data. In general, our models should be used to process different types of inputs, such as visual cues, touch (texture, elasticity, temperature), taste, and sound. One important task of a perception-action system is to fuse a variety of cues coming from the environment and relate them via a sensor-motor manifold with motor modules to carry out diverse reasoned actions.

Design of robust flow processing networks with time-programmed responses

NASA Astrophysics Data System (ADS)

Kaluza, P.; Mikhailov, A. S.

2012-04-01

Can artificially designed networks reach the levels of robustness against local damage which are comparable with those of the biochemical networks of a living cell? We consider a simple model where the flow applied to an input node propagates through the network and arrives at different times to the output nodes, thus generating a pattern of coordinated responses. By using evolutionary optimization algorithms, functional networks - with required time-programmed responses - were constructed. Then, continuing the evolution, such networks were additionally optimized for robustness against deletion of individual nodes or links. In this manner, large ensembles of functional networks with different kinds of robustness were obtained, making statistical investigations and comparison of their structural properties possible. We have found that, generally, different architectures are needed for various kinds of robustness. The differences are statistically revealed, for example, in the Laplacian spectra of the respective graphs. On the other hand, motif distributions of robust networks do not differ from those of the merely functional networks; they are found to belong to the first Alon superfamily, the same as that of the gene transcription networks of single-cell organisms.

Modified-hybrid optical neural network filter for multiple object recognition within cluttered scenes

NASA Astrophysics Data System (ADS)

Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.

2009-08-01

Motivated by the non-linear interpolation and generalization abilities of the hybrid optical neural network filter between the reference and non-reference images of the true-class object we designed the modifiedhybrid optical neural network filter. We applied an optical mask to the hybrid optical neural network's filter input. The mask was built with the constant weight connections of a randomly chosen image included in the training set. The resulted design of the modified-hybrid optical neural network filter is optimized for performing best in cluttered scenes of the true-class object. Due to the shift invariance properties inherited by its correlator unit the filter can accommodate multiple objects of the same class to be detected within an input cluttered image. Additionally, the architecture of the neural network unit of the general hybrid optical neural network filter allows the recognition of multiple objects of different classes within the input cluttered image by modifying the output layer of the unit. We test the modified-hybrid optical neural network filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. The filter is shown to exhibit with a single pass over the input data simultaneously out-of-plane rotation, shift invariance and good clutter tolerance. It is able to successfully detect and classify correctly the true-class objects within background clutter for which there has been no previous training.

Network planning under uncertainties

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2008-11-01

One of the main focuses for network planning is on the optimization of network resources required to build a network under certain traffic demand projection. Traditionally, the inputs to this type of network planning problems are treated as deterministic. In reality, the varying traffic requirements and fluctuations in network resources can cause uncertainties in the decision models. The failure to include the uncertainties in the network design process can severely affect the feasibility and economics of the network. Therefore, it is essential to find a solution that can be insensitive to the uncertain conditions during the network planning process. As early as in the 1960's, a network planning problem with varying traffic requirements over time had been studied. Up to now, this kind of network planning problems is still being active researched, especially for the VPN network design. Another kind of network planning problems under uncertainties that has been studied actively in the past decade addresses the fluctuations in network resources. One such hotly pursued research topic is survivable network planning. It considers the design of a network under uncertainties brought by the fluctuations in topology to meet the requirement that the network remains intact up to a certain number of faults occurring anywhere in the network. Recently, the authors proposed a new planning methodology called Generalized Survivable Network that tackles the network design problem under both varying traffic requirements and fluctuations of topology. Although all the above network planning problems handle various kinds of uncertainties, it is hard to find a generic framework under more general uncertainty conditions that allows a more systematic way to solve the problems. With a unified framework, the seemingly diverse models and algorithms can be intimately related and possibly more insights and improvements can be brought out for solving the problem. This motivates us to seek a generic framework for solving the network planning problem under uncertainties. In addition to reviewing the various network planning problems involving uncertainties, we also propose that a unified framework based on robust optimization can be used to solve a rather large segment of network planning problem under uncertainties. Robust optimization is first introduced in the operations research literature and is a framework that incorporates information about the uncertainty sets for the parameters in the optimization model. Even though robust optimization is originated from tackling the uncertainty in the optimization process, it can serve as a comprehensive and suitable framework for tackling generic network planning problems under uncertainties. In this paper, we begin by explaining the main ideas behind the robust optimization approach. Then we demonstrate the capabilities of the proposed framework by giving out some examples of how the robust optimization framework can be applied to the current common network planning problems under uncertain environments. Next, we list some practical considerations for solving the network planning problem under uncertainties with the proposed framework. Finally, we conclude this article with some thoughts on the future directions for applying this framework to solve other network planning problems.

Efficient Analysis of Complex Structures

NASA Technical Reports Server (NTRS)

Kapania, Rakesh K.

2000-01-01

Last various accomplishments achieved during this project are : (1) A Survey of Neural Network (NN) applications using MATLAB NN Toolbox on structural engineering especially on equivalent continuum models (Appendix A). (2) Application of NN and GAs to simulate and synthesize substructures: 1-D and 2-D beam problems (Appendix B). (3) Development of an equivalent plate-model analysis method (EPA) for static and vibration analysis of general trapezoidal built-up wing structures composed of skins, spars and ribs. Calculation of all sorts of test cases and comparison with measurements or FEA results. (Appendix C). (4) Basic work on using second order sensitivities on simulating wing modal response, discussion of sensitivity evaluation approaches, and some results (Appendix D). (5) Establishing a general methodology of simulating the modal responses by direct application of NN and by sensitivity techniques, in a design space composed of a number of design points. Comparison is made through examples using these two methods (Appendix E). (6) Establishing a general methodology of efficient analysis of complex wing structures by indirect application of NN: the NN-aided Equivalent Plate Analysis. Training of the Neural Networks for this purpose in several cases of design spaces, which can be applicable for actual design of complex wings (Appendix F).

Globally fixed-time synchronization of coupled neutral-type neural network with mixed time-varying delays.

PubMed

Zheng, Mingwen; Li, Lixiang; Peng, Haipeng; Xiao, Jinghua; Yang, Yixian; Zhang, Yanping; Zhao, Hui

2018-01-01

This paper mainly studies the globally fixed-time synchronization of a class of coupled neutral-type neural networks with mixed time-varying delays via discontinuous feedback controllers. Compared with the traditional neutral-type neural network model, the model in this paper is more general. A class of general discontinuous feedback controllers are designed. With the help of the definition of fixed-time synchronization, the upper right-hand derivative and a defined simple Lyapunov function, some easily verifiable and extensible synchronization criteria are derived to guarantee the fixed-time synchronization between the drive and response systems. Finally, two numerical simulations are given to verify the correctness of the results.

Globally fixed-time synchronization of coupled neutral-type neural network with mixed time-varying delays

PubMed Central

2018-01-01

This paper mainly studies the globally fixed-time synchronization of a class of coupled neutral-type neural networks with mixed time-varying delays via discontinuous feedback controllers. Compared with the traditional neutral-type neural network model, the model in this paper is more general. A class of general discontinuous feedback controllers are designed. With the help of the definition of fixed-time synchronization, the upper right-hand derivative and a defined simple Lyapunov function, some easily verifiable and extensible synchronization criteria are derived to guarantee the fixed-time synchronization between the drive and response systems. Finally, two numerical simulations are given to verify the correctness of the results. PMID:29370248

A Diagrammatic Language for Biochemical Networks

NASA Astrophysics Data System (ADS)

Maimon, Ron

2002-03-01

I present a diagrammatic language for representing the structure of biochemical networks. The language is designed to represent modular structure in a computational fasion, with composition of reactions replacing functional composition. This notation is used to represent arbitrarily large networks efficiently. The notation finds its most natural use in representing biological interaction networks, but it is a general computing language appropriate to any naturally occuring computation. Unlike lambda-calculus, or text-derived languages, it does not impose a tree-structure on the diagrams, and so is more effective at representing biological fucntion than competing notations.

Design and Promotion Strategy of Marketing Platform of Aquatic Auction based on Internet

NASA Astrophysics Data System (ADS)

Peng, Jianliang

For the online trade and promotion of aquatic products and related materials through the network between supply and demand, the design content and effective promotional strategies of aquatic auctions online marketing platform is proposed in this paper. Design elements involve the location of customer service, the basic function of the platform including the purchase of general orders, online auctions, information dissemination, and recommendation of fine products, human services, and payment preferences. Based on network and mobile e-commerce transaction support, the auction platform makes the transaction of aquatic products well in advance. The results are important practical value for the design and application of online marketing platform of aquatic auction.

Diagnostic layer integration in FPGA-based pipeline measurement systems for HEP experiments

NASA Astrophysics Data System (ADS)

Pozniak, Krzysztof T.

2007-08-01

Integrated triggering and data acquisition systems for high energy physics experiments may be considered as fast, multichannel, synchronous, distributed, pipeline measurement systems. A considerable extension of functional, technological and monitoring demands, which has recently been imposed on them, forced a common usage of large field-programmable gate array (FPGA), digital signal processing-enhanced matrices and fast optical transmission for their realization. This paper discusses modelling, design, realization and testing of pipeline measurement systems. A distribution of synchronous data stream flows is considered in the network. A general functional structure of a single network node is presented. A suggested, novel block structure of the node model facilitates full implementation in the FPGA chip, circuit standardization and parametrization, as well as integration of functional and diagnostic layers. A general method for pipeline system design was derived. This method is based on a unified model of the synchronous data network node. A few examples of practically realized, FPGA-based, pipeline measurement systems were presented. The described systems were applied in ZEUS and CMS.

Information Retrieval Using ADABAS-NATURAL (with Applications for Television and Radio).

ERIC Educational Resources Information Center

Silbergeld, I.; Kutok, P.

1984-01-01

Describes use of the software ADABAS (general purpose database management system) and NATURAL (interactive programing language) in development and implementation of an information retrieval system for the National Television and Radio Network of Israel. General design considerations, files contained in each archive, search strategies, and keywords…

Model-based design of RNA hybridization networks implemented in living cells

PubMed Central

Rodrigo, Guillermo; Prakash, Satya; Shen, Shensi; Majer, Eszter

2017-01-01

Abstract Synthetic gene circuits allow the behavior of living cells to be reprogrammed, and non-coding small RNAs (sRNAs) are increasingly being used as programmable regulators of gene expression. However, sRNAs (natural or synthetic) are generally used to regulate single target genes, while complex dynamic behaviors would require networks of sRNAs regulating each other. Here, we report a strategy for implementing such networks that exploits hybridization reactions carried out exclusively by multifaceted sRNAs that are both targets of and triggers for other sRNAs. These networks are ultimately coupled to the control of gene expression. We relied on a thermodynamic model of the different stable conformational states underlying this system at the nucleotide level. To test our model, we designed five different RNA hybridization networks with a linear architecture, and we implemented them in Escherichia coli. We validated the network architecture at the molecular level by native polyacrylamide gel electrophoresis, as well as the network function at the bacterial population and single-cell levels with a fluorescent reporter. Our results suggest that it is possible to engineer complex cellular programs based on RNA from first principles. Because these networks are mainly based on physical interactions, our designs could be expanded to other organisms as portable regulatory resources or to implement biological computations. PMID:28934501

A study of the spreading scheme for viral marketing based on a complex network model

NASA Astrophysics Data System (ADS)

Yang, Jianmei; Yao, Canzhong; Ma, Weicheng; Chen, Guanrong

2010-02-01

Buzzword-based viral marketing, known also as digital word-of-mouth marketing, is a marketing mode attached to some carriers on the Internet, which can rapidly copy marketing information at a low cost. Viral marketing actually uses a pre-existing social network where, however, the scale of the pre-existing network is believed to be so large and so random, so that its theoretical analysis is intractable and unmanageable. There are very few reports in the literature on how to design a spreading scheme for viral marketing on real social networks according to the traditional marketing theory or the relatively new network marketing theory. Complex network theory provides a new model for the study of large-scale complex systems, using the latest developments of graph theory and computing techniques. From this perspective, the present paper extends the complex network theory and modeling into the research of general viral marketing and develops a specific spreading scheme for viral marking and an approach to design the scheme based on a real complex network on the QQ instant messaging system. This approach is shown to be rather universal and can be further extended to the design of various spreading schemes for viral marketing based on different instant messaging systems.

Toward automatic time-series forecasting using neural networks.

PubMed

Yan, Weizhong

2012-07-01

Over the past few decades, application of artificial neural networks (ANN) to time-series forecasting (TSF) has been growing rapidly due to several unique features of ANN models. However, to date, a consistent ANN performance over different studies has not been achieved. Many factors contribute to the inconsistency in the performance of neural network models. One such factor is that ANN modeling involves determining a large number of design parameters, and the current design practice is essentially heuristic and ad hoc, this does not exploit the full potential of neural networks. Systematic ANN modeling processes and strategies for TSF are, therefore, greatly needed. Motivated by this need, this paper attempts to develop an automatic ANN modeling scheme. It is based on the generalized regression neural network (GRNN), a special type of neural network. By taking advantage of several GRNN properties (i.e., a single design parameter and fast learning) and by incorporating several design strategies (e.g., fusing multiple GRNNs), we have been able to make the proposed modeling scheme to be effective for modeling large-scale business time series. The initial model was entered into the NN3 time-series competition. It was awarded the best prediction on the reduced dataset among approximately 60 different models submitted by scholars worldwide.

A Rapid Aerodynamic Design Procedure Based on Artificial Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2001-01-01

An aerodynamic design procedure that uses neural networks to model the functional behavior of the objective function in design space has been developed. This method incorporates several improvements to an earlier method that employed a strategy called parameter-based partitioning of the design space in order to reduce the computational costs associated with design optimization. As with the earlier method, the current method uses a sequence of response surfaces to traverse the design space in search of the optimal solution. The new method yields significant reductions in computational costs by using composite response surfaces with better generalization capabilities and by exploiting synergies between the optimization method and the simulation codes used to generate the training data. These reductions in design optimization costs are demonstrated for a turbine airfoil design study where a generic shape is evolved into an optimal airfoil.

Design of a Forecasting Service System for Monitoring of Vulnerabilities of Sensor Networks

NASA Astrophysics Data System (ADS)

Song, Jae-Gu; Kim, Jong Hyun; Seo, Dong Il; Kim, Seoksoo

This study aims to reduce security vulnerabilities of sensor networks which transmit data in an open environment by developing a forecasting service system. The system is to remove or monitor causes of breach incidents in advance. To that end, this research first examines general security vulnerabilities of sensor networks and analyzes characteristics of existing forecasting systems. Then, 5 steps of a forecasting service system are proposed in order to improve security responses.

Approach to design neural cryptography: a generalized architecture and a heuristic rule.

PubMed

Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen

2013-06-01

Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.

Neural network and multiple linear regression to predict school children dimensions for ergonomic school furniture design.

PubMed

Agha, Salah R; Alnahhal, Mohammed J

2012-11-01

The current study investigates the possibility of obtaining the anthropometric dimensions, critical to school furniture design, without measuring all of them. The study first selects some anthropometric dimensions that are easy to measure. Two methods are then used to check if these easy-to-measure dimensions can predict the dimensions critical to the furniture design. These methods are multiple linear regression and neural networks. Each dimension that is deemed necessary to ergonomically design school furniture is expressed as a function of some other measured anthropometric dimensions. Results show that out of the five dimensions needed for chair design, four can be related to other dimensions that can be measured while children are standing. Therefore, the method suggested here would definitely save time and effort and avoid the difficulty of dealing with students while measuring these dimensions. In general, it was found that neural networks perform better than multiple linear regression in the current study. Copyright © 2012 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Enhancing synchronization stability in a multi-area power grid

PubMed Central

Wang, Bing; Suzuki, Hideyuki; Aihara, Kazuyuki

2016-01-01

Maintaining a synchronous state of generators is of central importance to the normal operation of power grids, in which many networks are generally interconnected. In order to understand the condition under which the stability can be optimized, it is important to relate network stability with feedback control strategies as well as network structure. Here, we present a stability analysis on a multi-area power grid by relating it with several control strategies and topological design of network structure. We clarify the minimal feedback gain in the self-feedback control, and build the optimal communication network for the local and global control strategies. Finally, we consider relationship between the interconnection pattern and the synchronization stability; by optimizing the network interlinks, the obtained network shows better synchronization stability than the original network does, in particular, at a high power demand. Our analysis shows that interlinks between spatially distant nodes will improve the synchronization stability. The results seem unfeasible to be implemented in real systems but provide a potential guide for the design of stable power systems. PMID:27225708

In-Space Networking On NASA's SCaN Testbed

NASA Technical Reports Server (NTRS)

Brooks, David; Eddy, Wesley M.; Clark, Gilbert J., III; Johnson, Sandra K.

2016-01-01

The NASA Space Communications and Navigation (SCaN) Testbed, an external payload onboard the International Space Station, is equipped with three software defined radios (SDRs) and a programmable flight computer. The purpose of the Testbed is to conduct inspace research in the areas of communication, navigation, and networking in support of NASA missions and communication infrastructure. Multiple reprogrammable elements in the end to end system, along with several communication paths and a semi-operational environment, provides a unique opportunity to explore networking concepts and protocols envisioned for the future Solar System Internet (SSI). This paper will provide a general description of the system's design and the networking protocols implemented and characterized on the testbed, including Encapsulation, IP over CCSDS, and Delay-Tolerant Networking (DTN). Due to the research nature of the implementation, flexibility and robustness are considered in the design to enable expansion for future adaptive and cognitive techniques. Following a detailed design discussion, lessons learned and suggestions for future missions and communication infrastructure elements will be provided. Plans for the evolving research on SCaN Testbed as it moves towards a more adaptive, autonomous system will be discussed.

A compositional framework for reaction networks

NASA Astrophysics Data System (ADS)

Baez, John C.; Pollard, Blake S.

Reaction networks, or equivalently Petri nets, are a general framework for describing processes in which entities of various kinds interact and turn into other entities. In chemistry, where the reactions are assigned ‘rate constants’, any reaction network gives rise to a nonlinear dynamical system called its ‘rate equation’. Here we generalize these ideas to ‘open’ reaction networks, which allow entities to flow in and out at certain designated inputs and outputs. We treat open reaction networks as morphisms in a category. Composing two such morphisms connects the outputs of the first to the inputs of the second. We construct a functor sending any open reaction network to its corresponding ‘open dynamical system’. This provides a compositional framework for studying the dynamics of reaction networks. We then turn to statics: that is, steady state solutions of open dynamical systems. We construct a ‘black-boxing’ functor that sends any open dynamical system to the relation that it imposes between input and output variables in steady states. This extends our earlier work on black-boxing for Markov processes.

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks

PubMed Central

Cannistraci, Carlo Vittorio; Alanis-Lobato, Gregorio; Ravasi, Timothy

2013-01-01

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial. PMID:23563395

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks.

PubMed

Cannistraci, Carlo Vittorio; Alanis-Lobato, Gregorio; Ravasi, Timothy

2013-01-01

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial.

Game among interdependent networks: The impact of rationality on system robustness

NASA Astrophysics Data System (ADS)

Fan, Yuhang; Cao, Gongze; He, Shibo; Chen, Jiming; Sun, Youxian

2016-12-01

Many real-world systems are composed of interdependent networks that rely on one another. Such networks are typically designed and operated by different entities, who aim at maximizing their own payoffs. There exists a game among these entities when designing their own networks. In this paper, we study the game investigating how the rational behaviors of entities impact the system robustness. We first introduce a mathematical model to quantify the interacting payoffs among varying entities. Then we study the Nash equilibrium of the game and compare it with the optimal social welfare. We reveal that the cooperation among different entities can be reached to maximize the social welfare in continuous game only when the average degree of each network is constant. Therefore, the huge gap between Nash equilibrium and optimal social welfare generally exists. The rationality of entities makes the system inherently deficient and even renders it extremely vulnerable in some cases. We analyze our model for two concrete systems with continuous strategy space and discrete strategy space, respectively. Furthermore, we uncover some factors (such as weakening coupled strength of interdependent networks, designing a suitable topology dependence of the system) that help reduce the gap and the system vulnerability.

The middleware architecture supports heterogeneous network systems for module-based personal robot system

NASA Astrophysics Data System (ADS)

Choo, Seongho; Li, Vitaly; Choi, Dong Hee; Jung, Gi Deck; Park, Hong Seong; Ryuh, Youngsun

2005-12-01

On developing the personal robot system presently, the internal architecture is every module those occupy separated functions are connected through heterogeneous network system. This module-based architecture supports specialization and division of labor at not only designing but also implementation, as an effect of this architecture, it can reduce developing times and costs for modules. Furthermore, because every module is connected among other modules through network systems, we can get easy integrations and synergy effect to apply advanced mutual functions by co-working some modules. In this architecture, one of the most important technologies is the network middleware that takes charge communications among each modules connected through heterogeneous networks systems. The network middleware acts as the human nerve system inside of personal robot system; it relays, transmits, and translates information appropriately between modules that are similar to human organizations. The network middleware supports various hardware platform, heterogeneous network systems (Ethernet, Wireless LAN, USB, IEEE 1394, CAN, CDMA-SMS, RS-232C). This paper discussed some mechanisms about our network middleware to intercommunication and routing among modules, methods for real-time data communication and fault-tolerant network service. There have designed and implemented a layered network middleware scheme, distributed routing management, network monitoring/notification technology on heterogeneous networks for these goals. The main theme is how to make routing information in our network middleware. Additionally, with this routing information table, we appended some features. Now we are designing, making a new version network middleware (we call 'OO M/W') that can support object-oriented operation, also are updating program sources itself for object-oriented architecture. It is lighter, faster, and can support more operation systems and heterogeneous network systems, but other general purposed middlewares like CORBA, UPnP, etc. can support only one network protocol or operating system.

Reinforcement learning controller design for affine nonlinear discrete-time systems using online approximators.

PubMed

Yang, Qinmin; Jagannathan, Sarangapani

2012-04-01

In this paper, reinforcement learning state- and output-feedback-based adaptive critic controller designs are proposed by using the online approximators (OLAs) for a general multi-input and multioutput affine unknown nonlinear discretetime systems in the presence of bounded disturbances. The proposed controller design has two entities, an action network that is designed to produce optimal signal and a critic network that evaluates the performance of the action network. The critic estimates the cost-to-go function which is tuned online using recursive equations derived from heuristic dynamic programming. Here, neural networks (NNs) are used both for the action and critic whereas any OLAs, such as radial basis functions, splines, fuzzy logic, etc., can be utilized. For the output-feedback counterpart, an additional NN is designated as the observer to estimate the unavailable system states, and thus, separation principle is not required. The NN weight tuning laws for the controller schemes are also derived while ensuring uniform ultimate boundedness of the closed-loop system using Lyapunov theory. Finally, the effectiveness of the two controllers is tested in simulation on a pendulum balancing system and a two-link robotic arm system.

Periodic bidirectional associative memory neural networks with distributed delays

NASA Astrophysics Data System (ADS)

Chen, Anping; Huang, Lihong; Liu, Zhigang; Cao, Jinde

2006-05-01

Some sufficient conditions are obtained for the existence and global exponential stability of a periodic solution to the general bidirectional associative memory (BAM) neural networks with distributed delays by using the continuation theorem of Mawhin's coincidence degree theory and the Lyapunov functional method and the Young's inequality technique. These results are helpful for designing a globally exponentially stable and periodic oscillatory BAM neural network, and the conditions can be easily verified and be applied in practice. An example is also given to illustrate our results.

Adaptive Neural Network Based Control of Noncanonical Nonlinear Systems.

PubMed

Zhang, Yanjun; Tao, Gang; Chen, Mou

2016-09-01

This paper presents a new study on the adaptive neural network-based control of a class of noncanonical nonlinear systems with large parametric uncertainties. Unlike commonly studied canonical form nonlinear systems whose neural network approximation system models have explicit relative degree structures, which can directly be used to derive parameterized controllers for adaptation, noncanonical form nonlinear systems usually do not have explicit relative degrees, and thus their approximation system models are also in noncanonical forms. It is well-known that the adaptive control of noncanonical form nonlinear systems involves the parameterization of system dynamics. As demonstrated in this paper, it is also the case for noncanonical neural network approximation system models. Effective control of such systems is an open research problem, especially in the presence of uncertain parameters. This paper shows that it is necessary to reparameterize such neural network system models for adaptive control design, and that such reparameterization can be realized using a relative degree formulation, a concept yet to be studied for general neural network system models. This paper then derives the parameterized controllers that guarantee closed-loop stability and asymptotic output tracking for noncanonical form neural network system models. An illustrative example is presented with the simulation results to demonstrate the control design procedure, and to verify the effectiveness of such a new design method.

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Online learning control using adaptive critic designs with sparse kernel machines.

PubMed

Xu, Xin; Hou, Zhongsheng; Lian, Chuanqiang; He, Haibo

2013-05-01

In the past decade, adaptive critic designs (ACDs), including heuristic dynamic programming (HDP), dual heuristic programming (DHP), and their action-dependent ones, have been widely studied to realize online learning control of dynamical systems. However, because neural networks with manually designed features are commonly used to deal with continuous state and action spaces, the generalization capability and learning efficiency of previous ACDs still need to be improved. In this paper, a novel framework of ACDs with sparse kernel machines is presented by integrating kernel methods into the critic of ACDs. To improve the generalization capability as well as the computational efficiency of kernel machines, a sparsification method based on the approximately linear dependence analysis is used. Using the sparse kernel machines, two kernel-based ACD algorithms, that is, kernel HDP (KHDP) and kernel DHP (KDHP), are proposed and their performance is analyzed both theoretically and empirically. Because of the representation learning and generalization capability of sparse kernel machines, KHDP and KDHP can obtain much better performance than previous HDP and DHP with manually designed neural networks. Simulation and experimental results of two nonlinear control problems, that is, a continuous-action inverted pendulum problem and a ball and plate control problem, demonstrate the effectiveness of the proposed kernel ACD methods.

Human-computer interaction reflected in the design of user interfaces for general practitioners.

PubMed

Stoicu-Tivadar, Lacramioara; Stoicu-Tivadar, Vasile

2006-01-01

To address the problem of properly built health information systems in general practice as an important issue for their approval and use in clinical practice. We present how a national general practitioner (GP) network was built, put in practice and several results of its activity seen from the clinician's and the software application team's points of view. We used a multi-level incremental development appropriate for the conditions of the required information system. After the development of the first version of the software components (based on rapid prototyping) of the sentinel network, a questionnaire addressed the needs and improvements required by the health professionals. Based on the answers, the functionality of the system and the interface were improved regarding the real needs expressed by the end-users. The network is functional and the collected data from the network are being processed using statistical methods. The academic software team developed a GP application that is well received by the GPs in the network, as resulted from the survey and discussions during the training period. As an added confirmation, several GPs outside the network enrolled after seeing the software at work. Another confirmation that we did a good job was that after the final presentation of the results of the project a representative from the Romanian Society for Cardiology expressed the wish of this society to access the data yielded by the network.

Effects of Three Different Hypertextual Menu Designs on Various Information Searching Activities.

ERIC Educational Resources Information Center

Lai, Yee-Rong, Waugh, Michael L.

1995-01-01

Examines the influence of three combinations of document structures and menu designs on users' attitude, performance, and learning in search tasks. Three versions of a document introducing UNIX, Internet, BITNET, and general computing and networking resources at a university were implemented using HyperCard. Results showed that only the accuracy…

Model-based design of RNA hybridization networks implemented in living cells.

PubMed

Rodrigo, Guillermo; Prakash, Satya; Shen, Shensi; Majer, Eszter; Daròs, José-Antonio; Jaramillo, Alfonso

2017-09-19

Synthetic gene circuits allow the behavior of living cells to be reprogrammed, and non-coding small RNAs (sRNAs) are increasingly being used as programmable regulators of gene expression. However, sRNAs (natural or synthetic) are generally used to regulate single target genes, while complex dynamic behaviors would require networks of sRNAs regulating each other. Here, we report a strategy for implementing such networks that exploits hybridization reactions carried out exclusively by multifaceted sRNAs that are both targets of and triggers for other sRNAs. These networks are ultimately coupled to the control of gene expression. We relied on a thermodynamic model of the different stable conformational states underlying this system at the nucleotide level. To test our model, we designed five different RNA hybridization networks with a linear architecture, and we implemented them in Escherichia coli. We validated the network architecture at the molecular level by native polyacrylamide gel electrophoresis, as well as the network function at the bacterial population and single-cell levels with a fluorescent reporter. Our results suggest that it is possible to engineer complex cellular programs based on RNA from first principles. Because these networks are mainly based on physical interactions, our designs could be expanded to other organisms as portable regulatory resources or to implement biological computations. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

Capacity Analysis of Multihop Packet Radio Networks under a General Class of Channel Access Protocols and Capture Models

DTIC Science & Technology

1987-03-01

Gitman in [Gitm75]. The system considered consisted of a set of clusters (each with an infinite popula- tion of users) that communicate with a central...30, no. 5, pp. 985-995, May 1982. [Gitm75] I. Gitman , "On the Capacity of Slotted ALOHA Networks and Some Design Problems," IEEE Trans. Comm., vol

A Network Thermodynamic Framework for the Analysis and Control Design of Large-Scale Dynamical Systems

DTIC Science & Technology

2006-03-31

Nonnegative Dynamical Sys- tems................................................. 18 2.10. Adaptive Control for General Anesthesia and Intensive Care...Unit Sedation 20 2.11. Neural Network Adaptive Control for Intensive Care Unit Sedation and In- traoperative Anesthesia ...control for operating room hypnosis and intefisive care unit sedation. 1.3. Goals of this Report The main goal of this report is to summarize the

A reusability and efficiency oriented software design method for mobile land inspection

NASA Astrophysics Data System (ADS)

Cai, Wenwen; He, Jun; Wang, Qing

2008-10-01

Aiming at the requirement from the real-time land inspection domain, a land inspection handset system was presented in this paper. In order to increase the reusability of the system, a design pattern based framework was presented. Encapsulation for command like actions by applying COMMAND pattern was proposed for the problem of complex UI interactions. Integrating several GPS-log parsing engines into a general parsing framework was archived by introducing STRATEGY pattern. A network transmission module based network middleware was constructed. For mitigating the high coupling of complex network communication programs, FACTORY pattern was applied to facilitate the decoupling. Moreover, in order to efficiently manipulate huge GIS datasets, a VISITOR pattern and Quad-tree based multi-scale representation method was presented. It had been proved practically that these design patterns reduced the coupling between the subsystems, and improved the expansibility.

A General Map of Iron Metabolism and Tissue-specific Subnetworks

PubMed Central

Hower, Valerie; Mendes, Pedro; Torti, Frank M.; Laubenbacher, Reinhard; Akman, Steven; Shulaev, Vladmir; Torti, Suzy V.

2009-01-01

Iron is required for survival of mammalian cells. Recently, understanding of iron metabolism and trafficking has increased dramatically, revealing a complex, interacting network largely unknown just a few years ago. This provides an excellent model for systems biology development and analysis. The first step in such an analysis is the construction of a structural network of iron metabolism, which we present here. This network was created using CellDesigner version 3.5.2 and includes reactions occurring in mammalian cells of numerous tissue types. The iron metabolic network contains 151 chemical species and 107 reactions and transport steps. Starting from this general model, we construct iron networks for specific tissues and cells that are fundamental to maintaining body iron homeostasis. We include subnetworks for cells of the intestine and liver, tissues important in iron uptake and storage, respectively; as well as the reticulocyte and macrophage, key cells in iron utilization and recycling. The addition of kinetic information to our structural network will permit the simulation of iron metabolism in different tissues as well as in health and disease. PMID:19381358

Social Networking as a Platform for Role-Playing Scientific Case Studies

ERIC Educational Resources Information Center

Geyer, Andrea M.

2014-01-01

This work discusses the design and implementation of two online case studies in a face-to-face general chemistry course. The case studies were integrated into the course to emphasize the need for science literacy in general society, to enhance critical thinking, to introduce database searching, and to improve primary literature reading skills. An…

Autonomous sensor manager agents (ASMA)

NASA Astrophysics Data System (ADS)

Osadciw, Lisa A.

2004-04-01

Autonomous sensor manager agents are presented as an algorithm to perform sensor management within a multisensor fusion network. The design of the hybrid ant system/particle swarm agents is described in detail with some insight into their performance. Although the algorithm is designed for the general sensor management problem, a simulation example involving 2 radar systems is presented. Algorithmic parameters are determined by the size of the region covered by the sensor network, the number of sensors, and the number of parameters to be selected. With straight forward modifications, this algorithm can be adapted for most sensor management problems.

Generalized Synchronization in AN Array of Nonlinear Dynamic Systems with Applications to Chaotic Cnn

NASA Astrophysics Data System (ADS)

Min, Lequan; Chen, Guanrong

This paper establishes some generalized synchronization (GS) theorems for a coupled discrete array of difference systems (CDADS) and a coupled continuous array of differential systems (CCADS). These constructive theorems provide general representations of GS in CDADS and CCADS. Based on these theorems, one can design GS-driven CDADS and CCADS via appropriate (invertible) transformations. As applications, the results are applied to autonomous and nonautonomous coupled Chen cellular neural network (CNN) CDADS and CCADS, discrete bidirectional Lorenz CNN CDADS, nonautonomous bidirectional Chua CNN CCADS, and nonautonomously bidirectional Chen CNN CDADS and CCADS, respectively. Extensive numerical simulations show their complex dynamic behaviors. These theorems provide new means for understanding the GS phenomena of complex discrete and continuously differentiable networks.

Distributed dynamic simulations of networked control and building performance applications.

PubMed

Yahiaoui, Azzedine

2018-02-01

The use of computer-based automation and control systems for smart sustainable buildings, often so-called Automated Buildings (ABs), has become an effective way to automatically control, optimize, and supervise a wide range of building performance applications over a network while achieving the minimum energy consumption possible, and in doing so generally refers to Building Automation and Control Systems (BACS) architecture. Instead of costly and time-consuming experiments, this paper focuses on using distributed dynamic simulations to analyze the real-time performance of network-based building control systems in ABs and improve the functions of the BACS technology. The paper also presents the development and design of a distributed dynamic simulation environment with the capability of representing the BACS architecture in simulation by run-time coupling two or more different software tools over a network. The application and capability of this new dynamic simulation environment are demonstrated by an experimental design in this paper.

Distributed dynamic simulations of networked control and building performance applications

PubMed Central

Yahiaoui, Azzedine

2017-01-01

The use of computer-based automation and control systems for smart sustainable buildings, often so-called Automated Buildings (ABs), has become an effective way to automatically control, optimize, and supervise a wide range of building performance applications over a network while achieving the minimum energy consumption possible, and in doing so generally refers to Building Automation and Control Systems (BACS) architecture. Instead of costly and time-consuming experiments, this paper focuses on using distributed dynamic simulations to analyze the real-time performance of network-based building control systems in ABs and improve the functions of the BACS technology. The paper also presents the development and design of a distributed dynamic simulation environment with the capability of representing the BACS architecture in simulation by run-time coupling two or more different software tools over a network. The application and capability of this new dynamic simulation environment are demonstrated by an experimental design in this paper. PMID:29568135

Preprogramming Complex Hydrogel Responses using Enzymatic Reaction Networks.

PubMed

Postma, Sjoerd G J; Vialshin, Ilia N; Gerritsen, Casper Y; Bao, Min; Huck, Wilhelm T S

2017-02-06

The creation of adaptive matter is heavily inspired by biological systems. However, it remains challenging to design complex material responses that are governed by reaction networks, which lie at the heart of cellular complexity. The main reason for this slow progress is the lack of a general strategy to integrate reaction networks with materials. Herein we use a systematic approach to preprogram the response of a hydrogel to a trigger, in this case the enzyme trypsin, which activates a reaction network embedded within the hydrogel. A full characterization of all the kinetic rate constants in the system enabled the construction of a computational model, which predicted different hydrogel responses depending on the input concentration of the trigger. The results of the simulation are in good agreement with experimental findings. Our methodology can be used to design new, adaptive materials of which the properties are governed by reaction networks of arbitrary complexity. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Accounting for system dynamics in reserve design.

PubMed

Leroux, Shawn J; Schmiegelow, Fiona K A; Cumming, Steve G; Lessard, Robert B; Nagy, John

2007-10-01

Systematic conservation plans have only recently considered the dynamic nature of ecosystems. Methods have been developed to incorporate climate change, population dynamics, and uncertainty in reserve design, but few studies have examined how to account for natural disturbance. Considering natural disturbance in reserve design may be especially important for the world's remaining intact areas, which still experience active natural disturbance regimes. We developed a spatially explicit, dynamic simulation model, CONSERV, which simulates patch dynamics and fire, and used it to evaluate the efficacy of hypothetical reserve networks in northern Canada. We designed six networks based on conventional reserve design methods, with different conservation targets for woodland caribou habitat, high-quality wetlands, vegetation, water bodies, and relative connectedness. We input the six reserve networks into CONSERV and tracked the ability of each to maintain initial conservation targets through time under an active natural disturbance regime. None of the reserve networks maintained all initial targets, and some over-represented certain features, suggesting that both effectiveness and efficiency of reserve design could be improved through use of spatially explicit dynamic simulation during the planning process. Spatial simulation models of landscape dynamics are commonly used in natural resource management, but we provide the first illustration of their potential use for reserve design. Spatial simulation models could be used iteratively to evaluate competing reserve designs and select targets that have a higher likelihood of being maintained through time. Such models could be combined with dynamic planning techniques to develop a general theory for reserve design in an uncertain world.

Advanced obstacle avoidance for a laser based wheelchair using optimised Bayesian neural networks.

PubMed

Trieu, Hoang T; Nguyen, Hung T; Willey, Keith

2008-01-01

In this paper we present an advanced method of obstacle avoidance for a laser based intelligent wheelchair using optimized Bayesian neural networks. Three neural networks are designed for three separate sub-tasks: passing through a door way, corridor and wall following and general obstacle avoidance. The accurate usable accessible space is determined by including the actual wheelchair dimensions in a real-time map used as inputs to each networks. Data acquisitions are performed separately to collect the patterns required for specified sub-tasks. Bayesian frame work is used to determine the optimal neural network structure in each case. Then these networks are trained under the supervision of Bayesian rule. Experiment results showed that compare to the VFH algorithm our neural networks navigated a smoother path following a near optimum trajectory.

Modeling Aircraft Wing Loads from Flight Data Using Neural Networks

NASA Technical Reports Server (NTRS)

Allen, Michael J.; Dibley, Ryan P.

2003-01-01

Neural networks were used to model wing bending-moment loads, torsion loads, and control surface hinge-moments of the Active Aeroelastic Wing (AAW) aircraft. Accurate loads models are required for the development of control laws designed to increase roll performance through wing twist while not exceeding load limits. Inputs to the model include aircraft rates, accelerations, and control surface positions. Neural networks were chosen to model aircraft loads because they can account for uncharacterized nonlinear effects while retaining the capability to generalize. The accuracy of the neural network models was improved by first developing linear loads models to use as starting points for network training. Neural networks were then trained with flight data for rolls, loaded reversals, wind-up-turns, and individual control surface doublets for load excitation. Generalization was improved by using gain weighting and early stopping. Results are presented for neural network loads models of four wing loads and four control surface hinge moments at Mach 0.90 and an altitude of 15,000 ft. An average model prediction error reduction of 18.6 percent was calculated for the neural network models when compared to the linear models. This paper documents the input data conditioning, input parameter selection, structure, training, and validation of the neural network models.

The Applied Mathematics for Power Systems (AMPS)

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

Chertkov, Michael

2012-07-24

Increased deployment of new technologies, e.g., renewable generation and electric vehicles, is rapidly transforming electrical power networks by crossing previously distinct spatiotemporal scales and invalidating many traditional approaches for designing, analyzing, and operating power grids. This trend is expected to accelerate over the coming years, bringing the disruptive challenge of complexity, but also opportunities to deliver unprecedented efficiency and reliability. Our Applied Mathematics for Power Systems (AMPS) Center will discover, enable, and solve emerging mathematics challenges arising in power systems and, more generally, in complex engineered networks. We will develop foundational applied mathematics resulting in rigorous algorithms and simulation toolboxesmore » for modern and future engineered networks. The AMPS Center deconstruction/reconstruction approach 'deconstructs' complex networks into sub-problems within non-separable spatiotemporal scales, a missing step in 20th century modeling of engineered networks. These sub-problems are addressed within the appropriate AMPS foundational pillar - complex systems, control theory, and optimization theory - and merged or 'reconstructed' at their boundaries into more general mathematical descriptions of complex engineered networks where important new questions are formulated and attacked. These two steps, iterated multiple times, will bridge the growing chasm between the legacy power grid and its future as a complex engineered network.« less

Parameter estimation in spiking neural networks: a reverse-engineering approach.

PubMed

Rostro-Gonzalez, H; Cessac, B; Vieville, T

2012-04-01

This paper presents a reverse engineering approach for parameter estimation in spiking neural networks (SNNs). We consider the deterministic evolution of a time-discretized network with spiking neurons, where synaptic transmission has delays, modeled as a neural network of the generalized integrate and fire type. Our approach aims at by-passing the fact that the parameter estimation in SNN results in a non-deterministic polynomial-time hard problem when delays are to be considered. Here, this assumption has been reformulated as a linear programming (LP) problem in order to perform the solution in a polynomial time. Besides, the LP problem formulation makes the fact that the reverse engineering of a neural network can be performed from the observation of the spike times explicit. Furthermore, we point out how the LP adjustment mechanism is local to each neuron and has the same structure as a 'Hebbian' rule. Finally, we present a generalization of this approach to the design of input-output (I/O) transformations as a practical method to 'program' a spiking network, i.e. find a set of parameters allowing us to exactly reproduce the network output, given an input. Numerical verifications and illustrations are provided.

Finite-time hybrid projective synchronization of the drive-response complex networks with distributed-delay via adaptive intermittent control

NASA Astrophysics Data System (ADS)

Cheng, Lin; Yang, Yongqing; Li, Li; Sui, Xin

2018-06-01

This paper studies the finite-time hybrid projective synchronization of the drive-response complex networks. In the model, general transmission delays and distributed delays are also considered. By designing the adaptive intermittent controllers, the response network can achieve hybrid projective synchronization with the drive system in finite time. Based on finite-time stability theory and several differential inequalities, some simple finite-time hybrid projective synchronization criteria are derived. Two numerical examples are given to illustrate the effectiveness of the proposed method.

GLOBECOM '88 - IEEE Global Telecommunications Conference and Exhibition, Hollywood, FL, Nov. 28-Dec. 1, 1988, Conference Record. Volumes 1, 2, & 3

NASA Astrophysics Data System (ADS)

Various papers on communications for the information age are presented. Among the general topics considered are: telematic services and terminals, satellite communications, telecommunications mangaement network, control of integrated broadband networks, advances in digital radio systems, the intelligent network, broadband networks and services deployment, future switch architectures, performance analysis of computer networks, advances in spread spectrum, optical high-speed LANs, and broadband switching and networks. Also addressed are: multiple access protocols, video coding techniques, modulation and coding, photonic switching, SONET terminals and applications, standards for video coding, digital switching, progress in MANs, mobile and portable radio, software design for improved maintainability, multipath propagation and advanced countermeasure, data communication, network control and management, fiber in the loop, network algorithm and protocols, and advances in computer communications.

US Army Research Laboratory Visualization Framework Architecture Document

DTIC Science & Technology

2018-01-11

this report are not to be construed as an official Department of the Army position unless so designated by other authorized documents. Citation of...release; distribution is unlimited. 14. ABSTRACT Visualization of network science experimentation results is generally achieved using stovepipe...report documents the ARL Visualization Framework system design and specific details of its implementation. 15. SUBJECT TERMS visualization

Requirements for a network storage service

NASA Technical Reports Server (NTRS)

Kelly, Suzanne M.; Haynes, Rena A.

1992-01-01

Sandia National Laboratories provides a high performance classified computer network as a core capability in support of its mission of nuclear weapons design and engineering, physical sciences research, and energy research and development. The network, locally known as the Internal Secure Network (ISN), was designed in 1989 and comprises multiple distributed local area networks (LAN's) residing in Albuquerque, New Mexico and Livermore, California. The TCP/IP protocol suite is used for inner-node communications. Scientific workstations and mid-range computers, running UNIX-based operating systems, compose most LAN's. One LAN, operated by the Sandia Corporate Computing Directorate, is a general purpose resource providing a supercomputer and a file server to the entire ISN. The current file server on the supercomputer LAN is an implementation of the Common File System (CFS) developed by Los Alamos National Laboratory. Subsequent to the design of the ISN, Sandia reviewed its mass storage requirements and chose to enter into a competitive procurement to replace the existing file server with one more adaptable to a UNIX/TCP/IP environment. The requirements study for the network was the starting point for the requirements study for the new file server. The file server is called the Network Storage Services (NSS) and is requirements are described in this paper. The next section gives an application or functional description of the NSS. The final section adds performance, capacity, and access constraints to the requirements.

Synchronization of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions and Infinite Delays.

PubMed

Sheng, Yin; Zhang, Hao; Zeng, Zhigang

2017-10-01

This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.

EpiModel: An R Package for Mathematical Modeling of Infectious Disease over Networks.

PubMed

Jenness, Samuel M; Goodreau, Steven M; Morris, Martina

2018-04-01

Package EpiModel provides tools for building, simulating, and analyzing mathematical models for the population dynamics of infectious disease transmission in R. Several classes of models are included, but the unique contribution of this software package is a general stochastic framework for modeling the spread of epidemics on networks. EpiModel integrates recent advances in statistical methods for network analysis (temporal exponential random graph models) that allow the epidemic modeling to be grounded in empirical data on contacts that can spread infection. This article provides an overview of both the modeling tools built into EpiModel , designed to facilitate learning for students new to modeling, and the application programming interface for extending package EpiModel , designed to facilitate the exploration of novel research questions for advanced modelers.

EpiModel: An R Package for Mathematical Modeling of Infectious Disease over Networks

PubMed Central

Jenness, Samuel M.; Goodreau, Steven M.; Morris, Martina

2018-01-01

Package EpiModel provides tools for building, simulating, and analyzing mathematical models for the population dynamics of infectious disease transmission in R. Several classes of models are included, but the unique contribution of this software package is a general stochastic framework for modeling the spread of epidemics on networks. EpiModel integrates recent advances in statistical methods for network analysis (temporal exponential random graph models) that allow the epidemic modeling to be grounded in empirical data on contacts that can spread infection. This article provides an overview of both the modeling tools built into EpiModel, designed to facilitate learning for students new to modeling, and the application programming interface for extending package EpiModel, designed to facilitate the exploration of novel research questions for advanced modelers. PMID:29731699

The Influence of Social Networks and Social Support on Health Among Older Koreans at High Risk of Depression.

PubMed

Chung, Soondool; Jeon, Haesang; Song, Ahyoung

Despite compelling evidence showing that social networks and social support are associated with depression, relatively little research is available on this topic for older Koreans at high risk of depression. This article aimed to examine the relationship among different types of social networks (family vs. friends), social support (instrumental vs. emotional), and perceived general health among older Koreans at high risk of depression. We would then test for possible differences in pathways between two age groups (60-74 years vs. 75 years and older). Using data from the 2008 Survey of Elderly Life and Welfare Need, age 60-74 years (n = 2,815) and age 75 years and older (n = 1,784) were analyzed separately. Path analyses were used to examine the relationships among social network, support, and health among Korean older adults at high risk of depression. Findings highlighted the complex associations among social networks, social support, and perceived general health within old age. Moreover, this study called attention to the negative association between instrumental support from family networks and perceived general health among older Koreans aged 60-74 years at high risk of depression. The work discussed in this article would help inform the design of much needed and effective social intervention programs for the growing number of Korean older adults with depression.

The Role of Social Network Technologies in Online Health Promotion: A Narrative Review of Theoretical and Empirical Factors Influencing Intervention Effectiveness.

PubMed

Balatsoukas, Panos; Kennedy, Catriona M; Buchan, Iain; Powell, John; Ainsworth, John

2015-06-11

Social network technologies have become part of health education and wider health promotion—either by design or happenstance. Social support, peer pressure, and information sharing in online communities may affect health behaviors. If there are positive and sustained effects, then social network technologies could increase the effectiveness and efficiency of many public health campaigns. Social media alone, however, may be insufficient to promote health. Furthermore, there may be unintended and potentially harmful consequences of inaccurate or misleading health information. Given these uncertainties, there is a need to understand and synthesize the evidence base for the use of online social networking as part of health promoting interventions to inform future research and practice. Our aim was to review the research on the integration of expert-led health promotion interventions with online social networking in order to determine the extent to which the complementary benefits of each are understood and used. We asked, in particular, (1) How is effectiveness being measured and what are the specific problems in effecting health behavior change?, and (2) To what extent is the designated role of social networking grounded in theory? The narrative synthesis approach to literature review was used to analyze the existing evidence. We searched the indexed scientific literature using keywords associated with health promotion and social networking. The papers included were only those making substantial study of both social networking and health promotion—either reporting the results of the intervention or detailing evidence-based plans. General papers about social networking and health were not included. The search identified 162 potentially relevant documents after review of titles and abstracts. Of these, 42 satisfied the inclusion criteria after full-text review. Six studies described randomized controlled trials (RCTs) evaluating the effectiveness of online social networking within health promotion interventions. Most of the trials investigated the value of a "social networking condition" in general and did not identify specific features that might play a role in effectiveness. Issues about the usability and level of uptake of interventions were more common among pilot studies, while observational studies showed positive evidence about the role of social support. A total of 20 papers showed the use of theory in the design of interventions, but authors evaluated effectiveness in only 10 papers. More research is needed in this area to understand the actual effect of social network technologies on health promotion. More RCTs of greater length need to be conducted taking into account contextual factors such as patient characteristics and types of a social network technology. Also, more evidence is needed regarding the actual usability of online social networking and how different interface design elements may help or hinder behavior change and engagement. Moreover, it is crucial to investigate further the effect of theory on the effectiveness of this type of technology for health promotion. Research is needed linking theoretical grounding with observation and analysis of health promotion in online networks.

Designing allostery-inspired response in mechanical networks

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

Rocks, Jason W.; Pashine, Nidhi; Bischofberger, Irmgard

Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are then able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ~1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individualmore » response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.« less

VMSoar: a cognitive agent for network security

NASA Astrophysics Data System (ADS)

Benjamin, David P.; Shankar-Iyer, Ranjita; Perumal, Archana

2005-03-01

VMSoar is a cognitive network security agent designed for both network configuration and long-term security management. It performs automatic vulnerability assessments by exploring a configuration"s weaknesses and also performs network intrusion detection. VMSoar is built on the Soar cognitive architecture, and benefits from the general cognitive abilities of Soar, including learning from experience, the ability to solve a wide range of complex problems, and use of natural language to interact with humans. The approach used by VMSoar is very different from that taken by other vulnerability assessment or intrusion detection systems. VMSoar performs vulnerability assessments by using VMWare to create a virtual copy of the target machine then attacking the simulated machine with a wide assortment of exploits. VMSoar uses this same ability to perform intrusion detection. When trying to understand a sequence of network packets, VMSoar uses VMWare to make a virtual copy of the local portion of the network and then attempts to generate the observed packets on the simulated network by performing various exploits. This approach is initially slow, but VMSoar"s learning ability significantly speeds up both vulnerability assessment and intrusion detection. This paper describes the design and implementation of VMSoar, and initial experiments with Windows NT and XP.

Designing allostery-inspired response in mechanical networks

DOE PAGES

Rocks, Jason W.; Pashine, Nidhi; Bischofberger, Irmgard; ...

2017-02-21

Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are then able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ~1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individualmore » response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.« less

A distributed incentive compatible pricing mechanism for P2P networks

NASA Astrophysics Data System (ADS)

Zhang, Jie; Zhao, Zheng; Xiong, Xiao; Shi, Qingwei

2007-09-01

Peer-to-Peer (P2P) systems are currently receiving considerable interest. However, as experience with P2P networks shows, the selfish behaviors of peers may lead to serious problems of P2P network, such as free-riding and white-washing. In order to solve these problems, there are increasing considerations on reputation system design in the study of P2P networks. Most of the existing works is concerning probabilistic estimation or social networks to evaluate the trustworthiness for a peer to others. However, these models can not be efficient all the time. In this paper, our aim is to provide a general mechanism that can maximize P2P networks social welfare in a way of Vickrey-Clarke-Groves family, while assuming every peer in P2P networks is rational and selfish, which means they only concern about their own outcome. This mechanism has some desirable properties using an O(n) algorithm: (1) incentive compatibility, every peer truly report its connection type; (2) individually rationality; and (3) fully decentralized, we design a multiple-principal multiple-agent model, concerning about the service provider and service requester individually.

Designing allostery-inspired response in mechanical networks

PubMed Central

Rocks, Jason W.; Pashine, Nidhi; Bischofberger, Irmgard; Goodrich, Carl P.; Liu, Andrea J.; Nagel, Sidney R.

2017-01-01

Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ∼1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individual response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks. PMID:28223534

Designing allostery-inspired response in mechanical networks.

PubMed

Rocks, Jason W; Pashine, Nidhi; Bischofberger, Irmgard; Goodrich, Carl P; Liu, Andrea J; Nagel, Sidney R

2017-03-07

Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ∼1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individual response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.

Using evolutionary computations to understand the design and evolution of gene and cell regulatory networks.

PubMed

Spirov, Alexander; Holloway, David

2013-07-15

This paper surveys modeling approaches for studying the evolution of gene regulatory networks (GRNs). Modeling of the design or 'wiring' of GRNs has become increasingly common in developmental and medical biology, as a means of quantifying gene-gene interactions, the response to perturbations, and the overall dynamic motifs of networks. Drawing from developments in GRN 'design' modeling, a number of groups are now using simulations to study how GRNs evolve, both for comparative genomics and to uncover general principles of evolutionary processes. Such work can generally be termed evolution in silico. Complementary to these biologically-focused approaches, a now well-established field of computer science is Evolutionary Computations (ECs), in which highly efficient optimization techniques are inspired from evolutionary principles. In surveying biological simulation approaches, we discuss the considerations that must be taken with respect to: (a) the precision and completeness of the data (e.g. are the simulations for very close matches to anatomical data, or are they for more general exploration of evolutionary principles); (b) the level of detail to model (we proceed from 'coarse-grained' evolution of simple gene-gene interactions to 'fine-grained' evolution at the DNA sequence level); (c) to what degree is it important to include the genome's cellular context; and (d) the efficiency of computation. With respect to the latter, we argue that developments in computer science EC offer the means to perform more complete simulation searches, and will lead to more comprehensive biological predictions. Copyright © 2013 Elsevier Inc. All rights reserved.

Dissipative rendering and neural network control system design

NASA Technical Reports Server (NTRS)

Gonzalez, Oscar R.

1995-01-01

Model-based control system designs are limited by the accuracy of the models of the plant, plant uncertainty, and exogenous signals. Although better models can be obtained with system identification, the models and control designs still have limitations. One approach to reduce the dependency on particular models is to design a set of compensators that will guarantee robust stability to a set of plants. Optimization over the compensator parameters can then be used to get the desired performance. Conservativeness of this approach can be reduced by integrating fundamental properties of the plant models. This is the approach of dissipative control design. Dissipative control designs are based on several variations of the Passivity Theorem, which have been proven for nonlinear/linear and continuous-time/discrete-time systems. These theorems depend not on a specific model of a plant, but on its general dissipative properties. Dissipative control design has found wide applicability in flexible space structures and robotic systems that can be configured to be dissipative. Currently, there is ongoing research to improve the performance of dissipative control designs. For aircraft systems that are not dissipative active control may be used to make them dissipative and then a dissipative control design technique can be used. It is also possible that rendering a system dissipative and dissipative control design may be combined into one step. Furthermore, the transformation of a non-dissipative system to dissipative can be done robustly. One sequential design procedure for finite dimensional linear time-invariant systems has been developed. For nonlinear plants that cannot be controlled adequately with a single linear controller, model-based techniques have additional problems. Nonlinear system identification is still a research topic. Lacking analytical models for model-based design, artificial neural network algorithms have recently received considerable attention. Using their universal approximation property, neural networks have been introduced into nonlinear control designs in several ways. Unfortunately, little work has appeared that analyzes neural network control systems and establishes margins for stability and performance. One approach for this analysis is to set up neural network control systems in the framework presented above. For example, one neural network could be used to render a system to be dissipative, a second strictly dissipative neural network controller could be used to guarantee robust stability.

Sophia Daemon Version 12

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

2012-08-09

Sophia Daemon Version 12 contains the code that is exclusively used by the ‘sophiad’ application. It runs as a service on a Linux host and analyzes network traffic obtained from libpcap and produces a network fingerprint based on hosts and channels. Sophia Daemon Version 12 can, if desired by the user, produce alerts when its fingerprint changes. Sophia Daemon Version 12 can receive data from another Sophia Daemon or raw packet data. It can output data to another Sophia Daemon Version 12, OglNet Version 12 or MySQL. Sophia Daemon Version 12 runs in a passive real-time manner that allows itmore » to be used on a SCADA network. Its network fingerprint is designed to be applicable to SCADA networks rather than general IT networks.« less

Mandala Networks: ultra-small-world and highly sparse graphs

PubMed Central

Sampaio Filho, Cesar I. N.; Moreira, André A.; Andrade, Roberto F. S.; Herrmann, Hans J.; Andrade, José S.

2015-01-01

The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are robust against random failures. Furthermore, as the size of the network increases, its shortest path becomes asymptotically invariant and the density of links goes to zero, making it ultra-small world and highly sparse, respectively. The first property is ideal for communication and navigation purposes, while the second is interesting economically. Finally, we show that some simple changes on the original network formulation can lead to an improved topology against malicious attacks. PMID:25765450

Robust outer synchronization between two nonlinear complex networks with parametric disturbances and mixed time-varying delays

NASA Astrophysics Data System (ADS)

Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng

2018-03-01

In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.

Synchronization of a Class of Switched Neural Networks with Time-Varying Delays via Nonlinear Feedback Control.

PubMed

Wang, Leimin; Shen, Yi; Zhang, Guodong

2016-10-01

This paper is concerned with the synchronization problem for a class of switched neural networks (SNNs) with time-varying delays. First, a new crucial lemma which includes and extends the classical exponential stability theorem is constructed. Then by using the lemma, new algebraic criteria of ψ -type synchronization (synchronization with general decay rate) for SNNs are established via the designed nonlinear feedback control. The ψ -type synchronization which is in a general framework is obtained by introducing a ψ -type function. It contains exponential synchronization, polynomial synchronization, and other synchronization as its special cases. The results of this paper are general, and they also complement and extend some previous results. Finally, numerical simulations are carried out to demonstrate the effectiveness of the obtained results.

A Wearable Respiratory Biofeedback System Based on Generalized Body Sensor Network

PubMed Central

Liu, Guan-Zheng; Huang, Bang-Yu

2011-01-01

Abstract Wearable medical devices have enabled unobtrusive monitoring of vital signs and emerging biofeedback services in a pervasive manner. This article describes a wearable respiratory biofeedback system based on a generalized body sensor network (BSN) platform. The compact BSN platform was tailored for the strong requirements of overall system optimizations. A waist-worn biofeedback device was designed using the BSN. Extensive bench tests have shown that the generalized BSN worked as intended. In-situ experiments with 22 subjects indicated that the biofeedback device was discreet, easy to wear, and capable of offering wearable respiratory trainings. Pilot studies on wearable training patterns and resultant heart rate variability suggested that paced respirations at abdominal level and with identical inhaling/exhaling ratio were more appropriate for decreasing sympathetic arousal and increasing parasympathetic activities. PMID:21545293

An Algorithm for the Mixed Transportation Network Design Problem

PubMed Central

Liu, Xinyu; Chen, Qun

2016-01-01

This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately. PMID:27626803

Application of Network and Decision Theory to Routing Problems.

DTIC Science & Technology

1982-03-01

special thanks to Major Hal Carter, faculty member, for his help in getting the authors to understand one of the underlying algorithms in the methodology...61 26. General Methodology Flowchart .......... .. 64 27. Least Cost/Time Path Algorithm Flowchart . . 65 28. Possible Redundant Arc of Time...minimum time to travel. This was neces- sary because: 1. The DTN designers did not have a procedure to do so. 2. The various network algorithms to

Using Network Dynamical Influence to Drive Consensus

NASA Astrophysics Data System (ADS)

Punzo, Giuliano; Young, George F.; MacDonald, Malcolm; Leonard, Naomi E.

2016-05-01

Consensus and decision-making are often analysed in the context of networks, with many studies focusing attention on ranking the nodes of a network depending on their relative importance to information routing. Dynamical influence ranks the nodes with respect to their ability to influence the evolution of the associated network dynamical system. In this study it is shown that dynamical influence not only ranks the nodes, but also provides a naturally optimised distribution of effort to steer a network from one state to another. An example is provided where the “steering” refers to the physical change in velocity of self-propelled agents interacting through a network. Distinct from other works on this subject, this study looks at directed and hence more general graphs. The findings are presented with a theoretical angle, without targeting particular applications or networked systems; however, the framework and results offer parallels with biological flocks and swarms and opportunities for design of technological networks.

Design of Tactical Support Strategies in Military Logistics: Trade-offs Between Efficiency and Effectiveness. A Column and Cut Generation Modeling Methods

DTIC Science & Technology

2011-12-01

problems need to be addressed in the design of military logis- tics networks. The design problem includes strategic decisions, such as the location of...military strategic logistics [11–13]. In this study, we focus on the design of tactical logistics strategies, which achieve different optimal balances...is clear that our problem is N P−Hard 1 since it generalizes the CVPR and the BPP . Different solutions to handle the loading and routing of

The maintenance of cooperation in multiplex networks with limited and partible resources of agents

NASA Astrophysics Data System (ADS)

Li, Zhaofeng; Shen, Bi; Jiang, Yichuan

2017-02-01

In this paper, we try to explain the maintenance of cooperation in multiplex networks with limited and partible resources of agents: defection brings larger short-term benefit and cooperative agents may become defective because of the unaffordable costs of cooperative behaviors that are performed in multiple layers simultaneously. Recent studies have identified the positive effects of multiple layers on evolutionary cooperation but generally overlook the maximum costs of agents in these synchronous games. By utilizing network effects and designing evolutionary mechanisms, cooperative behaviors become prevailing in public goods games, and agents can allocate personal resources across multiple layers. First, we generalize degree diversity into multiplex networks to improve the prospect for cooperation. Second, to prevent agents allocating all the resources into one layer, a greedy-first mechanism is proposed, in which agents prefer to add additional investments in the higher-payoff layer. It is found that greedy-first agents can perform cooperative behaviors in multiplex networks when one layer is scale-free network and degree differences between conjoint nodes increase. Our work may help to explain the emergence of cooperation in the absence of individual reputation and punishment mechanisms.

Reverse engineering highlights potential principles of large gene regulatory network design and learning.

PubMed

Carré, Clément; Mas, André; Krouk, Gabriel

2017-01-01

Inferring transcriptional gene regulatory networks from transcriptomic datasets is a key challenge of systems biology, with potential impacts ranging from medicine to agronomy. There are several techniques used presently to experimentally assay transcription factors to target relationships, defining important information about real gene regulatory networks connections. These techniques include classical ChIP-seq, yeast one-hybrid, or more recently, DAP-seq or target technologies. These techniques are usually used to validate algorithm predictions. Here, we developed a reverse engineering approach based on mathematical and computer simulation to evaluate the impact that this prior knowledge on gene regulatory networks may have on training machine learning algorithms. First, we developed a gene regulatory networks-simulating engine called FRANK (Fast Randomizing Algorithm for Network Knowledge) that is able to simulate large gene regulatory networks (containing 10 4 genes) with characteristics of gene regulatory networks observed in vivo. FRANK also generates stable or oscillatory gene expression directly produced by the simulated gene regulatory networks. The development of FRANK leads to important general conclusions concerning the design of large and stable gene regulatory networks harboring scale free properties (built ex nihilo). In combination with supervised (accepting prior knowledge) support vector machine algorithm we (i) address biologically oriented questions concerning our capacity to accurately reconstruct gene regulatory networks and in particular we demonstrate that prior-knowledge structure is crucial for accurate learning, and (ii) draw conclusions to inform experimental design to performed learning able to solve gene regulatory networks in the future. By demonstrating that our predictions concerning the influence of the prior-knowledge structure on support vector machine learning capacity holds true on real data ( Escherichia coli K14 network reconstruction using network and transcriptomic data), we show that the formalism used to build FRANK can to some extent be a reasonable model for gene regulatory networks in real cells.

Cross-layer protocol design for QoS optimization in real-time wireless sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2010-04-01

The metrics of quality of service (QoS) for each sensor type in a wireless sensor network can be associated with metrics for multimedia that describe the quality of fused information, e.g., throughput, delay, jitter, packet error rate, information correlation, etc. These QoS metrics are typically set at the highest, or application, layer of the protocol stack to ensure that performance requirements for each type of sensor data are satisfied. Application-layer metrics, in turn, depend on the support of the lower protocol layers: session, transport, network, data link (MAC), and physical. The dependencies of the QoS metrics on the performance of the higher layers of the Open System Interconnection (OSI) reference model of the WSN protocol, together with that of the lower three layers, are the basis for a comprehensive approach to QoS optimization for multiple sensor types in a general WSN model. The cross-layer design accounts for the distributed power consumption along energy-constrained routes and their constituent nodes. Following the author's previous work, the cross-layer interactions in the WSN protocol are represented by a set of concatenated protocol parameters and enabling resource levels. The "best" cross-layer designs to achieve optimal QoS are established by applying the general theory of martingale representations to the parameterized multivariate point processes (MVPPs) for discrete random events occurring in the WSN. Adaptive control of network behavior through the cross-layer design is realized through the parametric factorization of the stochastic conditional rates of the MVPPs. The cross-layer protocol parameters for optimal QoS are determined in terms of solutions to stochastic dynamic programming conditions derived from models of transient flows for heterogeneous sensor data and aggregate information over a finite time horizon. Markov state processes, embedded within the complex combinatorial history of WSN events, are more computationally tractable and lead to simplifications for any simulated or analytical performance evaluations of the cross-layer designs.

Planning Marine Reserve Networks for Both Feature Representation and Demographic Persistence Using Connectivity Patterns

PubMed Central

Bode, Michael; Williamson, David H.; Weeks, Rebecca; Jones, Geoff P.; Almany, Glenn R.; Harrison, Hugo B.; Hopf, Jess K.; Pressey, Robert L.

2016-01-01

Marine reserve networks must ensure the representation of important conservation features, and also guarantee the persistence of key populations. For many species, designing reserve networks is complicated by the absence or limited availability of spatial and life-history data. This is particularly true for data on larval dispersal, which has only recently become available. However, systematic conservation planning methods currently incorporate demographic processes through unsatisfactory surrogates. There are therefore two key challenges to designing marine reserve networks that achieve feature representation and demographic persistence constraints. First, constructing a method that efficiently incorporates persistence as well as complementary feature representation. Second, incorporating persistence using a mechanistic description of population viability, rather than a proxy such as size or distance. Here we construct a novel systematic conservation planning method that addresses both challenges, and parameterise it to design a hypothetical marine reserve network for fringing coral reefs in the Keppel Islands, Great Barrier Reef, Australia. For this application, we describe how demographic persistence goals can be constructed for an important reef fish species in the region, the bar-cheeked trout (Plectropomus maculatus). We compare reserve networks that are optimally designed for either feature representation or demographic persistence, with a reserve network that achieves both goals simultaneously. As well as being practically applicable, our analyses also provide general insights into marine reserve planning for both representation and demographic persistence. First, persistence constraints for dispersive organisms are likely to be much harder to achieve than representation targets, due to their greater complexity. Second, persistence and representation constraints pull the reserve network design process in divergent directions, making it difficult to efficiently achieve both constraints. Although our method can be readily applied to the data-rich Keppel Islands case study, we finally consider the factors that limit the method’s utility in information-poor contexts common in marine conservation. PMID:27168206

Reliability analysis of C-130 turboprop engine components using artificial neural network

NASA Astrophysics Data System (ADS)

Qattan, Nizar A.

In this study, we predict the failure rate of Lockheed C-130 Engine Turbine. More than thirty years of local operational field data were used for failure rate prediction and validation. The Weibull regression model and the Artificial Neural Network model including (feed-forward back-propagation, radial basis neural network, and multilayer perceptron neural network model); will be utilized to perform this study. For this purpose, the thesis will be divided into five major parts. First part deals with Weibull regression model to predict the turbine general failure rate, and the rate of failures that require overhaul maintenance. The second part will cover the Artificial Neural Network (ANN) model utilizing the feed-forward back-propagation algorithm as a learning rule. The MATLAB package will be used in order to build and design a code to simulate the given data, the inputs to the neural network are the independent variables, the output is the general failure rate of the turbine, and the failures which required overhaul maintenance. In the third part we predict the general failure rate of the turbine and the failures which require overhaul maintenance, using radial basis neural network model on MATLAB tool box. In the fourth part we compare the predictions of the feed-forward back-propagation model, with that of Weibull regression model, and radial basis neural network model. The results show that the failure rate predicted by the feed-forward back-propagation artificial neural network model is closer in agreement with radial basis neural network model compared with the actual field-data, than the failure rate predicted by the Weibull model. By the end of the study, we forecast the general failure rate of the Lockheed C-130 Engine Turbine, the failures which required overhaul maintenance and six categorical failures using multilayer perceptron neural network (MLP) model on DTREG commercial software. The results also give an insight into the reliability of the engine turbine under actual operating conditions, which can be used by aircraft operators for assessing system and component failures and customizing the maintenance programs recommended by the manufacturer.

Environmental and Water Quality Operational Studies. General Guidelines for Monitoring Contaminants in Reservoirs

DTIC Science & Technology

1986-02-01

espacially trte for the topics of sampling and analytical methods, statistical considerations, and the design of general water quality monitoring networks. For...and to the establishment and habitat differentiation of biological populations within reservoirs. Reservoir operatirn, esp- cially the timing...8217 % - - % properties of bottom sediments, as well as specific habitat associations of biological populations of reservoirs. Thus, such heterogeneities

A Critical Review of Surveys Emphasizing on Routing in Wireless Sensor Networks-An Anatomization under General Survey Design Framework.

PubMed

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2017-07-26

A large number of routing-related surveys are published so far for Wireless Sensor Networks (WSNs) that exhibit either complete or partial emphasis on routing in WSNs. These surveys classify and discuss the relevant routing protocols published mainly in the fields of classical, energy efficient, secure, hierarchical, geographic, intelligent, Quality of Service (QoS)-based and multipath WSNs. However, to the best of our knowledge, no study is presented so far which may clearly categorize the routing-related survey literature for WSNs.To fill this gap, an effort is made in this paper for presenting an in-depth review of already published routing-related survey literature in WSNs. Our review initially proposes a generalized survey design model and afterwards analyzes the routing-related survey literature in the light of the devised General Survey Design Framework (GSDF) . Such an analysis describes the design soundness of the published routing-related surveys. Therefore, our review puts forth an original classification based on the frequency-of-survey-publication and taxonomizes the corresponding routing-related fields into high, medium and low focused areas of survey publication in WSNs. Furthermore, the surveys belonging to each main category are sub-categorized into various sub-classes and briefly discussed according to their design characteristics. On the one hand, this review is useful for beginners who may easily explore the already published routing-related survey literature in WSNs in a single document and investigate it by spending less effort. On the other hand, it is useful for expert researchers who may explore the trends and frequency of writing surveys in different areas of routing in WSNs. The experts may explore those areas of routing which are either neglected or least focused or lack in design soundness as per general survey design framework. In the end, insights and future research directions are outlined and a reasonable conclusion is put forth which may outline guiding principles for routing-related survey research in future.

Toward domain-specific design environments: Some representation ideas from the telecommunications domain

NASA Technical Reports Server (NTRS)

Greenspan, Sol; Feblowitz, Mark

1992-01-01

ACME is an experimental environment for investigating new approaches to modeling and analysis of system requirements and designs. ACME is built on and extends object-oriented conceptual modeling techniques and knowledge representation and reasoning (KRR) tools. The most immediate intended use for ACME is to help represent, understand, and communicate system designs during the early stages of system planning and requirements engineering. While our research is ostensibly aimed at software systems in general, we are particularly motivated to make an impact in the telecommunications domain, especially in the area referred to as Intelligent Networks (IN's). IN systems contain the software to provide services to users of a telecommunications network (e.g., call processing services, information services, etc.) as well as the software that provides the internal infrastructure for providing the services (e.g., resource management, billing, etc.). The software includes not only systems developed by the network proprietors but also by a growing group of independent service software providers.

Design trade-offs among shunt current, pumping loss and compactness in the piping system of a multi-stack vanadium flow battery

NASA Astrophysics Data System (ADS)

Ye, Qiang; Hu, Jing; Cheng, Ping; Ma, Zhiqi

2015-11-01

Trade-off between shunt current loss and pumping loss is a major challenge in the design of the electrolyte piping network in a flow battery system. It is generally recognized that longer and thinner ducts are beneficial to reduce shunt current but detrimental to minimize pumping power. Base on the developed analog circuit model and the flow network model, we make case studies of multi-stack vanadium flow battery piping systems and demonstrate that both shunt current and electrolyte flow resistance can be simultaneously minimized by using longer and thicker ducts in the piping network. However, extremely long and/or thick ducts lead to a bulky system and may be prohibited by the stack structure. Accordingly, the intrinsic design trade-off is between system efficiency and compactness. Since multi-stack configurations bring both flexibility and complexity to the design process, we perform systematic comparisons among representative piping system designs to illustrate the complicated trade-offs among numerous parameters including stack number, intra-stack channel resistance and inter-stack pipe resistance. As the final design depends on various technical and economical requirements, this paper aims to provide guidelines rather than solutions for designers to locate the optimal trade-off points according to their specific cases.

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

Welcome, Michael L.; Bell, Christian S.

GASNet (Global-Address Space Networking) is a language-independent, low-level networking layer that provides network-independent, high-performance communication primitives tailored for implementing parallel global address space SPMD languages such as UPC and Titanium. The interface is primarily intended as a compilation target and for use by runtime library writers (as opposed to end users), and the primary goals are high performance, interface portability, and expressiveness. GASNet is designed specifically to support high-performance, portable implementations of global address space languages on modern high-end communication networks. The interface provides the flexibility and extensibility required to express a wide variety of communication patterns without sacrificing performancemore » by imposing large computational overheads in the interface. The design of the GASNet interface is partitioned into two layers to maximize porting ease without sacrificing performance: the lower level is a narrow but very general interface called the GASNet core API - the design is basedheavily on Active Messages, and is implemented directly on top of each individual network architecture. The upper level is a wider and more expressive interface called GASNet extended API, which provides high-level operations such as remote memory access and various collective operations. This release implements GASNet over MPI, the Quadrics "elan" API, the Myrinet "GM" API and the "LAPI" interface to the IBM SP switch. A template is provided for adding support for additional network interfaces.« less

Brainlab: A Python Toolkit to Aid in the Design, Simulation, and Analysis of Spiking Neural Networks with the NeoCortical Simulator.

PubMed

Drewes, Rich; Zou, Quan; Goodman, Philip H

2009-01-01

Neuroscience modeling experiments often involve multiple complex neural network and cell model variants, complex input stimuli and input protocols, followed by complex data analysis. Coordinating all this complexity becomes a central difficulty for the experimenter. The Python programming language, along with its extensive library packages, has emerged as a leading "glue" tool for managing all sorts of complex programmatic tasks. This paper describes a toolkit called Brainlab, written in Python, that leverages Python's strengths for the task of managing the general complexity of neuroscience modeling experiments. Brainlab was also designed to overcome the major difficulties of working with the NCS (NeoCortical Simulator) environment in particular. Brainlab is an integrated model-building, experimentation, and data analysis environment for the powerful parallel spiking neural network simulator system NCS.

Brainlab: A Python Toolkit to Aid in the Design, Simulation, and Analysis of Spiking Neural Networks with the NeoCortical Simulator

PubMed Central

Drewes, Rich; Zou, Quan; Goodman, Philip H.

2008-01-01

Neuroscience modeling experiments often involve multiple complex neural network and cell model variants, complex input stimuli and input protocols, followed by complex data analysis. Coordinating all this complexity becomes a central difficulty for the experimenter. The Python programming language, along with its extensive library packages, has emerged as a leading “glue” tool for managing all sorts of complex programmatic tasks. This paper describes a toolkit called Brainlab, written in Python, that leverages Python's strengths for the task of managing the general complexity of neuroscience modeling experiments. Brainlab was also designed to overcome the major difficulties of working with the NCS (NeoCortical Simulator) environment in particular. Brainlab is an integrated model-building, experimentation, and data analysis environment for the powerful parallel spiking neural network simulator system NCS. PMID:19506707

An Integrated Children Disease Prediction Tool within a Special Social Network.

PubMed

Apostolova Trpkovska, Marika; Yildirim Yayilgan, Sule; Besimi, Adrian

2016-01-01

This paper proposes a social network with an integrated children disease prediction system developed by the use of the specially designed Children General Disease Ontology (CGDO). This ontology consists of children diseases and their relationship with symptoms and Semantic Web Rule Language (SWRL rules) that are specially designed for predicting diseases. The prediction process starts by filling data about the appeared signs and symptoms by the user which are after that mapped with the CGDO ontology. Once the data are mapped, the prediction results are presented. The phase of prediction executes the rules which extract the predicted disease details based on the SWRL rule specified. The motivation behind the development of this system is to spread knowledge about the children diseases and their symptoms in a very simple way using the specialized social networking website www.emama.mk.

Scaling theory for information networks.

PubMed

Moses, Melanie E; Forrest, Stephanie; Davis, Alan L; Lodder, Mike A; Brown, James H

2008-12-06

Networks distribute energy, materials and information to the components of a variety of natural and human-engineered systems, including organisms, brains, the Internet and microprocessors. Distribution networks enable the integrated and coordinated functioning of these systems, and they also constrain their design. The similar hierarchical branching networks observed in organisms and microprocessors are striking, given that the structure of organisms has evolved via natural selection, while microprocessors are designed by engineers. Metabolic scaling theory (MST) shows that the rate at which networks deliver energy to an organism is proportional to its mass raised to the 3/4 power. We show that computational systems are also characterized by nonlinear network scaling and use MST principles to characterize how information networks scale, focusing on how MST predicts properties of clock distribution networks in microprocessors. The MST equations are modified to account for variation in the size and density of transistors and terminal wires in microprocessors. Based on the scaling of the clock distribution network, we predict a set of trade-offs and performance properties that scale with chip size and the number of transistors. However, there are systematic deviations between power requirements on microprocessors and predictions derived directly from MST. These deviations are addressed by augmenting the model to account for decentralized flow in some microprocessor networks (e.g. in logic networks). More generally, we hypothesize a set of constraints between the size, power and performance of networked information systems including transistors on chips, hosts on the Internet and neurons in the brain.

MB-OFDM-UWB Based Wireless Multimedia Sensor Networks for Underground Coalmine: A Survey.

PubMed

Han, Ruisong; Yang, Wei; You, Kaiming

2016-12-16

Safety production of coalmines is a task of top priority which plays an important role in guaranteeing, supporting and promoting the continuous development of the coal industry. Since traditional wireless sensor networks (WSNs) cannot fully meet the requirements of comprehensive environment monitoring of underground coalmines, wireless multimedia sensor networks (WMSNs), enabling the retrieval of multimedia information, are introduced to realize fine-grained and precise environment surveillance. In this paper, a framework for designing underground coalmine WMSNs based on Multi-Band Orthogonal Frequency-Division Multiplexing Ultra-wide Band (MB-OFDM-UWB) is presented. The selection of MB-OFDM-UWB wireless transmission solution is based on the characteristics of underground coalmines. Network structure and design challenges are analyzed first, which is the foundation for further discussion. Then, key supporting technologies and open research areas in different layers are surveyed, and we provide a detailed literature review of the state of the art strategies, algorithms and general solutions in these issues. Finally, other research issues like localization, information processing, and network management are discussed.

MB-OFDM-UWB Based Wireless Multimedia Sensor Networks for Underground Coalmine: A Survey

PubMed Central

Han, Ruisong; Yang, Wei; You, Kaiming

2016-01-01

Safety production of coalmines is a task of top priority which plays an important role in guaranteeing, supporting and promoting the continuous development of the coal industry. Since traditional wireless sensor networks (WSNs) cannot fully meet the requirements of comprehensive environment monitoring of underground coalmines, wireless multimedia sensor networks (WMSNs), enabling the retrieval of multimedia information, are introduced to realize fine-grained and precise environment surveillance. In this paper, a framework for designing underground coalmine WMSNs based on Multi-Band Orthogonal Frequency-Division Multiplexing Ultra-wide Band (MB-OFDM-UWB) is presented. The selection of MB-OFDM-UWB wireless transmission solution is based on the characteristics of underground coalmines. Network structure and design challenges are analyzed first, which is the foundation for further discussion. Then, key supporting technologies and open research areas in different layers are surveyed, and we provide a detailed literature review of the state of the art strategies, algorithms and general solutions in these issues. Finally, other research issues like localization, information processing, and network management are discussed. PMID:27999258

A Ten-Meter Ground-Station Telescope for Deep-Space Optical Communications: A Preliminary Design

NASA Technical Reports Server (NTRS)

Britcliffe, M.; Hoppe, D.; Roberts, W.; Page, N.

2001-01-01

This article describes a telescope design for a 10-m optical ground station for deep-space communications. The design for a direct-detection optical communications telescope differs dramatically from a telescope for imaging applications. In general, the requirements for optical manufacturing and tracking performance are much less stringent for direct detection of optical signals. The technical challenge is providing a design that will operate in the daytime/nighttime conditions required for a Deep Space Network tracking application. The design presented addresses these requirements. The design will provide higher performance at lower cost than existing designs.

State feedback control design for Boolean networks.

PubMed

Liu, Rongjie; Qian, Chunjiang; Liu, Shuqian; Jin, Yu-Fang

2016-08-26

Driving Boolean networks to desired states is of paramount significance toward our ultimate goal of controlling the progression of biological pathways and regulatory networks. Despite recent computational development of controllability of general complex networks and structural controllability of Boolean networks, there is still a lack of bridging the mathematical condition on controllability to real boolean operations in a network. Further, no realtime control strategy has been proposed to drive a Boolean network. In this study, we applied semi-tensor product to represent boolean functions in a network and explored controllability of a boolean network based on the transition matrix and time transition diagram. We determined the necessary and sufficient condition for a controllable Boolean network and mapped this requirement in transition matrix to real boolean functions and structure property of a network. An efficient tool is offered to assess controllability of an arbitrary Boolean network and to determine all reachable and non-reachable states. We found six simplest forms of controllable 2-node Boolean networks and explored the consistency of transition matrices while extending these six forms to controllable networks with more nodes. Importantly, we proposed the first state feedback control strategy to drive the network based on the status of all nodes in the network. Finally, we applied our reachability condition to the major switch of P53 pathway to predict the progression of the pathway and validate the prediction with published experimental results. This control strategy allowed us to apply realtime control to drive Boolean networks, which could not be achieved by the current control strategy for Boolean networks. Our results enabled a more comprehensive understanding of the evolution of Boolean networks and might be extended to output feedback control design.

Statistical assessment on a combined analysis of GRYN-ROMN-UCBN upland vegetation vital signs

USGS Publications Warehouse

Irvine, Kathryn M.; Rodhouse, Thomas J.

2014-01-01

As of 2013, Rocky Mountain and Upper Columbia Basin Inventory and Monitoring Networks have multiple years of vegetation data and Greater Yellowstone Network has three years of vegetation data and monitoring is ongoing in all three networks. Our primary objective is to assess whether a combined analysis of these data aimed at exploring correlations with climate and weather data is feasible. We summarize the core survey design elements across protocols and point out the major statistical challenges for a combined analysis at present. The dissimilarity in response designs between ROMN and UCBN-GRYN network protocols presents a statistical challenge that has not been resolved yet. However, the UCBN and GRYN data are compatible as they implement a similar response design; therefore, a combined analysis is feasible and will be pursued in future. When data collected by different networks are combined, the survey design describing the merged dataset is (likely) a complex survey design. A complex survey design is the result of combining datasets from different sampling designs. A complex survey design is characterized by unequal probability sampling, varying stratification, and clustering (see Lohr 2010 Chapter 7 for general overview). Statistical analysis of complex survey data requires modifications to standard methods, one of which is to include survey design weights within a statistical model. We focus on this issue for a combined analysis of upland vegetation from these networks, leaving other topics for future research. We conduct a simulation study on the possible effects of equal versus unequal probability selection of points on parameter estimates of temporal trend using available packages within the R statistical computing package. We find that, as written, using lmer or lm for trend detection in a continuous response and clm and clmm for visually estimated cover classes with “raw” GRTS design weights specified for the weight argument leads to substantially different results and/or computational instability. However, when only fixed effects are of interest, the survey package (svyglm and svyolr) may be suitable for a model-assisted analysis for trend. We provide possible directions for future research into combined analysis for ordinal and continuous vital sign indictors.

DS-ARP: a new detection scheme for ARP spoofing attacks based on routing trace for ubiquitous environments.

PubMed

Song, Min Su; Lee, Jae Dong; Jeong, Young-Sik; Jeong, Hwa-Young; Park, Jong Hyuk

2014-01-01

Despite the convenience, ubiquitous computing suffers from many threats and security risks. Security considerations in the ubiquitous network are required to create enriched and more secure ubiquitous environments. The address resolution protocol (ARP) is a protocol used to identify the IP address and the physical address of the associated network card. ARP is designed to work without problems in general environments. However, since it does not include security measures against malicious attacks, in its design, an attacker can impersonate another host using ARP spoofing or access important information. In this paper, we propose a new detection scheme for ARP spoofing attacks using a routing trace, which can be used to protect the internal network. Tracing routing can find the change of network movement path. The proposed scheme provides high constancy and compatibility because it does not alter the ARP protocol. In addition, it is simple and stable, as it does not use a complex algorithm or impose extra load on the computer system.

DS-ARP: A New Detection Scheme for ARP Spoofing Attacks Based on Routing Trace for Ubiquitous Environments

PubMed Central

Song, Min Su; Lee, Jae Dong; Jeong, Hwa-Young; Park, Jong Hyuk

2014-01-01

Despite the convenience, ubiquitous computing suffers from many threats and security risks. Security considerations in the ubiquitous network are required to create enriched and more secure ubiquitous environments. The address resolution protocol (ARP) is a protocol used to identify the IP address and the physical address of the associated network card. ARP is designed to work without problems in general environments. However, since it does not include security measures against malicious attacks, in its design, an attacker can impersonate another host using ARP spoofing or access important information. In this paper, we propose a new detection scheme for ARP spoofing attacks using a routing trace, which can be used to protect the internal network. Tracing routing can find the change of network movement path. The proposed scheme provides high constancy and compatibility because it does not alter the ARP protocol. In addition, it is simple and stable, as it does not use a complex algorithm or impose extra load on the computer system. PMID:25243205

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

PubMed

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Optimal design of monitoring networks for multiple groundwater quality parameters using a Kalman filter: application to the Irapuato-Valle aquifer.

PubMed

Júnez-Ferreira, H E; Herrera, G S; González-Hita, L; Cardona, A; Mora-Rodríguez, J

2016-01-01

A new method for the optimal design of groundwater quality monitoring networks is introduced in this paper. Various indicator parameters were considered simultaneously and tested for the Irapuato-Valle aquifer in Mexico. The steps followed in the design were (1) establishment of the monitoring network objectives, (2) definition of a groundwater quality conceptual model for the study area, (3) selection of the parameters to be sampled, and (4) selection of a monitoring network by choosing the well positions that minimize the estimate error variance of the selected indicator parameters. Equal weight for each parameter was given to most of the aquifer positions and a higher weight to priority zones. The objective for the monitoring network in the specific application was to obtain a general reconnaissance of the water quality, including water types, water origin, and first indications of contamination. Water quality indicator parameters were chosen in accordance with this objective, and for the selection of the optimal monitoring sites, it was sought to obtain a low-uncertainty estimate of these parameters for the entire aquifer and with more certainty in priority zones. The optimal monitoring network was selected using a combination of geostatistical methods, a Kalman filter and a heuristic optimization method. Results show that when monitoring the 69 locations with higher priority order (the optimal monitoring network), the joint average standard error in the study area for all the groundwater quality parameters was approximately 90 % of the obtained with the 140 available sampling locations (the set of pilot wells). This demonstrates that an optimal design can help to reduce monitoring costs, by avoiding redundancy in data acquisition.

Future provision of out of hours primary medical care: a survey with two general practitioner research networks.

PubMed Central

Lattimer, V.; Smith, H.; Hungin, P.; Glasper, A.; George, S.

1996-01-01

OBJECTIVE--To ascertain general practitioners' views about the future provision of out of hours primary medical care. DESIGN--Self completing postal questionnaire survey. SETTING--Wessex and north east England. SUBJECTS--116 general practitioners in the Wessex Primary Care Research Network and 83 in the Northern Primary Care Research Network. MAIN OUTCOME MEASURES--Intention to reduce or opt out of on call; plans for changing out of hours arrangements; the three most important changes needed to out of hours care; willingness to try, and perceived strengths and limitations of, three alternative out of hours care models--primary care emergency centres, telephone triage services, and cooperatives. RESULTS--The overall response rate was 74% (Wessex research network 77% (89/116), northern research network 71% (59/83)). Eighty three per cent of respondents (123/148) were willing to try at least one service model, primary care emergency centres being the most popular option. Key considerations were the potential for a model to reduce time on call and workload, to maintain continuity of care, and to fit the practice context. Sixty one per cent (91/148) hoped to reduce time on call and 25% (37/148) hoped to opt out completely. CONCLUSIONS--General practitioners were keen to try alternative arrangements for out of hours care delivery, despite the lack of formal trials. The increased flexibility in funding brought about by the recent agreement between the General Medical Services Committee and the Department of Health is likely to lead to a proliferation of different schemes. Careful monitoring will be necessary, and formal trials of new service models are needed urgently. PMID:8611835

A network dedicated to sciences dissemination : Scité

NASA Astrophysics Data System (ADS)

Botman, M.; Scité Network

2005-11-01

The activities of the network Scité are destined for the schools and the general public and include laboratories visits, training periods, seminars, conferences, adult courses specially designed for teachers, etc. Since 2002, collaborations between universities and enterprises are enhanced and developed to bring to light the variety of jobs linked to science and the multi-disciplinary process leading to industrial application of scientific findings. Activities will include, enterprises visits preparation of CD and video support presenting "passionate" jobs, and the set up of interactive workshops for students. Systematic relations and interactions with scientific as well as global media are established and formalised. Activities enhancing such interactions include the development of media-universities interface assuring the quality and the adequacy of scientific information transfer and vulgarisation. Based on the wide expertise accumulated through recent projects, Scité Network develop innovative activities involving a wide range of actors: universities, enterprises, media, schools, general public.

Synchronization of hybrid coupled reaction-diffusion neural networks with time delays via generalized intermittent control with spacial sampled-data.

PubMed

Lu, Binglong; Jiang, Haijun; Hu, Cheng; Abdurahman, Abdujelil

2018-05-04

The exponential synchronization of hybrid coupled reaction-diffusion neural networks with time delays is discussed in this article. At first, a generalized intermittent control with spacial sampled-data is introduced, which is intermittent in time and data sampling in space. This type of control strategy not only can unify the traditional periodic intermittent control and the aperiodic case, but also can lower the update rate of the controller in both temporal and spatial domains. Next, based on the designed control protocol and the Lyapunov-Krasovskii functional approach, some novel and readily verified criteria are established to guarantee the exponential synchronization of the considered networks. These criteria depend on the diffusion coefficients, coupled strengths, time delays as well as control parameters. Finally, the effectiveness of the proposed control strategy is shown by a numerical example. Copyright © 2018 Elsevier Ltd. All rights reserved.

Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks.

PubMed

Squartini, Tiziano; Almog, Assaf; Caldarelli, Guido; van Lelyveld, Iman; Garlaschelli, Diego; Cimini, Giulio

2017-09-01

Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets are strongly affected by the interconnections among financial institutions. Yet, while the aggregate balance sheets of institutions are publicly disclosed, information on single positions is mostly confidential and, as such, unavailable. Standard approaches to reconstruct the network of financial interconnection produce unrealistically dense topologies, leading to a biased estimation of systemic risk. Moreover, reconstruction techniques are generally designed for monopartite networks of bilateral exposures between financial institutions, thus failing in reproducing bipartite networks of security holdings (e.g., investment portfolios). Here we propose a reconstruction method based on constrained entropy maximization, tailored for bipartite financial networks. Such a procedure enhances the traditional capital-asset pricing model (CAPM) and allows us to reproduce the correct topology of the network. We test this enhanced CAPM (ECAPM) method on a dataset, collected by the European Central Bank, of detailed security holdings of European institutional sectors over a period of six years (2009-2015). Our approach outperforms the traditional CAPM and the recently proposed maximum-entropy CAPM both in reproducing the network topology and in estimating systemic risk due to fire sales spillovers. In general, ECAPM can be applied to the whole class of weighted bipartite networks described by the fitness model.

Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks

NASA Astrophysics Data System (ADS)

Squartini, Tiziano; Almog, Assaf; Caldarelli, Guido; van Lelyveld, Iman; Garlaschelli, Diego; Cimini, Giulio

2017-09-01

Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets are strongly affected by the interconnections among financial institutions. Yet, while the aggregate balance sheets of institutions are publicly disclosed, information on single positions is mostly confidential and, as such, unavailable. Standard approaches to reconstruct the network of financial interconnection produce unrealistically dense topologies, leading to a biased estimation of systemic risk. Moreover, reconstruction techniques are generally designed for monopartite networks of bilateral exposures between financial institutions, thus failing in reproducing bipartite networks of security holdings (e.g., investment portfolios). Here we propose a reconstruction method based on constrained entropy maximization, tailored for bipartite financial networks. Such a procedure enhances the traditional capital-asset pricing model (CAPM) and allows us to reproduce the correct topology of the network. We test this enhanced CAPM (ECAPM) method on a dataset, collected by the European Central Bank, of detailed security holdings of European institutional sectors over a period of six years (2009-2015). Our approach outperforms the traditional CAPM and the recently proposed maximum-entropy CAPM both in reproducing the network topology and in estimating systemic risk due to fire sales spillovers. In general, ECAPM can be applied to the whole class of weighted bipartite networks described by the fitness model.

Designing a Graphical Decision Support Tool to Improve System Acquisition Decisions

DTIC Science & Technology

2009-06-01

relationships within the data [9]. Displaying acquisition data in a graphical manner was chosen because graphical formats, in general, have been...acquisition plan which includes information pertaining to the acquisition objectives, the required capability of the system, design trade-off, budgeting...which introduce artificial neural networks to approximate the real world experience of an acquisition manager [8]. However, these strategies lack a

The ADL Registry and CORDRA. Volume 1: General Overview

DTIC Science & Technology

2008-08-01

and problems encountered by others in related fields, such as library science , computer and network systems design, and publishing. As ADL...in and exist in isolated islands, limiting their visibility, access, and reuse. 4 Compared to publishing and library science , the learning

Predicate calculus for an architecture of multiple neural networks

NASA Astrophysics Data System (ADS)

Consoli, Robert H.

1990-08-01

Future projects with neural networks will require multiple individual network components. Current efforts along these lines are ad hoc. This paper relates the neural network to a classical device and derives a multi-part architecture from that model. Further it provides a Predicate Calculus variant for describing the location and nature of the trainings and suggests Resolution Refutation as a method for determining the performance of the system as well as the location of needed trainings for specific proofs. 2. THE NEURAL NETWORK AND A CLASSICAL DEVICE Recently investigators have been making reports about architectures of multiple neural networksL234. These efforts are appearing at an early stage in neural network investigations they are characterized by architectures suggested directly by the problem space. Touretzky and Hinton suggest an architecture for processing logical statements1 the design of this architecture arises from the syntax of a restricted class of logical expressions and exhibits syntactic limitations. In similar fashion a multiple neural netword arises out of a control problem2 from the sequence learning problem3 and from the domain of machine learning. 4 But a general theory of multiple neural devices is missing. More general attempts to relate single or multiple neural networks to classical computing devices are not common although an attempt is made to relate single neural devices to a Turing machines and Sun et a!. develop a multiple neural architecture that performs pattern classification.

Design and evaluation of a peer network to support adherence to a web-based intervention for adolescents

PubMed Central

Ho, Joyce; Corden, Marya E.; Caccamo, Lauren; Tomasino, Kathryn Noth; Duffecy, Jenna; Begale, Mark; Mohr, David C.

2016-01-01

Background Depression during adolescence is common but can be prevented. Behavioral intervention technologies (BITs) designed to prevent depression in adolescence, especially standalone web-based interventions, have shown mixed outcomes, likely due to poor intervention adherence. BIT research involving adults has shown that the presence of coaches or peers promotes intervention use. Developmentally, adolescence is a time when peer-based social relationships take precedence. This study examines whether peer-networked support may promote adherence to BITs in this age group. Objective Adopting the framework of the Supportive Accountability model, which defines the types of human support and interactions required to maintain engagement and persistence with BITs, this paper presents a feasibility study of a peer-networked online intervention for depression prevention among adolescents. We described the development of the peer network, the evaluation of participant use of the peer networking features, and qualitative user feedback to inform continued BIT development. Method Two groups of adolescents (N = 13) participated in 10-week programs of the peer networked based online intervention. Adolescents had access to didactic lessons, CBT based mood management tools, and peer networking features. The peer networking features are integrated into the site by making use expectations explicit, allow network members to monitor the activities of others, and to supportively hold each other accountable for meeting use expectations. The study collected qualitative feedback from participants as well as usage of site features and tools. Results Participants logged in an average of 12.8 sessions over an average of 10.4 unique days during the 10-week program. On average, 66% of all use sessions occurred within the first 3 weeks of use. The number of “exchange comments”, that is, comments posted that were part of an exchange between two or more participants, was significantly positively correlated with mean time spent on site (r = 0.62, p = 0.032), use of the Activity Tracker (r = 0.70, p = 0.012) and Didactic Lesson (r = 0.73, p = 0.007). Qualitative interviews revealed that adolescents generally liked and were motivated by the peer networking features during the first weeks of the intervention when general site use by group members was high. However, the decrease of site use by group members during the subsequent weeks negatively affected participants’ desire to log on or engage with group members. Conclusions This pilot study highlights the potential that a BIT designed to harness the connection among a peer network, thereby promoting supportive accountability, may improve adolescent adherence to BITs for depression prevention. PMID:27722095

The Role of Social Network Technologies in Online Health Promotion: A Narrative Review of Theoretical and Empirical Factors Influencing Intervention Effectiveness

PubMed Central

Kennedy, Catriona M; Buchan, Iain; Powell, John; Ainsworth, John

2015-01-01

Background Social network technologies have become part of health education and wider health promotion—either by design or happenstance. Social support, peer pressure, and information sharing in online communities may affect health behaviors. If there are positive and sustained effects, then social network technologies could increase the effectiveness and efficiency of many public health campaigns. Social media alone, however, may be insufficient to promote health. Furthermore, there may be unintended and potentially harmful consequences of inaccurate or misleading health information. Given these uncertainties, there is a need to understand and synthesize the evidence base for the use of online social networking as part of health promoting interventions to inform future research and practice. Objective Our aim was to review the research on the integration of expert-led health promotion interventions with online social networking in order to determine the extent to which the complementary benefits of each are understood and used. We asked, in particular, (1) How is effectiveness being measured and what are the specific problems in effecting health behavior change?, and (2) To what extent is the designated role of social networking grounded in theory? Methods The narrative synthesis approach to literature review was used to analyze the existing evidence. We searched the indexed scientific literature using keywords associated with health promotion and social networking. The papers included were only those making substantial study of both social networking and health promotion—either reporting the results of the intervention or detailing evidence-based plans. General papers about social networking and health were not included. Results The search identified 162 potentially relevant documents after review of titles and abstracts. Of these, 42 satisfied the inclusion criteria after full-text review. Six studies described randomized controlled trials (RCTs) evaluating the effectiveness of online social networking within health promotion interventions. Most of the trials investigated the value of a “social networking condition” in general and did not identify specific features that might play a role in effectiveness. Issues about the usability and level of uptake of interventions were more common among pilot studies, while observational studies showed positive evidence about the role of social support. A total of 20 papers showed the use of theory in the design of interventions, but authors evaluated effectiveness in only 10 papers. Conclusions More research is needed in this area to understand the actual effect of social network technologies on health promotion. More RCTs of greater length need to be conducted taking into account contextual factors such as patient characteristics and types of a social network technology. Also, more evidence is needed regarding the actual usability of online social networking and how different interface design elements may help or hinder behavior change and engagement. Moreover, it is crucial to investigate further the effect of theory on the effectiveness of this type of technology for health promotion. Research is needed linking theoretical grounding with observation and analysis of health promotion in online networks. PMID:26068087

Network dysfunction predicts speech production after left hemisphere stroke.

PubMed

Geranmayeh, Fatemeh; Leech, Robert; Wise, Richard J S

2016-03-09

To investigate the role of multiple distributed brain networks, including the default mode, fronto-temporo-parietal, and cingulo-opercular networks, which mediate domain-general and task-specific processes during speech production after aphasic stroke. We conducted an observational functional MRI study to investigate the effects of a previous left hemisphere stroke on functional connectivity within and between distributed networks as patients described pictures. Study design included various baseline tasks, and we compared results to those of age-matched healthy participants performing the same tasks. We used independent component and psychophysiological interaction analyses. Although activity within individual networks was not predictive of speech production, relative activity between networks was a predictor of both within-scanner and out-of-scanner language performance, over and above that predicted from lesion volume, age, sex, and years of education. Specifically, robust functional imaging predictors were the differential activity between the default mode network and both the left and right fronto-temporo-parietal networks, respectively activated and deactivated during speech. We also observed altered between-network functional connectivity of these networks in patients during speech production. Speech production is dependent on complex interactions among widely distributed brain networks, indicating that residual speech production after stroke depends on more than the restoration of local domain-specific functions. Our understanding of the recovery of function following focal lesions is not adequately captured by consideration of ipsilesional or contralesional brain regions taking over lost domain-specific functions, but is perhaps best considered as the interaction between what remains of domain-specific networks and domain-general systems that regulate behavior. © 2016 American Academy of Neurology.

Network dysfunction predicts speech production after left hemisphere stroke

PubMed Central

Leech, Robert; Wise, Richard J.S.

2016-01-01

Objective: To investigate the role of multiple distributed brain networks, including the default mode, fronto-temporo-parietal, and cingulo-opercular networks, which mediate domain-general and task-specific processes during speech production after aphasic stroke. Methods: We conducted an observational functional MRI study to investigate the effects of a previous left hemisphere stroke on functional connectivity within and between distributed networks as patients described pictures. Study design included various baseline tasks, and we compared results to those of age-matched healthy participants performing the same tasks. We used independent component and psychophysiological interaction analyses. Results: Although activity within individual networks was not predictive of speech production, relative activity between networks was a predictor of both within-scanner and out-of-scanner language performance, over and above that predicted from lesion volume, age, sex, and years of education. Specifically, robust functional imaging predictors were the differential activity between the default mode network and both the left and right fronto-temporo-parietal networks, respectively activated and deactivated during speech. We also observed altered between-network functional connectivity of these networks in patients during speech production. Conclusions: Speech production is dependent on complex interactions among widely distributed brain networks, indicating that residual speech production after stroke depends on more than the restoration of local domain-specific functions. Our understanding of the recovery of function following focal lesions is not adequately captured by consideration of ipsilesional or contralesional brain regions taking over lost domain-specific functions, but is perhaps best considered as the interaction between what remains of domain-specific networks and domain-general systems that regulate behavior. PMID:26962070

CS_TOTR: A new vertex centrality method for directed signed networks based on status theory

NASA Astrophysics Data System (ADS)

Ma, Yue; Liu, Min; Zhang, Peng; Qi, Xingqin

Measuring the importance (or centrality) of vertices in a network is a significant topic in complex network analysis, which has significant applications in diverse domains, for example, disease control, spread of rumors, viral marketing and so on. Existing studies mainly focus on social networks with only positive (or friendship) relations, while signed networks with also negative (or enemy) relations are seldom studied. Various signed networks commonly exist in real world, e.g. a network indicating friendship/enmity, love/hate or trust/mistrust relationships. In this paper, we propose a new centrality method named CS_TOTR to give a ranking of vertices in directed signed networks. To design this new method, we use the “status theory” for signed networks, and also adopt the vertex ranking algorithm for a tournament and the topological sorting algorithm for a general directed graph. We apply this new centrality method on the famous Sampson Monastery dataset and obtain a convincing result which shows its validity.

Multi-scale Multi-mechanism Design of Tough Hydrogels: Building Dissipation into Stretchy Networks

PubMed Central

Zhao, Xuanhe

2014-01-01

As swollen polymer networks in water, hydrogels are usually brittle. However, hydrogels with high toughness play critical roles in many plant and animal tissues as well as in diverse engineering applications. Here we review the intrinsic mechanisms of a wide variety of tough hydrogels developed over past few decades. We show that tough hydrogels generally possess mechanisms to dissipate substantial mechanical energy but still maintain high elasticity under deformation. The integrations and interactions of different mechanisms for dissipating energy and maintaining elasticity are essential to the design of tough hydrogels. A matrix that combines various mechanisms is constructed for the first time to guide the design of next-generation tough hydrogels. We further highlight that a particularly promising strategy for the design is to implement multiple mechanisms across multiple length scales into nano-, micro-, meso-, and macro-structures of hydrogels. PMID:24834901

Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources

PubMed Central

Leeson, Mark S.

2014-01-01

The minimization of network coding resources, such as coding nodes and links, is a challenging task, not only because it is a NP-hard problem, but also because the problem scale is huge; for example, networks in real world may have thousands or even millions of nodes and links. Genetic algorithms (GAs) have a good potential of resolving NP-hard problems like the network coding problem (NCP), but as a population-based algorithm, serious scalability and applicability problems are often confronted when GAs are applied to large- or huge-scale systems. Inspired by the temporal receding horizon control in control engineering, this paper proposes a novel spatial receding horizon control (SRHC) strategy as a network partitioning technology, and then designs an efficient GA to tackle the NCP. Traditional network partitioning methods can be viewed as a special case of the proposed SRHC, that is, one-step-wide SRHC, whilst the method in this paper is a generalized N-step-wide SRHC, which can make a better use of global information of network topologies. Besides the SRHC strategy, some useful designs are also reported in this paper. The advantages of the proposed SRHC and GA for the NCP are illustrated by extensive experiments, and they have a good potential of being extended to other large-scale complex problems. PMID:24883371

Requirements for a network storage service

NASA Technical Reports Server (NTRS)

Kelly, Suzanne M.; Haynes, Rena A.

1991-01-01

Sandia National Laboratories provides a high performance classified computer network as a core capability in support of its mission of nuclear weapons design and engineering, physical sciences research, and energy research and development. The network, locally known as the Internal Secure Network (ISN), comprises multiple distributed local area networks (LAN's) residing in New Mexico and California. The TCP/IP protocol suite is used for inter-node communications. Scientific workstations and mid-range computers, running UNIX-based operating systems, compose most LAN's. One LAN, operated by the Sandia Corporate Computing Computing Directorate, is a general purpose resource providing a supercomputer and a file server to the entire ISN. The current file server on the supercomputer LAN is an implementation of the Common File Server (CFS). Subsequent to the design of the ISN, Sandia reviewed its mass storage requirements and chose to enter into a competitive procurement to replace the existing file server with one more adaptable to a UNIX/TCP/IP environment. The requirements study for the network was the starting point for the requirements study for the new file server. The file server is called the Network Storage Service (NSS) and its requirements are described. An application or functional description of the NSS is given. The final section adds performance, capacity, and access constraints to the requirements.

Medical reliable network using concatenated channel codes through GSM network.

PubMed

Ahmed, Emtithal; Kohno, Ryuji

2013-01-01

Although the 4(th) generation (4G) of global mobile communication network, i.e. Long Term Evolution (LTE) coexisting with the 3(rd) generation (3G) has successfully started; the 2(nd) generation (2G), i.e. Global System for Mobile communication (GSM) still playing an important role in many developing countries. Without any other reliable network infrastructure, GSM can be applied for tele-monitoring applications, where high mobility and low cost are necessary. A core objective of this paper is to introduce the design of a more reliable and dependable Medical Network Channel Code system (MNCC) through GSM Network. MNCC design based on simple concatenated channel code, which is cascade of an inner code (GSM) and an extra outer code (Convolution Code) in order to protect medical data more robust against channel errors than other data using the existing GSM network. In this paper, the MNCC system will provide Bit Error Rate (BER) equivalent to the BER for medical tele monitoring of physiological signals, which is 10(-5) or less. The performance of the MNCC has been proven and investigated using computer simulations under different channels condition such as, Additive White Gaussian Noise (AWGN), Rayleigh noise and burst noise. Generally the MNCC system has been providing better performance as compared to GSM.

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.

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

NASA Technical Reports Server (NTRS)

Majumdar, A. K.; Hedayat, A.

2015-01-01

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects.

Distributed robust finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

This paper investigates the robust finite-time consensus problem of multi-agent systems in networks with undirected topology. Global nonlinear consensus protocols augmented with a variable structure are constructed with the aid of Lyapunov functions for each single-integrator agent dynamics in the presence of external disturbances. In particular, it is shown that the finite settling time of the proposed general framework for robust consensus design is upper bounded for any initial condition. This makes it possible for network consensus problems to design and estimate the convergence time offline for a multi-agent team with a given undirected information flow. Finally, simulation results are presented to demonstrate the performance and effectiveness of our finite-time protocols.

Promising Practices in CTS.

ERIC Educational Resources Information Center

Alberta Dept. of Education, Edmonton. Curriculum Standards Branch.

This document contains 85 articles taken from previously published issues of the "CTS Communication Network Update," a publication about the career and technology studies (CTS) program of career education designed for Alberta, Canada, high school juniors and seniors. Following an introductory section and a section on general CTS, the…

Arizona TeleMedicine Network: System Procurement Specifications.

ERIC Educational Resources Information Center

Atlantic Research Corp., Alexandria, VA.

Providing general specifications and system descriptions for segments within the Arizona TeleMedicine Project (a telecommunication system designed to deliver health services to rurally isolated American Indians in Arizona), this document, when used with the appropriate route segment document, will completely describe the project's required…

High-Bandwidth Tactical-Network Data Analysis in a High-Performance-Computing (HPC) Environment: Voice Call Analysis

DTIC Science & Technology

2015-09-01

Gateway 2 4. Voice Packet Flow: SIP , Session Description Protocol (SDP), and RTP 3 5. Voice Data Analysis 5 6. Call Analysis 6 7. Call Metrics 6...analysis processing is designed for a general VoIP system architecture based on Session Initiation Protocol ( SIP ) for negotiating call sessions and...employs Skinny Client Control Protocol for network communication between the phone and the local CallManager (e.g., for each dialed digit), SIP

Analytical Models of Cross-Layer Protocol Optimization in Real-Time Wireless Sensor Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

The real-time interactions among the nodes of a wireless sensor network (WSN) to cooperatively process data from multiple sensors are modeled. Quality-of-service (QoS) metrics are associated with the quality of fused information: throughput, delay, packet error rate, etc. Multivariate point process (MVPP) models of discrete random events in WSNs establish stochastic characteristics of optimal cross-layer protocols. Discrete-event, cross-layer interactions in mobile ad hoc network (MANET) protocols have been modeled using a set of concatenated design parameters and associated resource levels by the MVPPs. Characterization of the "best" cross-layer designs for a MANET is formulated by applying the general theory of martingale representations to controlled MVPPs. Performance is described in terms of concatenated protocol parameters and controlled through conditional rates of the MVPPs. Modeling limitations to determination of closed-form solutions versus explicit iterative solutions for ad hoc WSN controls are examined.

Network Model-Assisted Inference from Respondent-Driven Sampling Data

PubMed Central

Gile, Krista J.; Handcock, Mark S.

2015-01-01

Summary Respondent-Driven Sampling is a widely-used method for sampling hard-to-reach human populations by link-tracing over their social networks. Inference from such data requires specialized techniques because the sampling process is both partially beyond the control of the researcher, and partially implicitly defined. Therefore, it is not generally possible to directly compute the sampling weights for traditional design-based inference, and likelihood inference requires modeling the complex sampling process. As an alternative, we introduce a model-assisted approach, resulting in a design-based estimator leveraging a working network model. We derive a new class of estimators for population means and a corresponding bootstrap standard error estimator. We demonstrate improved performance compared to existing estimators, including adjustment for an initial convenience sample. We also apply the method and an extension to the estimation of HIV prevalence in a high-risk population. PMID:26640328

Network Model-Assisted Inference from Respondent-Driven Sampling Data.

PubMed

Gile, Krista J; Handcock, Mark S

2015-06-01

Respondent-Driven Sampling is a widely-used method for sampling hard-to-reach human populations by link-tracing over their social networks. Inference from such data requires specialized techniques because the sampling process is both partially beyond the control of the researcher, and partially implicitly defined. Therefore, it is not generally possible to directly compute the sampling weights for traditional design-based inference, and likelihood inference requires modeling the complex sampling process. As an alternative, we introduce a model-assisted approach, resulting in a design-based estimator leveraging a working network model. We derive a new class of estimators for population means and a corresponding bootstrap standard error estimator. We demonstrate improved performance compared to existing estimators, including adjustment for an initial convenience sample. We also apply the method and an extension to the estimation of HIV prevalence in a high-risk population.

Simulating and assessing boson sampling experiments with phase-space representations

NASA Astrophysics Data System (ADS)

Opanchuk, Bogdan; Rosales-Zárate, Laura; Reid, Margaret D.; Drummond, Peter D.

2018-04-01

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples, with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible. This introduces a challenge: how does one design or understand such photonic networks? One must be able to calculate observables using general methods capable of treating arbitrary inputs, dissipation, and noise. We develop complex phase-space software for simulating these photonic networks, and apply this to boson sampling experiments. Our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples. We show that these techniques remove systematic errors in previous algorithms for estimating correlations, with large improvements in errors in some cases. In addition, we obtain a scalable channel-combination strategy for assessment of boson sampling devices.

Developmental engineering: a new paradigm for the design and manufacturing of cell-based products. Part II: from genes to networks: tissue engineering from the viewpoint of systems biology and network science.

PubMed

Lenas, Petros; Moos, Malcolm; Luyten, Frank P

2009-12-01

The field of tissue engineering is moving toward a new concept of "in vitro biomimetics of in vivo tissue development." In Part I of this series, we proposed a theoretical framework integrating the concepts of developmental biology with those of process design to provide the rules for the design of biomimetic processes. We named this methodology "developmental engineering" to emphasize that it is not the tissue but the process of in vitro tissue development that has to be engineered. To formulate the process design rules in a rigorous way that will allow a computational design, we should refer to mathematical methods to model the biological process taking place in vitro. Tissue functions cannot be attributed to individual molecules but rather to complex interactions between the numerous components of a cell and interactions between cells in a tissue that form a network. For tissue engineering to advance to the level of a technologically driven discipline amenable to well-established principles of process engineering, a scientifically rigorous formulation is needed of the general design rules so that the behavior of networks of genes, proteins, or cells that govern the unfolding of developmental processes could be related to the design parameters. Now that sufficient experimental data exist to construct plausible mathematical models of many biological control circuits, explicit hypotheses can be evaluated using computational approaches to facilitate process design. Recent progress in systems biology has shown that the empirical concepts of developmental biology that we used in Part I to extract the rules of biomimetic process design can be expressed in rigorous mathematical terms. This allows the accurate characterization of manufacturing processes in tissue engineering as well as the properties of the artificial tissues themselves. In addition, network science has recently shown that the behavior of biological networks strongly depends on their topology and has developed the necessary concepts and methods to describe it, allowing therefore a deeper understanding of the behavior of networks during biomimetic processes. These advances thus open the door to a transition for tissue engineering from a substantially empirical endeavor to a technology-based discipline comparable to other branches of engineering.

A design concept for an MMIC (Monolithic Microwave Integrated Circuit) microstrip phased array

NASA Technical Reports Server (NTRS)

Lee, Richard Q.; Smetana, Jerry; Acosta, Roberto

1987-01-01

A conceptual design for a microstrip phased array with monolithic microwave integrated circuit (MMIC) amplitude and phase controls is described. The MMIC devices used are 20 GHz variable power amplifiers and variable phase shifters recently developed by NASA contractors for applications in future Ka proposed design, which concept is for a general NxN element array of rectangular lattice geometry. Subarray excitation is incorporated in the MMIC phased array design to reduce the complexity of the beam forming network and the number of MMIC components required.

Walkability for Different Urban Granularities

NASA Astrophysics Data System (ADS)

Hollenstein, D.; Bleisch, S.

2016-06-01

The positive effects of low-intensity physical activity are widely acknowledged and in this context walking is often promoted as an active form of transport. Under the concept of walkability the role of the built environment in encouraging walking is investigated. For that purpose, walkability is quantified area-wise by measuring a varying set of built environment attributes. In purely GIS-based approaches to studying walkability, indices are generally built using existing and easily accessible data. These include street network design, population density, land use mix, and access to destinations. Access to destinations is usually estimated using either a fixed radius, or distances in the street network. In this paper, two approaches to approximate a footpath network are presented. The two footpath networks were built making different assumptions regarding the walkability of different street types with respect to more or less restrictive safety preferences. Information on sidewalk presence, pedestrian crossings, and traffic restrictions were used to build both networks. The first network comprises car traffic free areas only. The second network includes streets with low speed limits that have no sidewalks. Both networks are compared to the more commonly used street network in an access-to-distance analysis. The results suggest that for the generally highly walkable study area, access to destination mostly depends on destination density within the defined walkable distance. However, on single street segments access to destinations is diminished when only car traffic free spaces are assumed to be walkable.

Computerized pigment design based on property hypersurfaces

NASA Astrophysics Data System (ADS)

Halova, Jaroslava; Sulcova, Petra; Kupka, Karel

2007-05-01

Competition is tough in the pigment market. Rational pigment design has therefore a competitive advantage, saving time and money. The aim of this work is to provide methods that can assist in designing pigments with defined properties. These methods include partial least squares regression (PLSR), neural network (NN) and generalized regression ANOVA model. Authors show how PLS bi-plot can be used to identify market gaps poorly covered by pigment manufacturers, thus giving an opportunity to develop pigments with potentially profitable properties.

A multiobjective optimization framework for multicontaminant industrial water network design.

PubMed

Boix, Marianne; Montastruc, Ludovic; Pibouleau, Luc; Azzaro-Pantel, Catherine; Domenech, Serge

2011-07-01

The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F(1), the freshwater flow-rate at the network entrance, F(2), the water flow-rate at inlet of regeneration units, and F(3), the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view. Copyright © 2011 Elsevier Ltd. All rights reserved.

HRLSim: a high performance spiking neural network simulator for GPGPU clusters.

PubMed

Minkovich, Kirill; Thibeault, Corey M; O'Brien, Michael John; Nogin, Aleksey; Cho, Youngkwan; Srinivasa, Narayan

2014-02-01

Modeling of large-scale spiking neural models is an important tool in the quest to understand brain function and subsequently create real-world applications. This paper describes a spiking neural network simulator environment called HRL Spiking Simulator (HRLSim). This simulator is suitable for implementation on a cluster of general purpose graphical processing units (GPGPUs). Novel aspects of HRLSim are described and an analysis of its performance is provided for various configurations of the cluster. With the advent of inexpensive GPGPU cards and compute power, HRLSim offers an affordable and scalable tool for design, real-time simulation, and analysis of large-scale spiking neural networks.

Capacity Model and Constraints Analysis for Integrated Remote Wireless Sensor and Satellite Network in Emergency Scenarios

PubMed Central

Zhang, Wei; Zhang, Gengxin; Dong, Feihong; Xie, Zhidong; Bian, Dongming

2015-01-01

This article investigates the capacity problem of an integrated remote wireless sensor and satellite network (IWSSN) in emergency scenarios. We formulate a general model to evaluate the remote sensor and satellite network capacity. Compared to most existing works for ground networks, the proposed model is time varying and space oriented. To capture the characteristics of a practical network, we sift through major capacity-impacting constraints and analyze the influence of these constraints. Specifically, we combine the geometric satellite orbit model and satellite tool kit (STK) engineering software to quantify the trends of the capacity constraints. Our objective in analyzing these trends is to provide insights and design guidelines for optimizing the integrated remote wireless sensor and satellite network schedules. Simulation results validate the theoretical analysis of capacity trends and show the optimization opportunities of the IWSSN. PMID:26593919

Capacity Model and Constraints Analysis for Integrated Remote Wireless Sensor and Satellite Network in Emergency Scenarios.

PubMed

Zhang, Wei; Zhang, Gengxin; Dong, Feihong; Xie, Zhidong; Bian, Dongming

2015-11-17

This article investigates the capacity problem of an integrated remote wireless sensor and satellite network (IWSSN) in emergency scenarios. We formulate a general model to evaluate the remote sensor and satellite network capacity. Compared to most existing works for ground networks, the proposed model is time varying and space oriented. To capture the characteristics of a practical network, we sift through major capacity-impacting constraints and analyze the influence of these constraints. Specifically, we combine the geometric satellite orbit model and satellite tool kit (STK) engineering software to quantify the trends of the capacity constraints. Our objective in analyzing these trends is to provide insights and design guidelines for optimizing the integrated remote wireless sensor and satellite network schedules. Simulation results validate the theoretical analysis of capacity trends and show the optimization opportunities of the IWSSN.

Speed synchronization control for integrated automotive motor-transmission powertrain system with random delays

NASA Astrophysics Data System (ADS)

Zhu, Xiaoyuan; Zhang, Hui; Fang, Zongde

2015-12-01

This paper presents a robust speed synchronization controller design for an integrated motor-transmission powertrain system in which the driving motor and multi-gearbox are directly coupled. As the controller area network (CAN) is commonly used in the vehicle powertrain system, the possible network-induced random delays in both feedback and forward channel are considered and modeled by using two Markov chains in the controller design process. For the application perspective, the control law adopted here is a generalized proportional-integral (PI) control. By employing the system-augmentation technique, a delay-free stochastic closed-loop system is obtained and the generalized PI controller design problem is converted to a static output feedback (SOF) controller design problem. Since there are external disturbances involved in the closed-loop system, the energy-to-peak performance is considered to guarantee the robustness of the controller. And the controlled output is chosen as the speed synchronization error. To further improve the transient response of the closed-loop system, the pole placement is also employed in the energy-to-peak performance based speed synchronization control. The mode-dependent control gains are obtained by using an iterative linear matrix inequality (LMI) algorithm. Simulation results show the effectiveness of the proposed control approach.

Interaction Control to Synchronize Non-synchronizable Networks.

PubMed

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-11-17

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks' exact interaction topology and consequently have implications for biological and self-organizing technical systems.

Structural Behavioral Study on the General Aviation Network Based on Complex Network

NASA Astrophysics Data System (ADS)

Zhang, Liang; Lu, Na

2017-12-01

The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

Southern California Seismic Network: New Design and Implementation of Redundant and Reliable Real-time Data Acquisition Systems

NASA Astrophysics Data System (ADS)

Saleh, T.; Rico, H.; Solanki, K.; Hauksson, E.; Friberg, P.

2005-12-01

The Southern California Seismic Network (SCSN) handles more than 2500 high-data rate channels from more than 380 seismic stations distributed across southern California. These data are imported real-time from dataloggers, earthworm hubs, and partner networks. The SCSN also exports data to eight different partner networks. Both the imported and exported data are critical for emergency response and scientific research. Previous data acquisition systems were complex and difficult to operate, because they grew in an ad hoc fashion to meet the increasing needs for distributing real-time waveform data. To maximize reliability and redundancy, we apply best practices methods from computer science for implementing the software and hardware configurations for import, export, and acquisition of real-time seismic data. Our approach makes use of failover software designs, methods for dividing labor diligently amongst the network nodes, and state of the art networking redundancy technologies. To facilitate maintenance and daily operations we seek to provide some separation between major functions such as data import, export, acquisition, archiving, real-time processing, and alarming. As an example, we make waveform import and export functions independent by operating them on separate servers. Similarly, two independent servers provide waveform export, allowing data recipients to implement their own redundancy. The data import is handled differently by using one primary server and a live backup server. These data import servers, run fail-over software that allows automatic role switching in case of failure from primary to shadow. Similar to the classic earthworm design, all the acquired waveform data are broadcast onto a private network, which allows multiple machines to acquire and process the data. As we separate data import and export away from acquisition, we are also working on new approaches to separate real-time processing and rapid reliable archiving of real-time data. Further, improved network security is an integral part of the new design. Redundant firewalls will provide secure data imports, exports, and acquisition as well as DMZ zones for web servers and other publicly available servers. We will present the detailed design of this new configuration that is currently being implemented by the SCSN at Caltech. The design principals are general enough to be of use to most regional seismic networks.

Developments in Test Facility and Data Networking for the Altitude Test Stand at the John C. Stennis Space Center, MS - A General Overview

NASA Technical Reports Server (NTRS)

Hebert, Phillip W., Sr.

2008-01-01

May 2007, NASA's Constellation Program selected John C Stennis Space Center (SSC) near Waveland Mississippi as the site to construct an altitude test facility for the developmental and qualification testing of the Ares1 upper stage (US) engine. Test requirements born out of the Ares1 US propulsion system design necessitate exceptional Data Acquisition System (DAS) design solutions that support facility and propellant systems conditioning, test operations control and test data analysis. This paper reviews the new A3 Altitude Test Facility's DAS design requirements for real-time deterministic digital data, DAS technology enhancements, system trades, technology validation activities, and the current status of this system's new architecture. Also to be discussed will be current network technologies to improve data transfer.

A General Surface Representation Module Designed for Geodesy

DTIC Science & Technology

1980-06-01

one considers as a reasonable interpolation function, one of the often accepted compromises is the choice q = 2 (Schumnaker, 1976, Bybee and Bedross...Fast Fourier Transform: Englewood Cliffs, New Jersey. Bybee , J.E. and G.M. Bedross (1978): The IPIN computer network control softward. In: Proceedings

Multi-agent based control of large-scale complex systems employing distributed dynamic inference engine

NASA Astrophysics Data System (ADS)

Zhang, Daili

Increasing societal demand for automation has led to considerable efforts to control large-scale complex systems, especially in the area of autonomous intelligent control methods. The control system of a large-scale complex system needs to satisfy four system level requirements: robustness, flexibility, reusability, and scalability. Corresponding to the four system level requirements, there arise four major challenges. First, it is difficult to get accurate and complete information. Second, the system may be physically highly distributed. Third, the system evolves very quickly. Fourth, emergent global behaviors of the system can be caused by small disturbances at the component level. The Multi-Agent Based Control (MABC) method as an implementation of distributed intelligent control has been the focus of research since the 1970s, in an effort to solve the above-mentioned problems in controlling large-scale complex systems. However, to the author's best knowledge, all MABC systems for large-scale complex systems with significant uncertainties are problem-specific and thus difficult to extend to other domains or larger systems. This situation is partly due to the control architecture of multiple agents being determined by agent to agent coupling and interaction mechanisms. Therefore, the research objective of this dissertation is to develop a comprehensive, generalized framework for the control system design of general large-scale complex systems with significant uncertainties, with the focus on distributed control architecture design and distributed inference engine design. A Hybrid Multi-Agent Based Control (HyMABC) architecture is proposed by combining hierarchical control architecture and module control architecture with logical replication rings. First, it decomposes a complex system hierarchically; second, it combines the components in the same level as a module, and then designs common interfaces for all of the components in the same module; third, replications are made for critical agents and are organized into logical rings. This architecture maintains clear guidelines for complexity decomposition and also increases the robustness of the whole system. Multiple Sectioned Dynamic Bayesian Networks (MSDBNs) as a distributed dynamic probabilistic inference engine, can be embedded into the control architecture to handle uncertainties of general large-scale complex systems. MSDBNs decomposes a large knowledge-based system into many agents. Each agent holds its partial perspective of a large problem domain by representing its knowledge as a Dynamic Bayesian Network (DBN). Each agent accesses local evidence from its corresponding local sensors and communicates with other agents through finite message passing. If the distributed agents can be organized into a tree structure, satisfying the running intersection property and d-sep set requirements, globally consistent inferences are achievable in a distributed way. By using different frequencies for local DBN agent belief updating and global system belief updating, it balances the communication cost with the global consistency of inferences. In this dissertation, a fully factorized Boyen-Koller (BK) approximation algorithm is used for local DBN agent belief updating, and the static Junction Forest Linkage Tree (JFLT) algorithm is used for global system belief updating. MSDBNs assume a static structure and a stable communication network for the whole system. However, for a real system, sub-Bayesian networks as nodes could be lost, and the communication network could be shut down due to partial damage in the system. Therefore, on-line and automatic MSDBNs structure formation is necessary for making robust state estimations and increasing survivability of the whole system. A Distributed Spanning Tree Optimization (DSTO) algorithm, a Distributed D-Sep Set Satisfaction (DDSSS) algorithm, and a Distributed Running Intersection Satisfaction (DRIS) algorithm are proposed in this dissertation. Combining these three distributed algorithms and a Distributed Belief Propagation (DBP) algorithm in MSDBNs makes state estimations robust to partial damage in the whole system. Combining the distributed control architecture design and the distributed inference engine design leads to a process of control system design for a general large-scale complex system. As applications of the proposed methodology, the control system design of a simplified ship chilled water system and a notional ship chilled water system have been demonstrated step by step. Simulation results not only show that the proposed methodology gives a clear guideline for control system design for general large-scale complex systems with dynamic and uncertain environment, but also indicate that the combination of MSDBNs and HyMABC can provide excellent performance for controlling general large-scale complex systems.

Designing a sexual network study of men who have sex with other men: exploring racial and ethnic preferences in study design and methods.

PubMed

Biello, Katie B; Malone, Jowanna; Mayer, Kenneth H; Bazzi, Angela Robertson; Mimiaga, Matthew J

2017-01-01

Black and Latino gay, bisexual, and other men who have sex with men (MSM) have higher rates of HIV and other sexually transmitted infections (STIs) than their White counterparts. Differences in sexual networks have been hypothesized to play an important role in the observed racial/ethnic disparities in risk. However, concerns about the acceptability and feasibility of conducting sociocentric sexual network studies have left a dearth of data on the structure of sexual networks of MSM. If certain network research procedures are unacceptable among target populations, biases may be introduced. We conducted qualitative interviews and brief surveys with 30 self-identified Black (n = 12), Hispanic/Latino, (n = 9) and White (n = 9) sexually active MSM in the Greater Boston area to assess the acceptability and feasibility of potential procedures for a sociocentric sexual network study. We found that referring recent sexual partners as part of a sociocentric network study was generally acceptable, but racial/ethnic differences emerged regarding specific preferences for how to recruit sexual partners. While the majority of Black participants (7/12) explained that they would not want their name disclosed to sexual partners approached for study participation, most Latino participants (7/9) preferred having the opportunity to inform referrals themselves about the study prior to researchers contacting them, and White participants (8/9) favored having researchers disclose their names when recruiting referrals, emphasizing the importance of transparency. In order to reduce differential rates of research participation, increase scientific validity, and reduce risks of social harm, researchers studying sexual networks among MSM should be aware of these potential differences, engage communities in study design, and provide participants with a variety of options for recruiting their sexual partners.

In-Space Networking on NASA's SCAN Testbed

NASA Technical Reports Server (NTRS)

Brooks, David E.; Eddy, Wesley M.; Clark, Gilbert J.; Johnson, Sandra K.

2016-01-01

The NASA Space Communications and Navigation (SCaN) Testbed, an external payload onboard the International Space Station, is equipped with three software defined radios and a flight computer for supporting in-space communication research. New technologies being studied using the SCaN Testbed include advanced networking, coding, and modulation protocols designed to support the transition of NASAs mission systems from primarily point to point data links and preplanned routes towards adaptive, autonomous internetworked operations needed to meet future mission objectives. Networking protocols implemented on the SCaN Testbed include the Advanced Orbiting Systems (AOS) link-layer protocol, Consultative Committee for Space Data Systems (CCSDS) Encapsulation Packets, Internet Protocol (IP), Space Link Extension (SLE), CCSDS File Delivery Protocol (CFDP), and Delay-Tolerant Networking (DTN) protocols including the Bundle Protocol (BP) and Licklider Transmission Protocol (LTP). The SCaN Testbed end-to-end system provides three S-band data links and one Ka-band data link to exchange space and ground data through NASAs Tracking Data Relay Satellite System or a direct-to-ground link to ground stations. The multiple data links and nodes provide several upgradable elements on both the space and ground systems. This paper will provide a general description of the testbeds system design and capabilities, discuss in detail the design and lessons learned in the implementation of the network protocols, and describe future plans for continuing research to meet the communication needs for evolving global space systems.

Neural networks for feedback feedforward nonlinear control systems.

PubMed

Parisini, T; Zoppoli, R

1994-01-01

This paper deals with the problem of designing feedback feedforward control strategies to drive the state of a dynamic system (in general, nonlinear) so as to track any desired trajectory joining the points of given compact sets, while minimizing a certain cost function (in general, nonquadratic). Due to the generality of the problem, conventional methods are difficult to apply. Thus, an approximate solution is sought by constraining control strategies to take on the structure of multilayer feedforward neural networks. After discussing the approximation properties of neural control strategies, a particular neural architecture is presented, which is based on what has been called the "linear-structure preserving principle". The original functional problem is then reduced to a nonlinear programming one, and backpropagation is applied to derive the optimal values of the synaptic weights. Recursive equations to compute the gradient components are presented, which generalize the classical adjoint system equations of N-stage optimal control theory. Simulation results related to nonlinear nonquadratic problems show the effectiveness of the proposed method.

Integrative Analysis of Many Weighted Co-Expression Networks Using Tensor Computation

PubMed Central

Li, Wenyuan; Liu, Chun-Chi; Zhang, Tong; Li, Haifeng; Waterman, Michael S.; Zhou, Xianghong Jasmine

2011-01-01

The rapid accumulation of biological networks poses new challenges and calls for powerful integrative analysis tools. Most existing methods capable of simultaneously analyzing a large number of networks were primarily designed for unweighted networks, and cannot easily be extended to weighted networks. However, it is known that transforming weighted into unweighted networks by dichotomizing the edges of weighted networks with a threshold generally leads to information loss. We have developed a novel, tensor-based computational framework for mining recurrent heavy subgraphs in a large set of massive weighted networks. Specifically, we formulate the recurrent heavy subgraph identification problem as a heavy 3D subtensor discovery problem with sparse constraints. We describe an effective approach to solving this problem by designing a multi-stage, convex relaxation protocol, and a non-uniform edge sampling technique. We applied our method to 130 co-expression networks, and identified 11,394 recurrent heavy subgraphs, grouped into 2,810 families. We demonstrated that the identified subgraphs represent meaningful biological modules by validating against a large set of compiled biological knowledge bases. We also showed that the likelihood for a heavy subgraph to be meaningful increases significantly with its recurrence in multiple networks, highlighting the importance of the integrative approach to biological network analysis. Moreover, our approach based on weighted graphs detects many patterns that would be overlooked using unweighted graphs. In addition, we identified a large number of modules that occur predominately under specific phenotypes. This analysis resulted in a genome-wide mapping of gene network modules onto the phenome. Finally, by comparing module activities across many datasets, we discovered high-order dynamic cooperativeness in protein complex networks and transcriptional regulatory networks. PMID:21698123

Hybrid stochastic simplifications for multiscale gene networks.

PubMed

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-09-07

Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.

Controllability of flow-conservation networks

NASA Astrophysics Data System (ADS)

Zhao, Chen; Zeng, An; Jiang, Rui; Yuan, Zhengzhong; Wang, Wen-Xu

2017-07-01

The ultimate goal of exploring complex networks is to control them. As such, controllability of complex networks has been intensively investigated. Despite recent advances in studying the impact of a network's topology on its controllability, a comprehensive understanding of the synergistic impact of network topology and dynamics on controllability is still lacking. Here, we explore the controllability of flow-conservation networks, trying to identify the minimal number of driver nodes that can guide the network to any desirable state. We develop a method to analyze the controllability on flow-conservation networks based on exact controllability theory, transforming the original analysis on adjacency matrix to Laplacian matrix. With this framework, we systematically investigate the impact of some key factors of networks, including link density, link directionality, and link polarity, on the controllability of these networks. We also obtain the analytical equations by investigating the network's structural properties approximatively and design the efficient tools. Finally, we consider some real networks with flow dynamics, finding that their controllability is significantly different from that predicted by only considering the topology. These findings deepen our understanding of network controllability with flow-conservation dynamics and provide a general framework to incorporate real dynamics in the analysis of network controllability.

Long-running telemedicine networks delivering humanitarian services: experience, performance and scientific output

PubMed Central

Geissbuhler, Antoine; Jethwani, Kamal; Kovarik, Carrie; Person, Donald A; Vladzymyrskyy, Anton; Zanaboni, Paolo; Zolfo, Maria

2012-01-01

Abstract Objective To summarize the experience, performance and scientific output of long-running telemedicine networks delivering humanitarian services. Methods Nine long-running networks – those operating for five years or more– were identified and seven provided detailed information about their activities, including performance and scientific output. Information was extracted from peer-reviewed papers describing the networks’ study design, effectiveness, quality, economics, provision of access to care and sustainability. The strength of the evidence was scored as none, poor, average or good. Findings The seven networks had been operating for a median of 11 years (range: 5–15). All networks provided clinical tele-consultations for humanitarian purposes using store-and-forward methods and five were also involved in some form of education. The smallest network had 15 experts and the largest had more than 500. The clinical caseload was 50 to 500 cases a year. A total of 59 papers had been published by the networks, and 44 were listed in Medline. Based on study design, the strength of the evidence was generally poor by conventional standards (e.g. 29 papers described non-controlled clinical series). Over half of the papers provided evidence of sustainability and improved access to care. Uncertain funding was a common risk factor. Conclusion Improved collaboration between networks could help attenuate the lack of resources reported by some networks and improve sustainability. Although the evidence base is weak, the networks appear to offer sustainable and clinically useful services. These findings may interest decision-makers in developing countries considering starting, supporting or joining similar telemedicine networks. PMID:22589567

Periodic synchronization control of discontinuous delayed networks by using extended Filippov-framework.

PubMed

Cai, Zuowei; Huang, Lihong; Guo, Zhenyuan; Zhang, Lingling; Wan, Xuting

2015-08-01

This paper is concerned with the periodic synchronization problem for a general class of delayed neural networks (DNNs) with discontinuous neuron activation. One of the purposes is to analyze the problem of periodic orbits. To do so, we introduce new tools including inequality techniques and Kakutani's fixed point theorem of set-valued maps to derive the existence of periodic solution. Another purpose is to design a switching state-feedback control for realizing global exponential synchronization of the drive-response network system with periodic coefficients. Unlike the previous works on periodic synchronization of neural network, both the neuron activations and controllers in this paper are allowed to be discontinuous. Moreover, owing to the occurrence of delays in neuron signal, the neural network model is described by the functional differential equation. So we introduce extended Filippov-framework to deal with the basic issues of solutions for discontinuous DNNs. Finally, two examples and simulation experiments are given to illustrate the proposed method and main results which have an important instructional significance in the design of periodic synchronized DNNs circuits involving discontinuous or switching factors. Copyright © 2015 Elsevier Ltd. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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

1998-10-01

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

Theoretical approaches of online social network interventions and implications for behavioral change: a systematic review.

PubMed

Arguel, Amaël; Perez-Concha, Oscar; Li, Simon Y W; Lau, Annie Y S

2018-02-01

The aim of this review was to identify general theoretical frameworks used in online social network interventions for behavioral change. To address this research question, a PRISMA-compliant systematic review was conducted. A systematic review (PROSPERO registration number CRD42014007555) was conducted using 3 electronic databases (PsycINFO, Pubmed, and Embase). Four reviewers screened 1788 abstracts. 15 studies were selected according to the eligibility criteria. Randomized controlled trials and controlled studies were assessed using Cochrane Collaboration's "risk-of-bias" tool, and narrative synthesis. Five eligible articles used the social cognitive theory as a framework to develop interventions targeting behavioral change. Other theoretical frameworks were related to the dynamics of social networks, intention models, and community engagement theories. Only one of the studies selected in the review mentioned a well-known theory from the field of health psychology. Conclusions were that guidelines are lacking in the design of online social network interventions for behavioral change. Existing theories and models from health psychology that are traditionally used for in situ behavioral change should be considered when designing online social network interventions in a health care setting. © 2016 John Wiley & Sons, Ltd.

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

NASA Technical Reports Server (NTRS)

Rahmani, Amirreza; Mesbahi, Mehran; Fathpour, Nanaz; Hadaegh, Fred Y.

2008-01-01

In this work, we develop an approach to formation estimation by explicitly characterizing formation's system-theoretic attributes in terms of the underlying inter-spacecraft information-exchange network. In particular, we approach the formation observer/estimator design by relaxing the accessibility to the global state information by a centralized observer/estimator- and in turn- providing an analysis and synthesis framework for formation observers/estimators that rely on local measurements. The noveltyof our approach hinges upon the explicit examination of the underlying distributed spacecraft network in the realm of guidance, navigation, and control algorithmic analysis and design. The overarching goal of our general research program, some of whose results are reported in this paper, is the development of distributed spacecraft estimation algorithms that are scalable, modular, and robust to variations inthe topology and link characteristics of the formation information exchange network. In this work, we consider the observability of a spacecraft formation from a single observation node and utilize the agreement protocol as a mechanism for observing formation states from local measurements. Specifically, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the observability of the corresponding multi-agent system The ramification of this notion of observability over networks is then explored in the context of distributed formation estimation.

Multisource Transfer Learning With Convolutional Neural Networks for Lung Pattern Analysis.

PubMed

Christodoulidis, Stergios; Anthimopoulos, Marios; Ebner, Lukas; Christe, Andreas; Mougiakakou, Stavroula

2017-01-01

Early diagnosis of interstitial lung diseases is crucial for their treatment, but even experienced physicians find it difficult, as their clinical manifestations are similar. In order to assist with the diagnosis, computer-aided diagnosis systems have been developed. These commonly rely on a fixed scale classifier that scans CT images, recognizes textural lung patterns, and generates a map of pathologies. In a previous study, we proposed a method for classifying lung tissue patterns using a deep convolutional neural network (CNN), with an architecture designed for the specific problem. In this study, we present an improved method for training the proposed network by transferring knowledge from the similar domain of general texture classification. Six publicly available texture databases are used to pretrain networks with the proposed architecture, which are then fine-tuned on the lung tissue data. The resulting CNNs are combined in an ensemble and their fused knowledge is compressed back to a network with the original architecture. The proposed approach resulted in an absolute increase of about 2% in the performance of the proposed CNN. The results demonstrate the potential of transfer learning in the field of medical image analysis, indicate the textural nature of the problem and show that the method used for training a network can be as important as designing its architecture.

Spiking, Bursting, and Population Dynamics in a Network of Growth Transform Neurons.

PubMed

Gangopadhyay, Ahana; Chakrabartty, Shantanu

2018-06-01

This paper investigates the dynamical properties of a network of neurons, each of which implements an asynchronous mapping based on polynomial growth transforms. In the first part of this paper, we present a geometric approach for visualizing the dynamics of the network where each of the neurons traverses a trajectory in a dual optimization space, whereas the network itself traverses a trajectory in an equivalent primal optimization space. We show that as the network learns to solve basic classification tasks, different choices of primal-dual mapping produce unique but interpretable neural dynamics like noise shaping, spiking, and bursting. While the proposed framework is general enough, in this paper, we demonstrate its use for designing support vector machines (SVMs) that exhibit noise-shaping properties similar to those of modulators, and for designing SVMs that learn to encode information using spikes and bursts. It is demonstrated that the emergent switching, spiking, and burst dynamics produced by each neuron encodes its respective margin of separation from a classification hyperplane whose parameters are encoded by the network population dynamics. We believe that the proposed growth transform neuron model and the underlying geometric framework could serve as an important tool to connect well-established machine learning algorithms like SVMs to neuromorphic principles like spiking, bursting, population encoding, and noise shaping.

Neurocontrol and fuzzy logic: Connections and designs

NASA Technical Reports Server (NTRS)

Werbos, Paul J.

1991-01-01

Artificial neural networks (ANNs) and fuzzy logic are complementary technologies. ANNs extract information from systems to be learned or controlled, while fuzzy techniques mainly use verbal information from experts. Ideally, both sources of information should be combined. For example, one can learn rules in a hybrid fashion, and then calibrate them for better whole-system performance. ANNs offer universal approximation theorems, pedagogical advantages, very high-throughput hardware, and links to neurophysiology. Neurocontrol - the use of ANNs to directly control motors or actuators, etc. - uses five generalized designs, related to control theory, which can work on fuzzy logic systems as well as ANNs. These designs can copy what experts do instead of what they say, learn to track trajectories, generalize adaptive control, and maximize performance or minimize cost over time, even in noisy environments. Design tradeoffs and future directions are discussed throughout.

Architectural and Functional Design of an Environmental Information Network.

DTIC Science & Technology

1984-04-30

study was accomplished under contract F08635-83-C-013(,, Task 83- 2 for Headquarters Air Force Engineering and Services Center, Engineering and Services...election Procedure ............................... 11 2 General Architecture of Distributed Data Management System...o.......60 A-1 Schema Architecture .......... o-.................. .... 74 A- 2 MULTIBASE Component Architecture

47 CFR 25.272 - General inter-system coordination procedures.

Code of Federal Regulations, 2010 CFR

2010-10-01

... the system control center, and those responsible for long term engineering and technical design issues... network control center which will have the responsibility to monitor space-to-Earth transmissions in its... the licensee is authorized to transmit, contact telephone numbers for the control center of the earth...

47 CFR 36.311 - Network Support/General Support Expenses-Accounts 6110 and 6120 (Class B Telephone Companies...

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 2 2011-10-01 2011-10-01 false Network Support/General Support Expenses... Operating Expenses and Taxes Network Support/general Support Expenses § 36.311 Network Support/General..., 6122, 6123, and 6124 (Class A Telephone Companies). (a) Network Support Expenses are expenses...

47 CFR 36.311 - Network Support/General Support Expenses-Accounts 6110 and 6120 (Class B Telephone Companies...

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 2 2010-10-01 2010-10-01 false Network Support/General Support Expenses... Operating Expenses and Taxes Network Support/general Support Expenses § 36.311 Network Support/General..., 6122, 6123, and 6124 (Class A Telephone Companies). (a) Network Support Expenses are expenses...

An adaptive drug delivery design using neural networks for effective treatment of infectious diseases: a simulation study.

PubMed

Padhi, Radhakant; Bhardhwaj, Jayender R

2009-06-01

An adaptive drug delivery design is presented in this paper using neural networks for effective treatment of infectious diseases. The generic mathematical model used describes the coupled evolution of concentration of pathogens, plasma cells, antibodies and a numerical value that indicates the relative characteristic of a damaged organ due to the disease under the influence of external drugs. From a system theoretic point of view, the external drugs can be interpreted as control inputs, which can be designed based on control theoretic concepts. In this study, assuming a set of nominal parameters in the mathematical model, first a nonlinear controller (drug administration) is designed based on the principle of dynamic inversion. This nominal drug administration plan was found to be effective in curing "nominal model patients" (patients whose immunological dynamics conform to the mathematical model used for the control design exactly. However, it was found to be ineffective in curing "realistic model patients" (patients whose immunological dynamics may have off-nominal parameter values and possibly unwanted inputs) in general. Hence, to make the drug delivery dosage design more effective for realistic model patients, a model-following adaptive control design is carried out next by taking the help of neural networks, that are trained online. Simulation studies indicate that the adaptive controller proposed in this paper holds promise in killing the invading pathogens and healing the damaged organ even in the presence of parameter uncertainties and continued pathogen attack. Note that the computational requirements for computing the control are very minimal and all associated computations (including the training of neural networks) can be carried out online. However it assumes that the required diagnosis process can be carried out at a sufficient faster rate so that all the states are available for control computation.

Interaction Control to Synchronize Non-synchronizable Networks

PubMed Central

Schröder, Malte; Chakraborty, Sagar; Witthaut, Dirk; Nagler, Jan; Timme, Marc

2016-01-01

Synchronization constitutes one of the most fundamental collective dynamics across networked systems and often underlies their function. Whether a system may synchronize depends on the internal unit dynamics as well as the topology and strength of their interactions. For chaotic units with certain interaction topologies synchronization might be impossible across all interaction strengths, meaning that these networks are non-synchronizable. Here we propose the concept of interaction control, generalizing transient uncoupling, to induce desired collective dynamics in complex networks and apply it to synchronize even such non-synchronizable systems. After highlighting that non-synchronizability prevails for a wide range of networks of arbitrary size, we explain how a simple binary control may localize interactions in state space and thereby synchronize networks. Intriguingly, localizing interactions by a fixed control scheme enables stable synchronization across all connected networks regardless of topological constraints. Interaction control may thus ease the design of desired collective dynamics even without knowledge of the networks’ exact interaction topology and consequently have implications for biological and self-organizing technical systems. PMID:27853266

Artificial Neural Networks as an Architectural Design Tool-Generating New Detail Forms Based On the Roman Corinthian Order Capital

NASA Astrophysics Data System (ADS)

Radziszewski, Kacper

2017-10-01

The following paper presents the results of the research in the field of the machine learning, investigating the scope of application of the artificial neural networks algorithms as a tool in architectural design. The computational experiment was held using the backward propagation of errors method of training the artificial neural network, which was trained based on the geometry of the details of the Roman Corinthian order capital. During the experiment, as an input training data set, five local geometry parameters combined has given the best results: Theta, Pi, Rho in spherical coordinate system based on the capital volume centroid, followed by Z value of the Cartesian coordinate system and a distance from vertical planes created based on the capital symmetry. Additionally during the experiment, artificial neural network hidden layers optimal count and structure was found, giving results of the error below 0.2% for the mentioned before input parameters. Once successfully trained artificial network, was able to mimic the details composition on any other geometry type given. Despite of calculating the transformed geometry locally and separately for each of the thousands of surface points, system could create visually attractive and diverse, complex patterns. Designed tool, based on the supervised learning method of machine learning, gives possibility of generating new architectural forms- free of the designer’s imagination bounds. Implementing the infinitely broad computational methods of machine learning, or Artificial Intelligence in general, not only could accelerate and simplify the design process, but give an opportunity to explore never seen before, unpredictable forms or everyday architectural practice solutions.

Engaging participants in a complex intervention trial in Australian General Practice

PubMed Central

Perkins, David; Harris, Mark F; Tan, Jocelyn; Christl, Bettina; Taggart, Jane; Fanaian, Mahnaz

2008-01-01

Background The paper examines the key issues experienced in recruiting and retaining practice involvement in a large complex intervention trial in Australian General Practice. Methods Reflective notes made by research staff and telephone interviews with staff from general practices which expressed interest, took part or withdrew from a trial of a complex general practice intervention. Results Recruitment and retention difficulties were due to factors inherent in the demands and context of general practice, the degree of engagement of primary care organisations (Divisions of General Practice), perceived benefits by practices, the design of the trial and the timing and complexity of data collection. Conclusion There needs to be clearer articulation to practices of the benefits of the research to participants and streamlining of the design and processes of data collection and intervention to fit in with their work practices. Ultimately deeper engagement may require additional funding and ongoing participation through practice research networks. Trial Registration Current Controlled Trials ACTRN12605000788673 PMID:18700984

Regular Topologies for Gigabit Wide-Area Networks. Volume 1

NASA Technical Reports Server (NTRS)

Shacham, Nachum; Denny, Barbara A.; Lee, Diane S.; Khan, Irfan H.; Lee, Danny Y. C.; McKenney, Paul

1994-01-01

In general terms, this project aimed at the analysis and design of techniques for very high-speed networking. The formal objectives of the project were to: (1) Identify switch and network technologies for wide-area networks that interconnect a large number of users and can provide individual data paths at gigabit/s rates; (2) Quantitatively evaluate and compare existing and proposed architectures and protocols, identify their strength and growth potentials, and ascertain the compatibility of competing technologies; and (3) Propose new approaches to existing architectures and protocols, and identify opportunities for research to overcome deficiencies and enhance performance. The project was organized into two parts: 1. The design, analysis, and specification of techniques and protocols for very-high-speed network environments. In this part, SRI has focused on several key high-speed networking areas, including Forward Error Control (FEC) for high-speed networks in which data distortion is the result of packet loss, and the distribution of broadband, real-time traffic in multiple user sessions. 2. Congestion Avoidance Testbed Experiment (CATE). This part of the project was done within the framework of the DARTnet experimental T1 national network. The aim of the work was to advance the state of the art in benchmarking DARTnet's performance and traffic control by developing support tools for network experimentation, by designing benchmarks that allow various algorithms to be meaningfully compared, and by investigating new queueing techniques that better satisfy the needs of best-effort and reserved-resource traffic. This document is the final technical report describing the results obtained by SRI under this project. The report consists of three volumes: Volume 1 contains a technical description of the network techniques developed by SRI in the areas of FEC and multicast of real-time traffic. Volume 2 describes the work performed under CATE. Volume 3 contains the source code of all software developed under CATE.

Sci-Thur AM: YIS – 05: Prediction of lung tumor motion using a generalized neural network optimized from the average prediction outcome of a group of patients

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

Teo, Troy; Alayoubi, Nadia; Bruce, Neil

Purpose: In image-guided adaptive radiotherapy systems, prediction of tumor motion is required to compensate for system latencies. However, due to the non-stationary nature of respiration, it is a challenge to predict the associated tumor motions. In this work, a systematic design of the neural network (NN) using a mixture of online data acquired during the initial period of the tumor trajectory, coupled with a generalized model optimized using a group of patient data (obtained offline) is presented. Methods: The average error surface obtained from seven patients was used to determine the input data size and number of hidden neurons formore » the generalized NN. To reduce training time, instead of using random weights to initialize learning (method 1), weights inherited from previous training batches (method 2) were used to predict tumor position for each sliding window. Results: The generalized network was established with 35 input data (∼4.66s) and 20 hidden nodes. For a prediction horizon of 650 ms, mean absolute errors of 0.73 mm and 0.59 mm were obtained for method 1 and 2 respectively. An average initial learning period of 8.82 s is obtained. Conclusions: A network with a relatively short initial learning time was achieved. Its accuracy is comparable to previous studies. This network could be used as a plug-and play predictor in which (a) tumor positions can be predicted as soon as treatment begins and (b) the need for pretreatment data and optimization for individual patients can be avoided.« less

Campaign-level dynamic network modelling for spaceflight logistics for the flexible path concept

NASA Astrophysics Data System (ADS)

Ho, Koki; de Weck, Olivier L.; Hoffman, Jeffrey A.; Shishko, Robert

2016-06-01

This paper develops a network optimization formulation for dynamic campaign-level space mission planning. Although many past space missions have been designed mainly from a mission-level perspective, a campaign-level perspective will be important for future space exploration. In order to find the optimal campaign-level space transportation architecture, a mixed-integer linear programming (MILP) formulation with a generalized multi-commodity flow and a time-expanded network is developed. Particularly, a new heuristics-based method, a partially static time-expanded network, is developed to provide a solution quickly. The developed method is applied to a case study containing human exploration of a near-Earth object (NEO) and Mars, related to the concept of the Flexible Path. The numerical results show that using the specific combinations of propulsion technologies, in-situ resource utilization (ISRU), and other space infrastructure elements can reduce the initial mass in low-Earth orbit (IMLEO) significantly. In addition, the case study results also show that we can achieve large IMLEO reduction by designing NEO and Mars missions together as a campaign compared with designing them separately owing to their common space infrastructure pre-deployment. This research will be an important step toward efficient and flexible campaign-level space mission planning.

Smooth function approximation using neural networks.

PubMed

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Research on NGN network control technology

NASA Astrophysics Data System (ADS)

Li, WenYao; Zhou, Fang; Wu, JianXue; Li, ZhiGuang

2004-04-01

Nowadays NGN (Next Generation Network) is the hotspot for discussion and research in IT section. The NGN core technology is the network control technology. The key goal of NGN is to realize the network convergence and evolution. Referring to overlay network model core on Softswitch technology, circuit switch network and IP network convergence realized. Referring to the optical transmission network core on ASTN/ASON, service layer (i.e. IP layer) and optical transmission convergence realized. Together with the distributing feature of NGN network control technology, on NGN platform, overview of combining Softswitch and ASTN/ASON control technology, the solution whether IP should be the NGN core carrier platform attracts general attention, and this is also a QoS problem on NGN end to end. This solution produces the significant practical meaning on equipment development, network deployment, network design and optimization, especially on realizing present network smooth evolving to the NGN. This is why this paper puts forward the research topic on the NGN network control technology. This paper introduces basics on NGN network control technology, then proposes NGN network control reference model, at the same time describes a realizable network structure of NGN. Based on above, from the view of function realization, NGN network control technology is discussed and its work mechanism is analyzed.

Reliable and Fault-Tolerant Software-Defined Network Operations Scheme for Remote 3D Printing

NASA Astrophysics Data System (ADS)

Kim, Dongkyun; Gil, Joon-Min

2015-03-01

The recent wide expansion of applicable three-dimensional (3D) printing and software-defined networking (SDN) technologies has led to a great deal of attention being focused on efficient remote control of manufacturing processes. SDN is a renowned paradigm for network softwarization, which has helped facilitate remote manufacturing in association with high network performance, since SDN is designed to control network paths and traffic flows, guaranteeing improved quality of services by obtaining network requests from end-applications on demand through the separated SDN controller or control plane. However, current SDN approaches are generally focused on the controls and automation of the networks, which indicates that there is a lack of management plane development designed for a reliable and fault-tolerant SDN environment. Therefore, in addition to the inherent advantage of SDN, this paper proposes a new software-defined network operations center (SD-NOC) architecture to strengthen the reliability and fault-tolerance of SDN in terms of network operations and management in particular. The cooperation and orchestration between SDN and SD-NOC are also introduced for the SDN failover processes based on four principal SDN breakdown scenarios derived from the failures of the controller, SDN nodes, and connected links. The abovementioned SDN troubles significantly reduce the network reachability to remote devices (e.g., 3D printers, super high-definition cameras, etc.) and the reliability of relevant control processes. Our performance consideration and analysis results show that the proposed scheme can shrink operations and management overheads of SDN, which leads to the enhancement of responsiveness and reliability of SDN for remote 3D printing and control processes.

Toward a phenology network in Turkey

NASA Astrophysics Data System (ADS)

Dalfes, H. N.; Ülgen, H.; Zeydanli, U.; Durak, A. T.

2012-04-01

All climate projections indicate that drastic changes are to occur in the Mediterranean Basin and Southwestern Asia. Detailed studies also foresee strong patterns of change in seasonality for most climate fields all across the country, threatening Turkey's rich biodiversity and diverse ecosystems already in trouble due to massive land use changes and careless resource extraction projects. It is therefore obvious that climate impact studies can benefit from detailed and continuous monitoring of relationships between climate and natural systems. Recently started efforts to build a phenology network for Turkey will hopefully constitute a component of a more comprehensive ecological observation infrastructure. The Phenology Network of Turkey Project saw its debut as a joint initiative of an academic institution (Istanbul Technical University) and a research NGO (Nature Conservation Center). It has been decided from the very beginning to rely a much as possible on Internet technologies (provided by the National High Performance Computing Center of Turkey). The effort is also inspired by and collaborates with already established networks in general and USA National Phenology Network in particular. Many protocols, instructional materials and Nature's Notebook application has been barrowed from the USA NPN. The project has been designed from the start as a two-faceted effort: an infrastructure to accumulate/provide useful data to climate/ecosystem research communities and a 'citizen science' project to raise nature and climate change awareness among all components of the society in Turkey in general and secondary education teachers and students in particular. It has been opted to start by gathering plant phenological data. A set with 20 plant species has been designed to serve as a countrywide 'calibration set'. It is also anticipated to salvage and extend as much of possible historical animal (especially bird and butterfly) observations.

A Facile and General Approach to Recoverable High-Strain Multishape Shape Memory Polymers.

PubMed

Li, Xingjian; Pan, Yi; Zheng, Zhaohui; Ding, Xiaobin

2018-03-01

Fabricating a single polymer network with no need to design complex structures to achieve an ideal combination of tunable high-strain multiple-shape memory effects and highly recoverable shape memory property is a great challenge for the real applications of advanced shape memory devices. Here, a facile and general approach to recoverable high-strain multishape shape memory polymers is presented via a random copolymerization of acrylate monomers and a chain-extended multiblock copolymer crosslinker. As-prepared shape memory networks show a large width at the half-peak height of the glass transition, far wider than current classical multishape shape memory polymers. A combination of tunable high-strain multishape memory effect and as high as 1000% recoverable strain in a single chemical-crosslinking network can be obtained. To the best of our knowledge, this is the first thermosetting material with a combination of highly recoverable strain and tunable high-strain multiple-shape memory effects. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

NASA Helps Design the 'Cockpit of the Future'

NASA Technical Reports Server (NTRS)

2006-01-01

One of the initiatives at Langley involved the research and development of a Small Aircraft Transportation System Network (SATS-Net), which was the communications infrastructure for NASA s SATS program.The primary goal of SATS-Net was to develop secure virtual travel portals for the Nation s general aviation airports and to offer an alternative to commercial air and ground transportation through general aviation. The secondary goals were to increase mobility, reduce door-to- door travel times, and provide air transportation to underserved markets at an affordable cost. One of the specific plans was to create a network of information about the 2,000-plus non-tower, non-radar airports in the Nation. This information would be accessible from a person s home, office, PDA, or local airport. This network provides real-time information and would be a "one-stop shop" portal with dynamic access to real-time Web cameras for weather conditions, flight planning information, local lodging, restaurants, and attraction information. SATS-Net would provide membership services much like that of AAA.

All Source Sensor Analysis

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

- PNNL, Harold Trease

2012-10-10

ASSA is a software application that processes binary data into summarized index tables that can be used to organize features contained within the data. ASSA's index tables can also be used to search for user specified features. ASSA is designed to organize and search for patterns in unstructured binary data streams or archives, such as video, images, audio, and network traffic. ASSA is basically a very general search engine used to search for any pattern in any binary data stream. It has uses in video analytics, image analysis, audio analysis, searching hard-drives, monitoring network traffic, etc.

Large-Scale, Three–Dimensional, Free–Standing, and Mesoporous Metal Oxide Networks for High–Performance Photocatalysis

PubMed Central

Bai, Hua; Li, Xinshi; Hu, Chao; Zhang, Xuan; Li, Junfang; Yan, Yan; Xi, Guangcheng

2013-01-01

Mesoporous nanostructures represent a unique class of photocatalysts with many applications, including splitting of water, degradation of organic contaminants, and reduction of carbon dioxide. In this work, we report a general Lewis acid catalytic template route for the high–yield producing single– and multi–component large–scale three–dimensional (3D) mesoporous metal oxide networks. The large-scale 3D mesoporous metal oxide networks possess large macroscopic scale (millimeter–sized) and mesoporous nanostructure with huge pore volume and large surface exposure area. This method also can be used for the synthesis of large–scale 3D macro/mesoporous hierarchical porous materials and noble metal nanoparticles loaded 3D mesoporous networks. Photocatalytic degradation of Azo dyes demonstrated that the large–scale 3D mesoporous metal oxide networks enable high photocatalytic activity. The present synthetic method can serve as the new design concept for functional 3D mesoporous nanomaterials. PMID:23857595

Optimization of the kernel functions in a probabilistic neural network analyzing the local pattern distribution.

PubMed

Galleske, I; Castellanos, J

2002-05-01

This article proposes a procedure for the automatic determination of the elements of the covariance matrix of the gaussian kernel function of probabilistic neural networks. Two matrices, a rotation matrix and a matrix of variances, can be calculated by analyzing the local environment of each training pattern. The combination of them will form the covariance matrix of each training pattern. This automation has two advantages: First, it will free the neural network designer from indicating the complete covariance matrix, and second, it will result in a network with better generalization ability than the original model. A variation of the famous two-spiral problem and real-world examples from the UCI Machine Learning Repository will show a classification rate not only better than the original probabilistic neural network but also that this model can outperform other well-known classification techniques.

Finite-time mixed outer synchronization of complex networks with coupling time-varying delay.

PubMed

He, Ping; Ma, Shu-Hua; Fan, Tao

2012-12-01

This article is concerned with the problem of finite-time mixed outer synchronization (FMOS) of complex networks with coupling time-varying delay. FMOS is a recently developed generalized synchronization concept, i.e., in which different state variables of the corresponding nodes can evolve into finite-time complete synchronization, finite-time anti-synchronization, and even amplitude finite-time death simultaneously for an appropriate choice of the controller gain matrix. Some novel stability criteria for the synchronization between drive and response complex networks with coupling time-varying delay are derived using the Lyapunov stability theory and linear matrix inequalities. And a simple linear state feedback synchronization controller is designed as a result. Numerical simulations for two coupled networks of modified Chua's circuits are then provided to demonstrate the effectiveness and feasibility of the proposed complex networks control and synchronization schemes and then compared with the proposed results and the previous schemes for accuracy.

The topological requirements for robust perfect adaptation in networks of any size.

PubMed

Araujo, Robyn P; Liotta, Lance A

2018-05-01

Robustness, and the ability to function and thrive amid changing and unfavorable environments, is a fundamental requirement for living systems. Until now it has been an open question how large and complex biological networks can exhibit robust behaviors, such as perfect adaptation to a variable stimulus, since complexity is generally associated with fragility. Here we report that all networks that exhibit robust perfect adaptation (RPA) to a persistent change in stimulus are decomposable into well-defined modules, of which there exist two distinct classes. These two modular classes represent a topological basis for all RPA-capable networks, and generate the full set of topological realizations of the internal model principle for RPA in complex, self-organizing, evolvable bionetworks. This unexpected result supports the notion that evolutionary processes are empowered by simple and scalable modular design principles that promote robust performance no matter how large or complex the underlying networks become.

Comparing social factors affecting recommender decisions in online and educational social network

NASA Astrophysics Data System (ADS)

MartÍn, Estefanía; Hernán-Losada, Isidoro; Haya, Pablo A.

2016-01-01

In the educational context, there is an increasing interest in learning networks. Recommender systems (RSs) can play an important role in achieving educational objectives. Although we can find many papers focused on recommendation techniques and algorithms, in general, less attention has been dedicated to social factors that influence the recommendation process. This process could be improved if we had a deeper understanding of the social factors that influence the quality or validity of a suggestion made by the RS. This work elucidates and analyses the social factors that influence the design and decision-making process of RSs. We conducted a survey in which 126 undergraduate students were asked to extract which are the main factors for improving suggestions when they are interacting with an Online Social Network (OSN) or in an Educational Social Network (ESN). The results show that different factors have to be considered depending on the type of network.

Energy-saving scheme based on downstream packet scheduling in ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Zhang, Lincong; Liu, Yejun; Guo, Lei; Gong, Xiaoxue

2013-03-01

With increasing network sizes, the energy consumption of Passive Optical Networks (PONs) has grown significantly. Therefore, it is important to design effective energy-saving schemes in PONs. Generally, energy-saving schemes have focused on sleeping the low-loaded Optical Network Units (ONUs), which tends to bring large packet delays. Further, the traditional ONU sleep modes are not capable of sleeping the transmitter and receiver independently, though they are not required to transmit or receive packets. Clearly, this approach contributes to wasted energy. Thus, in this paper, we propose an Energy-Saving scheme that is based on downstream Packet Scheduling (ESPS) in Ethernet PON (EPON). First, we design both an algorithm and a rule for downstream packet scheduling at the inter- and intra-ONU levels, respectively, to reduce the downstream packet delay. After that, we propose a hybrid sleep mode that contains not only ONU deep sleep mode but also independent sleep modes for the transmitter and the receiver. This ensures that the energy consumed by the ONUs is minimal. To realize the hybrid sleep mode, a modified GATE control message is designed that involves 10 time points for sleep processes. In ESPS, the 10 time points are calculated according to the allocated bandwidths in both the upstream and the downstream. The simulation results show that ESPS outperforms traditional Upstream Centric Scheduling (UCS) scheme in terms of energy consumption and the average delay for both real-time and non-real-time packets downstream. The simulation results also show that the average energy consumption of each ONU in larger-sized networks is less than that in smaller-sized networks; hence, our ESPS is better suited for larger-sized networks.

NET: a new framework for the vectorization and examination of network data.

PubMed

Lasser, Jana; Katifori, Eleni

2017-01-01

The analysis of complex networks both in general and in particular as pertaining to real biological systems has been the focus of intense scientific attention in the past and present. In this paper we introduce two tools that provide fast and efficient means for the processing and quantification of biological networks like Drosophila tracheoles or leaf venation patterns: the Network Extraction Tool ( NET ) to extract data and the Graph-edit-GUI ( GeGUI ) to visualize and modify networks. NET is especially designed for high-throughput semi-automated analysis of biological datasets containing digital images of networks. The framework starts with the segmentation of the image and then proceeds to vectorization using methodologies from optical character recognition. After a series of steps to clean and improve the quality of the extracted data the framework produces a graph in which the network is represented only by its nodes and neighborhood-relations. The final output contains information about the adjacency matrix of the graph, the width of the edges and the positions of the nodes in space. NET also provides tools for statistical analysis of the network properties, such as the number of nodes or total network length. Other, more complex metrics can be calculated by importing the vectorized network to specialized network analysis packages. GeGUI is designed to facilitate manual correction of non-planar networks as these may contain artifacts or spurious junctions due to branches crossing each other. It is tailored for but not limited to the processing of networks from microscopy images of Drosophila tracheoles. The networks extracted by NET closely approximate the network depicted in the original image. NET is fast, yields reproducible results and is able to capture the full geometry of the network, including curved branches. Additionally GeGUI allows easy handling and visualization of the networks.

Network-driven design principles for neuromorphic systems.

PubMed

Partzsch, Johannes; Schüffny, Rene

2015-01-01

Synaptic connectivity is typically the most resource-demanding part of neuromorphic systems. Commonly, the architecture of these systems is chosen mainly on technical considerations. As a consequence, the potential for optimization arising from the inherent constraints of connectivity models is left unused. In this article, we develop an alternative, network-driven approach to neuromorphic architecture design. We describe methods to analyse performance of existing neuromorphic architectures in emulating certain connectivity models. Furthermore, we show step-by-step how to derive a neuromorphic architecture from a given connectivity model. For this, we introduce a generalized description for architectures with a synapse matrix, which takes into account shared use of circuit components for reducing total silicon area. Architectures designed with this approach are fitted to a connectivity model, essentially adapting to its connection density. They are guaranteeing faithful reproduction of the model on chip, while requiring less total silicon area. In total, our methods allow designers to implement more area-efficient neuromorphic systems and verify usability of the connectivity resources in these systems.

Network-driven design principles for neuromorphic systems

PubMed Central

Partzsch, Johannes; Schüffny, Rene

2015-01-01

Synaptic connectivity is typically the most resource-demanding part of neuromorphic systems. Commonly, the architecture of these systems is chosen mainly on technical considerations. As a consequence, the potential for optimization arising from the inherent constraints of connectivity models is left unused. In this article, we develop an alternative, network-driven approach to neuromorphic architecture design. We describe methods to analyse performance of existing neuromorphic architectures in emulating certain connectivity models. Furthermore, we show step-by-step how to derive a neuromorphic architecture from a given connectivity model. For this, we introduce a generalized description for architectures with a synapse matrix, which takes into account shared use of circuit components for reducing total silicon area. Architectures designed with this approach are fitted to a connectivity model, essentially adapting to its connection density. They are guaranteeing faithful reproduction of the model on chip, while requiring less total silicon area. In total, our methods allow designers to implement more area-efficient neuromorphic systems and verify usability of the connectivity resources in these systems. PMID:26539079

Local Higher-Order Graph Clustering

PubMed Central

Yin, Hao; Benson, Austin R.; Leskovec, Jure; Gleich, David F.

2018-01-01

Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph. These methods are attractive because they enable targeted clustering around a given seed node and are faster than traditional global graph clustering methods because their runtime does not depend on the size of the input graph. However, current local graph partitioning methods are not designed to account for the higher-order structures crucial to the network, nor can they effectively handle directed networks. Here we introduce a new class of local graph clustering methods that address these issues by incorporating higher-order network information captured by small subgraphs, also called network motifs. We develop the Motif-based Approximate Personalized PageRank (MAPPR) algorithm that finds clusters containing a seed node with minimal motif conductance, a generalization of the conductance metric for network motifs. We generalize existing theory to prove the fast running time (independent of the size of the graph) and obtain theoretical guarantees on the cluster quality (in terms of motif conductance). We also develop a theory of node neighborhoods for finding sets that have small motif conductance, and apply these results to the case of finding good seed nodes to use as input to the MAPPR algorithm. Experimental validation on community detection tasks in both synthetic and real-world networks, shows that our new framework MAPPR outperforms the current edge-based personalized PageRank methodology. PMID:29770258

The influential role of personal advice networks on general practitioners' performance: a social capital perspective.

PubMed

Calciolari, Stefano; González-Ortiz, Laura G; Lega, Federico

2017-08-08

In several health systems of advanced countries, reforms have changed primary care in the last two decades. The literature has assessed the effects of a variety of interventions and individual factors on the behavior of general practitioners (GPs). However, there has been a lack of investigation concerning the influence of the resources embedded in the GPs' personal advice networks (i.e., social capital) on GPs' capacity to meet defined objectives. The present study has two goals: (a) to assess the GPs' personal advice networks according to the social capital framework and (b) to test the influence of such relationships on GPs' capacity to accomplish organizational goals. The data collection relied on administrative data provided by an Italian local health authority (LHA) and a survey administered to the GPs of the selected LHA. The GPs' personal advice networks were assessed through an ad-hoc instrument and interpreted as egocentric networks. Multivariate regression analyses assessed two different performance measures. Social capital may influence the GPs' capacity to meet targets, though the influence differs according to the objective considered. In particular, the higher the professional heterogeneity of a GP personal advice network, the lower her/his capacity is to meet targets of prescriptive appropriateness. Our findings might help to design more effective primary care reforms depending on the pursued goals. However, further research is needed.

Distributed Containment Control for Multiple Unknown Second-Order Nonlinear Systems With Application to Networked Lagrangian Systems.

PubMed

Mei, Jie; Ren, Wei; Li, Bing; Ma, Guangfu

2015-09-01

In this paper, we consider the distributed containment control problem for multiagent systems with unknown nonlinear dynamics. More specifically, we focus on multiple second-order nonlinear systems and networked Lagrangian systems. We first study the distributed containment control problem for multiple second-order nonlinear systems with multiple dynamic leaders in the presence of unknown nonlinearities and external disturbances under a general directed graph that characterizes the interaction among the leaders and the followers. A distributed adaptive control algorithm with an adaptive gain design based on the approximation capability of neural networks is proposed. We present a necessary and sufficient condition on the directed graph such that the containment error can be reduced as small as desired. As a byproduct, the leaderless consensus problem is solved with asymptotical convergence. Because relative velocity measurements between neighbors are generally more difficult to obtain than relative position measurements, we then propose a distributed containment control algorithm without using neighbors' velocity information. A two-step Lyapunov-based method is used to study the convergence of the closed-loop system. Next, we apply the ideas to deal with the containment control problem for networked unknown Lagrangian systems under a general directed graph. All the proposed algorithms are distributed and can be implemented using only local measurements in the absence of communication. Finally, simulation examples are provided to show the effectiveness of the proposed control algorithms.

A method of network topology optimization design considering application process characteristic

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Pioneering topological methods for network-based drug-target prediction by exploiting a brain-network self-organization theory.

PubMed

Durán, Claudio; Daminelli, Simone; Thomas, Josephine M; Haupt, V Joachim; Schroeder, Michael; Cannistraci, Carlo Vittorio

2017-04-26

The bipartite network representation of the drug-target interactions (DTIs) in a biosystem enhances understanding of the drugs' multifaceted action modes, suggests therapeutic switching for approved drugs and unveils possible side effects. As experimental testing of DTIs is costly and time-consuming, computational predictors are of great aid. Here, for the first time, state-of-the-art DTI supervised predictors custom-made in network biology were compared-using standard and innovative validation frameworks-with unsupervised pure topological-based models designed for general-purpose link prediction in bipartite networks. Surprisingly, our results show that the bipartite topology alone, if adequately exploited by means of the recently proposed local-community-paradigm (LCP) theory-initially detected in brain-network topological self-organization and afterwards generalized to any complex network-is able to suggest highly reliable predictions, with comparable performance with the state-of-the-art-supervised methods that exploit additional (non-topological, for instance biochemical) DTI knowledge. Furthermore, a detailed analysis of the novel predictions revealed that each class of methods prioritizes distinct true interactions; hence, combining methodologies based on diverse principles represents a promising strategy to improve drug-target discovery. To conclude, this study promotes the power of bio-inspired computing, demonstrating that simple unsupervised rules inspired by principles of topological self-organization and adaptiveness arising during learning in living intelligent systems (like the brain) can efficiently equal perform complicated algorithms based on advanced, supervised and knowledge-based engineering. © The Author 2017. Published by Oxford University Press.

Compliance Groundwater Monitoring of Nonpoint Sources - Emerging Approaches

NASA Astrophysics Data System (ADS)

Harter, T.

2008-12-01

Groundwater monitoring networks are typically designed for regulatory compliance of discharges from industrial sites. There, the quality of first encountered (shallow-most) groundwater is of key importance. Network design criteria have been developed for purposes of determining whether an actual or potential, permitted or incidental waste discharge has had or will have a degrading effect on groundwater quality. The fundamental underlying paradigm is that such discharge (if it occurs) will form a distinct contamination plume. Networks that guide (post-contamination) mitigation efforts are designed to capture the shape and dynamics of existing, finite-scale plumes. In general, these networks extend over areas less than one to ten hectare. In recent years, regulatory programs such as the EU Nitrate Directive and the U.S. Clean Water Act have forced regulatory agencies to also control groundwater contamination from non-incidental, recharging, non-point sources, particularly agricultural sources (fertilizer, pesticides, animal waste application, biosolids application). Sources and contamination from these sources can stretch over several tens, hundreds, or even thousands of square kilometers with no distinct plumes. A key question in implementing monitoring programs at the local, regional, and national level is, whether groundwater monitoring can be effectively used as a landowner compliance tool, as is currently done at point-source sites. We compare the efficiency of such traditional site-specific compliance networks in nonpoint source regulation with various designs of regional nonpoint source monitoring networks that could be used for compliance monitoring. We discuss advantages and disadvantages of the site vs. regional monitoring approaches with respect to effectively protecting groundwater resources impacted by nonpoint sources: Site-networks provide a tool to enforce compliance by an individual landowner. But the nonpoint source character of the contamination and its typically large spatial extend requires extensive networks at an individual site to accurately and fairly monitor individual compliance. In contrast, regional networks seemingly fail to hold individual landowners accountable. But regional networks can effectively monitor large-scale impacts and water quality trends; and thus inform regulatory programs that enforce management practices tied to nonpoint source pollution. Regional monitoring networks for compliance purposes can face significant challenges in the implementation due to a regulatory and legal landscape that is exclusively structured to address point sources and individual liability, and due to the non-intensive nature of a regional monitoring program (lack of control of hot spots; lack of accountability of individual landowners).

Hybrid stochastic simplifications for multiscale gene networks

PubMed Central

Crudu, Alina; Debussche, Arnaud; Radulescu, Ovidiu

2009-01-01

Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion [1-3] which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered) approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach. PMID:19735554

Identifying and Comparing Scandinavian Ethnography: Comparisons and Influences

ERIC Educational Resources Information Center

Beach, Dennis

2010-01-01

In recent years, there has been a significant growth in the volume of research production in education ethnography in Scandinavia due partly to a regionally financed network. The present article makes some comparisons between Scandinavian and other education research contexts in relation to aspects of general ethnographic design to try to analyse…

Graph Design via Convex Optimization: Online and Distributed Perspectives

NASA Astrophysics Data System (ADS)

Meng, De

Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation problems in sensor networks, multi-agent coordination. Distributed optimization aims to optimize a global objective function formed by summation of coupled local functions over a graph via only local communication and computation. We developed a weighted proximal ADMM for distributed optimization using graph structure. This fully distributed, single-loop algorithm allows simultaneous updates and can be viewed as a generalization of existing algorithms. More importantly, we achieve faster convergence by jointly designing graph weights and algorithm parameters. Finally, we propose a new problem on networks called Online Network Formation Problem: starting with a base graph and a set of candidate edges, at each round of the game, player one first chooses a candidate edge and reveals it to player two, then player two decides whether to accept it; player two can only accept limited number of edges and make online decisions with the goal to achieve the best properties of the synthesized network. The network properties considered include the number of spanning trees, algebraic connectivity and total effective resistance. These network formation games arise in a variety of cooperative multiagent systems. We propose a primal-dual algorithm framework for the general online network formation game, and analyze the algorithm performance by the competitive ratio and regret.

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks.

PubMed

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-22

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

PubMed Central

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-01-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability. PMID:27874024

Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

NASA Astrophysics Data System (ADS)

Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

2016-11-01

Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

Applying ecological criteria to marine reserve design: A case study from the California Channel Islands

USGS Publications Warehouse

Airame, S.; Dugan, J.E.; Lafferty, K.D.; Leslie, H.; McArdle, D.A.; Warner, R.R.

2003-01-01

Using ecological criteria as a theoretical framework, we describe the steps involved in designing a network of marine reserves for conservation and fisheries management. Although we describe the case study of the Channel Islands, the approach to marine reserve design may be effective in other regions where traditional management alone does not sustain marine resources. A group of agencies, organizations, and individuals established clear goals for marine reserves in the Channel Islands, including conservation of ecosystem biodiversity, sustainable fisheries, economic viability, natural and cultural heritage, and education. Given the constraints of risk management, experimental design, monitoring, and enforcement, scientists recommended at least one, but no more than four, reserves in each biogeographic region. In general, the percentage of an area to be included in a reserve network depends on the goals. In the Channel Islands, after consideration of both conservation goals and the risk from human threats and natural catastrophes, scientists recommended reserving an area of 30-50% of all representative habitats in each biogeographic region. For most species of concern, except pinnipeds and seabirds, information about distributions, dispersal, and population growth was limited. As an alternative to species distribution information, suitable habitats for species of concern were used to locate potential reserve sites. We used a simulated annealing algorithm to identify potential reserve network scenarios that would represent all habitats within the smallest area possible. The analysis produced an array of potential reserve network scenarios that all met the established goals.

Advancing biodiversity-ecosystem functioning science using high-density tree-based experiments over functional diversity gradients.

PubMed

Tobner, Cornelia M; Paquette, Alain; Reich, Peter B; Gravel, Dominique; Messier, Christian

2014-03-01

Increasing concern about loss of biodiversity and its effects on ecosystem functioning has triggered a series of manipulative experiments worldwide, which have demonstrated a general trend for ecosystem functioning to increase with diversity. General mechanisms proposed to explain diversity effects include complementary resource use and invoke a key role for species' functional traits. The actual mechanisms by which complementary resource use occurs remain, however, poorly understood, as well as whether they apply to tree-dominated ecosystems. Here we present an experimental approach offering multiple innovative aspects to the field of biodiversity-ecosystem functioning (BEF) research. The International Diversity Experiment Network with Trees (IDENT) allows research to be conducted at several hierarchical levels within individuals, neighborhoods, and communities. The network investigates questions related to intraspecific trait variation, complementarity, and environmental stress. The goal of IDENT is to identify some of the mechanisms through which individuals and species interact to promote coexistence and the complementary use of resources. IDENT includes several implemented and planned sites in North America and Europe, and uses a replicated design of high-density tree plots of fixed species-richness levels varying in functional diversity (FD). The design reduces the space and time needed for trees to interact allowing a thorough set of mixtures varying over different diversity gradients (specific, functional, phylogenetic) and environmental conditions (e.g., water stress) to be tested in the field. The intention of this paper is to share the experience in designing FD-focused BEF experiments with trees, to favor collaborations and expand the network to different conditions.

The topology of metabolic isotope labeling networks.

PubMed

Weitzel, Michael; Wiechert, Wolfgang; Nöh, Katharina

2007-08-29

Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling networks (ILNs) contain all essential information required to describe the flow of labeled material in an ILE. Whereas recent experimental progress paves the way for high-throughput MFA, large network investigations and exact statistical methods, these developments are still limited by the poor performance of computational routines used for the evaluation and design of ILEs. In this context, the global analysis of ILN topology turns out to be a clue for realizing large speedup factors in all required computational procedures. With a strong focus on the speedup of algorithms the topology of ILNs is investigated using graph theoretic concepts and algorithms. A rigorous determination of all cyclic and isomorphic subnetworks, accompanied by the global analysis of ILN connectivity is performed. Particularly, it is proven that ILNs always brake up into a large number of small strongly connected components (SCCs) and, moreover, there are natural isomorphisms between many of these SCCs. All presented techniques are universal, i.e. they do not require special assumptions on the network structure, bidirectionality of fluxes, measurement configuration, or label input. The general results are exemplified with a practically relevant metabolic network which describes the central metabolism of E. coli comprising 10390 isotopomer pools. Exploiting the topological features of ILNs leads to a significant speedup of all universal algorithms for ILE evaluation. It is proven in theory and exemplified with the E. coli example that a speedup factor of about 1000 compared to standard algorithms is achieved. This widely opens the door for new high performance algorithms suitable for high throughput applications and large ILNs. Moreover, for the first time the global topological analysis of ILNs allows to comprehensively describe and understand the general patterns of label flow in complex networks. This is an invaluable tool for the structural design of new experiments and the interpretation of measured data.

Fine-tuning gene networks using simple sequence repeats

PubMed Central

Egbert, Robert G.; Klavins, Eric

2012-01-01

The parameters in a complex synthetic gene network must be extensively tuned before the network functions as designed. Here, we introduce a simple and general approach to rapidly tune gene networks in Escherichia coli using hypermutable simple sequence repeats embedded in the spacer region of the ribosome binding site. By varying repeat length, we generated expression libraries that incrementally and predictably sample gene expression levels over a 1,000-fold range. We demonstrate the utility of the approach by creating a bistable switch library that programmatically samples the expression space to balance the two states of the switch, and we illustrate the need for tuning by showing that the switch’s behavior is sensitive to host context. Further, we show that mutation rates of the repeats are controllable in vivo for stability or for targeted mutagenesis—suggesting a new approach to optimizing gene networks via directed evolution. This tuning methodology should accelerate the process of engineering functionally complex gene networks. PMID:22927382

Multi-scale Multi-mechanism Toughening of Hydrogels

NASA Astrophysics Data System (ADS)

Zhao, Xuanhe

Hydrogels are widely used as scaffolds for tissue engineering, vehicles for drug delivery, actuators for optics and fluidics, and model extracellular matrices for biological studies. The scope of hydrogel applications, however, is often severely limited by their mechanical properties. Inspired by the mechanics and hierarchical structures of tough biological tissues, we propose that a general principle for the design of tough hydrogels is to implement two mechanisms for dissipating mechanical energy and maintaining high elasticity in hydrogels. A particularly promising strategy for the design is to integrate multiple pairs of mechanisms across multiple length scales into a hydrogel. We develop a multiscale theoretical framework to quantitatively guide the design of tough hydrogels. On the network level, we have developed micro-physical models to characterize the evolution of polymer networks under deformation. On the continuum level, we have implemented constitutive laws formulated from the network-level models into a coupled cohesive-zone and Mullins-effect model to quantitatively predict crack propagation and fracture toughness of hydrogels. Guided by the design principle and quantitative model, we will demonstrate a set of new hydrogels, based on diverse types of polymers, yet can achieve extremely high toughness superior to their natural counterparts such as cartilages. The work was supported by NSF(No. CMMI- 1253495) and ONR (No. N00014-14-1-0528).

A programming environment for distributed complex computing. An overview of the Framework for Interdisciplinary Design Optimization (FIDO) project. NASA Langley TOPS exhibit H120b

NASA Technical Reports Server (NTRS)

Townsend, James C.; Weston, Robert P.; Eidson, Thomas M.

1993-01-01

The Framework for Interdisciplinary Design Optimization (FIDO) is a general programming environment for automating the distribution of complex computing tasks over a networked system of heterogeneous computers. For example, instead of manually passing a complex design problem between its diverse specialty disciplines, the FIDO system provides for automatic interactions between the discipline tasks and facilitates their communications. The FIDO system networks all the computers involved into a distributed heterogeneous computing system, so they have access to centralized data and can work on their parts of the total computation simultaneously in parallel whenever possible. Thus, each computational task can be done by the most appropriate computer. Results can be viewed as they are produced and variables changed manually for steering the process. The software is modular in order to ease migration to new problems: different codes can be substituted for each of the current code modules with little or no effect on the others. The potential for commercial use of FIDO rests in the capability it provides for automatically coordinating diverse computations on a networked system of workstations and computers. For example, FIDO could provide the coordination required for the design of vehicles or electronics or for modeling complex systems.

Targets of drugs are generally, and targets of drugs having side effects are specifically good spreaders of human interactome perturbations.

PubMed

Perez-Lopez, Áron R; Szalay, Kristóf Z; Türei, Dénes; Módos, Dezső; Lenti, Katalin; Korcsmáros, Tamás; Csermely, Peter

2015-05-11

Network-based methods are playing an increasingly important role in drug design. Our main question in this paper was whether the efficiency of drug target proteins to spread perturbations in the human interactome is larger if the binding drugs have side effects, as compared to those which have no reported side effects. Our results showed that in general, drug targets were better spreaders of perturbations than non-target proteins, and in particular, targets of drugs with side effects were also better spreaders of perturbations than targets of drugs having no reported side effects in human protein-protein interaction networks. Colorectal cancer-related proteins were good spreaders and had a high centrality, while type 2 diabetes-related proteins showed an average spreading efficiency and had an average centrality in the human interactome. Moreover, the interactome-distance between drug targets and disease-related proteins was higher in diabetes than in colorectal cancer. Our results may help a better understanding of the network position and dynamics of drug targets and disease-related proteins, and may contribute to develop additional, network-based tests to increase the potential safety of drug candidates.

Cellular Signaling Networks Function as Generalized Wiener-Kolmogorov Filters to Suppress Noise

NASA Astrophysics Data System (ADS)

Hinczewski, Michael; Thirumalai, D.

2014-10-01

Cellular signaling involves the transmission of environmental information through cascades of stochastic biochemical reactions, inevitably introducing noise that compromises signal fidelity. Each stage of the cascade often takes the form of a kinase-phosphatase push-pull network, a basic unit of signaling pathways whose malfunction is linked with a host of cancers. We show that this ubiquitous enzymatic network motif effectively behaves as a Wiener-Kolmogorov optimal noise filter. Using concepts from umbral calculus, we generalize the linear Wiener-Kolmogorov theory, originally introduced in the context of communication and control engineering, to take nonlinear signal transduction and discrete molecule populations into account. This allows us to derive rigorous constraints for efficient noise reduction in this biochemical system. Our mathematical formalism yields bounds on filter performance in cases important to cellular function—such as ultrasensitive response to stimuli. We highlight features of the system relevant for optimizing filter efficiency, encoded in a single, measurable, dimensionless parameter. Our theory, which describes noise control in a large class of signal transduction networks, is also useful both for the design of synthetic biochemical signaling pathways and the manipulation of pathways through experimental probes such as oscillatory input.

Targets of drugs are generally, and targets of drugs having side effects are specifically good spreaders of human interactome perturbations

NASA Astrophysics Data System (ADS)

Perez-Lopez, Áron R.; Szalay, Kristóf Z.; Türei, Dénes; Módos, Dezső; Lenti, Katalin; Korcsmáros, Tamás; Csermely, Peter

2015-05-01

Network-based methods are playing an increasingly important role in drug design. Our main question in this paper was whether the efficiency of drug target proteins to spread perturbations in the human interactome is larger if the binding drugs have side effects, as compared to those which have no reported side effects. Our results showed that in general, drug targets were better spreaders of perturbations than non-target proteins, and in particular, targets of drugs with side effects were also better spreaders of perturbations than targets of drugs having no reported side effects in human protein-protein interaction networks. Colorectal cancer-related proteins were good spreaders and had a high centrality, while type 2 diabetes-related proteins showed an average spreading efficiency and had an average centrality in the human interactome. Moreover, the interactome-distance between drug targets and disease-related proteins was higher in diabetes than in colorectal cancer. Our results may help a better understanding of the network position and dynamics of drug targets and disease-related proteins, and may contribute to develop additional, network-based tests to increase the potential safety of drug candidates.

Targets of drugs are generally, and targets of drugs having side effects are specifically good spreaders of human interactome perturbations

PubMed Central

Perez-Lopez, Áron R.; Szalay, Kristóf Z.; Türei, Dénes; Módos, Dezső; Lenti, Katalin; Korcsmáros, Tamás; Csermely, Peter

2015-01-01

Network-based methods are playing an increasingly important role in drug design. Our main question in this paper was whether the efficiency of drug target proteins to spread perturbations in the human interactome is larger if the binding drugs have side effects, as compared to those which have no reported side effects. Our results showed that in general, drug targets were better spreaders of perturbations than non-target proteins, and in particular, targets of drugs with side effects were also better spreaders of perturbations than targets of drugs having no reported side effects in human protein-protein interaction networks. Colorectal cancer-related proteins were good spreaders and had a high centrality, while type 2 diabetes-related proteins showed an average spreading efficiency and had an average centrality in the human interactome. Moreover, the interactome-distance between drug targets and disease-related proteins was higher in diabetes than in colorectal cancer. Our results may help a better understanding of the network position and dynamics of drug targets and disease-related proteins, and may contribute to develop additional, network-based tests to increase the potential safety of drug candidates. PMID:25960144

Efficient exploration of pan-cancer networks by generalized covariance selection and interactive web content

PubMed Central

Kling, Teresia; Johansson, Patrik; Sanchez, José; Marinescu, Voichita D.; Jörnsten, Rebecka; Nelander, Sven

2015-01-01

Statistical network modeling techniques are increasingly important tools to analyze cancer genomics data. However, current tools and resources are not designed to work across multiple diagnoses and technical platforms, thus limiting their applicability to comprehensive pan-cancer datasets such as The Cancer Genome Atlas (TCGA). To address this, we describe a new data driven modeling method, based on generalized Sparse Inverse Covariance Selection (SICS). The method integrates genetic, epigenetic and transcriptional data from multiple cancers, to define links that are present in multiple cancers, a subset of cancers, or a single cancer. It is shown to be statistically robust and effective at detecting direct pathway links in data from TCGA. To facilitate interpretation of the results, we introduce a publicly accessible tool (cancerlandscapes.org), in which the derived networks are explored as interactive web content, linked to several pathway and pharmacological databases. To evaluate the performance of the method, we constructed a model for eight TCGA cancers, using data from 3900 patients. The model rediscovered known mechanisms and contained interesting predictions. Possible applications include prediction of regulatory relationships, comparison of network modules across multiple forms of cancer and identification of drug targets. PMID:25953855

Mathematical model of highways network optimization

NASA Astrophysics Data System (ADS)

Sakhapov, R. L.; Nikolaeva, R. V.; Gatiyatullin, M. H.; Makhmutov, M. M.

2017-12-01

The article deals with the issue of highways network design. Studies show that the main requirement from road transport for the road network is to ensure the realization of all the transport links served by it, with the least possible cost. The goal of optimizing the network of highways is to increase the efficiency of transport. It is necessary to take into account a large number of factors that make it difficult to quantify and qualify their impact on the road network. In this paper, we propose building an optimal variant for locating the road network on the basis of a mathematical model. The article defines the criteria for optimality and objective functions that reflect the requirements for the road network. The most fully satisfying condition for optimality is the minimization of road and transport costs. We adopted this indicator as a criterion of optimality in the economic-mathematical model of a network of highways. Studies have shown that each offset point in the optimal binding road network is associated with all other corresponding points in the directions providing the least financial costs necessary to move passengers and cargo from this point to the other corresponding points. The article presents general principles for constructing an optimal network of roads.

Role of Graph Architecture in Controlling Dynamical Networks with Applications to Neural Systems.

PubMed

Kim, Jason Z; Soffer, Jonathan M; Kahn, Ari E; Vettel, Jean M; Pasqualetti, Fabio; Bassett, Danielle S

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviors such as synchronization. While descriptions of these behaviors are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behavior. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behavior in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Role of graph architecture in controlling dynamical networks with applications to neural systems

NASA Astrophysics Data System (ADS)

Kim, Jason Z.; Soffer, Jonathan M.; Kahn, Ari E.; Vettel, Jean M.; Pasqualetti, Fabio; Bassett, Danielle S.

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviours such as synchronization. Although descriptions of these behaviours are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behaviour. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behaviour in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

A novel and generalized approach in the inversion of geoelectrical resistivity data using Artificial Neural Networks (ANN)

NASA Astrophysics Data System (ADS)

Raj, A. Stanley; Srinivas, Y.; Oliver, D. Hudson; Muthuraj, D.

2014-03-01

The non-linear apparent resistivity problem in the subsurface study of the earth takes into account the model parameters in terms of resistivity and thickness of individual subsurface layers using the trained synthetic data by means of Artificial Neural Networks (ANN). Here we used a single layer feed-forward neural network with fast back propagation learning algorithm. So on proper training of back propagation networks it tends to give the resistivity and thickness of the subsurface layer model of the field resistivity data with reference to the synthetic data trained in the appropriate network. During training, the weights and biases of the network are iteratively adjusted to make network performance function level more efficient. On adequate training, errors are minimized and the best result is obtained using the artificial neural networks. The network is trained with more number of VES data and this trained network is demonstrated by the field data. The accuracy of inversion depends upon the number of data trained. In this novel and specially designed algorithm, the interpretation of the vertical electrical sounding has been done successfully with the more accurate layer model.

A selection model for accounting for publication bias in a full network meta-analysis.

PubMed

Mavridis, Dimitris; Welton, Nicky J; Sutton, Alex; Salanti, Georgia

2014-12-30

Copas and Shi suggested a selection model to explore the potential impact of publication bias via sensitivity analysis based on assumptions for the probability of publication of trials conditional on the precision of their results. Chootrakool et al. extended this model to three-arm trials but did not fully account for the implications of the consistency assumption, and their model is difficult to generalize for complex network structures with more than three treatments. Fitting these selection models within a frequentist setting requires maximization of a complex likelihood function, and identification problems are common. We have previously presented a Bayesian implementation of the selection model when multiple treatments are compared with a common reference treatment. We now present a general model suitable for complex, full network meta-analysis that accounts for consistency when adjusting results for publication bias. We developed a design-by-treatment selection model to describe the mechanism by which studies with different designs (sets of treatments compared in a trial) and precision may be selected for publication. We fit the model in a Bayesian setting because it avoids the numerical problems encountered in the frequentist setting, it is generalizable with respect to the number of treatments and study arms, and it provides a flexible framework for sensitivity analysis using external knowledge. Our model accounts for the additional uncertainty arising from publication bias more successfully compared to the standard Copas model or its previous extensions. We illustrate the methodology using a published triangular network for the failure of vascular graft or arterial patency. Copyright © 2014 John Wiley & Sons, Ltd.

Second-Order Consensus in Multiagent Systems via Distributed Sliding Mode Control.

PubMed

Yu, Wenwu; Wang, He; Cheng, Fei; Yu, Xinghuo; Wen, Guanghui

2016-11-22

In this paper, the new decoupled distributed sliding-mode control (DSMC) is first proposed for second-order consensus in multiagent systems, which finally solves the fundamental unknown problem for sliding-mode control (SMC) design of coupled networked systems. A distributed full-order sliding-mode surface is designed based on the homogeneity with dilation for reaching second-order consensus in multiagent systems, under which the sliding-mode states are decoupled. Then, the SMC is applied to the decoupled sliding-mode states to reach their origin in finite time, which is the sliding-mode surface. The states of agents can first reach the designed sliding-mode surface in finite time and then move to the second-order consensus state along the surface in finite time as well. The DSMC designed in this paper can eliminate the influence of singularity problems and weaken the influence of chattering, which is still very difficult in the SMC systems. In addition, DSMC proposes a general decoupling framework for designing SMC in networked multiagent systems. Simulations are presented to verify the theoretical results in this paper.

Pulmonary Nodule Classification with Deep Convolutional Neural Networks on Computed Tomography Images.

PubMed

Li, Wei; Cao, Peng; Zhao, Dazhe; Wang, Junbo

2016-01-01

Computer aided detection (CAD) systems can assist radiologists by offering a second opinion on early diagnosis of lung cancer. Classification and feature representation play critical roles in false-positive reduction (FPR) in lung nodule CAD. We design a deep convolutional neural networks method for nodule classification, which has an advantage of autolearning representation and strong generalization ability. A specified network structure for nodule images is proposed to solve the recognition of three types of nodules, that is, solid, semisolid, and ground glass opacity (GGO). Deep convolutional neural networks are trained by 62,492 regions-of-interest (ROIs) samples including 40,772 nodules and 21,720 nonnodules from the Lung Image Database Consortium (LIDC) database. Experimental results demonstrate the effectiveness of the proposed method in terms of sensitivity and overall accuracy and that it consistently outperforms the competing methods.

Dynamical analysis of continuous higher-order hopfield networks for combinatorial optimization.

PubMed

Atencia, Miguel; Joya, Gonzalo; Sandoval, Francisco

2005-08-01

In this letter, the ability of higher-order Hopfield networks to solve combinatorial optimization problems is assessed by means of a rigorous analysis of their properties. The stability of the continuous network is almost completely clarified: (1) hyperbolic interior equilibria, which are unfeasible, are unstable; (2) the state cannot escape from the unitary hypercube; and (3) a Lyapunov function exists. Numerical methods used to implement the continuous equation on a computer should be designed with the aim of preserving these favorable properties. The case of nonhyperbolic fixed points, which occur when the Hessian of the target function is the null matrix, requires further study. We prove that these nonhyperbolic interior fixed points are unstable in networks with three neurons and order two. The conjecture that interior equilibria are unstable in the general case is left open.

Design of order statistics filters using feedforward neural networks

NASA Astrophysics Data System (ADS)

Maslennikova, Yu. S.; Bochkarev, V. V.

2016-08-01

In recent years significant progress have been made in the development of nonlinear data processing techniques. Such techniques are widely used in digital data filtering and image enhancement. Many of the most effective nonlinear filters based on order statistics. The widely used median filter is the best known order statistic filter. Generalized form of these filters could be presented based on Lloyd's statistics. Filters based on order statistics have excellent robustness properties in the presence of impulsive noise. In this paper, we present special approach for synthesis of order statistics filters using artificial neural networks. Optimal Lloyd's statistics are used for selecting of initial weights for the neural network. Adaptive properties of neural networks provide opportunities to optimize order statistics filters for data with asymmetric distribution function. Different examples demonstrate the properties and performance of presented approach.

Artificial neural networks: fundamentals, computing, design, and application.

PubMed

Basheer, I A; Hajmeer, M

2000-12-01

Artificial neural networks (ANNs) are relatively new computational tools that have found extensive utilization in solving many complex real-world problems. The attractiveness of ANNs comes from their remarkable information processing characteristics pertinent mainly to nonlinearity, high parallelism, fault and noise tolerance, and learning and generalization capabilities. This paper aims to familiarize the reader with ANN-based computing (neurocomputing) and to serve as a useful companion practical guide and toolkit for the ANNs modeler along the course of ANN project development. The history of the evolution of neurocomputing and its relation to the field of neurobiology is briefly discussed. ANNs are compared to both expert systems and statistical regression and their advantages and limitations are outlined. A bird's eye review of the various types of ANNs and the related learning rules is presented, with special emphasis on backpropagation (BP) ANNs theory and design. A generalized methodology for developing successful ANNs projects from conceptualization, to design, to implementation, is described. The most common problems that BPANNs developers face during training are summarized in conjunction with possible causes and remedies. Finally, as a practical application, BPANNs were used to model the microbial growth curves of S. flexneri. The developed model was reasonably accurate in simulating both training and test time-dependent growth curves as affected by temperature and pH.

Percolation of a general network of networks.

PubMed

Gao, Jianxi; Buldyrev, Sergey V; Stanley, H Eugene; Xu, Xiaoming; Havlin, Shlomo

2013-12-01

Percolation theory is an approach to study the vulnerability of a system. We develop an analytical framework and analyze the percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network shows that the damage in the network due to a failure is a continuous function of the size of the failure, i.e., the fraction of failed nodes. In sharp contrast, in NetONet, due to the cascading failures, the percolation transition may be discontinuous and even a single node failure may lead to an abrupt collapse of the system. We demonstrate our general framework for a NetONet composed of n classic Erdős-Rényi (ER) networks, where each network depends on the same number m of other networks, i.e., for a random regular network (RR) formed of interdependent ER networks. The dependency between nodes of different networks is taken as one-to-one correspondence, i.e., a node in one network can depend only on one node in the other network (no-feedback condition). In contrast to a treelike NetONet in which the size of the largest connected cluster (mutual component) depends on n, the loops in the RR NetONet cause the largest connected cluster to depend only on m and the topology of each network but not on n. We also analyzed the extremely vulnerable feedback condition of coupling, where the coupling between nodes of different networks is not one-to-one correspondence. In the case of NetONet formed of ER networks, percolation only exhibits two phases, a second order phase transition and collapse, and no first order percolation transition regime is found in the case of the no-feedback condition. In the case of NetONet composed of RR networks, there exists a first order phase transition when the coupling strength q (fraction of interdependency links) is large and a second order phase transition when q is small. Our insight on the resilience of coupled networks might help in designing robust interdependent systems.

A CoAP-Based Network Access Authentication Service for Low-Power Wide Area Networks: LO-CoAP-EAP.

PubMed

Garcia-Carrillo, Dan; Marin-Lopez, Rafael; Kandasamy, Arunprabhu; Pelov, Alexander

2017-11-17

The Internet-of-Things (IoT) landscape is expanding with new radio technologies. In addition to the Low-Rate Wireless Personal Area Network (LR-WPAN), the recent set of technologies conforming the so-called Low-Power Wide Area Networks (LP-WAN) offers long-range communications, allowing one to send small pieces of information at a reduced energy cost, which promotes the creation of new IoT applications and services. However, LP-WAN technologies pose new challenges since they have strong limitations in the available bandwidth. In general, a first step prior to a smart object being able to gain access to the network is the process of network access authentication. It involves authentication, authorization and key management operations. This process is of vital importance for operators to control network resources. However, proposals for managing network access authentication in LP-WAN are tailored to the specifics of each technology, which could introduce interoperability problems in the future. In this sense, little effort has been put so far into providing a wireless-independent solution for network access authentication in the area of LP-WAN. To fill this gap, we propose a service named Low-Overhead CoAP-EAP (LO-CoAP-EAP), which is based on previous work designed for LR-WPAN. LO-CoAP-EAP integrates the use of Authentication, Authorization and Accounting (AAA) infrastructures and the Extensible Authentication Protocol (EAP) protocol. For this integration, we use the Constrained Application Protocol (CoAP) to design a network authentication service independent of the type of LP-WAN technology. LO-CoAP-EAP represents a trade-off between flexibility, wireless technology independence, scalability and performance in LP-WAN.

A CoAP-Based Network Access Authentication Service for Low-Power Wide Area Networks: LO-CoAP-EAP

PubMed Central

Garcia-Carrillo, Dan; Marin-Lopez, Rafael; Kandasamy, Arunprabhu; Pelov, Alexander

2017-01-01

The Internet-of-Things (IoT) landscape is expanding with new radio technologies. In addition to the Low-Rate Wireless Personal Area Network (LR-WPAN), the recent set of technologies conforming the so-called Low-Power Wide Area Networks (LP-WAN) offers long-range communications, allowing one to send small pieces of information at a reduced energy cost, which promotes the creation of new IoT applications and services. However, LP-WAN technologies pose new challenges since they have strong limitations in the available bandwidth. In general, a first step prior to a smart object being able to gain access to the network is the process of network access authentication. It involves authentication, authorization and key management operations. This process is of vital importance for operators to control network resources. However, proposals for managing network access authentication in LP-WAN are tailored to the specifics of each technology, which could introduce interoperability problems in the future. In this sense, little effort has been put so far into providing a wireless-independent solution for network access authentication in the area of LP-WAN. To fill this gap, we propose a service named Low-Overhead CoAP-EAP (LO-CoAP-EAP), which is based on previous work designed for LR-WPAN. LO-CoAP-EAP integrates the use of Authentication, Authorization and Accounting (AAA) infrastructures and the Extensible Authentication Protocol (EAP) protocol. For this integration, we use the Constrained Application Protocol (CoAP) to design a network authentication service independent of the type of LP-WAN technology. LO-CoAP-EAP represents a trade-off between flexibility, wireless technology independence, scalability and performance in LP-WAN. PMID:29149040

Auxetic metamaterials from disordered networks

NASA Astrophysics Data System (ADS)

Reid, Daniel R.; Pashine, Nidhi; Wozniak, Justin M.; Jaeger, Heinrich M.; Liu, Andrea J.; Nagel, Sidney R.; de Pablo, Juan J.

2018-02-01

Recent theoretical work suggests that systematic pruning of disordered networks consisting of nodes connected by springs can lead to materials that exhibit a host of unusual mechanical properties. In particular, global properties such as Poisson’s ratio or local responses related to deformation can be precisely altered. Tunable mechanical responses would be useful in areas ranging from impact mitigation to robotics and, more generally, for creation of metamaterials with engineered properties. However, experimental attempts to create auxetic materials based on pruning-based theoretical ideas have not been successful. Here we introduce a more realistic model of the networks, which incorporates angle-bending forces and the appropriate experimental boundary conditions. A sequential pruning strategy of select bonds in this model is then devised and implemented that enables engineering of specific mechanical behaviors upon deformation, both in the linear and in the nonlinear regimes. In particular, it is shown that Poisson’s ratio can be tuned to arbitrary values. The model and concepts discussed here are validated by preparing physical realizations of the networks designed in this manner, which are produced by laser cutting 2D sheets and are found to behave as predicted. Furthermore, by relying on optimization algorithms, we exploit the networks’ susceptibility to tuning to design networks that possess a distribution of stiffer and more compliant bonds and whose auxetic behavior is even greater than that of homogeneous networks. Taken together, the findings reported here serve to establish that pruned networks represent a promising platform for the creation of unique mechanical metamaterials.

Distinct roles of a tyrosine-associated hydrogen-bond network in fine-tuning the structure and function of heme proteins: two cases designed for myoglobin.

PubMed

Liao, Fei; Yuan, Hong; Du, Ke-Jie; You, Yong; Gao, Shu-Qin; Wen, Ge-Bo; Lin, Ying-Wu; Tan, Xiangshi

2016-10-20

A hydrogen-bond (H-bond) network, specifically a Tyr-associated H-bond network, plays key roles in regulating the structure and function of proteins, as exemplified by abundant heme proteins in nature. To explore an approach for fine-tuning the structure and function of artificial heme proteins, we herein used myoglobin (Mb) as a model protein and introduced a Tyr residue in the secondary sphere of the heme active site at two different positions (107 and 138). We performed X-ray crystallography, UV-Vis spectroscopy, stopped-flow kinetics, and electron paramagnetic resonance (EPR) studies for the two single mutants, I107Y Mb and F138Y Mb, and compared to that of wild-type Mb under the same conditions. The results showed that both Tyr107 and Tyr138 form a distinct H-bond network involving water molecules and neighboring residues, which fine-tunes ligand binding to the heme iron and enhances the protein stability, respectively. Moreover, the Tyr107-associated H-bond network was shown to fine-tune both H2O2 binding and activation. With two cases demonstrated for Mb, this study suggests that the Tyr-associated H-bond network has distinct roles in regulating the protein structure, properties and functions, depending on its location in the protein scaffold. Therefore, it is possible to design a Tyr-associated H-bond network in general to create other artificial heme proteins with improved properties and functions.

Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth.

PubMed

Li, Huaqing; Chen, Guo; Huang, Tingwen; Dong, Zhaoyang; Zhu, Wei; Gao, Lan

2016-12-01

In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

Care Model Design for E-Health: Integration of Point-of-Care Testing at Dutch General Practices.

PubMed

Verhees, Bart; van Kuijk, Kees; Simonse, Lianne

2017-12-21

Point-of-care testing (POCT)-laboratory tests performed with new mobile devices and online technologies outside of the central laboratory-is rapidly outpacing the traditional laboratory test market, growing at a rate of 12 to 15% each year. POCT impacts the diagnostic process of care providers by yielding high efficiency benefits in terms of turnaround time and related quality improvements in the reduction of errors. However, the implementation of this disruptive eHealth technology requires the integration and transformation of diagnostic services across the boundaries of healthcare organizations. Research has revealed both advantages and barriers of POCT implementations, yet to date, there is no business model for the integration of POCT within general practice. The aim of this article is to contribute with a design for a care model that enables the integration of POCT in primary healthcare. In this research, we used a design modelling toolkit for data collection at five general practices. Through an iterative design process, we modelled the actors and value transactions, and designed an optimized care model for the dynamic integration of POCTs into the GP's network of care delivery. The care model design will have a direct bearing on improving the integration of POCT through the connectivity and norm guidelines between the general practice, the POC technology, and the diagnostic centre.

Care Model Design for E-Health: Integration of Point-of-Care Testing at Dutch General Practices

PubMed Central

Verhees, Bart; van Kuijk, Kees

2017-01-01

Point-of-care testing (POCT)—laboratory tests performed with new mobile devices and online technologies outside of the central laboratory—is rapidly outpacing the traditional laboratory test market, growing at a rate of 12 to 15% each year. POCT impacts the diagnostic process of care providers by yielding high efficiency benefits in terms of turnaround time and related quality improvements in the reduction of errors. However, the implementation of this disruptive eHealth technology requires the integration and transformation of diagnostic services across the boundaries of healthcare organizations. Research has revealed both advantages and barriers of POCT implementations, yet to date, there is no business model for the integration of POCT within general practice. The aim of this article is to contribute with a design for a care model that enables the integration of POCT in primary healthcare. In this research, we used a design modelling toolkit for data collection at five general practices. Through an iterative design process, we modelled the actors and value transactions, and designed an optimized care model for the dynamic integration of POCTs into the GP’s network of care delivery. The care model design will have a direct bearing on improving the integration of POCT through the connectivity and norm guidelines between the general practice, the POC technology, and the diagnostic centre. PMID:29267224

Gas Classification Using Deep Convolutional Neural Networks.

PubMed

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-08

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP).

Gas Classification Using Deep Convolutional Neural Networks

PubMed Central

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-01

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP). PMID:29316723

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

NASA Technical Reports Server (NTRS)

Majumdar, A. K.; Hedayat, A.

2015-01-01

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Neural-network-directed alignment of optical systems using the laser-beam spatial filter as an example

NASA Technical Reports Server (NTRS)

Decker, Arthur J.; Krasowski, Michael J.; Weiland, Kenneth E.

1993-01-01

This report describes an effort at NASA Lewis Research Center to use artificial neural networks to automate the alignment and control of optical measurement systems. Specifically, it addresses the use of commercially available neural network software and hardware to direct alignments of the common laser-beam-smoothing spatial filter. The report presents a general approach for designing alignment records and combining these into training sets to teach optical alignment functions to neural networks and discusses the use of these training sets to train several types of neural networks. Neural network configurations used include the adaptive resonance network, the back-propagation-trained network, and the counter-propagation network. This work shows that neural networks can be used to produce robust sequencers. These sequencers can learn by example to execute the step-by-step procedures of optical alignment and also can learn adaptively to correct for environmentally induced misalignment. The long-range objective is to use neural networks to automate the alignment and operation of optical measurement systems in remote, harsh, or dangerous aerospace environments. This work also shows that when neural networks are trained by a human operator, training sets should be recorded, training should be executed, and testing should be done in a manner that does not depend on intellectual judgments of the human operator.

NEON, Establishing a Standardized Network for Groundwater Observations

NASA Astrophysics Data System (ADS)

Fitzgerald, M.; Schroeter, N.; Goodman, K. J.; Roehm, C. L.

2013-12-01

The National Ecological Observatory Network (NEON) is establishing a standardized set of data collection systems comprised of in-situ sensors and observational sampling to obtain data fundamental to the analysis of environmental change at a continental scale. NEON will be collecting aquatic, terrestrial, and atmospheric data using Observatory-wide standardized designs and methods via a systems engineering approach. This approach ensures a wealth of high quality data, data algorithms, and models that will be freely accessible to all communities such as academic researchers, policy makers, and the general public. The project is established to provide 30 years of data which will enable prediction and forecasting of drivers and responses of ecological change at scales ranging from localized responses through regional gradients and up to the continental scale. The Observatory is a distributed system of sites spread across the United States, including Alaska, Hawaii, and Puerto Rico, which is subdivided into 20 statistically unique domains, based on a set of 18 ecologically important parameters. Each domain contains at least one core aquatic and terrestrial site which are located in unmanaged lands, and up to 2 additional sites selected to study domain specific questions such as nitrogen deposition gradients and responses of land use change activities on the ecosystem. Here, we present the development of NEON's groundwater observation well network design and the timing strategy for sampling groundwater chemistry. Shallow well networks, up to 100 feet in depth, will be installed at NEON aquatic sites and will allow for observation of localized ecohydrologic site conditions, by providing basic spatio-temporal near-real time data on groundwater parameters (level, temperature, conductivity) collected from in situ high-resolution instrumentation positioned in each well; and biannual sampling of geochemical and nutrient (N and P) concentrations in a subset of wells for each site. These data will be used to calculate several higher level data products such as hydrologic gradients which drive nutrient fluxes and their change over time. When coupled with other NEON data products, these data will allow for examining surface water/groundwater interactions as well as additional terrestrial and aquatic linkages, such as riparian vegetation response to changing ecohydrologic conditions (i.e. groundwater withdraw for irrigation, land use change) and natural sources (i.e. drought and changing precipitation patterns). This work will present the well network arrays designed for the different types of aquatic sites (1st/2nd order streams, larger rivers, and lakes) including variations on the well network designs for sites where physical constraints hinder a consistent design due to topographic (steep topography, wetlands) or physical constraints (such as permafrost). A generalized sampling strategy for each type of environment will also be detailed indicating the time of year, largely governed by hydrologic conditions, when sampling should take place to provide consistent groundwater chemistry data to allow for analyzing geochemical trends spatially across the network and through time.

Critical behavior and correlations on scale-free small-world networks: Application to network design

NASA Astrophysics Data System (ADS)

Ostilli, M.; Ferreira, A. L.; Mendes, J. F. F.

2011-06-01

We analyze critical phenomena on networks generated as the union of hidden variable models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small worlds similar to those à la Watts and Strogatz, but with a heterogeneous degree distribution. We prove that the critical behavior (thermal or percolative) remains completely unchanged by the presence of finite loops (or finite clustering). Then, we show that, in large but finite networks, correlations of two given spins may be strong, i.e., approximately power-law-like, at any temperature. Quite interestingly, if γ is the exponent for the power-law distribution of the vertex degree, for γ⩽3 and with or without short-range couplings, such strong correlations persist even in the thermodynamic limit, contradicting the common opinion that, in mean-field models, correlations always disappear in this limit. Finally, we provide the optimal choice of rewiring under which percolation phenomena in the rewired network are best performed, a natural criterion to reach best communication features, at least in noncongested regimes.

Drawing Road Networks with Mental Maps.

PubMed

Lin, Shih-Syun; Lin, Chao-Hung; Hu, Yan-Jhang; Lee, Tong-Yee

2014-09-01

Tourist and destination maps are thematic maps designed to represent specific themes in maps. The road network topologies in these maps are generally more important than the geometric accuracy of roads. A road network warping method is proposed to facilitate map generation and improve theme representation in maps. The basic idea is deforming a road network to meet a user-specified mental map while an optimization process is performed to propagate distortions originating from road network warping. To generate a map, the proposed method includes algorithms for estimating road significance and for deforming a road network according to various geometric and aesthetic constraints. The proposed method can produce an iconic mark of a theme from a road network and meet a user-specified mental map. Therefore, the resulting map can serve as a tourist or destination map that not only provides visual aids for route planning and navigation tasks, but also visually emphasizes the presentation of a theme in a map for the purpose of advertising. In the experiments, the demonstrations of map generations show that our method enables map generation systems to generate deformed tourist and destination maps efficiently.

Dialogic e-Learning2learn: Creating Global Digital Networks and Educational Knowledge Building Architectures across Diversity

ERIC Educational Resources Information Center

Sorensen, Elsebeth Korsgaard

2007-01-01

Purpose: The purpose of this paper is to address the challenge and potential of online higher and continuing education, of fostering and promoting, in a global perspective across time and space, democratic values working for a better world. Design/methodology/approach: The paper presents a generalized dialogic learning architecture of networked…

Network Modeling and Simulation (NEMSE)

DTIC Science & Technology

2013-07-01

for public release by the 88th ABW, Wright-Patterson AFB Public Affairs Office and is available to the general public, including foreign nationals...PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. 1. REPORT DATE ( DD -MM-YYYY) JULY 2013 2. REPORT TYPE FINAL TECHNICAL REPORT 3. DATES COVERED...Paradigm .................................................................................................... 2  Figure 2 - Typical Design from Standard

Predicting General Academic Performance and Identifying the Differential Contribution of Participating Variables Using Artificial Neural Networks

ERIC Educational Resources Information Center

Musso, Mariel F.; Kyndt, Eva; Cascallar, Eduardo C.; Dochy, Filip

2013-01-01

Many studies have explored the contribution of different factors from diverse theoretical perspectives to the explanation of academic performance. These factors have been identified as having important implications not only for the study of learning processes, but also as tools for improving curriculum designs, tutorial systems, and students'…

75 FR 80853 - Designing a Digital Future: Federally Funded Research and Development in Networking and...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-23

... general public. Such information includes, but is not limited to: A person's Social Security number; date... innovation is key to strengthening our economy and forming policy that works for the American people. PCAST... challenges are common across all of these sectors? c. What emerging innovations in these or other sectors...

The Application of Cognitive Diagnostic Approaches via Neural Network Analysis of Serious Educational Games

ERIC Educational Resources Information Center

Lamb, Richard L.

2013-01-01

Serious Educational Games (SEGs) have been a topic of increased popularity within the educational realm since the early millennia. SEGs are generalized form of Serious Games to mean games for purposes other than entertainment but, that also specifically include training, educational purpose and pedagogy within their design. This rise in popularity…

Transforming phylogenetic networks: Moving beyond tree space.

PubMed

Huber, Katharina T; Moulton, Vincent; Wu, Taoyang

2016-09-07

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transformed into any other such network using only these operations. This generalizes the well-known fact that any phylogenetic tree can be transformed into any other such tree using only NNI operations. It also allows us to define a generalization of tree space and to define some new metrics on unrooted phylogenetic networks. To prove our main results, we employ some fascinating new connections between phylogenetic networks and cubic graphs that we have recently discovered. Our results should be useful in developing new strategies to search for optimal phylogenetic networks, a topic that has recently generated some interest in the literature, as well as for providing new ways to compare networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Sampling of temporal networks: Methods and biases

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Masuda, Naoki; Holme, Petter

2017-11-01

Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.

Abstraction networks for terminologies: Supporting management of "big knowledge".

PubMed

Halper, Michael; Gu, Huanying; Perl, Yehoshua; Ochs, Christopher

2015-05-01

Terminologies and terminological systems have assumed important roles in many medical information processing environments, giving rise to the "big knowledge" challenge when terminological content comprises tens of thousands to millions of concepts arranged in a tangled web of relationships. Use and maintenance of knowledge structures on that scale can be daunting. The notion of abstraction network is presented as a means of facilitating the usability, comprehensibility, visualization, and quality assurance of terminologies. An abstraction network overlays a terminology's underlying network structure at a higher level of abstraction. In particular, it provides a more compact view of the terminology's content, avoiding the display of minutiae. General abstraction network characteristics are discussed. Moreover, the notion of meta-abstraction network, existing at an even higher level of abstraction than a typical abstraction network, is described for cases where even the abstraction network itself represents a case of "big knowledge." Various features in the design of abstraction networks are demonstrated in a methodological survey of some existing abstraction networks previously developed and deployed for a variety of terminologies. The applicability of the general abstraction-network framework is shown through use-cases of various terminologies, including the Systematized Nomenclature of Medicine - Clinical Terms (SNOMED CT), the Medical Entities Dictionary (MED), and the Unified Medical Language System (UMLS). Important characteristics of the surveyed abstraction networks are provided, e.g., the magnitude of the respective size reduction referred to as the abstraction ratio. Specific benefits of these alternative terminology-network views, particularly their use in terminology quality assurance, are discussed. Examples of meta-abstraction networks are presented. The "big knowledge" challenge constitutes the use and maintenance of terminological structures that comprise tens of thousands to millions of concepts and their attendant complexity. The notion of abstraction network has been introduced as a tool in helping to overcome this challenge, thus enhancing the usefulness of terminologies. Abstraction networks have been shown to be applicable to a variety of existing biomedical terminologies, and these alternative structural views hold promise for future expanded use with additional terminologies. Copyright © 2015 Elsevier B.V. All rights reserved.

Managing RFID sensors networks with a general purpose RFID middleware.

PubMed

Abad, Ismael; Cerrada, Carlos; Cerrada, Jose A; Heradio, Rubén; Valero, Enrique

2012-01-01

RFID middleware is anticipated to one of the main research areas in the field of RFID applications in the near future. The Data EPC Acquisition System (DEPCAS) is an original proposal designed by our group to transfer and apply fundamental ideas from System and Data Acquisition (SCADA) systems into the areas of RFID acquisition, processing and distribution systems. In this paper we focus on how to organize and manage generic RFID sensors (edge readers, readers, PLCs, etc…) inside the DEPCAS middleware. We denote by RFID Sensors Networks Management (RSNM) this part of DEPCAS, which is built on top of two new concepts introduced and developed in this work: MARC (Minimum Access Reader Command) and RRTL (RFID Reader Topology Language). MARC is an abstraction layer used to hide heterogeneous devices inside a homogeneous acquisition network. RRTL is a language to define RFID Reader networks and to describe the relationship between them (concentrator, peer to peer, master/submaster).

Cluster synchronization of community network with distributed time delays via impulsive control

NASA Astrophysics Data System (ADS)

Leng, Hui; Wu, Zhao-Yan

2016-11-01

Cluster synchronization is an important dynamical behavior in community networks and deserves further investigations. A community network with distributed time delays is investigated in this paper. For achieving cluster synchronization, an impulsive control scheme is introduced to design proper controllers and an adaptive strategy is adopted to make the impulsive controllers unified for different networks. Through taking advantage of the linear matrix inequality technique and constructing Lyapunov functions, some synchronization criteria with respect to the impulsive gains, instants, and system parameters without adaptive strategy are obtained and generalized to the adaptive case. Finally, numerical examples are presented to demonstrate the effectiveness of the theoretical results. Project supported by the National Natural Science Foundation of China (Grant No. 61463022), the Natural Science Foundation of Jiangxi Province, China (Grant No. 20161BAB201021), and the Natural Science Foundation of Jiangxi Educational Committee, China (Grant No. GJJ14273).

Peeling Away Timing Error in NetFlow Data

NASA Astrophysics Data System (ADS)

Trammell, Brian; Tellenbach, Bernhard; Schatzmann, Dominik; Burkhart, Martin

In this paper, we characterize, quantify, and correct timing errors introduced into network flow data by collection and export via Cisco NetFlow version 9. We find that while some of these sources of error (clock skew, export delay) are generally implementation-dependent and known in the literature, there is an additional cyclic error of up to one second that is inherent to the design of the export protocol. We present a method for correcting this cyclic error in the presence of clock skew and export delay. In an evaluation using traffic with known timing collected from a national-scale network, we show that this method can successfully correct the cyclic error. However, there can also be other implementation-specific errors for which insufficient information remains for correction. On the routers we have deployed in our network, this limits the accuracy to about 70ms, reinforcing the point that implementation matters when conducting research on network measurement data.

Identifiability of large-scale non-linear dynamic network models applied to the ADM1-case study.

PubMed

Nimmegeers, Philippe; Lauwers, Joost; Telen, Dries; Logist, Filip; Impe, Jan Van

2017-06-01

In this work, both the structural and practical identifiability of the Anaerobic Digestion Model no. 1 (ADM1) is investigated, which serves as a relevant case study of large non-linear dynamic network models. The structural identifiability is investigated using the probabilistic algorithm, adapted to deal with the specifics of the case study (i.e., a large-scale non-linear dynamic system of differential and algebraic equations). The practical identifiability is analyzed using a Monte Carlo parameter estimation procedure for a 'non-informative' and 'informative' experiment, which are heuristically designed. The model structure of ADM1 has been modified by replacing parameters by parameter combinations, to provide a generally locally structurally identifiable version of ADM1. This means that in an idealized theoretical situation, the parameters can be estimated accurately. Furthermore, the generally positive structural identifiability results can be explained from the large number of interconnections between the states in the network structure. This interconnectivity, however, is also observed in the parameter estimates, making uncorrelated parameter estimations in practice difficult. Copyright © 2017. Published by Elsevier Inc.

Development and Efficacy Testing of a Social Network-Based Competitive Application for Weight Loss.

PubMed

Lee, Jisan; Kim, Jeongeun

2016-05-01

Although a lot of people continuously try to lose weight, the obesity rate has remained high: 36.9% of males and 38.0% of females worldwide in 2013. This suggests the need for a new intervention. In this study, we designed a smartphone application, With U, to aid weight loss by using an offline social network of friends and an online social network, Facebook. To determine the effects of With U, this study was designed as a one-group pretest-posttest design. Overweight, obese, and severely obese adults 20-40 years old, along with their friends, participated in this study. A total of 10 pairs attempted to lose weight for 4 weeks. We used a questionnaire to measure general characteristics, motivation, and intent to continue to use With U, and the Inbody720 (Biospace, Seoul, Republic of Korea) body composition analyzer was used to measure physical characteristics. In addition, we briefly interviewed the participants about their experience. We observed statistically significant effects in terms of motivation to lose weight and the amount of weight loss. Changes in physical characteristics beyond weight loss also showed positive trends. Also, we discovered some interesting facts during the interviews. The weight loss effect was greater when the team members met more and the relationship between the challengers was more direct and intimate. The application With U, designed and developed to allow friends to challenge each other to lose weight, affected both motivation to lose weight and the amount of weight loss. In the future, effects of smartphone applications for health management with social networks need to be studied further.

Combined model of intrinsic and extrinsic variability for computational network design with application to synthetic biology.

PubMed

Toni, Tina; Tidor, Bruce

2013-01-01

Biological systems are inherently variable, with their dynamics influenced by intrinsic and extrinsic sources. These systems are often only partially characterized, with large uncertainties about specific sources of extrinsic variability and biochemical properties. Moreover, it is not yet well understood how different sources of variability combine and affect biological systems in concert. To successfully design biomedical therapies or synthetic circuits with robust performance, it is crucial to account for uncertainty and effects of variability. Here we introduce an efficient modeling and simulation framework to study systems that are simultaneously subject to multiple sources of variability, and apply it to make design decisions on small genetic networks that play a role of basic design elements of synthetic circuits. Specifically, the framework was used to explore the effect of transcriptional and post-transcriptional autoregulation on fluctuations in protein expression in simple genetic networks. We found that autoregulation could either suppress or increase the output variability, depending on specific noise sources and network parameters. We showed that transcriptional autoregulation was more successful than post-transcriptional in suppressing variability across a wide range of intrinsic and extrinsic magnitudes and sources. We derived the following design principles to guide the design of circuits that best suppress variability: (i) high protein cooperativity and low miRNA cooperativity, (ii) imperfect complementarity between miRNA and mRNA was preferred to perfect complementarity, and (iii) correlated expression of mRNA and miRNA--for example, on the same transcript--was best for suppression of protein variability. Results further showed that correlations in kinetic parameters between cells affected the ability to suppress variability, and that variability in transient states did not necessarily follow the same principles as variability in the steady state. Our model and findings provide a general framework to guide design principles in synthetic biology.

Combined Model of Intrinsic and Extrinsic Variability for Computational Network Design with Application to Synthetic Biology

PubMed Central

Toni, Tina; Tidor, Bruce

2013-01-01

Biological systems are inherently variable, with their dynamics influenced by intrinsic and extrinsic sources. These systems are often only partially characterized, with large uncertainties about specific sources of extrinsic variability and biochemical properties. Moreover, it is not yet well understood how different sources of variability combine and affect biological systems in concert. To successfully design biomedical therapies or synthetic circuits with robust performance, it is crucial to account for uncertainty and effects of variability. Here we introduce an efficient modeling and simulation framework to study systems that are simultaneously subject to multiple sources of variability, and apply it to make design decisions on small genetic networks that play a role of basic design elements of synthetic circuits. Specifically, the framework was used to explore the effect of transcriptional and post-transcriptional autoregulation on fluctuations in protein expression in simple genetic networks. We found that autoregulation could either suppress or increase the output variability, depending on specific noise sources and network parameters. We showed that transcriptional autoregulation was more successful than post-transcriptional in suppressing variability across a wide range of intrinsic and extrinsic magnitudes and sources. We derived the following design principles to guide the design of circuits that best suppress variability: (i) high protein cooperativity and low miRNA cooperativity, (ii) imperfect complementarity between miRNA and mRNA was preferred to perfect complementarity, and (iii) correlated expression of mRNA and miRNA – for example, on the same transcript – was best for suppression of protein variability. Results further showed that correlations in kinetic parameters between cells affected the ability to suppress variability, and that variability in transient states did not necessarily follow the same principles as variability in the steady state. Our model and findings provide a general framework to guide design principles in synthetic biology. PMID:23555205

Design of Neural Networks for Fast Convergence and Accuracy

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Sparks, Dean W., Jr.

1998-01-01

A novel procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed to provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component spacecraft design changes and measures of its performance. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The design algorithm attempts to avoid the local minima phenomenon that hampers the traditional network training. A numerical example is performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Stochastic user equilibrium model with a tradable credit scheme and application in maximizing network reserve capacity

NASA Astrophysics Data System (ADS)

Han, Fei; Cheng, Lin

2017-04-01

The tradable credit scheme (TCS) outperforms congestion pricing in terms of social equity and revenue neutrality, apart from the same perfect performance on congestion mitigation. This article investigates the effectiveness and efficiency of TCS on enhancing transportation network capacity in a stochastic user equilibrium (SUE) modelling framework. First, the SUE and credit market equilibrium conditions are presented; then an equivalent general SUE model with TCS is established by virtue of two constructed functions, which can be further simplified under a specific probability distribution. To enhance the network capacity by utilizing TCS, a bi-level mathematical programming model is established for the optimal TCS design problem, with the upper level optimization objective maximizing network reserve capacity and lower level being the proposed SUE model. The heuristic sensitivity analysis-based algorithm is developed to solve the bi-level model. Three numerical examples are provided to illustrate the improvement effect of TCS on the network in different scenarios.

Quasi-projective synchronization of fractional-order complex-valued recurrent neural networks.

PubMed

Yang, Shuai; Yu, Juan; Hu, Cheng; Jiang, Haijun

2018-08-01

In this paper, without separating the complex-valued neural networks into two real-valued systems, the quasi-projective synchronization of fractional-order complex-valued neural networks is investigated. First, two new fractional-order inequalities are established by using the theory of complex functions, Laplace transform and Mittag-Leffler functions, which generalize traditional inequalities with the first-order derivative in the real domain. Additionally, different from hybrid control schemes given in the previous work concerning the projective synchronization, a simple and linear control strategy is designed in this paper and several criteria are derived to ensure quasi-projective synchronization of the complex-valued neural networks with fractional-order based on the established fractional-order inequalities and the theory of complex functions. Moreover, the error bounds of quasi-projective synchronization are estimated. Especially, some conditions are also presented for the Mittag-Leffler synchronization of the addressed neural networks. Finally, some numerical examples with simulations are provided to show the effectiveness of the derived theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

A Mars Micro-Meteorological Station Mission

NASA Technical Reports Server (NTRS)

Merrihew, Steven C.; Haberle, Robert; Lemke, Lawrence G.

1995-01-01

The Mars Micro-Meteorological Station (Micro-Met) Mission is designed to provide the global surface pressure measurements required to help characterize the martian general circulation and climate system. Measurements of surface pressure distributed both spatially and temporally, coupled with simultaneous measurements from orbit, will enable the determination of the general circulation, structure and driving factors of the martian atmosphere as well as the seasonal CO2 cycle. The influence of these atmospheric factors will in turn provide insight into the overall martian climate system. With the science objective defined as the long term (at least one Mars year) globally distributed measurement of surface atmospheric pressure, a straightforward, near term and low cost network mission has been designed. The Micro-Met mission utilizes a unique silicon micro-machined pressure sensor coupled with a robust and lightweight surface station to deliver to Mars 16 Micro-Met stations via a Med-Lite launch vehicle. The battery powered Micro-Met surface stations are designed to autonomously measure, record and transmit the science data via a UHF relay satellite. Entry, descent and landing is provided by an aeroshell with a new lightweight ceramic thermal protection system, a parachute and an impact absorbing structure. The robust lander is capable of surviving the landing loads imposed by the high altitude landing sites required in a global network. By trading the ability to make many measurements at a single site for the ability to make a single measurement at several sites, the Micro-Met mission design satisfies the requirement for truly global meteorological science.

Energy and time determine scaling in biological and computer designs

PubMed Central

Bezerra, George; Edwards, Benjamin; Brown, James; Forrest, Stephanie

2016-01-01

Metabolic rate in animals and power consumption in computers are analogous quantities that scale similarly with size. We analyse vascular systems of mammals and on-chip networks of microprocessors, where natural selection and human engineering, respectively, have produced systems that minimize both energy dissipation and delivery times. Using a simple network model that simultaneously minimizes energy and time, our analysis explains empirically observed trends in the scaling of metabolic rate in mammals and power consumption and performance in microprocessors across several orders of magnitude in size. Just as the evolutionary transitions from unicellular to multicellular animals in biology are associated with shifts in metabolic scaling, our model suggests that the scaling of power and performance will change as computer designs transition to decentralized multi-core and distributed cyber-physical systems. More generally, a single energy–time minimization principle may govern the design of many complex systems that process energy, materials and information. This article is part of the themed issue ‘The major synthetic evolutionary transitions’. PMID:27431524

Energy and time determine scaling in biological and computer designs.

PubMed

Moses, Melanie; Bezerra, George; Edwards, Benjamin; Brown, James; Forrest, Stephanie

2016-08-19

Metabolic rate in animals and power consumption in computers are analogous quantities that scale similarly with size. We analyse vascular systems of mammals and on-chip networks of microprocessors, where natural selection and human engineering, respectively, have produced systems that minimize both energy dissipation and delivery times. Using a simple network model that simultaneously minimizes energy and time, our analysis explains empirically observed trends in the scaling of metabolic rate in mammals and power consumption and performance in microprocessors across several orders of magnitude in size. Just as the evolutionary transitions from unicellular to multicellular animals in biology are associated with shifts in metabolic scaling, our model suggests that the scaling of power and performance will change as computer designs transition to decentralized multi-core and distributed cyber-physical systems. More generally, a single energy-time minimization principle may govern the design of many complex systems that process energy, materials and information.This article is part of the themed issue 'The major synthetic evolutionary transitions'. © 2016 The Author(s).

Enhancing the Anti-Solvatochromic Two-Photon Fluorescence for Cirrhosis Imaging by Forming a Hydrogen-Bond Network.

PubMed

Ren, Tian-Bing; Xu, Wang; Zhang, Qian-Ling; Zhang, Xing-Xing; Wen, Si-Yu; Yi, Hai-Bo; Yuan, Lin; Zhang, Xiao-Bing

2018-06-18

Two-photon imaging is an emerging tool for biomedical research and clinical diagnostics. Electron donor-acceptor (D-A) type molecules are the most widely employed two-photon scaffolds. However, current D-A type fluorophores suffer from solvatochromic quenching in aqueous biological samples. To address this issue, we devised a novel class of D-A type green fluorescent protein (GFP) chromophore analogues that form a hydrogen-bond network in water to improve the two-photon efficiency. Our design results in two-photon chalcone (TPC) dyes with 0.80 quantum yield and large two-photon action cross section (210 GM) in water. This strategy to form hydrogen bonds can be generalized to design two-photon materials with anti-solvatochromic fluorescence. To demonstrate the improved in vivo imaging, we designed a sulfide probe based on TPC dyes and monitored endogenous H 2 S generation and scavenging in the cirrhotic rat liver for the first time. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Information theory-based decision support system for integrated design of multivariable hydrometric networks

NASA Astrophysics Data System (ADS)

Keum, Jongho; Coulibaly, Paulin

2017-07-01

Adequate and accurate hydrologic information from optimal hydrometric networks is an essential part of effective water resources management. Although the key hydrologic processes in the water cycle are interconnected, hydrometric networks (e.g., streamflow, precipitation, groundwater level) have been routinely designed individually. A decision support framework is proposed for integrated design of multivariable hydrometric networks. The proposed method is applied to design optimal precipitation and streamflow networks simultaneously. The epsilon-dominance hierarchical Bayesian optimization algorithm was combined with Shannon entropy of information theory to design and evaluate hydrometric networks. Specifically, the joint entropy from the combined networks was maximized to provide the most information, and the total correlation was minimized to reduce redundant information. To further optimize the efficiency between the networks, they were designed by maximizing the conditional entropy of the streamflow network given the information of the precipitation network. Compared to the traditional individual variable design approach, the integrated multivariable design method was able to determine more efficient optimal networks by avoiding the redundant stations. Additionally, four quantization cases were compared to evaluate their effects on the entropy calculations and the determination of the optimal networks. The evaluation results indicate that the quantization methods should be selected after careful consideration for each design problem since the station rankings and the optimal networks can change accordingly.

On the Relationships between Generative Encodings, Regularity, and Learning Abilities when Evolving Plastic Artificial Neural Networks

PubMed Central

Tonelli, Paul; Mouret, Jean-Baptiste

2013-01-01

A major goal of bio-inspired artificial intelligence is to design artificial neural networks with abilities that resemble those of animal nervous systems. It is commonly believed that two keys for evolving nature-like artificial neural networks are (1) the developmental process that links genes to nervous systems, which enables the evolution of large, regular neural networks, and (2) synaptic plasticity, which allows neural networks to change during their lifetime. So far, these two topics have been mainly studied separately. The present paper shows that they are actually deeply connected. Using a simple operant conditioning task and a classic evolutionary algorithm, we compare three ways to encode plastic neural networks: a direct encoding, a developmental encoding inspired by computational neuroscience models, and a developmental encoding inspired by morphogen gradients (similar to HyperNEAT). Our results suggest that using a developmental encoding could improve the learning abilities of evolved, plastic neural networks. Complementary experiments reveal that this result is likely the consequence of the bias of developmental encodings towards regular structures: (1) in our experimental setup, encodings that tend to produce more regular networks yield networks with better general learning abilities; (2) whatever the encoding is, networks that are the more regular are statistically those that have the best learning abilities. PMID:24236099

Node-Splitting Generalized Linear Mixed Models for Evaluation of Inconsistency in Network Meta-Analysis.

PubMed

Yu-Kang, Tu

2016-12-01

Network meta-analysis for multiple treatment comparisons has been a major development in evidence synthesis methodology. The validity of a network meta-analysis, however, can be threatened by inconsistency in evidence within the network. One particular issue of inconsistency is how to directly evaluate the inconsistency between direct and indirect evidence with regard to the effects difference between two treatments. A Bayesian node-splitting model was first proposed and a similar frequentist side-splitting model has been put forward recently. Yet, assigning the inconsistency parameter to one or the other of the two treatments or splitting the parameter symmetrically between the two treatments can yield different results when multi-arm trials are involved in the evaluation. We aimed to show that a side-splitting model can be viewed as a special case of design-by-treatment interaction model, and different parameterizations correspond to different design-by-treatment interactions. We demonstrated how to evaluate the side-splitting model using the arm-based generalized linear mixed model, and an example data set was used to compare results from the arm-based models with those from the contrast-based models. The three parameterizations of side-splitting make slightly different assumptions: the symmetrical method assumes that both treatments in a treatment contrast contribute to inconsistency between direct and indirect evidence, whereas the other two parameterizations assume that only one of the two treatments contributes to this inconsistency. With this understanding in mind, meta-analysts can then make a choice about how to implement the side-splitting method for their analysis. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

Design of autonomous sensor nodes for remote soil monitoring in tropical banana plantation

NASA Astrophysics Data System (ADS)

Tiausas, Francis Jerome G.; Co, Jerelyn; Macalinao, Marc Joseph M.; Guico, Maria Leonora; Monje, Jose Claro; Oppus, Carlos

2017-09-01

Determining the effect of Fusarium oxysporum f. sp. cubense Tropical Race 4 on various soil parameters is essential in modeling and predicting its occurrence in banana plantations. One way to fulfill this is through a sensor network that will continuously and automatically monitor environmental conditions at suspect locations for an extended period of time. A wireless sensor network was developed specifically for this purpose. This sensor network is capable of measuring soil acidity, moisture, temperature, and conductivity. The designed prototype made use of off-the-shelf Parrot Flower Power soil sensor, pH sensor, Bluno Beetle, battery, and 3D-printed materials, catering specifically to the conditions of tropical banana plantations with consideration for sensor node size, communication, and power. Sensor nodes were tested on both simulated tropical environments and on an actual banana plantation in San Jose, General Santos City, Philippines. Challenges were resolved through iterative design and development of prototypes. Several tests including temperature and weather resilience, and structural stress tests were done to validate the design. Findings showed that the WSN nodes developed for this purpose are resilient to high tropical temperatures for up to 12 hours of continuous exposure, are able to withstand compressive forces of up to 8880.6 N, and can reliably collect data automatically from the area 47.96% of the time at an hourly frequency under actual field conditions.

Using genetic algorithms to determine near-optimal pricing, investment and operating strategies in the electric power industry

NASA Astrophysics Data System (ADS)

Wu, Dongjun

Network industries have technologies characterized by a spatial hierarchy, the "network," with capital-intensive interconnections and time-dependent, capacity-limited flows of products and services through the network to customers. This dissertation studies service pricing, investment and business operating strategies for the electric power network. First-best solutions for a variety of pricing and investment problems have been studied. The evaluation of genetic algorithms (GA, which are methods based on the idea of natural evolution) as a primary means of solving complicated network problems, both w.r.t. pricing: as well as w.r.t. investment and other operating decisions, has been conducted. New constraint-handling techniques in GAs have been studied and tested. The actual application of such constraint-handling techniques in solving practical non-linear optimization problems has been tested on several complex network design problems with encouraging initial results. Genetic algorithms provide solutions that are feasible and close to optimal when the optimal solution is know; in some instances, the near-optimal solutions for small problems by the proposed GA approach can only be tested by pushing the limits of currently available non-linear optimization software. The performance is far better than several commercially available GA programs, which are generally inadequate in solving any of the problems studied in this dissertation, primarily because of their poor handling of constraints. Genetic algorithms, if carefully designed, seem very promising in solving difficult problems which are intractable by traditional analytic methods.

Integrated solutions for sustainable fall prevention in primary care, the iSOLVE project: a type 2 hybrid effectiveness-implementation design.

PubMed

Clemson, Lindy; Mackenzie, Lynette; Roberts, Chris; Poulos, Roslyn; Tan, Amy; Lovarini, Meryl; Sherrington, Cathie; Simpson, Judy M; Willis, Karen; Lam, Mary; Tiedemann, Anne; Pond, Dimity; Peiris, David; Hilmer, Sarah; Pit, Sabrina Winona; Howard, Kirsten; Lovitt, Lorraine; White, Fiona

2017-02-07

Despite strong evidence giving guidance for effective fall prevention interventions in community-residing older people, there is currently no clear model for engaging general medical practitioners in fall prevention and routine use of allied health professionals in fall prevention has been slow, limiting widespread dissemination. This protocol paper outlines an implementation-effectiveness study of the Integrated Solutions for Sustainable Fall Prevention (iSOLVE) intervention which has developed integrated processes and pathways to identify older people at risk of falls and engage a whole of primary care approach to fall prevention. This protocol paper presents the iSOLVE implementation processes and change strategies and outlines the study design of a blended type 2 hybrid design. The study consists of a two-arm cluster randomized controlled trial in 28 general practices and recruiting 560 patients in Sydney, Australia, to evaluate effectiveness of the iSOLVE intervention in changing general practitioner fall management practices and reducing patient falls and the cost effectiveness from a healthcare funder perspective. Secondary outcomes include change in medications known to increase fall risk. We will simultaneously conduct a multi-methodology evaluation to investigate the workability and utility of the implementation intervention. The implementation evaluation includes in-depth interviews and surveys with general practitioners and allied health professionals to explore acceptability and uptake of the intervention, the coherence of the proposed changes for those in the work setting, and how to facilitate the collective action needed to implement changes in practice; social network mapping will explore professional relationships and influences on referral patterns; and, a survey of GPs in the geographical intervention zone will test diffusion of evidence-based fall prevention practices. The project works in partnership with a primary care health network, state fall prevention leaders, and a community of practice of fall prevention advocates. The design is aimed at providing clear direction for sustainability and informing decisions about generalization of the iSOLVE intervention processes and change strategies. While challenges exist in hybrid designs, there is a potential for significant outcomes as the iSOLVE pathways project brings together practice and research to collectively solve a major national problem with implications for policy service delivery. Australian New Zealand Clinial Trials Registry ACTRN12615000401550.

Design and implementation of a telemedicine system using Bluetooth protocol and GSM/GPRS network, for real time remote patient monitoring.

PubMed

Jasemian, Yousef; Nielsen, Lars Arendt

2005-01-01

This paper introduces the design and implementation of a generic wireless and Real-time Multi-purpose Health Care Telemedicine system applying Bluetooth protocol, Global System for Mobile Communications (GSM) and General Packet Radio Service (GPRS). The paper explores the factors that should be considered when evaluating different technologies for application in telemedicine system. The design and implementation of an embedded wireless communication platform utilising Bluetooth protocol is described, and the implementation problems and limitations are investigated. The system is tested and its telecommunication general aspects are verified. The results showed that the system has (97.9 +/- 1.3)% Up-time, 2.5 x 10(-5) Bit Error Rate, 1% Dropped Call Rate, 97.4% Call Success Rate, 5 second transmission delay in average, (3.42 +/- 0.11) kbps throughput, and the system may have application in electrocardiography.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

PubMed

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Stable architectures for deep neural networks

NASA Astrophysics Data System (ADS)

Haber, Eldad; Ruthotto, Lars

2018-01-01

Deep neural networks have become invaluable tools for supervised machine learning, e.g. classification of text or images. While often offering superior results over traditional techniques and successfully expressing complicated patterns in data, deep architectures are known to be challenging to design and train such that they generalize well to new data. Critical issues with deep architectures are numerical instabilities in derivative-based learning algorithms commonly called exploding or vanishing gradients. In this paper, we propose new forward propagation techniques inspired by systems of ordinary differential equations (ODE) that overcome this challenge and lead to well-posed learning problems for arbitrarily deep networks. The backbone of our approach is our interpretation of deep learning as a parameter estimation problem of nonlinear dynamical systems. Given this formulation, we analyze stability and well-posedness of deep learning and use this new understanding to develop new network architectures. We relate the exploding and vanishing gradient phenomenon to the stability of the discrete ODE and present several strategies for stabilizing deep learning for very deep networks. While our new architectures restrict the solution space, several numerical experiments show their competitiveness with state-of-the-art networks.

Independent component analysis (ICA) and self-organizing map (SOM) approach to multidetection system for network intruders

NASA Astrophysics Data System (ADS)

Abdi, Abdi M.; Szu, Harold H.

2003-04-01

With the growing rate of interconnection among computer systems, network security is becoming a real challenge. Intrusion Detection System (IDS) is designed to protect the availability, confidentiality and integrity of critical network information systems. Today"s approach to network intrusion detection involves the use of rule-based expert systems to identify an indication of known attack or anomalies. However, these techniques are less successful in identifying today"s attacks. Hackers are perpetually inventing new and previously unanticipated techniques to compromise information infrastructure. This paper proposes a dynamic way of detecting network intruders on time serious data. The proposed approach consists of a two-step process. Firstly, obtaining an efficient multi-user detection method, employing the recently introduced complexity minimization approach as a generalization of a standard ICA. Secondly, we identified unsupervised learning neural network architecture based on Kohonen"s Self-Organizing Map for potential functional clustering. These two steps working together adaptively will provide a pseudo-real time novelty detection attribute to supplement the current intrusion detection statistical methodology.

Simulation Methods for Design of Networked Power Electronics and Information Systems

DTIC Science & Technology

2014-07-01

Insertion of latency in every branch and at every node permits the system model to be efficiently distributed across many separate computing cores. An... the system . We demonstrated extensibility and generality of the Virtual Test Bed (VTB) framework to support multiple solvers and their associated...Information Systems Objectives The overarching objective of this program is to develop methods for fast

49 CFR Appendix A to Part 209 - Statement of Agency Policy Concerning Enforcement of the Federal Railroad Safety Laws

Code of Federal Regulations, 2013 CFR

2013-10-01

... exercise of jurisdiction. In this context, the presence of intrusion detection devices to alert one or both... about sufficient intrusion detection and related safety measures designed to avoid a collision between...). By “general railroad system of transportation,” FRA refers to the network of standard gage track over...

49 CFR Appendix A to Part 209 - Statement of Agency Policy Concerning Enforcement of the Federal Railroad Safety Laws

Code of Federal Regulations, 2014 CFR

2014-10-01

... exercise of jurisdiction. In this context, the presence of intrusion detection devices to alert one or both... about sufficient intrusion detection and related safety measures designed to avoid a collision between...). By “general railroad system of transportation,” FRA refers to the network of standard gage track over...

49 CFR Appendix A to Part 209 - Statement of Agency Policy Concerning Enforcement of the Federal Railroad Safety Laws

Code of Federal Regulations, 2012 CFR

2012-10-01

... exercise of jurisdiction. In this context, the presence of intrusion detection devices to alert one or both... about sufficient intrusion detection and related safety measures designed to avoid a collision between...). By “general railroad system of transportation,” FRA refers to the network of standard gage track over...

Overview of timing/synchronization for digital communications

NASA Technical Reports Server (NTRS)

Stover, H. A.

1978-01-01

Systems in general, and switched systems in particular, are explained. It pointed out some of the criteria that greatly influence timing/synchronization subsystem design for a military communications network but have little or no significance for civil systems. Timing techniques were evaluated in terms of fundamental features. Different combinations of these features covered most possibilities from which a synchronous timing system could be chosen.

Data collection framework for energy efficient privacy preservation in wireless sensor networks having many-to-many structures.

PubMed

Bahşi, Hayretdin; Levi, Albert

2010-01-01

Wireless sensor networks (WSNs) generally have a many-to-one structure so that event information flows from sensors to a unique sink. In recent WSN applications, many-to-many structures evolved due to the need for conveying collected event information to multiple sinks. Privacy preserved data collection models in the literature do not solve the problems of WSN applications in which network has multiple un-trusted sinks with different level of privacy requirements. This study proposes a data collection framework bases on k-anonymity for preventing record disclosure of collected event information in WSNs. Proposed method takes the anonymity requirements of multiple sinks into consideration by providing different levels of privacy for each destination sink. Attributes, which may identify an event owner, are generalized or encrypted in order to meet the different anonymity requirements of sinks at the same anonymized output. If the same output is formed, it can be multicasted to all sinks. The other trivial solution is to produce different anonymized outputs for each sink and send them to related sinks. Multicasting is an energy efficient data sending alternative for some sensor nodes. Since minimization of energy consumption is an important design criteria for WSNs, multicasting the same event information to multiple sinks reduces the energy consumption of overall network.

Generic patterns in the evolution of urban water networks: Evidence from a large Asian city

NASA Astrophysics Data System (ADS)

Krueger, Elisabeth; Klinkhamer, Christopher; Urich, Christian; Zhan, Xianyuan; Rao, P. Suresh C.

2017-03-01

We examine high-resolution urban infrastructure data using every pipe for the water distribution network (WDN) and sanitary sewer network (SSN) in a large Asian city (≈4 million residents) to explore the structure as well as the spatial and temporal evolution of these infrastructure networks. Network data were spatially disaggregated into multiple subnets to examine intracity topological differences for functional zones of the WDN and SSN, and time-stamped SSN data were examined to understand network evolution over several decades as the city expanded. Graphs were generated using a dual-mapping technique (Hierarchical Intersection Continuity Negotiation), which emphasizes the functional attributes of these networks. Network graphs for WDNs and SSNs are characterized by several network topological metrics, and a double Pareto (power-law) model approximates the node-degree distributions of both water infrastructure networks (WDN and SSN), across spatial and hierarchical scales relevant to urban settings, and throughout their temporal evolution over several decades. These results indicate that generic mechanisms govern the networks' evolution, similar to those of scale-free networks found in nature. Deviations from the general topological patterns are indicative of (1) incomplete establishment of network hierarchies and functional network evolution, (2) capacity for growth (expansion) or densification (e.g., in-fill), and (3) likely network vulnerabilities. We discuss the implications of our findings for the (re-)design of urban infrastructure networks to enhance their resilience to external and internal threats.

A constrained joint source/channel coder design and vector quantization of nonstationary sources

NASA Technical Reports Server (NTRS)

Sayood, Khalid; Chen, Y. C.; Nori, S.; Araj, A.

1993-01-01

The emergence of broadband ISDN as the network for the future brings with it the promise of integration of all proposed services in a flexible environment. In order to achieve this flexibility, asynchronous transfer mode (ATM) has been proposed as the transfer technique. During this period a study was conducted on the bridging of network transmission performance and video coding. The successful transmission of variable bit rate video over ATM networks relies on the interaction between the video coding algorithm and the ATM networks. Two aspects of networks that determine the efficiency of video transmission are the resource allocation algorithm and the congestion control algorithm. These are explained in this report. Vector quantization (VQ) is one of the more popular compression techniques to appear in the last twenty years. Numerous compression techniques, which incorporate VQ, have been proposed. While the LBG VQ provides excellent compression, there are also several drawbacks to the use of the LBG quantizers including search complexity and memory requirements, and a mismatch between the codebook and the inputs. The latter mainly stems from the fact that the VQ is generally designed for a specific rate and a specific class of inputs. In this work, an adaptive technique is proposed for vector quantization of images and video sequences. This technique is an extension of the recursively indexed scalar quantization (RISQ) algorithm.

Short-term wind speed prediction based on the wavelet transformation and Adaboost neural network

NASA Astrophysics Data System (ADS)

Hai, Zhou; Xiang, Zhu; Haijian, Shao; Ji, Wu

2018-03-01

The operation of the power grid will be affected inevitably with the increasing scale of wind farm due to the inherent randomness and uncertainty, so the accurate wind speed forecasting is critical for the stability of the grid operation. Typically, the traditional forecasting method does not take into account the frequency characteristics of wind speed, which cannot reflect the nature of the wind speed signal changes result from the low generality ability of the model structure. AdaBoost neural network in combination with the multi-resolution and multi-scale decomposition of wind speed is proposed to design the model structure in order to improve the forecasting accuracy and generality ability. The experimental evaluation using the data from a real wind farm in Jiangsu province is given to demonstrate the proposed strategy can improve the robust and accuracy of the forecasted variable.

The General-Use Nodal Network Solver (GUNNS) Modeling Package for Space Vehicle Flow System Simulation

NASA Technical Reports Server (NTRS)

Harvey, Jason; Moore, Michael

2013-01-01

The General-Use Nodal Network Solver (GUNNS) is a modeling software package that combines nodal analysis and the hydraulic-electric analogy to simulate fluid, electrical, and thermal flow systems. GUNNS is developed by L-3 Communications under the TS21 (Training Systems for the 21st Century) project for NASA Johnson Space Center (JSC), primarily for use in space vehicle training simulators at JSC. It has sufficient compactness and fidelity to model the fluid, electrical, and thermal aspects of space vehicles in real-time simulations running on commodity workstations, for vehicle crew and flight controller training. It has a reusable and flexible component and system design, and a Graphical User Interface (GUI), providing capability for rapid GUI-based simulator development, ease of maintenance, and associated cost savings. GUNNS is optimized for NASA's Trick simulation environment, but can be run independently of Trick.

Assembly of metals and nanoparticles into novel nanocomposite superstructures

PubMed Central

Xu, Jiaquan; Chen, Lianyi; Choi, Hongseok; Konish, Hiromi; Li, Xiaochun

2013-01-01

Controlled assembly of nanoscale objects into superstructures is of tremendous interests. Many approaches have been developed to fabricate organic-nanoparticle superstructures. However, effective fabrication of inorganic-nanoparticle superstructures (such as nanoparticles linked by metals) remains a difficult challenge. Here we show a novel, general method to assemble metals and nanoparticles rationally into nanocomposite superstructures. Novel metal-nanoparticle superstructures are achieved by self-assembly of liquid metals and nanoparticles in immiscible liquids driven by reduction of free energy. Superstructures with various architectures, such as metal-core/nanoparticle-shell, nanocomposite-core/nanoparticle-shell, network of metal-linked core/shell nanostructures, and network of metal-linked nanoparticles, were successfully fabricated by simply tuning the volume ratio between nanoparticles and liquid metals. Our approach provides a simple, general way for fabrication of numerous metal-nanoparticle superstructures and enables a rational design of these novel superstructures with desired architectures for exciting applications.

[Primary Health Care in Austria - Tu Felix Austria nube - Concept for networking in the primary care of Upper Austria].

PubMed

Kriegel, Johannes; Rebhandl, Erwin; Hockl, Wolfgang; Stöbich, Anna-Maria

2017-10-01

The primary health care in rural areas in Austria is currently determined by challenges such as ageing of the population, the shift towards chronic and age-related illnesses, the specialist medical and hospital-related education and training of physicians' as well growing widespread difficulty of staffing doctor's office. The objective is to realize a general practitioner centered and team-oriented primary health care (PHC) approach by establishing networked primary health care in rural areas of Austria. Using literature research, online survey, expert interviews and expert workshops, we identified different challenges in terms of primary health care in rural areas. Further, current resources and capacities of primary health care in rural areas were identified using the example of the district of Rohrbach. Twelve design dimensions and 51 relevant measurement indicators of a PHC network were delineated and described. Based on this, 12 design approaches of PHC concept for the GP-centered and team-oriented primary health care in rural areas have been developed.

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

NASA Technical Reports Server (NTRS)

Moore, J. Strother

1992-01-01

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Construction of multi-scale consistent brain networks: methods and applications.

PubMed

Ge, Bao; Tian, Yin; Hu, Xintao; Chen, Hanbo; Zhu, Dajiang; Zhang, Tuo; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

Mapping human brain networks provides a basis for studying brain function and dysfunction, and thus has gained significant interest in recent years. However, modeling human brain networks still faces several challenges including constructing networks at multiple spatial scales and finding common corresponding networks across individuals. As a consequence, many previous methods were designed for a single resolution or scale of brain network, though the brain networks are multi-scale in nature. To address this problem, this paper presents a novel approach to constructing multi-scale common structural brain networks from DTI data via an improved multi-scale spectral clustering applied on our recently developed and validated DICCCOLs (Dense Individualized and Common Connectivity-based Cortical Landmarks). Since the DICCCOL landmarks possess intrinsic structural correspondences across individuals and populations, we employed the multi-scale spectral clustering algorithm to group the DICCCOL landmarks and their connections into sub-networks, meanwhile preserving the intrinsically-established correspondences across multiple scales. Experimental results demonstrated that the proposed method can generate multi-scale consistent and common structural brain networks across subjects, and its reproducibility has been verified by multiple independent datasets. As an application, these multi-scale networks were used to guide the clustering of multi-scale fiber bundles and to compare the fiber integrity in schizophrenia and healthy controls. In general, our methods offer a novel and effective framework for brain network modeling and tract-based analysis of DTI data.

An evaluation of the directed flow graph methodology

NASA Technical Reports Server (NTRS)

Snyder, W. E.; Rajala, S. A.

1984-01-01

The applicability of the Directed Graph Methodology (DGM) to the design and analysis of special purpose image and signal processing hardware was evaluated. A special purpose image processing system was designed and described using DGM. The design, suitable for very large scale integration (VLSI) implements a region labeling technique. Two computer chips were designed, both using metal-nitride-oxide-silicon (MNOS) technology, as well as a functional system utilizing those chips to perform real time region labeling. The system is described in terms of DGM primitives. As it is currently implemented, DGM is inappropriate for describing synchronous, tightly coupled, special purpose systems. The nature of the DGM formalism lends itself more readily to modeling networks of general purpose processors.

Using CAD/CAM to improve productivity - The IPAD approach

NASA Technical Reports Server (NTRS)

Fulton, R. E.

1981-01-01

Progress in designing and implementing CAD/CAM systems as a result of the NASA Integrated Programs for Aerospace-Vehicle Design is discussed. Essential software packages have been identified as executive, data management, general user, and geometry and graphics software. Data communication, as a means to integrate data over a network of computers of different vendors, provides data management with the capability of meeting design and manufacturing requirements of the vendors. Geometry software is dependent on developmental success with solid geometry software, which is necessary for continual measurements of, for example, a block of metal while it is being machined. Applications in the aerospace industry, such as for design, analysis, tooling, testing, quality control, etc., are outlined.

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

PubMed Central

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-01-01

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research. PMID:28353664

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

PubMed

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-03-29

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

A neural network construction method for surrogate modeling of physics-based analysis

NASA Astrophysics Data System (ADS)

Sung, Woong Je

In this thesis existing methodologies related to the developmental methods of neural networks have been surveyed and their approaches to network sizing and structuring are carefully observed. This literature review covers the constructive methods, the pruning methods, and the evolutionary methods and questions about the basic assumption intrinsic to the conventional neural network learning paradigm, which is primarily devoted to optimization of connection weights (or synaptic strengths) for the pre-determined connection structure of the network. The main research hypothesis governing this thesis is that, without breaking a prevailing dichotomy between weights and connectivity of the network during learning phase, the efficient design of a task-specific neural network is hard to achieve because, as long as connectivity and weights are searched by separate means, a structural optimization of the neural network requires either repetitive re-training procedures or computationally expensive topological meta-search cycles. The main contribution of this thesis is designing and testing a novel learning mechanism which efficiently learns not only weight parameters but also connection structure from a given training data set, and positioning this learning mechanism within the surrogate modeling practice. In this work, a simple and straightforward extension to the conventional error Back-Propagation (BP) algorithm has been formulated to enable a simultaneous learning for both connectivity and weights of the Generalized Multilayer Perceptron (GMLP) in supervised learning tasks. A particular objective is to achieve a task-specific network having reasonable generalization performance with a minimal training time. The dichotomy between architectural design and weight optimization is reconciled by a mechanism establishing a new connection for a neuron pair which has potentially higher error-gradient than one of the existing connections. Interpreting an instance of the absence of connection as a zero-weight connection, the potential contribution to training error reduction of any present or absent connection can readily be evaluated using the BP algorithm. Instead of being broken, the connections that contribute less remain frozen with constant weight values optimized to that point but they are excluded from further weight optimization until reselected. In this way, a selective weight optimization is executed only for the dynamically maintained pool of high gradient connections. By searching the rapidly changing weights and concentrating optimization resources on them, the learning process is accelerated without either a significant increase in computational cost or a need for re-training. This results in a more task-adapted network connection structure. Combined with another important criterion for the division of a neuron which adds a new computational unit to a network, a highly fitted network can be grown out of the minimal random structure. This particular learning strategy can belong to a more broad class of the variable connectivity learning scheme and the devised algorithm has been named Optimal Brain Growth (OBG). The OBG algorithm has been tested on two canonical problems; a regression analysis using the Complicated Interaction Regression Function and a classification of the Two-Spiral Problem. A comparative study with conventional Multilayer Perceptrons (MLPs) consisting of single- and double-hidden layers shows that OBG is less sensitive to random initial conditions and generalizes better with only a minimal increase in computational time. This partially proves that a variable connectivity learning scheme has great potential to enhance computational efficiency and reduce efforts to select proper network architecture. To investigate the applicability of the OBG to more practical surrogate modeling tasks, the geometry-to-pressure mapping of a particular class of airfoils in the transonic flow regime has been sought using both the conventional MLP networks with pre-defined architecture and the OBG-developed networks started from the same initial MLP networks. Considering wide variety in airfoil geometry and diversity of flow conditions distributed over a range of flow Mach numbers and angles of attack, the new method shows a great potential to capture fundamentally nonlinear flow phenomena especially related to the occurrence of shock waves on airfoil surfaces in transonic flow regime. (Abstract shortened by UMI.).

Water Hammer Simulations of MMH Propellant - New Capability Demonstration of the Generalized Fluid Flow Simulation Program

NASA Technical Reports Server (NTRS)

Burkhardt, Z.; Ramachandran, N.; Majumdar, A.

2017-01-01

Fluid Transient analysis is important for the design of spacecraft propulsion system to ensure structural stability of the system in the event of sudden closing or opening of the valve. Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code developed at NASA/MSFC is capable of simulating pressure surge due to sudden opening or closing of valve when thermodynamic properties of real fluid are available for the entire range of simulation. Specifically GFSSP needs an accurate representation of pressure-density relationship in order to predict pressure surge during a fluid transient. Unfortunately, the available thermodynamic property programs such as REFPROP, GASP or GASPAK does not provide the thermodynamic properties of Monomethylhydrazine (MMH). This paper will illustrate the process used for building a customized table of properties of state variables from available properties and speed of sound that is required by GFSSP for simulation. Good agreement was found between the simulations and measured data. This method can be adopted for modeling flow networks and systems with other fluids whose properties are not known in detail in order to obtain general technical insight. Rigorous code validation of this approach will be done and reported at a future date.

Cluster and propensity based approximation of a network

PubMed Central

2013-01-01

Background The models in this article generalize current models for both correlation networks and multigraph networks. Correlation networks are widely applied in genomics research. In contrast to general networks, it is straightforward to test the statistical significance of an edge in a correlation network. It is also easy to decompose the underlying correlation matrix and generate informative network statistics such as the module eigenvector. However, correlation networks only capture the connections between numeric variables. An open question is whether one can find suitable decompositions of the similarity measures employed in constructing general networks. Multigraph networks are attractive because they support likelihood based inference. Unfortunately, it is unclear how to adjust current statistical methods to detect the clusters inherent in many data sets. Results Here we present an intuitive and parsimonious parametrization of a general similarity measure such as a network adjacency matrix. The cluster and propensity based approximation (CPBA) of a network not only generalizes correlation network methods but also multigraph methods. In particular, it gives rise to a novel and more realistic multigraph model that accounts for clustering and provides likelihood based tests for assessing the significance of an edge after controlling for clustering. We present a novel Majorization-Minimization (MM) algorithm for estimating the parameters of the CPBA. To illustrate the practical utility of the CPBA of a network, we apply it to gene expression data and to a bi-partite network model for diseases and disease genes from the Online Mendelian Inheritance in Man (OMIM). Conclusions The CPBA of a network is theoretically appealing since a) it generalizes correlation and multigraph network methods, b) it improves likelihood based significance tests for edge counts, c) it directly models higher-order relationships between clusters, and d) it suggests novel clustering algorithms. The CPBA of a network is implemented in Fortran 95 and bundled in the freely available R package PropClust. PMID:23497424

Contagion processes on the static and activity-driven coupling networks

NASA Astrophysics Data System (ADS)

Lei, Yanjun; Jiang, Xin; Guo, Quantong; Ma, Yifang; Li, Meng; Zheng, Zhiming

2016-03-01

The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated as either static or time-varying, supposing the whole network is observed in the same time window. In this paper, we consider the epidemics spreading on a network which has both static and time-varying structures. Meanwhile, the time-varying part and the epidemic spreading are supposed to be of the same time scale. We introduce a static and activity-driven coupling (SADC) network model to characterize the coupling between the static ("strong") structure and the dynamic ("weak") structure. Epidemic thresholds of the SIS and SIR models are studied using the SADC model both analytically and numerically under various coupling strategies, where the strong structure is of homogeneous or heterogeneous degree distribution. Theoretical thresholds obtained from the SADC model can both recover and generalize the classical results in static and time-varying networks. It is demonstrated that a weak structure might make the epidemic threshold low in homogeneous networks but high in heterogeneous cases. Furthermore, we show that the weak structure has a substantive effect on the outbreak of the epidemics. This result might be useful in designing some efficient control strategies for epidemics spreading in networks.

node2vec: Scalable Feature Learning for Networks

PubMed Central

Grover, Aditya; Leskovec, Jure

2016-01-01

Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-dimensional space of features that maximizes the likelihood of preserving network neighborhoods of nodes. We define a flexible notion of a node’s network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods. Our algorithm generalizes prior work which is based on rigid notions of network neighborhoods, and we argue that the added flexibility in exploring neighborhoods is the key to learning richer representations. We demonstrate the efficacy of node2vec over existing state-of-the-art techniques on multi-label classification and link prediction in several real-world networks from diverse domains. Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks. PMID:27853626

The assessment of marine reserve networks: guidelines for ecological evaluation: Chapter 11

USGS Publications Warehouse

Grorud-Colvert, Kirsten; Claudet, Joachim; Carr, Mark; Caselle, Jennifer; Day, Jon; Friedlander, Alan M.; Lester, Sarah E.; Lison de Loma, Thierry; Tissot, Brian; Malone, Dan; Claudet, Joachim

2011-01-01

As marine ecosystems are plagued by an ever-increasing suite of threats including climate change, pollution, habitat degradation, and fisheries impacts (Roessig et al., 2004; Lotze et al., 2006; Jackson, 2008), there are now no ocean areas that are exempt from anthropogenic impacts (Halpern et al., 2008). In order to preserve marine biodiversity, ecosystem function, and the goods and services provided by resistant and/or resilient systems, marine reserves have been increasingly recommended as part of an ecosystem-based approach to management (Browman and Stergiou, 2004; Levin et al., 2009). Marine reserves are defined as “areas of the ocean completely protected from all extractive and destructive activities” (Lubchenco et al., 2003) and can be experimental controls for evaluating the impact of these activities on marine ecosystems. Growing scientific information has shown consistent increases in species density, biomass, size, and diversity in response to full protection inside reserves of varying sizes and ages located in diverse regions (Claudet et al., 2008; Lester et al., 2009; Molloy et al., 2009). However, most of these data are from individual marine reserves and therefore have inherently limited transferability to networks of marine reserves, which when properly designed can outperform single marine reserves for a variety of ecological, economic, and social management goals (Roberts et al., 2003; Almany et al., 2009; Gaines et al., 2010).The concept of marine reserve networks grew out of a desire to achieve both conservation and fishery management goals by minimizing the potential negative economic, social, and cultural impacts of a single large reserve while still producing similar or even greater ecological and economic returns (Murray et al., 1999; Gaines et al., 2010). In addition, reserves networks can provide insurance by protecting areas across a region and spreading the risk that these sites may be impacted by localized catastrophes such as hurricanes or oil spills (Allison et al., 2003). The World Conservation Union's Marine Programme defines a network as “a collection of individual marine protected areas (MPAs) or reserves operating co-operatively and synergistically, at various spatial scales and with a range of protection levels that are designed to meet objectives that a single reserve cannot achieve” (IUCN–WCPA, 2008). However, general terms such as “co-operatively” and “synergistically” can have myriad meanings. Without a clear definition of a network, it becomes difficult to identify attainable management goals and design a process for evaluating whether the network achieves those goals. Besides, different management goals may in turn result in the need for different types of networks. The use of MPAs with varying protection levels together with no-take zones in multiple-zoning schemes adds another layer of complexity to network design and evaluation; however, partially protected areas are generally used to manage coastal uses and avoid conflicts (rather than for strict ecological purposes) and are therefore a function of the local social, economic, and cultural context. As we are here interested in the ecological effects of networks, for the purposes of this chapter, we focus on marine reserves because these areas are no-take and therefore offer greater ecological benefits than other types of MPAs that allow some forms of extraction (Lester and Halpern, 2008).

Deep nets vs expert designed features in medical physics: An IMRT QA case study.

PubMed

Interian, Yannet; Rideout, Vincent; Kearney, Vasant P; Gennatas, Efstathios; Morin, Olivier; Cheung, Joey; Solberg, Timothy; Valdes, Gilmer

2018-03-30

The purpose of this study was to compare the performance of Deep Neural Networks against a technique designed by domain experts in the prediction of gamma passing rates for Intensity Modulated Radiation Therapy Quality Assurance (IMRT QA). A total of 498 IMRT plans across all treatment sites were planned in Eclipse version 11 and delivered using a dynamic sliding window technique on Clinac iX or TrueBeam Linacs. Measurements were performed using a commercial 2D diode array, and passing rates for 3%/3 mm local dose/distance-to-agreement (DTA) were recorded. Separately, fluence maps calculated for each plan were used as inputs to a convolution neural network (CNN). The CNNs were trained to predict IMRT QA gamma passing rates using TensorFlow and Keras. A set of model architectures, inspired by the convolutional blocks of the VGG-16 ImageNet model, were constructed and implemented. Synthetic data, created by rotating and translating the fluence maps during training, was created to boost the performance of the CNNs. Dropout, batch normalization, and data augmentation were utilized to help train the model. The performance of the CNNs was compared to a generalized Poisson regression model, previously developed for this application, which used 78 expert designed features. Deep Neural Networks without domain knowledge achieved comparable performance to a baseline system designed by domain experts in the prediction of 3%/3 mm Local gamma passing rates. An ensemble of neural nets resulted in a mean absolute error (MAE) of 0.70 ± 0.05 and the domain expert model resulted in a 0.74 ± 0.06. Convolutional neural networks (CNNs) with transfer learning can predict IMRT QA passing rates by automatically designing features from the fluence maps without human expert supervision. Predictions from CNNs are comparable to a system carefully designed by physicist experts. © 2018 American Association of Physicists in Medicine.

Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant

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

Kumar, Rajeeva; Kumar, Aditya; Dai, Dan

2012-12-31

This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developedmore » will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve these two formulations were developed and validated. For a given OSP problem the computation efficiency largely depends on the “size” of the problem. Initially a simplified 1-D gasifier model assuming axial and azimuthal symmetry was used to test out various OSP algorithms. Finally these algorithms were used to design the optimal sensor network for condition monitoring of IGCC gasifier refractory wear and RSC fouling. The sensors type and locations obtained as solution to the OSP problem were validated using model based sensing approach. The OSP algorithm has been developed in a modular form and has been packaged as a software tool for OSP design where a designer can explore various OSP design algorithm is a user friendly way. The OSP software tool is implemented in Matlab/Simulink© in-house. The tool also uses few optimization routines that are freely available on World Wide Web. In addition a modular Extended Kalman Filter (EKF) block has also been developed in Matlab/Simulink© which can be utilized for model based sensing of important process variables that are not directly measured through combining the online sensors with model based estimation once the hardware sensor and their locations has been finalized. The OSP algorithm details and the results of applying these algorithms to obtain optimal sensor location for condition monitoring of gasifier refractory wear and RSC fouling profile are summarized in this final report.« less

Categorization and decision-making in a neurobiologically plausible spiking network using a STDP-like learning rule.

PubMed

Beyeler, Michael; Dutt, Nikil D; Krichmar, Jeffrey L

2013-12-01

Understanding how the human brain is able to efficiently perceive and understand a visual scene is still a field of ongoing research. Although many studies have focused on the design and optimization of neural networks to solve visual recognition tasks, most of them either lack neurobiologically plausible learning rules or decision-making processes. Here we present a large-scale model of a hierarchical spiking neural network (SNN) that integrates a low-level memory encoding mechanism with a higher-level decision process to perform a visual classification task in real-time. The model consists of Izhikevich neurons and conductance-based synapses for realistic approximation of neuronal dynamics, a spike-timing-dependent plasticity (STDP) synaptic learning rule with additional synaptic dynamics for memory encoding, and an accumulator model for memory retrieval and categorization. The full network, which comprised 71,026 neurons and approximately 133 million synapses, ran in real-time on a single off-the-shelf graphics processing unit (GPU). The network was constructed on a publicly available SNN simulator that supports general-purpose neuromorphic computer chips. The network achieved 92% correct classifications on MNIST in 100 rounds of random sub-sampling, which is comparable to other SNN approaches and provides a conservative and reliable performance metric. Additionally, the model correctly predicted reaction times from psychophysical experiments. Because of the scalability of the approach and its neurobiological fidelity, the current model can be extended to an efficient neuromorphic implementation that supports more generalized object recognition and decision-making architectures found in the brain. Copyright © 2013 Elsevier Ltd. All rights reserved.

GP Networks as enablers of quality of care: implementing a practice engagement framework in a General Practice Network.

PubMed

Pearce, Christopher; Shearer, Marianne; Gardner, Karina; Kelly, Jill; Xu, Tony Baixian

2012-01-01

This paper describes how the Melbourne East General Practice Network supports general practice to enable quality of care, it describes the challenges and enablers of change, and the evidence of practice capacity building and improved quality of care. Primary care is well known as a place where quality, relatively inexpensive medical care occurs. General practice is made up of multiple small sites with fragmented systems and a funding system that challenges a whole-of-practice approach to clinical care. General Practice Networks support GPs to synthesise complexity and crystallise solutions that enhance general practice beyond current capacity. Through a culture of change management, GP Networks create the link between the practice and the big picture of the whole health system and reduce the isolation of general practice. They distribute information (evidence-based learning and resources) and provide individualised support, responding to practice need and capacity.

Neural Networks for Flight Control

NASA Technical Reports Server (NTRS)

Jorgensen, Charles C.

1996-01-01

Neural networks are being developed at NASA Ames Research Center to permit real-time adaptive control of time varying nonlinear systems, enhance the fault-tolerance of mission hardware, and permit online system reconfiguration. In general, the problem of controlling time varying nonlinear systems with unknown structures has not been solved. Adaptive neural control techniques show considerable promise and are being applied to technical challenges including automated docking of spacecraft, dynamic balancing of the space station centrifuge, online reconfiguration of damaged aircraft, and reducing cost of new air and spacecraft designs. Our experiences have shown that neural network algorithms solved certain problems that conventional control methods have been unable to effectively address. These include damage mitigation in nonlinear reconfiguration flight control, early performance estimation of new aircraft designs, compensation for damaged planetary mission hardware by using redundant manipulator capability, and space sensor platform stabilization. This presentation explored these developments in the context of neural network control theory. The discussion began with an overview of why neural control has proven attractive for NASA application domains. The more important issues in control system development were then discussed with references to significant technical advances in the literature. Examples of how these methods have been applied were given, followed by projections of emerging application needs and directions.

Frame Transmission Efficiency-Based Cross-Layer Congestion Notification Scheme in Wireless Ad Hoc Networks.

PubMed

He, Huaguang; Li, Taoshen; Feng, Luting; Ye, Jin

2017-07-15

Different from the traditional wired network, the fundamental cause of transmission congestion in wireless ad hoc networks is medium contention. How to utilize the congestion state from the MAC (Media Access Control) layer to adjust the transmission rate is core work for transport protocol design. However, recent works have shown that the existing cross-layer congestion detection solutions are too complex to be deployed or not able to characterize the congestion accurately. We first propose a new congestion metric called frame transmission efficiency (i.e., the ratio of successful transmission delay to the frame service delay), which describes the medium contention in a fast and accurate manner. We further present the design and implementation of RECN (ECN and the ratio of successful transmission delay to the frame service delay in the MAC layer, namely, the frame transmission efficiency), a general supporting scheme that adjusts the transport sending rate through a standard ECN (Explicit Congestion Notification) signaling method. Our method can be deployed on commodity switches with small firmware updates, while making no modification on end hosts. We integrate RECN transparently (i.e., without modification) with TCP on NS2 simulation. The experimental results show that RECN remarkably improves network goodput across multiple concurrent TCP flows.

Topology design and performance analysis of an integrated communication network

NASA Technical Reports Server (NTRS)

Li, V. O. K.; Lam, Y. F.; Hou, T. C.; Yuen, J. H.

1985-01-01

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.

Distributed Computer Networks in Support of Complex Group Practices

PubMed Central

Wess, Bernard P.

1978-01-01

The economics of medical computer networks are presented in context with the patient care and administrative goals of medical networks. Design alternatives and network topologies are discussed with an emphasis on medical network design requirements in distributed data base design, telecommunications, satellite systems, and software engineering. The success of the medical computer networking technology is predicated on the ability of medical and data processing professionals to design comprehensive, efficient, and virtually impenetrable security systems to protect data bases, network access and services, and patient confidentiality.

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

Design of shared unit-dose drug distribution network using multi-level particle swarm optimization.

PubMed

Chen, Linjie; Monteiro, Thibaud; Wang, Tao; Marcon, Eric

2018-03-01

Unit-dose drug distribution systems provide optimal choices in terms of medication security and efficiency for organizing the drug-use process in large hospitals. As small hospitals have to share such automatic systems for economic reasons, the structure of their logistic organization becomes a very sensitive issue. In the research reported here, we develop a generalized multi-level optimization method - multi-level particle swarm optimization (MLPSO) - to design a shared unit-dose drug distribution network. Structurally, the problem studied can be considered as a type of capacitated location-routing problem (CLRP) with new constraints related to specific production planning. This kind of problem implies that a multi-level optimization should be performed in order to minimize logistic operating costs. Our results show that with the proposed algorithm, a more suitable modeling framework, as well as computational time savings and better optimization performance are obtained than that reported in the literature on this subject.

Telerobotic system performance measurement - Motivation and methods

NASA Technical Reports Server (NTRS)

Kondraske, George V.; Khoury, George J.

1992-01-01

A systems performance-based strategy for modeling and conducting experiments relevant to the design and performance characterization of telerobotic systems is described. A developmental testbed consisting of a distributed telerobotics network and initial efforts to implement the strategy described is presented. Consideration is given to the general systems performance theory (GSPT) to tackle human performance problems as a basis for: measurement of overall telerobotic system (TRS) performance; task decomposition; development of a generic TRS model; and the characterization of performance of subsystems comprising the generic model. GSPT employs a resource construct to model performance and resource economic principles to govern the interface of systems to tasks. It provides a comprehensive modeling/measurement strategy applicable to complex systems including both human and artificial components. Application is presented within the framework of a distributed telerobotics network as a testbed. Insight into the design of test protocols which elicit application-independent data is described.

Water Hammer Simulations of Monomethylhydrazine Propellant

NASA Technical Reports Server (NTRS)

Burkhardt, Zachary; Ramachandran, N.; Majumdar, A.

2017-01-01

Fluid Transient analysis is important for the design of spacecraft propulsion system to ensure structural stability of the system in the event of sudden closing or opening of the valve. Generalized Fluid System Simulation Program (GFSSP), a general purpose flow network code developed at NASA/MSFC is capable of simulating pressure surge due to sudden opening or closing of valve when thermodynamic properties of real fluid are available for the entire range of simulation. Specifically GFSSP needs an accurate representation of pressure density relationship in order to predict pressure surge during a fluid transient. Unfortunately, the available thermodynamic property programs such as REFPROP, GASP or GASPAK do not provide the thermodynamic properties of Monomethylhydrazine(MMH). This work illustrates the process used for building a customized table of properties of state variables from available properties and speed of sound that is required by GFSSP for simulation. Good agreement was found between the simulations and measured data. This method can be adopted for modeling flow networks and systems with other fluids whose properties are not known in detail in order to obtain general technical insight.

Secure estimation, control and optimization of uncertain cyber-physical systems with applications to power networks

NASA Astrophysics Data System (ADS)

Taha, Ahmad Fayez

Transportation networks, wearable devices, energy systems, and the book you are reading now are all ubiquitous cyber-physical systems (CPS). These inherently uncertain systems combine physical phenomena with communication, data processing, control and optimization. Many CPSs are controlled and monitored by real-time control systems that use communication networks to transmit and receive data from systems modeled by physical processes. Existing studies have addressed a breadth of challenges related to the design of CPSs. However, there is a lack of studies on uncertain CPSs subject to dynamic unknown inputs and cyber-attacks---an artifact of the insertion of communication networks and the growing complexity of CPSs. The objective of this dissertation is to create secure, computational foundations for uncertain CPSs by establishing a framework to control, estimate and optimize the operation of these systems. With major emphasis on power networks, the dissertation deals with the design of secure computational methods for uncertain CPSs, focusing on three crucial issues---(1) cyber-security and risk-mitigation, (2) network-induced time-delays and perturbations and (3) the encompassed extreme time-scales. The dissertation consists of four parts. In the first part, we investigate dynamic state estimation (DSE) methods and rigorously examine the strengths and weaknesses of the proposed routines under dynamic attack-vectors and unknown inputs. In the second part, and utilizing high-frequency measurements in smart grids and the developed DSE methods in the first part, we present a risk mitigation strategy that minimizes the encountered threat levels, while ensuring the continual observability of the system through available, safe measurements. The developed methods in the first two parts rely on the assumption that the uncertain CPS is not experiencing time-delays, an assumption that might fail under certain conditions. To overcome this challenge, networked unknown input observers---observers/estimators for uncertain CPSs---are designed such that the effect of time-delays and cyber-induced perturbations are minimized, enabling secure DSE and risk mitigation in the first two parts. The final part deals with the extreme time-scales encompassed in CPSs, generally, and smart grids, specifically. Operational decisions for long time-scales can adversely affect the security of CPSs for faster time-scales. We present a model that jointly describes steady-state operation and transient stability by combining convex optimal power flow with semidefinite programming formulations of an optimal control problem. This approach can be jointly utilized with the aforementioned parts of the dissertation work, considering time-delays and DSE. The research contributions of this dissertation furnish CPS stakeholders with insights on the design and operation of uncertain CPSs, whilst guaranteeing the system's real-time safety. Finally, although many of the results of this dissertation are tailored to power systems, the results are general enough to be applied for a variety of uncertain CPSs.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Automated Design Framework for Synthetic Biology Exploiting Pareto Optimality.

PubMed

Otero-Muras, Irene; Banga, Julio R

2017-07-21

In this work we consider Pareto optimality for automated design in synthetic biology. We present a generalized framework based on a mixed-integer dynamic optimization formulation that, given design specifications, allows the computation of Pareto optimal sets of designs, that is, the set of best trade-offs for the metrics of interest. We show how this framework can be used for (i) forward design, that is, finding the Pareto optimal set of synthetic designs for implementation, and (ii) reverse design, that is, analyzing and inferring motifs and/or design principles of gene regulatory networks from the Pareto set of optimal circuits. Finally, we illustrate the capabilities and performance of this framework considering four case studies. In the first problem we consider the forward design of an oscillator. In the remaining problems, we illustrate how to apply the reverse design approach to find motifs for stripe formation, rapid adaption, and fold-change detection, respectively.

Designing optimized multi-species monitoring networks to detect range shifts driven by climate change: a case study with bats in the North of Portugal.

PubMed

Amorim, Francisco; Carvalho, Sílvia B; Honrado, João; Rebelo, Hugo

2014-01-01

Here we develop a framework to design multi-species monitoring networks using species distribution models and conservation planning tools to optimize the location of monitoring stations to detect potential range shifts driven by climate change. For this study, we focused on seven bat species in Northern Portugal (Western Europe). Maximum entropy modelling was used to predict the likely occurrence of those species under present and future climatic conditions. By comparing present and future predicted distributions, we identified areas where each species is likely to gain, lose or maintain suitable climatic space. We then used a decision support tool (the Marxan software) to design three optimized monitoring networks considering: a) changes in species likely occurrence, b) species conservation status, and c) level of volunteer commitment. For present climatic conditions, species distribution models revealed that areas suitable for most species occur in the north-eastern part of the region. However, areas predicted to become climatically suitable in the future shifted towards west. The three simulated monitoring networks, adaptable for an unpredictable volunteer commitment, included 28, 54 and 110 sampling locations respectively, distributed across the study area and covering the potential full range of conditions where species range shifts may occur. Our results show that our framework outperforms the traditional approach that only considers current species ranges, in allocating monitoring stations distributed across different categories of predicted shifts in species distributions. This study presents a straightforward framework to design monitoring schemes aimed specifically at testing hypotheses about where and when species ranges may shift with climatic changes, while also ensuring surveillance of general population trends.

Women, Work and Wages: How To Get the Job and Pay You Want. Facts on Working Women.

ERIC Educational Resources Information Center

Women's Bureau (DOL), Washington, DC.

This guide is designed to provide women job seekers with tools to help them obtain the job and salary they want and deserve. It begins with information about the labor market in general. These sources of information about jobs are described: networking; private employers; one-stop career centers; America's Job Bank; federal, state, and local…

Promoting the APS Chapter Program by Sharing Its History, Best Practices, and How-to Guide for Establishing New Chapters

ERIC Educational Resources Information Center

Hopper, Mari K.

2017-01-01

Early establishment of physiological societies in Oklahoma and Ohio demonstrated the benefits of networking physiologists and paved the way for establishing the APS Chapter Program. Designed to promote the general objectives of the APS, the Chapter Program was officially launched in 1995, with Ohio being the first recognized chapter. There are 13…

Robotic platform for traveling on vertical piping network

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

Nance, Thomas A; Vrettos, Nick J; Krementz, Daniel

This invention relates generally to robotic systems and is specifically designed for a robotic system that can navigate vertical pipes within a waste tank or similar environment. The robotic system allows a process for sampling, cleaning, inspecting and removing waste around vertical pipes by supplying a robotic platform that uses the vertical pipes to support and navigate the platform above waste material contained in the tank.

Pattern-oriented modeling of agent-based complex systems: Lessons from ecology

USGS Publications Warehouse

Grimm, Volker; Revilla, Eloy; Berger, Uta; Jeltsch, Florian; Mooij, Wolf M.; Railsback, Steven F.; Thulke, Hans-Hermann; Weiner, Jacob; Wiegand, Thorsten; DeAngelis, Donald L.

2005-01-01

Agent-based complex systems are dynamic networks of many interacting agents; examples include ecosystems, financial markets, and cities. The search for general principles underlying the internal organization of such systems often uses bottom-up simulation models such as cellular automata and agent-based models. No general framework for designing, testing, and analyzing bottom-up models has yet been established, but recent advances in ecological modeling have come together in a general strategy we call pattern-oriented modeling. This strategy provides a unifying framework for decoding the internal organization of agent-based complex systems and may lead toward unifying algorithmic theories of the relation between adaptive behavior and system complexity.

Pattern-Oriented Modeling of Agent-Based Complex Systems: Lessons from Ecology

NASA Astrophysics Data System (ADS)

Grimm, Volker; Revilla, Eloy; Berger, Uta; Jeltsch, Florian; Mooij, Wolf M.; Railsback, Steven F.; Thulke, Hans-Hermann; Weiner, Jacob; Wiegand, Thorsten; DeAngelis, Donald L.

2005-11-01

Agent-based complex systems are dynamic networks of many interacting agents; examples include ecosystems, financial markets, and cities. The search for general principles underlying the internal organization of such systems often uses bottom-up simulation models such as cellular automata and agent-based models. No general framework for designing, testing, and analyzing bottom-up models has yet been established, but recent advances in ecological modeling have come together in a general strategy we call pattern-oriented modeling. This strategy provides a unifying framework for decoding the internal organization of agent-based complex systems and may lead toward unifying algorithmic theories of the relation between adaptive behavior and system complexity.

SafeNet: a methodology for integrating general-purpose unsafe devices in safe-robot rehabilitation systems.

PubMed

Vicentini, Federico; Pedrocchi, Nicola; Malosio, Matteo; Molinari Tosatti, Lorenzo

2014-09-01

Robot-assisted neurorehabilitation often involves networked systems of sensors ("sensory rooms") and powerful devices in physical interaction with weak users. Safety is unquestionably a primary concern. Some lightweight robot platforms and devices designed on purpose include safety properties using redundant sensors or intrinsic safety design (e.g. compliance and backdrivability, limited exchange of energy). Nonetheless, the entire "sensory room" shall be required to be fail-safe and safely monitored as a system at large. Yet, sensor capabilities and control algorithms used in functional therapies require, in general, frequent updates or re-configurations, making a safety-grade release of such devices hardly sustainable in cost-effectiveness and development time. As such, promising integrated platforms for human-in-the-loop therapies could not find clinical application and manufacturing support because of lacking in the maintenance of global fail-safe properties. Under the general context of cross-machinery safety standards, the paper presents a methodology called SafeNet for helping in extending the safety rate of Human Robot Interaction (HRI) systems using unsafe components, including sensors and controllers. SafeNet considers, in fact, the robotic system as a device at large and applies the principles of functional safety (as in ISO 13489-1) through a set of architectural procedures and implementation rules. The enabled capability of monitoring a network of unsafe devices through redundant computational nodes, allows the usage of any custom sensors and algorithms, usually planned and assembled at therapy planning-time rather than at platform design-time. A case study is presented with an actual implementation of the proposed methodology. A specific architectural solution is applied to an example of robot-assisted upper-limb rehabilitation with online motion tracking. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

Functional connectivity dynamics during film viewing reveal common networks for different emotional experiences.

PubMed

Raz, Gal; Touroutoglou, Alexandra; Wilson-Mendenhall, Christine; Gilam, Gadi; Lin, Tamar; Gonen, Tal; Jacob, Yael; Atzil, Shir; Admon, Roee; Bleich-Cohen, Maya; Maron-Katz, Adi; Hendler, Talma; Barrett, Lisa Feldman

2016-08-01

Recent theoretical and empirical work has highlighted the role of domain-general, large-scale brain networks in generating emotional experiences. These networks are hypothesized to process aspects of emotional experiences that are not unique to a specific emotional category (e.g., "sadness," "happiness"), but rather that generalize across categories. In this article, we examined the dynamic interactions (i.e., changing cohesiveness) between specific domain-general networks across time while participants experienced various instances of sadness, fear, and anger. We used a novel method for probing the network connectivity dynamics between two salience networks and three amygdala-based networks. We hypothesized, and found, that the functional connectivity between these networks covaried with the intensity of different emotional experiences. Stronger connectivity between the dorsal salience network and the medial amygdala network was associated with more intense ratings of emotional experience across six different instances of the three emotion categories examined. Also, stronger connectivity between the dorsal salience network and the ventrolateral amygdala network was associated with more intense ratings of emotional experience across five out of the six different instances. Our findings demonstrate that a variety of emotional experiences are associated with dynamic interactions of domain-general neural systems.

Magnetoencephalography Reveals a Widespread Increase in Network Connectivity in Idiopathic/Genetic Generalized Epilepsy

PubMed Central

Elshahabi, Adham; Klamer, Silke; Sahib, Ashish Kaul; Lerche, Holger; Braun, Christoph; Focke, Niels K.

2015-01-01

Idiopathic/genetic generalized epilepsy (IGE/GGE) is characterized by seizures, which start and rapidly engage widely distributed networks, and result in symptoms such as absences, generalized myoclonic and primary generalized tonic-clonic seizures. Although routine magnetic resonance imaging is apparently normal, many studies have reported structural alterations in IGE/GGE patients using diffusion tensor imaging and voxel-based morphometry. Changes have also been reported in functional networks during generalized spike wave discharges. However, network function in the resting-state without epileptiforme discharges has been less well studied. We hypothesize that resting-state networks are more representative of the underlying pathophysiology and abnormal network synchrony. We studied functional network connectivity derived from whole-brain magnetoencephalography recordings in thirteen IGE/GGE and nineteen healthy controls. Using graph theoretical network analysis, we found a widespread increase in connectivity in patients compared to controls. These changes were most pronounced in the motor network, the mesio-frontal and temporal cortex. We did not, however, find any significant difference between the normalized clustering coefficients, indicating preserved gross network architecture. Our findings suggest that increased resting state connectivity could be an important factor for seizure spread and/or generation in IGE/GGE, and could serve as a biomarker for the disease. PMID:26368933

Walk-based measure of balance in signed networks: Detecting lack of balance in social networks

NASA Astrophysics Data System (ADS)

Estrada, Ernesto; Benzi, Michele

2014-10-01

There is a longstanding belief that in social networks with simultaneous friendly and hostile interactions (signed networks) there is a general tendency to a global balance. Balance represents a state of the network with a lack of contentious situations. Here we introduce a method to quantify the degree of balance of any signed (social) network. It accounts for the contribution of all signed cycles in the network and gives, in agreement with empirical evidence, more weight to the shorter cycles than to the longer ones. We found that, contrary to what is generally believed, many signed social networks, in particular very large directed online social networks, are in general very poorly balanced. We also show that unbalanced states can be changed by tuning the weights of the social interactions among the agents in the network.

Towards a Framework for Evolvable Network Design

NASA Astrophysics Data System (ADS)

Hassan, Hoda; Eltarras, Ramy; Eltoweissy, Mohamed

The layered Internet architecture that had long guided network design and protocol engineering was an “interconnection architecture” defining a framework for interconnecting networks rather than a model for generic network structuring and engineering. We claim that the approach of abstracting the network in terms of an internetwork hinders the thorough understanding of the network salient characteristics and emergent behavior resulting in impeding design evolution required to address extreme scale, heterogeneity, and complexity. This paper reports on our work in progress that aims to: 1) Investigate the problem space in terms of the factors and decisions that influenced the design and development of computer networks; 2) Sketch the core principles for designing complex computer networks; and 3) Propose a model and related framework for building evolvable, adaptable and self organizing networks We will adopt a bottom up strategy primarily focusing on the building unit of the network model, which we call the “network cell”. The model is inspired by natural complex systems. A network cell is intrinsically capable of specialization, adaptation and evolution. Subsequently, we propose CellNet; a framework for evolvable network design. We outline scenarios for using the CellNet framework to enhance legacy Internet protocol stack.

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

NASA Technical Reports Server (NTRS)

Maghami, Peiman G.; Sparks, Dean W., Jr.

1997-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Design of neural networks for fast convergence and accuracy: dynamics and control.

PubMed

Maghami, P G; Sparks, D R

2000-01-01

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

PubMed Central

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme. PMID:26690571

Application of Fuzzy-Logic Controller and Neural Networks Controller in Gas Turbine Speed Control and Overheating Control and Surge Control on Transient Performance

NASA Astrophysics Data System (ADS)

Torghabeh, A. A.; Tousi, A. M.

2007-08-01

This paper presents Fuzzy Logic and Neural Networks approach to Gas Turbine Fuel schedules. Modeling of non-linear system using feed forward artificial Neural Networks using data generated by a simulated gas turbine program is introduced. Two artificial Neural Networks are used , depicting the non-linear relationship between gas generator speed and fuel flow, and turbine inlet temperature and fuel flow respectively . Off-line fast simulations are used for engine controller design for turbojet engine based on repeated simulation. The Mamdani and Sugeno models are used to expression the Fuzzy system . The linguistic Fuzzy rules and membership functions are presents and a Fuzzy controller will be proposed to provide an Open-Loop control for the gas turbine engine during acceleration and deceleration . MATLAB Simulink was used to apply the Fuzzy Logic and Neural Networks analysis. Both systems were able to approximate functions characterizing the acceleration and deceleration schedules . Surge and Flame-out avoidance during acceleration and deceleration phases are then checked . Turbine Inlet Temperature also checked and controls by Neural Networks controller. This Fuzzy Logic and Neural Network Controllers output results are validated and evaluated by GSP software . The validation results are used to evaluate the generalization ability of these artificial Neural Networks and Fuzzy Logic controllers.

Resource constrained design of artificial neural networks using comparator neural network

NASA Technical Reports Server (NTRS)

Wah, Benjamin W.; Karnik, Tanay S.

1992-01-01

We present a systematic design method executed under resource constraints for automating the design of artificial neural networks using the back error propagation algorithm. Our system aims at finding the best possible configuration for solving the given application with proper tradeoff between the training time and the network complexity. The design of such a system is hampered by three related problems. First, there are infinitely many possible network configurations, each may take an exceedingly long time to train; hence, it is impossible to enumerate and train all of them to completion within fixed time, space, and resource constraints. Second, expert knowledge on predicting good network configurations is heuristic in nature and is application dependent, rendering it difficult to characterize fully in the design process. A learning procedure that refines this knowledge based on examples on training neural networks for various applications is, therefore, essential. Third, the objective of the network to be designed is ill-defined, as it is based on a subjective tradeoff between the training time and the network cost. A design process that proposes alternate configurations under different cost-performance tradeoff is important. We have developed a Design System which schedules the available time, divided into quanta, for testing alternative network configurations. Its goal is to select/generate and test alternative network configurations in each quantum, and find the best network when time is expended. Since time is limited, a dynamic schedule that determines the network configuration to be tested in each quantum is developed. The schedule is based on relative comparison of predicted training times of alternative network configurations using comparator network paradigm. The comparator network has been trained to compare training times for a large variety of traces of TSSE-versus-time collected during back-propagation learning of various applications.

Unsupervised learning of digit recognition using spike-timing-dependent plasticity

PubMed Central

Diehl, Peter U.; Cook, Matthew

2015-01-01

In order to understand how the mammalian neocortex is performing computations, two things are necessary; we need to have a good understanding of the available neuronal processing units and mechanisms, and we need to gain a better understanding of how those mechanisms are combined to build functioning systems. Therefore, in recent years there is an increasing interest in how spiking neural networks (SNN) can be used to perform complex computations or solve pattern recognition tasks. However, it remains a challenging task to design SNNs which use biologically plausible mechanisms (especially for learning new patterns), since most such SNN architectures rely on training in a rate-based network and subsequent conversion to a SNN. We present a SNN for digit recognition which is based on mechanisms with increased biological plausibility, i.e., conductance-based instead of current-based synapses, spike-timing-dependent plasticity with time-dependent weight change, lateral inhibition, and an adaptive spiking threshold. Unlike most other systems, we do not use a teaching signal and do not present any class labels to the network. Using this unsupervised learning scheme, our architecture achieves 95% accuracy on the MNIST benchmark, which is better than previous SNN implementations without supervision. The fact that we used no domain-specific knowledge points toward the general applicability of our network design. Also, the performance of our network scales well with the number of neurons used and shows similar performance for four different learning rules, indicating robustness of the full combination of mechanisms, which suggests applicability in heterogeneous biological neural networks. PMID:26941637

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2006-01-01

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

An FPGA design of generalized low-density parity-check codes for rate-adaptive optical transport networks

NASA Astrophysics Data System (ADS)

Zou, Ding; Djordjevic, Ivan B.

2016-02-01

Forward error correction (FEC) is as one of the key technologies enabling the next-generation high-speed fiber optical communications. In this paper, we propose a rate-adaptive scheme using a class of generalized low-density parity-check (GLDPC) codes with a Hamming code as local code. We show that with the proposed unified GLDPC decoder architecture, a variable net coding gains (NCGs) can be achieved with no error floor at BER down to 10-15, making it a viable solution in the next-generation high-speed fiber optical communications.

Microfluidic perfusion culture.

PubMed

Hattori, Koji; Sugiura, Shinji; Kanamori, Toshiyuki

2014-01-01

Microfluidic perfusion culture is a novel technique to culture animal cells in a small-scale microchamber with medium perfusion. Polydimethylsiloxane (PDMS) is the most popular material to fabricate a microfluidic perfusion culture chip. Photolithography and replica molding techniques are generally used for fabrication of a microfluidic perfusion culture chip. Pressure-driven perfusion culture system is convenient technique to carry out the perfusion culture of animal cells in a microfluidic device. Here, we describe a general theory on microfluid network design, microfabrication technique, and experimental technique for pressure-driven perfusion culture in an 8 × 8 microchamber array on a glass slide-sized microchip made out of PDMS.

Recent technical advances in general purpose mobile Satcom aviation terminals

NASA Technical Reports Server (NTRS)

Sydor, John T.

1990-01-01

A second general aviation amplitude companded single sideband (ACSSB) aeronautical terminal was developed for use with the Ontario Air Ambulance Service (OAAS). This terminal is designed to have automatic call set up and take down and to interface with the Public Service Telephone Network (PSTN) through a ground earth station hub controller. The terminal has integrated RF and microprocessor hardware which allows such functions as beam steering and automatic frequency control to be software controlled. The terminal uses a conformal patch array system to provide almost full azimuthal coverage. Antenna beam steering is executed without relying on aircraft supplied orientation information.

42 CFR 405.2110 - Designation of ESRD networks.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 42 Public Health 2 2010-10-01 2010-10-01 false Designation of ESRD networks. 405.2110 Section 405... End-Stage Renal Disease (ESRD) Services § 405.2110 Designation of ESRD networks. CMS designated ESRD networks in which the approved ESRD facilities collectively provide the necessary care for ESRD patients...

42 CFR 405.2110 - Designation of ESRD networks.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 42 Public Health 2 2011-10-01 2011-10-01 false Designation of ESRD networks. 405.2110 Section 405... End-Stage Renal Disease (ESRD) Services § 405.2110 Designation of ESRD networks. CMS designated ESRD networks in which the approved ESRD facilities collectively provide the necessary care for ESRD patients...

Research in network management techniques for tactical data communications networks

NASA Astrophysics Data System (ADS)

Boorstyn, R.; Kershenbaum, A.; Maglaris, B.; Sarachik, P.

1982-09-01

This is the final technical report for work performed on network management techniques for tactical data networks. It includes all technical papers that have been published during the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques, and local area networks.

General, crystallized and fluid intelligence are not associated with functional global network efficiency: A replication study with the human connectome project 1200 data set.

PubMed

Kruschwitz, J D; Waller, L; Daedelow, L S; Walter, H; Veer, I M

2018-05-01

One hallmark example of a link between global topological network properties of complex functional brain connectivity and cognitive performance is the finding that general intelligence may depend on the efficiency of the brain's intrinsic functional network architecture. However, although this association has been featured prominently over the course of the last decade, the empirical basis for this broad association of general intelligence and global functional network efficiency is quite limited. In the current study, we set out to replicate the previously reported association between general intelligence and global functional network efficiency using the large sample size and high quality data of the Human Connectome Project, and extended the original study by testing for separate association of crystallized and fluid intelligence with global efficiency, characteristic path length, and global clustering coefficient. We were unable to provide evidence for the proposed association between general intelligence and functional brain network efficiency, as was demonstrated by van den Heuvel et al. (2009), or for any other association with the global network measures employed. More specifically, across multiple network definition schemes, ranging from voxel-level networks to networks of only 100 nodes, no robust associations and only very weak non-significant effects with a maximal R 2 of 0.01 could be observed. Notably, the strongest (non-significant) effects were observed in voxel-level networks. We discuss the possibility that the low power of previous studies and publication bias may have led to false positive results fostering the widely accepted notion of general intelligence being associated to functional global network efficiency. Copyright © 2018 Elsevier Inc. All rights reserved.

Anti AIDS drug design with the help of neural networks

NASA Astrophysics Data System (ADS)

Tetko, I. V.; Tanchuk, V. Yu.; Luik, A. I.

1995-04-01

Artificial neural networks were used to analyze and predict the human immunodefiency virus type 1 reverse transcriptase inhibitors. Training and control set included 44 molecules (most of them are well-known substances such as AZT, TIBO, dde, etc.) The biological activities of molecules were taken from literature and rated for two classes: active and inactive compounds according to their values. We used topological indices as molecular parameters. Four most informative parameters (out of 46) were chosen using cluster analysis and original input parameters' estimation procedure and were used to predict activities of both control and new (synthesized in our institute) molecules. We applied pruning network algorithm and network ensembles to obtain the final classifier and avoid chance correlation. The increasing of neural network generalization of the data from the control set was observed, when using the aforementioned methods. The prognosis of new molecules revealed one molecule as possibly active. It was confirmed by further biological tests. The compound was as active as AZT and in order less toxic. The active compound is currently being evaluated in pre clinical trials as possible drug for anti-AIDS therapy.

Hierarchical Feedback Modules and Reaction Hubs in Cell Signaling Networks

PubMed Central

Xu, Jianfeng; Lan, Yueheng

2015-01-01

Despite much effort, identification of modular structures and study of their organizing and functional roles remain a formidable challenge in molecular systems biology, which, however, is essential in reaching a systematic understanding of large-scale cell regulation networks and hence gaining capacity of exerting effective interference to cell activity. Combining graph theoretic methods with available dynamics information, we successfully retrieved multiple feedback modules of three important signaling networks. These feedbacks are structurally arranged in a hierarchical way and dynamically produce layered temporal profiles of output signals. We found that global and local feedbacks act in very different ways and on distinct features of the information flow conveyed by signal transduction but work highly coordinately to implement specific biological functions. The redundancy embodied with multiple signal-relaying channels and feedback controls bestow great robustness and the reaction hubs seated at junctions of different paths announce their paramount importance through exquisite parameter management. The current investigation reveals intriguing general features of the organization of cell signaling networks and their relevance to biological function, which may find interesting applications in analysis, design and control of bio-networks. PMID:25951347

Cross-Domain Analogies as Relating Derived Relations among Two Separate Relational Networks

PubMed Central

Ruiz, Francisco J; Luciano, Carmen

2011-01-01

Contemporary behavior analytic research is making headway in analyzing analogy as the establishment of a relation of coordination among common types of trained or derived relations. Previous studies have been focused on within-domain analogy. The current study expands previous research by analyzing cross-domain analogy as relating relations among separate relational networks and by correlating participants' performance with a standard measure of analogical reasoning. In two experiments, adult participants first completed general intelligence and analogical reasoning tests. Subsequently, they were exposed to a computerized conditional discrimination training procedure designed to create two relational networks, each consisting of two 3-member equivalence classes. The critical test was a two-part analogical test in which participants had to relate combinatorial relations of coordination and distinction between the two relational networks. In Experiment 1, combinatorial relations for each network were individually tested prior to analogical testing, but in Experiment 2 they were not. Across both experiments, 65% of participants passed the analogical test on the first attempt. Moreover, results from the training procedure were strongly correlated with the standard measure of analogical reasoning. PMID:21547072

Clustered Numerical Data Analysis Using Markov Lie Monoid Based Networks

NASA Astrophysics Data System (ADS)

Johnson, Joseph

2016-03-01

We have designed and build an optimal numerical standardization algorithm that links numerical values with their associated units, error level, and defining metadata thus supporting automated data exchange and new levels of artificial intelligence (AI). The software manages all dimensional and error analysis and computational tracing. Tables of entities verses properties of these generalized numbers (called ``metanumbers'') support a transformation of each table into a network among the entities and another network among their properties where the network connection matrix is based upon a proximity metric between the two items. We previously proved that every network is isomorphic to the Lie algebra that generates continuous Markov transformations. We have also shown that the eigenvectors of these Markov matrices provide an agnostic clustering of the underlying patterns. We will present this methodology and show how our new work on conversion of scientific numerical data through this process can reveal underlying information clusters ordered by the eigenvalues. We will also show how the linking of clusters from different tables can be used to form a ``supernet'' of all numerical information supporting new initiatives in AI.

Analog "neuronal" networks in early vision.

PubMed Central

Koch, C; Marroquin, J; Yuille, A

1986-01-01

Many problems in early vision can be formulated in terms of minimizing a cost function. Examples are shape from shading, edge detection, motion analysis, structure from motion, and surface interpolation. As shown by Poggio and Koch [Poggio, T. & Koch, C. (1985) Proc. R. Soc. London, Ser. B 226, 303-323], quadratic variational problems, an important subset of early vision tasks, can be "solved" by linear, analog electrical, or chemical networks. However, in the presence of discontinuities, the cost function is nonquadratic, raising the question of designing efficient algorithms for computing the optimal solution. Recently, Hopfield and Tank [Hopfield, J. J. & Tank, D. W. (1985) Biol. Cybern. 52, 141-152] have shown that networks of nonlinear analog "neurons" can be effective in computing the solution of optimization problems. We show how these networks can be generalized to solve the nonconvex energy functionals of early vision. We illustrate this approach by implementing a specific analog network, solving the problem of reconstructing a smooth surface from sparse data while preserving its discontinuities. These results suggest a novel computational strategy for solving early vision problems in both biological and real-time artificial vision systems. PMID:3459172

Robust stability of interval bidirectional associative memory neural network with time delays.

PubMed

Liao, Xiaofeng; Wong, Kwok-wo

2004-04-01

In this paper, the conventional bidirectional associative memory (BAM) neural network with signal transmission delay is intervalized in order to study the bounded effect of deviations in network parameters and external perturbations. The resultant model is referred to as a novel interval dynamic BAM (IDBAM) model. By combining a number of different Lyapunov functionals with the Razumikhin technique, some sufficient conditions for the existence of unique equilibrium and robust stability are derived. These results are fairly general and can be verified easily. To go further, we extend our investigation to the time-varying delay case. Some robust stability criteria for BAM with perturbations of time-varying delays are derived. Besides, our approach for the analysis allows us to consider several different types of activation functions, including piecewise linear sigmoids with bounded activations as well as the usual C1-smooth sigmoids. We believe that the results obtained have leading significance in the design and application of BAM neural networks.

Extinction Dynamics and Control in Adaptive Networks

NASA Astrophysics Data System (ADS)

Schwartz, Ira; Shaw, Leah; Hindes, Jason

Disease control is of paramount importance in public health. Moreover, models of disease spread are an important component in implementing effective vaccination and treatment campaigns. However, human behavior in response to an outbreak has only recently been included in epidemic models on networks. Here we develop the mathematical machinery to describe the dynamics of extinction in finite populations that include human adaptive behavior. The formalism enables us to compute the optimal, fluctuation-induced path to extinction, and predict the average extinction time in adaptive networks as a function of the adaptation rate. We find that both observables have several unique scalings depending on the relative speed of infection and adaptivity. Finally, we discuss how the theory can be used to design optimal control programs in general networks, by coupling the effective force of noise with treatment and human behavior. Research supported by U.S. Naval Research Laboratory funding (Grant No. N0001414WX00023) and the Office of Naval Research (Grant No. N0001414WX20610).

Rapid neutral-neutral reactions at low temperatures: a new network and first results for TMC-1

NASA Astrophysics Data System (ADS)

Smith, Ian W. M.; Herbst, Eric; Chang, Qiang

2004-05-01

There is now ample evidence from an assortment of experiments, especially those involving the CRESU (Cinétique de Réaction en Ecoulement Supersonique Uniforme) technique, that a variety of neutral-neutral reactions possess no activation energy barrier and are quite rapid at very low temperatures. These reactions include both radical-radical systems and, more surprisingly, systems involving an atom or a radical and one `stable' species. Generalizing from the small but growing number of systems studied in the laboratory, we estimate reaction rate coefficients for a larger number of such reactions and include these estimates in a new network of gas-phase reactions for use in low-temperature interstellar chemistry. Designated osu.2003, the new network is available on the World Wide Web and will be continually updated. A table of new results for molecular abundances in the dark cloud TMC-1 (CP) is provided and compared with results from an older (new standard model; nsm) network.

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies.

PubMed

Xu, Lei; Jeavons, Peter

2015-11-01

Leader election in anonymous rings and complete networks is a very practical problem in distributed computing. Previous algorithms for this problem are generally designed for a classical message passing model where complex messages are exchanged. However, the need to send and receive complex messages makes such algorithms less practical for some real applications. We present some simple synchronous algorithms for distributed leader election in anonymous rings and complete networks that are inspired by the development of the neural system of the fruit fly. Our leader election algorithms all assume that only one-bit messages are broadcast by nodes in the network and processors are only able to distinguish between silence and the arrival of one or more messages. These restrictions allow implementations to use a simpler message-passing architecture. Even with these harsh restrictions our algorithms are shown to achieve good time and message complexity both analytically and experimentally.

DeepFix: A Fully Convolutional Neural Network for Predicting Human Eye Fixations.

PubMed

Kruthiventi, Srinivas S S; Ayush, Kumar; Babu, R Venkatesh

2017-09-01

Understanding and predicting the human visual attention mechanism is an active area of research in the fields of neuroscience and computer vision. In this paper, we propose DeepFix, a fully convolutional neural network, which models the bottom-up mechanism of visual attention via saliency prediction. Unlike classical works, which characterize the saliency map using various hand-crafted features, our model automatically learns features in a hierarchical fashion and predicts the saliency map in an end-to-end manner. DeepFix is designed to capture semantics at multiple scales while taking global context into account, by using network layers with very large receptive fields. Generally, fully convolutional nets are spatially invariant-this prevents them from modeling location-dependent patterns (e.g., centre-bias). Our network handles this by incorporating a novel location-biased convolutional layer. We evaluate our model on multiple challenging saliency data sets and show that it achieves the state-of-the-art results.

Managing RFID Sensors Networks with a General Purpose RFID Middleware

PubMed Central

Abad, Ismael; Cerrada, Carlos; Cerrada, Jose A.; Heradio, Rubén; Valero, Enrique

2012-01-01

RFID middleware is anticipated to one of the main research areas in the field of RFID applications in the near future. The Data EPC Acquisition System (DEPCAS) is an original proposal designed by our group to transfer and apply fundamental ideas from System and Data Acquisition (SCADA) systems into the areas of RFID acquisition, processing and distribution systems. In this paper we focus on how to organize and manage generic RFID sensors (edge readers, readers, PLCs, etc…) inside the DEPCAS middleware. We denote by RFID Sensors Networks Management (RSNM) this part of DEPCAS, which is built on top of two new concepts introduced and developed in this work: MARC (Minimum Access Reader Command) and RRTL (RFID Reader Topology Language). MARC is an abstraction layer used to hide heterogeneous devices inside a homogeneous acquisition network. RRTL is a language to define RFID Reader networks and to describe the relationship between them (concentrator, peer to peer, master/submaster). PMID:22969370

Once a Navegante, Always a Navegante: Latino Men Sustain Their Roles as Lay Health Advisors to Promote General and Sexual Health to Their Social Network.

PubMed

Sun, Christina J; Mann, Lilli; Eng, Eugenia; Downs, Mario; Rhodes, Scott D

2015-10-01

Little is known about the sustainability of male- and men's health-focused lay health advisors. HoMBReS Por un Cambio was a community-level social network intervention designed to improve sexual health among Latino men who were members of soccer teams. During the year after the intervention implementation, lay health advisors (Navegantes) continued to promote sexual health; over 84% (16 of the 19) Navegantes conducted 9 of 10 primary health promotion activities. Describing where to get condoms was the activity that the most Navegantes reported having conducted. Navegantes had broad reach with their social networks, although the number of Navegantes that conducted each activity differed across the categories of social network members (soccer teammates, nonteammates, and women). Results suggest that HIV-related health disparities may be addressed through lay health advisor interventions because they are sustained after the intervention ends and reach large numbers of community members.

An ACOR-Based Multi-Objective WSN Deployment Example for Lunar Surveying.

PubMed

López-Matencio, Pablo

2016-02-06

Wireless sensor networks (WSNs) can gather in situ real data measurements and work unattended for long periods, even in remote, rough places. A critical aspect of WSN design is node placement, as this determines sensing capacities, network connectivity, network lifetime and, in short, the whole operational capabilities of the WSN. This paper proposes and studies a new node placement algorithm that focus on these aspects. As a motivating example, we consider a network designed to describe the distribution of helium-3 (³He), a potential enabling element for fusion reactors, on the Moon. ³He is abundant on the Moon's surface, and knowledge of its distribution is essential for future harvesting purposes. Previous data are inconclusive, and there is general agreement that on-site measurements, obtained over a long time period, are necessary to better understand the mechanisms involved in the distribution of this element on the Moon. Although a mission of this type is extremely complex, it allows us to illustrate the main challenges involved in a multi-objective WSN placement problem, i.e., selection of optimal observation sites and maximization of the lifetime of the network. To tackle optimization, we use a recent adaptation of the ant colony optimization (ACOR) metaheuristic, extended to continuous domains. Solutions are provided in the form of a Pareto frontier that shows the optimal equilibria. Moreover, we compared our scheme with the four-directional placement (FDP) heuristic, which was outperformed in all cases.

An approach to the design of statewide or regional ground water information systems

USGS Publications Warehouse

Winter, Thomas C.

1972-01-01

The design of water information or basic data systems must be flexible enough to provide information and data for a broad range of interests from national to local. The system must satisfy the need for information for accounting, surveillance, and areal synthesis purposes. The network is designed by identifying specific needs in terms of maps, analyses, and studies that will provide the basic knowledge for understanding each particular phase of the groundwater system. Each specific need is then analyzed with respect to whether it will provide information on accounting, surveillance, or areal synthesis. If a particular type of map, analysis, or observation can serve any of these three functions, a network of data collection or a program of studies is outlined in detail that will provide the information needed. The method of design necessitates the establishment of accuracy levels for maps, the density of data points, confidence limits, and so forth. The information system should be under the general guidance of a single agency, but much of the work and responsibility to carry out the details of the system must be shared by a number of agencies.

Design framework for entanglement-distribution switching networks

NASA Astrophysics Data System (ADS)

Drost, Robert J.; Brodsky, Michael

2016-09-01

The distribution of quantum entanglement appears to be an important component of applications of quantum communications and networks. The ability to centralize the sourcing of entanglement in a quantum network can provide for improved efficiency and enable a variety of network structures. A necessary feature of an entanglement-sourcing network node comprising several sources of entangled photons is the ability to reconfigurably route the generated pairs of photons to network neighbors depending on the desired entanglement sharing of the network users at a given time. One approach to such routing is the use of a photonic switching network. The requirements for an entanglement distribution switching network are less restrictive than for typical conventional applications, leading to design freedom that can be leveraged to optimize additional criteria. In this paper, we present a mathematical framework defining the requirements of an entanglement-distribution switching network. We then consider the design of such a switching network using a number of 2 × 2 crossbar switches, addressing the interconnection of these switches and efficient routing algorithms. In particular, we define a worst-case loss metric and consider 6 × 6, 8 × 8, and 10 × 10 network designs that optimize both this metric and the number of crossbar switches composing the network. We pay particular attention to the 10 × 10 network, detailing novel results proving the optimality of the proposed design. These optimized network designs have great potential for use in practical quantum networks, thus advancing the concept of quantum networks toward reality.

The effect of a loss of model structural detail due to network skeletonization on contamination warning system design: case studies.

PubMed

Davis, Michael J; Janke, Robert

2018-01-04

The effect of limitations in the structural detail available in a network model on contamination warning system (CWS) design was examined in case studies using the original and skeletonized network models for two water distribution systems (WDSs). The skeletonized models were used as proxies for incomplete network models. CWS designs were developed by optimizing sensor placements for worst-case and mean-case contamination events. Designs developed using the skeletonized network models were transplanted into the original network model for evaluation. CWS performance was defined as the number of people who ingest more than some quantity of a contaminant in tap water before the CWS detects the presence of contamination. Lack of structural detail in a network model can result in CWS designs that (1) provide considerably less protection against worst-case contamination events than that obtained when a more complete network model is available and (2) yield substantial underestimates of the consequences associated with a contamination event. Nevertheless, CWSs developed using skeletonized network models can provide useful reductions in consequences for contaminants whose effects are not localized near the injection location. Mean-case designs can yield worst-case performances similar to those for worst-case designs when there is uncertainty in the network model. Improvements in network models for WDSs have the potential to yield significant improvements in CWS designs as well as more realistic evaluations of those designs. Although such improvements would be expected to yield improved CWS performance, the expected improvements in CWS performance have not been quantified previously. The results presented here should be useful to those responsible for the design or implementation of CWSs, particularly managers and engineers in water utilities, and encourage the development of improved network models.

The effect of a loss of model structural detail due to network skeletonization on contamination warning system design: case studies

NASA Astrophysics Data System (ADS)

Davis, Michael J.; Janke, Robert

2018-05-01

The effect of limitations in the structural detail available in a network model on contamination warning system (CWS) design was examined in case studies using the original and skeletonized network models for two water distribution systems (WDSs). The skeletonized models were used as proxies for incomplete network models. CWS designs were developed by optimizing sensor placements for worst-case and mean-case contamination events. Designs developed using the skeletonized network models were transplanted into the original network model for evaluation. CWS performance was defined as the number of people who ingest more than some quantity of a contaminant in tap water before the CWS detects the presence of contamination. Lack of structural detail in a network model can result in CWS designs that (1) provide considerably less protection against worst-case contamination events than that obtained when a more complete network model is available and (2) yield substantial underestimates of the consequences associated with a contamination event. Nevertheless, CWSs developed using skeletonized network models can provide useful reductions in consequences for contaminants whose effects are not localized near the injection location. Mean-case designs can yield worst-case performances similar to those for worst-case designs when there is uncertainty in the network model. Improvements in network models for WDSs have the potential to yield significant improvements in CWS designs as well as more realistic evaluations of those designs. Although such improvements would be expected to yield improved CWS performance, the expected improvements in CWS performance have not been quantified previously. The results presented here should be useful to those responsible for the design or implementation of CWSs, particularly managers and engineers in water utilities, and encourage the development of improved network models.

Networking for Teacher Learning: Toward a Theory of Effective Design.

ERIC Educational Resources Information Center

McDonald, Joseph P.; Klein, Emily J.

2003-01-01

Examines how teacher networks design for teacher learning, describing several dynamic tensions inherent in the designs of a sample of teacher networks and assessing the relationships of these tensions to teacher learning. The paper illustrates these design concepts with reference to the work of seven networks that aim to revamp teacher' knowledge…

On the sample complexity of learning for networks of spiking neurons with nonlinear synaptic interactions.

PubMed

Schmitt, Michael

2004-09-01

We study networks of spiking neurons that use the timing of pulses to encode information. Nonlinear interactions model the spatial groupings of synapses on the neural dendrites and describe the computations performed at local branches. Within a theoretical framework of learning we analyze the question of how many training examples these networks must receive to be able to generalize well. Bounds for this sample complexity of learning can be obtained in terms of a combinatorial parameter known as the pseudodimension. This dimension characterizes the computational richness of a neural network and is given in terms of the number of network parameters. Two types of feedforward architectures are considered: constant-depth networks and networks of unconstrained depth. We derive asymptotically tight bounds for each of these network types. Constant depth networks are shown to have an almost linear pseudodimension, whereas the pseudodimension of general networks is quadratic. Networks of spiking neurons that use temporal coding are becoming increasingly more important in practical tasks such as computer vision, speech recognition, and motor control. The question of how well these networks generalize from a given set of training examples is a central issue for their successful application as adaptive systems. The results show that, although coding and computation in these networks is quite different and in many cases more powerful, their generalization capabilities are at least as good as those of traditional neural network models.

Autonomous self-configuration of artificial neural networks for data classification or system control

NASA Astrophysics Data System (ADS)

Fink, Wolfgang

2009-05-01

Artificial neural networks (ANNs) are powerful methods for the classification of multi-dimensional data as well as for the control of dynamic systems. In general terms, ANNs consist of neurons that are, e.g., arranged in layers and interconnected by real-valued or binary neural couplings or weights. ANNs try mimicking the processing taking place in biological brains. The classification and generalization capabilities of ANNs are given by the interconnection architecture and the coupling strengths. To perform a certain classification or control task with a particular ANN architecture (i.e., number of neurons, number of layers, etc.), the inter-neuron couplings and their accordant coupling strengths must be determined (1) either by a priori design (i.e., manually) or (2) using training algorithms such as error back-propagation. The more complex the classification or control task, the less obvious it is how to determine an a priori design of an ANN, and, as a consequence, the architecture choice becomes somewhat arbitrary. Furthermore, rather than being able to determine for a given architecture directly the corresponding coupling strengths necessary to perform the classification or control task, these have to be obtained/learned through training of the ANN on test data. We report on the use of a Stochastic Optimization Framework (SOF; Fink, SPIE 2008) for the autonomous self-configuration of Artificial Neural Networks (i.e., the determination of number of hidden layers, number of neurons per hidden layer, interconnections between neurons, and respective coupling strengths) for performing classification or control tasks. This may provide an approach towards cognizant and self-adapting computing architectures and systems.

Using Neural Networks in the Mapping of Mixed Discrete/Continuous Design Spaces With Application to Structural Design

DTIC Science & Technology

1994-02-01

desired that the problem to which the design space mapping techniques were applied be easily analyzed, yet provide a design space with realistic complexity...consistent fully stressed solution. 3 DESIGN SPACE MAPPING In order to reduce the computational expense required to optimize design spaces, neural networks...employed in this study. Some of the issues involved in using neural networks to do design space mapping are how to configure the neural network, how much

Research in Network Management Techniques for Tactical Data Communications Network.

DTIC Science & Technology

1982-09-01

the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques...contro!lers are designed to perform their limited tasks optimally. For the dynamic routing problem considered here, the local controllers are node...feedback to finding in optimum stead-o-state routing (static strategies) under non - control which can be easily implemented in real time. congested

Motivation in medical education and patient communication. The EGPRN meeting in Zurich, Switzerland, October 2010.

PubMed

Rethans, Jan-Joost; Donner-Banzhoff, Norbert

2011-06-01

The European General Practice Research Network held an international research meeting on 'Motivation in medical education and patient communication' in Zürich, Switzerland, in October 2010. The two authors were keynote speakers, who introduced the theme from different angles and summarized and reflected on individual papers presented at the conference. The theme of the conference underlined the importance of communication in general practice and of motivation in medical education in particular. There were a variety of papers each addressing in its own way the topic of this meeting. We conclude that it is still uncommon to use psychological theories on motivation in research on motivation and patient communication in general practice/family medicine. Motivation and readiness to change are essential concepts in experimental health services research. Research designs increasingly follow the Framework for the Evaluation of Complex Interventions in Health Care as suggested by the British Medical Research Council. However, there are also difficulties related to classical experimental designs that have to be critically discussed.

Principles of Biomimetic Vascular Network Design Applied to a Tissue-Engineered Liver Scaffold

PubMed Central

Hoganson, David M.; Pryor, Howard I.; Spool, Ira D.; Burns, Owen H.; Gilmore, J. Randall

2010-01-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow. PMID:20001254

Principles of biomimetic vascular network design applied to a tissue-engineered liver scaffold.

PubMed

Hoganson, David M; Pryor, Howard I; Spool, Ira D; Burns, Owen H; Gilmore, J Randall; Vacanti, Joseph P

2010-05-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow.

Lag Synchronization of Switched Neural Networks via Neural Activation Function and Applications in Image Encryption.

PubMed

Wen, Shiping; Zeng, Zhigang; Huang, Tingwen; Meng, Qinggang; Yao, Wei

2015-07-01

This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The controller is dependent on the output of the system in the case of packed circuits, since it is hard to measure the inner state of the circuits. Thus, it is critical to design the controller based on the neuron activation function. Comparing the results, in this paper, with the existing ones shows that we improve and generalize the results derived in the previous literature. Several examples are also given to illustrate the effectiveness and potential applications in image encryption.

Army Warfighter Information NetworkTactical Increment 2 Procurement Quantity Not Supported for Future Army Forces (REDACTED)

DTIC Science & Technology

2016-03-01

organization, working together as one professional team, recognized as leaders in our field. For more information about whistleblower protection, please...USE ONLY FOR OFFICIAL USE ONLY Whistleblower Protection U.S. Department of Defense The Whistleblower Protection Enhancement Act of 2012 requires the...Inspector General to designate a Whistleblower Protection Ombudsman to educate agency employees about prohibitions on retaliation, and rights and

Transformer miniaturization for transcutaneous current/voltage pulse applications.

PubMed

Kolen, P T

1999-05-01

A general procedure for the design of a miniaturized step up transformer to be used in the context of surface electrode based current/voltage pulse generation is presented. It has been shown that the optimum secondary current pulse width is 4.5 tau, where tau is the time constant associated with the pulse forming network associated with the transformer/electrode interaction. This criteria has been shown to produce the highest peak to average current ratio for the secondary current pulse. The design procedure allows for the calculation of the optimum turns ratio, primary turns, and secondary turns for a given electrode load/tissue and magnetic core parameters. Two design examples for transformer optimization are presented.

The Study on Network Examinational Database based on ASP Technology

NASA Astrophysics Data System (ADS)

Zhang, Yanfu; Han, Yuexiao; Zhou, Yanshuang

This article introduces the structure of the general test base system based on .NET technology, discussing the design of the function modules and its implementation methods. It focuses on key technology of the system, proposing utilizing the WEB online editor control to solve the input problem and regular expression to solve the problem HTML code, making use of genetic algorithm to optimize test paper and the automated tools of WORD to solve the problem of exporting papers and others. Practical effective design and implementation technology can be used as reference for the development of similar systems.

On the impact of communication complexity in the design of parallel numerical algorithms

NASA Technical Reports Server (NTRS)

Gannon, D.; Vanrosendale, J.

1984-01-01

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

On the impact of communication complexity on the design of parallel numerical algorithms

NASA Technical Reports Server (NTRS)

Gannon, D. B.; Van Rosendale, J.

1984-01-01

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

BioJazz: in silico evolution of cellular networks with unbounded complexity using rule-based modeling.

PubMed

Feng, Song; Ollivier, Julien F; Swain, Peter S; Soyer, Orkun S

2015-10-30

Systems biologists aim to decipher the structure and dynamics of signaling and regulatory networks underpinning cellular responses; synthetic biologists can use this insight to alter existing networks or engineer de novo ones. Both tasks will benefit from an understanding of which structural and dynamic features of networks can emerge from evolutionary processes, through which intermediary steps these arise, and whether they embody general design principles. As natural evolution at the level of network dynamics is difficult to study, in silico evolution of network models can provide important insights. However, current tools used for in silico evolution of network dynamics are limited to ad hoc computer simulations and models. Here we introduce BioJazz, an extendable, user-friendly tool for simulating the evolution of dynamic biochemical networks. Unlike previous tools for in silico evolution, BioJazz allows for the evolution of cellular networks with unbounded complexity by combining rule-based modeling with an encoding of networks that is akin to a genome. We show that BioJazz can be used to implement biologically realistic selective pressures and allows exploration of the space of network architectures and dynamics that implement prescribed physiological functions. BioJazz is provided as an open-source tool to facilitate its further development and use. Source code and user manuals are available at: http://oss-lab.github.io/biojazz and http://osslab.lifesci.warwick.ac.uk/BioJazz.aspx. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

A neutron spectrum unfolding code based on generalized regression artificial neural networks.

PubMed

Del Rosario Martinez-Blanco, Ma; Ornelas-Vargas, Gerardo; Castañeda-Miranda, Celina Lizeth; Solís-Sánchez, Luis Octavio; Castañeda-Miranada, Rodrigo; Vega-Carrillo, Héctor René; Celaya-Padilla, Jose M; Garza-Veloz, Idalia; Martínez-Fierro, Margarita; Ortiz-Rodríguez, José Manuel

2016-11-01

The most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. Novel methods based on Artificial Neural Networks have been widely investigated. In prior works, back propagation neural networks (BPNN) have been used to solve the neutron spectrometry problem, however, some drawbacks still exist using this kind of neural nets, i.e. the optimum selection of the network topology and the long training time. Compared to BPNN, it's usually much faster to train a generalized regression neural network (GRNN). That's mainly because spread constant is the only parameter used in GRNN. Another feature is that the network will converge to a global minimum, provided that the optimal values of spread has been determined and that the dataset adequately represents the problem space. In addition, GRNN are often more accurate than BPNN in the prediction. These characteristics make GRNNs to be of great interest in the neutron spectrometry domain. This work presents a computational tool based on GRNN capable to solve the neutron spectrometry problem. This computational code, automates the pre-processing, training and testing stages using a k-fold cross validation of 3 folds, the statistical analysis and the post-processing of the information, using 7 Bonner spheres rate counts as only entrance data. The code was designed for a Bonner Spheres System based on a 6 LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

PubMed

Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

2015-04-17

The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

Design and implementation of interface units for high speed fiber optics local area networks and broadband integrated services digital networks

NASA Technical Reports Server (NTRS)

Tobagi, Fouad A.; Dalgic, Ismail; Pang, Joseph

1990-01-01

The design and implementation of interface units for high speed Fiber Optic Local Area Networks and Broadband Integrated Services Digital Networks are discussed. During the last years, a number of network adapters that are designed to support high speed communications have emerged. This approach to the design of a high speed network interface unit was to implement package processing functions in hardware, using VLSI technology. The VLSI hardware implementation of a buffer management unit, which is required in such architectures, is described.

Single-phase power distribution system power flow and fault analysis

NASA Technical Reports Server (NTRS)

Halpin, S. M.; Grigsby, L. L.

1992-01-01

Alternative methods for power flow and fault analysis of single-phase distribution systems are presented. The algorithms for both power flow and fault analysis utilize a generalized approach to network modeling. The generalized admittance matrix, formed using elements of linear graph theory, is an accurate network model for all possible single-phase network configurations. Unlike the standard nodal admittance matrix formulation algorithms, the generalized approach uses generalized component models for the transmission line and transformer. The standard assumption of a common node voltage reference point is not required to construct the generalized admittance matrix. Therefore, truly accurate simulation results can be obtained for networks that cannot be modeled using traditional techniques.

An Evaluation of Spacecraft Pointing Requirements for Optically Linked Satellite Systems

NASA Astrophysics Data System (ADS)

Gunter, B. C.; Dahl, T.

2017-12-01

Free space optical (laser) communications can offer certain advantages for many remote sensing applications, due primarily to the high data rates (Gb/s) and energy efficiences possible from such systems. An orbiting network of crosslinked satellites could potentially relay imagery and other high-volume data at near real-time intervals. To achieve this would require satellites actively tracking one or more satellites, as well as ground terminals. The narrow laser beam width utilized by the transmitting satellites pose technical challenges due to the higher pointing accuracy required for effective signal transmission, in particular if small satellites are involved. To better understand what it would take to realize such a small-satellite laser communication network, this study investigates the pointing requirements needed to support optical data links. A general method for characterizing pointing tolerance, angle rates and accelerations for line of site vectors is devised and applied to various case studies. Comparisons with state-of-the-art small satellite attitude control systems are also made to assess what is possible using current technology. The results help refine the trade space for designs for optically linked networks from the hardware aboard each satellite to the design of the satellite constellation itself.

Translating knowledge into practice and policy: the role of knowledge networks in primary health care.

PubMed

Armstrong, Kylie; Kendall, Elizabeth

The translation of information into practice is a well-recognised challenge for the health sector. In the primary healthcare sector, the last decade has seen an explosion of information generated by health systems, universities and a range of other sources. Without a system for translating that knowledge into practice and sharing it in a comprehensible form, it will remain meaningless to most practitioners. We propose the establishment of Knowledge Networks as a promising method for supporting the rapid adoption and generation of health information within the primary health care sector to advance health care services. These networks will be particularly important to the implementation of the national reform agenda, responsive decision-making and the translation of new frameworks or competencies into practice. This paper describes how interdisciplinary Knowledge Networks could be established focusing on a number of priority health research areas. Local Knowledge Networks would be used as a platform to support a collaborative web of evidence designed to influence health policy and planning. Our experience with Knowledge Networks indicates that they must be comprised of health professionals from Divisions of General Practice, researchers, policy-makers, consumers, government and non-government sectors. This paper will describe these networks and show how they might support the translation of knowledge into practice, thus driving systematic and institutional change.

Model validation of simple-graph representations of metabolism

PubMed Central

Holme, Petter

2009-01-01

The large-scale properties of chemical reaction systems, such as metabolism, can be studied with graph-based methods. To do this, one needs to reduce the information, lists of chemical reactions, available in databases. Even for the simplest type of graph representation, this reduction can be done in several ways. We investigate different simple network representations by testing how well they encode information about one biologically important network structure—network modularity (the propensity for edges to be clustered into dense groups that are sparsely connected between each other). To achieve this goal, we design a model of reaction systems where network modularity can be controlled and measure how well the reduction to simple graphs captures the modular structure of the model reaction system. We find that the network types that best capture the modular structure of the reaction system are substrate–product networks (where substrates are linked to products of a reaction) and substance networks (with edges between all substances participating in a reaction). Furthermore, we argue that the proposed model for reaction systems with tunable clustering is a general framework for studies of how reaction systems are affected by modularity. To this end, we investigate statistical properties of the model and find, among other things, that it recreates correlations between degree and mass of the molecules. PMID:19158012

Do deep convolutional neural networks really need to be deep when applied for remote scene classification?

NASA Astrophysics Data System (ADS)

Luo, Chang; Wang, Jie; Feng, Gang; Xu, Suhui; Wang, Shiqiang

2017-10-01

Deep convolutional neural networks (CNNs) have been widely used to obtain high-level representation in various computer vision tasks. However, for remote scene classification, there are not sufficient images to train a very deep CNN from scratch. From two viewpoints of generalization power, we propose two promising kinds of deep CNNs for remote scenes and try to find whether deep CNNs need to be deep for remote scene classification. First, we transfer successful pretrained deep CNNs to remote scenes based on the theory that depth of CNNs brings the generalization power by learning available hypothesis for finite data samples. Second, according to the opposite viewpoint that generalization power of deep CNNs comes from massive memorization and shallow CNNs with enough neural nodes have perfect finite sample expressivity, we design a lightweight deep CNN (LDCNN) for remote scene classification. With five well-known pretrained deep CNNs, experimental results on two independent remote-sensing datasets demonstrate that transferred deep CNNs can achieve state-of-the-art results in an unsupervised setting. However, because of its shallow architecture, LDCNN cannot obtain satisfactory performance, regardless of whether in an unsupervised, semisupervised, or supervised setting. CNNs really need depth to obtain general features for remote scenes. This paper also provides baseline for applying deep CNNs to other remote sensing tasks.

Integrated design of multivariable hydrometric networks using entropy theory with a multiobjective optimization approach

NASA Astrophysics Data System (ADS)

Kim, Y.; Hwang, T.; Vose, J. M.; Martin, K. L.; Band, L. E.

2016-12-01

Obtaining quality hydrologic observations is the first step towards a successful water resources management. While remote sensing techniques have enabled to convert satellite images of the Earth's surface to hydrologic data, the importance of ground-based observations has never been diminished because in-situ data are often highly accurate and can be used to validate remote measurements. The existence of efficient hydrometric networks is becoming more important to obtain as much as information with minimum redundancy. The World Meteorological Organization (WMO) has recommended a guideline for the minimum hydrometric network density based on physiography; however, this guideline is not for the optimum network design but for avoiding serious deficiency from a network. Moreover, all hydrologic variables are interconnected within the hydrologic cycle, while monitoring networks have been designed individually. This study proposes an integrated network design method using entropy theory with a multiobjective optimization approach. In specific, a precipitation and a streamflow networks in a semi-urban watershed in Ontario, Canada were designed simultaneously by maximizing joint entropy, minimizing total correlation, and maximizing conditional entropy of streamflow network given precipitation network. After comparing with the typical individual network designs, the proposed design method would be able to determine more efficient optimal networks by avoiding the redundant stations, in which hydrologic information is transferable. Additionally, four quantization cases were applied in entropy calculations to assess their implications on the station rankings and the optimal networks. The results showed that the selection of quantization method should be considered carefully because the rankings and optimal networks are subject to change accordingly.

Integrated design of multivariable hydrometric networks using entropy theory with a multiobjective optimization approach

NASA Astrophysics Data System (ADS)

Keum, J.; Coulibaly, P. D.

2017-12-01

Obtaining quality hydrologic observations is the first step towards a successful water resources management. While remote sensing techniques have enabled to convert satellite images of the Earth's surface to hydrologic data, the importance of ground-based observations has never been diminished because in-situ data are often highly accurate and can be used to validate remote measurements. The existence of efficient hydrometric networks is becoming more important to obtain as much as information with minimum redundancy. The World Meteorological Organization (WMO) has recommended a guideline for the minimum hydrometric network density based on physiography; however, this guideline is not for the optimum network design but for avoiding serious deficiency from a network. Moreover, all hydrologic variables are interconnected within the hydrologic cycle, while monitoring networks have been designed individually. This study proposes an integrated network design method using entropy theory with a multiobjective optimization approach. In specific, a precipitation and a streamflow networks in a semi-urban watershed in Ontario, Canada were designed simultaneously by maximizing joint entropy, minimizing total correlation, and maximizing conditional entropy of streamflow network given precipitation network. After comparing with the typical individual network designs, the proposed design method would be able to determine more efficient optimal networks by avoiding the redundant stations, in which hydrologic information is transferable. Additionally, four quantization cases were applied in entropy calculations to assess their implications on the station rankings and the optimal networks. The results showed that the selection of quantization method should be considered carefully because the rankings and optimal networks are subject to change accordingly.

Autonomous evolution of topographic regularities in artificial neural networks.

PubMed

Gauci, Jason; Stanley, Kenneth O

2010-07-01

Looking to nature as inspiration, for at least the past 25 years, researchers in the field of neuroevolution (NE) have developed evolutionary algorithms designed specifically to evolve artificial neural networks (ANNs). Yet the ANNs evolved through NE algorithms lack the distinctive characteristics of biological brains, perhaps explaining why NE is not yet a mainstream subject of neural computation. Motivated by this gap, this letter shows that when geometry is introduced to evolved ANNs through the hypercube-based neuroevolution of augmenting topologies algorithm, they begin to acquire characteristics that indeed are reminiscent of biological brains. That is, if the neurons in evolved ANNs are situated at locations in space (i.e., if they are given coordinates), then, as experiments in evolving checkers-playing ANNs in this letter show, topographic maps with symmetries and regularities can evolve spontaneously. The ability to evolve such maps is shown in this letter to provide an important advantage in generalization. In fact, the evolved maps are sufficiently informative that their analysis yields the novel insight that the geometry of the connectivity patterns of more general players is significantly smoother and more contiguous than less general ones. Thus, the results reveal a correlation between generality and smoothness in connectivity patterns. They also hint at the intriguing possibility that as NE matures as a field, its algorithms can evolve ANNs of increasing relevance to those who study neural computation in general.

F77NNS - A FORTRAN-77 NEURAL NETWORK SIMULATOR

NASA Technical Reports Server (NTRS)

Mitchell, P. H.

1994-01-01

F77NNS (A FORTRAN-77 Neural Network Simulator) simulates the popular back error propagation neural network. F77NNS is an ANSI-77 FORTRAN program designed to take advantage of vectorization when run on machines having this capability, but it will run on any computer with an ANSI-77 FORTRAN Compiler. Artificial neural networks are formed from hundreds or thousands of simulated neurons, connected to each other in a manner similar to biological nerve cells. Problems which involve pattern matching or system modeling readily fit the class of problems which F77NNS is designed to solve. The program's formulation trains a neural network using Rumelhart's back-propagation algorithm. Typically the nodes of a network are grouped together into clumps called layers. A network will generally have an input layer through which the various environmental stimuli are presented to the network, and an output layer for determining the network's response. The number of nodes in these two layers is usually tied to features of the problem being solved. Other layers, which form intermediate stops between the input and output layers, are called hidden layers. The back-propagation training algorithm can require massive computational resources to implement a large network such as a network capable of learning text-to-phoneme pronunciation rules as in the famous Sehnowski experiment. The Sehnowski neural network learns to pronounce 1000 common English words. The standard input data defines the specific inputs that control the type of run to be made, and input files define the NN in terms of the layers and nodes, as well as the input/output (I/O) pairs. The program has a restart capability so that a neural network can be solved in stages suitable to the user's resources and desires. F77NNS allows the user to customize the patterns of connections between layers of a network. The size of the neural network to be solved is limited only by the amount of random access memory (RAM) available to the user. The program has a memory requirement of about 900K. The standard distribution medium for this package is a .25 inch streaming magnetic tape cartridge in UNIX tar format. It is also available on a 3.5 inch diskette in UNIX tar format. F77NNS was developed in 1989.

Link and Network Layers Design for Ultra-High-Speed Terahertz-Band Communications Networks

DTIC Science & Technology

2017-01-01

throughput, and identify the optimal parameter values for their design (Sec. 6.2.3). Moreover, we validate and test the scheme with experimental data obtained...LINK AND NETWORK LAYERS DESIGN FOR ULTRA-HIGH- SPEED TERAHERTZ-BAND COMMUNICATIONS NETWORKS STATE UNIVERSITY OF NEW YORK (SUNY) AT BUFFALO JANUARY...TYPE FINAL TECHNICAL REPORT 3. DATES COVERED (From - To) FEB 2015 – SEP 2016 4. TITLE AND SUBTITLE LINK AND NETWORK LAYERS DESIGN FOR ULTRA-HIGH

On designing of a low leakage patient-centric provider network.

PubMed

Zheng, Yuchen; Lin, Kun; White, Thomas; Pickreign, Jeremy; Yuen-Reed, Gigi

2018-03-27

When a patient in a provider network seeks services outside of their community, the community experiences a leakage. Leakage is undesirable as it typically leads to higher out-of-network cost for patient and increases barrier for care coordination, which is particularly problematic for Accountable Care Organization (ACO) as the in-network providers are financially responsible for quality of care and outcome. We aim to design a data-driven method to identify naturally occurring provider networks driven by diabetic patient choices, and understand the relationship among provider composition, patient composition, and service leakage pattern. By doing so, we learn the features of low service leakage provider networks that can be generalized to different patient population. Data used for this study include de-identified healthcare insurance administrative data acquired from Capital District Physicians' Health Plan (CDPHP) for diabetic patients who resided in four New York state counties (Albany, Rensselaer, Saratoga, and Schenectady) in 2014. We construct a healthcare provider network based on patients' historical medical insurance claims. A community detection algorithm is used to identify naturally occurring communities of collaborating providers. For each detected community, a profile is built using several new key measures to elucidate stakeholders of our findings. Finally, import-export analysis is conducted to benchmark their leakage pattern and identify further leakage reduction opportunity. The design yields six major provider communities with diverse profiles. Some communities are geographically concentrated, while others tend to draw patients with certain diabetic co-morbidities. Providers from the same healthcare institution are likely to be assigned to the same community. While most communities have high within-community utilization and spending, at 85% and 86% respectively, leakage still persists. Hence, we utilize a metric from import-export analysis to detect leakage, gaining insight on how to minimize leakage. We identify patient-driven provider organization by surfacing providers who share a large number of patients. By analyzing the import-export behavior of each identified community using a novel approach and profiling community patient and provider composition we understand the key features of having a balanced number of PCP and specialists and provider heterogeneity.

The measurement procedure in the SEMONT monitoring system.

PubMed

Djuric, Nikola; Kljajic, Dragan; Kasas-Lazetic, Karolina; Bajovic, Vera

2014-03-01

The measurement procedure of the open area in situ electric field strength is presented, acquiring the real field data for testing of the Serbian electromagnetic field monitoring network (SEMONT) and its Internet portal. The SEMONT monitoring system introduces an advanced approach of wireless sensor network utilization for the continuous supervision of overall and cumulative level of electromagnetic field over the observed area. The aim of the SEMONT system is to become a useful tool for the national and municipal agencies for the environmental protection, regarding the electromagnetic pollution monitoring and the exposure assessment of the general population. Considering the public concern on the potentially harmful effects of the long-term exposure to electromagnetic radiation, as well as the public transparency principle that is incorporated into the Serbian law on non-ionizing radiation protection, the SEMONT monitoring system is designed for the long-term continuous monitoring, presenting real-time measurement results, and corresponding exposure assessment over the public Internet network.

NasoNet, modeling the spread of nasopharyngeal cancer with networks of probabilistic events in discrete time.

PubMed

Galán, S F; Aguado, F; Díez, F J; Mira, J

2002-07-01

The spread of cancer is a non-deterministic dynamic process. As a consequence, the design of an assistant system for the diagnosis and prognosis of the extent of a cancer should be based on a representation method that deals with both uncertainty and time. The ultimate goal is to know the stage of development of a cancer in a patient before selecting the appropriate treatment. A network of probabilistic events in discrete time (NPEDT) is a type of Bayesian network for temporal reasoning that models the causal mechanisms associated with the time evolution of a process. This paper describes NasoNet, a system that applies NPEDTs to the diagnosis and prognosis of nasopharyngeal cancer. We have made use of temporal noisy gates to model the dynamic causal interactions that take place in the domain. The methodology we describe is general enough to be applied to any other type of cancer.

An energy-aware routing protocol for query-based applications in wireless sensor networks.

PubMed

Ahvar, Ehsan; Ahvar, Shohreh; Lee, Gyu Myoung; Crespi, Noel

2014-01-01

Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

Integrated modelling for the evaluation of infiltration effects.

PubMed

Schulz, N; Baur, R; Krebs, P

2005-01-01

The objective of the present study is the estimation of the potential benefits of sewer pipe rehabilitation for the performance of the drainage system and the wastewater treatment plant (WWTP) as well as for the receiving water quality. The relation of sewer system status and the infiltration rate is assessed based on statistical analysis of 470 km of CCTV (Closed Circuit Television) inspected sewers of the city of Dresden. The potential reduction of infiltration rates and the consequent performance improvements of the urban wastewater system are simulated as a function of rehabilitation activities in the network. The integrated model is applied to an artificial system with input from a real sewer network. In this paper, the general design of the integrated model and its data requirements are presented. For an exemplary study, the consequences of the simulations are discussed with respect to the prioritisation of rehabilitation activities in the network.

An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

PubMed Central

Crespi, Noel

2014-01-01

Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption. PMID:24696640

Competing actors in the climate change arena in Mexico: A network analysis.

PubMed

Ortega Díaz, Araceli; Gutiérrez, Erika Casamadrid

2018-06-01

This paper analyzes the actors in the climate change arena and their influence in directing Mexico toward policies that decrease greenhouse gas emissions, such as the carbon tax and climate change law. The network analysis of the agreement of these laws and public policies in Mexico is a lesson for any country that is in the process of designing and adopting environmental laws. The research is performed using a network analysis that is derived from interviews with various main actors and a discourse analysis of the media. Results show that actors do not coordinate their efforts-they meet frequently but in different inter-ministerial commissions-and do not enforce the same policies. The actors in the industry have formed strong coalitions against the carbon tax and the General Law on Climate Change, whereas international institutions have formed coalitions that support these policies and laws. Copyright © 2018 Elsevier Ltd. All rights reserved.

Collaborative filtering on a family of biological targets.

PubMed

Erhan, Dumitru; L'heureux, Pierre-Jean; Yue, Shi Yi; Bengio, Yoshua

2006-01-01

Building a QSAR model of a new biological target for which few screening data are available is a statistical challenge. However, the new target may be part of a bigger family, for which we have more screening data. Collaborative filtering or, more generally, multi-task learning, is a machine learning approach that improves the generalization performance of an algorithm by using information from related tasks as an inductive bias. We use collaborative filtering techniques for building predictive models that link multiple targets to multiple examples. The more commonalities between the targets, the better the multi-target model that can be built. We show an example of a multi-target neural network that can use family information to produce a predictive model of an undersampled target. We evaluate JRank, a kernel-based method designed for collaborative filtering. We show their performance on compound prioritization for an HTS campaign and the underlying shared representation between targets. JRank outperformed the neural network both in the single- and multi-target models.

Modeling Two-Phase Flow and Vapor Cycles Using the Generalized Fluid System Simulation Program

NASA Technical Reports Server (NTRS)

Smith, Amanda D.; Majumdar, Alok K.

2017-01-01

This work presents three new applications for the general purpose fluid network solver code GFSSP developed at NASA's Marshall Space Flight Center: (1) cooling tower, (2) vapor-compression refrigeration system, and (3) vapor-expansion power generation system. These systems are widely used across engineering disciplines in a variety of energy systems, and these models expand the capabilities and the use of GFSSP to include fluids and features that are not part of its present set of provided examples. GFSSP provides pressure, temperature, and species concentrations at designated locations, or nodes, within a fluid network based on a finite volume formulation of thermodynamics and conservation laws. This paper describes the theoretical basis for the construction of the models, their implementation in the current GFSSP modeling system, and a brief evaluation of the usefulness of the model results, as well as their applicability toward a broader spectrum of analytical problems in both university teaching and engineering research.

How the contagion at links influences epidemic spreading

NASA Astrophysics Data System (ADS)

Ruan, Zhongyuan; Tang, Ming; Liu, Zonghua

2013-04-01

The reaction-diffusion (RD) model of epidemic spreading generally assume that contagion occurs only at the nodes of network, i.e., the links are used only for migration/diffusion of agents. However, in reality, we observe that contagion occurs also among the travelers staying in the same car, train or plane etc., which consist of the links of network. To reflect the contagious effect of links, we here present a traveling-contagion model where contagion occurs not only at nodes but also at links. Considering that the population density in transportation is generally much larger than that in districts, we introduce different infection rates for the nodes and links, respectively, whose two extreme cases correspond to the type-I and type-II reactions in the RD model [V. Colizza, R. Pastor-Satorras, A. Vespignani, Nat. Phys. 3, 276 (2007)]. Through studying three typical diffusion processes, we reveal both numerically and theoretically that the contagion at links can accelerate significantly the epidemic spreading. This finding is helpful in designing the controlling strategies of epidemic spreading.

Depression and unemployment incidence rate evolution in Portugal, 1995-2013: General Practitioner Sentinel Network data.

PubMed

Rodrigues, Ana Paula; Sousa-Uva, Mafalda; Fonseca, Rita; Marques, Sara; Pina, Nuno; Matias-Dias, Carlos

2017-11-17

Quantify, for both genders, the correlation between the depression incidence rate and the unemployment rate in Portugal between 1995 and 2013. An ecological study was developed to correlate the evolution of the depression incidence rates estimated by the General Practitioner Sentinel Network and the annual unemployment rates provided by the National Statistical Institute in official publications. There was a positive correlation between the depression incidence rate and the unemployment rate in Portugal, which was significant only for males (R2 = 0.83, p = 0.04). For this gender, an increase of 37 new cases of depression per 100,000 inhabitants was estimated for each 1% increase in the unemployment rate between 1995 and 2013. Although the study design does not allow the establishment of a causal association between unemployment and depression, the results suggest that the evolution of unemployment in Portugal may have had a significant impact on the level of mental health of the Portuguese, especially among men.

78 FR 8686 - Establishment of the National Freight Network

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-06

... Network AGENCY: Federal Highway Administration (FHWA), DOT. ACTION: Notice. SUMMARY: This notice defines the planned process for the designation of the national freight network as required by Section 1115 of... the initial designation of the primary freight network, the designation of additional miles critical...

A Glider-Assisted Link Disruption Restoration Mechanism in Underwater Acoustic Sensor Networks.

PubMed

Jin, Zhigang; Wang, Ning; Su, Yishan; Yang, Qiuling

2018-02-07

Underwater acoustic sensor networks (UASNs) have become a hot research topic. In UASNs, nodes can be affected by ocean currents and external forces, which could result in sudden link disruption. Therefore, designing a flexible and efficient link disruption restoration mechanism to ensure the network connectivity is a challenge. In the paper, we propose a glider-assisted restoration mechanism which includes link disruption recognition and related link restoring mechanism. In the link disruption recognition mechanism, the cluster heads collect the link disruption information and then schedule gliders acting as relay nodes to restore the disrupted link. Considering the glider's sawtooth motion, we design a relay location optimization algorithm with a consideration of both the glider's trajectory and acoustic channel attenuation model. The utility function is established by minimizing the channel attenuation and the optimal location of glider is solved by a multiplier method. The glider-assisted restoration mechanism can greatly improve the packet delivery rate and reduce the communication energy consumption and it is more general for the restoration of different link disruption scenarios. The simulation results show that glider-assisted restoration mechanism can improve the delivery rate of data packets by 15-33% compared with cooperative opportunistic routing (OVAR), the hop-by-hop vector-based forwarding (HH-VBF) and the vector based forward (VBF) methods, and reduce communication energy consumption by 20-58% for a typical network's setting.

Mathematical inference and control of molecular networks from perturbation experiments

NASA Astrophysics Data System (ADS)

Mohammed-Rasheed, Mohammed

One of the main challenges facing biologists and mathematicians in the post genomic era is to understand the behavior of molecular networks and harness this understanding into an educated intervention of the cell. The cell maintains its function via an elaborate network of interconnecting positive and negative feedback loops of genes, RNA and proteins that send different signals to a large number of pathways and molecules. These structures are referred to as genetic regulatory networks (GRNs) or molecular networks. GRNs can be viewed as dynamical systems with inherent properties and mechanisms, such as steady-state equilibriums and stability, that determine the behavior of the cell. The biological relevance of the mathematical concepts are important as they may predict the differentiation of a stem cell, the maintenance of a normal cell, the development of cancer and its aberrant behavior, and the design of drugs and response to therapy. Uncovering the underlying GRN structure from gene/protein expression data, e.g., microarrays or perturbation experiments, is called inference or reverse engineering of the molecular network. Because of the high cost and time consuming nature of biological experiments, the number of available measurements or experiments is very small compared to the number of molecules (genes, RNA and proteins). In addition, the observations are noisy, where the noise is due to the measurements imperfections as well as the inherent stochasticity of genetic expression levels. Intra-cellular activities and extra-cellular environmental attributes are also another source of variability. Thus, the inference of GRNs is, in general, an under-determined problem with a highly noisy set of observations. The ultimate goal of GRN inference and analysis is to be able to intervene within the network, in order to force it away from undesirable cellular states and into desirable ones. However, it remains a major challenge to design optimal intervention strategies in order to affect the time evolution of molecular activity in a desirable manner. In this proposal, we address both the inference and control problems of GRNs. In the first part of the thesis, we consider the control problem. We assume that we are given a general topology network structure, whose dynamics follow a discrete-time Markov chain model. We subsequently develop a comprehensive framework for optimal perturbation control of the network. The aim of the perturbation is to drive the network away from undesirable steady-states and to force it to converge to a unique desirable steady-state. The proposed framework does not make any assumptions about the topology of the initial network (e.g., ergodicity, weak and strong connectivity), and is thus applicable to general topology networks. We define the optimal perturbation as the minimum-energy perturbation measured in terms of the Frobenius norm between the initial and perturbed networks. We subsequently demonstrate that there exists at most one optimal perturbation that forces the network into the desirable steady-state. In the event where the optimal perturbation does not exist, we construct a family of sub-optimal perturbations that approximate the optimal solution arbitrarily closely. In the second part of the thesis, we address the inference problem of GRNs from time series data. We model the dynamics of the molecules using a system of ordinary differential equations corrupted by additive white noise. For large-scale networks, we formulate the inference problem as a constrained maximum likelihood estimation problem. We derive the molecular interactions that maximize the likelihood function while constraining the network to be sparse. We further propose a procedure to recover weak interactions based on the Bayesian information criterion. For small-size networks, we investigated the inference of a globally stable 7-gene melanoma genetic regulatory network from genetic perturbation experiments. We considered five melanoma cell lines, who exhibit different motility/invasion behavior under the same perturbation experiment of gene Wnt5a. The results of the simulations validate both the steady state levels and the experimental data of the perturbation experiments of all five cell lines. The goal of this study is to answer important questions that link the response of the network to perturbations, as measured by the experiments, to its structure, i.e., connectivity. Answers to these questions shed novel insights on the structure of networks and how they react to perturbations.

Robust Network Design - Connectivity and Beyond

DTIC Science & Technology

2015-01-15

utilize a heterogeneous set of physical links (RF, Optical/Laser and SATCOM), for interconnecting a set of terrestrial, space and highly mobile airborne...design of mobility patterns of airborne platforms to provide stable operating conditions,  the design of networks that enable graceful performance...research effort, Airborne Network research was primarily directed towards Mobile Ad-hoc Networks (MANET). From our experience in design and

Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

NASA Astrophysics Data System (ADS)

Luo, Ming-Xing

2018-04-01

The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks. In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks. These nonlinear inequalities are related to the matching problem of an equivalent unweighted bipartite graph that allows constructing a polynomial-time algorithm. For the quantum resources consisting of bipartite entangled pure states and generalized Greenberger-Horne-Zeilinger (GHZ) states, we prove the generic nonmultilocality of quantum networks with multiple independent observers using new Bell inequalities. The violations are maximal with respect to the presented Tsirelson's bound for Einstein-Podolsky-Rosen states and GHZ states. Moreover, these violations hold for Werner states or some general noisy states. Our results suggest that the presented Bell inequalities can be used to characterize experimental quantum networks.

Verifying Stability of Dynamic Soft-Computing Systems

NASA Technical Reports Server (NTRS)

Wen, Wu; Napolitano, Marcello; Callahan, John

1997-01-01

Soft computing is a general term for algorithms that learn from human knowledge and mimic human skills. Example of such algorithms are fuzzy inference systems and neural networks. Many applications, especially in control engineering, have demonstrated their appropriateness in building intelligent systems that are flexible and robust. Although recent research have shown that certain class of neuro-fuzzy controllers can be proven bounded and stable, they are implementation dependent and difficult to apply to the design and validation process. Many practitioners adopt the trial and error approach for system validation or resort to exhaustive testing using prototypes. In this paper, we describe our on-going research towards establishing necessary theoretic foundation as well as building practical tools for the verification and validation of soft-computing systems. A unified model for general neuro-fuzzy system is adopted. Classic non-linear system control theory and recent results of its applications to neuro-fuzzy systems are incorporated and applied to the unified model. It is hoped that general tools can be developed to help the designer to visualize and manipulate the regions of stability and boundedness, much the same way Bode plots and Root locus plots have helped conventional control design and validation.

SensoTube: A Scalable Hardware Design Architecture for Wireless Sensors and Actuators Networks Nodes in the Agricultural Domain.

PubMed

Piromalis, Dimitrios; Arvanitis, Konstantinos

2016-08-04

Wireless Sensor and Actuators Networks (WSANs) constitute one of the most challenging technologies with tremendous socio-economic impact for the next decade. Functionally and energy optimized hardware systems and development tools maybe is the most critical facet of this technology for the achievement of such prospects. Especially, in the area of agriculture, where the hostile operating environment comes to add to the general technological and technical issues, reliable and robust WSAN systems are mandatory. This paper focuses on the hardware design architectures of the WSANs for real-world agricultural applications. It presents the available alternatives in hardware design and identifies their difficulties and problems for real-life implementations. The paper introduces SensoTube, a new WSAN hardware architecture, which is proposed as a solution to the various existing design constraints of WSANs. The establishment of the proposed architecture is based, firstly on an abstraction approach in the functional requirements context, and secondly, on the standardization of the subsystems connectivity, in order to allow for an open, expandable, flexible, reconfigurable, energy optimized, reliable and robust hardware system. The SensoTube implementation reference model together with its encapsulation design and installation are analyzed and presented in details. Furthermore, as a proof of concept, certain use cases have been studied in order to demonstrate the benefits of migrating existing designs based on the available open-source hardware platforms to SensoTube architecture.

Design of a ground-water-quality monitoring network for the Salinas River basin, California

USGS Publications Warehouse

Showalter, P.K.; Akers, J.P.; Swain, L.A.

1984-01-01

A regional ground-water quality monitoring network for the entire Salinas River drainage basin was designed to meet the needs of the California State Water Resources Control Board. The project included phase 1--identifying monitoring networks that exist in the region; phase 2--collecting information about the wells in each network; and phase 3--studying the factors--such as geology, land use, hydrology, and geohydrology--that influence the ground-water quality, and designing a regional network. This report is the major product of phase 3. Based on the authors ' understanding of the ground-water-quality monitoring system and input from local offices, an ideal network was designed. The proposed network includes 317 wells and 8 stream-gaging stations. Because limited funds are available to implement the monitoring network, the proposed network is designed to correspond to the ideal network insofar as practicable, and is composed mainly of 214 wells that are already being monitored by a local agency. In areas where network wells are not available, arrangements will be made to add wells to local networks. The data collected by this network will be used to assess the ground-water quality of the entire Salinas River drainage basin. After 2 years of data are collected, the network will be evaluated to test whether it is meeting the network objectives. Subsequent network evaluations will be done very 5 years. (USGS)

Software-Defined Architectures for Spectrally Efficient Cognitive Networking in Extreme Environments

NASA Astrophysics Data System (ADS)

Sklivanitis, Georgios

The objective of this dissertation is the design, development, and experimental evaluation of novel algorithms and reconfigurable radio architectures for spectrally efficient cognitive networking in terrestrial, airborne, and underwater environments. Next-generation wireless communication architectures and networking protocols that maximize spectrum utilization efficiency in congested/contested or low-spectral availability (extreme) communication environments can enable a rich body of applications with unprecedented societal impact. In recent years, underwater wireless networks have attracted significant attention for military and commercial applications including oceanographic data collection, disaster prevention, tactical surveillance, offshore exploration, and pollution monitoring. Unmanned aerial systems that are autonomously networked and fully mobile can assist humans in extreme or difficult-to-reach environments and provide cost-effective wireless connectivity for devices without infrastructure coverage. Cognitive radio (CR) has emerged as a promising technology to maximize spectral efficiency in dynamically changing communication environments by adaptively reconfiguring radio communication parameters. At the same time, the fast developing technology of software-defined radio (SDR) platforms has enabled hardware realization of cognitive radio algorithms for opportunistic spectrum access. However, existing algorithmic designs and protocols for shared spectrum access do not effectively capture the interdependencies between radio parameters at the physical (PHY), medium-access control (MAC), and network (NET) layers of the network protocol stack. In addition, existing off-the-shelf radio platforms and SDR programmable architectures are far from fulfilling runtime adaptation and reconfiguration across PHY, MAC, and NET layers. Spectrum allocation in cognitive networks with multi-hop communication requirements depends on the location, network traffic load, and interference profile at each network node. As a result, the development and implementation of algorithms and cross-layer reconfigurable radio platforms that can jointly treat space, time, and frequency as a unified resource to be dynamically optimized according to inter- and intra-network interference constraints is of fundamental importance. In the next chapters, we present novel algorithmic and software/hardware implementation developments toward the deployment of spectrally efficient terrestrial, airborne, and underwater wireless networks. In Chapter 1 we review the state-of-art in commercially available SDR platforms, describe their software and hardware capabilities, and classify them based on their ability to enable rapid prototyping and advance experimental research in wireless networks. Chapter 2 discusses system design and implementation details toward real-time evaluation of a software-radio platform for all-spectrum cognitive channelization in the presence of narrowband or wideband primary stations. All-spectrum channelization is achieved by designing maximum signal-to-interference-plus-noise ratio (SINR) waveforms that span the whole continuum of the device-accessible spectrum, while satisfying peak power and interference temperature (IT) constraints for the secondary and primary users, respectively. In Chapter 3, we introduce the concept of all-spectrum channelization based on max-SINR optimized sparse-binary waveforms, we propose optimal and suboptimal waveform design algorithms, and evaluate their SINR and bit-error-rate (BER) performance in an SDR testbed. Chapter 4 considers the problem of channel estimation with minimal pilot signaling in multi-cell multi-user multi-input multi-output (MIMO) systems with very large antenna arrays at the base station, and proposes a least-squares (LS)-type algorithm that iteratively extracts channel and data estimates from a short record of data measurements. Our algorithmic developments toward spectrally-efficient cognitive networking through joint optimization of channel access code-waveforms and routes in a multi-hop network are described in Chapter 5. Algorithmic designs are software optimized on heterogeneous multi-core general-purpose processor (GPP)-based SDR architectures by leveraging a novel software-radio framework that offers self-optimization and real-time adaptation capabilities at the PHY, MAC, and NET layers of the network protocol stack. Our system design approach is experimentally validated under realistic conditions in a large-scale hybrid ground-air testbed deployment. Chapter 6 reviews the state-of-art in software and hardware platforms for underwater wireless networking and proposes a software-defined acoustic modem prototype that enables (i) cognitive reconfiguration of PHY/MAC parameters, and (ii) cross-technology communication adaptation. The proposed modem design is evaluated in terms of effective communication data rate in both water tank and lake testbed setups. In Chapter 7, we present a novel receiver configuration for code-waveform-based multiple-access underwater communications. The proposed receiver is fully reconfigurable and executes (i) all-spectrum cognitive channelization, and (ii) combined synchronization, channel estimation, and demodulation. Experimental evaluation in terms of SINR and BER show that all-spectrum channelization is a powerful proposition for underwater communications. At the same time, the proposed receiver design can significantly enhance bandwidth utilization. Finally, in Chapter 8, we focus on challenging practical issues that arise in underwater acoustic sensor network setups where co-located multi-antenna sensor deployment is not feasible due to power, computation, and hardware limitations, and design, implement, and evaluate an underwater receiver structure that accounts for multiple carrier frequency and timing offsets in virtual (distributed) MIMO underwater systems.

A methodology for the efficient integration of transient constraints in the design of aircraft dynamic systems

NASA Astrophysics Data System (ADS)

Phan, Leon L.

The motivation behind this thesis mainly stems from previous work performed at Hispano-Suiza (Safran Group) in the context of the European research project "Power Optimised Aircraft". Extensive testing on the COPPER Bird RTM, a test rig designed to characterize aircraft electrical networks, demonstrated the relevance of transient regimes in the design and development of dynamic systems. Transient regimes experienced by dynamic systems may have severe impacts on the operation of the aircraft. For example, the switching on of a high electrical load might cause a network voltage drop inducing a loss of power available to critical aircraft systems. These transient behaviors are thus often regulated by dynamic constraints, requiring the dynamic signals to remain within bounds whose values vary with time. The verification of these peculiar types of constraints, which generally requires high-fidelity time-domain simulation, intervenes late in the system development process, thus potentially causing costly design iterations. The research objective of this thesis is to develop a methodology that integrates the verification of dynamic constraints in the early specification of dynamic systems. In order to circumvent the inefficiencies of time-domain simulation, multivariate dynamic surrogate models of the original time-domain simulation models are generated, building on a nonlinear system identification technique using wavelet neural networks (or wavenets), which allow the multiscale nature of transient signals to be captured. However, training multivariate wavenets can become computationally prohibitive as the number of design variables increases. Therefore, an alternate approach is formulated, in which dynamic surrogate models using sigmoid-based neural networks are used to emulate the transient behavior of the envelopes of the time-domain response. Thus, in order to train the neural network, the envelopes are extracted by first separating the scales of the dynamic response, using a multiresolution analysis (MRA) based on the discrete wavelet transform. The MRA separates the dynamic response into a trend and a noise signal (ripple). The envelope of the noise is then computed with a windowing method, and recombined with the trend in order to reconstruct the global envelope of the dynamic response. The run-time efficiency of the resulting dynamic surrogate models enable the implementation of a data farming approach, in which a Monte-Carlo simulation generates time-domain behaviors of transient responses for a vast set of design and operation scenarios spanning the design and operation space. An interactive visualization environment, enabling what-if analyses, will be developed; the user can thereby instantaneously comprehend the transient response of the system (or its envelope) and its sensitivities to design and operation variables, as well as filter the design space to have it exhibit only the design scenarios verifying the dynamic constraints. The proposed methodology, along with its foundational hypotheses, are tested on the design and optimization of a 350VDC network, where a generator and its control system are concurrently designed in order to minimize the electrical losses, while ensuring that the transient undervoltage induced by peak demands in the consumption of a motor does not violate transient power quality constraints.

State feedback controller design for the synchronization of Boolean networks with time delays

NASA Astrophysics Data System (ADS)

Li, Fangfei; Li, Jianning; Shen, Lijuan

2018-01-01

State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure.

A qualitative study exploring the acceptability of the McNulty-Zelen design for randomised controlled trials evaluating educational interventions.

PubMed

McNulty, Cliodna; Ricketts, Ellie J; Rugman, Claire; Hogan, Angela; Charlett, Andre; Campbell, Rona

2015-11-17

Traditional randomised controlled trials evaluating the effect of educational interventions in general practice may produce biased results as participants know they are being evaluated. We aimed to explore the acceptability of a McNulty-Zelen Cluster Randomised Control Trial (CRT) design which conceals from educational participants that they are in a RCT. Consent is obtained from a trusted third party considered appropriate to give consent on participants' behalf, intervention practice staff then choose whether to attend the offered education as would occur with normal continuing professional development. We undertook semi structured telephone interviews in England with 16 general practice (GP) staff involved in a RCT evaluating an educational intervention aimed at increasing chlamydia screening tests in general practice using the McNulty-Zelen design, 4 Primary Care (PC) Research Network officers, 5 Primary Care Trust leads in Public or sexual health, and one Research Ethics committee Chair. Interviews were undertaken by members of the original intervention evaluation McNulty-Zelen design RCT study team. These experienced qualitative interviewers used an agreed semi-structured interview schedule and were careful not to lead the participants. To further mitigate against bias, the data analysis was undertaken by a researcher (CR) not involved in the original RCT. We reached data saturation and found five main themes; Support for the design: All found the McNulty-Zelen design acceptable because they considered that it generated more reliable evidence of the value of new educational interventions in real life GP settings. Lack of familiarity with study design: The design was novel to all. GP staff likened the evaluation using the McNulty-Zelen design to audit of their activities with feedback, which were to them a daily experience and therefore acceptable. Ethical considerations: Research stakeholders considered the consent procedure should be very clear and that these trial designs should go through at least a proportionate ethical review. GP staff were happy for the PCT leads to give consent on their behalf. GP research capacity and trial participation: GP staff considered the design increased generalisability, as staff who would not normally volunteer to participate in research due to perceived time constraints and paperwork might do so. Design 'worth it': All interviewees agreed that the advantages of the "more accurate" or "truer" results and information gained about uptake of workshops within Primary Care Trusts (PCTs) outweighed any disadvantages of the consent procedure. Our RCT was evaluating the effect of an educational intervention to increase chlamydia screening tests in general practices where there was routine monitoring of testing rates; our participants may have been less enthusiastic about the design if it had been evaluating a more controversial educational area, or if data monitoring was not routine. The McNulty-Zelen design should be considered for the evaluation of educational interventions, but these designs should have clear consent protocols and proportionate ethical review. The trial was registered on the UK Clinical Research Network Study Portfolio database. UKCRN9722 .

Engineering a Functional Small RNA Negative Autoregulation Network with Model-Guided Design.

PubMed

Hu, Chelsea Y; Takahashi, Melissa K; Zhang, Yan; Lucks, Julius B

2018-05-22

RNA regulators are powerful components of the synthetic biology toolbox. Here, we expand the repertoire of synthetic gene networks built from these regulators by constructing a transcriptional negative autoregulation (NAR) network out of small RNAs (sRNAs). NAR network motifs are core motifs of natural genetic networks, and are known for reducing network response time and steady state signal. Here we use cell-free transcription-translation (TX-TL) reactions and a computational model to design and prototype sRNA NAR constructs. Using parameter sensitivity analysis, we design a simple set of experiments that allow us to accurately predict NAR function in TX-TL. We transfer successful network designs into Escherichia coli and show that our sRNA transcriptional network reduces both network response time and steady-state gene expression. This work broadens our ability to construct increasingly sophisticated RNA genetic networks with predictable function.

GMPLS-based control plane for optical networks: early implementation experience

NASA Astrophysics Data System (ADS)

Liu, Hang; Pendarakis, Dimitrios; Komaee, Nooshin; Saha, Debanjan

2002-07-01

Generalized Multi-Protocol Label Switching (GMPLS) extends MPLS signaling and Internet routing protocols to provide a scalable, interoperable, distributed control plane, which is applicable to multiple network technologies such as optical cross connects (OXCs), photonic switches, IP routers, ATM switches, SONET and DWDM systems. It is intended to facilitate automatic service provisioning and dynamic neighbor and topology discovery across multi-vendor intelligent transport networks, as well as their clients. Efforts to standardize such a distributed common control plane have reached various stages in several bodies such as the IETF, ITU and OIF. This paper describes the design considerations and architecture of a GMPLS-based control plane that we have prototyped for core optical networks. Functional components of GMPLS signaling and routing are integrated in this architecture with an application layer controller module. Various requirements including bandwidth, network protection and survivability, traffic engineering, optimal utilization of network resources, and etc. are taken into consideration during path computation and provisioning. Initial experiments with our prototype demonstrate the feasibility and main benefits of GMPLS as a distributed control plane for core optical networks. In addition to such feasibility results, actual adoption and deployment of GMPLS as a common control plane for intelligent transport networks will depend on the successful completion of relevant standardization activities, extensive interoperability testing as well as the strengthening of appropriate business drivers.

Applying thermosettable zwitterionic copolymers as general fouling-resistant and thermal-tolerant biomaterial interfaces.

PubMed

Chou, Ying-Nien; Chang, Yung; Wen, Ten-Chin

2015-05-20

We introduced a thermosettable zwitterionic copolymer to design a high temperature tolerance biomaterial as a general antifouling polymer interface. The original synthetic fouling-resistant copolymer, poly(vinylpyrrolidone)-co-poly(sulfobetaine methacrylate) (poly(VP-co-SBMA)), is both thermal-tolerant and fouling-resistant, and the antifouling stability of copolymer coated interfaces can be effectively controlled by regulating the VP/SBMA composition ratio. We studied poly(VP-co-SBMA) copolymer gels and networks with a focus on their general resistance to protein, cell, and bacterial bioadhesion, as influenced by the thermosetting process. Interestingly, we found that the shape of the poly(VP-co-SBMA) copolymer material can be set at a high annealing temperature of 200 °C while maintaining good antifouling properties. However, while the zwitterionic PSBMA polymer gels were bioinert as expected, control of the fouling resistance of the PSBMA polymer networks was lost in the high temperature annealing process. A poly(VP-co-SBMA) copolymer network composed of PSBMA segments at 32 mol % showed reduced fibrinogen adsorption, tissue cell adhesion, and bacterial attachment, but a relatively higher PSBMA content of 61 mol % was required to optimize resistance to platelet adhesion and erythrocyte attachment to confer hemocompatibility to human blood. We suggest that poly(VP-co-SBMA) copolymers capable of retaining stable fouling resistance after high temperature shaping have a potential application as thermosettable materials in a bioinert interface for medical devices, such as the thermosettable coating on a stainless steel blood-compatible metal stent investigated in this study.

Review of Recent Methodological Developments in Group-Randomized Trials: Part 2-Analysis.

PubMed

Turner, Elizabeth L; Prague, Melanie; Gallis, John A; Li, Fan; Murray, David M

2017-07-01

In 2004, Murray et al. reviewed methodological developments in the design and analysis of group-randomized trials (GRTs). We have updated that review with developments in analysis of the past 13 years, with a companion article to focus on developments in design. We discuss developments in the topics of the earlier review (e.g., methods for parallel-arm GRTs, individually randomized group-treatment trials, and missing data) and in new topics, including methods to account for multiple-level clustering and alternative estimation methods (e.g., augmented generalized estimating equations, targeted maximum likelihood, and quadratic inference functions). In addition, we describe developments in analysis of alternative group designs (including stepped-wedge GRTs, network-randomized trials, and pseudocluster randomized trials), which require clustering to be accounted for in their design and analysis.

A Typology to Explain Changing Social Networks Post Stroke.

PubMed

Northcott, Sarah; Hirani, Shashivadan P; Hilari, Katerina

2018-05-08

Social network typologies have been used to classify the general population but have not previously been applied to the stroke population. This study investigated whether social network types remain stable following a stroke, and if not, why some people shift network type. We used a mixed methods design. Participants were recruited from two acute stroke units. They completed the Stroke Social Network Scale (SSNS) two weeks and six months post stroke and in-depth interviews 8-15 months following the stroke. Qualitative data was analysed using Framework Analysis; k-means cluster analysis was applied to the six-month data set. Eighty-seven participants were recruited, 71 were followed up at six months, and 29 completed in-depth interviews. It was possible to classify all 29 participants into one of the following network types both prestroke and post stroke: diverse; friends-based; family-based; restricted-supported; restricted-unsupported. The main shift that took place post stroke was participants moving out of a diverse network into a family-based one. The friends-based network type was relatively stable. Two network types became more populated post stroke: restricted-unsupported and family-based. Triangulatory evidence was provided by k-means cluster analysis, which produced a cluster solution (for n = 71) with comparable characteristics to the network types derived from qualitative analysis. Following a stroke, a person's social network is vulnerable to change. Explanatory factors for shifting network type included the physical and also psychological impact of having a stroke, as well as the tendency to lose contact with friends rather than family.

Cascade Back-Propagation Learning in Neural Networks

NASA Technical Reports Server (NTRS)

Duong, Tuan A.

2003-01-01

The cascade back-propagation (CBP) algorithm is the basis of a conceptual design for accelerating learning in artificial neural networks. The neural networks would be implemented as analog very-large-scale integrated (VLSI) circuits, and circuits to implement the CBP algorithm would be fabricated on the same VLSI circuit chips with the neural networks. Heretofore, artificial neural networks have learned slowly because it has been necessary to train them via software, for lack of a good on-chip learning technique. The CBP algorithm is an on-chip technique that provides for continuous learning in real time. Artificial neural networks are trained by example: A network is presented with training inputs for which the correct outputs are known, and the algorithm strives to adjust the weights of synaptic connections in the network to make the actual outputs approach the correct outputs. The input data are generally divided into three parts. Two of the parts, called the "training" and "cross-validation" sets, respectively, must be such that the corresponding input/output pairs are known. During training, the cross-validation set enables verification of the status of the input-to-output transformation learned by the network to avoid over-learning. The third part of the data, termed the "test" set, consists of the inputs that are required to be transformed into outputs; this set may or may not include the training set and/or the cross-validation set. Proposed neural-network circuitry for on-chip learning would be divided into two distinct networks; one for training and one for validation. Both networks would share the same synaptic weights.

Optimal cost design of water distribution networks using a decomposition approach

NASA Astrophysics Data System (ADS)

Lee, Ho Min; Yoo, Do Guen; Sadollah, Ali; Kim, Joong Hoon

2016-12-01

Water distribution network decomposition, which is an engineering approach, is adopted to increase the efficiency of obtaining the optimal cost design of a water distribution network using an optimization algorithm. This study applied the source tracing tool in EPANET, which is a hydraulic and water quality analysis model, to the decomposition of a network to improve the efficiency of the optimal design process. The proposed approach was tested by carrying out the optimal cost design of two water distribution networks, and the results were compared with other optimal cost designs derived from previously proposed optimization algorithms. The proposed decomposition approach using the source tracing technique enables the efficient decomposition of an actual large-scale network, and the results can be combined with the optimal cost design process using an optimization algorithm. This proves that the final design in this study is better than those obtained with other previously proposed optimization algorithms.

Method for Constructing Composite Response Surfaces by Combining Neural Networks with other Interpolation or Estimation Techniques

NASA Technical Reports Server (NTRS)

Rai, Man Mohan (Inventor); Madavan, Nateri K. (Inventor)

2003-01-01

A method and system for design optimization that incorporates the advantages of both traditional response surface methodology (RSM) and neural networks is disclosed. The present invention employs a unique strategy called parameter-based partitioning of the given design space. In the design procedure, a sequence of composite response surfaces based on both neural networks and polynomial fits is used to traverse the design space to identify an optimal solution. The composite response surface has both the power of neural networks and the economy of low-order polynomials (in terms of the number of simulations needed and the network training requirements). The present invention handles design problems with many more parameters than would be possible using neural networks alone and permits a designer to rapidly perform a variety of trade-off studies before arriving at the final design.

78 FR 75442 - Designation of the Primary Freight Network

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-11

...] Designation of the Primary Freight Network AGENCY: Federal Highway Administration (FHWA), DOT. ACTION: Notice... period for the Designation of the highway Primary Freight Network (PFN) notice, which was published on... the complete National Freight Network (NFN), and to solicit comments on aspects of the NFN. The five...

Family networks and health among Métis aged 45 or older.

PubMed

Ramage-Morin, Pamela L; Bougie, Evelyne

2017-12-20

Social networks are important for promoting and maintaining health and well-being. Social networks, including family and friendship ties, are sources of emotional, practical and other support that enhance social participation and help combat isolation and loneliness. Aboriginal seniors have been identified as a population at risk of social isolation. The data are from the 2012 Aboriginal Peoples Survey, a national survey of First Nations people living off reserve, Métis, and Inuit. Frequencies, cross-tabulations, and logistic regression models were used to look at family networks and self-perceived general and mental health among Métis aged 45 or older. An estimated 48% of Métis men and 60% of Métis women aged 45 or older had strong family networks. Older age, lower education, and non-participation in the labour force were associated with strong networks. Métis men and women with strong family networks had higher odds than did those with weak networks of reporting positive mental health, even when potential confounders were taken into account. Among Métis men, a relationship between strong family networks and positive general health was also observed. Strong family networks are associated with positive self-perceived general and mental health among Métis adults. In addition to individual behaviours, family well-being is important for general health promotion.

Association of Structural Global Brain Network Properties with Intelligence in Normal Aging

PubMed Central

Fischer, Florian U.; Wolf, Dominik; Scheurich, Armin; Fellgiebel, Andreas

2014-01-01

Higher general intelligence attenuates age-associated cognitive decline and the risk of dementia. Thus, intelligence has been associated with cognitive reserve or resilience in normal aging. Neurophysiologically, intelligence is considered as a complex capacity that is dependent on a global cognitive network rather than isolated brain areas. An association of structural as well as functional brain network characteristics with intelligence has already been reported in young adults. We investigated the relationship between global structural brain network properties, general intelligence and age in a group of 43 cognitively healthy elderly, age 60–85 years. Individuals were assessed cross-sectionally using Wechsler Adult Intelligence Scale-Revised (WAIS-R) and diffusion-tensor imaging. Structural brain networks were reconstructed individually using deterministic tractography, global network properties (global efficiency, mean shortest path length, and clustering coefficient) were determined by graph theory and correlated to intelligence scores within both age groups. Network properties were significantly correlated to age, whereas no significant correlation to WAIS-R was observed. However, in a subgroup of 15 individuals aged 75 and above, the network properties were significantly correlated to WAIS-R. Our findings suggest that general intelligence and global properties of structural brain networks may not be generally associated in cognitively healthy elderly. However, we provide first evidence of an association between global structural brain network properties and general intelligence in advanced elderly. Intelligence might be affected by age-associated network deterioration only if a certain threshold of structural degeneration is exceeded. Thus, age-associated brain structural changes seem to be partially compensated by the network and the range of this compensation might be a surrogate of cognitive reserve or brain resilience. PMID:24465994

Activation of professional and personal network relations when experiencing a symptom: a population-based cross-sectional study

PubMed Central

Elnegaard, Sandra; Andersen, Rikke Sand; Pedersen, Anette Fischer; Jarbøl, Dorte Ejg

2017-01-01

Objective To describe patterns of disclosure of symptoms experienced among people in the general population to persons in their personal and/or professional network. Design A population-based cross-sectional study. Data were collected from a web-based survey. Setting The general population in Denmark. Participants 100 000 individuals randomly selected, representative of the adult Danish population aged ≥20 years were invited. Approximately 5% were not eligible for inclusion. 49 706 (men=23 240; women=26 466) of 95 253 eligible individuals completed the questionnaire; yielding a response rate of 52.2%. Individuals completing all questions regarding social network relations form the study base (n=44 313). Primary and secondary outcome measures Activation of personal and/or professional relations when experiencing a symptom. Results The 44 313 individuals reported in total 260 079 symptom experiences within the last 4 weeks. No professional network relation was used in two-thirds of all reported symptoms. The general practitioner (GP) was the most frequently reported professional relation activated (22.5%). People reporting to have available personal relations were slightly less inclined to contact the GP (21.9%) when experiencing a symptom compared with people with no reported personal relations (26.8%). The most commonly activated personal relations were spouse/partner (56.4%) and friend (19.6%). More than a quarter of all reported symptom experiences was not shared with anyone, personal nor professional. The symptom experiences with the lowest frequency of network activation were symptoms such as black stool, constipation, change in stool texture and frequent urination. Conclusion This study emphasises variation in the activation of network relations when experiencing a symptom. Symptoms were shared with both personal and professional relations, but different patterns of disclosures were discovered. For symptoms derived from the urogenital or colorectal region, the use of both personal and professional relations was relatively small, which might indicate reticence to involve other people when experiencing symptoms of that nature. PMID:29038185

Rapid Sampling of Hydrogen Bond Networks for Computational Protein Design.

PubMed

Maguire, Jack B; Boyken, Scott E; Baker, David; Kuhlman, Brian

2018-05-08

Hydrogen bond networks play a critical role in determining the stability and specificity of biomolecular complexes, and the ability to design such networks is important for engineering novel structures, interactions, and enzymes. One key feature of hydrogen bond networks that makes them difficult to rationally engineer is that they are highly cooperative and are not energetically favorable until the hydrogen bonding potential has been satisfied for all buried polar groups in the network. Existing computational methods for protein design are ill-equipped for creating these highly cooperative networks because they rely on energy functions and sampling strategies that are focused on pairwise interactions. To enable the design of complex hydrogen bond networks, we have developed a new sampling protocol in the molecular modeling program Rosetta that explicitly searches for sets of amino acid mutations that can form self-contained hydrogen bond networks. For a given set of designable residues, the protocol often identifies many alternative sets of mutations/networks, and we show that it can readily be applied to large sets of residues at protein-protein interfaces or in the interior of proteins. The protocol builds on a recently developed method in Rosetta for designing hydrogen bond networks that has been experimentally validated for small symmetric systems but was not extensible to many larger protein structures and complexes. The sampling protocol we describe here not only recapitulates previously validated designs with performance improvements but also yields viable hydrogen bond networks for cases where the previous method fails, such as the design of large, asymmetric interfaces relevant to engineering protein-based therapeutics.

UAV Swarm Tactics: An Agent-Based Simulation and Markov Process Analysis

DTIC Science & Technology

2013-06-01

CRN Common Random Numbers CSV Comma Separated Values DoE Design of Experiment GLM Generalized Linear Model HVT High Value Target JAR Java ARchive JMF... Java Media Framework JRE Java runtime environment Mason Multi-Agent Simulator Of Networks MOE Measure Of Effectiveness MOP Measures Of Performance...with every set several times, and to write a CSV file with the results. Rather than scripting the agent behavior deterministically, the agents should

Supercomputing '91; Proceedings of the 4th Annual Conference on High Performance Computing, Albuquerque, NM, Nov. 18-22, 1991

NASA Technical Reports Server (NTRS)

1991-01-01

Various papers on supercomputing are presented. The general topics addressed include: program analysis/data dependence, memory access, distributed memory code generation, numerical algorithms, supercomputer benchmarks, latency tolerance, parallel programming, applications, processor design, networks, performance tools, mapping and scheduling, characterization affecting performance, parallelism packaging, computing climate change, combinatorial algorithms, hardware and software performance issues, system issues. (No individual items are abstracted in this volume)

Application of artificial neural networks to the design optimization of aerospace structural components

NASA Technical Reports Server (NTRS)

Berke, Laszlo; Patnaik, Surya N.; Murthy, Pappu L. N.

1993-01-01

The application of artificial neural networks to capture structural design expertise is demonstrated. The principal advantage of a trained neural network is that it requires trivial computational effort to produce an acceptable new design. For the class of problems addressed, the development of a conventional expert system would be extremely difficult. In the present effort, a structural optimization code with multiple nonlinear programming algorithms and an artificial neural network code NETS were used. A set of optimum designs for a ring and two aircraft wings for static and dynamic constraints were generated by using the optimization codes. The optimum design data were processed to obtain input and output pairs, which were used to develop a trained artificial neural network with the code NETS. Optimum designs for new design conditions were predicted by using the trained network. Neural net prediction of optimum designs was found to be satisfactory for most of the output design parameters. However, results from the present study indicate that caution must be exercised to ensure that all design variables are within selected error bounds.

Optimum Design of Aerospace Structural Components Using Neural Networks

NASA Technical Reports Server (NTRS)

Berke, L.; Patnaik, S. N.; Murthy, P. L. N.

1993-01-01

The application of artificial neural networks to capture structural design expertise is demonstrated. The principal advantage of a trained neural network is that it requires a trivial computational effort to produce an acceptable new design. For the class of problems addressed, the development of a conventional expert system would be extremely difficult. In the present effort, a structural optimization code with multiple nonlinear programming algorithms and an artificial neural network code NETS were used. A set of optimum designs for a ring and two aircraft wings for static and dynamic constraints were generated using the optimization codes. The optimum design data were processed to obtain input and output pairs, which were used to develop a trained artificial neural network using the code NETS. Optimum designs for new design conditions were predicted using the trained network. Neural net prediction of optimum designs was found to be satisfactory for the majority of the output design parameters. However, results from the present study indicate that caution must be exercised to ensure that all design variables are within selected error bounds.

Neural-Network Computer Transforms Coordinates

NASA Technical Reports Server (NTRS)

Josin, Gary M.

1990-01-01

Numerical simulation demonstrated ability of conceptual neural-network computer to generalize what it has "learned" from few examples. Ability to generalize achieved with even simple neural network (relatively few neurons) and after exposure of network to only few "training" examples. Ability to obtain fairly accurate mappings after only few training examples used to provide solutions to otherwise intractable mapping problems.

Enabling parallel simulation of large-scale HPC network systems

DOE PAGES

Mubarak, Misbah; Carothers, Christopher D.; Ross, Robert B.; ...

2016-04-07

Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks usedmore » in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations« less

Enabling parallel simulation of large-scale HPC network systems

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

Mubarak, Misbah; Carothers, Christopher D.; Ross, Robert B.

Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks usedmore » in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations« less

MaROS Strategic Relay Planning and Coordination Interfaces

NASA Technical Reports Server (NTRS)

Allard, Daniel A.

2010-01-01

The Mars Relay Operations Service (MaROS) is designed to provide planning and analysis tools in support of ongoing Mars Network relay operations. Strategic relay planning requires coordination between lander and orbiter mission ground data system (GDS) teams to schedule and execute relay communications passes. MaROS centralizes this process, correlating all data relevant to relay coordination to provide a cohesive picture of the relay state. Service users interact with the system through thin-layer command line and web user interface client applications. Users provide and utilize data such as lander view periods of orbiters, Deep Space Network (DSN) antenna tracks, and reports of relay pass performance. Users upload and download relevant relay data via formally defined and documented file structures including some described in Extensible Markup Language (XML). Clients interface with the system via an http-based Representational State Transfer (ReST) pattern using Javascript Object Notation (JSON) formats. This paper will provide a general overview of the service architecture and detail the software interfaces and considerations for interface design.

Distributed adaptive neural network control for a class of heterogeneous nonlinear multi-agent systems subject to actuation failures

NASA Astrophysics Data System (ADS)

Cui, Bing; Zhao, Chunhui; Ma, Tiedong; Feng, Chi

2017-02-01

In this paper, the cooperative adaptive consensus tracking problem for heterogeneous nonlinear multi-agent systems on directed graph is addressed. Each follower is modelled as a general nonlinear system with the unknown and nonidentical nonlinear dynamics, disturbances and actuator failures. Cooperative fault tolerant neural network tracking controllers with online adaptive learning features are proposed to guarantee that all agents synchronise to the trajectory of one leader with bounded adjustable synchronisation errors. With the help of linear quadratic regulator-based optimal design, a graph-dependent Lyapunov proof provides error bounds that depend on the graph topology, one virtual matrix and some design parameters. Of particular interest is that if the control gain is selected appropriately, the proposed control scheme can be implemented in a unified framework no matter whether there are faults or not. Furthermore, the fault detection and isolation are not needed to implement. Finally, a simulation is given to verify the effectiveness of the proposed method.

Using turbidity for designing water networks.

PubMed

Castaño, J A; Higuita, J C

2016-05-01

Some methods to design water networks with minimum fresh water consumption are based on the selection of a key contaminant. In most of these "single contaminant methods", a maximum allowable concentration of contaminants must be established in water demands and water sources. Turbidity is not a contaminant concentration but is a property that represents the "sum" of other contaminants, with the advantage that it can be cheaper and easily measured than biological oxygen demand, chemical oxygen demand, suspended solids, dissolved solids, among others. The objective of this paper is to demonstrate that turbidity can be used directly in the design of water networks just like any other contaminant concentration. A mathematical demonstration is presented and in order to validate the mathematical results, the design of a water network for a guava fudge production process is performed. The material recovery pinch diagram and nearest neighbors algorithm were used for the design of the water network. Nevertheless, this water network could be designed using other single contaminant methodologies. The maximum error between the expected and the real turbidity values in the water network was 3.3%. These results corroborate the usefulness of turbidity in the design of water networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Boosted ARTMAP: modifications to fuzzy ARTMAP motivated by boosting theory.

PubMed

Verzi, Stephen J; Heileman, Gregory L; Georgiopoulos, Michael

2006-05-01

In this paper, several modifications to the Fuzzy ARTMAP neural network architecture are proposed for conducting classification in complex, possibly noisy, environments. The goal of these modifications is to improve upon the generalization performance of Fuzzy ART-based neural networks, such as Fuzzy ARTMAP, in these situations. One of the major difficulties of employing Fuzzy ARTMAP on such learning problems involves over-fitting of the training data. Structural risk minimization is a machine-learning framework that addresses the issue of over-fitting by providing a backbone for analysis as well as an impetus for the design of better learning algorithms. The theory of structural risk minimization reveals a trade-off between training error and classifier complexity in reducing generalization error, which will be exploited in the learning algorithms proposed in this paper. Boosted ART extends Fuzzy ART by allowing the spatial extent of each cluster formed to be adjusted independently. Boosted ARTMAP generalizes upon Fuzzy ARTMAP by allowing non-zero training error in an effort to reduce the hypothesis complexity and hence improve overall generalization performance. Although Boosted ARTMAP is strictly speaking not a boosting algorithm, the changes it encompasses were motivated by the goals that one strives to achieve when employing boosting. Boosted ARTMAP is an on-line learner, it does not require excessive parameter tuning to operate, and it reduces precisely to Fuzzy ARTMAP for particular parameter values. Another architecture described in this paper is Structural Boosted ARTMAP, which uses both Boosted ART and Boosted ARTMAP to perform structural risk minimization learning. Structural Boosted ARTMAP will allow comparison of the capabilities of off-line versus on-line learning as well as empirical risk minimization versus structural risk minimization using Fuzzy ARTMAP-based neural network architectures. Both empirical and theoretical results are presented to enhance the understanding of these architectures.

Digital optical computers at the optoelectronic computing systems center

NASA Technical Reports Server (NTRS)

Jordan, Harry F.

1991-01-01

The Digital Optical Computing Program within the National Science Foundation Engineering Research Center for Opto-electronic Computing Systems has as its specific goal research on optical computing architectures suitable for use at the highest possible speeds. The program can be targeted toward exploiting the time domain because other programs in the Center are pursuing research on parallel optical systems, exploiting optical interconnection and optical devices and materials. Using a general purpose computing architecture as the focus, we are developing design techniques, tools and architecture for operation at the speed of light limit. Experimental work is being done with the somewhat low speed components currently available but with architectures which will scale up in speed as faster devices are developed. The design algorithms and tools developed for a general purpose, stored program computer are being applied to other systems such as optimally controlled optical communication networks.

Multidisciplinary Design Optimization for Aeropropulsion Engines and Solid Modeling/Animation via the Integrated Forced Methods

NASA Technical Reports Server (NTRS)

2004-01-01

The grant closure report is organized in the following four chapters: Chapter describes the two research areas Design optimization and Solid mechanics. Ten journal publications are listed in the second chapter. Five highlights is the subject matter of chapter three. CHAPTER 1. The Design Optimization Test Bed CometBoards. CHAPTER 2. Solid Mechanics: Integrated Force Method of Analysis. CHAPTER 3. Five Highlights: Neural Network and Regression Methods Demonstrated in the Design Optimization of a Subsonic Aircraft. Neural Network and Regression Soft Model Extended for PX-300 Aircraft Engine. Engine with Regression and Neural Network Approximators Designed. Cascade Optimization Strategy with Neural network and Regression Approximations Demonstrated on a Preliminary Aircraft Engine Design. Neural Network and Regression Approximations Used in Aircraft Design.

Nationwide SIP Telephony Network Design to Prevent Congestion Caused by Disaster

NASA Astrophysics Data System (ADS)

Satoh, Daisuke; Ashitagawa, Kyoko

We present a session initiation protocol (SIP) network design for a voice-over-IP network to prevent congestion caused by people calling friends and family after a disaster. The design increases the capacity of SIP servers in a network by using all of the SIP servers equally. It takes advantage of the fact that equipment for voice data packets is different from equipment for signaling packets in SIP networks. Furthermore, the design achieves simple routing on the basis of telephone numbers. We evaluated the performance of our design in preventing congestion through simulation. We showed that the proposed design has roughly 20 times more capacity, which is 57 times the normal load, than the conventional design if a disaster were to occur in Niigata Prefecture struck by the Chuetsu earthquake in 2004.

Optical design of transmitter lens for asymmetric distributed free space optical networks

NASA Astrophysics Data System (ADS)

Wojtanowski, Jacek; Traczyk, Maciej

2018-05-01

We present a method of transmitter lens design dedicated for light distribution shaping on a curved and asymmetric target. In this context, target is understood as a surface determined by hypothetical optical detectors locations. In the proposed method, ribbon-like surfaces of arbitrary shape are considered. The designed lens has the task to transform collimated and generally non-uniform input beam into desired irradiance distribution on such irregular targets. Desired irradiance is associated with space-dependant efficiency of power flow between the source and receivers distributed on the target surface. This unconventional nonimaging task is different from most illumination or beam shaping objectives, where constant or prescribed irradiance has to be produced on a flat target screen. The discussed optical challenge comes from the applications where single transmitter cooperates with multitude of receivers located in various positions in space and oriented in various directions. The proposed approach is not limited to optical networks, but can be applied in a variety of other applications where nonconventional irradiance distribution has to be engineered. The described method of lens design is based on geometrical optics, radiometry and ray mapping philosophy. Rays are processed as a vector field, each of them carrying a certain amount of power. Having the target surface shape and orientation of receivers distribution, the rays-surface crossings map is calculated. It corresponds to the output rays vector field, which is referred to the calculated input rays spatial distribution on the designed optical surface. The application of Snell's law in a vector form allows one to obtain surface local normal vector and calculate lens profile. In the paper, we also present the case study dealing with exemplary optical network. The designed freeform lens is implemented in commercially available optical design software and irradiance three-dimensional spatial distribution is examined, showing perfect agreement with expectations.

Designing Secure Library Networks.

ERIC Educational Resources Information Center

Breeding, Michael

1997-01-01

Focuses on designing a library network to maximize security. Discusses UNIX and file servers; connectivity to campus, corporate networks and the Internet; separation of staff from public servers; controlling traffic; the threat of network sniffers; hubs that eliminate eavesdropping; dividing the network into subnets; Switched Ethernet;…

Social networks and secondary health conditions: The critical secondary team for individuals with spinal cord injury

PubMed Central

Guilcher, Sara J. T.; Casciaro, Tiziana; Lemieux-Charles, Louise; Craven, Catharine; McColl, Mary Ann; Jaglal, Susan B.

2012-01-01

Objectives To describe the structure of informal networks for individuals with spinal cord injury (SCI) living in the community, to understand the quality of relationship of informal networks, and to understand the role of informal networks in the prevention and management of secondary health conditions (SHCs). Design Mixed-method descriptive study. Setting Ontario, Canada Participants Community-dwelling adults with an SCI living in Ontario Interventions/methods The Arizona Social Support Interview Survey was used to measure social networks. Participants were asked the following open-ended questions: (1) What have been your experiences with your health care in the community? (2) What have been your experiences with care related to prevention and/or management of SHCs?, (3)What has been the role of your informal social networks (friends/family) related to SHCs? Results Fourteen key informant interviews were conducted (6 men, 8 women). The overall median for available informal networks was 11.0 persons (range 3–19). The informal network engaged in the following roles: (1) advice/validating concerns; (2) knowledge brokers; (3) advocacy; (4) preventing SHCs; (5) assisting with finances; and (6) managing SHCs. Participants described their informal networks as a “secondary team”; a critical and essential force in dealing with SHCs. Conclusions While networks are smaller for persons with SCI compared with the general population, these ties seems to be strong, which is essential when the roles involve a level of trust, certainty, tacit knowledge, and flexibility. These informal networks serve as essential key players in filling the gaps that exist within the formal health care system. PMID:23031170

Polarity-specific high-level information propagation in neural networks.

PubMed

Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan

2014-01-01

Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals.

Polarity-specific high-level information propagation in neural networks

PubMed Central

Lin, Yen-Nan; Chang, Po-Yen; Hsiao, Pao-Yueh; Lo, Chung-Chuan

2014-01-01

Analyzing the connectome of a nervous system provides valuable information about the functions of its subsystems. Although much has been learned about the architectures of neural networks in various organisms by applying analytical tools developed for general networks, two distinct and functionally important properties of neural networks are often overlooked. First, neural networks are endowed with polarity at the circuit level: Information enters a neural network at input neurons, propagates through interneurons, and leaves via output neurons. Second, many functions of nervous systems are implemented by signal propagation through high-level pathways involving multiple and often recurrent connections rather than by the shortest paths between nodes. In the present study, we analyzed two neural networks: the somatic nervous system of Caenorhabditis elegans (C. elegans) and the partial central complex network of Drosophila, in light of these properties. Specifically, we quantified high-level propagation in the vertical and horizontal directions: the former characterizes how signals propagate from specific input nodes to specific output nodes and the latter characterizes how a signal from a specific input node is shared by all output nodes. We found that the two neural networks are characterized by very efficient vertical and horizontal propagation. In comparison, classic small-world networks show a trade-off between vertical and horizontal propagation; increasing the rewiring probability improves the efficiency of horizontal propagation but worsens the efficiency of vertical propagation. Our result provides insights into how the complex functions of natural neural networks may arise from a design that allows them to efficiently transform and combine input signals. PMID:24672472

Measuring the impact of practice-based research networks on member dentists in the Collaboration on Networked Dental and Oral Health Research, CONDOR.

PubMed

McBride, Ruth; Leroux, Brian; Lindblad, Anne; Williams, O Dale; Lehmann, Maryann; Rindal, D Brad; Botello-Harbaum, Maria; Gilbert, Gregg H; Gillette, Jane; Demko, Catherine

2013-05-01

The National Institute of Dental and Craniofacial Research funded three practice-based research networks (PBRNs), NW-PRECEDENT, PEARL and DPBRN to conduct studies relevant to practicing general dentists. These PBRNs collaborated to develop a questionnaire to assess the impact of network participation on changes in practice patterns. This report presents results from the initial administration of the questionnaire. Questionnaires were administered to network dentists and a non-network reference group. Practice patterns including caries diagnosis and treatment, pulp cap materials, third molar extraction, dentine hypersensitivity treatments and endodontic treatment and restoration were assessed by network, years in practice, and level of network participation. Test-retest reliability of the questionnaire was evaluated. 950 practitioners completed the questionnaire. Test-retest reliability was good-excellent (kappa>0.4) for most questions. Significant differences in responses by network were not observed. The use of caries risk assessment forms differed by both network participation (p<0.001) and years since dental degree (p=0.026). Recent dental graduates are more likely to recommend third molar removal for preventive reasons (p=0.003). Practitioners in the CONDOR research networks are similar to their US colleagues. As a group, however, these practitioners show a more evidence-based approach to their practice. Dental PBRNs have the potential to improve the translation of evidence into daily practice. Designing methods to assess practice change and the associated factors is essential to addressing this important issue. Copyright © 2013 Elsevier Ltd. All rights reserved.

Constructing fine-granularity functional brain network atlases via deep convolutional autoencoder.

PubMed

Zhao, Yu; Dong, Qinglin; Chen, Hanbo; Iraji, Armin; Li, Yujie; Makkie, Milad; Kou, Zhifeng; Liu, Tianming

2017-12-01

State-of-the-art functional brain network reconstruction methods such as independent component analysis (ICA) or sparse coding of whole-brain fMRI data can effectively infer many thousands of volumetric brain network maps from a large number of human brains. However, due to the variability of individual brain networks and the large scale of such networks needed for statistically meaningful group-level analysis, it is still a challenging and open problem to derive group-wise common networks as network atlases. Inspired by the superior spatial pattern description ability of the deep convolutional neural networks (CNNs), a novel deep 3D convolutional autoencoder (CAE) network is designed here to extract spatial brain network features effectively, based on which an Apache Spark enabled computational framework is developed for fast clustering of larger number of network maps into fine-granularity atlases. To evaluate this framework, 10 resting state networks (RSNs) were manually labeled from the sparsely decomposed networks of Human Connectome Project (HCP) fMRI data and 5275 network training samples were obtained, in total. Then the deep CAE models are trained by these functional networks' spatial maps, and the learned features are used to refine the original 10 RSNs into 17 network atlases that possess fine-granularity functional network patterns. Interestingly, it turned out that some manually mislabeled outliers in training networks can be corrected by the deep CAE derived features. More importantly, fine granularities of networks can be identified and they reveal unique network patterns specific to different brain task states. By further applying this method to a dataset of mild traumatic brain injury study, it shows that the technique can effectively identify abnormal small networks in brain injury patients in comparison with controls. In general, our work presents a promising deep learning and big data analysis solution for modeling functional connectomes, with fine granularities, based on fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.

MINE: Module Identification in Networks

PubMed Central

2011-01-01

Background Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of functionally related gene products, is an important challenge in analyzing biological networks. However, existing tools to identify modules are insufficient when applied to dense networks of experimentally derived interaction data. To address this problem, we have developed an agglomerative clustering method that is able to identify highly modular sets of gene products within highly interconnected molecular interaction networks. Results MINE outperforms MCODE, CFinder, NEMO, SPICi, and MCL in identifying non-exclusive, high modularity clusters when applied to the C. elegans protein-protein interaction network. The algorithm generally achieves superior geometric accuracy and modularity for annotated functional categories. In comparison with the most closely related algorithm, MCODE, the top clusters identified by MINE are consistently of higher density and MINE is less likely to designate overlapping modules as a single unit. MINE offers a high level of granularity with a small number of adjustable parameters, enabling users to fine-tune cluster results for input networks with differing topological properties. Conclusions MINE was created in response to the challenge of discovering high quality modules of gene products within highly interconnected biological networks. The algorithm allows a high degree of flexibility and user-customisation of results with few adjustable parameters. MINE outperforms several popular clustering algorithms in identifying modules with high modularity and obtains good overall recall and precision of functional annotations in protein-protein interaction networks from both S. cerevisiae and C. elegans. PMID:21605434